Lines Matching refs:Node
7 #include "src/compiler/node.h"
8 #include "src/compiler/node-properties.h"
56 MOCK_METHOD1(Reduce, Reduction(Node*));
63 Reduction Reduce(Node* node) final {
64 switch (node->op()->opcode()) {
66 EXPECT_EQ(0, node->InputCount());
67 NodeProperties::ChangeOp(node, &kOpB0);
68 return Replace(node);
70 EXPECT_EQ(1, node->InputCount());
71 NodeProperties::ChangeOp(node, &kOpB1);
72 return Replace(node);
74 EXPECT_EQ(2, node->InputCount());
75 NodeProperties::ChangeOp(node, &kOpB2);
76 return Replace(node);
88 Reduction Reduce(Node* node) final {
89 switch (node->op()->opcode()) {
91 EXPECT_EQ(0, node->InputCount());
94 EXPECT_EQ(1, node->InputCount());
95 return Replace(graph_->NewNode(&kOpB1, node->InputAt(0)));
97 EXPECT_EQ(2, node->InputCount());
99 graph_->NewNode(&kOpB2, node->InputAt(0), node->InputAt(1)));
114 Reduction Reduce(Node* node) final {
115 switch (node->op()->opcode()) {
117 EXPECT_EQ(0, node->InputCount());
118 return Replace(graph_->NewNode(&kOpB1, node));
133 Reduction Reduce(Node* node) final {
134 switch (node->op()->opcode()) {
136 EXPECT_EQ(0, node->InputCount());
137 return Replace(graph_->NewNode(&kOpC1, graph_->NewNode(&kOpC1, node)));
150 Reduction Reduce(Node* node) final {
151 switch (node->op()->opcode()) {
153 EXPECT_EQ(1, node->InputCount());
154 return Replace(node->InputAt(0));
164 Reduction Reduce(Node* node) final {
165 switch (node->op()->opcode()) {
167 EXPECT_EQ(1, node->InputCount());
168 return Replace(node->InputAt(0));
178 Reduction Reduce(Node* node) final {
179 switch (node->op()->opcode()) {
181 EXPECT_EQ(0, node->InputCount());
182 NodeProperties::ChangeOp(node, &kOpC0);
183 return Replace(node);
185 EXPECT_EQ(1, node->InputCount());
186 NodeProperties::ChangeOp(node, &kOpC1);
187 return Replace(node);
189 EXPECT_EQ(2, node->InputCount());
190 NodeProperties::ChangeOp(node, &kOpC2);
191 return Replace(node);
201 Reduction Reduce(Node* node) final {
202 switch (node->op()->opcode()) {
205 EXPECT_EQ(2, node->InputCount());
206 Node* x = node->InputAt(0);
207 Node* y = node->InputAt(1);
209 node->ReplaceInput(0, y);
210 node->ReplaceInput(1, x);
211 return Replace(node);
236 Reduction Reduce(Node* node) final {
237 Replace(node, node);
243 Node* node0 = graph()->NewNode(&kOpA0);
244 Node* node1 = graph()->NewNode(&kOpA1, node0);
255 Reduction Reduce(Node* node) final {
256 Revisit(node);
262 Node* node0 = graph()->NewNode(&kOpA0);
263 Node* node1 = graph()->NewNode(&kOpA1, node0);
275 Reduction Reduce(Node* node) final { return NoChange(); }
293 Node* node = graph()->NewNode(&kMockOperator);
294 Node* start = graph()->NewNode(common.Start(1));
295 Node* use_value = graph()->NewNode(common.Return(), node, start, start);
296 Node* replacement = graph()->NewNode(&kMockOperator);
299 r.ReplaceWithValue(node, replacement);
301 EXPECT_EQ(0, node->UseCount());
309 Node* start = graph()->NewNode(common.Start(1));
310 Node* node = graph()->NewNode(&kMockOpEffect, start);
311 Node* use_control = graph()->NewNode(common.Merge(1), start);
312 Node* use_effect = graph()->NewNode(common.EffectPhi(1), node, use_control);
313 Node* replacement = graph()->NewNode(&kMockOperator);
316 r.ReplaceWithValue(node, replacement);
318 EXPECT_EQ(0, node->UseCount());
322 UnorderedElementsAre(use_effect, use_control, node));
328 Node* start = graph()->NewNode(common.Start(1));
329 Node* node = graph()->NewNode(&kMockOpControl, start);
330 Node* success = graph()->NewNode(common.IfSuccess(), node);
331 Node* use_control = graph()->NewNode(common.Merge(1), success);
332 Node* replacement = graph()->NewNode(&kMockOperator);
335 r.ReplaceWithValue(node, replacement);
337 EXPECT_EQ(0, node->UseCount());
340 EXPECT_THAT(start->uses(), UnorderedElementsAre(use_control, node));
346 Node* start = graph()->NewNode(common.Start(1));
347 Node* effect = graph()->NewNode(&kMockOperator);
348 Node* dead = graph()->NewNode(&kMockOperator);
349 Node* node = graph()->NewNode(&kMockOpControl, start);
350 Node* success = graph()->NewNode(common.IfSuccess(), node);
351 Node* exception = graph()->NewNode(common.IfException(kNoHint), effect, node);
352 Node* use_control = graph()->NewNode(common.Merge(1), success);
353 Node* replacement = graph()->NewNode(&kMockOperator);
356 r.ReplaceWithValue(node, replacement);
359 EXPECT_EQ(0, node->UseCount());
363 EXPECT_THAT(start->uses(), UnorderedElementsAre(use_control, node));
370 Node* start = graph()->NewNode(common.Start(1));
371 Node* effect = graph()->NewNode(&kMockOperator);
372 Node* dead = graph()->NewNode(&kMockOperator);
373 Node* node = graph()->NewNode(&kMockOpControl, start);
374 Node* success = graph()->NewNode(common.IfSuccess(), node);
375 Node* exception = graph()->NewNode(common.IfException(kNoHint), effect, node);
376 Node* use_control = graph()->NewNode(common.Merge(1), success);
377 Node* replacement = graph()->NewNode(&kMockOperator);
380 r.ReplaceWithValue(node, replacement);
383 EXPECT_EQ(0, node->UseCount());
387 EXPECT_THAT(start->uses(), UnorderedElementsAre(use_control, node));
407 void ReduceNode(Node* node, Reducer* r) {
410 reducer.ReduceNode(node);
413 void ReduceNode(Node* node, Reducer* r1, Reducer* r2) {
417 reducer.ReduceNode(node);
420 void ReduceNode(Node* node, Reducer* r1, Reducer* r2, Reducer* r3) {
425 reducer.ReduceNode(node);
458 Node* node0 = graph()->NewNode(&kOpA0);
459 Node* node1 = graph()->NewNode(&kOpA1, node0);
460 Node* node2 = graph()->NewNode(&kOpA1, node0);
472 Node* node0 = graph()->NewNode(&kOpA0);
482 Node* node0 = graph()->NewNode(&kOpA0);
495 Node* n = graph()->NewNode(&kOpA0);
496 Node* end = graph()->NewNode(&kOpA1, n);
507 Node* n1 = graph()->NewNode(&kOpA0);
508 Node* n2 = graph()->NewNode(&kOpA1, n1);
509 Node* n3 = graph()->NewNode(&kOpA1, n1);
510 Node* end = graph()->NewNode(&kOpA2, n2, n3);
522 Node* n1 = graph()->NewNode(&kOpA0);
523 Node* end = graph()->NewNode(&kOpA1, n1);
540 Node* n1 = graph()->NewNode(&kOpA0);
541 Node* n2 = graph()->NewNode(&kOpA1, n1);
542 Node* n3 = graph()->NewNode(&kOpA1, n1);
543 Node* end = graph()->NewNode(&kOpA2, n2, n3);
565 Node* n1 = graph()->NewNode(&kOpA0);
566 Node* n2 = graph()->NewNode(&kOpA1, n1);
567 Node* n3 = graph()->NewNode(&kOpA1, n1);
568 Node* end = graph()->NewNode(&kOpA2, n2, n3);
581 Node* nend = graph()->end();
584 Node* nn2 = nend->InputAt(0);
585 Node* nn3 = nend->InputAt(1);
586 Node* nn1 = nn2->InputAt(0);
599 Node* end = graph()->NewNode(&kOpA0);
608 Node* nend = graph()->end();
617 Node* end = graph()->NewNode(&kOpB0);
626 Node* nend = graph()->end();
631 Node* n1 = nend->InputAt(0);
640 Node* n1 = graph()->NewNode(&kOpA0);
641 Node* end = graph()->NewNode(&kOpA1, n1);
658 Node* n1 = graph()->NewNode(&kOpA0);
659 Node* n2 = graph()->NewNode(&kOpA1, n1);
660 Node* n3 = graph()->NewNode(&kOpA1, n1);
661 Node* end = graph()->NewNode(&kOpA2, n2, n3);
684 Node* n1 = graph()->NewNode(&kOpA0);
685 Node* end = n1;
705 Node* n1 = graph()->NewNode(&kOpA0);
706 Node* n2 = graph()->NewNode(&kOpA1, n1);
707 Node* n3 = graph()->NewNode(&kOpA1, n1);
708 Node* end = graph()->NewNode(&kOpA2, n2, n3);
734 Node* n1 = graph()->NewNode(&kOpA0);
735 Node* n2 = graph()->NewNode(&kOpA1, n1);
736 Node* n3 = graph()->NewNode(&kOpA1, n1);
737 Node* end = NULL; // Initialize to please the compiler.
763 // Generate a node graph with the given permutations.
765 Node* level4 = graph->NewNode(&kOpA0);
766 Node* level3[] = {graph->NewNode(&kOpA1, level4),
769 Node* level2[] = {graph->NewNode(&kOpA1, level3[p3[0]]),
774 Node* level1[] = {graph->NewNode(&kOpA2, level2[p2[0]], level2[p2[1]]),
777 Node* end = graph->NewNode(&kOpA2, level1[p1[0]], level1[p1[1]]);
812 Node* end = graph()->end();
814 Node* n1 = end->InputAt(0);
815 Node* n2 = end->InputAt(1);
820 Node* n4 = n1->InputAt(0);
835 Node* n1 = graph()->NewNode(&kOpA0);
836 Node* end = graph()->NewNode(&kOpA1, n1);
