Lines Matching defs:old_dst
159 cuts.back().old_dst = edge.second;
241 return table_[a.old_dst] < table_[b.old_dst];
318 // Converts the cuts, which must all have the same |old_dst| member,
319 // to full. It does this by converting the |old_dst| to REPLACE or
320 // REPLACE_BZ, dropping all incoming edges to |old_dst|, and marking
339 deleted_nodes.insert(cuts[0].old_dst);
348 new_op_indexes.push_back(cuts[0].old_dst);
356 // the same old_dst member. If temp blocks can't be found, old_dst will be
368 const Vertex::Index old_dst = cuts[0].old_dst;
387 for (vector<Vertex::Index>::size_type i = (*reverse_op_indexes)[old_dst] + 1,
447 old_dst,
460 InplaceGenerator::SubstituteBlocks(&(*graph)[old_dst],
485 // group of cuts w/ the same old_dst:
491 << ": old dst: " << cuts[i].old_dst << " new vertex: "
493 << (*graph)[cuts[i].old_dst].aop.name;
495 if (cuts_group.empty() || (cuts_group[0].old_dst == cuts[i].old_dst)) {
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);
594 CHECK((*graph)[cut.old_dst].out_edges.find(cut.new_vertex) ==
595 (*graph)[cut.old_dst].out_edges.end());