Home
last modified time | relevance | path

Searched refs:new_edge (Results 1 – 2 of 2) sorted by relevance

/Linux-v4.19/tools/bpf/bpftool/
Dcfg.c285 static struct edge_node *new_edge(struct bb_node *src, struct bb_node *dst, in new_edge() function
313 e = new_edge(bb, bb_next(bb), EDGE_FLAG_FALLTHROUGH); in func_add_bb_edges()
319 e = new_edge(bb_prev(bb), bb, EDGE_FLAG_FALLTHROUGH); in func_add_bb_edges()
327 e = new_edge(bb, NULL, EDGE_FLAG_EMPTY); in func_add_bb_edges()
351 e = new_edge(bb, NULL, EDGE_FLAG_JUMP); in func_add_bb_edges()
/Linux-v4.19/fs/btrfs/
Drelocation.c1166 struct backref_edge *new_edge; in clone_backref_node() local
1206 new_edge = alloc_backref_edge(cache); in clone_backref_node()
1207 if (!new_edge) in clone_backref_node()
1210 new_edge->node[UPPER] = new_node; in clone_backref_node()
1211 new_edge->node[LOWER] = edge->node[LOWER]; in clone_backref_node()
1212 list_add_tail(&new_edge->list[UPPER], in clone_backref_node()
1225 list_for_each_entry(new_edge, &new_node->lower, list[UPPER]) { in clone_backref_node()
1226 list_add_tail(&new_edge->list[LOWER], in clone_backref_node()
1227 &new_edge->node[LOWER]->upper); in clone_backref_node()
1233 new_edge = list_entry(new_node->lower.next, in clone_backref_node()
[all …]