Searched refs:new_edge (Results 1 – 2 of 2) sorted by relevance
| /Linux-v5.4/tools/bpf/bpftool/ |
| 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-v5.4/fs/btrfs/ |
| D | relocation.c | 1179 struct backref_edge *new_edge; in clone_backref_node() local
1219 new_edge = alloc_backref_edge(cache); in clone_backref_node()
1220 if (!new_edge) in clone_backref_node()
1223 new_edge->node[UPPER] = new_node; in clone_backref_node()
1224 new_edge->node[LOWER] = edge->node[LOWER]; in clone_backref_node()
1225 list_add_tail(&new_edge->list[UPPER], in clone_backref_node()
1238 list_for_each_entry(new_edge, &new_node->lower, list[UPPER]) { in clone_backref_node()
1239 list_add_tail(&new_edge->list[LOWER], in clone_backref_node()
1240 &new_edge->node[LOWER]->upper); in clone_backref_node()
1246 new_edge = list_entry(new_node->lower.next, in clone_backref_node()
[all …]
|
