blob: 2cebbc784ee1a71cfc849cd260955b496bf5c7dd (
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
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
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
|
// Copyright 2014 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/js-graph.h"
#include "src/compiler/node-properties-inl.h"
#include "src/compiler/typer.h"
namespace v8 {
namespace internal {
namespace compiler {
Node* JSGraph::ImmovableHeapConstant(Handle<Object> object) {
PrintableUnique<Object> unique =
PrintableUnique<Object>::CreateImmovable(zone(), object);
return NewNode(common()->HeapConstant(unique));
}
Node* JSGraph::NewNode(Operator* op) {
Node* node = graph()->NewNode(op);
typer_->Init(node);
return node;
}
Node* JSGraph::UndefinedConstant() {
if (!undefined_constant_.is_set()) {
undefined_constant_.set(
ImmovableHeapConstant(factory()->undefined_value()));
}
return undefined_constant_.get();
}
Node* JSGraph::TheHoleConstant() {
if (!the_hole_constant_.is_set()) {
the_hole_constant_.set(ImmovableHeapConstant(factory()->the_hole_value()));
}
return the_hole_constant_.get();
}
Node* JSGraph::TrueConstant() {
if (!true_constant_.is_set()) {
true_constant_.set(ImmovableHeapConstant(factory()->true_value()));
}
return true_constant_.get();
}
Node* JSGraph::FalseConstant() {
if (!false_constant_.is_set()) {
false_constant_.set(ImmovableHeapConstant(factory()->false_value()));
}
return false_constant_.get();
}
Node* JSGraph::NullConstant() {
if (!null_constant_.is_set()) {
null_constant_.set(ImmovableHeapConstant(factory()->null_value()));
}
return null_constant_.get();
}
Node* JSGraph::ZeroConstant() {
if (!zero_constant_.is_set()) zero_constant_.set(NumberConstant(0.0));
return zero_constant_.get();
}
Node* JSGraph::OneConstant() {
if (!one_constant_.is_set()) one_constant_.set(NumberConstant(1.0));
return one_constant_.get();
}
Node* JSGraph::NaNConstant() {
if (!nan_constant_.is_set()) {
nan_constant_.set(NumberConstant(base::OS::nan_value()));
}
return nan_constant_.get();
}
Node* JSGraph::HeapConstant(PrintableUnique<Object> value) {
// TODO(turbofan): canonicalize heap constants using Unique<T>
return NewNode(common()->HeapConstant(value));
}
Node* JSGraph::HeapConstant(Handle<Object> value) {
// TODO(titzer): We could also match against the addresses of immortable
// immovables here, even without access to the heap, thus always
// canonicalizing references to them.
return HeapConstant(
PrintableUnique<Object>::CreateUninitialized(zone(), value));
}
Node* JSGraph::Constant(Handle<Object> value) {
// Dereference the handle to determine if a number constant or other
// canonicalized node can be used.
if (value->IsNumber()) {
return Constant(value->Number());
} else if (value->IsUndefined()) {
return UndefinedConstant();
} else if (value->IsTrue()) {
return TrueConstant();
} else if (value->IsFalse()) {
return FalseConstant();
} else if (value->IsNull()) {
return NullConstant();
} else if (value->IsTheHole()) {
return TheHoleConstant();
} else {
return HeapConstant(value);
}
}
Node* JSGraph::Constant(double value) {
if (BitCast<int64_t>(value) == BitCast<int64_t>(0.0)) return ZeroConstant();
if (BitCast<int64_t>(value) == BitCast<int64_t>(1.0)) return OneConstant();
return NumberConstant(value);
}
Node* JSGraph::Constant(int32_t value) {
if (value == 0) return ZeroConstant();
if (value == 1) return OneConstant();
return NumberConstant(value);
}
Node* JSGraph::Int32Constant(int32_t value) {
Node** loc = cache_.FindInt32Constant(value);
if (*loc == NULL) {
*loc = NewNode(common()->Int32Constant(value));
}
return *loc;
}
Node* JSGraph::NumberConstant(double value) {
Node** loc = cache_.FindNumberConstant(value);
if (*loc == NULL) {
*loc = NewNode(common()->NumberConstant(value));
}
return *loc;
}
Node* JSGraph::Float64Constant(double value) {
Node** loc = cache_.FindFloat64Constant(value);
if (*loc == NULL) {
*loc = NewNode(common()->Float64Constant(value));
}
return *loc;
}
Node* JSGraph::ExternalConstant(ExternalReference reference) {
Node** loc = cache_.FindExternalConstant(reference);
if (*loc == NULL) {
*loc = NewNode(common()->ExternalConstant(reference));
}
return *loc;
}
} // namespace compiler
} // namespace internal
} // namespace v8
|
