Lines Matching refs:edges
195 struct btrfs_backref_edge *edges[], int *index)
203 edges[idx++] = edge;
215 struct btrfs_backref_edge *edges[], int *index)
222 edge = edges[idx - 1];
230 edges[idx - 1] = edge;
383 * - Cleanup the children edges and nodes
419 /* Cleanup the lower edges */
521 /* Finish the upper linkage of newly added edges/nodes */
2157 struct btrfs_backref_edge *edges[])
2167 next = walk_up_backref(next, edges, &index);
2245 next = walk_down_backref(edges, &index);
2264 next = edges[index]->node[UPPER];
2284 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1];
2290 next = walk_up_backref(next, edges, &index);
2310 next = walk_down_backref(edges, &index);
2327 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1];
2346 edges[index++] = edge;
2349 next = walk_down_backref(edges, &index);
2410 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1];
2432 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);