| /lib/ |
| A D | find_bit.c | 33 for (idx = 0; idx * BITS_PER_LONG < sz; idx++) { \
64 idx++; \
76 for (idx = 0; (idx + 1) * BITS_PER_LONG <= sz; idx++) { \
115 return FIND_FIRST_BIT(addr1[idx] & addr2[idx], /* nop */, size); in _find_first_and_bit()
127 return FIND_FIRST_BIT(addr1[idx] & ~addr2[idx], /* nop */, size); in _find_first_andnot_bit()
139 return FIND_FIRST_BIT(addr1[idx] & addr2[idx] & addr3[idx], /* nop */, size); in _find_first_and_and_bit()
171 return FIND_NTH_BIT(addr1[idx] & addr2[idx], size, n); in __find_nth_and_bit()
178 return FIND_NTH_BIT(addr1[idx] & ~addr2[idx], size, n); in __find_nth_andnot_bit()
187 return FIND_NTH_BIT(addr1[idx] & addr2[idx] & ~addr3[idx], size, n); in __find_nth_and_andnot_bit()
235 val &= addr[idx]; in _find_last_bit()
[all …]
|
| A D | min_heap.c | 30 void __min_heap_sift_up(min_heap_char *heap, size_t elem_size, size_t idx, in __min_heap_sift_up() argument
33 __min_heap_sift_up_inline(heap, elem_size, idx, func, args); in __min_heap_sift_up()
65 bool __min_heap_del(min_heap_char *heap, size_t elem_size, size_t idx, in __min_heap_del() argument
68 return __min_heap_del_inline(heap, elem_size, idx, func, args); in __min_heap_del()
|
| A D | test_kmod.c | 179 unsigned int idx) in kmod_test_done_check() argument
294 unsigned int idx; in tally_up_work() local
302 for (idx=0; idx < config->num_threads; idx++) { in tally_up_work()
303 info = &test_dev->info[idx]; in tally_up_work()
325 info->thread_idx = idx; in try_one_request()
328 KBUILD_MODNAME, idx); in try_one_request()
336 dev_dbg(test_dev->dev, "Kicked off thread %u\n", idx); in try_one_request()
390 unsigned int idx; in try_requests() local
394 for (idx=0; idx < config->num_threads; idx++) { in try_requests()
400 ret = try_one_request(test_dev, idx); in try_requests()
[all …]
|
| A D | bitmap.c | 327 unsigned int __bits = (bits), idx, w = 0; \
329 for (idx = 0; idx < __bits / BITS_PER_LONG; idx++) \
340 return BITMAP_WEIGHT(bitmap[idx], bits); in __bitmap_weight()
347 return BITMAP_WEIGHT(bitmap1[idx] & bitmap2[idx], bits); in __bitmap_weight_and()
354 return BITMAP_WEIGHT(bitmap1[idx] & ~bitmap2[idx], bits); in __bitmap_weight_andnot()
|
| A D | test_firmware.c | 43 u8 idx; member
900 req->idx, req->rc); in test_fw_run_batch_request()
906 req->idx, req->fw->size); in test_fw_run_batch_request()
950 req->idx = i; in trigger_batched_requests_store()
956 "%s-%u", KBUILD_MODNAME, req->idx); in trigger_batched_requests_store()
1006 if (!req->idx) in trigger_batched_cb()
1059 req->idx = i; in trigger_batched_requests_async_store()
1398 u8 idx; in read_firmware_show() local
1403 idx = test_fw_config->read_fw_idx; in read_firmware_show()
1404 if (idx >= test_fw_config->num_requests) { in read_firmware_show()
[all …]
|
| A D | logic_iomem.c | 139 unsigned int idx; in get_area() local
144 idx = (a & AREA_BITS) >> AREA_SHIFT; in get_area()
146 if (mapped_areas[idx].ops) in get_area()
147 return &mapped_areas[idx]; in get_area()
|
| /lib/crypto/x86/ |
| A D | sha512-avx-asm.S | 130 idx = \rnd define
171 idx = \rnd - 2 define
173 idx = \rnd - 15 define
186 idx = \rnd define
187 add WK_2(idx), T1#
226 idx = \rnd - 16 define
228 idx = \rnd - 7 define
235 idx = \rnd + 1 define
236 add WK_2(idx), T1
247 idx = \rnd define
[all …]
|
| A D | sha512-ssse3-asm.S | 124 idx = \rnd define
170 idx = \rnd -2 define
171 movdqa W_t(idx), %xmm2 # XMM2 = W[t-2]
176 idx = \rnd define
177 add WK_2(idx), T1
178 idx = \rnd - 15 define
222 idx = \rnd + 1 define
223 add WK_2(idx), T1
243 idx = \rnd - 7 define
250 idx =\rnd-16
[all …]
|
| /lib/zstd/compress/ |
| A D | zstd_lazy.c | 44 U32 idx = ms->nextToUpdate; in ZSTD_updateDUBT() local
46 if (idx != target) in ZSTD_updateDUBT()
53 for ( ; idx < target ; idx++) { in ZSTD_updateDUBT()
420 U32 const minChain = chainSize < target - idx ? target - chainSize : idx; in ZSTD_dedicatedDictSearch_lazy_loadDictionary()
440 assert(idx != 0); in ZSTD_dedicatedDictSearch_lazy_loadDictionary()
444 for ( ; idx < target; idx++) { in ZSTD_dedicatedDictSearch_lazy_loadDictionary()
513 for (idx = ms->nextToUpdate; idx < target; idx++) { in ZSTD_dedicatedDictSearch_lazy_loadDictionary()
520 hashTable[h] = idx; in ZSTD_dedicatedDictSearch_lazy_loadDictionary()
650 idx++; in ZSTD_insertAndFindFirstIndex_internal()
848 for (; idx < lim; ++idx) { in ZSTD_row_fillHashCache()
[all …]
|
| A D | zstd_fast.c | 743 U32 idx; /* match idx for ip0 */ in ZSTD_compressBlock_fast_extDict_generic() local
787 idx = hashTable[hash0]; in ZSTD_compressBlock_fast_extDict_generic()
788 idxBase = idx < prefixStartIndex ? dictBase : base; in ZSTD_compressBlock_fast_extDict_generic()
822 U32 const mval = idx >= dictStartIndex ? in ZSTD_compressBlock_fast_extDict_generic()
823 MEM_read32(idxBase + idx) : in ZSTD_compressBlock_fast_extDict_generic()
833 idx = hashTable[hash1]; in ZSTD_compressBlock_fast_extDict_generic()
850 U32 const mval = idx >= dictStartIndex ? in ZSTD_compressBlock_fast_extDict_generic()
851 MEM_read32(idxBase + idx) : in ZSTD_compressBlock_fast_extDict_generic()
861 idx = hashTable[hash1]; in ZSTD_compressBlock_fast_extDict_generic()
902 { U32 const offset = current0 - idx; in ZSTD_compressBlock_fast_extDict_generic()
[all …]
|
| A D | huf_compress.c | 596 int const idx = HUF_quickSortPartition(arr, low, high); in HUF_simpleQuickSort() local
597 if (idx - low < high - idx) { in HUF_simpleQuickSort()
598 HUF_simpleQuickSort(arr, low, idx - 1); in HUF_simpleQuickSort()
599 low = idx + 1; in HUF_simpleQuickSort()
601 HUF_simpleQuickSort(arr, idx + 1, high); in HUF_simpleQuickSort()
602 high = idx - 1; in HUF_simpleQuickSort()
877 assert(idx <= 1); in HUF_addBits()
884 bitC->bitContainer[idx] >>= HUF_getNbBits(elt); in HUF_addBits()
889 bitC->bitPos[idx] += HUF_getNbBitsFast(elt); in HUF_addBits()
890 assert((bitC->bitPos[idx] & 0xFF) <= HUF_BITS_IN_CONTAINER); in HUF_addBits()
[all …]
|
| /lib/fonts/ |
| A D | fonts.c | 125 if (MACH_IS_AMIGA && f->idx == PEARL8x8_IDX) in get_default_font()
129 if (MACH_IS_MAC && xres < 640 && f->idx == VGA6x11_IDX) in get_default_font()
|
| A D | font_6x11.c | 3345 .idx = VGA6x11_IDX,
|
| A D | font_6x8.c | 2570 .idx = FONT6x8_IDX,
|
| A D | font_7x14.c | 4112 .idx = FONT7x14_IDX,
|
| A D | font_6x10.c | 3082 .idx = FONT6x10_IDX,
|
| A D | font_8x8.c | 2577 .idx = VGA8x8_IDX,
|
| A D | font_mini_4x6.c | 2151 .idx = MINI4x6_IDX,
|
| A D | font_pearl_8x8.c | 2581 .idx = PEARL8x8_IDX,
|
| A D | font_10x18.c | 5136 .idx = FONT10x18_IDX,
|
| A D | font_sun8x16.c | 267 .idx = SUN8x16_IDX,
|
| A D | font_8x16.c | 4626 .idx = VGA8x16_IDX,
|
| A D | font_acorn_8x8.c | 269 .idx = ACORN8x8_IDX,
|
| A D | font_sun12x22.c | 6155 .idx = SUN12x22_IDX,
|
| /lib/lz4/ |
| A D | lz4hc_compress.c | 80 U32 idx = hc4->nextToUpdate; in LZ4HC_Insert() local
82 while (idx < target) { in LZ4HC_Insert()
83 U32 const h = LZ4HC_hashPtr(base + idx); in LZ4HC_Insert()
84 size_t delta = idx - hashTable[h]; in LZ4HC_Insert()
89 DELTANEXTU16(idx) = (U16)delta; in LZ4HC_Insert()
91 hashTable[h] = idx; in LZ4HC_Insert()
92 idx++; in LZ4HC_Insert()
|