Home
last modified time | relevance | path

Searched refs:low (Results 1 – 15 of 15) sorted by relevance

/lib/
A Dashldi3.c21 w.s.low = 0; in __ashldi3()
22 w.s.high = (unsigned int) uu.s.low << -bm; in __ashldi3()
24 const unsigned int carries = (unsigned int) uu.s.low >> bm; in __ashldi3()
26 w.s.low = (unsigned int) uu.s.low << b; in __ashldi3()
A Dcmpdi2.c23 if ((unsigned int) au.s.low < (unsigned int) bu.s.low) in __cmpdi2()
25 else if ((unsigned int) au.s.low > (unsigned int) bu.s.low) in __cmpdi2()
A Ducmpdi2.c17 if ((unsigned int) au.s.low < (unsigned int) bu.s.low) in __ucmpdi2()
19 else if ((unsigned int) au.s.low > (unsigned int) bu.s.low) in __ucmpdi2()
A Dmuldi3.c44 umul_ppmm(__w.s.high, __w.s.low, u, v); \
53 DWunion w = {.ll = __umulsidi3(uu.s.low, vv.s.low)}; in __muldi3()
55 w.s.high += ((unsigned long) uu.s.low * (unsigned long) vv.s.high in __muldi3()
56 + (unsigned long) uu.s.high * (unsigned long) vv.s.low); in __muldi3()
A Dlshrdi3.c22 w.s.low = (unsigned int) uu.s.high >> -bm; in __lshrdi3()
27 w.s.low = ((unsigned int) uu.s.low >> b) | carries; in __lshrdi3()
A Dashrdi3.c24 w.s.low = uu.s.high >> -bm; in __ashrdi3()
29 w.s.low = ((unsigned int) uu.s.low >> b) | carries; in __ashrdi3()
A DKconfig.kfence7 bool "KFENCE: low-overhead sampling-based memory safety error detector"
12 KFENCE is a low-overhead sampling-based detector of heap out-of-bounds
A DKconfig.debug453 Setting this too low will cause a lot of warnings.
1024 memory leaks with a low performance and memory impact.
1218 # Enables a timestamp based low pass filter to compensate for perf based
1531 Try increasing this value if you hit "BUG: MAX_LOCKDEP_ENTRIES too low!" message.
1539 Try increasing this value if you hit "BUG: MAX_LOCKDEP_CHAINS too low!" message.
1547 Try increasing this value if you hit "BUG: MAX_STACK_TRACE_ENTRIES too low!" message.
/lib/zlib_inflate/
A Dinftrees.c37 unsigned low; /* low bits for current root entry */ in zlib_inflate_table() local
193 low = (unsigned)(-1); /* trigger new sub-table when len > root */ in zlib_inflate_table()
246 if (len > root && (huff & mask) != low) { in zlib_inflate_table()
270 low = huff & mask; in zlib_inflate_table()
271 (*table)[low].op = (unsigned char)curr; in zlib_inflate_table()
272 (*table)[low].bits = (unsigned char)root; in zlib_inflate_table()
273 (*table)[low].val = (unsigned short)(next - *table); in zlib_inflate_table()
289 if (drop != 0 && (huff & mask) != low) { in zlib_inflate_table()
/lib/zstd/compress/
A Dhuf_compress.c555 int const size = high-low+1; in HUF_insertionSort()
556 huffNode += low; in HUF_insertionSort()
574 int i = low - 1; in HUF_quickSortPartition()
575 int j = low; in HUF_quickSortPartition()
591 if (high - low < kInsertionSortThreshold) { in HUF_simpleQuickSort()
592 HUF_insertionSort(arr, low, high); in HUF_simpleQuickSort()
595 while (low < high) { in HUF_simpleQuickSort()
596 int const idx = HUF_quickSortPartition(arr, low, high); in HUF_simpleQuickSort()
597 if (idx - low < high - idx) { in HUF_simpleQuickSort()
598 HUF_simpleQuickSort(arr, low, idx - 1); in HUF_simpleQuickSort()
[all …]
/lib/crypto/
A Dcurve25519-fiat32.c59 addcarryx_u25(u8 /*bool*/ c, u32 a, u32 b, u32 *low) in addcarryx_u25() argument
65 *low = x & ((1 << 25) - 1); in addcarryx_u25()
70 addcarryx_u26(u8 /*bool*/ c, u32 a, u32 b, u32 *low) in addcarryx_u26() argument
76 *low = x & ((1 << 26) - 1); in addcarryx_u26()
81 subborrow_u25(u8 /*bool*/ c, u32 a, u32 b, u32 *low) in subborrow_u25() argument
87 *low = x & ((1 << 25) - 1); in subborrow_u25()
92 subborrow_u26(u8 /*bool*/ c, u32 a, u32 b, u32 *low) in subborrow_u26() argument
98 *low = x & ((1 << 26) - 1); in subborrow_u26()
/lib/xz/
A Dxz_dec_lzma2.c122 uint16_t low[POS_STATES_MAX][LEN_LOW_SYMBOLS]; member
606 uint32_t low = prev_byte >> (8 - s->lzma.lc); in lzma_literal_probs() local
608 return s->lzma.literal[low + high]; in lzma_literal_probs()
657 probs = l->low[pos_state]; in lzma_len()
/lib/crypto/x86/
A Dsha256-avx-asm.S223 ## compute low s1
A Dsha256-ssse3-asm.S223 ## compute low s1
A Dsha256-avx2-asm.S573 ## transpose data into high/low halves

Completed in 28 milliseconds