Lines Matching refs:Node
8 #include "src/compiler/node-properties.h"
11 #include "test/unittests/compiler/node-test-utils.h"
46 Node* condition = Parameter(0);
47 Node* outer_branch =
50 Node* outer_if_true = graph()->NewNode(common()->IfTrue(), outer_branch);
51 Node* inner_branch =
53 Node* inner_if_true = graph()->NewNode(common()->IfTrue(), inner_branch);
54 Node* inner_if_false = graph()->NewNode(common()->IfFalse(), inner_branch);
55 Node* inner_merge =
57 Node* inner_phi =
61 Node* outer_if_false = graph()->NewNode(common()->IfFalse(), outer_branch);
62 Node* outer_merge =
64 Node* outer_phi =
68 Node* ret = graph()->NewNode(common()->Return(), outer_phi, graph()->start(),
86 Node* condition = Parameter(0);
87 Node* outer_branch =
90 Node* outer_if_true = graph()->NewNode(common()->IfTrue(), outer_branch);
92 Node* outer_if_false = graph()->NewNode(common()->IfFalse(), outer_branch);
93 Node* inner_branch =
95 Node* inner_if_true = graph()->NewNode(common()->IfTrue(), inner_branch);
96 Node* inner_if_false = graph()->NewNode(common()->IfFalse(), inner_branch);
97 Node* inner_merge =
99 Node* inner_phi =
103 Node* outer_merge =
105 Node* outer_phi =
109 Node* ret = graph()->NewNode(common()->Return(), outer_phi, graph()->start(),
126 Node* condition = Parameter(0);
128 Node* branch1 =
130 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1);
131 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1);
132 Node* merge1 = graph()->NewNode(common()->Merge(2), if_true1, if_false1);
133 Node* phi1 =
137 Node* branch2 = graph()->NewNode(common()->Branch(), condition, merge1);
138 Node* if_true2 = graph()->NewNode(common()->IfTrue(), branch2);
139 Node* if_false2 = graph()->NewNode(common()->IfFalse(), branch2);
140 Node* merge2 = graph()->NewNode(common()->Merge(2), if_true2, if_false2);
141 Node* phi2 =
146 Node* add = graph()->NewNode(machine()->Int32Add(), phi1, phi2);
147 Node* ret =
165 Node* condition = Parameter(0);
167 Node* outer_branch =
169 Node* outer_if_true = graph()->NewNode(common()->IfTrue(), outer_branch);
172 Node* loop = graph()->NewNode(common()->Loop(1), outer_if_true);
173 Node* effect =
176 Node* inner_branch = graph()->NewNode(common()->Branch(), condition, loop);
178 Node* inner_if_true = graph()->NewNode(common()->IfTrue(), inner_branch);
179 Node* ret1 = graph()->NewNode(common()->Return(), Int32Constant(2), effect,
182 Node* inner_if_false = graph()->NewNode(common()->IfFalse(), inner_branch);
188 Node* outer_if_false = graph()->NewNode(common()->IfFalse(), outer_branch);
189 Node* outer_merge =
191 Node* outer_ephi = graph()->NewNode(common()->EffectPhi(2), effect,
194 Node* ret2 = graph()->NewNode(common()->Return(), Int32Constant(1),
197 Node* terminate = graph()->NewNode(common()->Terminate(), effect, loop);
