32 	INIT_LIST_HEAD(&bmr->list);  in xfs_bitmap_set()
35 	list_add_tail(&bmr->list, &bitmap->list);  in xfs_bitmap_set()
49 		list_del(&bmr->list);  in xfs_bitmap_destroy()
59 	INIT_LIST_HEAD(&bitmap->list);  in xfs_bitmap_init()
72 	ap = container_of(a, struct xfs_bitmap_range, list);  in xfs_bitmap_range_cmp()
73 	bp = container_of(b, struct xfs_bitmap_range, list);  in xfs_bitmap_range_cmp()
112 	if (list_empty(&bitmap->list) || list_empty(&sub->list))  in xfs_bitmap_disunion()
114 	ASSERT(!list_empty(&sub->list));  in xfs_bitmap_disunion()
116 	list_sort(NULL, &bitmap->list, xfs_bitmap_range_cmp);  in xfs_bitmap_disunion()
117 	list_sort(NULL, &sub->list, xfs_bitmap_range_cmp);  in xfs_bitmap_disunion()
127 	sub_br = list_first_entry(&sub->list, struct xfs_bitmap_range,  in xfs_bitmap_disunion()
128 			list);  in xfs_bitmap_disunion()
129 	lp = bitmap->list.next;  in xfs_bitmap_disunion()
130 	while (lp != &bitmap->list) {  in xfs_bitmap_disunion()
131 		br = list_entry(lp, struct xfs_bitmap_range, list);  in xfs_bitmap_disunion()
138 			if (list_is_last(&sub_br->list, &sub->list))  in xfs_bitmap_disunion()
140 			sub_br = list_next_entry(sub_br, list);  in xfs_bitmap_disunion()
176 			list_del(&br->list);  in xfs_bitmap_disunion()
190 			INIT_LIST_HEAD(&new_br->list);  in xfs_bitmap_disunion()
193 			list_add(&new_br->list, &br->list);  in xfs_bitmap_disunion()