Lines Matching refs:list
32 INIT_LIST_HEAD(&bmr->list);
35 list_add_tail(&bmr->list, &bitmap->list);
49 list_del(&bmr->list);
59 INIT_LIST_HEAD(&bitmap->list);
72 ap = container_of(a, struct xbitmap_range, list);
73 bp = container_of(b, struct xbitmap_range, list);
90 * @bitmap as the list of blocks that are not accounted for, which we assume
112 if (list_empty(&bitmap->list) || list_empty(&sub->list))
114 ASSERT(!list_empty(&sub->list));
116 list_sort(NULL, &bitmap->list, xbitmap_range_cmp);
117 list_sort(NULL, &sub->list, xbitmap_range_cmp);
122 * overlap or reach the end of either list. We do not reset lp to the
124 * list traversal is similar to merge sort, but we're deleting
127 sub_br = list_first_entry(&sub->list, struct xbitmap_range,
128 list);
129 lp = bitmap->list.next;
130 while (lp != &bitmap->list) {
131 br = list_entry(lp, struct xbitmap_range, list);
138 if (list_is_last(&sub_br->list, &sub->list))
140 sub_br = list_next_entry(sub_br, list);
176 list_del(&br->list);
190 INIT_LIST_HEAD(&new_br->list);
193 list_add(&new_br->list, &br->list);
227 * block 4. The list is [1, 4].
230 * loop. The list remains [1, 4].
234 * bc_ptrs[1] == 2, so we exit the loop. The list is now [1, 4, 2].
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].
246 * engaged in a btree walk should call this function to capture the list of