Home
last modified time | relevance | path

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

/lib/zlib_inflate/
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()
Dinflate.c184 left = strm->avail_out; \
195 strm->avail_out = left; \
337 unsigned have, left; /* available input and output */ in zlib_inflate() local
362 out = left; in zlib_inflate()
450 if (copy > left) copy = left; in zlib_inflate()
455 left -= copy; in zlib_inflate()
573 if (have >= 6 && left >= 258) { in zlib_inflate()
656 if (state->offset > state->whave + out - left) { in zlib_inflate()
663 if (left == 0) goto inf_leave; in zlib_inflate()
664 copy = out - left; in zlib_inflate()
[all …]
/lib/
Dprio_tree.c118 prev->left = last; in prio_tree_expand()
126 node->left = first; in prio_tree_expand()
132 last->left = root->prio_tree_node; in prio_tree_expand()
133 last->left->parent = last; in prio_tree_expand()
158 if (old->parent->left == old) in prio_tree_replace()
159 old->parent->left = node; in prio_tree_replace()
165 node->left = old->left; in prio_tree_replace()
166 old->left->parent = node; in prio_tree_replace()
240 cur->left = node; in prio_tree_insert()
244 cur = cur->left; in prio_tree_insert()
[all …]
Dprio_heap.c55 int left = 2 * pos + 1; in heap_insert() local
58 if (left < heap->size && heap->gt(ptrs[left], p)) in heap_insert()
59 largest = left; in heap_insert()
Drbtree.c51 struct rb_node *left = node->rb_left; in __rb_rotate_right() local
54 if ((node->rb_left = left->rb_right)) in __rb_rotate_right()
55 rb_set_parent(left->rb_right, node); in __rb_rotate_right()
56 left->rb_right = node; in __rb_rotate_right()
58 rb_set_parent(left, parent); in __rb_rotate_right()
63 parent->rb_right = left; in __rb_rotate_right()
65 parent->rb_left = left; in __rb_rotate_right()
68 root->rb_node = left; in __rb_rotate_right()
69 rb_set_parent(node, left); in __rb_rotate_right()
235 struct rb_node *old = node, *left; in rb_erase() local
[all …]
Dscatterlist.c215 unsigned int left; in __sg_alloc_table() local
223 left = nents; in __sg_alloc_table()
226 unsigned int sg_size, alloc_size = left; in __sg_alloc_table()
234 left -= sg_size; in __sg_alloc_table()
255 if (!left) in __sg_alloc_table()
267 } while (left); in __sg_alloc_table()
Dbitmap.c112 int k, lim = BITS_TO_LONGS(bits), left = bits % BITS_PER_LONG; in __bitmap_shift_right() local
114 unsigned long mask = (1UL << left) - 1; in __bitmap_shift_right()
126 if (off + k + 1 == lim - 1 && left) in __bitmap_shift_right()
130 if (left && off + k == lim - 1) in __bitmap_shift_right()
133 if (left && k == lim - 1) in __bitmap_shift_right()
157 int k, lim = BITS_TO_LONGS(bits), left = bits % BITS_PER_LONG; in __bitmap_shift_left() local
171 if (left && k == lim - 1) in __bitmap_shift_left()
172 upper &= (1UL << left) - 1; in __bitmap_shift_left()
174 if (left && k + off == lim - 1) in __bitmap_shift_left()
175 dst[k + off] &= (1UL << left) - 1; in __bitmap_shift_left()