OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:out_edges
(Results
1 - 3
of
3
) sorted by null
/system/update_engine/payload_generator/
graph_types.h
61
EdgeMap
out_edges
;
member in struct:chromeos_update_engine::Vertex
inplace_generator.cc
125
for (auto& edge_prop_pair : vertex->
out_edges
) {
150
(*graph)[edge.first].
out_edges
[edge.second].extents;
162
(*graph)[edge.first].
out_edges
.find(edge.second)->second;
171
(*graph)[edge.first].
out_edges
.insert(make_pair(graph->size() - 1,
187
(*graph)[edge.first].
out_edges
[edge.second].extents,
192
(*graph)[edge.first].
out_edges
.erase(edge.second));
197
(*graph)[edge.second].
out_edges
.insert(
221
(*graph)[blocks[i].writer].
out_edges
.find(blocks[i].reader);
222
if (edge_it == (*graph)[blocks[i].writer].
out_edges
.end()) {
224
(*graph)[blocks[i].writer].
out_edges
.insert
561
Vertex::EdgeMap
out_edges
= (*graph)[cut.old_dst].
out_edges
;
local
[
all
...]
/external/valgrind/coregrind/
m_transtab.c
214
predecessors in the control flow graph. '
out_edges
' points
220
The '
out_edges
' list exists only so that we can visit the
290
its
out_edges
. Furthermore, a matching out-in pair must have
293
a
out_edges
set may not have duplicates when using the
294
equality defined by (TTEntry,offset). Hence the
out_edges
298
then A.
out_edges
= { (B,42), (B,87) } (in any order)
302
mapping between P.
out_edges
and Q.in_edges.
305
OutEdgeArr
out_edges
;
member in struct:__anon37477
[
all
...]
Completed in 367 milliseconds