Home
last modified time | relevance | path

Searched refs:EdgeMap (Results 1 – 9 of 9) sorted by relevance

/system/update_engine/payload_generator/
Dgraph_utils.cc53 Vertex::EdgeMap::iterator edge_it = src->out_edges.find(dst); in AddReadBeforeDep()
56 pair<Vertex::EdgeMap::iterator, bool> result = in AddReadBeforeDep()
79 void DropWriteBeforeDeps(Vertex::EdgeMap* edge_map) { in DropWriteBeforeDeps()
81 for (Vertex::EdgeMap::iterator it = edge_map->begin(); in DropWriteBeforeDeps()
113 void DumpOutEdges(const Vertex::EdgeMap& out_edges) { in DumpOutEdges()
114 for (Vertex::EdgeMap::const_iterator it = out_edges.begin(), in DumpOutEdges()
Dgraph_types.h60 typedef std::map<std::vector<Vertex>::size_type, EdgeProperties> EdgeMap; typedef
61 EdgeMap out_edges;
Dgraph_utils.h45 void DropWriteBeforeDeps(Vertex::EdgeMap* edge_map);
Dtopological_sort.cc39 for (Vertex::EdgeMap::const_iterator it = graph[node].out_edges.begin(); in TopologicalSortVisit()
Dtarjan.cc55 for (Vertex::EdgeMap::iterator it = (*graph)[vertex].out_edges.begin(); in Tarjan()
Dtopological_sort_unittest.cc86 for (Vertex::EdgeMap::const_iterator it = graph[i].out_edges.begin(); in TEST()
Dcycle_breaker.cc136 for (Vertex::EdgeMap::iterator it = blocked_graph_[u].out_edges.begin(); in Unblock()
Dinplace_generator.cc220 Vertex::EdgeMap::iterator edge_it = in CreateEdges()
401 for (Vertex::EdgeMap::const_iterator edge_i = in AssignBlockForAdjoiningCuts()
561 Vertex::EdgeMap out_edges = (*graph)[cut.old_dst].out_edges; in ConvertCutToFullOp()
Dcycle_breaker_unittest.cc170 for (Vertex::EdgeMap::const_iterator it = graph[n_root].out_edges.begin(), in TEST()