Lines Matching refs:list_entry
224 node = list_entry(cache->detached.next, in backref_cache_cleanup()
230 node = list_entry(cache->leaves.next, in backref_cache_cleanup()
354 edge = list_entry(node->upper.next, in walk_up_backref()
381 edge = list_entry(edge->list[LOWER].next, in walk_down_backref()
435 edge = list_entry(node->upper.next, struct backref_edge, in remove_backref_node()
496 node = list_entry(cache->detached.next, in update_backref_cache()
502 node = list_entry(cache->changed.next, in update_backref_cache()
751 edge = list_entry(cur->upper.next, struct backref_edge,
1023 edge = list_entry(list.next, struct backref_edge, list[UPPER]);
1047 edge = list_entry(list.next, struct backref_edge, list[UPPER]);
1104 upper = list_entry(useless.next, struct backref_node, list);
1114 edge = list_entry(upper->lower.next,
1138 lower = list_entry(useless.next,
1170 lower = list_entry(useless.next,
1263 new_edge = list_entry(new_node->lower.next,
2309 reloc_root = list_entry(rc->reloc_roots.next,
2344 reloc_root = list_entry(list->next, struct btrfs_root,
2376 reloc_root = list_entry(reloc_roots.next,
2582 edge = list_entry(next->upper.next,
2795 node = list_entry(cache->pending[level].next,
2853 edge = list_entry(next->upper.next,
4427 reloc_root = list_entry(reloc_roots.next,
4508 sums = list_entry(list.next, struct btrfs_ordered_sum, list);