/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | InstSimplifyFolder.h | 36 SimplifyQuery SQ; variable 52 return simplifyBinOp(Opc, LHS, RHS, SQ); in FoldBinOp() 57 return simplifyBinOp(Opc, LHS, RHS, SQ); in FoldExactBinOp() 62 return simplifyBinOp(Opc, LHS, RHS, SQ); in FoldNoWrapBinOp() 67 return simplifyBinOp(Opc, LHS, RHS, FMF, SQ); in FoldBinOpFMF() 72 return simplifyUnOp(Opc, V, FMF, SQ); in FoldUnOpFMF() 76 return simplifyICmpInst(P, LHS, RHS, SQ); in FoldICmp() 85 return simplifySelectInst(C, True, False, SQ); in FoldSelect() 90 return simplifyExtractValueInst(Agg, IdxList, SQ); in FoldExtractValue() 99 return simplifyExtractElementInst(Vec, Idx, SQ); in FoldExtractElement() [all …]
|
H A D | ValueTracking.h | 100 unsigned Depth, const SimplifyQuery &SQ); 105 const SimplifyQuery &SQ); 140 bool isKnownNonNegative(const Value *V, const SimplifyQuery &SQ, 145 bool isKnownPositive(const Value *V, const SimplifyQuery &SQ, 834 const SimplifyQuery &SQ); 836 const SimplifyQuery &SQ); 840 const SimplifyQuery &SQ); 843 const SimplifyQuery &SQ); 846 const SimplifyQuery &SQ); 848 const SimplifyQuery &SQ); [all …]
|
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | InstSimplifyPass.cpp | 28 static bool runImpl(Function &F, const SimplifyQuery &SQ) { in runImpl() argument 36 if (!SQ.DT->isReachableFromEntry(&BB)) in runImpl() 52 if (Value *V = simplifyInstruction(&I, SQ)) { in runImpl() 65 RecursivelyDeleteTriviallyDeadInstructions(DeadInstsInBB, SQ.TLI); in runImpl() 103 const SimplifyQuery SQ(DL, TLI, DT, AC); in runOnFunction() local 104 return runImpl(F, SQ); in runOnFunction() 129 const SimplifyQuery SQ(DL, &TLI, &DT, &AC); in run() local 130 bool Changed = runImpl(F, SQ); in run()
|
H A D | LoopDeletion.cpp | 178 const SimplifyQuery &SQ) { in getValueOnFirstIteration() argument 189 getValueOnFirstIteration(BO->getOperand(0), FirstIterValue, SQ); in getValueOnFirstIteration() 191 getValueOnFirstIteration(BO->getOperand(1), FirstIterValue, SQ); in getValueOnFirstIteration() 192 FirstIterV = simplifyBinOp(BO->getOpcode(), LHS, RHS, SQ); in getValueOnFirstIteration() 195 getValueOnFirstIteration(Cmp->getOperand(0), FirstIterValue, SQ); in getValueOnFirstIteration() 197 getValueOnFirstIteration(Cmp->getOperand(1), FirstIterValue, SQ); in getValueOnFirstIteration() 198 FirstIterV = simplifyICmpInst(Cmp->getPredicate(), LHS, RHS, SQ); in getValueOnFirstIteration() 205 FirstIterV = getValueOnFirstIteration(Selected, FirstIterValue, SQ); in getValueOnFirstIteration() 303 const SimplifyQuery SQ(DL); in canProveExitOnFirstIteration() local 324 getValueOnFirstIteration(Incoming, FirstIterValue, SQ); in canProveExitOnFirstIteration() [all …]
|
H A D | LoopRotation.cpp | 72 const SimplifyQuery SQ = getBestSimplifyQuery(AR, DL); in run() local 78 MSSAU ? &*MSSAU : nullptr, SQ, false, Threshold, in run() 134 const SimplifyQuery SQ = getBestSimplifyQuery(*this, F); in runOnLoop() local 148 return LoopRotation(L, LI, TTI, AC, &DT, &SE, MSSAU ? &*MSSAU : nullptr, SQ, in runOnLoop()
|
H A D | LoopInstSimplify.cpp | 49 SimplifyQuery SQ(DL, &TLI, &DT, &AC); in simplifyLoopInst() local 98 Value *V = simplifyInstruction(&I, SQ.getWithInstruction(&I)); in simplifyLoopInst()
|
H A D | NaryReassociate.cpp | 362 SimplifyQuery SQ(*DL, DT, AC, GEP); in tryReassociateGEPAtIndex() local 368 if (isKnownNonNegative(ZExt->getOperand(0), SQ)) in tryReassociateGEPAtIndex() 377 computeOverflowForSignedAdd(AO, SQ) != OverflowResult::NeverOverflows) in tryReassociateGEPAtIndex()
|
H A D | CorrelatedValuePropagation.cpp | 261 const SimplifyQuery &SQ) { in processPHI() argument 276 if (Value *V = simplifyInstruction(P, SQ)) { in processPHI() 1138 const SimplifyQuery &SQ) { in runImpl() argument 1153 BBChanged |= processPHI(cast<PHINode>(&II), LVI, DT, SQ); in runImpl()
|
H A D | EarlyCSE.cpp | 646 const SimplifyQuery SQ; member in __anon73aa16d30411::EarlyCSE 735 : TLI(TLI), TTI(TTI), DT(DT), AC(AC), SQ(DL, &TLI, &DT, &AC), MSSA(MSSA), in EarlyCSE() 1495 if (Value *V = simplifyInstruction(&Inst, SQ)) { in processNode() 1653 APInt Offset = APInt(SQ.DL.getIndexTypeSizeInBits(GEP->getType()), 0); in processNode() 1654 GEPValue GEPVal(GEP, GEP->accumulateConstantOffset(SQ.DL, Offset) in processNode()
|
/freebsd/contrib/unbound/daemon/ |
H A D | remote.c | 103 #ifdef SQ 104 #undef SQ 108 #define SQ "=" macro 732 if(!ssl_printf(ssl, "%s.tcpusage"SQ"%lu\n", nm, in print_stats() 833 if(!print_longnum(ssl, "mem.streamwait"SQ, in print_mem() 958 if(!ssl_printf(ssl, "num.query.tcp"SQ"%lu\n", in print_ext() 964 if(!ssl_printf(ssl, "num.query.tls"SQ"%lu\n", in print_ext() 968 if(!ssl_printf(ssl, "num.query.ipv6"SQ"%lu\n", in print_ext() 970 if(!ssl_printf(ssl, "num.query.https"SQ"%lu\n", in print_ext() 1032 if(!ssl_printf(ssl, "msg.cache.count"SQ"%u\n", in print_ext() [all …]
|
/freebsd/contrib/file/magic/Magdir/ |
H A D | softquad | 11 0 string \<!SQ\ DTD> Compiled SGML rules file 13 0 string \<!SQ\ A/E> A/E SGML Document binary 15 0 string \<!SQ\ STS> A/E SGML binary styles file 26 0 search/1 SQ\ BITMAP1 SoftQuad Raster Format text 27 #0 string SQ\ BITMAP2 SoftQuad Raster Format data
|
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/InstCombine/ |
H A D | InstCombiner.h | 76 SimplifyQuery SQ; variable 103 SQ(DL, &TLI, &DT, &AC, nullptr, /*UseInstrInfo*/ true, in InstCombiner() 380 const SimplifyQuery &getSimplifyQuery() const { return SQ; } in getSimplifyQuery() 471 llvm::computeKnownBits(V, Known, Depth, SQ.getWithInstruction(CxtI)); in computeKnownBits() 476 return llvm::computeKnownBits(V, Depth, SQ.getWithInstruction(CxtI)); in computeKnownBits() 504 SQ.getWithInstruction(CxtI)); in computeOverflowForUnsignedMul() 510 SQ.getWithInstruction(CxtI)); in computeOverflowForSignedMul() 518 SQ.getWithInstruction(CxtI)); in computeOverflowForUnsignedAdd() 526 SQ.getWithInstruction(CxtI)); in computeOverflowForSignedAdd() 533 SQ.getWithInstruction(CxtI)); in computeOverflowForUnsignedSub() [all …]
|
/freebsd/contrib/llvm-project/llvm/lib/Support/ |
H A D | YAMLTraits.cpp | 214 if (SequenceHNode *SQ = dyn_cast<SequenceHNode>(CurrentNode)) in beginSequence() local 215 return SQ->Entries.size(); in beginSequence() 236 CurrentNode = SQ->Entries[Index]; in preflightElement() 253 CurrentNode = SQ->Entries[index]; in preflightFlowElement() 298 BitValuesUsed.resize(SQ->Entries.size()); in beginBitSetScalar() 311 for (auto &N : SQ->Entries) { in bitSetMatch() 332 assert(BitValuesUsed.size() == SQ->Entries.size()); in endBitSetScalar() 333 for (unsigned i = 0; i < SQ->Entries.size(); ++i) { in endBitSetScalar() 335 setError(SQ->Entries[i], "unknown bit value"); in endBitSetScalar() 419 SequenceNode *SQ = dyn_cast<SequenceNode>(N); in createHNodes() local [all …]
|
/freebsd/contrib/llvm-project/llvm/include/llvm/MCA/HardwareUnits/ |
H A D | LSUnit.h | 445 LSUnit(const MCSchedModel &SM, unsigned LQ, unsigned SQ) in LSUnit() argument 446 : LSUnit(SM, LQ, SQ, /* NoAlias */ false) {} in LSUnit() 447 LSUnit(const MCSchedModel &SM, unsigned LQ, unsigned SQ, bool AssumeNoAlias) in LSUnit() argument 448 : LSUnitBase(SM, LQ, SQ, AssumeNoAlias), CurrentLoadGroupID(0), in LSUnit()
|
/freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | ValueTracking.cpp | 197 isGuaranteedNotToBeUndef(M, SQ.AC, SQ.CxtI, SQ.DT)) in haveNoCommonBitsSetSpecialCases() 203 isGuaranteedNotToBeUndef(LHS, SQ.AC, SQ.CxtI, SQ.DT)) in haveNoCommonBitsSetSpecialCases() 211 isGuaranteedNotToBeUndef(LHS, SQ.AC, SQ.CxtI, SQ.DT) && in haveNoCommonBitsSetSpecialCases() 212 isGuaranteedNotToBeUndef(Y, SQ.AC, SQ.CxtI, SQ.DT)) in haveNoCommonBitsSetSpecialCases() 219 isGuaranteedNotToBeUndef(Y, SQ.AC, SQ.CxtI, SQ.DT)) in haveNoCommonBitsSetSpecialCases() 227 isGuaranteedNotToBeUndef(A, SQ.AC, SQ.CxtI, SQ.DT) && in haveNoCommonBitsSetSpecialCases() 228 isGuaranteedNotToBeUndef(B, SQ.AC, SQ.CxtI, SQ.DT)) in haveNoCommonBitsSetSpecialCases() 298 return isKnownNonNegative(V, SQ, Depth) && ::isKnownNonZero(V, Depth, SQ); in isKnownPositive() 6433 if (isGuaranteedNotToBeUndef(LHS, SQ.AC, SQ.CxtI, SQ.DT)) in computeOverflowForUnsignedSub() 6438 if (match(SQ.CxtI, in computeOverflowForUnsignedSub() [all …]
|
/freebsd/contrib/unbound/smallapp/ |
H A D | unbound-control.c | 190 #define SQ "=" macro 192 #define PR_UL_NM(str, var) printf("%s."str SQ"%lu\n", nm, (unsigned long)(var)); 193 #define PR_UL(str, var) printf(str SQ"%lu\n", (unsigned long)(var)); 194 #define PR_UL_SUB(str, nm, var) printf(str".%s"SQ"%lu\n", nm, (unsigned long)(var)); 195 #define PR_TIMEVAL(str, var) printf(str SQ ARG_LL "d.%6.6d\n", \ 197 #define PR_STATSTIME(str, var) printf(str SQ ARG_LL "d.%6.6d\n", \ 199 #define PR_LL(str, var) printf(str SQ ARG_LL"d\n", (long long)(var)); 229 printf("%s.requestlist.avg"SQ"%g\n", nm, in pr_stats() 246 printf("%s.recursion.time.median"SQ"%g\n", nm, s->mesh_time_median); in pr_stats()
|
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | LoopRotationUtils.cpp | 68 const SimplifyQuery &SQ; member in __anonf094bad10111::LoopRotate 77 const SimplifyQuery &SQ, bool RotationOnly, bool IsUtilMode, in LoopRotate() argument 80 MSSAU(MSSAU), SQ(SQ), RotationOnly(RotationOnly), in LoopRotate() 663 Value *V = simplifyInstruction(C, SQ); in rotateLoop() 1054 const SimplifyQuery &SQ, bool RotationOnly = true, in LoopRotation() argument 1057 LoopRotate LR(Threshold, LI, TTI, AC, DT, SE, MSSAU, SQ, RotationOnly, in LoopRotation()
|
H A D | PromoteMemoryToRegister.cpp | 353 const SimplifyQuery SQ; member 399 AC(AC), SQ(DT.getRoot()->getParent()->getParent()->getDataLayout(), in PromoteMem2Reg() 758 if (rewriteSingleStoreAlloca(AI, Info, LBI, SQ.DL, DT, AC, in run() 770 promoteSingleBlockAlloca(AI, Info, LBI, SQ.DL, DT, AC, in run() 897 if (Value *V = simplifyInstruction(PN, SQ)) { in run() 1155 convertMetadataToAssumes(LI, V, SQ.DL, AC, &DT); in RenamePass()
|
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/ |
H A D | LoopRotationUtils.h | 35 MemorySSAUpdater *MSSAU, const SimplifyQuery &SQ,
|
/freebsd/contrib/llvm-project/llvm/lib/Transforms/InstCombine/ |
H A D | InstCombineSimplifyDemanded.cpp | 216 Depth, SQ.getWithInstruction(CxtI)); in SimplifyDemandedUseBits() 249 Depth, SQ.getWithInstruction(CxtI)); in SimplifyDemandedUseBits() 271 if (haveNoCommonBitsSet(LHSCache, RHSCache, SQ.getWithInstruction(I))) { in SimplifyDemandedUseBits() 298 Depth, SQ.getWithInstruction(CxtI)); in SimplifyDemandedUseBits() 1106 Depth, SQ.getWithInstruction(CxtI)); in SimplifyMultipleUseDemandedBits() 1107 computeKnownBitsFromContext(I, Known, Depth, SQ.getWithInstruction(CxtI)); in SimplifyMultipleUseDemandedBits() 1127 Depth, SQ.getWithInstruction(CxtI)); in SimplifyMultipleUseDemandedBits() 1128 computeKnownBitsFromContext(I, Known, Depth, SQ.getWithInstruction(CxtI)); in SimplifyMultipleUseDemandedBits() 1150 Depth, SQ.getWithInstruction(CxtI)); in SimplifyMultipleUseDemandedBits() 1151 computeKnownBitsFromContext(I, Known, Depth, SQ.getWithInstruction(CxtI)); in SimplifyMultipleUseDemandedBits() [all …]
|
H A D | InstructionCombining.cpp | 646 static Value *tryFactorization(BinaryOperator &I, const SimplifyQuery &SQ, in tryFactorization() argument 669 V = simplifyBinOp(TopLevelOpcode, B, D, SQ.getWithInstruction(&I)); in tryFactorization() 689 V = simplifyBinOp(TopLevelOpcode, A, C, SQ.getWithInstruction(&I)); in tryFactorization() 1120 auto SQDistributive = SQ.getWithInstruction(&I).getWithoutUndef(); in foldUsingDistributiveLaws() 1159 auto SQDistributive = SQ.getWithInstruction(&I).getWithoutUndef(); in foldUsingDistributiveLaws() 1275 SimplifyQuery Q = SQ.getWithInstruction(&I); in SimplifySelectsFeedingBinaryOp() 1525 const SimplifyQuery SQ) { in simplifyInstructionWithPHI() argument 1542 &I, Ops, SQ.getWithInstruction(InBB->getTerminator())); in simplifyInstructionWithPHI() 2389 SQ.getWithInstruction(&GEP))) in visitGetElementPtrInst() 3484 SQ.getWithInstruction(&EV))) in visitExtractValueInst() [all …]
|
H A D | InstCombineShifts.cpp | 59 BinaryOperator *Sh0, const SimplifyQuery &SQ, in reassociateShiftAmtsOfTwoSameDirectionShifts() argument 111 SQ.getWithInstruction(Sh0))); in reassociateShiftAmtsOfTwoSameDirectionShifts() 141 X->getType(), SQ.DL); in reassociateShiftAmtsOfTwoSameDirectionShifts() 432 reassociateShiftAmtsOfTwoSameDirectionShifts(&I, SQ))) in commonShiftTransforms() 1001 const SimplifyQuery Q = SQ.getWithInstruction(&I); in visitShl() 1237 SQ.getWithInstruction(&I))) in visitLShr() 1478 const SimplifyQuery Q = SQ.getWithInstruction(&I); in visitLShr() 1566 SQ.getWithInstruction(&I))) in visitAShr() 1642 const SimplifyQuery Q = SQ.getWithInstruction(&I); in visitAShr()
|
H A D | InstCombineMulDivRem.cpp | 195 SQ.getWithInstruction(&I))) in visitMul() 751 SQ.getWithInstruction(&I))) in visitFMul() 1380 SQ.getWithInstruction(&I))) in visitUDiv() 1449 SQ.getWithInstruction(&I))) in visitSDiv() 1551 if (isKnownNonNegative(Op1, SQ.getWithInstruction(&I))) { in visitSDiv() 1715 SQ.getWithInstruction(&I))) in visitFDiv() 2010 SQ.getWithInstruction(&I))) in visitURem() 2063 simplifyICmpInst(ICmpInst::ICMP_ULT, X, Op1, SQ.getWithInstruction(&I)); in visitURem() 2076 SQ.getWithInstruction(&I))) in visitSRem() 2149 SQ.getWithInstruction(&I))) in visitFRem()
|
/freebsd/contrib/llvm-project/llvm/lib/MCA/HardwareUnits/ |
H A D | LSUnit.cpp | 24 LSUnitBase::LSUnitBase(const MCSchedModel &SM, unsigned LQ, unsigned SQ, in LSUnitBase() argument 26 : LQSize(LQ), SQSize(SQ), UsedLQEntries(0), UsedSQEntries(0), in LSUnitBase()
|
/freebsd/contrib/sendmail/contrib/ |
H A D | mail.local.linux | 51 M"@3<7@KB@X0G7,&++$Q-$+;IOQMNCWU.:-[SQ->\%-Y1AC34Y/_.^+PV(M"- 68 MAZN55%@V<PA=ADOWK3N@3G4>;MT<7N>&_P[5=D7=7>]^%SQ=&@]YRF.>&=&H 76 MQ4(PU40SU3WIA($/Y4<ZQ5,5-%6_$U13152Y(W.^DU33`SQ-]50Q)57!]%." 166 ME<0SQ`+,9$E&@6*N3)=T%M""T-P:.5DMKD7+.)&-9BGDJDA#+CQ:I;D1+U+" 197 M(6+T5.?*%I+"9S&FR)2(,JWZ05M5Z6UUI3EB4G:6SQ):$JAI,2U_ZD25!<C1
|