OLD | NEW |
1 // Copyright 2013 the V8 project authors. All rights reserved. | 1 // Copyright 2013 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/hydrogen.h" | 5 #include "src/hydrogen.h" |
6 | 6 |
7 #include <sstream> | 7 #include <sstream> |
8 | 8 |
9 #include "src/v8.h" | 9 #include "src/v8.h" |
10 | 10 |
(...skipping 3464 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
3475 DCHECK(!OptimizingCompilerThread::IsOptimizerThread(isolate())); | 3475 DCHECK(!OptimizingCompilerThread::IsOptimizerThread(isolate())); |
3476 for (int i = 0; i < blocks()->length(); ++i) { | 3476 for (int i = 0; i < blocks()->length(); ++i) { |
3477 for (HInstructionIterator it(blocks()->at(i)); !it.Done(); it.Advance()) { | 3477 for (HInstructionIterator it(blocks()->at(i)); !it.Done(); it.Advance()) { |
3478 it.Current()->FinalizeUniqueness(); | 3478 it.Current()->FinalizeUniqueness(); |
3479 } | 3479 } |
3480 } | 3480 } |
3481 } | 3481 } |
3482 | 3482 |
3483 | 3483 |
3484 int HGraph::SourcePositionToScriptPosition(SourcePosition pos) { | 3484 int HGraph::SourcePositionToScriptPosition(SourcePosition pos) { |
3485 return (info()->is_tracking_positions() && !pos.IsUnknown()) | 3485 return (FLAG_hydrogen_track_positions && !pos.IsUnknown()) |
3486 ? info()->start_position_for(pos.inlining_id()) + pos.position() | 3486 ? info()->start_position_for(pos.inlining_id()) + pos.position() |
3487 : pos.raw(); | 3487 : pos.raw(); |
3488 } | 3488 } |
3489 | 3489 |
3490 | 3490 |
3491 // Block ordering was implemented with two mutually recursive methods, | 3491 // Block ordering was implemented with two mutually recursive methods, |
3492 // HGraph::Postorder and HGraph::PostorderLoopBlocks. | 3492 // HGraph::Postorder and HGraph::PostorderLoopBlocks. |
3493 // The recursion could lead to stack overflow so the algorithm has been | 3493 // The recursion could lead to stack overflow so the algorithm has been |
3494 // implemented iteratively. | 3494 // implemented iteratively. |
3495 // At a high level the algorithm looks like this: | 3495 // At a high level the algorithm looks like this: |
(...skipping 9926 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
13422 if (ShouldProduceTraceOutput()) { | 13422 if (ShouldProduceTraceOutput()) { |
13423 isolate()->GetHTracer()->TraceHydrogen(name(), graph_); | 13423 isolate()->GetHTracer()->TraceHydrogen(name(), graph_); |
13424 } | 13424 } |
13425 | 13425 |
13426 #ifdef DEBUG | 13426 #ifdef DEBUG |
13427 graph_->Verify(false); // No full verify. | 13427 graph_->Verify(false); // No full verify. |
13428 #endif | 13428 #endif |
13429 } | 13429 } |
13430 | 13430 |
13431 } } // namespace v8::internal | 13431 } } // namespace v8::internal |
OLD | NEW |