Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(1)

Side by Side Diff: src/compiler/graph.h

Issue 540863002: [turbofan] More const-correctness changes. (Closed) Base URL: https://v8.googlecode.com/svn/branches/bleeding_edge
Patch Set: Created 6 years, 3 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch | Annotate | Revision Log
« no previous file with comments | « no previous file | src/compiler/graph.cc » ('j') | no next file with comments »
Toggle Intra-line Diffs ('i') | Expand Comments ('e') | Collapse Comments ('c') | Show Comments Hide Comments ('s')
OLDNEW
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 #ifndef V8_COMPILER_GRAPH_H_ 5 #ifndef V8_COMPILER_GRAPH_H_
6 #define V8_COMPILER_GRAPH_H_ 6 #define V8_COMPILER_GRAPH_H_
7 7
8 #include <map> 8 #include <map>
9 #include <set> 9 #include <set>
10 10
11 #include "src/compiler/generic-algorithm.h" 11 #include "src/compiler/generic-algorithm.h"
12 #include "src/compiler/node.h" 12 #include "src/compiler/node.h"
13 #include "src/compiler/node-aux-data.h" 13 #include "src/compiler/node-aux-data.h"
14 #include "src/compiler/source-position.h" 14 #include "src/compiler/source-position.h"
15 15
16 namespace v8 { 16 namespace v8 {
17 namespace internal { 17 namespace internal {
18 namespace compiler { 18 namespace compiler {
19 19
20 class GraphDecorator; 20 class GraphDecorator;
21 21
22 22
23 class Graph : public GenericGraph<Node> { 23 class Graph : public GenericGraph<Node> {
24 public: 24 public:
25 explicit Graph(Zone* zone); 25 explicit Graph(Zone* zone);
26 26
27 // Base implementation used by all factory methods. 27 // Base implementation used by all factory methods.
28 Node* NewNode(Operator* op, int input_count, Node** inputs); 28 Node* NewNode(const Operator* op, int input_count, Node** inputs);
29 29
30 // Factories for nodes with static input counts. 30 // Factories for nodes with static input counts.
31 Node* NewNode(Operator* op) { 31 Node* NewNode(const Operator* op) {
32 return NewNode(op, 0, static_cast<Node**>(NULL)); 32 return NewNode(op, 0, static_cast<Node**>(NULL));
33 } 33 }
34 Node* NewNode(Operator* op, Node* n1) { return NewNode(op, 1, &n1); } 34 Node* NewNode(const Operator* op, Node* n1) { return NewNode(op, 1, &n1); }
35 Node* NewNode(Operator* op, Node* n1, Node* n2) { 35 Node* NewNode(const Operator* op, Node* n1, Node* n2) {
36 Node* nodes[] = {n1, n2}; 36 Node* nodes[] = {n1, n2};
37 return NewNode(op, arraysize(nodes), nodes); 37 return NewNode(op, arraysize(nodes), nodes);
38 } 38 }
39 Node* NewNode(Operator* op, Node* n1, Node* n2, Node* n3) { 39 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) {
40 Node* nodes[] = {n1, n2, n3}; 40 Node* nodes[] = {n1, n2, n3};
41 return NewNode(op, arraysize(nodes), nodes); 41 return NewNode(op, arraysize(nodes), nodes);
42 } 42 }
43 Node* NewNode(Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) { 43 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) {
44 Node* nodes[] = {n1, n2, n3, n4}; 44 Node* nodes[] = {n1, n2, n3, n4};
45 return NewNode(op, arraysize(nodes), nodes); 45 return NewNode(op, arraysize(nodes), nodes);
46 } 46 }
47 Node* NewNode(Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, 47 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4,
48 Node* n5) { 48 Node* n5) {
49 Node* nodes[] = {n1, n2, n3, n4, n5}; 49 Node* nodes[] = {n1, n2, n3, n4, n5};
50 return NewNode(op, arraysize(nodes), nodes); 50 return NewNode(op, arraysize(nodes), nodes);
51 } 51 }
52 Node* NewNode(Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, Node* n5, 52 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4,
53 Node* n6) { 53 Node* n5, Node* n6) {
54 Node* nodes[] = {n1, n2, n3, n4, n5, n6}; 54 Node* nodes[] = {n1, n2, n3, n4, n5, n6};
55 return NewNode(op, arraysize(nodes), nodes); 55 return NewNode(op, arraysize(nodes), nodes);
56 } 56 }
57 57
58 void ChangeOperator(Node* node, Operator* op);
59 void DeleteNode(Node* node);
60
61 template <class Visitor> 58 template <class Visitor>
62 void VisitNodeUsesFrom(Node* node, Visitor* visitor); 59 void VisitNodeUsesFrom(Node* node, Visitor* visitor);
63 60
64 template <class Visitor> 61 template <class Visitor>
65 void VisitNodeUsesFromStart(Visitor* visitor); 62 void VisitNodeUsesFromStart(Visitor* visitor);
66 63
67 template <class Visitor> 64 template <class Visitor>
68 void VisitNodeInputsFromEnd(Visitor* visitor); 65 void VisitNodeInputsFromEnd(Visitor* visitor);
69 66
70 void AddDecorator(GraphDecorator* decorator) { 67 void AddDecorator(GraphDecorator* decorator) {
(...skipping 10 matching lines...) Expand all
81 private: 78 private:
82 ZoneVector<GraphDecorator*> decorators_; 79 ZoneVector<GraphDecorator*> decorators_;
83 }; 80 };
84 81
85 82
86 class GraphDecorator : public ZoneObject { 83 class GraphDecorator : public ZoneObject {
87 public: 84 public:
88 virtual ~GraphDecorator() {} 85 virtual ~GraphDecorator() {}
89 virtual void Decorate(Node* node) = 0; 86 virtual void Decorate(Node* node) = 0;
90 }; 87 };
91 } 88
92 } 89 } // namespace compiler
93 } // namespace v8::internal::compiler 90 } // namespace internal
91 } // namespace v8
94 92
95 #endif // V8_COMPILER_GRAPH_H_ 93 #endif // V8_COMPILER_GRAPH_H_
OLDNEW
« no previous file with comments | « no previous file | src/compiler/graph.cc » ('j') | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698