Lines Matching refs:Op
126 Op<-1>().set(0);
145 if (NumOps < 2) NumOps = 2; // 2 op PHI nodes are VERY common.
268 Op<-1>() = Func;
290 Op<-1>() = Func;
534 Op<-3>() = Fn;
535 Op<-2>() = IfNormal;
536 Op<-1>() = IfException;
621 Op<0>() = RI.Op<0>();
630 Op<0>() = retVal;
637 Op<0>() = retVal;
668 Op<0>() = RI.Op<0>();
674 Op<0>() = Exn;
680 Op<0>() = Exn;
736 Op<-1>() = IfTrue;
743 Op<-1>() = IfTrue;
744 Op<-2>() = IfFalse;
745 Op<-3>() = Cond;
756 Op<-1>() = IfTrue;
764 Op<-1>() = IfTrue;
765 Op<-2>() = IfFalse;
766 Op<-3>() = Cond;
777 Op<-1>() = BI.Op<-1>();
780 Op<-3>() = BI.Op<-3>();
781 Op<-2>() = BI.Op<-2>();
789 Op<-1>().swap(Op<-2>());
1095 Op<0>() = val;
1096 Op<1>() = addr;
1108 Op<0>() = val;
1109 Op<1>() = addr;
1122 Op<0>() = val;
1123 Op<1>() = addr;
1136 Op<0>() = val;
1137 Op<1>() = addr;
1152 Op<0>() = val;
1153 Op<1>() = addr;
1166 Op<0>() = val;
1167 Op<1>() = addr;
1180 Op<0>() = val;
1181 Op<1>() = addr;
1196 Op<0>() = val;
1197 Op<1>() = addr;
1220 Op<0>() = Ptr;
1221 Op<1>() = Cmp;
1222 Op<2>() = NewVal;
1269 Op<0>() = Ptr;
1270 Op<1>() = Val;
1449 Op<0>() = Val;
1450 Op<1>() = Index;
1464 Op<0>() = Val;
1465 Op<1>() = Index;
1489 Op<0>() = Vec;
1490 Op<1>() = Elt;
1491 Op<2>() = Index;
1504 Op<0>() = Vec;
1505 Op<1>() = Elt;
1506 Op<2>() = Index;
1539 Op<0>() = V1;
1540 Op<1>() = V2;
1541 Op<2>() = Mask;
1557 Op<0>() = V1;
1558 Op<1>() = V2;
1559 Op<2>() = Mask;
1659 Op<0>() = Agg;
1660 Op<1>() = Val;
1670 Op<0>() = IVI.getOperand(0);
1671 Op<1>() = IVI.getOperand(1);
1739 Op<0>() = S1;
1740 Op<1>() = S2;
1752 Op<0>() = S1;
1753 Op<1>() = S2;
1834 BinaryOperator *BinaryOperator::Create(BinaryOps Op, Value *S1, Value *S2,
1839 return new BinaryOperator(Op, S1, S2, S1->getType(), Name, InsertBefore);
1842 BinaryOperator *BinaryOperator::Create(BinaryOps Op, Value *S1, Value *S2,
1845 BinaryOperator *Res = Create(Op, S1, S2, Name);
1850 BinaryOperator *BinaryOperator::CreateNeg(Value *Op, const Twine &Name,
1852 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1854 zero, Op,
1855 Op->getType(), Name, InsertBefore);
1858 BinaryOperator *BinaryOperator::CreateNeg(Value *Op, const Twine &Name,
1860 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1862 zero, Op,
1863 Op->getType(), Name, InsertAtEnd);
1866 BinaryOperator *BinaryOperator::CreateNSWNeg(Value *Op, const Twine &Name,
1868 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1869 return BinaryOperator::CreateNSWSub(zero, Op, Name, InsertBefore);
1872 BinaryOperator *BinaryOperator::CreateNSWNeg(Value *Op, const Twine &Name,
1874 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1875 return BinaryOperator::CreateNSWSub(zero, Op, Name, InsertAtEnd);
1878 BinaryOperator *BinaryOperator::CreateNUWNeg(Value *Op, const Twine &Name,
1880 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1881 return BinaryOperator::CreateNUWSub(zero, Op, Name, InsertBefore);
1884 BinaryOperator *BinaryOperator::CreateNUWNeg(Value *Op, const Twine &Name,
1886 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1887 return BinaryOperator::CreateNUWSub(zero, Op, Name, InsertAtEnd);
1890 BinaryOperator *BinaryOperator::CreateFNeg(Value *Op, const Twine &Name,
1892 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1893 return new BinaryOperator(Instruction::FSub, zero, Op,
1894 Op->getType(), Name, InsertBefore);
1897 BinaryOperator *BinaryOperator::CreateFNeg(Value *Op, const Twine &Name,
1899 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1900 return new BinaryOperator(Instruction::FSub, zero, Op,
1901 Op->getType(), Name, InsertAtEnd);
1904 BinaryOperator *BinaryOperator::CreateNot(Value *Op, const Twine &Name,
1906 Constant *C = Constant::getAllOnesValue(Op->getType());
1907 return new BinaryOperator(Instruction::Xor, Op, C,
1908 Op->getType(), Name, InsertBefore);
1911 BinaryOperator *BinaryOperator::CreateNot(Value *Op, const Twine &Name,
1913 Constant *AllOnes = Constant::getAllOnesValue(Op->getType());
1914 return new BinaryOperator(Instruction::Xor, Op, AllOnes,
1915 Op->getType(), Name, InsertAtEnd);
1993 Op<0>().swap(Op<1>());
2077 /// no code gen is necessary for the cast, hence the name no-op cast. For
2078 /// example, the following are all no-op casts:
2082 /// @brief Determine if the described cast is a no-op.
2110 /// @brief Determine if a cast is a no-op.
2203 // no-op cast in second op implies firstOp as long as the DestTy
2210 // no-op cast in second op implies firstOp as long as the DestTy
2216 // no-op cast in first op implies secondOp as long as the SrcTy
2222 // no-op cast in first op implies secondOp as long as the SrcTy
2325 CastInst *CastInst::Create(Instruction::CastOps op, Value *S, Type *Ty,
2327 assert(castIsValid(op, S, Ty) && "Invalid cast!");
2329 switch (op) {
2346 CastInst *CastInst::Create(Instruction::CastOps op, Value *S, Type *Ty,
2348 assert(castIsValid(op, S, Ty) && "Invalid cast!");
2350 switch (op) {
2648 return BitCast; // Same size, No-op cast
2658 return BitCast; // Same size, no-op cast
2676 return BitCast; // same size, no-op cast
2681 return BitCast; // same size, no-op cast
2715 CastInst::castIsValid(Instruction::CastOps op, Value *S, Type *DstTy) {
2741 switch (op) {
2783 // BitCast implies a no-op cast of type only. No bits change.
2944 CmpInst::CmpInst(Type *ty, OtherOps op, unsigned short predicate,
2947 : Instruction(ty, op,
2951 Op<0>() = LHS;
2952 Op<1>() = RHS;
2957 CmpInst::CmpInst(Type *ty, OtherOps op, unsigned short predicate,
2960 : Instruction(ty, op,
2964 Op<0>() = LHS;
2965 Op<1>() = RHS;
2971 CmpInst::Create(OtherOps Op, unsigned short predicate,
2974 if (Op == Instruction::ICmp) {
2992 CmpInst::Create(OtherOps Op, unsigned short predicate, Value *S1, Value *S2,
2994 if (Op == Instruction::ICmp) {
3476 return Create(getOpcode(), Op<0>(), Op<1>());
3480 return new FCmpInst(getPredicate(), Op<0>(), Op<1>());
3484 return new ICmpInst(getPredicate(), Op<0>(), Op<1>());
