| /freebsd/crypto/openssl/crypto/sm3/ |
| H A D | sm3_local.h | 84 #define FF0(X,Y,Z) (X ^ Y ^ Z) argument 85 #define GG0(X,Y,Z) (X ^ Y ^ Z) argument 87 #define FF1(X,Y,Z) ((X & Y) | ((X | Y) & Z)) argument 88 #define GG1(X,Y,Z) ((Z ^ (X & (Y ^ Z)))) argument 93 #define RND(A, B, C, D, E, F, G, H, TJ, Wi, Wj, FF, GG) \ argument 106 #define R1(A,B,C,D,E,F,G,H,TJ,Wi,Wj) \ argument 109 #define R2(A,B,C,D,E,F,G,H,TJ,Wi,Wj) \ argument
|
| /freebsd/crypto/openssl/crypto/cast/ |
| H A D | c_skey.c | 20 #define CAST_exp(l,A,a,n) \ argument 37 CAST_LONG X[4], Z[4]; in CAST_set_key() local
|
| /freebsd/crypto/libecc/src/hash/ |
| H A D | sm3.c | 62 #define FF_j_low(X, Y, Z) (((u32)(X)) ^ ((u32)(Y)) ^ ((u32)(Z))) argument 63 #define GG_j_low(X, Y, Z) (((u32)(X)) ^ ((u32)(Y)) ^ ((u32)(Z))) argument 66 #define FF_j_high(X, Y, Z) ((((u32)(X)) & ((u32)(Y))) | \ argument 69 #define GG_j_high(X, Y, Z) ((((u32)(X)) & ((u32)(Y))) | \ argument 87 u32 A, B, C, D, E, F, G, H; in sm3_process() local
|
| /freebsd/crypto/libecc/src/sig/ |
| H A D | sm2.c | 136 ATTRIBUTE_WARN_UNUSED_RET static int sm2_compute_Z(u8 *Z, u16 *Zlen, const u8 *id, u16 id_len, in sm2_compute_Z() 244 #define SM2_SIGN_CHECK_INITIALIZED(A, ret, err) \ argument 250 u8 Z[Z_INPUT_MAX_LEN]; in _sm2_sign_init() local 515 #define SM2_VERIFY_CHECK_INITIALIZED(A, ret, err) \ argument 526 u8 Z[Z_INPUT_MAX_LEN]; in _sm2_verify_init() local
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Support/ |
| H A D | MathExtras.h | 366 constexpr T MinAlign(U A, V B) { in MinAlign() 376 constexpr uint64_t MinAlign(uint64_t A, uint64_t B) { in MinAlign() 382 constexpr uint64_t NextPowerOf2(uint64_t A) { in NextPowerOf2() 394 inline uint64_t PowerOf2Ceil(uint64_t A) { in PowerOf2Ceil() 605 T Z = X + Y; variable 616 std::enable_if_t<std::is_unsigned_v<T>, T> SaturatingAdd(T X, T Y, T Z, in SaturatingAdd() 658 T Z = (X >> 1) * Y; variable
|
| H A D | JSON.h | 554 template <typename... Args> inline void Array::emplace_back(Args &&...A) { in emplace_back() 565 inline typename Array::iterator Array::insert(const_iterator P, It A, It Z) { in insert() 569 inline typename Array::iterator Array::emplace(const_iterator P, Args &&...A) { in emplace() 801 if (auto *A = E.getAsArray()) { in fromJSON() local
|
| /freebsd/contrib/bearssl/src/hash/ |
| H A D | sha2big.c | 27 #define CH(X, Y, Z) ((((Y) ^ (Z)) & (X)) ^ (Z)) argument 28 #define MAJ(X, Y, Z) (((Y) & (Z)) | (((Y) | (Z)) & (X))) argument 98 #define SHA2BIG_STEP(A, B, C, D, E, F, G, H, j) do { \ in sha2big_round() argument
|
| H A D | sha2small.c | 27 #define CH(X, Y, Z) ((((Y) ^ (Z)) & (X)) ^ (Z)) argument 28 #define MAJ(X, Y, Z) (((Y) & (Z)) | (((Y) | (Z)) & (X))) argument 73 #define SHA2_STEP(A, B, C, D, E, F, G, H, j) do { \ in br_sha2small_round() argument
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/InstCombine/ |
| H A D | InstCombineAddSub.cpp | 761 Value *X = nullptr, *Y = nullptr, *Z = nullptr; in checkForNegativeOperand() local 1019 static bool matchesSquareSum(BinaryOperator &I, Mul2Rhs M2Rhs, Value *&A, in matchesSquareSum() 1053 Value *A, *B; in foldSquareSumInt() local 1065 Value *A, *B; in foldSquareSumFP() local 1258 Value *A, *B, *Cnt; in combineAddSubWithShlAddSub() local 1536 Value *A, *B; in visitAdd() local 1828 Value *X, *Y, *Z; in factorizeLerp() local 1856 Value *X, *Y, *Z; in factorizeFAddFSub() local 1912 Value *Z; in visitFAdd() local 2088 Value *Z; in foldSubOfMinMax() local [all …]
|
| H A D | InstCombineMulDivRem.cpp | 57 Value *A = nullptr, *B = nullptr, *One = nullptr; in simplifyValueKnownNonZero() local 155 Value *Z; in foldMulShl1() local 290 Value *Z = Builder.CreateZExt(N, Ty, N->getName() + ".z"); in visitMul() local 606 Value *Y, Value *Z) { in foldPowiReassoc() 615 Value *X, *Y, *Z; in foldPowiReassoc() local 735 Value *Z; in foldFMulReassoc() local 1090 Value *X, *Y, *Z; in foldIDivShl() local 1301 Value *X, *Z; in commonIDivTransforms() local 1365 auto CreateDivOrNull = [&](Value *A, Value *B) -> Instruction * { in commonIDivTransforms() 1559 Value *A, *B; in visitUDiv() local [all …]
|
| H A D | InstCombineAndOrXor.cpp | 118 static unsigned getMaskedICmpType(Value *A, Value *B, Value *C, in getMaskedICmpType() 183 Value *&X, Value *&Y, Value *&Z) { in decomposeBitTestICmp() 199 Value *&A, Value *&B, Value *&C, Value *&D, Value *&E, ICmpInst *LHS, in getMaskedTypeForICmpPair() 329 ICmpInst *LHS, ICmpInst *RHS, bool IsAnd, Value *A, Value *B, Value *C, in foldLogOpOfMaskedICmps_NotAllZeros_BMask_Mixed() 451 ICmpInst *LHS, ICmpInst *RHS, bool IsAnd, Value *A, Value *B, Value *C, in foldLogOpOfMaskedICmpsAsymmetric() 486 Value *A = nullptr, *B = nullptr, *C = nullptr, *D = nullptr, *E = nullptr; in foldLogOpOfMaskedICmps() local 973 Value *A, Value *B, Value *D, Value *E, ICmpInst::Predicate PredL, in foldNegativePower2AndShiftedMask() 1043 Value *A = nullptr, *B = nullptr, *C = nullptr, *D = nullptr, *E = nullptr; in foldPowerOf2AndShiftedMask() local 1083 Value *A, *B; in foldUnsignedUnderflowCheck() local 1666 Value *A, *B; in matchDeMorgansLaws() local [all …]
|
| H A D | InstCombineCompares.cpp | 526 if (auto *A = dyn_cast<Argument>(V)) { in setInsertionPoint() local 962 Instruction *InstCombinerImpl::foldICmpShrConstConst(ICmpInst &I, Value *A, in foldICmpShrConstConst() 1021 Instruction *InstCombinerImpl::foldICmpShlConstConst(ICmpInst &I, Value *A, in foldICmpShlConstConst() 1065 static Instruction *processUGT_ADDCST_ADD(ICmpInst &I, Value *A, Value *B, in processUGT_ADDCST_ADD() 1209 Value *A, *B; in foldICmpWithZero() local 1298 Value *A, *B; in foldICmpWithConstant() local 1823 Value *A, *B, *LShr; in foldICmpAndConstConst() local 1937 Value *A, *B; in foldICmpAndConstant() local 4771 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1), *A; in foldICmpAndXX() local 4833 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1), *A; in foldICmpOrXX() local [all …]
|
| H A D | InstructionCombining.cpp | 446 Value *A = Op0->getOperand(0); in SimplifyAssociativeOrCommutative() local 479 Value *A = I.getOperand(0); in SimplifyAssociativeOrCommutative() local 507 Value *A = Op0->getOperand(0); in SimplifyAssociativeOrCommutative() local 527 Value *A = I.getOperand(0); in SimplifyAssociativeOrCommutative() local 547 Value *A, *B; in SimplifyAssociativeOrCommutative() local 668 Instruction::BinaryOps InnerOpcode, Value *A, in tryFactorization() 1028 Value *A, *CondVal, *TrueVal, *FalseVal; in foldBinOpOfSelectAndCastOfSelectCondition() local 1087 Value *A, *B, *C, *D; in tryFactorizationFolds() local 1139 Value *A = Op0->getOperand(0), *B = Op0->getOperand(1), *C = RHS; in foldUsingDistributiveLaws() local 1178 Value *A = LHS, *B = Op1->getOperand(0), *C = Op1->getOperand(1); in foldUsingDistributiveLaws() local [all …]
|
| /freebsd/contrib/llvm-project/clang/lib/Headers/ |
| H A D | smmintrin.h | 875 #define _MM_MK_INSERTPS_NDX(X, Y, Z) (((X) << 6) | ((Y) << 4) | (Z)) argument 1604 #define _mm_cmpistrm(A, B, M) \ argument 1658 #define _mm_cmpistri(A, B, M) \ argument 1718 #define _mm_cmpestrm(A, LA, B, LB, M) \ argument 1777 #define _mm_cmpestri(A, LA, B, LB, M) \ argument 1829 #define _mm_cmpistra(A, B, M) \ argument 1878 #define _mm_cmpistrc(A, B, M) \ argument 1926 #define _mm_cmpistro(A, B, M) \ argument 1976 #define _mm_cmpistrs(A, B, M) \ argument 2026 #define _mm_cmpistrz(A, B, M) \ argument [all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
| H A D | HexagonBlockRanges.cpp | 58 void HexagonBlockRanges::IndexRange::merge(const IndexRange &A) { in merge() 105 void HexagonBlockRanges::RangeList::addsub(const IndexRange &A, in addsub() 440 RangeList::iterator A = RL.begin(), Z = RL.end()-1; in computeDeadMap() local
|
| H A D | BitTracker.cpp | 423 const APInt &A = CI->getValue(); in eIMM() local 501 uint16_t Z = A1.ct(false) + A2.ct(false); in eMLS() local 511 uint16_t Z = A1.ct(false) + A2.ct(false); in eMLU() local
|
| H A D | HexagonISelLowering.cpp | 772 unsigned A = AlignConst->getSExtValue(); in LowerDYNAMIC_STACKALLOC() local 1276 SDValue A = DAG.getTargetBlockAddress(BA, PtrVT); in LowerBlockAddress() local 1280 SDValue A in LowerBlockAddress() local 2444 __anon6183b17d0502(unsigned Opc, SDValue V, SDValue A) LowerVECTOR_SHIFT() argument 2510 APInt A = CF->getValueAPF().bitcastToAPInt(); getBuildVectorConstInts() local 2875 SDValue A = DAG.getBitcast(MVT::v8i8, Vec64); contractPredicate() local 2979 SDValue Z = getZero(dl, MVT::i32, DAG); LowerBUILD_VECTOR() local 2986 for (ArrayRef<SDValue> A(Rs); A.size() != 1; A = A.drop_back(A.size()/2)) { LowerBUILD_VECTOR() local 3550 SDValue Z = Zxt.getOperand(0); PerformDAGCombine() local 3553 unsigned A = Amt->getZExtValue(); PerformDAGCombine() local 3680 Align A = DL.getABITypeAlign(Ty); isLegalAddressingMode() local [all...] |
| H A D | HexagonLoopIdiomRecognition.cpp | 699 Value *A = nullptr, *B = nullptr, *C = nullptr; in matchLeftShift() local 746 Value *Q = nullptr, *R = nullptr, *Y = nullptr, *Z = nullptr; in matchLeftShift() local 1040 } else if (ZExtInst *Z = dyn_cast<ZExtInst>(In)) { in promoteTo() local 1645 Value *Z = BO->getOperand(1); in setupPreSimplifier() local 1653 Value *Y = Sel->getTrueValue(), *Z = Sel->getFalseValue(); in setupPreSimplifier() local
|
| /freebsd/contrib/llvm-project/clang/lib/Sema/ |
| H A D | SemaHLSL.cpp | 135 int X, int Y, int Z) { in mergeNumThreadsAttr() 287 const Attr *A, llvm::Triple::EnvironmentType Stage, in DiagnoseAttrStageMismatch() 331 uint32_t Z; in handleNumThreadsAttr() local 796 for (const auto *A : D->attrs()) { in FindAvailabilityAttr() local 900 ExprResult A = TheCall->getArg(0); in CheckVectorElementCallArgs() local
|
| /freebsd/contrib/llvm-project/lldb/source/Plugins/Instruction/ARM64/ |
| H A D | EmulateInstructionARM64.h | 135 Z : 1, // condition code flags – can also be accessed as member 143 D : 1, A : 1, I : 1, member
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/VE/ |
| H A D | VVPISelLowering.cpp | 26 SDValue A = Op->getOperand(0); in splitMaskArithmetic() local 104 auto Z = Op->getOperand(1); in lowerToVVP() local
|
| /freebsd/crypto/krb5/src/plugins/preauth/spake/ |
| H A D | edwards25519.c | 162 fe Z; member 168 fe Z; member 175 fe_loose Z; member 188 fe_loose Z; member 983 const ge_p3 *A) { in x25519_ge_scalarmult()
|
| /freebsd/crypto/openssl/crypto/ec/ |
| H A D | curve25519.c | 1801 fe Z; member 1807 fe Z; member 1814 fe Z; member 1827 fe Z; member 4539 const ge_p3 *A, const uint8_t *b) in ge_double_scalarmult_vartime() 5549 ge_p3 A; in ossl_ed25519_pubkey_verify() local 5566 ge_p3 A; in ossl_ed25519_verify() local 5670 ge_p3 A; in ossl_ed25519_public_from_private() local 5710 ge_p3 A; in ossl_x25519_public_from_private() local
|
| /freebsd/crypto/libecc/src/curves/ |
| H A D | prj_pt.c | 154 fp X, Y, Z; in prj_pt_is_on_curve() local 742 fp Y1Z2, X1Z2, Z1Z2, u, uu, v, vv, vvv, R, A; in ___prj_pt_add_monty_no_cf() local 1888 prj_pt A; in _prj_pt_unprotected_mult() local
|
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | VectorUtils.cpp | 298 Value *X, *Y, *Z; in isSplatValue() local 1260 Instruction *A = AI->first; in analyzeInterleaving() local 1283 StrideEntry *A) -> Instruction * { in analyzeInterleaving()
|