Searched refs:in_edges (Results 1 - 3 of 3) sorted by relevance

/external/libpcap/
H A Doptimize.c1165 p = b->in_edges;
1381 ep = b->in_edges;
1394 if (JT(b->in_edges->pred) == b)
1395 diffp = &JT(b->in_edges->pred);
1397 diffp = &JF(b->in_edges->pred);
1452 for (ep = b->in_edges; ep != 0; ep = ep->next) {
1473 ep = b->in_edges;
1485 if (JT(b->in_edges->pred) == b)
1486 diffp = &JT(b->in_edges->pred);
1488 diffp = &JF(b->in_edges
[all...]
H A Dgencode.h265 struct edge *in_edges; member in struct:block
/external/valgrind/main/coregrind/
H A Dm_transtab.c186 /* Admin information for chaining. 'in_edges' is a set of the
192 blocks. The 'in_edges' contain slightly more info, enough
195 'in_edges' entries of all blocks we're patched through to, in
253 This means in turn that B's in_edges set can list A more than
263 times in its in_edges. To make things simpler, we then
270 and in_edges sets really do have both have set semantics.
274 and B.in_edges = { (A,42), (A,87) } (in any order)
277 mapping between P.out_edges and Q.in_edges.
279 InEdgeArr in_edges; member in struct:__anon32681
825 InEdgeArr__add(&to_tte->in_edges,
[all...]

Completed in 305 milliseconds