blob: a92ca93ddd00c3ba7ea80ce6b3748b66b2fe3c81 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
|
/* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 2 -*-
* vim: set ts=8 sts=2 et sw=2 tw=80:
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
#include "jit/EdgeCaseAnalysis.h"
#include "jit/MIR.h"
#include "jit/MIRGenerator.h"
#include "jit/MIRGraph.h"
using namespace js;
using namespace js::jit;
EdgeCaseAnalysis::EdgeCaseAnalysis(MIRGenerator* mir, MIRGraph& graph)
: mir(mir), graph(graph) {}
bool EdgeCaseAnalysis::analyzeLate() {
// Renumber definitions for NeedNegativeZeroCheck under
// analyzeEdgeCasesBackward.
uint32_t nextId = 0;
for (ReversePostorderIterator block(graph.rpoBegin());
block != graph.rpoEnd(); block++) {
for (MDefinitionIterator iter(*block); iter; iter++) {
if (mir->shouldCancel("Analyze Late (first loop)")) {
return false;
}
iter->setId(nextId++);
iter->analyzeEdgeCasesForward();
}
block->lastIns()->setId(nextId++);
}
for (PostorderIterator block(graph.poBegin()); block != graph.poEnd();
block++) {
for (MInstructionReverseIterator riter(block->rbegin());
riter != block->rend(); riter++) {
if (mir->shouldCancel("Analyze Late (second loop)")) {
return false;
}
riter->analyzeEdgeCasesBackward();
}
}
return true;
}
|
