Searched refs:C0 (Results 1 - 25 of 41) sorted by relevance

12

/freebsd-13-stable/sys/contrib/libsodium/src/libsodium/crypto_pwhash/argon2/
H A Dblamka-round-avx2.h12 #define G1_AVX2(A0, A1, B0, B1, C0, C1, D0, D1) \
20 ml = _mm256_mul_epu32(C0, D0); \
22 C0 = _mm256_add_epi64(C0, _mm256_add_epi64(D0, ml)); \
24 B0 = _mm256_xor_si256(B0, C0); \
41 #define G2_AVX2(A0, A1, B0, B1, C0, C1, D0, D1) \
49 ml = _mm256_mul_epu32(C0, D0); \
51 C0 = _mm256_add_epi64(C0, _mm256_add_epi64(D0, ml)); \
52 B0 = _mm256_xor_si256(B0, C0); \
[all...]
H A Dblamka-round-ssse3.h31 #define G1(A0, B0, C0, D0, A1, B1, C1, D1) \
42 C0 = fBlaMka(C0, D0); \
45 B0 = _mm_xor_si128(B0, C0); \
52 #define G2(A0, B0, C0, D0, A1, B1, C1, D1) \
63 C0 = fBlaMka(C0, D0); \
66 B0 = _mm_xor_si128(B0, C0); \
73 #define DIAGONALIZE(A0, B0, C0, D0, A1, B1, C1, D1) \
80 t0 = C0; \
[all...]
H A Dblamka-round-avx512f.h17 #define G1_AVX512F(A0, B0, C0, D0, A1, B1, C1, D1) \
28 C0 = muladd(C0, D0); \
31 B0 = _mm512_xor_si512(B0, C0); \
38 #define G2_AVX512F(A0, B0, C0, D0, A1, B1, C1, D1) \
49 C0 = muladd(C0, D0); \
52 B0 = _mm512_xor_si512(B0, C0); \
59 #define DIAGONALIZE(A0, B0, C0, D0, A1, B1, C1, D1) \
64 C0
[all...]
/freebsd-13-stable/lib/msun/src/
H A Dk_cosf.c28 C0 = -0x1ffffffd0c5e81.0p-54, /* -0.499999997251031003120 */ variable
45 return ((one+z*C0) + w*C1) + (w*z)*r;
H A Dk_sincosf.h26 C0 = -0x1ffffffd0c5e81.0p-54, /* -0.499999997251031003120 */ variable
42 *cs = ((1 + z * C0) + w * C1) + (w * z) * r;
/freebsd-13-stable/crypto/openssl/crypto/modes/asm/
H A Dghash-sparcv9.pl359 ($Hhl,$Hlo,$Hhi,$Xlo,$Xhi,$xE1,$sqr, $C0,$C1,$C2,$C3,$V)=
376 srax $Hhi,63,$C0 ! broadcast carry
379 and $C0,$Xlo,$Xlo
380 and $C0,$Xhi,$Xhi
414 xmulx $Xlo,$Hlo,$C0
422 sll $C0,3,$sqr
424 xor $C0,$sqr,$sqr
425 sllx $sqr,57,$sqr ! ($C0��0xE1)<<1<<56 [implicit &0x7f]
427 xor $C0,$C1,$C1 ! Karatsuba post-processing
435 xmulxhi $C0,
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/tools/llvm-xray/
H A Dxray-color-helper.cpp171 interpolateHSV(const std::tuple<double, double, double> &C0, argument
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));
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Frontend/OpenMP/
H A DOMPContext.cpp90 /// Return true if \p C0 is a subset of \p C1. Note that both arrays are
92 template <typename T> static bool isSubset(ArrayRef<T> C0, ArrayRef<T> C1) { argument
94 assert(llvm::is_sorted(C0) && llvm::is_sorted(C1) &&
97 if (C0.size() > C1.size())
99 auto It0 = C0.begin(), End0 = C0.end();
114 /// Return true if \p C0 is a strict subset of \p C1. Note that both arrays are
117 static bool isStrictSubset(ArrayRef<T> C0, ArrayRef<T> C1) { argument
118 if (C0.size() >= C1.size())
120 return isSubset<T>(C0, C
[all...]
/freebsd-13-stable/crypto/openssl/crypto/whrlpool/
H A Dwp_block.c176 # define C0(K,i) (Cx.q[K.c[(i)*8+0]]) macro
194 # define C0(K,i) (Cx.q[0+8*K.c[(i)*8+0]]) macro
207 # define C0(K,i) (((u64*)(Cx.c+0))[2*K.c[(i)*8+0]]) macro
515 L[i] ^= C0(K, i) ^ C1(K, (i - 1) & 7) ^
522 L[i] ^= C0(S, i) ^ C1(S, (i - 1) & 7) ^
561 L0 = C0(K, 0) ^ C1(K, 7) ^ C2(K, 6) ^ C3(K, 5) ^
563 L1 = C0(K, 1) ^ C1(K, 0) ^ C2(K, 7) ^ C3(K, 6) ^
565 L2 = C0(K, 2) ^ C1(K, 1) ^ C2(K, 0) ^ C3(K, 7) ^
567 L3 = C0(K, 3) ^ C1(K, 2) ^ C2(K, 1) ^ C3(K, 0) ^
569 L4 = C0(
[all...]
/freebsd-13-stable/crypto/openssl/crypto/chacha/asm/
H A Dchacha-armv8.pl344 my ($A0,$B0,$C0,$D0,$A1,$B1,$C1,$D1,$A2,$B2,$C2,$D2,$T0,$T1,$T2,$T3) =
444 mov $C0,@K[2]
456 my @thread0=&NEONROUND($A0,$B0,$C0,$D0,$T0,0);
467 @thread0=&NEONROUND($A0,$B0,$C0,$D0,$T0,1);
487 add $C0,$C0,@K[2]
544 eor $C0,$C0,$T2
570 eor $C2,$C2,$C0
637 eor $C0,
[all...]
H A Dchacha-ppc.pl410 my ($A0,$B0,$C0,$D0,$A1,$B1,$C1,$D1,$A2,$B2,$C2,$D2)
569 vmr $C0,@K[2]
597 my @thread0=&VMXROUND($A0,$B0,$C0,$D0,0);
613 @thread0=&VMXROUND($A0,$B0,$C0,$D0,1);
663 vadduwm $C0,$C0,@K[2]
754 vxor $C0,$C0,@D[2]
763 vperm $C0,$C0,
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DInterleavedLoadCombinePass.cpp1056 for (auto C0 = Candidates.begin(), E0 = Candidates.end(); C0 != E0; ++C0) {
1059 unsigned Size = DL.getTypeAllocSize(C0->VTy->getElementType());
1065 if (C->VTy != C0->VTy)
1067 if (C->BB != C0->BB)
1069 if (C->PV != C0->PV)
1074 if (C->EI[0].Ofs.isProvenEqualTo(C0->EI[0].Ofs + i * Size)) {
1084 Res[0] = C0;
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DConstantFolding.cpp1268 Constant *C0 = ConstantExpr::getIntegerCast(CE0->getOperand(0), local
1272 return ConstantFoldCompareInstOperands(Predicate, C0, C1, DL, TLI);
2376 const APInt *C0, *C1; local
2377 if (!getConstIntOrUndef(Operands[0], C0) ||
2391 if (!C0 || !C1) {
2402 if (!C0 || !C1)
2410 Res = C0->sadd_ov(*C1, Overflow);
2413 Res = C0->uadd_ov(*C1, Overflow);
2416 Res = C0->ssub_ov(*C1, Overflow);
2419 Res = C0
2654 const APInt *C0, *C1, *C2; local
[all...]
H A DInstructionSimplify.cpp1579 // Look for this pattern: {and/or} (icmp X, C0), (icmp X, C1)).
1583 const APInt *C0, *C1; local
1584 if (!match(Cmp0->getOperand(1), m_APInt(C0)) ||
1588 auto Range0 = ConstantRange::makeExactICmpRegion(Cmp0->getPredicate(), *C0);
1592 // (icmp X, C0) && (icmp X, C1) --> empty set --> false
1597 // (icmp X, C0) || (icmp X, C1) --> full set --> true
1653 // (icmp (add V, C0), C1) & (icmp V, C0)
1655 const APInt *C0, *C1; local
1657 if (!match(Op0, m_ICmp(Pred0, m_Add(m_Value(V), m_APInt(C0)), m_APIn
1789 const APInt *C0, *C1; local
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/InstCombine/
H A DInstCombineAddSub.cpp355 ConstantFP *C0, *C1; local
358 if ((C0 = dyn_cast<ConstantFP>(Opnd0)) && C0->isZero())
365 if (!C0)
368 Addend0.set(C0, nullptr);
385 Addend0.set(APFloat(C0->getValueAPF().getSemantics()), nullptr);
1012 // Returns whether C0 * C1 with the given signedness overflows.
1013 static bool MulWillOverflow(APInt &C0, APInt &C1, bool IsSigned) { argument
1016 (void)C0.smul_ov(C1, overflow);
1018 (void)C0
1027 APInt C0, MulOpC; local
[all...]
H A DInstCombineShifts.cpp330 const APInt *C0, *C1; local
343 match(V, m_OneUse(m_Shift(m_Value(X), m_APInt(C0)))) &&
345 (*C0 + *C1).ult(Ty->getScalarSizeInBits());
356 // shift (logic (shift X, C0), Y), C1 -> logic (shift X, C0+C1), (shift Y, C1)
357 Constant *ShiftSumC = ConstantInt::get(Ty, *C0 + *C1);
1207 // Said right-shift must extract high NBits bits - C0 must be it's bitwidth.
1208 Constant *C0;
1211 m_Sub(m_Constant(C0), m_ZExtOrSelf(m_Specific(NBits))))) ||
1212 !BitWidthSplat(C0, HighBitExtrac
[all...]
H A DInstCombineSelect.cpp1225 // %old_cmp0 = icmp ult i32 %old_x_offseted, C0
1229 // %new_cmp2 = icmp sge i32 %x, C0-C1
1232 // Iff -C1 s<= C2 s<= C0-C1
1233 // Also ULT predicate can also be UGT iff C0 != -1 (+invert result)
1245 Constant *C0; local
1247 m_CombineAnd(m_AnyIntegralConstant(), m_Constant(C0))))
1255 // We'd have to increment C0 by one, and for that it must not have all-ones
1260 // We want to canonicalize it to 'ult', so we'll need to increment C0,
1262 if (!match(C0,
1265 C0
1377 Constant *C0; local
[all...]
H A DInstCombineCalls.cpp806 Constant *C0 = dyn_cast<Constant>(Op0); local
808 C0 ? dyn_cast_or_null<ConstantInt>(C0->getAggregateElement((unsigned)0))
939 Constant *C0 = dyn_cast<Constant>(Op0); local
942 C0 ? dyn_cast_or_null<ConstantInt>(C0->getAggregateElement((unsigned)0))
2101 // uaddo (X +nuw C0), C1 -> uaddo X, C0 + C1
2102 // saddo (X +nsw C0), C1 -> saddo X, C0
2104 const APInt *C0, *C1; local
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVectorCombine.cpp195 // opcode (extelt V0, C0), (extelt V1, C1) --> extelt (opcode V0, V1), C
316 uint64_t C0, C1; local
317 if (!match(I0, m_ExtractElt(m_Value(V0), m_ConstantInt(C0))) ||
340 unsigned CheapExtractIdx = ExtractToChange == Ext0 ? C1 : C0;
530 // binop i1 (cmp Pred I0, C0), (cmp Pred I1, C1)
539 Constant *C0, *C1; local
541 if (!match(B0, m_OneUse(m_Cmp(P0, m_Instruction(I0), m_Constant(C0)))) ||
562 // binop i1 (cmp Pred (ext X, Index0), C0), (cmp Pred (ext X, Index1), C1)
596 CmpC[Index0] = C0;
H A DLoadStoreVectorizer.cpp585 Instruction *C0 = Chain[0]; local
586 BasicBlock::iterator FirstInstr = C0->getIterator();
587 BasicBlock::iterator LastInstr = C0->getIterator();
589 BasicBlock *BB = C0->getParent();
/freebsd-13-stable/libexec/getty/
H A Dgettytab.h114 #define C0 gettynums[13].value macro
H A Dsubr.c243 tmode.c_cflag = C0;
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DInferAddressSpaces.cpp834 auto *C0 = dyn_cast<Constant>(Src0); local
841 (C0 && Src1AS == UninitializedAddressSpace))
844 if (C0 && isSafeToCastConstAddrSpace(C0, Src1AS))
/freebsd-13-stable/contrib/llvm-project/llvm/utils/TableGen/
H A DX86RecognizableInstr.h27 MAP(C0, 64) \
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/SystemZ/MCTargetDesc/
H A DSystemZMCTargetDesc.cpp121 SystemZ::C0, SystemZ::C1, SystemZ::C2, SystemZ::C3,

Completed in 128 milliseconds

12