Lines Matching refs:Binop
24 binop(NULL),
40 const Operator* binop;
118 return reduce(Binop(op, Parameter(left_type, 0), Parameter(right_type, 1)));
121 Node* Binop(const Operator* op, Node* left, Node* right) {
231 Node* add = R.Binop(R.javascript.Add(), p0, p1);
247 Node* add = R.Binop(R.javascript.Add(BinaryOperationHints::Any()), p0, p1);
273 Node* add = R.Binop(ops[k], p0, p1);
341 Node* add = R.Binop(R.ops[k], p0, p1);
397 Node* add = R.Binop(R.ops[k], p0, p1);
590 Node* cmp = R.Binop(ops[k], p0, p1);
639 Node* cmp = R.Binop(ops[k], p0, p1);
669 Node* cmp = R.Binop(less_than, p0, p1);
749 // Helper class for testing the reduction of a single binop.
756 binop(R.Binop(op, p0, p1)),
757 effect_use(R.graph.NewNode(R.common.EffectPhi(1), binop, R.start())) {
758 // Effects should be ordered start -> binop -> effect_use
759 R.CheckEffectInput(R.start(), binop);
760 R.CheckEffectInput(binop, effect_use);
761 result = R.reduce(binop);
767 Node* binop;
816 Node* eq = R->Binop(op, p0, p1);
825 Node* ne = R->Binop(op, p0, p1);
1131 Node* add_node = R.Binop(R.simplified.NumberAdd(), n0, n1);
1133 R.Binop(R.ops[o], l ? add_node : one, l ? one : add_node);
1154 Node* add_node = R.Binop(R.simplified.NumberAdd(), n0, n1);
1156 R.Binop(R.ops[o], l ? add_node : one, l ? one : add_node);
1174 Node* add_node = R.Binop(R.simplified.NumberAdd(), n0, n1);
1175 Node* or_node = R.Binop(R.ops[o], add_node, one);
1176 Node* other_use = R.Binop(R.simplified.NumberAdd(), add_node, one);
1222 Node* cmp = R.Binop(ops[o].js_op, p0, p1);
