OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:in_edges
(Results
1 - 4
of
4
) sorted by null
/external/libpcap/
optimize.c
1175
p = b->
in_edges
;
1391
ep = b->
in_edges
;
1404
if (JT(b->
in_edges
->pred) == b)
1405
diffp = &JT(b->
in_edges
->pred);
1407
diffp = &JF(b->
in_edges
->pred);
1462
for (ep = b->
in_edges
; ep != 0; ep = ep->next) {
1483
ep = b->
in_edges
;
1495
if (JT(b->
in_edges
->pred) == b)
1496
diffp = &JT(b->
in_edges
->pred);
1498
diffp = &JF(b->
in_edges
->pred)
[
all
...]
gencode.h
263
struct edge *
in_edges
;
member in struct:block
/external/valgrind/coregrind/
m_transtab.c
212
/* Admin information for chaining. '
in_edges
' is a set of the
218
blocks. The '
in_edges
' contain slightly more info, enough
221
'
in_edges
' entries of all blocks we're patched through to, in
279
This means in turn that B's
in_edges
set can list A more than
289
times in its
in_edges
. To make things simpler, we then
296
and
in_edges
sets really do have both have set semantics.
300
and B.
in_edges
= { (A,42), (A,87) } (in any order)
303
mapping between P.out_edges and Q.
in_edges
.
305
InEdgeArr
in_edges
;
member in struct:__anon35775
871
InEdgeArr__add(&to_tte->
in_edges
, &ie)
[
all
...]
/external/chromium-trace/catapult/telemetry/third_party/modulegraph/modulegraph/
modulegraph.py
783
_,
in_edges
= self.get_edges(node)
786
for n in
in_edges
:
795
for n in
in_edges
:
[
all
...]
Completed in 1511 milliseconds