/freebsd-10.0-release/lib/msun/ld80/ |
H A D | k_cosl.c | 54 #define C1 ((long double)C1hi + C1lo) macro 57 C1 = 0.0416666666666666666136L; /* 0xaaaaaaaaaaaaaa9b.0p-68 */ variable 74 r = z*(C1+z*(C2+z*(C3+z*(C4+z*(C5+z*(C6+z*C7))))));
|
/freebsd-10.0-release/lib/msun/src/ |
H A D | k_cosf.c | 29 C1 = 0x155553e1053a42.0p-57, /* 0.0416666233237390631894 */ variable 45 return ((one+z*C0) + w*C1) + (w*z)*r;
|
H A D | k_cos.c | 29 * cos(x) ~ 1 - x*x/2 + C1*x + ... + C6*x 33 * |cos(x)-(1-.5*x +C1*x +C2*x +C3*x +C4*x +C5*x +C6*x )| <= 2 37 * 4. let r = C1*x +C2*x +C3*x +C4*x +C5*x +C6*x , then 61 C1 = 4.16666666666666019037e-02, /* 0x3FA55555, 0x5555554C */ variable 75 r = z*(C1+z*(C2+z*C3)) + w*w*(C4+z*(C5+z*C6));
|
/freebsd-10.0-release/lib/msun/ld128/ |
H A D | k_cosl.c | 36 C1 = 0.04166666666666666666666666666666658424671L, variable 56 r = z*(C1+z*(C2+z*(C3+z*(C4+z*(C5+z*(C6+z*(C7+
|
/freebsd-10.0-release/contrib/llvm/include/llvm/IR/ |
H A D | Constants.h | 833 static Constant *getAdd(Constant *C1, Constant *C2, 835 static Constant *getFAdd(Constant *C1, Constant *C2); 836 static Constant *getSub(Constant *C1, Constant *C2, 838 static Constant *getFSub(Constant *C1, Constant *C2); 839 static Constant *getMul(Constant *C1, Constant *C2, 841 static Constant *getFMul(Constant *C1, Constant *C2); 842 static Constant *getUDiv(Constant *C1, Constant *C2, bool isExact = false); 843 static Constant *getSDiv(Constant *C1, Constant *C2, bool isExact = false); 844 static Constant *getFDiv(Constant *C1, Constant *C2); 845 static Constant *getURem(Constant *C1, Constan 870 getNSWAdd(Constant *C1, Constant *C2) argument 873 getNUWAdd(Constant *C1, Constant *C2) argument 876 getNSWSub(Constant *C1, Constant *C2) argument 879 getNUWSub(Constant *C1, Constant *C2) argument 882 getNSWMul(Constant *C1, Constant *C2) argument 885 getNUWMul(Constant *C1, Constant *C2) argument 888 getNSWShl(Constant *C1, Constant *C2) argument 891 getNUWShl(Constant *C1, Constant *C2) argument 894 getExactSDiv(Constant *C1, Constant *C2) argument 897 getExactUDiv(Constant *C1, Constant *C2) argument 900 getExactAShr(Constant *C1, Constant *C2) argument 903 getExactLShr(Constant *C1, Constant *C2) argument [all...] |
/freebsd-10.0-release/contrib/llvm/lib/IR/ |
H A D | ConstantFold.cpp | 871 Constant *C1, Constant *C2) { 873 if (isa<UndefValue>(C1) || isa<UndefValue>(C2)) { 876 if (isa<UndefValue>(C1) && isa<UndefValue>(C2)) 879 return Constant::getNullValue(C1->getType()); 883 return UndefValue::get(C1->getType()); 885 if (isa<UndefValue>(C1) && isa<UndefValue>(C2)) // undef & undef -> undef 886 return C1; 887 return Constant::getNullValue(C1->getType()); // undef & X -> 0 891 if (((CI = dyn_cast<ConstantInt>(C1)) && CI->getValue()[0]) || 893 (isa<UndefValue>(C1) 870 ConstantFoldBinaryInstruction(unsigned Opcode, Constant *C1, Constant *C2) argument 1227 IdxCompare(Constant *C1, Constant *C2, Type *ElTy) argument 1569 ConstantFoldCompareInstruction(unsigned short pred, Constant *C1, Constant *C2) argument 1956 Constant *C1 = ConstantExpr::getSExtOrBitCast(Idx0, Int64Ty); local [all...] |
H A D | ConstantFold.h | 49 Constant *C1, Constant *C2);
|
H A D | Constants.cpp | 1667 Constant *ConstantExpr::get(unsigned Opcode, Constant *C1, Constant *C2, argument 1673 assert(C1->getType() == C2->getType() && 1681 assert(C1->getType() == C2->getType() && "Op types should be identical!"); 1682 assert(C1->getType()->isIntOrIntVectorTy() && 1688 assert(C1->getType() == C2->getType() && "Op types should be identical!"); 1689 assert(C1->getType()->isFPOrFPVectorTy() && 1695 assert(C1->getType() == C2->getType() && "Op types should be identical!"); 1696 assert(C1->getType()->isIntOrIntVectorTy() && 1700 assert(C1->getType() == C2->getType() && "Op types should be identical!"); 1701 assert(C1 1786 getCompare(unsigned short Predicate, Constant *C1, Constant *C2) argument 2004 getAdd(Constant *C1, Constant *C2, bool HasNUW, bool HasNSW) argument 2011 getFAdd(Constant *C1, Constant *C2) argument 2015 getSub(Constant *C1, Constant *C2, bool HasNUW, bool HasNSW) argument 2022 getFSub(Constant *C1, Constant *C2) argument 2026 getMul(Constant *C1, Constant *C2, bool HasNUW, bool HasNSW) argument 2033 getFMul(Constant *C1, Constant *C2) argument 2037 getUDiv(Constant *C1, Constant *C2, bool isExact) argument 2042 getSDiv(Constant *C1, Constant *C2, bool isExact) argument 2047 getFDiv(Constant *C1, Constant *C2) argument 2051 getURem(Constant *C1, Constant *C2) argument 2055 getSRem(Constant *C1, Constant *C2) argument 2059 getFRem(Constant *C1, Constant *C2) argument 2063 getAnd(Constant *C1, Constant *C2) argument 2067 getOr(Constant *C1, Constant *C2) argument 2071 getXor(Constant *C1, Constant *C2) argument 2075 getShl(Constant *C1, Constant *C2, bool HasNUW, bool HasNSW) argument 2082 getLShr(Constant *C1, Constant *C2, bool isExact) argument 2087 getAShr(Constant *C1, Constant *C2, bool isExact) argument [all...] |
H A D | ConstantsContext.h | 59 BinaryConstantExpr(unsigned Opcode, Constant *C1, Constant *C2, argument 61 : ConstantExpr(C1->getType(), Opcode, &Op<0>(), 2) { 62 Op<0>() = C1; 80 SelectConstantExpr(Constant *C1, Constant *C2, Constant *C3) argument 82 Op<0>() = C1; 101 ExtractElementConstantExpr(Constant *C1, Constant *C2) argument 102 : ConstantExpr(cast<VectorType>(C1->getType())->getElementType(), 104 Op<0>() = C1; 122 InsertElementConstantExpr(Constant *C1, Constant *C2, Constant *C3) argument 123 : ConstantExpr(C1 144 ShuffleVectorConstantExpr(Constant *C1, Constant *C2, Constant *C3) argument [all...] |
/freebsd-10.0-release/contrib/llvm/lib/Transforms/InstCombine/ |
H A D | InstCombineMulDivRem.cpp | 77 static bool MultiplyOverflows(ConstantInt *C1, ConstantInt *C2, bool sign) { argument 78 uint32_t W = C1->getBitWidth(); 79 APInt LHSExt = C1->getValue(), RHSExt = C2->getValue(); 113 // ((X << C1)*C2) == (X * (C2 << C1)) 129 // Canonicalize (X+C1)*CI -> X*CI+C1*CI. 130 { Value *X; ConstantInt *C1; local 132 match(Op0, m_Add(m_Value(X), m_ConstantInt(C1)))) { 134 return BinaryOperator::CreateAdd(Add, Builder->CreateMul(C1, C 147 ConstantInt *C1; local 304 ConstantFP *C1 = dyn_cast<ConstantFP>(I->getOperand(1)); local 333 ConstantFP *C1 = dyn_cast<ConstantFP>(Opnd1); local 413 ConstantFP *C1 = dyn_cast<ConstantFP>(Opnd1); local 743 ConstantInt *C1; local 767 { Value *Cond; const APInt *C1, *C2; local 884 ConstantFP *C1 = 0; local 923 ConstantFP *C1 = cast<ConstantFP>(Op0), *C2; local 1047 { Value *Cond; const APInt *C1, *C2; local [all...] |
H A D | InstCombineSelect.cpp | 196 static bool isSelect01(Constant *C1, Constant *C2) { argument 197 ConstantInt *C1I = dyn_cast<ConstantInt>(C1); 354 /// (select (icmp eq (and X, C1), 0), Y, (or Y, C2)) 356 /// (or (shl (and X, C1), C3), y) 358 /// C1 and C2 are both powers of 2 360 /// C3 = Log(C2) - Log(C1) 365 /// 3. The magnitude of C2 and C1 are flipped 380 const APInt *C1; local 381 if (!match(CmpLHS, m_And(m_Value(X), m_Power2(C1)))) 396 unsigned C1Log = C1 530 ConstantInt *C1 = NULL, *C2 = NULL; local [all...] |
H A D | InstCombineAddSub.cpp | 357 ConstantFP *C0, *C1; local 363 if ((C1 = dyn_cast<ConstantFP>(Opnd1)) && C1->isZero()) 375 if (!C1) 378 Addend.set(C1, 0); 1024 // X*C1 + X*C2 --> X * (C1+C2) 1025 ConstantInt *C1; 1026 if (X == dyn_castFoldableMul(RHS, C1)) 1027 return BinaryOperator::CreateMul(X, ConstantExpr::getAdd(C1, C 1242 Value *A1, *B1, *C1, *A2, *B2, *C2; local 1484 ConstantInt *C1; local [all...] |
H A D | InstCombineAndOrXor.cpp | 128 // OptAndOp - This handles expressions of the form ((val OP C1) & C2). Where 129 // the Op parameter is 'OP', OpRHS is 'C1', and AndRHS is 'C2'. Op is 143 // (X ^ C1) & C2 --> (X & C2) ^ (C1&C2) 152 // (X | C1) & C2 --> (X | (C1&C2)) & C2 160 // (X | C1) & C2 --> (X & (C2^(C1&C2))) | C1 257 // (Val ashr C1) 1773 ConstantInt *C1 = 0; Value *X = 0; local 1807 ConstantInt *C1 = 0, *C2 = 0; local 2217 ConstantInt *C1; local [all...] |
/freebsd-10.0-release/contrib/llvm/tools/clang/lib/AST/ |
H A D | RawCommentList.cpp | 247 const RawComment &C1 = *Comments.back(); local 255 (C1.isTrailingComment() == C2.isTrailingComment())) { 256 unsigned C1EndLine = C1.getEndLine(SourceMgr); 259 SourceRange MergedRange(C1.getSourceRange().getBegin(),
|
/freebsd-10.0-release/contrib/gcc/ |
H A D | rtl.h | 461 #define RTL_CHECK1(RTX, N, C1) __extension__ \ 467 if (GET_RTX_FORMAT(_code)[_n] != C1) \ 468 rtl_check_failed_type1 (_rtx, _n, C1, __FILE__, __LINE__, \ 472 #define RTL_CHECK2(RTX, N, C1, C2) __extension__ \ 478 if (GET_RTX_FORMAT(_code)[_n] != C1 \ 480 rtl_check_failed_type2 (_rtx, _n, C1, C2, __FILE__, __LINE__, \ 491 #define RTL_CHECKC2(RTX, N, C1, C2) __extension__ \ 494 if (_code != (C1) && _code != (C2)) \ 495 rtl_check_failed_code2 (_rtx, (C1), (C2), __FILE__, __LINE__, \ 572 #define RTL_CHECK1(RTX, N, C1) ((RT [all...] |
/freebsd-10.0-release/crypto/openssl/crypto/whrlpool/ |
H A D | wp_block.c | 151 # define C1(K,i) ROTATE(Cx.q[K.c[(i)*8+1]],8) macro 169 # define C1(K,i) (Cx.q[1+8*K.c[(i)*8+1]]) macro 182 # define C1(K,i) (((u64*)(Cx.c+7))[2*K.c[(i)*8+1]]) macro 487 L[i] ^= C0(K,i) ^ C1(K,(i-1)&7) ^ 495 L[i] ^= C0(S,i) ^ C1(S,(i-1)&7) ^ 536 L0 = C0(K,0) ^ C1(K,7) ^ C2(K,6) ^ C3(K,5) ^ 538 L1 = C0(K,1) ^ C1(K,0) ^ C2(K,7) ^ C3(K,6) ^ 540 L2 = C0(K,2) ^ C1(K,1) ^ C2(K,0) ^ C3(K,7) ^ 542 L3 = C0(K,3) ^ C1(K,2) ^ C2(K,1) ^ C3(K,0) ^ 544 L4 = C0(K,4) ^ C1( [all...] |
/freebsd-10.0-release/contrib/llvm/lib/CodeGen/SelectionDAG/ |
H A D | TargetLowering.cpp | 495 // e.g. (A & C1)^(B & C2) -> (A & C1)|(B & C2) iff C1&C2 == 0 509 // e.g. (X | C1) ^ C2 --> (X | C1) & ~C2 iff (C1&C2) == C2 588 // If this is ((X >>u C1) << ShAmt), see if we can simplify this into a 594 unsigned C1= cast<ConstantSDNode>(InOp.getOperand(1))->getZExtValue(); local 596 int Diff = ShAmt-C1; 652 // If this is ((X << C1) >> 658 unsigned C1= cast<ConstantSDNode>(InOp.getOperand(1))->getZExtValue(); local 1087 const APInt &C1 = N1C->getAPIntValue(); local [all...] |
/freebsd-10.0-release/contrib/binutils/opcodes/ |
H A D | ia64-opc.h | 49 #define C1 IA64_OPND_C1 macro
|
/freebsd-10.0-release/contrib/llvm/lib/Analysis/ |
H A D | AliasSetTracker.cpp | 184 CallSite C1 = getUnknownInst(i), C2 = Inst; local 185 if (!C1 || !C2 || 186 AA.getModRefInfo(C1, C2) != AliasAnalysis::NoModRef || 187 AA.getModRefInfo(C2, C1) != AliasAnalysis::NoModRef)
|
/freebsd-10.0-release/sys/dev/ep/ |
H A D | if_ep_pccard.c | 74 { PCMCIA_CARD(3COM, 3C1), EP_CHIP_C1 },
|
/freebsd-10.0-release/contrib/llvm/lib/Transforms/Scalar/ |
H A D | Reassociate.cpp | 116 /// C1) The operand is in the form "X & C", where C is a constant and C != ~0 120 /// C2.2) Any operand E which doesn't fall into C1 and C2.1, we view this 1167 const APInt &C1 = Opnd1->getConstPart(); 1168 if (C1 != ConstOpnd) 1172 Res = createAndInstr(I, X, ~C1); 1173 // ConstOpnd was C2, now C1 ^ C2. 1174 ConstOpnd ^= C1; 1215 const APInt &C1 = Opnd1->getConstPart(); 1217 APInt C3((~C1) ^ C2); 1227 ConstOpnd ^= C1; [all...] |
/freebsd-10.0-release/contrib/llvm/lib/Transforms/IPO/ |
H A D | MergeFunctions.cpp | 392 if (const Constant *C1 = dyn_cast<Constant>(V1)) { 397 if (C1->isNullValue() && C2->isNullValue() && 398 isEquivalentType(C1->getType(), C2->getType())) 400 // Try bitcasting C2 to C1's type. If the bitcast is legal and returns C1 402 return C1->getType()->canLosslesslyBitCastTo(C2->getType()) && 403 C1 == ConstantExpr::getBitCast(const_cast<Constant*>(C2), C1->getType());
|
/freebsd-10.0-release/contrib/llvm/lib/CodeGen/ |
H A D | IfConversion.cpp | 232 static bool IfcvtTokenCmp(IfcvtToken *C1, IfcvtToken *C2) { argument 233 int Incr1 = (C1->Kind == ICDiamond) 234 ? -(int)(C1->NumDups + C1->NumDups2) : (int)C1->NumDups; 241 if (C1->NeedSubsumption == false && C2->NeedSubsumption == true) 243 else if (C1->NeedSubsumption == C2->NeedSubsumption) { 245 if ((unsigned)C1->Kind < (unsigned)C2->Kind) 247 else if (C1->Kind == C2->Kind) 248 return C1 [all...] |
/freebsd-10.0-release/usr.bin/systat/ |
H A D | ifstat.c | 49 #define C1 0 /* 0-19 */ macro 56 static const int col1 = C1;
|
/freebsd-10.0-release/libexec/getty/ |
H A D | gettytab.h | 117 #define C1 gettynums[14].value macro
|