Home
last modified time | relevance | path

Searched +defs:A +defs:Q (Results 1 – 25 of 57) sorted by relevance

123

/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DInstructionSimplify.cpp154 const SimplifyQuery &Q, unsigned MaxRecurse, in simplifyCmpSelCase()
171 const SimplifyQuery &Q, in simplifyCmpSelTrueCase()
180 const SimplifyQuery &Q, in simplifyCmpSelFalseCase()
190 const SimplifyQuery &Q, in handleOtherCmpSelSimplifications()
240 const SimplifyQuery &Q, unsigned MaxRecurse) { in expandBinOp()
275 const SimplifyQuery &Q, in expandCommutativeBinOp()
292 const SimplifyQuery &Q, in simplifyAssociativeBinOp()
305 Value *A = Op0->getOperand(0); in simplifyAssociativeBinOp() local
325 Value *A = LHS; in simplifyAssociativeBinOp() local
349 Value *A = Op0->getOperand(0); in simplifyAssociativeBinOp() local
[all …]
H A DValueTracking.cpp155 const SimplifyQuery &Q) { in computeKnownBits()
225 Value *A, *B; in haveNoCommonBitsSetSpecialCases() local
335 const SimplifyQuery &Q) { in ComputeNumSignBits()
362 unsigned Depth, const SimplifyQuery &Q) { in computeKnownBitsAddSub()
377 const SimplifyQuery &Q) { in computeKnownBitsMul()
578 static bool isKnownNonZeroFromAssume(const Value *V, const SimplifyQuery &Q) { in isKnownNonZeroFromAssume()
627 const SimplifyQuery &Q) { in computeKnownBitsFromCmp()
759 Value *A, *B; in computeKnownBitsFromCond() local
779 unsigned Depth, const SimplifyQuery &Q) { in computeKnownBitsFromContext()
884 KnownBits &Known2, unsigned Depth, const SimplifyQuery &Q, in computeKnownBitsFromShiftOperator()
[all …]
H A DDependenceAnalysis.cpp1499 APInt Q = G0; // these need to be initialized in findGCD() local
1521 static APInt floorOfQuotient(const APInt &A, const APInt &B) { in floorOfQuotient()
1522 APInt Q = A; // these need to be initialized in floorOfQuotient() local
1534 static APInt ceilingOfQuotient(const APInt &A, const APInt &B) { in ceilingOfQuotient()
1535 APInt Q = A; // these need to be initialized in ceilingOfQuotient() local
2612 CoefficientInfo *A = collectCoeffInfo(Src, true, A0); in banerjeeMIVtest() local
2685 unsigned DependenceInfo::exploreDirections(unsigned Level, CoefficientInfo *A, in exploreDirections()
2831 void DependenceInfo::findBoundsALL(CoefficientInfo *A, CoefficientInfo *B, in findBoundsALL()
2870 void DependenceInfo::findBoundsEQ(CoefficientInfo *A, CoefficientInfo *B, in findBoundsEQ()
2910 void DependenceInfo::findBoundsLT(CoefficientInfo *A, CoefficientInfo *B, in findBoundsLT()
[all …]
/freebsd/contrib/llvm-project/compiler-rt/lib/builtins/hexagon/
H A Ddfdiv.S11 #define A r1:0 macro
19 #define Q r5:4 macro
140 Q = #0 define
187 Q = add(Q,PROD) define
207 #define A r1:0 macro
214 A = convert_d2df(Q) define
270 Q = neg(PROD) define
280 A = convert_d2df(Q) define
348 A = insert(B,#63,#0) define
420 A = asl(A,QH) define
[all …]
/freebsd/contrib/llvm-project/clang/lib/AST/
H A DComputeDependence.cpp645 for (auto *A : llvm::ArrayRef(E->getArgs(), E->getNumArgs())) { in computeDependence() local
649 for (auto *A : PreArgs) in computeDependence() local
679 for (const auto &A : E->template_arguments()) in computeDependence() local
703 for (auto *A : E->inits()) in computeDependence() local
757 ExprDependence clang::computeDependence(AtomicExpr *A) { in computeDependence()
773 for (auto *A : E->placement_arguments()) in computeDependence() local
785 if (auto *Q = E->getQualifier()) in computeDependence() local
803 if (auto *Q = E->getQualifier()) in computeDependence() local
814 for (const auto &A : E->template_arguments()) in computeDependence() local
822 if (auto *Q = E->getQualifier()) in computeDependence() local
[all …]
/freebsd/sys/dev/ath/ath_rate/sample/
H A Dtx_schedules.h43 #define A(_r) \ macro
223 #define Q(_r) \ macro
/freebsd/contrib/bearssl/src/ec/
H A Dec_prime_i15.c570 jacobian P2, P3, Q, T, U; in point_mul() local
632 jacobian Q; in point_decode() local
673 jacobian Q, T; in point_encode() local
759 api_muladd(unsigned char *A, const unsigned char *B, size_t len, in api_muladd()
765 jacobian P, Q; in api_muladd() local
H A Dec_prime_i31.c569 jacobian P2, P3, Q, T, U; in point_mul() local
631 jacobian Q; in point_decode() local
673 jacobian Q, T; in point_encode() local
761 api_muladd(unsigned char *A, const unsigned char *B, size_t len, in api_muladd()
767 jacobian P, Q; in api_muladd() local
H A Dec_p256_m15.c1340 p256_double(p256_jacobian *Q) in p256_double()
1776 p256_jacobian P2, P3, Q, T, U; in p256_mul() local
1960 p256_jacobian Q; in p256_mulgen() local
2066 api_muladd(unsigned char *A, const unsigned char *B, size_t len, in api_muladd()
2070 p256_jacobian P, Q; in api_muladd() local
H A Dec_p256_m31.c745 p256_double(p256_jacobian *Q) in p256_double()
1126 p256_jacobian P2, P3, Q, T, U; in p256_mul() local
1305 p256_jacobian Q; in p256_mulgen() local
1411 api_muladd(unsigned char *A, const unsigned char *B, size_t len, in api_muladd()
1415 p256_jacobian P, Q; in api_muladd() local
H A Dec_p256_m64.c1272 p256_jacobian Q; in point_mul_inner() local
1681 api_muladd(unsigned char *A, const unsigned char *B, size_t len, in api_muladd()
1713 p256_jacobian P, Q; in api_muladd() local
H A Dec_p256_m62.c1254 p256_jacobian Q; in point_mul_inner() local
1665 api_muladd(unsigned char *A, const unsigned char *B, size_t len, in api_muladd()
1697 p256_jacobian P, Q; in api_muladd() local
/freebsd/contrib/llvm-project/llvm/lib/Transforms/InstCombine/
H A DInstCombineCompares.cpp526 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
1253 const SimplifyQuery Q = SQ.getWithInstruction(&Cmp); in foldICmpWithZero() local
1298 Value *A, *B; in foldICmpWithConstant() local
1498 const SimplifyQuery &Q) { in foldICmpTruncWithTruncOrExt()
1823 Value *A, *B, *LShr; in foldICmpAndConstConst() local
1937 Value *A, *B; in foldICmpAndConstant() local
[all …]
H A DInstCombineAndOrXor.cpp118 static unsigned getMaskedICmpType(Value *A, Value *B, Value *C, in getMaskedICmpType()
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
711 const SimplifyQuery &Q) { in foldAndOrOfICmpsWithPow2AndWithZero()
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
1073 const SimplifyQuery &Q, in foldUnsignedUnderflowCheck()
1083 Value *A, *B; in foldUnsignedUnderflowCheck() local
[all …]
H A DInstCombineShifts.cpp190 const SimplifyQuery &Q, in dropRedundantMaskingOfLeftShiftInput()
440 Value *A; in commonShiftTransforms() local
966 static bool setShiftFlags(BinaryOperator &I, const SimplifyQuery &Q) { in setShiftFlags()
1020 const SimplifyQuery Q = SQ.getWithInstruction(&I); in visitShl() local
1575 const SimplifyQuery Q = SQ.getWithInstruction(&I); in visitLShr() local
1760 const SimplifyQuery Q = SQ.getWithInstruction(&I); in visitAShr() local
H A DInstCombineAddSub.cpp1001 const SimplifyQuery Q = SQ.getWithInstruction(&Add); in foldAddWithConstant() 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
2371 Value *A, *B; in visitSub() local
2379 Value *A, *B; in visitSub() local
2387 Value *A, *B; in visitSub() local
2395 Value *A, *B; in visitSub() local
[all …]
/freebsd/contrib/llvm-project/llvm/tools/llvm-nm/
H A Dllvm-nm.cpp270 bool operator<(const NMSymbol &A, const NMSymbol &B) { in operator <()
284 bool operator>(const NMSymbol &A, const NMSymbol &B) { return B < A; } in operator >()
285 bool operator==(const NMSymbol &A, const NMSymbol &B) { in operator ==()
1405 const char *Q = ExportsNameBuffer.c_str(); in dumpSymbolsFromDLInfoMachO() local
1458 const char *Q = BindsNameBuffer.c_str(); in dumpSymbolsFromDLInfoMachO() local
1517 const char *Q = LazysNameBuffer.c_str(); in dumpSymbolsFromDLInfoMachO() local
1585 const char *Q = WeaksNameBuffer.c_str(); in dumpSymbolsFromDLInfoMachO() local
1673 const char *Q = FunctionStartsNameBuffer.c_str(); in dumpSymbolsFromDLInfoMachO() local
2065 static void dumpArchiveMap(Archive *A, StringRef Filename) { in dumpArchiveMap()
2081 static void dumpArchive(Archive *A, std::vector<NMSymbol> &SymbolList, in dumpArchive()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DRegAllocEvictionAdvisor.cpp149 bool DefaultEvictionAdvisor::shouldEvict(const LiveInterval &A, bool IsHint, in shouldEvict()
206 LiveIntervalUnion::Query &Q = Matrix->query(VirtReg, Unit); in canEvictInterferenceBasedOnCost() local
/freebsd/lib/msun/ld80/
H A De_powl.c135 static const long double Q[] = { variable
144 static const long double A[33] = { variable
/freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonLoopIdiomRecognition.cpp209 std::deque<Value *> Q; member
288 WorkListType Q; in INITIALIZE_PASS_DEPENDENCY() local
334 WorkListType Q; in initialize() local
402 WorkListType Q; in subst() local
435 WorkListType Q; in replace() local
496 WorkListType Q; in find() local
536 WorkListType Q; in simplify() local
613 Value *Q = nullptr; member
699 Value *A = nullptr, *B = nullptr, *C = nullptr; in matchLeftShift() local
746 Value *Q = nullptr, *R = nullptr, *Y = nullptr, *Z = nullptr; in matchLeftShift() local
[all …]
H A DHexagonConstExtenders.cpp45 static int32_t adjustUp(int32_t V, uint8_t A, uint8_t O) { in adjustUp()
51 static int32_t adjustDown(int32_t V, uint8_t A, uint8_t O) { in adjustDown()
559 for (const std::pair<const HCE::ExtenderInit, HCE::IndexList> &Q : P.IMap) { in operator <<() local
1079 uint8_t A = HexagonII::getMemAccessSizeInBytes(HexagonII::MemAccessSize(F)); in getOffsetRange() local
1119 uint8_t A = HexagonII::getMemAccessSizeInBytes(HexagonII::MemAccessSize(F)); in getOffsetRange() local
1396 Counts, [](const CMap::value_type &A, const CMap::value_type &B) { in assignInits()
1751 uint32_t A = std::min<uint32_t>(R.Align, 1u << llvm::countr_zero(UD)); in replaceInstrExpr() local
1927 for (const std::pair<Loc,IndexList> &Q : Defs) { in replaceExtenders() local
1985 llvm::sort(Extenders, [this](const ExtDesc &A, const ExtDesc &B) { in runOnMachineFunction()
/freebsd/contrib/llvm-project/compiler-rt/lib/xray/
H A Dxray_profile_collector.cpp105 void post(BufferQueue *Q, FunctionCallTrie &&T, in post()
106 FunctionCallTrie::Allocators &&A, in post()
/freebsd/contrib/llvm-project/lldb/source/Plugins/Instruction/ARM64/
H A DEmulateInstructionARM64.h137 Q : 1, // AArch32 only – CSPR.Q bit member
143 D : 1, A : 1, I : 1, member
/freebsd/contrib/llvm-project/clang/include/clang/Analysis/Analyses/
H A DThreadSafetyTraverse.h158 CopyReducerBase(MemRegionRef A) : Arena(A) {} in CopyReducerBase()
339 bool comparePointers(const void* P, const void* Q) { return P == Q; } in comparePointers()
373 bool comparePointers(const void *P, const void *Q) { return P == Q; } in comparePointers()
848 for (const auto *A : E->arguments()) in printBasicBlock() local
/freebsd/contrib/llvm-project/llvm/lib/Support/
H A DAPInt.cpp767 APInt llvm::APIntOps::GreatestCommonDivisor(APInt A, APInt B) { in GreatestCommonDivisor()
1439 uint32_t *Q = nullptr; in divide() local
2732 APInt llvm::APIntOps::RoundingUDiv(const APInt &A, const APInt &B, in RoundingUDiv()
2750 APInt llvm::APIntOps::RoundingSDiv(const APInt &A, const APInt &B, in RoundingSDiv()
2781 llvm::APIntOps::SolveQuadraticEquationWrap(APInt A, APInt B, APInt C, in SolveQuadraticEquationWrap()
2852 auto RoundUp = [] (const APInt &V, const APInt &A) -> APInt { in SolveQuadraticEquationWrap()
2913 APInt Q = SQ * SQ; in SolveQuadraticEquationWrap() local
2971 llvm::APIntOps::GetMostSignificantDifferentBit(const APInt &A, const APInt &B) { in GetMostSignificantDifferentBit()
2978 APInt llvm::APIntOps::ScaleBitMask(const APInt &A, unsigned NewBitWidth, in ScaleBitMask()

123