Lines Matching refs:edge
2999 struct btrfs_backref_edge *edge; in btrfs_backref_alloc_edge() local
3001 edge = kzalloc(sizeof(*edge), GFP_NOFS); in btrfs_backref_alloc_edge()
3002 if (edge) in btrfs_backref_alloc_edge()
3004 return edge; in btrfs_backref_alloc_edge()
3018 struct btrfs_backref_edge *edge; in btrfs_backref_cleanup_node() local
3025 edge = list_entry(node->upper.next, struct btrfs_backref_edge, in btrfs_backref_cleanup_node()
3027 upper = edge->node[UPPER]; in btrfs_backref_cleanup_node()
3028 list_del(&edge->list[LOWER]); in btrfs_backref_cleanup_node()
3029 list_del(&edge->list[UPPER]); in btrfs_backref_cleanup_node()
3030 btrfs_backref_free_edge(cache, edge); in btrfs_backref_cleanup_node()
3094 struct btrfs_backref_edge *edge; in handle_direct_tree_backref() local
3121 edge = btrfs_backref_alloc_edge(cache); in handle_direct_tree_backref()
3122 if (!edge) in handle_direct_tree_backref()
3131 btrfs_backref_free_edge(cache, edge); in handle_direct_tree_backref()
3139 list_add_tail(&edge->list[UPPER], &cache->pending_edge); in handle_direct_tree_backref()
3144 INIT_LIST_HEAD(&edge->list[UPPER]); in handle_direct_tree_backref()
3146 btrfs_backref_link_edge(edge, cur, upper, LINK_LOWER); in handle_direct_tree_backref()
3171 struct btrfs_backref_edge *edge; in handle_indirect_tree_backref() local
3250 edge = btrfs_backref_alloc_edge(cache); in handle_indirect_tree_backref()
3251 if (!edge) { in handle_indirect_tree_backref()
3264 btrfs_backref_free_edge(cache, edge); in handle_indirect_tree_backref()
3288 list_add_tail(&edge->list[UPPER], in handle_indirect_tree_backref()
3293 INIT_LIST_HEAD(&edge->list[UPPER]); in handle_indirect_tree_backref()
3299 INIT_LIST_HEAD(&edge->list[UPPER]); in handle_indirect_tree_backref()
3303 btrfs_backref_link_edge(edge, lower, upper, LINK_LOWER); in handle_indirect_tree_backref()
3335 struct btrfs_backref_edge *edge; in btrfs_backref_add_tree_node() local
3363 edge = list_entry(cur->upper.next, struct btrfs_backref_edge, in btrfs_backref_add_tree_node()
3365 ASSERT(list_empty(&edge->list[UPPER])); in btrfs_backref_add_tree_node()
3366 exist = edge->node[UPPER]; in btrfs_backref_add_tree_node()
3372 list_add_tail(&edge->list[UPPER], &cache->pending_edge); in btrfs_backref_add_tree_node()
3458 struct btrfs_backref_edge *edge; in btrfs_backref_finish_upper_links() local
3479 list_for_each_entry(edge, &start->upper, list[LOWER]) in btrfs_backref_finish_upper_links()
3480 list_add_tail(&edge->list[UPPER], &pending_edge); in btrfs_backref_finish_upper_links()
3486 edge = list_first_entry(&pending_edge, in btrfs_backref_finish_upper_links()
3488 list_del_init(&edge->list[UPPER]); in btrfs_backref_finish_upper_links()
3489 upper = edge->node[UPPER]; in btrfs_backref_finish_upper_links()
3490 lower = edge->node[LOWER]; in btrfs_backref_finish_upper_links()
3494 list_del(&edge->list[LOWER]); in btrfs_backref_finish_upper_links()
3495 btrfs_backref_free_edge(cache, edge); in btrfs_backref_finish_upper_links()
3516 list_add_tail(&edge->list[UPPER], &upper->lower); in btrfs_backref_finish_upper_links()
3543 list_add_tail(&edge->list[UPPER], &upper->lower); in btrfs_backref_finish_upper_links()
3549 list_for_each_entry(edge, &upper->upper, list[LOWER]) in btrfs_backref_finish_upper_links()
3550 list_add_tail(&edge->list[UPPER], &pending_edge); in btrfs_backref_finish_upper_links()
3560 struct btrfs_backref_edge *edge; in btrfs_backref_error_cleanup() local
3568 edge = list_first_entry(&cache->pending_edge, in btrfs_backref_error_cleanup()
3570 list_del(&edge->list[UPPER]); in btrfs_backref_error_cleanup()
3571 list_del(&edge->list[LOWER]); in btrfs_backref_error_cleanup()
3572 lower = edge->node[LOWER]; in btrfs_backref_error_cleanup()
3573 upper = edge->node[UPPER]; in btrfs_backref_error_cleanup()
3574 btrfs_backref_free_edge(cache, edge); in btrfs_backref_error_cleanup()
3588 list_for_each_entry(edge, &upper->upper, list[LOWER]) in btrfs_backref_error_cleanup()
3589 list_add_tail(&edge->list[UPPER], in btrfs_backref_error_cleanup()