Home
last modified time | relevance | path

Searched refs:edge (Results 1 – 3 of 3) sorted by relevance

/fs/btrfs/
Dbackref.c2584 struct btrfs_backref_edge *edge; local
2586 edge = kzalloc(sizeof(*edge), GFP_NOFS);
2587 if (edge)
2589 return edge;
2603 struct btrfs_backref_edge *edge; local
2610 edge = list_entry(node->upper.next, struct btrfs_backref_edge,
2612 upper = edge->node[UPPER];
2613 list_del(&edge->list[LOWER]);
2614 list_del(&edge->list[UPPER]);
2615 btrfs_backref_free_edge(cache, edge);
[all …]
Dbackref.h281 static inline void btrfs_backref_link_edge(struct btrfs_backref_edge *edge, in btrfs_backref_link_edge() argument
287 edge->node[LOWER] = lower; in btrfs_backref_link_edge()
288 edge->node[UPPER] = upper; in btrfs_backref_link_edge()
290 list_add_tail(&edge->list[LOWER], &lower->upper); in btrfs_backref_link_edge()
292 list_add_tail(&edge->list[UPPER], &upper->lower); in btrfs_backref_link_edge()
309 struct btrfs_backref_edge *edge) in btrfs_backref_free_edge() argument
311 if (edge) { in btrfs_backref_free_edge()
313 kfree(edge); in btrfs_backref_free_edge()
Drelocation.c186 struct btrfs_backref_edge *edge; in walk_up_backref() local
190 edge = list_entry(node->upper.next, in walk_up_backref()
192 edges[idx++] = edge; in walk_up_backref()
193 node = edge->node[UPPER]; in walk_up_backref()
206 struct btrfs_backref_edge *edge; in walk_down_backref() local
211 edge = edges[idx - 1]; in walk_down_backref()
212 lower = edge->node[LOWER]; in walk_down_backref()
213 if (list_is_last(&edge->list[LOWER], &lower->upper)) { in walk_down_backref()
217 edge = list_entry(edge->list[LOWER].next, in walk_down_backref()
219 edges[idx - 1] = edge; in walk_down_backref()
[all …]