Home
last modified time | relevance | path

Searched refs:in_edges (Results 1 – 4 of 4) sorted by relevance

/external/libpcap/
Doptimize.c1175 p = b->in_edges; in opt_blk()
1391 ep = b->in_edges; in or_pullup()
1404 if (JT(b->in_edges->pred) == b) in or_pullup()
1405 diffp = &JT(b->in_edges->pred); in or_pullup()
1407 diffp = &JF(b->in_edges->pred); in or_pullup()
1462 for (ep = b->in_edges; ep != 0; ep = ep->next) { in or_pullup()
1483 ep = b->in_edges; in and_pullup()
1495 if (JT(b->in_edges->pred) == b) in and_pullup()
1496 diffp = &JT(b->in_edges->pred); in and_pullup()
1498 diffp = &JF(b->in_edges->pred); in and_pullup()
[all …]
Dgencode.h263 struct edge *in_edges; member
/external/valgrind/coregrind/
Dm_transtab.c305 InEdgeArr in_edges; member
871 InEdgeArr__add(&to_tte->in_edges, &ie); in VG_()
932 n = InEdgeArr__size(&here_tte->in_edges); in unchain_in_preparation_for_deletion()
934 InEdge* ie = InEdgeArr__index(&here_tte->in_edges, i); in unchain_in_preparation_for_deletion()
961 m = InEdgeArr__size(&to_tte->in_edges); in unchain_in_preparation_for_deletion()
964 InEdge* ie = InEdgeArr__index(&to_tte->in_edges, j); in unchain_in_preparation_for_deletion()
970 InEdgeArr__deleteIndex(&to_tte->in_edges, j); in unchain_in_preparation_for_deletion()
973 InEdgeArr__makeEmpty(&here_tte->in_edges); in unchain_in_preparation_for_deletion()
/external/chromium-trace/catapult/telemetry/third_party/modulegraph/modulegraph/
Dmodulegraph.py783 _, in_edges = self.get_edges(node)
786 for n in in_edges:
795 for n in in_edges: