46 	struct backed_block *next;  member
62 	return bb->next;  in backed_block_iter_next()
135 			struct backed_block *next = bb->next;  in backed_block_list_destroy()  local
137 			bb = next;  in backed_block_list_destroy()
155 		for (end = start; end && end->next; end = end->next)  in backed_block_list_move()
166 		from->data_blocks = end->next;  in backed_block_list_move()
168 		for (bb = from->data_blocks; bb; bb = bb->next) {  in backed_block_list_move()
169 			if (bb->next == start) {  in backed_block_list_move()
170 				bb->next = end->next;  in backed_block_list_move()
178 		end->next = NULL;  in backed_block_list_move()
180 		for (bb = to->data_blocks; bb; bb = bb->next) {  in backed_block_list_move()
181 			if (!bb->next || bb->next->block > start->block) {  in backed_block_list_move()
182 				end->next = bb->next;  in backed_block_list_move()
183 				bb->next = start;  in backed_block_list_move()
241 	a->next = b->next;  in merge_bb()
258 		new_bb->next = bbl->data_blocks;  in queue_bb()
272 	for (; bb->next && bb->next->block < new_bb->block; bb = bb->next)  in queue_bb()
275 	if (bb->next == NULL) {  in queue_bb()
276 		bb->next = new_bb;  in queue_bb()
278 		new_bb->next = bb->next;  in queue_bb()
279 		bb->next = new_bb;  in queue_bb()
282 	merge_bb(bbl, new_bb, new_bb->next);  in queue_bb()
304 	bb->next = NULL;  in backed_block_add_fill()
322 	bb->next = NULL;  in backed_block_add_data()
341 	bb->next = NULL;  in backed_block_add_file()
360 	bb->next = NULL;  in backed_block_add_fd()
385 	new_bb->next = bb->next;  in backed_block_split()
386 	bb->next = new_bb;  in backed_block_split()