%PDF- <> %âãÏÓ endobj 2 0 obj <> endobj 3 0 obj <>/ExtGState<>/ProcSet[/PDF/Text/ImageB/ImageC/ImageI] >>/Annots[ 28 0 R 29 0 R] /MediaBox[ 0 0 595.5 842.25] /Contents 4 0 R/Group<>/Tabs/S>> endobj ºaâÚÎΞ-ÌE1ÍØÄ÷{òò2ÿ ÛÖ^ÔÀá TÎ{¦?§®¥kuµùÕ5sLOšuY>endobj 2 0 obj<>endobj 2 0 obj<>endobj 2 0 obj<>endobj 2 0 obj<> endobj 2 0 obj<>endobj 2 0 obj<>es 3 0 R>> endobj 2 0 obj<> ox[ 0.000000 0.000000 609.600000 935.600000]/Fi endobj 3 0 obj<> endobj 7 1 obj<>/ProcSet[/PDF/Text/ImageB/ImageC/ImageI]>>/Subtype/Form>> stream
// Copyright 2015 the V8 project authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. #include "src/compiler/graph-trimmer.h" #include "src/compiler/graph.h" namespace v8 { namespace internal { namespace compiler { GraphTrimmer::GraphTrimmer(Zone* zone, Graph* graph) : graph_(graph), is_live_(graph, 2), live_(zone) { live_.reserve(graph->NodeCount()); } GraphTrimmer::~GraphTrimmer() = default; void GraphTrimmer::TrimGraph() { // Mark end node as live. MarkAsLive(graph()->end()); // Compute transitive closure of live nodes. for (size_t i = 0; i < live_.size(); ++i) { Node* const live = live_[i]; for (Node* const input : live->inputs()) MarkAsLive(input); } // Remove dead->live edges. for (Node* const live : live_) { DCHECK(IsLive(live)); for (Edge edge : live->use_edges()) { Node* const user = edge.from(); if (!IsLive(user)) { if (FLAG_trace_turbo_trimming) { StdoutStream{} << "DeadLink: " << *user << "(" << edge.index() << ") -> " << *live << std::endl; } edge.UpdateTo(nullptr); } } } } } // namespace compiler } // namespace internal } // namespace v8