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/compiler/graph-visualizer.h" | 5 #include "src/compiler/graph-visualizer.h" |
6 | 6 |
7 #include <sstream> | 7 #include <sstream> |
8 #include <string> | 8 #include <string> |
9 | 9 |
10 #include "src/code-stubs.h" | 10 #include "src/code-stubs.h" |
(...skipping 782 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
793 if (state[i->id()] == kUnvisited) { | 793 if (state[i->id()] == kUnvisited) { |
794 state[i->id()] = kOnStack; | 794 state[i->id()] = kOnStack; |
795 stack.push(i); | 795 stack.push(i); |
796 pop = false; | 796 pop = false; |
797 break; | 797 break; |
798 } | 798 } |
799 } | 799 } |
800 if (pop) { | 800 if (pop) { |
801 state[n->id()] = kVisited; | 801 state[n->id()] = kVisited; |
802 stack.pop(); | 802 stack.pop(); |
803 os << "#" << SafeId(n) << ":" << SafeMnemonic(n) << "("; | 803 os << "#" << n->id() << ":" << *n->op() << "("; |
804 int j = 0; | 804 int j = 0; |
805 for (Node* const i : n->inputs()) { | 805 for (Node* const i : n->inputs()) { |
806 if (j++ > 0) os << ", "; | 806 if (j++ > 0) os << ", "; |
807 os << "#" << SafeId(i) << ":" << SafeMnemonic(i); | 807 os << "#" << SafeId(i) << ":" << SafeMnemonic(i); |
808 } | 808 } |
809 os << ")" << std::endl; | 809 os << ")" << std::endl; |
810 } | 810 } |
811 } | 811 } |
812 return os; | 812 return os; |
813 } | 813 } |
814 } | 814 } |
815 } | 815 } |
816 } // namespace v8::internal::compiler | 816 } // namespace v8::internal::compiler |
OLD | NEW |