| /lib/zlib_inflate/ |
| D | inftrees.c | 32 int left; /* number of prefix codes available */ in zlib_inflate_table() local
117 left = 1; in zlib_inflate_table()
119 left <<= 1; in zlib_inflate_table()
120 left -= count[len]; in zlib_inflate_table()
121 if (left < 0) return -1; /* over-subscribed */ in zlib_inflate_table()
123 if (left > 0 && (type == CODES || max != 1)) in zlib_inflate_table()
256 left = (int)(1 << curr); in zlib_inflate_table()
258 left -= count[curr + drop]; in zlib_inflate_table()
259 if (left <= 0) break; in zlib_inflate_table()
261 left <<= 1; in zlib_inflate_table()
|
| D | inflate.c | 188 left = strm->avail_out; \
199 strm->avail_out = left; \
336 unsigned have, left; /* available input and output */ in zlib_inflate() local
361 out = left; in zlib_inflate()
454 if (copy > left) copy = left; in zlib_inflate()
459 left -= copy; in zlib_inflate()
580 if (have >= 6 && left >= 258) { in zlib_inflate()
666 if (state->offset > state->whave + out - left) { in zlib_inflate()
674 if (left == 0) goto inf_leave; in zlib_inflate()
675 copy = out - left; in zlib_inflate()
[all …]
|
| /lib/ |
| D | siphash.c | 49 const u8 left = len & (sizeof(u64) - 1); in __siphash_aligned() local
60 if (left) in __siphash_aligned()
62 bytemask_from_count(left))); in __siphash_aligned()
64 switch (left) { in __siphash_aligned()
82 const u8 left = len & (sizeof(u64) - 1); in __siphash_unaligned() local
93 if (left) in __siphash_unaligned()
95 bytemask_from_count(left))); in __siphash_unaligned()
97 switch (left) { in __siphash_unaligned()
250 const u8 left = len & (sizeof(u64) - 1); in __hsiphash_aligned() local
260 if (left) in __hsiphash_aligned()
[all …]
|
| D | btree.c | 517 unsigned long *left, int lfill, in merge() argument
525 setkey(geo, left, lfill + i, bkey(geo, right, i)); in merge()
526 setval(geo, left, lfill + i, bval(geo, right, i)); in merge()
530 setval(geo, parent, lpos + 1, left); in merge()
539 unsigned long *parent, *left = NULL, *right = NULL; in rebalance() local
557 left = bval(geo, parent, i - 1); in rebalance()
558 no_left = getfill(geo, left, 0); in rebalance()
561 left, no_left, in rebalance()
|
| D | scatterlist.c | 288 unsigned int left; in __sg_alloc_table() local
301 left = nents; in __sg_alloc_table()
304 unsigned int sg_size, alloc_size = left; in __sg_alloc_table()
312 left -= sg_size; in __sg_alloc_table()
348 if (!left) in __sg_alloc_table()
354 } while (left); in __sg_alloc_table()
|
| D | iov_iter.c | 56 unsigned left; \
62 left = (STEP); \
64 len -= left; \
72 if (left) \
90 unsigned left; \
102 left = (STEP); \
104 len -= left; \
107 if (left || n == 0) \
1317 size_t left; in pipe_get_pages() local
1329 for (npages = 0, left = maxsize ; npages < count; npages++, left -= chunk) { in pipe_get_pages()
[all …]
|
| D | maple_tree.c | 2451 struct maple_big_node *b_node, struct maple_enode **left, in mas_mab_to_node() argument
2458 *left = mas_new_ma_node(mas, b_node); in mas_mab_to_node()
2508 struct maple_enode *left, in mas_set_split_parent() argument
2516 mte_set_parent(mas->node, left, *slot); in mas_set_split_parent()
2559 struct maple_enode *left, in mast_set_split_parents() argument
2566 struct maple_enode *l = left; in mast_set_split_parents()
2746 struct maple_enode *left, struct maple_enode *middle, in mast_cp_to_nodes() argument
2751 mast->l->node = mte_node_or_none(left); in mast_cp_to_nodes()
2918 struct maple_enode *left = NULL, *middle = NULL, *right = NULL; in mas_spanning_rebalance() local
2955 split = mas_mab_to_node(mas, mast->bn, &left, &right, &middle, in mas_spanning_rebalance()
[all …]
|
| D | Kconfig.ubsan | 81 operations that overflow to the left or go switch to negative
|
| /lib/xz/ |
| D | xz_dec_lzma2.c | 353 uint32_t left; in dict_repeat() local
358 left = min_t(size_t, dict->limit - dict->pos, *len); in dict_repeat()
359 *len -= left; in dict_repeat()
369 } while (--left > 0); in dict_repeat()
379 uint32_t *left) in dict_uncompressed() argument
383 while (*left > 0 && b->in_pos < b->in_size in dict_uncompressed()
389 if (copy_size > *left) in dict_uncompressed()
390 copy_size = *left; in dict_uncompressed()
392 *left -= copy_size; in dict_uncompressed()
|
| /lib/raid6/ |
| D | s390vx.uc | 29 * vector register y left by 1 bit and stores the result in
143 /* P/Q left side optimization */
|
| D | neon.uc | 34 * The SHLBYTE() operation shifts each byte left by 1, *not*
115 /* P/Q left side optimization */
|
| D | int.uc | 57 * The SHLBYTE() operation shifts each byte left by 1, *not*
135 /* P/Q left side optimization */
|
| D | altivec.uc | 47 * The SHLBYTE() operation shifts each byte left by 1, *not*
|
| /lib/kunit/ |
| D | Kconfig | 70 In most cases this should be left as Y. Only if additional opt-in
|