Lines Matching refs:Node
8 #include "src/compiler/node.h"
16 #define NONE reinterpret_cast<Node*>(1)
27 #define CHECK_USES(node, ...) \
29 Node* __array[] = {__VA_ARGS__}; \
32 CheckUseChain(node, __array, __size); \
38 typedef std::multiset<Node*, std::less<Node*>> NodeMSet;
41 void CheckUseChain(Node* node, Node** uses, int use_count) {
43 if (use_count == 1) CHECK(node->OwnedBy(uses[0]));
46 CHECK(!node->OwnedBy(uses[i]));
51 CHECK_EQ(use_count, node->UseCount());
62 for (auto use : node->uses()) {
72 for (auto edge : node->use_edges()) {
73 CHECK_EQ(node, edge.to());
74 CHECK_EQ(node, edge.from()->InputAt(edge.index()));
81 // Check the use nodes actually have the node as inputs.
82 for (Node* use : node->uses()) {
84 for (Node* input : use->inputs()) {
85 if (input == node) count++;
93 void CheckInputs(Node* node, Node** inputs, int input_count) {
94 CHECK_EQ(input_count, node->InputCount());
97 CHECK_EQ(inputs[i], node->InputAt(i));
102 for (Node* input : node->inputs()) {
109 Node* input = inputs[i];
113 for (Node* use : input->uses()) {
114 if (use == node) {
123 if (edge.from() == node && edge.to() == input && edge.index() == i) {
134 #define CHECK_INPUTS(node, ...) \
136 Node* __array[] = {__VA_ARGS__}; \
139 CheckInputs(node, __array, __size); \
146 Node* n0 = graph.NewNode(&dummy_operator0);
147 Node* n1 = graph.NewNode(&dummy_operator1, n0);
148 Node* n2 = graph.NewNode(&dummy_operator1, n0);
149 Node* n3 = graph.NewNode(&dummy_operator0);
171 Node* n0 = graph.NewNode(&dummy_operator0);
172 Node* n1 = graph.NewNode(&dummy_operator1, n0);
182 Node* n2 = graph.NewNode(&dummy_operator0);
195 Node* n0 = graph.NewNode(&dummy_operator0);
196 Node* n1 = graph.NewNode(&dummy_operator0);
197 Node* n2 = graph.NewNode(&dummy_operator0);
198 Node* n3 = graph.NewNode(&dummy_operator3, n0, n1, n2);
199 Node* n4 = graph.NewNode(&dummy_operator0);
223 Node* n0 = graph.NewNode(&dummy_operator0);
224 Node* n1 = graph.NewNode(&dummy_operator0);
229 Node* n2 = graph.NewNode(&dummy_operator1, n0);
233 Node* n3 = graph.NewNode(&dummy_operator1, n0);
241 Node* n0 = graph.NewNode(&dummy_operator0);
242 Node* n1 = graph.NewNode(&dummy_operator1, n0);
245 Node* n2 = graph.NewNode(&dummy_operator1, n0);
253 Node* n3 = graph.NewNode(&dummy_operator0);
272 Node* n0 = graph.NewNode(&dummy_operator0);
273 Node* n1 = graph.NewNode(&dummy_operator1, n0);
278 Node* n2 = graph.NewNode(&dummy_operator1, n0);
283 Node* n3 = graph.NewNode(&dummy_operator1, n0);
294 Node* n0 = graph.NewNode(&dummy_operator0);
295 Node* n1 = graph.NewNode(&dummy_operator1, n0);
296 Node* n2 = graph.NewNode(&dummy_operator1, n0);
297 Node* n3 = graph.NewNode(&dummy_operator3, n0, n1, n2);
301 Node* n4 = graph.NewNode(&dummy_operator3, n0, n1, n2);
312 Node* n5 = graph.NewNode(&dummy_operator1, n4);
322 Node* n0 = graph.NewNode(&dummy_operator0);
323 Node* n1 = graph.NewNode(&dummy_operator1, n0);
324 Node* n2 = graph.NewNode(&dummy_operator2, n0, n1);
352 Node* n0 = graph.NewNode(&dummy_operator0);
353 Node* n1 = graph.NewNode(&dummy_operator1, n0);
354 Node* n2 = graph.NewNode(&dummy_operator2, n0, n1);
361 Node* n3 = graph.NewNode(&dummy_operator0);
374 Node* n0 = graph.NewNode(&dummy_operator0);
375 Node* n1 = graph.NewNode(&dummy_operator1, n0);
376 Node* n2 = graph.NewNode(&dummy_operator2, n0, n1);
401 Node* n0 = graph.NewNode(&dummy_operator0);
402 Node* n1 = graph.NewNode(&dummy_operator1, n0);
403 Node* n2 = graph.NewNode(&dummy_operator1, n0);
404 Node* n3 = graph.NewNode(&dummy_operator1, n0);
424 Node* n0 = graph.NewNode(&dummy_operator0);
425 Node* n1 = graph.NewNode(&dummy_operator1, n0);
426 Node* n2 = graph.NewNode(&dummy_operator1, n0);
427 Node* n3 = graph.NewNode(&dummy_operator0);
452 Node* n0 = graph.NewNode(&dummy_operator0);
453 Node* n1 = graph.NewNode(&dummy_operator0);
454 Node* n2 = graph.NewNode(&dummy_operator1, n0);
459 Node* n3 = graph.NewNode(&dummy_operator1, n0);
471 Node* n0 = graph.NewNode(&dummy_operator0);
472 Node* n1 = graph.NewNode(&dummy_operator1, n0);
479 Node* n0 = graph.NewNode(&dummy_operator0);
480 Node* n1 = graph.NewNode(&dummy_operator1, n0);
487 Node* n0 = graph.NewNode(&dummy_operator0);
488 Node* n1 = graph.NewNode(&dummy_operator0);
489 Node* n2 = graph.NewNode(&dummy_operator2, n0, n1);
497 Node* n0 = graph.NewNode(&dummy_operator0);
498 Node* n1 = graph.NewNode(&dummy_operator0);
499 Node* n2 = graph.NewNode(&dummy_operator2, n0, n1);
507 Node* n0 = graph.NewNode(&dummy_operator0);
508 Node* n1 = graph.NewNode(&dummy_operator0);
509 Node* n2 = graph.NewNode(&dummy_operator2, n0, n1);
517 Node* n0 = graph.NewNode(&dummy_operator0);
518 Node* n2 = graph.NewNode(&dummy_operator2, n0, n0);
525 Node* n0 = graph.NewNode(&dummy_operator0);
526 Node* n2 = graph.NewNode(&dummy_operator2, n0, n0);
539 Node* n0 = graph.NewNode(&dummy_operator0);
540 Node* n1 = graph.NewNode(&dummy_operator0);
551 Node* n0 = graph.NewNode(&dummy_operator0);
552 Node* n1 = graph.NewNode(&dummy_operator0);
561 Node* n0 = graph.NewNode(&dummy_operator0);
562 Node* n1 = graph.NewNode(&dummy_operator0);
563 Node* n2 = graph.NewNode(&dummy_operator0);
575 Node* n0 = graph.NewNode(&dummy_operator0);
576 Node* n1 = graph.NewNode(&dummy_operator0);
577 Node* n2 = graph.NewNode(&dummy_operator0);
589 Node* n0 = graph.NewNode(&dummy_operator0);
590 Node* n1 = graph.NewNode(&dummy_operator0);
591 Node* n2 = graph.NewNode(&dummy_operator0);
603 Node* n0 = graph.NewNode(&dummy_operator0);
604 Node* n2 = graph.NewNode(&dummy_operator0);
615 Node* n0 = graph.NewNode(&dummy_operator0);
616 Node* n2 = graph.NewNode(&dummy_operator0);
633 Node* n0 = graph.NewNode(&dummy_operator0);
634 Node* n1 = graph.NewNode(&dummy_operator0);
635 Node* n2 = graph.NewNode(&dummy_operator1, n0);
646 Node* n0 = graph.NewNode(&dummy_operator0);
647 Node* n1 = graph.NewNode(&dummy_operator0);
648 Node* n2 = graph.NewNode(&dummy_operator1, n0);
659 Node* n0 = graph.NewNode(&dummy_operator0);
660 Node* n1 = graph.NewNode(&dummy_operator0);
661 Node* n2 = graph.NewNode(&dummy_operator1, n0);
672 Node
673 Node* n2 = graph.NewNode(&dummy_operator1, n0);
684 Node* n0 = graph.NewNode(&dummy_operator0);
685 Node* n2 = graph.NewNode(&dummy_operator1, n0);
702 Node* n0 = graph.NewNode(&dummy_operator0);
703 Node* n1 = graph.NewNode(&dummy_operator1, n0);
704 Node* n2;
731 Node* n0 = graph.NewNode(&dummy_operator0);
732 Node* n1 = graph.NewNode(&dummy_operator1, n0);
753 Node* nodes[] = {
760 Node* last = graph.NewNode(&dummy_operator0);
