HomeSort by relevance Sort by last modified time
    Searched full:in_edges (Results 1 - 4 of 4) sorted by null

  /external/libpcap/
optimize.c 1207 p = b->in_edges;
1429 ep = b->in_edges;
1442 if (JT(b->in_edges->pred) == b)
1443 diffp = &JT(b->in_edges->pred);
1445 diffp = &JF(b->in_edges->pred);
    [all...]
gencode.h 246 struct edge *in_edges; member in struct:block
  /external/valgrind/main/coregrind/
m_transtab.c 185 /* Admin information for chaining. 'in_edges' is a set of the
191 blocks. The 'in_edges' contain slightly more info, enough
194 'in_edges' entries of all blocks we're patched through to, in
252 This means in turn that B's in_edges set can list A more than
262 times in its in_edges. To make things simpler, we then
269 and in_edges sets really do have both have set semantics.
273 and B.in_edges = { (A,42), (A,87) } (in any order)
276 mapping between P.out_edges and Q.in_edges.
278 InEdgeArr in_edges; member in struct:__anon27965
789 InEdgeArr__add(&to_tte->in_edges, &ie)
    [all...]
  /dalvik/vm/compiler/codegen/x86/
AnalysisO1.h 278 Edge_O1* in_edges[MAX_NUM_EDGE_PER_BB]; //array of Edge* member in struct:BasicBlock_O1

Completed in 105 milliseconds