Searched refs:fast (Results 1 – 6 of 6) sorted by relevance
/lib/math/ |
D | prime_numbers.c | 271 bool fast = is_prime_number(x); in selftest() local 273 if (slow != fast) { in selftest() 275 x, slow ? "yes" : "no", fast ? "yes" : "no"); in selftest()
|
/lib/zstd/compress/ |
D | fse_compress.c | 595 const FSE_CTable* ct, const unsigned fast) in FSE_compress_usingCTable_generic() argument 609 #define FSE_FLUSHBITS(s) (fast ? BIT_flushBitsFast(s) : BIT_flushBits(s)) in FSE_compress_usingCTable_generic() 656 unsigned const fast = (dstSize >= FSE_BLOCKBOUND(srcSize)); in FSE_compress_usingCTable() local 658 if (fast) in FSE_compress_usingCTable()
|
D | huf_compress.c | 892 HUF_encodeSymbol(HUF_CStream_t* bitCPtr, U32 symbol, const HUF_CElt* CTable, int idx, int fast) in HUF_encodeSymbol() argument 894 HUF_addBits(bitCPtr, CTable[symbol], idx, fast); in HUF_encodeSymbol()
|
/lib/zstd/common/ |
D | fse_decompress.c | 234 const FSE_DTable* dt, const unsigned fast) in FSE_decompress_usingDTable_generic() argument 251 #define FSE_GETSYMBOL(statePtr) fast ? FSE_decodeSymbolFast(statePtr, &bitD) : FSE_decodeSymbol(sta… in FSE_decompress_usingDTable_generic()
|
/lib/ |
D | Kconfig | 226 is not particularly fast, but has a small 256 byte lookup table. 640 Enable fast lookup object identifier registry.
|
D | Kconfig.debug | 1143 # hard lockup detection which runs too fast due to turbo modes.
|