%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 2016 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. #ifndef V8_COMPILER_CHECKPOINT_ELIMINATION_H_ #define V8_COMPILER_CHECKPOINT_ELIMINATION_H_ #include "src/base/compiler-specific.h" #include "src/common/globals.h" #include "src/compiler/graph-reducer.h" namespace v8 { namespace internal { namespace compiler { // Performs elimination of redundant checkpoints within the graph. class V8_EXPORT_PRIVATE CheckpointElimination final : public NON_EXPORTED_BASE(AdvancedReducer) { public: explicit CheckpointElimination(Editor* editor); ~CheckpointElimination() final = default; const char* reducer_name() const override { return "CheckpointElimination"; } Reduction Reduce(Node* node) final; private: Reduction ReduceCheckpoint(Node* node); }; } // namespace compiler } // namespace internal } // namespace v8 #endif // V8_COMPILER_CHECKPOINT_ELIMINATION_H_