Lines Matching full:we
90 * @bitmap as the list of blocks that are not accounted for, which we assume
120 * Now that we've sorted both lists, we iterate bitmap once, rolling in xbitmap_disunion()
121 * forward through sub and/or bitmap as necessary until we find an in xbitmap_disunion()
122 * overlap or reach the end of either list. We do not reset lp to the in xbitmap_disunion()
123 * head of bitmap nor do we reset sub_br to the head of sub. The in xbitmap_disunion()
124 * list traversal is similar to merge sort, but we're deleting in xbitmap_disunion()
125 * instead. In this manner we avoid O(n^2) operations. in xbitmap_disunion()
134 * Advance sub_br and/or br until we find a pair that in xbitmap_disunion()
135 * intersect or we run out of extents. in xbitmap_disunion()
147 /* trim sub_br to fit the extent we have */ in xbitmap_disunion()
212 * We know that the btree query_all function starts at the left edge and walks
213 * towards the right edge of the tree. Therefore, we know that we can walk up
215 * to the first record/key in that block, we haven't seen this block before;
216 * and therefore we need to remember that we saw this block in the btree.
225 * the first btree record, we'll observe that bc_ptrs[0] == 1, so we record
226 * that we saw block 1. Then we observe that bc_ptrs[1] == 1, so we record
229 * For the second btree record, we see that bc_ptrs[0] == 2, so we exit the
232 * For the 101st btree record, we've moved onto leaf block 2. Now
233 * bc_ptrs[0] == 1 again, so we record that we saw block 2. We see that
234 * bc_ptrs[1] == 2, so we exit the loop. The list is now [1, 4, 2].
236 * For the 102nd record, bc_ptrs[0] == 2, so we continue.
238 * For the 201st record, we've moved on to leaf block 3. bc_ptrs[0] == 1, so
239 * we add 3 to the list. Now it is [1, 4, 2, 3].
241 * For the 300th record we just exit, with the list being [1, 4, 2, 3].