Home
last modified time | relevance | path

Searched refs:SQ (Results 1 – 25 of 66) sorted by relevance

123

/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DInstSimplifyFolder.h36 SimplifyQuery SQ; variable
41 InstSimplifyFolder(const DataLayout &DL) : ConstFolder(DL), SQ(DL) {} in InstSimplifyFolder()
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 simplifyCmpInst(P, LHS, RHS, SQ); in FoldCmp()
81 return simplifyGEPInst(Ty, Ptr, IdxList, NW, SQ); in FoldGEP()
85 return simplifySelectInst(C, True, False, SQ); in FoldSelect()
[all …]
H A DValueTracking.h101 unsigned Depth, const SimplifyQuery &SQ);
112 const SimplifyQuery &SQ);
153 bool isKnownNonNegative(const Value *V, const SimplifyQuery &SQ,
158 bool isKnownPositive(const Value *V, const SimplifyQuery &SQ,
512 const SimplifyQuery &SQ);
515 unsigned Depth, const SimplifyQuery &SQ);
532 unsigned Depth, const SimplifyQuery &SQ) { in computeKnownFPClass() argument
539 computeKnownFPClass(V, DemandedElts, InterestedClasses, Depth, SQ); in computeKnownFPClass()
551 const SimplifyQuery &SQ) { in computeKnownFPClass() argument
556 SQ); in computeKnownFPClass()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DInstSimplifyPass.cpp28 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 DLoopDeletion.cpp178 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()
201 getValueOnFirstIteration(Select->getCondition(), FirstIterValue, SQ); in getValueOnFirstIteration()
205 FirstIterV = getValueOnFirstIteration(Selected, FirstIterValue, SQ); in getValueOnFirstIteration()
303 const SimplifyQuery SQ(DL); in canProveExitOnFirstIteration() local
[all …]
H A DLoopRotation.cpp73 const SimplifyQuery SQ = getBestSimplifyQuery(AR, DL); in run() local
79 MSSAU ? &*MSSAU : nullptr, SQ, false, Threshold, in run()
H A DLoopInstSimplify.cpp49 SimplifyQuery SQ(DL, &TLI, &DT, &AC); in simplifyLoopInst() local
98 Value *V = simplifyInstruction(&I, SQ.getWithInstruction(&I)); in simplifyLoopInst()
H A DNaryReassociate.cpp362 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 DEarlyCSE.cpp646 const SimplifyQuery SQ; member in __anon2439b80b0411::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()
H A DCorrelatedValuePropagation.cpp257 const SimplifyQuery &SQ) { in processPHI() argument
272 if (Value *V = simplifyInstruction(P, SQ)) { in processPHI()
1208 const SimplifyQuery &SQ) { in runImpl() argument
1223 BBChanged |= processPHI(cast<PHINode>(&II), LVI, DT, SQ); in runImpl()
/freebsd/contrib/unbound/daemon/
H A Dremote.c107 #ifdef SQ
108 #undef SQ
112 #define SQ "=" macro
700 if(!ssl_printf(ssl, "%s.num.queries"SQ"%lu\n", nm, in print_stats()
702 if(!ssl_printf(ssl, "%s.num.queries_ip_ratelimited"SQ"%lu\n", nm, in print_stats()
704 if(!ssl_printf(ssl, "%s.num.queries_cookie_valid"SQ"%lu\n", nm, in print_stats()
706 if(!ssl_printf(ssl, "%s.num.queries_cookie_client"SQ"%lu\n", nm, in print_stats()
708 if(!ssl_printf(ssl, "%s.num.queries_cookie_invalid"SQ"%lu\n", nm, in print_stats()
710 if(!ssl_printf(ssl, "%s.num.cachehits"SQ"%lu\n", nm, in print_stats()
713 if(!ssl_printf(ssl, "%s.num.cachemiss"SQ"%lu\n", nm, in print_stats()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/InstCombine/
H A DInstCombiner.h76 SimplifyQuery SQ; variable
104 SQ(DL, &TLI, &DT, &AC, nullptr, /*UseInstrInfo*/ true, in InstCombiner()
342 const SimplifyQuery &getSimplifyQuery() const { return SQ; } in getSimplifyQuery()
433 llvm::computeKnownBits(V, Known, Depth, SQ.getWithInstruction(CxtI)); in computeKnownBits()
438 return llvm::computeKnownBits(V, Depth, SQ.getWithInstruction(CxtI)); in computeKnownBits()
449 return llvm::MaskedValueIsZero(V, Mask, SQ.getWithInstruction(CxtI), Depth);
467 LHS, RHS, SQ.getWithInstruction(CxtI), IsNSW);
473 SQ.getWithInstruction(CxtI)); in computeOverflowForSignedMul()
481 SQ.getWithInstruction(CxtI)); in computeOverflowForUnsignedAdd()
489 SQ.getWithInstruction(CxtI)); in computeOverflowForSignedAdd()
[all …]
/freebsd/contrib/file/magic/Magdir/
H A Dsoftquad11 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/lib/Support/
H A DYAMLTraits.cpp214 if (SequenceHNode *SQ = dyn_cast<SequenceHNode>(CurrentNode)) in beginSequence() local
215 return SQ->Entries.size(); in beginSequence()
234 if (SequenceHNode *SQ = dyn_cast<SequenceHNode>(CurrentNode)) { in preflightElement() local
236 CurrentNode = SQ->Entries[Index]; in preflightElement()
251 if (SequenceHNode *SQ = dyn_cast<SequenceHNode>(CurrentNode)) { in preflightFlowElement() local
253 CurrentNode = SQ->Entries[index]; in preflightFlowElement()
297 if (SequenceHNode *SQ = dyn_cast<SequenceHNode>(CurrentNode)) { in beginBitSetScalar() local
298 BitValuesUsed.resize(SQ->Entries.size()); in beginBitSetScalar()
309 if (SequenceHNode *SQ = dyn_cast<SequenceHNode>(CurrentNode)) { in bitSetMatch() local
311 for (auto &N : SQ->Entries) { in bitSetMatch()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/MCA/HardwareUnits/
H A DLSUnit.h445 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 DValueTracking.cpp192 const SimplifyQuery &SQ) { in haveNoCommonBitsSetSpecialCases() argument
198 isGuaranteedNotToBeUndef(M, SQ.AC, SQ.CxtI, SQ.DT)) in haveNoCommonBitsSetSpecialCases()
204 isGuaranteedNotToBeUndef(LHS, SQ.AC, SQ.CxtI, SQ.DT)) in haveNoCommonBitsSetSpecialCases()
212 isGuaranteedNotToBeUndef(LHS, SQ.AC, SQ.CxtI, SQ.DT) && in haveNoCommonBitsSetSpecialCases()
213 isGuaranteedNotToBeUndef(Y, SQ.AC, SQ.CxtI, SQ.DT)) in haveNoCommonBitsSetSpecialCases()
220 isGuaranteedNotToBeUndef(Y, SQ.AC, SQ.CxtI, SQ.DT)) in haveNoCommonBitsSetSpecialCases()
228 isGuaranteedNotToBeUndef(A, SQ.AC, SQ.CxtI, SQ.DT) && in haveNoCommonBitsSetSpecialCases()
229 isGuaranteedNotToBeUndef(B, SQ.AC, SQ.CxtI, SQ.DT)) in haveNoCommonBitsSetSpecialCases()
238 const SimplifyQuery &SQ) { in haveNoCommonBitsSet() argument
247 if (haveNoCommonBitsSetSpecialCases(LHS, RHS, SQ) || in haveNoCommonBitsSet()
[all …]
/freebsd/contrib/unbound/smallapp/
H A Dunbound-control.c201 #define SQ "=" macro
203 #define PR_UL_NM(str, var) printf("%s."str SQ"%lu\n", nm, (unsigned long)(var));
204 #define PR_UL(str, var) printf(str SQ"%lu\n", (unsigned long)(var));
205 #define PR_UL_SUB(str, nm, var) printf(str".%s"SQ"%lu\n", nm, (unsigned long)(var));
206 #define PR_TIMEVAL(str, var) printf(str SQ ARG_LL "d.%6.6d\n", \
208 #define PR_STATSTIME(str, var) printf(str SQ ARG_LL "d.%6.6d\n", \
210 #define PR_LL(str, var) printf(str SQ ARG_LL"d\n", (long long)(var));
240 printf("%s.requestlist.avg"SQ"%g\n", nm, in pr_stats()
257 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 DLoopRotationUtils.cpp68 const SimplifyQuery &SQ; member in __anon7e6e14090111::LoopRotate
77 const SimplifyQuery &SQ, bool RotationOnly, bool IsUtilMode, in LoopRotate() argument
80 MSSAU(MSSAU), SQ(SQ), RotationOnly(RotationOnly), in LoopRotate()
692 Value *V = simplifyInstruction(C, SQ); in rotateLoop()
1083 const SimplifyQuery &SQ, bool RotationOnly = true, in LoopRotation() argument
1086 LoopRotate LR(Threshold, LI, TTI, AC, DT, SE, MSSAU, SQ, RotationOnly, in LoopRotation()
H A DPromoteMemoryToRegister.cpp355 const SimplifyQuery SQ; member
404 AC(AC), SQ(DT.getRoot()->getDataLayout(), in PromoteMem2Reg()
779 if (rewriteSingleStoreAlloca(AI, Info, LBI, SQ.DL, DT, AC, in run()
791 promoteSingleBlockAlloca(AI, Info, LBI, SQ.DL, DT, AC, in run()
918 if (Value *V = simplifyInstruction(PN, SQ)) { in run()
1184 convertMetadataToAssumes(LI, V, SQ.DL, AC, &DT); in RenamePass()
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DLoopRotationUtils.h35 MemorySSAUpdater *MSSAU, const SimplifyQuery &SQ,
/freebsd/contrib/llvm-project/llvm/lib/MCA/HardwareUnits/
H A DLSUnit.cpp24 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/llvm-project/llvm/lib/Transforms/InstCombine/
H A DInstructionCombining.cpp451 if (Value *V = simplifyBinOp(Opcode, B, C, SQ.getWithInstruction(&I))) { in SimplifyAssociativeOrCommutative()
484 if (Value *V = simplifyBinOp(Opcode, A, B, SQ.getWithInstruction(&I))) { in SimplifyAssociativeOrCommutative()
512 if (Value *V = simplifyBinOp(Opcode, C, A, SQ.getWithInstruction(&I))) { in SimplifyAssociativeOrCommutative()
532 if (Value *V = simplifyBinOp(Opcode, C, A, SQ.getWithInstruction(&I))) { in SimplifyAssociativeOrCommutative()
666 static Value *tryFactorization(BinaryOperator &I, const SimplifyQuery &SQ, in tryFactorization() argument
689 V = simplifyBinOp(TopLevelOpcode, B, D, SQ.getWithInstruction(&I)); in tryFactorization()
709 V = simplifyBinOp(TopLevelOpcode, A, C, SQ.getWithInstruction(&I)); in tryFactorization()
1098 if (Value *V = tryFactorization(I, SQ, Builder, LHSOpcode, A, B, C, D)) in tryFactorizationFolds()
1106 tryFactorization(I, SQ, Builder, LHSOpcode, A, B, RHS, Ident)) in tryFactorizationFolds()
1114 tryFactorization(I, SQ, Builder, RHSOpcode, LHS, Ident, C, D)) in tryFactorizationFolds()
[all …]
H A DInstCombineCalls.cpp1046 static std::optional<bool> getKnownSign(Value *Op, const SimplifyQuery &SQ) { in getKnownSign() argument
1047 KnownBits Known = computeKnownBits(Op, /*Depth=*/0, SQ); in getKnownSign()
1055 return isImpliedByDomCondition(ICmpInst::ICMP_SLT, X, Y, SQ.CxtI, SQ.DL); in getKnownSign()
1061 const SimplifyQuery &SQ) { in getKnownSignOrZero() argument
1062 if (std::optional<bool> Sign = getKnownSign(Op, SQ)) in getKnownSignOrZero()
1067 return isImpliedByDomCondition(ICmpInst::ICMP_SLE, X, Y, SQ.CxtI, SQ.DL); in getKnownSignOrZero()
1074 const SimplifyQuery &SQ) { in signBitMustBeTheSame() argument
1075 std::optional<bool> Known1 = getKnownSign(Op1, SQ); in signBitMustBeTheSame()
1078 std::optional<bool> Known0 = getKnownSign(Op0, SQ); in signBitMustBeTheSame()
1229 const SimplifyQuery &SQ) { in reassociateMinMaxWithConstants() argument
[all …]
H A DInstCombineShifts.cpp59 BinaryOperator *Sh0, const SimplifyQuery &SQ, in reassociateShiftAmtsOfTwoSameDirectionShifts() argument
111 SQ.getWithInstruction(Sh0))); in reassociateShiftAmtsOfTwoSameDirectionShifts()
141 X->getType(), SQ.DL); in reassociateShiftAmtsOfTwoSameDirectionShifts()
435 reassociateShiftAmtsOfTwoSameDirectionShifts(&I, SQ))) in commonShiftTransforms()
1020 const SimplifyQuery Q = SQ.getWithInstruction(&I); in visitShl()
1258 SQ.getWithInstruction(&I))) in visitLShr()
1575 const SimplifyQuery Q = SQ.getWithInstruction(&I); in visitLShr()
1669 SQ.getWithInstruction(&I))) in visitAShr()
1760 const SimplifyQuery Q = SQ.getWithInstruction(&I); in visitAShr()
H A DInstCombineMulDivRem.cpp199 SQ.getWithInstruction(&I))) in visitMul()
859 SQ.getWithInstruction(&I))) in visitFMul()
894 isKnownNeverNaN(Op0, /*Depth=*/0, SQ.getWithInstruction(&I))) || in visitFMul()
895 isKnownNeverNaN(&I, /*Depth=*/0, SQ.getWithInstruction(&I)))) { in visitFMul()
1516 SQ.getWithInstruction(&I))) in visitUDiv()
1585 SQ.getWithInstruction(&I))) in visitSDiv()
1686 if (isKnownNonNegative(Op1, SQ.getWithInstruction(&I))) { in visitSDiv()
1880 SQ.getWithInstruction(&I))) in visitFDiv()
2166 SQ.getWithInstruction(&I))) in visitURem()
2223 simplifyICmpInst(ICmpInst::ICMP_ULT, X, Op1, SQ.getWithInstruction(&I)); in visitURem()
[all …]
/freebsd/contrib/sendmail/contrib/
H A Dmail.local.linux51 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

123