OLD | NEW |
1 // Copyright 2014 the V8 project authors. All rights reserved. | 1 // Copyright 2014 the V8 project authors. All rights reserved. |
2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
4 | 4 |
5 #include <limits> | 5 #include <limits> |
6 | 6 |
7 #include "src/compiler/change-lowering.h" | 7 #include "src/compiler/change-lowering.h" |
8 #include "src/compiler/control-builders.h" | 8 #include "src/compiler/control-builders.h" |
9 #include "src/compiler/generic-node-inl.h" | 9 #include "src/compiler/generic-node-inl.h" |
10 #include "src/compiler/js-graph.h" | 10 #include "src/compiler/js-graph.h" |
(...skipping 131 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
142 this->start(), this->start()); | 142 this->start(), this->start()); |
143 Node* end = this->graph()->NewNode(this->common()->End(), ret); | 143 Node* end = this->graph()->NewNode(this->common()->End(), ret); |
144 this->graph()->SetEnd(end); | 144 this->graph()->SetEnd(end); |
145 LowerChange(change); | 145 LowerChange(change); |
146 } | 146 } |
147 | 147 |
148 void LowerChange(Node* change) { | 148 void LowerChange(Node* change) { |
149 // Run the graph reducer with changes lowering on a single node. | 149 // Run the graph reducer with changes lowering on a single node. |
150 CompilationInfo info(this->isolate(), this->zone()); | 150 CompilationInfo info(this->isolate(), this->zone()); |
151 Linkage linkage(&info); | 151 Linkage linkage(&info); |
152 ChangeLowering lowering(&jsgraph, &linkage, this->machine()); | 152 ChangeLowering lowering(&jsgraph, &linkage); |
153 GraphReducer reducer(this->graph()); | 153 GraphReducer reducer(this->graph()); |
154 reducer.AddReducer(&lowering); | 154 reducer.AddReducer(&lowering); |
155 reducer.ReduceNode(change); | 155 reducer.ReduceNode(change); |
156 Verifier::Run(this->graph()); | 156 Verifier::Run(this->graph()); |
157 } | 157 } |
158 | 158 |
159 Factory* factory() { return this->isolate()->factory(); } | 159 Factory* factory() { return this->isolate()->factory(); } |
160 Heap* heap() { return this->isolate()->heap(); } | 160 Heap* heap() { return this->isolate()->heap(); } |
161 }; | 161 }; |
162 | 162 |
(...skipping 243 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
406 | 406 |
407 input = *i; | 407 input = *i; |
408 Object* result = t.CallWithPotentialGC<Object>(); | 408 Object* result = t.CallWithPotentialGC<Object>(); |
409 t.CheckNumber(input, result); | 409 t.CheckNumber(input, result); |
410 } | 410 } |
411 } | 411 } |
412 } | 412 } |
413 } | 413 } |
414 | 414 |
415 #endif // V8_TURBOFAN_BACKEND | 415 #endif // V8_TURBOFAN_BACKEND |
OLD | NEW |