/freebsd/contrib/llvm-project/compiler-rt/lib/builtins/hexagon/ |
H A D | dfdiv.S | 15 #define B r3:2 macro 19 #define Q r5:4 macro 140 Q = #0 define 187 Q = add(Q,PROD) define 210 #define B r3:2 macro 262 B = #1 define 270 Q = neg(PROD) define 292 B = extractu(A,#63,#0) define 328 B = combine(##0x7fefffff,#-1) define 421 B = asl(B,QL) define [all …]
|
/freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | InstructionSimplify.cpp | 154 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() 241 auto *B = dyn_cast<BinaryOperator>(V); in expandBinOp() local 275 const SimplifyQuery &Q, in expandCommutativeBinOp() 292 const SimplifyQuery &Q, in simplifyAssociativeBinOp() 306 Value *B = Op0->getOperand(1); in simplifyAssociativeBinOp() local 326 Value *B = Op1->getOperand(0); in simplifyAssociativeBinOp() local [all …]
|
H A D | ValueTracking.cpp | 155 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 D | DependenceAnalysis.cpp | 1499 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 2615 CoefficientInfo *B = collectCoeffInfo(Dst, false, B0); in banerjeeMIVtest() local 2686 CoefficientInfo *B, BoundInfo *Bound, 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/llvm/lib/Target/Hexagon/ |
H A D | HexagonLoopIdiomRecognition.cpp | 209 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 515 void Simplifier::Context::link(Instruction *I, BasicBlock *B, in link() 528 Value *Simplifier::Context::materialize(BasicBlock *B, in materialize() 536 WorkListType Q; in simplify() local 613 Value *Q = nullptr; member [all …]
|
H A D | HexagonConstExtenders.cpp | 559 for (const std::pair<const HCE::ExtenderInit, HCE::IndexList> &Q : P.IMap) { in operator <<() local 1396 Counts, [](const CMap::value_type &A, const CMap::value_type &B) { in assignInits() 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() 2007 unsigned B = I; in runOnMachineFunction() local
|
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | AMDGPURewriteOutArguments.cpp | 258 MemDepResult Q = MDA->getPointerDependencyFrom( runOnFunction() local 340 IRBuilder<> B(RI); runOnFunction() local 373 IRBuilder<> B(StubBB); runOnFunction() local [all...] |
/freebsd/contrib/bearssl/src/ec/ |
H A D | ec_prime_i15.c | 570 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 D | ec_prime_i31.c | 569 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 D | ec_p256_m15.c | 1340 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 D | ec_p256_m31.c | 745 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 D | ec_p256_m64.c | 1272 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 D | ec_p256_m62.c | 1254 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/CodeGen/ |
H A D | RegAllocEvictionAdvisor.cpp | 150 const LiveInterval &B, in shouldEvict() 206 LiveIntervalUnion::Query &Q = Matrix->query(VirtReg, Unit); in canEvictInterferenceBasedOnCost() local
|
H A D | RegAllocGreedy.cpp | 495 LiveIntervalUnion::Query &Q = Matrix->query(VirtReg, Unit); in evictInterference() local 679 unsigned B = 0, T = 0; in addThroughConstraints() local 1203 if (unsigned B = Cand.getBundles(BundleCand, BestCand)) { in doRegionSplit() local 1216 if (unsigned B = Cand.getBundles(BundleCand, 0)) { in doRegionSplit() local 1873 LiveIntervalUnion::Query &Q = Matrix->query(VirtReg, Unit); in mayRecolorAllInterferences() local
|
/freebsd/contrib/llvm-project/compiler-rt/lib/xray/ |
H A D | xray_profile_collector.cpp | 105 void post(BufferQueue *Q, FunctionCallTrie &&T, in post() 107 FunctionCallTrie::Allocators::Buffers &&B, in post() 294 auto B = ProfileBuffers->Append({}); in serialize() local 375 XRayBuffer nextBuffer(XRayBuffer B) XRAY_NEVER_INSTRUMENT { in nextBuffer()
|
/freebsd/lib/msun/ld80/ |
H A D | e_powl.c | 135 static const long double Q[] = { variable 179 static const long double B[17] = { variable
|
/freebsd/contrib/llvm-project/llvm/lib/Transforms/InstCombine/ |
H A D | InstCombineCompares.cpp | 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 2120 Value *P, *Q; in foldICmpOrConstant() local 3118 const SimplifyQuery Q = SQ.getWithInstruction(&Cmp); in foldICmpAddConstant() local 3572 const SimplifyQuery &Q) { in foldCtpopPow2Test() [all …]
|
H A D | InstCombineAndOrXor.cpp | 118 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() 995 auto isReducible = [](const Value *B, const Value *D, const Value *E) { in foldNegativePower2AndShiftedMask() 1043 Value *A = nullptr, *B = nullptr, *C = nullptr, *D = nullptr, *E = nullptr; in foldPowerOf2AndShiftedMask() local 1073 const SimplifyQuery &Q, in foldUnsignedUnderflowCheck() [all …]
|
H A D | InstCombineShifts.cpp | 190 const SimplifyQuery &Q, in dropRedundantMaskingOfLeftShiftInput() 966 static bool setShiftFlags(BinaryOperator &I, const SimplifyQuery &Q) { in setShiftFlags() 1020 const SimplifyQuery Q = SQ.getWithInstruction(&I); in visitShl() local 1172 Value *B = 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 D | InstCombineAddSub.cpp | 180 FAddCombine(InstCombiner::BuilderTy &B) : Builder(B) {} in FAddCombine() 1001 const SimplifyQuery Q = SQ.getWithInstruction(&Add); in foldAddWithConstant() local 1020 Value *&B) { 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 [all …]
|
H A D | InstructionCombining.cpp | 283 static bool maintainNoSignedWrap(BinaryOperator &I, Value *B, Value *C) { in maintainNoSignedWrap() 447 Value *B = Op0->getOperand(1); in SimplifyAssociativeOrCommutative() local 480 Value *B = Op1->getOperand(0); in SimplifyAssociativeOrCommutative() local 508 Value *B = Op0->getOperand(1); in SimplifyAssociativeOrCommutative() local 528 Value *B = Op1->getOperand(0); in SimplifyAssociativeOrCommutative() local 547 Value *A, *B; in SimplifyAssociativeOrCommutative() local 669 Value *B, Value *C, Value *D) { in tryFactorization() 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/llvm/tools/llvm-nm/ |
H A D | llvm-nm.cpp | 270 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 1433 NMSymbol B = {}; 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
|
/freebsd/contrib/llvm-project/clang/include/clang/Analysis/Analyses/ |
H A D | ThreadSafetyTraverse.h | 259 R_SExpr reduceGoto(Goto &Orig, BasicBlock *B) { in reduceGoto() 279 R_SExpr reduceLet(Let &Orig, Variable *Nvd, R_SExpr B) { in reduceLet() 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() 655 const SExpr *B = E->body(); variable
|
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/ |
H A D | CombinerHelper.cpp | 57 MachineIRBuilder &B, bool IsPreLegalize, in CombinerHelper() 270 MatchInfo = [=](MachineIRBuilder &B) { in matchFreezeOfSingleMaybePoisonOperand() 282 MatchInfo = [=](MachineIRBuilder &B) mutable { in matchFreezeOfSingleMaybePoisonOperand() 957 MatchInfo = [=](MachineIRBuilder &B) { in matchCombineLoadWithAndMask() 1158 LegalityQuery Q(IndexedOpc, OpTys, MemDescrs); in isIndexedLoadStoreLegal() local 1392 LegalityQuery Q = {TargetOpcode::G_LOAD, {VecEltTy, PtrTy}, {MMDesc}}; in matchCombineExtractedVectorLoad() local 1409 MatchInfo = [=](MachineIRBuilder &B) { in matchCombineExtractedVectorLoad() 2000 MatchInfo = [=](MachineIRBuilder &B) { in matchCommuteShift() 2212 MatchInfo = [&MI](MachineIRBuilder &B) { in matchCombineUnmergeUndef() 3271 MatchInfo = [=](MachineIRBuilder &B) { in matchOverlappingAnd() [all …]
|