Home
last modified time | relevance | path

Searched refs:left (Results 1 – 14 of 14) sorted by relevance

/lib/zlib_inflate/
A Dinftrees.c32 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()
A Dinflate.c188 left = strm->avail_out; \
199 strm->avail_out = left; \
361 out = left; in zlib_inflate()
454 if (copy > left) copy = left; in zlib_inflate()
459 left -= copy; in zlib_inflate()
675 copy = out - left; in zlib_inflate()
690 if (copy > left) copy = left; in zlib_inflate()
691 left -= copy; in zlib_inflate()
701 left--; in zlib_inflate()
707 out -= left; in zlib_inflate()
[all …]
/lib/
A Dsiphash.c60 if (left) in __siphash_aligned()
62 bytemask_from_count(left))); in __siphash_aligned()
64 switch (left) { in __siphash_aligned()
93 if (left) in __siphash_unaligned()
97 switch (left) { in __siphash_unaligned()
260 if (left) in __hsiphash_aligned()
264 switch (left) { in __hsiphash_aligned()
293 if (left) in __hsiphash_unaligned()
297 switch (left) { in __hsiphash_unaligned()
421 switch (left) { in __hsiphash_aligned()
[all …]
A Dbtree.c516 unsigned long *left, int lfill, in merge() argument
524 setkey(geo, left, lfill + i, bkey(geo, right, i)); in merge()
525 setval(geo, left, lfill + i, bval(geo, right, i)); in merge()
529 setval(geo, parent, lpos + 1, left); in merge()
538 unsigned long *parent, *left = NULL, *right = NULL; in rebalance() local
556 left = bval(geo, parent, i - 1); in rebalance()
557 no_left = getfill(geo, left, 0); in rebalance()
560 left, no_left, in rebalance()
A Dscatterlist.c269 unsigned int left; in __sg_alloc_table() local
282 left = nents; in __sg_alloc_table()
285 unsigned int sg_size, alloc_size = left; in __sg_alloc_table()
293 left -= sg_size; in __sg_alloc_table()
329 if (!left) in __sg_alloc_table()
335 } while (left); in __sg_alloc_table()
A Dmaple_tree.c2428 struct maple_enode *left, in mas_set_split_parent() argument
2479 struct maple_enode *left, in mast_set_split_parents() argument
2486 struct maple_enode *l = left; in mast_set_split_parents()
2674 mas_node_or_none(mast->l, left); in mast_cp_to_nodes()
3050 left = mas_mn(&l_mas); in mas_destroy_rebalance()
3051 l_slots = ma_slots(left, mt); in mas_destroy_rebalance()
3052 l_pivs = ma_pivots(left, mt); in mas_destroy_rebalance()
3099 new_left->parent = left->parent; in mas_destroy_rebalance()
3273 if (left) { in mas_push_data()
3283 if (left) { in mas_push_data()
[all …]
A DKconfig.ubsan94 operations that overflow to the left or go switch to negative
/lib/xz/
A Dxz_dec_lzma2.c352 uint32_t left; in dict_repeat() local
357 left = min_t(size_t, dict->limit - dict->pos, *len); in dict_repeat()
358 *len -= left; in dict_repeat()
368 } while (--left > 0); in dict_repeat()
378 uint32_t *left) in dict_uncompressed() argument
382 while (*left > 0 && b->in_pos < b->in_size in dict_uncompressed()
388 if (copy_size > *left) in dict_uncompressed()
389 copy_size = *left; in dict_uncompressed()
391 *left -= copy_size; in dict_uncompressed()
/lib/raid6/
A Ds390vx.uc28 * vector register y left by 1 bit and stores the result in
107 /* P/Q left side optimization */
A Dint.uc50 * The SHLBYTE() operation shifts each byte left by 1, *not*
128 /* P/Q left side optimization */
A Dneon.uc35 * The SHLBYTE() operation shifts each byte left by 1, *not*
116 /* P/Q left side optimization */
A Daltivec.uc47 * The SHLBYTE() operation shifts each byte left by 1, *not*
/lib/kunit/
A DKconfig81 In most cases this should be left as Y. Only if additional opt-in
93 In most cases this should be left as Y. Only if additional opt-in
/lib/crypto/powerpc/
A Dpoly1305-p10le_64.S572 vsrd 11, 10, 31 # 12 bits left
599 vsrd 11, 10, 31 # 12 bits left
691 vsrd 22, 21, 31 # 12 bits left
693 vsrd 11, 10, 31 # 12 bits left

Completed in 37 milliseconds