Searched refs:left (Results 1 - 6 of 6) sorted by relevance
/lib/zlib_inflate/ |
H A D | inftrees.c | 32 int left; /* number of prefix codes available */ local 117 left = 1; 119 left <<= 1; 120 left -= count[len]; 121 if (left < 0) return -1; /* over-subscribed */ 123 if (left > 0 && (type == CODES || max != 1)) 256 left = (int)(1 << curr); 258 left -= count[curr + drop]; 259 if (left <= 0) break; 261 left << [all...] |
H A D | inflate.c | 169 left = strm->avail_out; \ 180 strm->avail_out = left; \ 263 input left to load n bits into the accumulator, or it continues. BITS(n) 276 state information is maintained to continue the loop where it left off 322 unsigned have, left; /* available input and output */ local 347 out = left; 435 if (copy > left) copy = left; 440 left -= copy; 558 if (have >= 6 && left > [all...] |
/lib/ |
H A D | bitmap.c | 114 int k, lim = BITS_TO_LONGS(bits), left = bits % BITS_PER_LONG; local 116 unsigned long mask = (1UL << left) - 1; 128 if (off + k + 1 == lim - 1 && left) 132 if (left && off + k == lim - 1) 137 if (left && k == lim - 1) 147 * __bitmap_shift_left - logical left shift of the bits in a bitmap 153 * Shifting left (multiplying) means moving bits in the LS -> MS 161 int k, lim = BITS_TO_LONGS(bits), left = bits % BITS_PER_LONG; local 175 if (left && k == lim - 1) 176 upper &= (1UL << left) [all...] |
H A D | scatterlist.c | 191 * If we have more than max_ents segments left, 252 unsigned int left; local 263 left = nents; 266 unsigned int sg_size, alloc_size = left; 274 left -= sg_size; 310 if (!left) 314 } while (left);
|
H A D | btree.c | 37 * values are to the right, not to the left. All used slots within a node 38 * are on the left, all unused slots contain NUL values. Most operations 521 unsigned long *left, int lfill, 528 /* Move all keys to the left */ 529 setkey(geo, left, lfill + i, bkey(geo, right, i)); 530 setval(geo, left, lfill + i, bval(geo, right, i)); 532 /* Exchange left and right child in parent */ 534 setval(geo, parent, lpos + 1, left); 535 /* Remove left (formerly right) child from parent */ 543 unsigned long *parent, *left local 520 merge(struct btree_head *head, struct btree_geo *geo, int level, unsigned long *left, int lfill, unsigned long *right, int rfill, unsigned long *parent, int lpos) argument [all...] |
/lib/xz/ |
H A D | xz_dec_lzma2.c | 344 * updated to indicate how many bytes were left to be repeated. 349 uint32_t left; local 354 left = min_t(size_t, dict->limit - dict->pos, *len); 355 *len -= left; 365 } while (--left > 0); 375 uint32_t *left) 379 while (*left > 0 && b->in_pos < b->in_size 385 if (copy_size > *left) 386 copy_size = *left; 388 *left 374 dict_uncompressed(struct dictionary *dict, struct xz_buf *b, uint32_t *left) argument [all...] |
Completed in 160 milliseconds