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
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
|
/* -*- 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/. */
#ifndef jsapi_tests_jitTestGVN_h
#define jsapi_tests_jitTestGVN_h
#include "jit/IonAnalysis.h"
#include "jit/MIRGenerator.h"
#include "jit/MIRGraph.h"
#include "jit/RangeAnalysis.h"
#include "jit/ValueNumbering.h"
namespace js {
namespace jit {
struct MinimalAlloc {
LifoAlloc lifo;
TempAllocator alloc;
// We are not testing the fallible allocator in these test cases, thus make
// the lifo alloc chunk extremely large for our test cases.
MinimalAlloc() : lifo(128 * 1024), alloc(&lifo) {
if (!alloc.ensureBallast()) {
MOZ_CRASH("[OOM] Not enough RAM for the test.");
}
}
};
struct MinimalFunc : MinimalAlloc {
JitCompileOptions options;
CompileInfo info;
MIRGraph graph;
MIRGenerator mir;
uint32_t numParams;
MinimalFunc()
: options(),
info(0),
graph(&alloc),
mir(static_cast<CompileRealm*>(nullptr), options, &alloc, &graph, &info,
static_cast<const OptimizationInfo*>(nullptr)),
numParams(0) {}
MBasicBlock* createEntryBlock() {
MBasicBlock* block =
MBasicBlock::New(graph, info, nullptr, MBasicBlock::NORMAL);
graph.addBlock(block);
return block;
}
MBasicBlock* createOsrEntryBlock() {
MBasicBlock* block =
MBasicBlock::New(graph, info, nullptr, MBasicBlock::NORMAL);
graph.addBlock(block);
graph.setOsrBlock(block);
return block;
}
MBasicBlock* createBlock(MBasicBlock* pred) {
MBasicBlock* block =
MBasicBlock::New(graph, info, pred, MBasicBlock::NORMAL);
graph.addBlock(block);
return block;
}
MParameter* createParameter() {
MParameter* p = MParameter::New(alloc, numParams++);
return p;
}
bool runGVN() {
if (!SplitCriticalEdges(graph)) {
return false;
}
RenumberBlocks(graph);
if (!BuildDominatorTree(graph)) {
return false;
}
if (!BuildPhiReverseMapping(graph)) {
return false;
}
ValueNumberer gvn(&mir, graph);
if (!gvn.run(ValueNumberer::DontUpdateAliasAnalysis)) {
return false;
}
return true;
}
bool runRangeAnalysis() {
if (!SplitCriticalEdges(graph)) {
return false;
}
RenumberBlocks(graph);
if (!BuildDominatorTree(graph)) {
return false;
}
if (!BuildPhiReverseMapping(graph)) {
return false;
}
RangeAnalysis rangeAnalysis(&mir, graph);
if (!rangeAnalysis.addBetaNodes()) {
return false;
}
if (!rangeAnalysis.analyze()) {
return false;
}
if (!rangeAnalysis.addRangeAssertions()) {
return false;
}
if (!rangeAnalysis.removeBetaNodes()) {
return false;
}
return true;
}
};
} // namespace jit
} // namespace js
#endif
|
