OLD | NEW |
1 // Copyright 2015 the V8 project authors. All rights reserved. | 1 // Copyright 2015 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 "src/compiler/escape-analysis-reducer.h" | 5 #include "src/compiler/escape-analysis-reducer.h" |
6 | 6 |
7 #include "src/compiler/all-nodes.h" | 7 #include "src/compiler/all-nodes.h" |
8 #include "src/compiler/js-graph.h" | 8 #include "src/compiler/js-graph.h" |
9 #include "src/counters.h" | 9 #include "src/counters.h" |
10 | 10 |
(...skipping 313 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
324 } | 324 } |
325 } | 325 } |
326 } | 326 } |
327 return clone; | 327 return clone; |
328 } | 328 } |
329 | 329 |
330 | 330 |
331 void EscapeAnalysisReducer::VerifyReplacement() const { | 331 void EscapeAnalysisReducer::VerifyReplacement() const { |
332 #ifdef DEBUG | 332 #ifdef DEBUG |
333 AllNodes all(zone(), jsgraph()->graph()); | 333 AllNodes all(zone(), jsgraph()->graph()); |
334 for (Node* node : all.live) { | 334 for (Node* node : all.reachable) { |
335 if (node->opcode() == IrOpcode::kAllocate) { | 335 if (node->opcode() == IrOpcode::kAllocate) { |
336 CHECK(!escape_analysis_->IsVirtual(node)); | 336 CHECK(!escape_analysis_->IsVirtual(node)); |
337 } | 337 } |
338 } | 338 } |
339 #endif // DEBUG | 339 #endif // DEBUG |
340 } | 340 } |
341 | 341 |
342 Isolate* EscapeAnalysisReducer::isolate() const { return jsgraph_->isolate(); } | 342 Isolate* EscapeAnalysisReducer::isolate() const { return jsgraph_->isolate(); } |
343 | 343 |
344 } // namespace compiler | 344 } // namespace compiler |
345 } // namespace internal | 345 } // namespace internal |
346 } // namespace v8 | 346 } // namespace v8 |
OLD | NEW |