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 622 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
633 } | 633 } |
634 if (pop) { | 634 if (pop) { |
635 state[n->id()] = kVisited; | 635 state[n->id()] = kVisited; |
636 stack.pop(); | 636 stack.pop(); |
637 os << "#" << n->id() << ":" << *n->op() << "("; | 637 os << "#" << n->id() << ":" << *n->op() << "("; |
638 int j = 0; | 638 int j = 0; |
639 for (Node* const i : n->inputs()) { | 639 for (Node* const i : n->inputs()) { |
640 if (j++ > 0) os << ", "; | 640 if (j++ > 0) os << ", "; |
641 os << "#" << SafeId(i) << ":" << SafeMnemonic(i); | 641 os << "#" << SafeId(i) << ":" << SafeMnemonic(i); |
642 } | 642 } |
643 os << ")" << std::endl; | 643 os << ")"; |
| 644 if (NodeProperties::IsTyped(n)) { |
| 645 os << " [Type: "; |
| 646 NodeProperties::GetType(n)->PrintTo(os); |
| 647 os << "]"; |
| 648 } |
| 649 os << std::endl; |
644 } | 650 } |
645 } | 651 } |
646 return os; | 652 return os; |
647 } | 653 } |
648 } // namespace compiler | 654 } // namespace compiler |
649 } // namespace internal | 655 } // namespace internal |
650 } // namespace v8 | 656 } // namespace v8 |
OLD | NEW |