19     Node* __n[] = {__VA_ARGS__};                          \
30   void ComputeEquivalence(Node* node) {  in ComputeEquivalence()
40     for (Node* node : all_nodes_) {  in ComputeEquivalence()
45   bool IsEquivalenceClass(size_t length, Node** nodes) {  in IsEquivalenceClass()
51     for (Node* node : all_nodes_) {  in IsEquivalenceClass()
61   Node* Value() { return NumberConstant(0.0); }  in Value()
63   Node* Branch(Node* control) {  in Branch()
67   Node* IfTrue(Node* control) {  in IfTrue()
71   Node* IfFalse(Node* control) {  in IfFalse()
75   Node* Merge1(Node* control) {  in Merge1()
79   Node* Merge2(Node* control1, Node* control2) {  in Merge2()
83   Node* Loop2(Node* control) {  in Loop2()
87   Node* End(Node* control) {  in End()
92   Node* Store(Node* node) {  in Store()
97   ZoneVector<Node*> all_nodes_;
107   Node* start = graph()->start();  in TEST_F()
115   Node* start = graph()->start();  in TEST_F()
116   Node* merge1 = Merge1(start);  in TEST_F()
124   Node* start = graph()->start();  in TEST_F()
125   Node* b = Branch(start);  in TEST_F()
126   Node* t = IfTrue(b);  in TEST_F()
127   Node* f = IfFalse(b);  in TEST_F()
128   Node* m = Merge2(t, f);  in TEST_F()
138   Node* start = graph()->start();  in TEST_F()
139   Node* b1 = Branch(start);  in TEST_F()
140   Node* t1 = IfTrue(b1);  in TEST_F()
141   Node* f1 = IfFalse(b1);  in TEST_F()
142   Node* b2 = Branch(f1);  in TEST_F()
143   Node* t2 = IfTrue(b2);  in TEST_F()
144   Node* f2 = IfFalse(b2);  in TEST_F()
145   Node* m2 = Merge2(t2, f2);  in TEST_F()
146   Node* m1 = Merge2(t1, m2);  in TEST_F()
158   Node* start = graph()->start();  in TEST_F()
159   Node* b1 = Branch(start);  in TEST_F()
160   Node* t1 = IfTrue(b1);  in TEST_F()
161   Node* f1 = IfFalse(b1);  in TEST_F()
162   Node* m1 = Merge2(t1, f1);  in TEST_F()
163   Node* b2 = Branch(m1);  in TEST_F()
164   Node* t2 = IfTrue(b2);  in TEST_F()
165   Node* f2 = IfFalse(b2);  in TEST_F()
166   Node* m2 = Merge2(t2, f2);  in TEST_F()
178   Node* start = graph()->start();  in TEST_F()
179   Node* b1 = Branch(start);  in TEST_F()
180   Node* t1 = IfTrue(b1);  in TEST_F()
181   Node* f1 = IfFalse(b1);  in TEST_F()
182   Node* b2 = Branch(f1);  in TEST_F()
183   Node* t2 = IfTrue(b2);  in TEST_F()
184   Node* f2 = IfFalse(b2);  in TEST_F()
185   Node* b3 = Branch(f2);  in TEST_F()
186   Node* t3 = IfTrue(b3);  in TEST_F()
187   Node* f3 = IfFalse(b3);  in TEST_F()
188   Node* m1 = Merge2(t1, t2);  in TEST_F()
189   Node* m2 = Merge2(m1, t3);  in TEST_F()
190   Node* m3 = Merge2(m2, f3);  in TEST_F()
206   Node* start = graph()->start();  in TEST_F()
207   Node* l = Loop2(start);  in TEST_F()
217   Node* start = graph()->start();  in TEST_F()
218   Node* l = Loop2(start);  in TEST_F()
219   Node* b = Branch(l);  in TEST_F()
220   Node* t = IfTrue(b);  in TEST_F()
221   Node* f = IfFalse(b);  in TEST_F()
232   Node* start = graph()->start();  in TEST_F()
233   Node* b1 = Branch(start);  in TEST_F()
234   Node* t1 = IfTrue(b1);  in TEST_F()
235   Node* f1 = IfFalse(b1);  in TEST_F()
236   Node* lp = Loop2(f1);  in TEST_F()
237   Node* m1 = Merge2(t1, lp);  in TEST_F()
238   Node* b2 = Branch(m1);  in TEST_F()
239   Node* t2 = IfTrue(b2);  in TEST_F()
240   Node* f2 = IfFalse(b2);  in TEST_F()
241   Node* m2 = Merge2(t2, f2);  in TEST_F()
242   Node* b3 = Branch(m2);  in TEST_F()
243   Node* t3 = IfTrue(b3);  in TEST_F()
244   Node* f3 = IfFalse(b3);  in TEST_F()