Home | History | Annotate | Download | only in payload_generator

Lines Matching defs:cut

168         << "Can't cut edge that has write-before relationship.";
331 for (const CutEdgeVertexes& cut : cuts) {
334 cut,
337 deleted_nodes.insert(cut.new_vertex);
452 // Replace temp blocks in each cut
454 const CutEdgeVertexes& cut = cuts[i];
461 cut.tmp_extents,
467 InstallOperation* op = &(*graph)[cut.new_vertex].aop.op;
490 LOG(INFO) << "Fixing temp blocks in cut " << i
552 const CutEdgeVertexes& cut,
558 if ((*graph)[cut.old_dst].aop.op.type() != InstallOperation::REPLACE_BZ &&
559 (*graph)[cut.old_dst].aop.op.type() != InstallOperation::REPLACE) {
560 Vertex::EdgeMap out_edges = (*graph)[cut.old_dst].out_edges;
567 ExtentsToVector((*graph)[cut.old_dst].aop.op.dst_extents(),
577 (*graph)[cut.old_dst].aop.name,
583 graph, cut.old_dst, nullptr, new_aop.front().op, new_aop.front().name));
585 (*graph)[cut.old_dst].out_edges = out_edges;
589 graph_utils::DropIncomingEdgesTo(graph, cut.old_dst);
593 (*graph)[cut.old_src].out_edges.erase(cut.new_vertex);
594 CHECK((*graph)[cut.old_dst].out_edges.find(cut.new_vertex) ==
595 (*graph)[cut.old_dst].out_edges.end());
596 (*graph)[cut.new_vertex].valid = false;
597 LOG(INFO) << "marked node invalid: " << cut.new_vertex;