Searched refs:LOWER (Results 1 – 3 of 3) sorted by relevance
| /fs/btrfs/ |
| D | backref.h | 211 #define LOWER 0 macro
286 edge->node[LOWER] = lower; in btrfs_backref_link_edge()
289 list_add_tail(&edge->list[LOWER], &lower->upper); in btrfs_backref_link_edge()
|
| D | backref.c | 2611 list[LOWER]);
2613 list_del(&edge->list[LOWER]);
2949 list[LOWER]);
3064 list_for_each_entry(edge, &start->upper, list[LOWER])
3075 lower = edge->node[LOWER];
3079 list_del(&edge->list[LOWER]);
3134 list_for_each_entry(edge, &upper->upper, list[LOWER])
3156 list_del(&edge->list[LOWER]);
3157 lower = edge->node[LOWER];
3173 list_for_each_entry(edge, &upper->upper, list[LOWER])
|
| D | relocation.c | 190 struct btrfs_backref_edge, list[LOWER]); in walk_up_backref()
211 lower = edge->node[LOWER]; in walk_down_backref()
212 if (list_is_last(&edge->list[LOWER], &lower->upper)) { in walk_down_backref()
216 edge = list_entry(edge->list[LOWER].next, in walk_down_backref()
217 struct btrfs_backref_edge, list[LOWER]); in walk_down_backref()
415 list_del(&edge->list[LOWER]); in handle_useless_nodes()
416 lower = edge->node[LOWER]; in handle_useless_nodes()
589 btrfs_backref_link_edge(new_edge, edge->node[LOWER], in clone_backref_node()
603 list_add_tail(&new_edge->list[LOWER], in clone_backref_node()
604 &new_edge->node[LOWER]->upper); in clone_backref_node()
[all …]
|