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 107 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
118 Node* ret = this->graph()->NewNode(this->common()->Return(), change, | 118 Node* ret = this->graph()->NewNode(this->common()->Return(), change, |
119 this->start(), this->start()); | 119 this->start(), this->start()); |
120 Node* end = this->graph()->NewNode(this->common()->End(), ret); | 120 Node* end = this->graph()->NewNode(this->common()->End(), ret); |
121 this->graph()->SetEnd(end); | 121 this->graph()->SetEnd(end); |
122 LowerChange(change); | 122 LowerChange(change); |
123 } | 123 } |
124 | 124 |
125 void LowerChange(Node* change) { | 125 void LowerChange(Node* change) { |
126 // Run the graph reducer with changes lowering on a single node. | 126 // Run the graph reducer with changes lowering on a single node. |
127 CompilationInfo info(this->isolate(), this->zone()); | 127 CompilationInfo info(this->isolate(), this->zone()); |
128 Linkage linkage(&info); | 128 Linkage linkage(this->zone(), &info); |
129 ChangeLowering lowering(&jsgraph, &linkage); | 129 ChangeLowering lowering(&jsgraph, &linkage); |
130 GraphReducer reducer(this->graph()); | 130 GraphReducer reducer(this->graph()); |
131 reducer.AddReducer(&lowering); | 131 reducer.AddReducer(&lowering); |
132 reducer.ReduceNode(change); | 132 reducer.ReduceNode(change); |
133 Verifier::Run(this->graph(), Verifier::UNTYPED); | 133 Verifier::Run(this->graph(), Verifier::UNTYPED); |
134 } | 134 } |
135 | 135 |
136 Factory* factory() { return this->isolate()->factory(); } | 136 Factory* factory() { return this->isolate()->factory(); } |
137 Heap* heap() { return this->isolate()->heap(); } | 137 Heap* heap() { return this->isolate()->heap(); } |
138 }; | 138 }; |
(...skipping 244 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
383 | 383 |
384 input = *i; | 384 input = *i; |
385 Object* result = t.CallWithPotentialGC<Object>(); | 385 Object* result = t.CallWithPotentialGC<Object>(); |
386 t.CheckNumber(input, result); | 386 t.CheckNumber(input, result); |
387 } | 387 } |
388 } | 388 } |
389 } | 389 } |
390 } | 390 } |
391 | 391 |
392 #endif // V8_TURBOFAN_BACKEND | 392 #endif // V8_TURBOFAN_BACKEND |
OLD | NEW |