Searched defs:cuts (Results 1 - 2 of 2) sorted by relevance
/system/update_engine/payload_generator/ |
H A D | inplace_generator_unittest.cc | 247 vector<CutEdgeVertexes> cuts; local 248 EXPECT_TRUE(InplaceGenerator::CutEdges(&graph, cut_edges, &cuts)); 305 vector<CutEdgeVertexes> cuts; local 306 cuts.resize(3); 326 cuts[0].old_dst = 1; 327 cuts[0].old_src = 0; 328 cuts[0].new_vertex = 2; 329 cuts[0].tmp_extents = VectOfExt(tmp, 1); 359 // Store the cuts: 360 cuts[ [all...] |
H A D | inplace_generator.cc | 143 vector<CutEdgeVertexes> cuts; local 144 cuts.reserve(edges.size()); 148 cuts.resize(cuts.size() + 1); 153 cuts.back().tmp_extents = 156 cuts.back().new_vertex = graph->size(); 158 cuts.back().old_src = edge.first; 159 cuts.back().old_dst = edge.second; 178 StoreExtents(cuts.back().tmp_extents, 188 cuts 264 SortCutsByTopoOrder( const vector<Vertex::Index>& op_indexes, vector<CutEdgeVertexes>* cuts) argument 322 ConvertCutsToFull( Graph* graph, const string& new_part, BlobFileWriter* blob_file, vector<Vertex::Index>* op_indexes, vector<vector<Vertex::Index>::size_type>* reverse_op_indexes, const vector<CutEdgeVertexes>& cuts) argument 360 AssignBlockForAdjoiningCuts( Graph* graph, const string& new_part, BlobFileWriter* blob_file, vector<Vertex::Index>* op_indexes, vector<vector<Vertex::Index>::size_type>* reverse_op_indexes, const vector<CutEdgeVertexes>& cuts) argument 476 AssignTempBlocks( Graph* graph, const string& new_part, BlobFileWriter* blob_file, vector<Vertex::Index>* op_indexes, vector<vector<Vertex::Index>::size_type>* reverse_op_indexes, const vector<CutEdgeVertexes>& cuts) argument 616 vector<CutEdgeVertexes> cuts; local [all...] |
Completed in 6 milliseconds