Lines Matching refs:edges
183 struct btrfs_backref_edge *edges[], int *index)
191 edges[idx++] = edge;
203 struct btrfs_backref_edge *edges[], int *index)
210 edge = edges[idx - 1];
218 edges[idx - 1] = edge;
371 * - Cleanup the children edges and nodes
407 /* Cleanup the lower edges */
508 /* Finish the upper linkage of newly added edges/nodes */
2038 struct btrfs_backref_edge *edges[])
2047 next = walk_up_backref(next, edges, &index);
2075 next = walk_down_backref(edges, &index);
2088 next = edges[index]->node[UPPER];
2108 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1];
2114 next = walk_up_backref(next, edges, &index);
2128 next = walk_down_backref(edges, &index);
2145 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1];
2164 edges[index++] = edge;
2167 next = walk_down_backref(edges, &index);
2229 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1];
2250 root = select_reloc_root(trans, rc, upper, edges);
2429 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1];
2445 edges[index++] = edge;
2448 next = walk_down_backref(edges, &index);