Searched refs:new_edge (Results 1 – 2 of 2) sorted by relevance
| /linux/tools/bpf/bpftool/ |
| A D | cfg.c | 256 static struct edge_node *new_edge(struct bb_node *src, struct bb_node *dst, in new_edge() function
284 e = new_edge(bb, bb_next(bb), EDGE_FLAG_FALLTHROUGH); in func_add_bb_edges()
290 e = new_edge(bb_prev(bb), bb, EDGE_FLAG_FALLTHROUGH); in func_add_bb_edges()
298 e = new_edge(bb, NULL, EDGE_FLAG_EMPTY); in func_add_bb_edges()
322 e = new_edge(bb, NULL, EDGE_FLAG_JUMP); in func_add_bb_edges()
|
| /linux/fs/btrfs/ |
| A D | relocation.c | 547 struct btrfs_backref_edge *new_edge; in clone_backref_node() local
587 new_edge = btrfs_backref_alloc_edge(cache); in clone_backref_node()
588 if (!new_edge) in clone_backref_node()
591 btrfs_backref_link_edge(new_edge, edge->node[LOWER], in clone_backref_node()
604 list_for_each_entry(new_edge, &new_node->lower, list[UPPER]) { in clone_backref_node()
605 list_add_tail(&new_edge->list[LOWER], in clone_backref_node()
606 &new_edge->node[LOWER]->upper); in clone_backref_node()
612 new_edge = list_entry(new_node->lower.next, in clone_backref_node()
614 list_del(&new_edge->list[UPPER]); in clone_backref_node()
615 btrfs_backref_free_edge(cache, new_edge); in clone_backref_node()
|
Completed in 652 milliseconds