Home
last modified time | relevance | path

Searched refs:out_edges (Results 1 – 11 of 11) sorted by relevance

/system/update_engine/payload_generator/
Dcycle_breaker_unittest.cc63 graph[n_a].out_edges.insert(make_pair(n_e, EdgeProperties())); in TEST()
64 graph[n_a].out_edges.insert(make_pair(n_f, EdgeProperties())); in TEST()
65 graph[n_b].out_edges.insert(make_pair(n_a, EdgeProperties())); in TEST()
66 graph[n_c].out_edges.insert(make_pair(n_d, EdgeProperties())); in TEST()
67 graph[n_d].out_edges.insert(make_pair(n_e, EdgeProperties())); in TEST()
68 graph[n_d].out_edges.insert(make_pair(n_f, EdgeProperties())); in TEST()
69 graph[n_e].out_edges.insert(make_pair(n_b, EdgeProperties())); in TEST()
70 graph[n_e].out_edges.insert(make_pair(n_c, EdgeProperties())); in TEST()
71 graph[n_e].out_edges.insert(make_pair(n_f, EdgeProperties())); in TEST()
72 graph[n_f].out_edges.insert(make_pair(n_g, EdgeProperties())); in TEST()
[all …]
Dgraph_utils_unittest.cc38 graph[0].out_edges.insert(make_pair(1, EdgeProperties())); in TEST()
40 vector<Extent>& extents = graph[0].out_edges[1].extents; in TEST()
64 EXPECT_EQ(1U, graph[0].out_edges.size()); in TEST()
66 Extent& extent = graph[0].out_edges[1].extents[0]; in TEST()
71 EXPECT_EQ(1U, graph[0].out_edges.size()); in TEST()
73 Extent& extent = graph[0].out_edges[1].extents[0]; in TEST()
79 EXPECT_EQ(1U, graph[2].out_edges.size()); in TEST()
81 Extent& extent = graph[2].out_edges[1].extents[0]; in TEST()
86 graph[2].out_edges[1].write_extents.swap(graph[2].out_edges[1].extents); in TEST()
87 graph_utils::DropWriteBeforeDeps(&graph[2].out_edges); in TEST()
[all …]
Dtopological_sort_unittest.cc68 graph[n_i].out_edges.insert(make_pair(n_j, EdgeProperties())); in TEST()
69 graph[n_i].out_edges.insert(make_pair(n_c, EdgeProperties())); in TEST()
70 graph[n_i].out_edges.insert(make_pair(n_e, EdgeProperties())); in TEST()
71 graph[n_i].out_edges.insert(make_pair(n_h, EdgeProperties())); in TEST()
72 graph[n_c].out_edges.insert(make_pair(n_b, EdgeProperties())); in TEST()
73 graph[n_b].out_edges.insert(make_pair(n_a, EdgeProperties())); in TEST()
74 graph[n_e].out_edges.insert(make_pair(n_d, EdgeProperties())); in TEST()
75 graph[n_e].out_edges.insert(make_pair(n_g, EdgeProperties())); in TEST()
76 graph[n_g].out_edges.insert(make_pair(n_d, EdgeProperties())); in TEST()
77 graph[n_g].out_edges.insert(make_pair(n_f, EdgeProperties())); in TEST()
[all …]
Dtarjan_unittest.cc49 graph[n_a].out_edges.insert(make_pair(n_e, EdgeProperties())); in TEST()
50 graph[n_a].out_edges.insert(make_pair(n_f, EdgeProperties())); in TEST()
51 graph[n_b].out_edges.insert(make_pair(n_a, EdgeProperties())); in TEST()
52 graph[n_c].out_edges.insert(make_pair(n_d, EdgeProperties())); in TEST()
53 graph[n_d].out_edges.insert(make_pair(n_e, EdgeProperties())); in TEST()
54 graph[n_d].out_edges.insert(make_pair(n_f, EdgeProperties())); in TEST()
55 graph[n_e].out_edges.insert(make_pair(n_b, EdgeProperties())); in TEST()
56 graph[n_e].out_edges.insert(make_pair(n_c, EdgeProperties())); in TEST()
57 graph[n_e].out_edges.insert(make_pair(n_f, EdgeProperties())); in TEST()
58 graph[n_f].out_edges.insert(make_pair(n_g, EdgeProperties())); in TEST()
[all …]
Dinplace_generator_unittest.cc247 EXPECT_TRUE(graph.back().out_edges.empty()); in TEST_F()
264 EXPECT_EQ(2U, graph[0].out_edges.size()); in TEST_F()
265 EXPECT_TRUE(graph[0].out_edges.end() != graph[0].out_edges.find(1)); in TEST_F()
266 EXPECT_TRUE(graph[0].out_edges.end() != graph[0].out_edges.find(graph.size() - in TEST_F()
283 EXPECT_EQ(1U, graph[1].out_edges.size()); in TEST_F()
284 EXPECT_TRUE(graph[1].out_edges.end() != graph[1].out_edges.find(2)); in TEST_F()
311 graph[0].out_edges[2] = EdgeWithReadDep(VectOfExt(1, 1)); in TEST_F()
312 graph[1].out_edges[2] = EdgeWithWriteDep(VectOfExt(tmp, 1)); in TEST_F()
313 graph[1].out_edges[0] = EdgeWithReadDep(VectOfExt(0, 1)); in TEST_F()
342 graph[3].out_edges[6] = EdgeWithReadDep(VectOfExt(2, 2)); in TEST_F()
[all …]
Dgraph_utils.cc41 graph[edge.first].out_edges.find(edge.second)->second.extents; in EdgeWeight()
53 Vertex::EdgeMap::iterator edge_it = src->out_edges.find(dst); in AddReadBeforeDep()
54 if (edge_it == src->out_edges.end()) { in AddReadBeforeDep()
57 src->out_edges.insert(make_pair(dst, EdgeProperties())); in AddReadBeforeDep()
99 it->out_edges.erase(index); in DropIncomingEdgesTo()
113 void DumpOutEdges(const Vertex::EdgeMap& out_edges) { in DumpOutEdges() argument
114 for (Vertex::EdgeMap::const_iterator it = out_edges.begin(), in DumpOutEdges()
115 e = out_edges.end(); it != e; ++it) { in DumpOutEdges()
136 DumpOutEdges(graph[i].out_edges); in DumpGraph()
Dcycle_breaker.cc67 subgraph_[i - 1].out_edges.clear(); in BreakCycles()
70 subgraph_[j].out_edges.erase(i - 1); in BreakCycles()
86 if (utils::MapContainsKey(subgraph_[*it].out_edges, *jt)) in BreakCycles()
136 for (Vertex::EdgeMap::iterator it = blocked_graph_[u].out_edges.begin(); in Unblock()
137 it != blocked_graph_[u].out_edges.end(); ) { in Unblock()
139 blocked_graph_[u].out_edges.erase(it++); in Unblock()
199 if (blocked_graph_[*w].out_edges.find(vertex) == in Circuit()
200 blocked_graph_[*w].out_edges.end()) { in Circuit()
201 blocked_graph_[*w].out_edges.insert(make_pair(vertex, in Circuit()
Dinplace_generator.cc125 for (auto& edge_prop_pair : vertex->out_edges) { in SubstituteBlocks()
150 (*graph)[edge.first].out_edges[edge.second].extents; in CutEdges()
162 (*graph)[edge.first].out_edges.find(edge.second)->second; in CutEdges()
171 (*graph)[edge.first].out_edges.insert(make_pair(graph->size() - 1, in CutEdges()
187 (*graph)[edge.first].out_edges[edge.second].extents, in CutEdges()
192 (*graph)[edge.first].out_edges.erase(edge.second)); in CutEdges()
197 (*graph)[edge.second].out_edges.insert( in CutEdges()
221 (*graph)[blocks[i].writer].out_edges.find(blocks[i].reader); in CreateEdges()
222 if (edge_it == (*graph)[blocks[i].writer].out_edges.end()) { in CreateEdges()
224 (*graph)[blocks[i].writer].out_edges.insert( in CreateEdges()
[all …]
Dtopological_sort.cc39 for (Vertex::EdgeMap::const_iterator it = graph[node].out_edges.begin(); in TopologicalSortVisit()
40 it != graph[node].out_edges.end(); ++it) { in TopologicalSortVisit()
Dtarjan.cc55 for (Vertex::EdgeMap::iterator it = (*graph)[vertex].out_edges.begin(); in Tarjan()
56 it != (*graph)[vertex].out_edges.end(); ++it) { in Tarjan()
Dgraph_types.h61 EdgeMap out_edges; member