Lines Matching refs:op1
567 NodeIndex op1 = getThis();
568 setThis(addToGraph(ConvertThis, op1));
575 NodeIndex op1 = getToInt32(currentInstruction[2].u.operand);
577 set(currentInstruction[1].u.operand, addToGraph(BitAnd, op1, op2));
582 NodeIndex op1 = getToInt32(currentInstruction[2].u.operand);
584 set(currentInstruction[1].u.operand, addToGraph(BitOr, op1, op2));
589 NodeIndex op1 = getToInt32(currentInstruction[2].u.operand);
591 set(currentInstruction[1].u.operand, addToGraph(BitXor, op1, op2));
596 NodeIndex op1 = getToInt32(currentInstruction[2].u.operand);
601 result = op1;
603 result = addToGraph(BitRShift, op1, op2);
609 NodeIndex op1 = getToInt32(currentInstruction[2].u.operand);
614 result = op1;
616 result = addToGraph(BitLShift, op1, op2);
622 NodeIndex op1 = getToInt32(currentInstruction[2].u.operand);
636 result = addToGraph(BitURShift, op1, op2);
638 result = addToGraph(UInt32ToNumber, op1);
641 result = addToGraph(BitURShift, op1, op2);
686 NodeIndex op1 = get(currentInstruction[2].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));
699 NodeIndex op1 = getToNumber(currentInstruction[2].u.operand);
701 set(currentInstruction[1].u.operand, addToGraph(ArithSub, op1, op2));
707 NodeIndex op1 = getToNumber(currentInstruction[2].u.operand);
709 set(currentInstruction[1].u.operand, addToGraph(ArithMul, op1, op2));
715 NodeIndex op1 = getToNumber(currentInstruction[2].u.operand);
717 set(currentInstruction[1].u.operand, addToGraph(ArithMod, op1, op2));
723 NodeIndex op1 = getToNumber(currentInstruction[2].u.operand);
725 set(currentInstruction[1].u.operand, addToGraph(ArithDiv, op1, op2));
746 NodeIndex op1 = get(currentInstruction[2].u.operand);
748 set(currentInstruction[1].u.operand, addToGraph(CompareLess, op1, op2));
754 NodeIndex op1 = get(currentInstruction[2].u.operand);
756 set(currentInstruction[1].u.operand, addToGraph(CompareLessEq, op1, op2));
762 NodeIndex op1 = get(currentInstruction[2].u.operand);
764 set(currentInstruction[1].u.operand, addToGraph(CompareEq, op1, op2));
777 NodeIndex op1 = get(currentInstruction[2].u.operand);
779 set(currentInstruction[1].u.operand, addToGraph(CompareStrictEq, op1, op2));
785 NodeIndex op1 = get(currentInstruction[2].u.operand);
787 set(currentInstruction[1].u.operand, addToGraph(LogicalNot, addToGraph(CompareEq, op1, op2)));
800 NodeIndex op1 = get(currentInstruction[2].u.operand);
802 set(currentInstruction[1].u.operand, addToGraph(LogicalNot, addToGraph(CompareStrictEq, op1, op2)));
931 NodeIndex op1 = get(currentInstruction[1].u.operand);
933 NodeIndex condition = addToGraph(CompareLess, op1, op2);
940 NodeIndex op1 = get(currentInstruction[1].u.operand);
942 NodeIndex condition = addToGraph(CompareLessEq, op1, op2);
949 NodeIndex op1 = get(currentInstruction[1].u.operand);
951 NodeIndex condition = addToGraph(CompareLess, op1, op2);
958 NodeIndex op1 = get(currentInstruction[1].u.operand);
960 NodeIndex condition = addToGraph(CompareLessEq, op1, op2);
967 NodeIndex op1 = get(currentInstruction[1].u.operand);
969 NodeIndex condition = addToGraph(CompareLess, op1, op2);
976 NodeIndex op1 = get(currentInstruction[1].u.operand);
978 NodeIndex condition = addToGraph(CompareLessEq, op1, op2);
