Lines Matching refs:edges
191 struct btrfs_backref_edge *edges[], int *index)
199 edges[idx++] = edge;
211 struct btrfs_backref_edge *edges[], int *index)
218 edge = edges[idx - 1];
226 edges[idx - 1] = edge;
378 * - Cleanup the children edges and nodes
414 /* Cleanup the lower edges */
516 /* Finish the upper linkage of newly added edges/nodes */
2156 struct btrfs_backref_edge *edges[])
2166 next = walk_up_backref(next, edges, &index);
2244 next = walk_down_backref(edges, &index);
2263 next = edges[index]->node[UPPER];
2283 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1];
2289 next = walk_up_backref(next, edges, &index);
2309 next = walk_down_backref(edges, &index);
2326 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1];
2345 edges[index++] = edge;
2348 next = walk_down_backref(edges, &index);
2409 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1];
2431 root = select_reloc_root(trans, rc, upper, edges);
2608 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1];
2624 edges[index++] = edge;
2627 next = walk_down_backref(edges, &index);