Lines Matching defs:edge
197 struct btrfs_backref_edge *edge;
201 edge = list_entry(node->upper.next,
203 edges[idx++] = edge;
204 node = edge->node[UPPER];
217 struct btrfs_backref_edge *edge;
222 edge = edges[idx - 1];
223 lower = edge->node[LOWER];
224 if (list_is_last(&edge->list[LOWER], &lower->upper)) {
228 edge = list_entry(edge->list[LOWER].next,
230 edges[idx - 1] = edge;
232 return edge->node[UPPER];
421 struct btrfs_backref_edge *edge;
424 edge = list_entry(cur->lower.next,
426 list_del(&edge->list[UPPER]);
427 list_del(&edge->list[LOWER]);
428 lower = edge->node[LOWER];
429 btrfs_backref_free_edge(cache, edge);
479 struct btrfs_backref_edge *edge;
509 edge = list_first_entry_or_null(&cache->pending_edge,
515 if (edge) {
516 list_del_init(&edge->list[UPPER]);
517 cur = edge->node[UPPER];
519 } while (edge);
557 struct btrfs_backref_edge *edge;
597 list_for_each_entry(edge, &node->lower, list[UPPER]) {
602 btrfs_backref_link_edge(new_edge, edge->node[LOWER],
2326 struct btrfs_backref_edge *edge;
2344 edge = list_entry(next->upper.next,
2346 edges[index++] = edge;
2347 next = edge->node[UPPER];
2409 struct btrfs_backref_edge *edge;
2426 list_for_each_entry(edge, &node->upper, list[LOWER]) {
2431 upper = edge->node[UPPER];
2607 struct btrfs_backref_edge *edge;
2622 edge = list_entry(next->upper.next,
2624 edges[index++] = edge;
2625 next = edge->node[UPPER];