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

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

Issue 2719483002: [V8] Rename SIMD Create methods and add initialization operators. (Closed)
Patch Set: Created 3 years, 9 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
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 "src/base/compiler-specific.h" 8 #include "src/base/compiler-specific.h"
9 #include "src/globals.h" 9 #include "src/globals.h"
10 #include "src/zone/zone-containers.h" 10 #include "src/zone/zone-containers.h"
(...skipping 86 matching lines...) Expand 10 before | Expand all | Expand 10 after
97 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, 97 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4,
98 Node* n5, Node* n6, Node* n7, Node* n8) { 98 Node* n5, Node* n6, Node* n7, Node* n8) {
99 Node* nodes[] = {n1, n2, n3, n4, n5, n6, n7, n8}; 99 Node* nodes[] = {n1, n2, n3, n4, n5, n6, n7, n8};
100 return NewNode(op, arraysize(nodes), nodes); 100 return NewNode(op, arraysize(nodes), nodes);
101 } 101 }
102 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, 102 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4,
103 Node* n5, Node* n6, Node* n7, Node* n8, Node* n9) { 103 Node* n5, Node* n6, Node* n7, Node* n8, Node* n9) {
104 Node* nodes[] = {n1, n2, n3, n4, n5, n6, n7, n8, n9}; 104 Node* nodes[] = {n1, n2, n3, n4, n5, n6, n7, n8, n9};
105 return NewNode(op, arraysize(nodes), nodes); 105 return NewNode(op, arraysize(nodes), nodes);
106 } 106 }
107 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4,
108 Node* n5, Node* n6, Node* n7, Node* n8, Node* n9, Node* n10) {
109 Node* nodes[] = {n1, n2, n3, n4, n5, n6, n7, n8, n9, n10};
110 return NewNode(op, arraysize(nodes), nodes);
111 }
112 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4,
113 Node* n5, Node* n6, Node* n7, Node* n8, Node* n9, Node* n10,
114 Node* n11) {
115 Node* nodes[] = {n1, n2, n3, n4, n5, n6, n7, n8, n9, n10, n11};
116 return NewNode(op, arraysize(nodes), nodes);
117 }
118 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4,
119 Node* n5, Node* n6, Node* n7, Node* n8, Node* n9, Node* n10,
120 Node* n11, Node* n12) {
121 Node* nodes[] = {n1, n2, n3, n4, n5, n6, n7, n8, n9, n10, n11, n12};
122 return NewNode(op, arraysize(nodes), nodes);
123 }
124 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4,
125 Node* n5, Node* n6, Node* n7, Node* n8, Node* n9, Node* n10,
126 Node* n11, Node* n12, Node* n13) {
127 Node* nodes[] = {n1, n2, n3, n4, n5, n6, n7, n8, n9, n10, n11, n12, n13};
128 return NewNode(op, arraysize(nodes), nodes);
129 }
130 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4,
131 Node* n5, Node* n6, Node* n7, Node* n8, Node* n9, Node* n10,
132 Node* n11, Node* n12, Node* n13, Node* n14) {
133 Node* nodes[] = {n1, n2, n3, n4, n5, n6, n7,
134 n8, n9, n10, n11, n12, n13, n14};
135 return NewNode(op, arraysize(nodes), nodes);
136 }
137 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4,
138 Node* n5, Node* n6, Node* n7, Node* n8, Node* n9, Node* n10,
139 Node* n11, Node* n12, Node* n13, Node* n14, Node* n15) {
140 Node* nodes[] = {n1, n2, n3, n4, n5, n6, n7, n8,
141 n9, n10, n11, n12, n13, n14, n15};
142 return NewNode(op, arraysize(nodes), nodes);
143 }
144 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4,
145 Node* n5, Node* n6, Node* n7, Node* n8, Node* n9, Node* n10,
146 Node* n11, Node* n12, Node* n13, Node* n14, Node* n15,
147 Node* n16) {
148 Node* nodes[] = {n1, n2, n3, n4, n5, n6, n7, n8,
149 n9, n10, n11, n12, n13, n14, n15, n16};
150 return NewNode(op, arraysize(nodes), nodes);
151 }
152 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4,
153 Node* n5, Node* n6, Node* n7, Node* n8, Node* n9, Node* n10,
154 Node* n11, Node* n12, Node* n13, Node* n14, Node* n15,
155 Node* n16, Node* n17) {
156 Node* nodes[] = {n1, n2, n3, n4, n5, n6, n7, n8, n9,
157 n10, n11, n12, n13, n14, n15, n16, n17};
158 return NewNode(op, arraysize(nodes), nodes);
159 }
160 107
161 // Clone the {node}, and assign a new node id to the copy. 108 // Clone the {node}, and assign a new node id to the copy.
162 Node* CloneNode(const Node* node); 109 Node* CloneNode(const Node* node);
163 110
164 Zone* zone() const { return zone_; } 111 Zone* zone() const { return zone_; }
165 Node* start() const { return start_; } 112 Node* start() const { return start_; }
166 Node* end() const { return end_; } 113 Node* end() const { return end_; }
167 114
168 void SetStart(Node* start) { start_ = start; } 115 void SetStart(Node* start) { start_ = start; }
169 void SetEnd(Node* end) { end_ = end; } 116 void SetEnd(Node* end) { end_ = end; }
(...skipping 29 matching lines...) Expand all
199 public: 146 public:
200 virtual ~GraphDecorator() {} 147 virtual ~GraphDecorator() {}
201 virtual void Decorate(Node* node) = 0; 148 virtual void Decorate(Node* node) = 0;
202 }; 149 };
203 150
204 } // namespace compiler 151 } // namespace compiler
205 } // namespace internal 152 } // namespace internal
206 } // namespace v8 153 } // namespace v8
207 154
208 #endif // V8_COMPILER_GRAPH_H_ 155 #endif // V8_COMPILER_GRAPH_H_
OLDNEW

Powered by Google App Engine
This is Rietveld 408576698