Lines Matching refs:op2
576 NodeIndex op2 = getToInt32(currentInstruction[3].u.operand);
577 set(currentInstruction[1].u.operand, addToGraph(BitAnd, op1, op2));
583 NodeIndex op2 = getToInt32(currentInstruction[3].u.operand);
584 set(currentInstruction[1].u.operand, addToGraph(BitOr, op1, op2));
590 NodeIndex op2 = getToInt32(currentInstruction[3].u.operand);
591 set(currentInstruction[1].u.operand, addToGraph(BitXor, op1, op2));
597 NodeIndex op2 = getToInt32(currentInstruction[3].u.operand);
600 if (isInt32Constant(op2) && !(valueOfInt32Constant(op2) & 0x1f))
603 result = addToGraph(BitRShift, op1, op2);
610 NodeIndex op2 = getToInt32(currentInstruction[3].u.operand);
613 if (isInt32Constant(op2) && !(valueOfInt32Constant(op2) & 0x1f))
616 result = addToGraph(BitLShift, op1, op2);
623 NodeIndex op2 = getToInt32(currentInstruction[3].u.operand);
629 if (isInt32Constant(op2)) {
635 if (valueOfInt32Constant(op2) & 0x1f)
636 result = addToGraph(BitURShift, op1, op2);
641 result = addToGraph(BitURShift, op1, op2);
687 NodeIndex op2 = get(currentInstruction[3].u.operand);
690 if (m_graph[op1].hasNumericResult() && m_graph[op2].hasNumericResult())
691 set(currentInstruction[1].u.operand, addToGraph(ArithAdd, toNumber(op1), toNumber(op2)));
693 set(currentInstruction[1].u.operand, addToGraph(ValueAdd, op1, op2));
700 NodeIndex op2 = getToNumber(currentInstruction[3].u.operand);
701 set(currentInstruction[1].u.operand, addToGraph(ArithSub, op1, op2));
708 NodeIndex op2 = getToNumber(currentInstruction[3].u.operand);
709 set(currentInstruction[1].u.operand, addToGraph(ArithMul, op1, op2));
716 NodeIndex op2 = getToNumber(currentInstruction[3].u.operand);
717 set(currentInstruction[1].u.operand, addToGraph(ArithMod, op1, op2));
724 NodeIndex op2 = getToNumber(currentInstruction[3].u.operand);
725 set(currentInstruction[1].u.operand, addToGraph(ArithDiv, op1, op2));
747 NodeIndex op2 = get(currentInstruction[3].u.operand);
748 set(currentInstruction[1].u.operand, addToGraph(CompareLess, op1, op2));
755 NodeIndex op2 = get(currentInstruction[3].u.operand);
756 set(currentInstruction[1].u.operand, addToGraph(CompareLessEq, op1, op2));
763 NodeIndex op2 = get(currentInstruction[3].u.operand);
764 set(currentInstruction[1].u.operand, addToGraph(CompareEq, op1, op2));
778 NodeIndex op2 = get(currentInstruction[3].u.operand);
779 set(currentInstruction[1].u.operand, addToGraph(CompareStrictEq, op1, op2));
786 NodeIndex op2 = get(currentInstruction[3].u.operand);
787 set(currentInstruction[1].u.operand, addToGraph(LogicalNot, addToGraph(CompareEq, op1, op2)));
801 NodeIndex op2 = get(currentInstruction[3].u.operand);
802 set(currentInstruction[1].u.operand, addToGraph(LogicalNot, addToGraph(CompareStrictEq, op1, op2)));
932 NodeIndex op2 = get(currentInstruction[2].u.operand);
933 NodeIndex condition = addToGraph(CompareLess, op1, op2);
941 NodeIndex op2 = get(currentInstruction[2].u.operand);
942 NodeIndex condition = addToGraph(CompareLessEq, op1, op2);
950 NodeIndex op2 = get(currentInstruction[2].u.operand);
951 NodeIndex condition = addToGraph(CompareLess, op1, op2);
959 NodeIndex op2 = get(currentInstruction[2].u.operand);
960 NodeIndex condition = addToGraph(CompareLessEq, op1, op2);
968 NodeIndex op2 = get(currentInstruction[2].u.operand);
969 NodeIndex condition = addToGraph(CompareLess, op1, op2);
977 NodeIndex op2 = get(currentInstruction[2].u.operand);
978 NodeIndex condition = addToGraph(CompareLessEq, op1, op2);
