Searched refs:new_vertex (Results 1 - 3 of 3) sorted by relevance

/system/update_engine/payload_generator/
H A Dinplace_generator.cc156 cuts.back().new_vertex = graph->size();
338 deleted_nodes.insert(cut.new_vertex);
468 InstallOperation* op = &(*graph)[cut.new_vertex].aop.op;
493 << cuts[i].new_vertex << " path: "
592 (*graph)[cut.old_src].out_edges.erase(cut.new_vertex);
593 CHECK((*graph)[cut.old_dst].out_edges.find(cut.new_vertex) ==
595 (*graph)[cut.new_vertex].valid = false;
596 LOG(INFO) << "marked node invalid: " << cut.new_vertex;
H A Dinplace_generator.h37 // nodes old_src -> old_dst by creating new vertex new_vertex. The new
39 // old_src -(read before)-> new_vertex <-(write before)- old_dst
40 // new_vertex is a MOVE operation that moves some existing blocks into
41 // temp space. The temp extents are, by necessity, stored in new_vertex
46 Vertex::Index new_vertex; member in struct:chromeos_update_engine::CutEdgeVertexes
H A Dinplace_generator_unittest.cc328 cuts[0].new_vertex = 2;
362 cuts[1].new_vertex = 6;
366 cuts[2].new_vertex = 7;

Completed in 159 milliseconds