Searched refs:symbol (Results 1 – 12 of 12) sorted by relevance
/lib/zstd/compress/ |
A D | fse_compress.c | 157 U32 symbol; in FSE_buildCTable_wksp() local 158 for (symbol=0; symbol<maxSV1; symbol++) { in FSE_buildCTable_wksp() 205 { U32 symbol; in FSE_buildCTable_wksp() 206 for (symbol=0; symbol<=maxSymbolValue; symbol++) { in FSE_buildCTable_wksp() 208 symbol, normalizedCounter[symbol], in FSE_buildCTable_wksp() 248 unsigned symbol = 0; in FSE_writeNCount_generic() local 263 unsigned start = symbol; in FSE_writeNCount_generic() 264 while ((symbol < alphabetSize) && !normalizedCounter[symbol]) symbol++; in FSE_writeNCount_generic() 266 while (symbol >= start+24) { in FSE_writeNCount_generic() 276 while (symbol >= start+3) { in FSE_writeNCount_generic() [all …]
|
A D | huf_compress.c | 983 HUF_encodeSymbol(HUF_CStream_t* bitCPtr, U32 symbol, const HUF_CElt* CTable, int idx, int fast) in HUF_encodeSymbol() argument 985 HUF_addBits(bitCPtr, CTable[symbol], idx, fast); in HUF_encodeSymbol()
|
/lib/zstd/common/ |
A D | fse.h | 301 static void FSE_encodeSymbol(BIT_CStream_t* bitC, FSE_CState_t* CStatePtr, unsigned symbol); 444 MEM_STATIC void FSE_initCState2(FSE_CState_t* statePtr, const FSE_CTable* ct, U32 symbol) in FSE_initCState2() argument 447 …pressionTransform symbolTT = ((const FSE_symbolCompressionTransform*)(statePtr->symbolTT))[symbol]; in FSE_initCState2() 455 MEM_STATIC void FSE_encodeSymbol(BIT_CStream_t* bitC, FSE_CState_t* statePtr, unsigned symbol) in FSE_encodeSymbol() argument 457 …onTransform const symbolTT = ((const FSE_symbolCompressionTransform*)(statePtr->symbolTT))[symbol]; in FSE_encodeSymbol() 514 unsigned char symbol; member 530 return DInfo.symbol; in FSE_peekSymbol() 545 BYTE const symbol = DInfo.symbol; in FSE_decodeSymbol() local 549 return symbol; in FSE_decodeSymbol() 558 BYTE const symbol = DInfo.symbol; in FSE_decodeSymbolFast() local [all …]
|
A D | fse_decompress.c | 83 tableDecode[highThreshold--].symbol = (FSE_FUNCTION_TYPE)s; in FSE_buildDTable_internal() 130 tableDecode[uPosition].symbol = spread[s + u]; in FSE_buildDTable_internal() 143 tableDecode[position].symbol = (FSE_FUNCTION_TYPE)s; in FSE_buildDTable_internal() 153 FSE_FUNCTION_TYPE const symbol = (FSE_FUNCTION_TYPE)(tableDecode[u].symbol); in FSE_buildDTable_internal() local 154 U32 const nextState = symbolNext[symbol]++; in FSE_buildDTable_internal()
|
/lib/xz/ |
A D | xz_dec_lzma2.c | 553 uint32_t symbol = 1; in rc_bittree() local 557 symbol = (symbol << 1) + 1; in rc_bittree() 559 symbol <<= 1; in rc_bittree() 562 return symbol; in rc_bittree() 570 uint32_t symbol = 1; in rc_bittree_reverse() local 575 symbol = (symbol << 1) + 1; in rc_bittree_reverse() 578 symbol <<= 1; in rc_bittree_reverse() 615 uint32_t symbol; in lzma_literal() local 626 symbol = 1; in lzma_literal() 636 symbol = (symbol << 1) + 1; in lzma_literal() [all …]
|
/lib/ |
A D | decompress_unlzma.c | 176 static int INIT rc_get_bit(struct rc *rc, uint16_t *p, int *symbol) in rc_get_bit() argument 180 *symbol *= 2; in rc_get_bit() 184 *symbol = *symbol * 2 + 1; in rc_get_bit() 203 rc_bit_tree_decode(struct rc *rc, uint16_t *p, int num_levels, int *symbol) in rc_bit_tree_decode() argument 207 *symbol = 1; in rc_bit_tree_decode() 209 rc_get_bit(rc, p + *symbol, symbol); in rc_bit_tree_decode() 210 *symbol -= 1 << num_levels; in rc_bit_tree_decode()
|
A D | Kconfig | 303 Drivers should declare a default value for this symbol if 310 Drivers should declare a default value for this symbol if
|
A D | Kconfig.kgdb | 108 0x0002 - allow arbitrary reads from memory and symbol lookup
|
A D | Kconfig.debug | 296 extensions such as accelerators for symbol indexing and the format 593 identify symbols by module name and symbol name regardless of whether 598 It also records an anchor symbol to determine the load address of the 2895 tristate "Test the longest symbol possible" if !KUNIT_ALL_TESTS 2900 Tests the longest symbol possible 3022 one symbol it uses from the module A with tons of symbols. This is an 3027 for each symbol. Binary search will at worst be O(log(n)) so the 3034 That is when we'll force iteration on module C's insane symbol list. 3037 B can give us an idea of the impact growth of the symbol space and 3038 give us projection. Module A only uses one symbol from B so to allow
|
/lib/zstd/decompress/ |
A D | huf_decompress.c | 332 static U64 HUF_DEltX1_set4(BYTE symbol, BYTE nbBits) { in HUF_DEltX1_set4() argument 335 D4 = (U64)((symbol << 8) + nbBits); in HUF_DEltX1_set4() 337 D4 = (U64)(symbol + (nbBits << 8)); in HUF_DEltX1_set4() 453 int symbol = wksp->rankVal[0]; in HUF_readDTableX1_wksp() local 466 D.byte = wksp->symbols[symbol + s]; in HUF_readDTableX1_wksp() 475 D.byte = wksp->symbols[symbol + s]; in HUF_readDTableX1_wksp() 511 symbol += symbolCount; in HUF_readDTableX1_wksp() 951 typedef struct { BYTE symbol; } sortedSymbol_t; member 966 seq = level == 1 ? symbol : (baseSeq + (symbol << 8)); in HUF_buildDEltX2U32() 969 seq = level == 1 ? (symbol << 8) : ((baseSeq << 8) + symbol); in HUF_buildDEltX2U32() [all …]
|
A D | zstd_decompress_block.c | 595 U32 const symbol = tableDecode[u].baseValue; in ZSTD_buildFSETable_body() local 596 U32 const nextState = symbolNext[symbol]++; in ZSTD_buildFSETable_body() 599 assert(nbAdditionalBits[symbol] < 255); in ZSTD_buildFSETable_body() 600 tableDecode[u].nbAdditionalBits = nbAdditionalBits[symbol]; in ZSTD_buildFSETable_body() 601 tableDecode[u].baseValue = baseValue[symbol]; in ZSTD_buildFSETable_body() 661 { U32 const symbol = *(const BYTE*)src; in ZSTD_buildSeqTable() local 662 U32 const baseline = baseValue[symbol]; in ZSTD_buildSeqTable() 663 U8 const nbBits = nbAdditionalBits[symbol]; in ZSTD_buildSeqTable()
|
/lib/crypto/ |
A D | Kconfig | 41 This symbol can be depended upon by arch implementations of the 59 This symbol can be selected by arch implementations of the ChaCha 82 This symbol can be depended upon by arch implementations of the 122 This symbol can be selected by arch implementations of the Poly1305
|
Completed in 33 milliseconds