46   struct backed_block* next;  member
60   return bb->next;  in backed_block_iter_next()
123       struct backed_block* next = bb->next;  in backed_block_list_destroy()  local
125       bb = next;  in backed_block_list_destroy()
141     for (end = start; end && end->next; end = end->next)  in backed_block_list_move()
152     from->data_blocks = end->next;  in backed_block_list_move()
154     for (bb = from->data_blocks; bb; bb = bb->next) {  in backed_block_list_move()
155       if (bb->next == start) {  in backed_block_list_move()
156         bb->next = end->next;  in backed_block_list_move()
164     end->next = nullptr;  in backed_block_list_move()
166     for (bb = to->data_blocks; bb; bb = bb->next) {  in backed_block_list_move()
167       if (!bb->next || bb->next->block > start->block) {  in backed_block_list_move()
168         end->next = bb->next;  in backed_block_list_move()
169         bb->next = start;  in backed_block_list_move()
223   a->next = b->next;  in merge_bb()
239     new_bb->next = bbl->data_blocks;  in queue_bb()
253   for (; bb->next && bb->next->block < new_bb->block; bb = bb->next)  in queue_bb()
256   if (bb->next == nullptr) {  in queue_bb()
257     bb->next = new_bb;  in queue_bb()
259     new_bb->next = bb->next;  in queue_bb()
260     bb->next = new_bb;  in queue_bb()
263   merge_bb(bbl, new_bb, new_bb->next);  in queue_bb()
284   bb->next = nullptr;  in backed_block_add_fill()
301   bb->next = nullptr;  in backed_block_add_data()
323   bb->next = nullptr;  in backed_block_add_file()
341   bb->next = nullptr;  in backed_block_add_fd()
365   new_bb->next = bb->next;  in backed_block_split()
386   bb->next = new_bb;  in backed_block_split()