Home
last modified time | relevance | path

Searched +full:codeword +full:- +full:by +full:- +full:codeword (Results 1 – 13 of 13) sorted by relevance

/linux/fs/ntfs3/lib/
H A Ddecompress_common.c1 // SPDX-License-Identifier: GPL-2.0-or-later
3 * decompress_common.c - Code shared by the XPRESS and LZX decompressors
11 * make_huffman_decode_table() -
17 * This takes as input the length of the codeword for each symbol in the
19 * decoding of prefix-encoded symbols using read_huffsym().
28 * reconstructed directly from the codeword lengths. A prefix code is
29 * canonical if and only if a longer codeword never lexicographically
30 * precedes a shorter codeword, and the lexicographic ordering of
33 * primarily by codeword length and secondarily by symbol value, then
34 * reconstruct the prefix code by generating codewords lexicographically
[all …]
H A Dlzx_decompress.c1 // SPDX-License-Identifier: GPL-2.0-or-later
3 * lzx_decompress.c - A decompressor for the LZX compression format, which can
22 #define LZX_NUM_LENS (LZX_MAX_MATCH_LEN - LZX_MIN_MATCH_LEN + 1)
28 /* Valid values of the 3-bit block type field */
41 #define LZX_LENCODE_NUM_SYMBOLS (LZX_NUM_LENS - LZX_NUM_PRIMARY_LENS)
46 /* Number of bits in which each precode codeword length is represented */
49 /* Number of low-order bits of each match offset that are entropy-encoded in
57 /* Mask for the match offset bits that are entropy-encoded in aligned offset
60 #define LZX_ALIGNED_OFFSET_BITMASK ((1 << LZX_NUM_ALIGNED_OFFSET_BITS) - 1)
62 /* Number of bits in which each aligned offset codeword length is represented */
[all …]
H A Ddecompress_common.h1 /* SPDX-License-Identifier: GPL-2.0-or-later */
3 * decompress_common.h - Code shared by the XPRESS and LZX decompressors
21 /* Enable whole-word match copying on selected architectures */
36 /* Generate a "word" with platform-dependent size whose bytes all contain the
50 /* Structure that encapsulates a block of in-memory data being interpreted as a
52 * to be stored in little endian 16-bit coding units, with the bits ordered high
58 * left-justified; the next bit is always bit 31.
76 is->bitbuf = 0; in init_input_bitstream()
77 is->bitsleft = 0; in init_input_bitstream()
78 is->next = buffer; in init_input_bitstream()
[all …]
/linux/drivers/mtd/nand/raw/
H A Dqcom_nandc.c1 // SPDX-License-Identifier: GPL-2.0-only
9 #include <linux/dma-mapping.h>
18 #include <linux/mtd/nand-qpic-common.h>
24 * by ECC (value in pages)
26 * by ECC (value in pages)
67 * protected by ECC
70 * @cw_size: the number of bytes in a single step/codeword
73 * @cw_data: the number of bytes within a codeword protected
74 * by ECC
75 * @ecc_bytes_hw: ECC bytes used by controller hardware for this
[all …]
H A Dnand_onfi.c1 // SPDX-License-Identifier: GPL-2.0
4 * 2002-2006 Thomas Gleixner (tglx@linutronix.de)
24 while (len--) { in onfi_crc16()
37 struct nand_device *base = &chip->base; in nand_flash_detect_ext_param_page()
47 len = le16_to_cpu(p->ext_param_page_length) * 16; in nand_flash_detect_ext_param_page()
50 return -ENOMEM; in nand_flash_detect_ext_param_page()
57 sizeof(*p) * p->num_of_param_pages, in nand_flash_detect_ext_param_page()
62 ret = -EINVAL; in nand_flash_detect_ext_param_page()
63 if ((onfi_crc16(ONFI_CRC_BASE, ((uint8_t *)ep) + 2, len - 2) in nand_flash_detect_ext_param_page()
64 != le16_to_cpu(ep->crc))) { in nand_flash_detect_ext_param_page()
[all …]
/linux/Documentation/devicetree/bindings/misc/
H A Dxlnx,sd-fec.yaml1 # SPDX-License-Identifier: (GPL-2.0 OR BSD-2-Clause)
3 ---
4 $id: http://devicetree.org/schemas/misc/xlnx,sd-fec.yaml#
5 $schema: http://devicetree.org/meta-schemas/core.yaml#
10 - Cvetic, Dragan <dragan.cvetic@amd.com>
11 - Erim, Salih <salih.erim@amd.com>
15 which provides high-throughput LDPC and Turbo Code implementations.
17 customer specified Quasi-cyclic (QC) codes. The Turbo decode functionality
18 principally covers codes used by LTE. The FEC Engine offers significant
23 const: xlnx,sd-fec-1.1
[all …]
/linux/lib/reed_solomon/
H A Dtest_rslib.c1 // SPDX-License-Identifier: GPL-2.0
5 * Written by Ferdinand Blomqvist
6 * Based on previous work by Phil Karn, KA9Q
77 uint16_t *c; /* sent codeword */
103 kfree(ws->errlocs); in free_ws()
104 kfree(ws->c); in free_ws()
110 int nroots = rs->nroots; in alloc_ws()
112 int nn = rs->nn; in alloc_ws()
118 ws->c = kmalloc_array(2 * (nn + nroots), in alloc_ws()
120 if (!ws->c) in alloc_ws()
[all …]
H A Dreed_solomon.c1 // SPDX-License-Identifier: GPL-2.0
7 * Reed Solomon code lifted from reed solomon library written by Phil Karn
17 * It points to a codec which can be shared by multiple control structures.
58 * codec_init - Initialize a Reed-Solomon codec
59 * @symsize: symbol size, bits (1-8)
80 INIT_LIST_HEAD(&rs->list); in codec_init()
82 rs->mm = symsize; in codec_init()
83 rs->nn = (1 << symsize) - 1; in codec_init()
84 rs->fcr = fcr; in codec_init()
85 rs->prim = prim; in codec_init()
[all …]
H A Ddecode_rs.c1 // SPDX-License-Identifier: GPL-2.0
8 * Adaption to the kernel by Thomas Gleixner (tglx@linutronix.de)
10 * Generic data width independent code which is included by the wrappers.
13 struct rs_codec *rs = rsc->codec;
16 int nn = rs->nn;
17 int nroots = rs->nroots;
18 int fcr = rs->fcr;
19 int prim = rs->prim;
20 int iprim = rs->iprim;
21 uint16_t *alpha_to = rs->alpha_to;
[all …]
/linux/drivers/spi/
H A Dspi-qpic-snand.c2 * SPDX-License-Identifier: GPL-2.0
15 #include <linux/dma-mapping.h>
22 #include <linux/mtd/nand-qpic-common.h>
131 snandc->regs->read_location0 = locreg_val; in qcom_spi_set_read_loc_first()
133 snandc->regs->read_location1 = locreg_val; in qcom_spi_set_read_loc_first()
135 snandc->regs->read_location2 = locreg_val; in qcom_spi_set_read_loc_first()
137 snandc->regs->read_location3 = locreg_val; in qcom_spi_set_read_loc_first()
152 snandc->regs->read_location_last0 = locreg_val; in qcom_spi_set_read_loc_last()
154 snandc->regs->read_location_last1 = locreg_val; in qcom_spi_set_read_loc_last()
156 snandc->regs->read_location_last2 = locreg_val; in qcom_spi_set_read_loc_last()
[all …]
/linux/lib/
H A Dbch.c5 * under the terms of the GNU General Public License version 2 as published by
15 * Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
24 * Bose-Chaudhuri-Hocquenghem (BCH) codes.
45 * Encoding is performed by processing 32 input bits in parallel, using 4
50 * b. Error locator polynomial computation using Berlekamp-Massey algorithm
51 * c. Error locator root finding (by far the most expensive step)
56 * (BTA) down to a certain degree (4), after which ad hoc low-degree polynomial
63 * - WEWoRC 2009, Graz, Austria, LNCS, Springer, July 2009, to appear.
81 #define GF_N(_p) ((1 << (CONFIG_BCH_CONST_M))-1)
85 #define GF_M(_p) ((_p)->m)
[all …]
/linux/drivers/edac/
H A Dthunderx_edac.c8 * Copyright Cavium, Inc. (C) 2015-2017. All rights reserved.
50 while (descr->type && descr->mask && descr->descr) { in decode_register()
51 if (reg & descr->mask) { in decode_register()
53 descr->type == ERR_CORRECTED ? in decode_register()
55 descr->descr); in decode_register()
57 size -= ret; in decode_register()
65 return (data >> pos) & ((1 << width) - 1); in get_bits()
121 .descr = "Single-bit ECC error",
131 .descr = "Double-bit ECC error",
136 .descr = "Non-existent memory write",
[all …]
/linux/drivers/net/ethernet/sfc/
H A Dmcdi_pcol.h1 /* SPDX-License-Identifier: GPL-2.0-only */
4 * Copyright 2009-2018 Solarflare Communications Inc.
5 * Copyright 2019-2020 Xilinx Inc.
13 /* Power-on reset state */
35 /* The 'doorbell' addresses are hard-wired to alert the MC when written */
38 /* The rest of these are firmware-defined */
46 /* Values to be written to the per-port status dword in shared
66 * structure, filled in by the client.
71 * | | \--- Response
72 * | \------- Error
[all …]