Lines Matching defs:left
95 /* overlaps with the left side of the clearing range */
122 struct xbitmap_node *left;
128 left = xbitmap_tree_iter_first(&bitmap->xb_root, start, last);
129 if (left && left->bn_start <= start && left->bn_last >= last)
137 /* Do we have a left-adjacent extent? */
138 left = xbitmap_tree_iter_first(&bitmap->xb_root, start - 1, start - 1);
139 ASSERT(!left || left->bn_last + 1 == start);
145 if (left && right) {
146 /* combine left and right adjacent extent */
147 xbitmap_tree_remove(left, &bitmap->xb_root);
149 left->bn_last = right->bn_last;
150 xbitmap_tree_insert(left, &bitmap->xb_root);
152 } else if (left) {
153 /* combine with left extent */
154 xbitmap_tree_remove(left, &bitmap->xb_root);
155 left->bn_last = last;
156 xbitmap_tree_insert(left, &bitmap->xb_root);
164 left = kmalloc(sizeof(struct xbitmap_node), XCHK_GFP_FLAGS);
165 if (!left)
167 left->bn_start = start;
168 left->bn_last = last;
169 xbitmap_tree_insert(left, &bitmap->xb_root);
234 * We know that the btree query_all function starts at the left edge and walks