michael@0: /* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
michael@0:  * vim: set ts=8 sts=4 et sw=4 tw=99:
michael@0:  * This Source Code Form is subject to the terms of the Mozilla Public
michael@0:  * License, v. 2.0. If a copy of the MPL was not distributed with this
michael@0:  * file, You can obtain one at http://mozilla.org/MPL/2.0/. */
michael@0: 
michael@0: #include "jit/EdgeCaseAnalysis.h"
michael@0: 
michael@0: #include "jit/MIR.h"
michael@0: #include "jit/MIRGraph.h"
michael@0: 
michael@0: using namespace js;
michael@0: using namespace js::jit;
michael@0: 
michael@0: EdgeCaseAnalysis::EdgeCaseAnalysis(MIRGenerator *mir, MIRGraph &graph)
michael@0:   : mir(mir), graph(graph)
michael@0: {
michael@0: }
michael@0: 
michael@0: bool
michael@0: EdgeCaseAnalysis::analyzeLate()
michael@0: {
michael@0:     // Renumber definitions for NeedNegativeZeroCheck under analyzeEdgeCasesBackward.
michael@0:     uint32_t nextId = 1;
michael@0: 
michael@0:     for (ReversePostorderIterator block(graph.rpoBegin()); block != graph.rpoEnd(); block++) {
michael@0:         if (mir->shouldCancel("Analyze Late (first loop)"))
michael@0:             return false;
michael@0:         for (MDefinitionIterator iter(*block); iter; iter++) {
michael@0:             iter->setId(nextId++);
michael@0:             iter->analyzeEdgeCasesForward();
michael@0:         }
michael@0:         block->lastIns()->setId(nextId++);
michael@0:     }
michael@0: 
michael@0:     for (PostorderIterator block(graph.poBegin()); block != graph.poEnd(); block++) {
michael@0:         if (mir->shouldCancel("Analyze Late (second loop)"))
michael@0:             return false;
michael@0:         for (MInstructionReverseIterator riter(block->rbegin()); riter != block->rend(); riter++)
michael@0:             riter->analyzeEdgeCasesBackward();
michael@0:     }
michael@0: 
michael@0:     return true;
michael@0: }