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/js-graph.h" | 9 #include "src/compiler/js-graph.h" |
10 #include "src/compiler/node-properties.h" | 10 #include "src/compiler/node-properties.h" |
(...skipping 108 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
119 Node* change = this->graph()->NewNode(op, load); | 119 Node* change = this->graph()->NewNode(op, load); |
120 Node* ret = this->graph()->NewNode(this->common()->Return(), change, | 120 Node* ret = this->graph()->NewNode(this->common()->Return(), change, |
121 this->start(), this->start()); | 121 this->start(), this->start()); |
122 Node* end = this->graph()->NewNode(this->common()->End(), ret); | 122 Node* end = this->graph()->NewNode(this->common()->End(), ret); |
123 this->graph()->SetEnd(end); | 123 this->graph()->SetEnd(end); |
124 LowerChange(change); | 124 LowerChange(change); |
125 } | 125 } |
126 | 126 |
127 void LowerChange(Node* change) { | 127 void LowerChange(Node* change) { |
128 // Run the graph reducer with changes lowering on a single node. | 128 // Run the graph reducer with changes lowering on a single node. |
129 CompilationInfo info(this->isolate(), this->zone()); | 129 Typer typer(this->isolate(), this->graph(), Handle<Context>()); |
130 Linkage linkage(this->zone(), &info); | |
131 Typer typer(this->isolate(), this->graph(), info.context()); | |
132 typer.Run(); | 130 typer.Run(); |
133 ChangeLowering change_lowering(&jsgraph, &linkage); | 131 ChangeLowering change_lowering(&jsgraph); |
134 SelectLowering select_lowering(this->graph(), this->common()); | 132 SelectLowering select_lowering(this->graph(), this->common()); |
135 GraphReducer reducer(this->graph(), this->zone()); | 133 GraphReducer reducer(this->graph(), this->zone()); |
136 reducer.AddReducer(&change_lowering); | 134 reducer.AddReducer(&change_lowering); |
137 reducer.AddReducer(&select_lowering); | 135 reducer.AddReducer(&select_lowering); |
138 reducer.ReduceNode(change); | 136 reducer.ReduceNode(change); |
139 Verifier::Run(this->graph(), Verifier::UNTYPED); | 137 Verifier::Run(this->graph(), Verifier::UNTYPED); |
140 } | 138 } |
141 | 139 |
142 Factory* factory() { return this->isolate()->factory(); } | 140 Factory* factory() { return this->isolate()->factory(); } |
143 Heap* heap() { return this->isolate()->heap(); } | 141 Heap* heap() { return this->isolate()->heap(); } |
(...skipping 245 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
389 | 387 |
390 input = *i; | 388 input = *i; |
391 Object* result = t.CallWithPotentialGC<Object>(); | 389 Object* result = t.CallWithPotentialGC<Object>(); |
392 t.CheckNumber(input, result); | 390 t.CheckNumber(input, result); |
393 } | 391 } |
394 } | 392 } |
395 } | 393 } |
396 } | 394 } |
397 | 395 |
398 #endif // V8_TURBOFAN_BACKEND | 396 #endif // V8_TURBOFAN_BACKEND |
OLD | NEW |