Searched refs:UPPER (Results 1 – 3 of 3) sorted by relevance
| /fs/btrfs/ |
| D | backref.c | 2612 upper = edge->node[UPPER];
2614 list_del(&edge->list[UPPER]);
2724 list_add_tail(&edge->list[UPPER], &cache->pending_edge);
2729 INIT_LIST_HEAD(&edge->list[UPPER]);
2873 list_add_tail(&edge->list[UPPER],
2878 INIT_LIST_HEAD(&edge->list[UPPER]);
2884 INIT_LIST_HEAD(&edge->list[UPPER]);
2950 ASSERT(list_empty(&edge->list[UPPER]));
2951 exist = edge->node[UPPER];
2957 list_add_tail(&edge->list[UPPER], &cache->pending_edge);
[all …]
|
| D | backref.h | 212 #define UPPER 1 macro
287 edge->node[UPPER] = upper; in btrfs_backref_link_edge()
291 list_add_tail(&edge->list[UPPER], &upper->lower); in btrfs_backref_link_edge()
|
| D | relocation.c | 192 node = edge->node[UPPER]; in walk_up_backref()
220 return edge->node[UPPER]; in walk_down_backref()
413 struct btrfs_backref_edge, list[UPPER]); in handle_useless_nodes()
414 list_del(&edge->list[UPPER]); in handle_useless_nodes()
497 struct btrfs_backref_edge, list[UPPER]); in build_backref_tree()
503 list_del_init(&edge->list[UPPER]); in build_backref_tree()
504 cur = edge->node[UPPER]; in build_backref_tree()
584 list_for_each_entry(edge, &node->lower, list[UPPER]) { in clone_backref_node()
602 list_for_each_entry(new_edge, &new_node->lower, list[UPPER]) { in clone_backref_node()
611 struct btrfs_backref_edge, list[UPPER]); in clone_backref_node()
[all …]
|