Lines Matching defs:binop
21 binop(NULL),
35 const Operator* binop;
108 return reduce(Binop(op, Parameter(left_type, 0), Parameter(right_type, 1)));
111 Node* Binop(const Operator* op, Node* left, Node* right) {
205 Node* add = R.Binop(R.javascript.Add(), p0, p1);
222 Node* add = R.Binop(R.javascript.Add(), p0, p1);
249 Node* add = R.Binop(ops[k], p0, p1);
319 Node* add = R.Binop(R.ops[k], p0, p1);
379 Node* add = R.Binop(R.ops[k], p0, p1);
651 Node* cmp = R.Binop(ops[k], p0, p1);
706 Node* cmp = R.Binop(ops[k], p0, p1);
737 Node* cmp = R.Binop(R.javascript.LessThan(), p0, p1);
762 Node* cmp = R.Binop(R.javascript.LessThan(), p0, p1);
865 // Helper class for testing the reduction of a single binop.
872 binop(R.Binop(op, p0, p1)),
873 effect_use(R.graph.NewNode(R.common.EffectPhi(1), binop, R.start())) {
874 // Effects should be ordered start -> binop -> effect_use
875 R.CheckEffectInput(R.start(), binop);
876 R.CheckEffectInput(binop, effect_use);
877 result = R.reduce(binop);
883 Node* binop;
930 : R->Binop(R->javascript.Equal(), p0, p1);
938 : R->Binop(R->javascript.NotEqual(), p0, p1);
1260 Node* add_node = R.Binop(R.simplified.NumberAdd(), n0, n1);
1262 R.Binop(R.ops[o], l ? add_node : one, l ? one : add_node);
1287 Node* add_node = R.Binop(R.simplified.NumberAdd(), n0, n1);
1289 R.Binop(R.ops[o], l ? add_node : one, l ? one : add_node);
1314 Node* add_node = R.Binop(R.simplified.NumberAdd(), n0, n1);
1315 Node* or_node = R.Binop(R.ops[o], add_node, one);
1316 Node* other_use = R.Binop(R.simplified.NumberAdd(), add_node, one);
1363 Node* cmp = R.Binop(ops[o].js_op, p0, p1);
