/freebsd-11-stable/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-11-stable/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));
|
H A D | k_sincosf.h | 27 C1 = 0x155553e1053a42.0p-57, /* 0.0416666233237390631894 */ variable 42 *cs = ((1 + z * C0) + w * C1) + (w * z) * r;
|
H A D | k_sincos.h | 26 C1 = 4.16666666666666019037e-02, /* 0x3FA55555, 0x5555554C */ variable 48 r = z * (C1 + z * (C2 + z * C3)) + w * w * (C4 + z * (C5 + z * C6));
|
H A D | k_sincosl.h | 28 #define C1 ((long double)C1hi + C1lo) macro 31 C1 = 0.0416666666666666666136L, /* 0xaaaaaaaaaaaaaa9b.0p-68 */ variable 71 r = z * (C1 + z * (C2 + z * (C3 + z * (C4 + z * (C5 + z * (C6 + 79 C1 = 0.04166666666666666666666666666666658424671L, variable 127 r = z * (C1 + z * (C2 + z * (C3 + z * (C4 + z * (C5 + z * (C6 +
|
/freebsd-11-stable/contrib/llvm-project/lldb/include/lldb/Utility/ |
H A D | Iterable.h | 113 template <typename C1, typename E1, E1 (*A1)(typename C1::const_iterator &)> 114 friend AdaptedConstIterator<C1, E1, A1> 115 operator+(typename C1::const_iterator::difference_type, 116 AdaptedConstIterator<C1, E1, A1> &); 118 template <typename C1, typename E1, E1 (*A1)(typename C1::const_iterator &)> 119 friend typename C1::const_iterator::difference_type 120 operator-(AdaptedConstIterator<C1, E1, A1> &, 121 AdaptedConstIterator<C1, E [all...] |
/freebsd-11-stable/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-11-stable/crypto/openssl/crypto/modes/asm/ |
H A D | ghash-sparcv9.pl | 351 ($Hhl,$Hlo,$Hhi,$Xlo,$Xhi,$xE1,$sqr, $C0,$C1,$C2,$C3,$V)= 408 xmulx $C2,$Hhl,$C1 419 xor $C0,$C1,$C1 ! Karatsuba post-processing 421 xor $sqr,$Xlo,$Xlo ! real destination is $C1 423 xor $Xlo,$C1,$C1 425 xor $Xhi,$C1,$C1 429 xmulx $C1, [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/IR/ |
H A D | Constants.h | 932 static Constant *getAdd(Constant *C1, Constant *C2, 934 static Constant *getFAdd(Constant *C1, Constant *C2); 935 static Constant *getSub(Constant *C1, Constant *C2, 937 static Constant *getFSub(Constant *C1, Constant *C2); 938 static Constant *getMul(Constant *C1, Constant *C2, 940 static Constant *getFMul(Constant *C1, Constant *C2); 941 static Constant *getUDiv(Constant *C1, Constant *C2, bool isExact = false); 942 static Constant *getSDiv(Constant *C1, Constant *C2, bool isExact = false); 943 static Constant *getFDiv(Constant *C1, Constant *C2); 944 static Constant *getURem(Constant *C1, Constan 977 getNSWAdd(Constant *C1, Constant *C2) argument 981 getNUWAdd(Constant *C1, Constant *C2) argument 985 getNSWSub(Constant *C1, Constant *C2) argument 989 getNUWSub(Constant *C1, Constant *C2) argument 993 getNSWMul(Constant *C1, Constant *C2) argument 997 getNUWMul(Constant *C1, Constant *C2) argument 1001 getNSWShl(Constant *C1, Constant *C2) argument 1005 getNUWShl(Constant *C1, Constant *C2) argument 1009 getExactSDiv(Constant *C1, Constant *C2) argument 1013 getExactUDiv(Constant *C1, Constant *C2) argument 1017 getExactAShr(Constant *C1, Constant *C2) argument 1021 getExactLShr(Constant *C1, Constant *C2) argument [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/IR/ |
H A D | ConstantFold.cpp | 999 Constant *llvm::ConstantFoldBinaryInstruction(unsigned Opcode, Constant *C1, argument 1008 Constant *Identity = ConstantExpr::getBinOpIdentity(Opcode, C1->getType()); 1010 if (C1 == Identity) 1013 return C1; 1017 bool HasScalarUndef = !C1->getType()->isVectorTy() && 1018 (isa<UndefValue>(C1) || isa<UndefValue>(C2)); 1022 if (isa<UndefValue>(C1) && isa<UndefValue>(C2)) 1025 return Constant::getNullValue(C1->getType()); 1029 return UndefValue::get(C1->getType()); 1031 if (isa<UndefValue>(C1) 1427 IdxCompare(Constant *C1, Constant *C2, Type *ElTy) argument 1810 ConstantFoldCompareInstruction(unsigned short pred, Constant *C1, Constant *C2) argument 2300 Constant *C1 = ConstantExpr::getSExtOrBitCast(Idx0, CommonTy); local [all...] |
H A D | ConstantFold.h | 50 Constant *C1, Constant *C2);
|
H A D | ConstantsContext.h | 64 BinaryConstantExpr(unsigned Opcode, Constant *C1, Constant *C2, argument 66 : ConstantExpr(C1->getType(), Opcode, &Op<0>(), 2) { 67 Op<0>() = C1; 85 SelectConstantExpr(Constant *C1, Constant *C2, Constant *C3) argument 87 Op<0>() = C1; 106 ExtractElementConstantExpr(Constant *C1, Constant *C2) argument 107 : ConstantExpr(cast<VectorType>(C1->getType())->getElementType(), 109 Op<0>() = C1; 127 InsertElementConstantExpr(Constant *C1, Constant *C2, Constant *C3) argument 128 : ConstantExpr(C1 149 ShuffleVectorConstantExpr(Constant *C1, Constant *C2, Constant *C3) argument [all...] |
H A D | Constants.cpp | 1936 Constant *ConstantExpr::get(unsigned Opcode, Constant *C1, Constant *C2, argument 1941 assert(C1->getType() == C2->getType() && 1953 assert(C1->getType()->isIntOrIntVectorTy() && 1961 assert(C1->getType()->isFPOrFPVectorTy() && 1968 assert(C1->getType()->isIntOrIntVectorTy() && 1974 assert(C1->getType()->isIntOrIntVectorTy() && 1982 if (Constant *FC = ConstantFoldBinaryInstruction(Opcode, C1, C2)) 1985 if (OnlyIfReducedTy == C1->getType()) 1988 Constant *ArgVec[] = { C1, C2 }; 1991 LLVMContextImpl *pImpl = C1 2036 getCompare(unsigned short Predicate, Constant *C1, Constant *C2, bool OnlyIfReduced) argument 2318 getAdd(Constant *C1, Constant *C2, bool HasNUW, bool HasNSW) argument 2325 getFAdd(Constant *C1, Constant *C2) argument 2329 getSub(Constant *C1, Constant *C2, bool HasNUW, bool HasNSW) argument 2336 getFSub(Constant *C1, Constant *C2) argument 2340 getMul(Constant *C1, Constant *C2, bool HasNUW, bool HasNSW) argument 2347 getFMul(Constant *C1, Constant *C2) argument 2351 getUDiv(Constant *C1, Constant *C2, bool isExact) argument 2356 getSDiv(Constant *C1, Constant *C2, bool isExact) argument 2361 getFDiv(Constant *C1, Constant *C2) argument 2365 getURem(Constant *C1, Constant *C2) argument 2369 getSRem(Constant *C1, Constant *C2) argument 2373 getFRem(Constant *C1, Constant *C2) argument 2377 getAnd(Constant *C1, Constant *C2) argument 2381 getOr(Constant *C1, Constant *C2) argument 2385 getXor(Constant *C1, Constant *C2) argument 2389 getShl(Constant *C1, Constant *C2, bool HasNUW, bool HasNSW) argument 2396 getLShr(Constant *C1, Constant *C2, bool isExact) argument 2401 getAShr(Constant *C1, Constant *C2, bool isExact) argument [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/ |
H A D | Utils.cpp | 345 APInt C1(Ty.getSizeInBits(), *MaybeOp1Cst, true); 351 return C1 + C2; 353 return C1 & C2; 355 return C1.ashr(C2); 357 return C1.lshr(C2); 359 return C1 * C2; 361 return C1 | C2; 363 return C1 << C2; 365 return C1 - C2; 367 return C1 [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/InstCombine/ |
H A D | InstCombineMulDivRem.cpp | 197 Constant *C1, *C2; local 200 m_Constant(C1))) && 201 match(C1, m_APInt(IVal))) { 202 // ((X << C2)*C1) == (X * (C1 << C2)) 203 Constant *Shl = ConstantExpr::getShl(C1, C2); 214 if (match(&I, m_Mul(m_Value(NewOp), m_Constant(C1)))) { 216 if (Constant *NewCst = getLogBase2(NewOp->getType(), C1)) { 242 ConstantInt *C1; local 246 else if (match(Op0, m_Add(m_Value(Y), m_ConstantInt(C1)))) 267 Constant *C1; local 438 Constant *C1; local 647 multiplyOverflows(const APInt &C1, const APInt &C2, APInt &Product, bool IsSigned) argument 655 isMultiple(const APInt &C1, const APInt &C2, APInt &Quotient, bool IsSigned) argument 699 const APInt *C1; local 848 Constant *C1 = getLogBase2(Op0->getType(), cast<Constant>(Op1)); local 968 const APInt *C1, *C2; local [all...] |
H A D | InstCombineAddSub.cpp | 355 ConstantFP *C0, *C1; local 361 if ((C1 = dyn_cast<ConstantFP>(Opnd1)) && C1->isZero()) 373 if (!C1) 376 Addend.set(C1, nullptr); 779 const APInt *C1 = nullptr, *C2 = nullptr; local 787 if (match(RHS, m_Xor(m_Value(Y), m_APInt(C1)))) 790 if (match(X, m_Xor(m_Value(Y), m_APInt(C1)))) { 791 // X = XOR(Y, C1), Y = OR(Z, C2), C2 = NOT(C1) 837 const APInt *C1, *C2; local 1016 MulWillOverflow(APInt &C0, APInt &C1, bool IsSigned) argument 1037 APInt C1; local [all...] |
/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/scudo/standalone/ |
H A D | internal_defs.h | 84 #define CHECK_IMPL(C1, Op, C2) \ 86 scudo::u64 V1 = (scudo::u64)(C1); \ 90 "(" #C1 ") " #Op " (" #C2 ")", V1, V2); \
|
/freebsd-11-stable/contrib/llvm-project/clang/lib/AST/ |
H A D | RawCommentList.cpp | 73 unsigned C1 = SM.getPresumedColumnNumber(L1, &Invalid); local 76 return !Invalid && (C1 == C2); 296 const RawComment &C1 = *OrderedComments[CommentFile].rbegin()->second; local 312 if ((C1.isTrailingComment() == C2.isTrailingComment() || 313 (C1.isTrailingComment() && !C2.isTrailingComment() && 315 commentsStartOnSameColumn(SourceMgr, C1, C2))) && 316 onlyWhitespaceBetween(SourceMgr, C1.getEndLoc(), C2.getBeginLoc(), 318 SourceRange MergedRange(C1.getBeginLoc(), C2.getEndLoc());
|
/freebsd-11-stable/contrib/llvm-project/llvm/tools/llvm-xray/ |
H A D | xray-color-helper.cpp | 172 const std::tuple<double, double, double> &C1, double T) { 173 double H = interpolateHue(std::get<0>(C0), std::get<0>(C1), T); 174 double S = std::get<1>(C0) + T * (std::get<1>(C1) - std::get<1>(C0)); 175 double V = std::get<2>(C0) + T * (std::get<2>(C1) - std::get<2>(C0)); 171 interpolateHSV(const std::tuple<double, double, double> &C0, const std::tuple<double, double, double> &C1, double T) argument
|
/freebsd-11-stable/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-11-stable/crypto/openssl/crypto/whrlpool/ |
H A D | wp_block.c | 158 # define C1(K,i) ROTATE(Cx.q[K.c[(i)*8+1]],8) macro 176 # define C1(K,i) (Cx.q[1+8*K.c[(i)*8+1]]) macro 189 # define C1(K,i) (((u64*)(Cx.c+7))[2*K.c[(i)*8+1]]) macro 496 L[i] ^= C0(K, i) ^ C1(K, (i - 1) & 7) ^ 503 L[i] ^= C0(S, i) ^ C1(S, (i - 1) & 7) ^ 542 L0 = C0(K, 0) ^ C1(K, 7) ^ C2(K, 6) ^ C3(K, 5) ^ 544 L1 = C0(K, 1) ^ C1(K, 0) ^ C2(K, 7) ^ C3(K, 6) ^ 546 L2 = C0(K, 2) ^ C1(K, 1) ^ C2(K, 0) ^ C3(K, 7) ^ 548 L3 = C0(K, 3) ^ C1(K, 2) ^ C2(K, 1) ^ C3(K, 0) ^ 550 L4 = C0(K, 4) ^ C1( [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | ConstantFolding.cpp | 753 // (&GV+C1) - (&GV+C2) -> C1-C2, pointer arithmetic cannot overflow. 1251 Constant *C1 = ConstantExpr::getIntegerCast(CE1->getOperand(0), local 1253 return ConstantFoldCompareInstOperands(Predicate, C0, C1, DL, TLI); 2054 const APFloat &C1 = Op1->getValueAPF(); local 2056 return ConstantFP::get(Ty->getContext(), minnum(C1, C2)); 2060 const APFloat &C1 = Op1->getValueAPF(); local 2062 return ConstantFP::get(Ty->getContext(), maxnum(C1, C2)); 2066 const APFloat &C1 = Op1->getValueAPF(); local 2068 return ConstantFP::get(Ty->getContext(), minimum(C1, C 2072 const APFloat &C1 = Op1->getValueAPF(); local 2127 const APInt *C0, *C1; local 2341 const APInt *C0, *C1, *C2; local [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/PBQP/ |
H A D | CostAllocator.h | 70 static bool isEqual(const ValueKeyT1 &C1, const ValueKeyT2 &C2) { argument 71 return C1 == C2;
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
H A D | HexagonVectorLoopCarriedReuse.cpp | 410 if (CallInst *C1 = dyn_cast<CallInst>(I1)) { 412 if (C1->getCalledFunction() != C2->getCalledFunction()) 422 ConstantInt *C1 = dyn_cast<ConstantInt>(I1->getOperand(i)); local 424 if(!C1) continue; 426 if (C1->getSExtValue() != C2->getSExtValue()) 519 CallInst *C1 = dyn_cast<CallInst>(I); local 520 if ((I && I->isCommutative()) || (C1 && isCallInstCommutative(C1))) {
|