Home
last modified time | relevance | path

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

/system/update_engine/payload_generator/
Dtarjan.cc33 void TarjanAlgorithm::Execute(Vertex::Index vertex, in Execute() argument
41 required_vertex_ = vertex; in Execute()
43 Tarjan(vertex, graph); in Execute()
48 void TarjanAlgorithm::Tarjan(Vertex::Index vertex, Graph* graph) { in Tarjan() argument
49 CHECK_EQ((*graph)[vertex].index, kInvalidIndex); in Tarjan()
50 (*graph)[vertex].index = index_; in Tarjan()
51 (*graph)[vertex].lowlink = index_; in Tarjan()
53 stack_.push_back(vertex); in Tarjan()
54 for (Vertex::EdgeMap::iterator it = (*graph)[vertex].out_edges.begin(); in Tarjan()
55 it != (*graph)[vertex].out_edges.end(); in Tarjan()
[all …]
Dcycle_breaker.cc161 bool CycleBreaker::Circuit(Vertex::Index vertex, Vertex::Index depth) { in Circuit() argument
164 stack_.push_back(vertex); in Circuit()
165 blocked_[vertex] = true; in Circuit()
181 subgraph_[vertex].subgraph_edges.begin(); in Circuit()
182 w != subgraph_[vertex].subgraph_edges.end(); in Circuit()
200 Unblock(vertex); in Circuit()
203 subgraph_[vertex].subgraph_edges.begin(); in Circuit()
204 w != subgraph_[vertex].subgraph_edges.end(); in Circuit()
206 if (blocked_graph_[*w].out_edges.find(vertex) == in Circuit()
209 make_pair(vertex, EdgeProperties())); in Circuit()
[all …]
Dinplace_generator.cc109 void InplaceGenerator::SubstituteBlocks(Vertex* vertex, in SubstituteBlocks() argument
113 vector<uint64_t> read_blocks = ExpandExtents(vertex->aop.op.src_extents()); in SubstituteBlocks()
125 for (auto& edge_prop_pair : vertex->out_edges) { in SubstituteBlocks()
134 vertex->aop.op.clear_src_extents(); in SubstituteBlocks()
136 StoreExtents(new_extents, vertex->aop.op.mutable_src_extents()); in SubstituteBlocks()
643 Vertex* vertex) { in CreateScratchNode() argument
644 vertex->aop.name = "<scratch>"; in CreateScratchNode()
645 vertex->aop.op.set_type(InstallOperation::REPLACE_BZ); in CreateScratchNode()
646 vertex->aop.op.set_data_offset(0); in CreateScratchNode()
647 vertex->aop.op.set_data_length(0); in CreateScratchNode()
[all …]
Dtarjan.h38 void Execute(Vertex::Index vertex,
43 void Tarjan(Vertex::Index vertex, Graph* graph);
Dinplace_generator.h82 static void SubstituteBlocks(Vertex* vertex,
172 Vertex* vertex);
183 Vertex::Index vertex,
Dinplace_generator_unittest.cc159 Vertex vertex; in TEST_F() local
160 InstallOperation& op = vertex.aop.op; in TEST_F()
166 InplaceGenerator::SubstituteBlocks(&vertex, remove_blocks, replace_blocks); in TEST_F()
576 Vertex vertex; in TEST_F() local
577 InplaceGenerator::CreateScratchNode(12, 34, &vertex); in TEST_F()
578 EXPECT_EQ(InstallOperation::REPLACE_BZ, vertex.aop.op.type()); in TEST_F()
579 EXPECT_EQ(0U, vertex.aop.op.data_offset()); in TEST_F()
580 EXPECT_EQ(0U, vertex.aop.op.data_length()); in TEST_F()
581 EXPECT_EQ(1, vertex.aop.op.dst_extents_size()); in TEST_F()
582 EXPECT_EQ(12U, vertex.aop.op.dst_extents(0).start_block()); in TEST_F()
[all …]
Dcycle_breaker.h53 bool Circuit(Vertex::Index vertex, Vertex::Index depth);
Dcycle_breaker_unittest.cc40 for (Vertex& vertex : *graph) { in SetOpForNodes()
41 vertex.aop.op.set_type(InstallOperation::MOVE); in SetOpForNodes()
/system/core/libmemunreachable/
DTarjan.h76 void Tarjan(Node<T>* vertex, Graph<T>& graph);
102 void TarjanAlgorithm<T>::Tarjan(Node<T>* vertex, Graph<T>& graph) { in Tarjan() argument
103 assert(vertex->index == UNDEFINED_INDEX); in Tarjan()
104 vertex->index = index_; in Tarjan()
105 vertex->lowlink = index_; in Tarjan()
107 stack_.push_back(vertex); in Tarjan()
108 for (auto& it : vertex->references_out) { in Tarjan()
112 vertex->lowlink = std::min(vertex->lowlink, vertex_next->lowlink); in Tarjan()
114 vertex->lowlink = std::min(vertex->lowlink, vertex_next->index); in Tarjan()
117 if (vertex->lowlink == vertex->index) { in Tarjan()
[all …]