Home
last modified time | relevance | path

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

123

/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DInstSimplifyFolder.h38 SimplifyQuery SQ; variable
43 explicit InstSimplifyFolder(const DataLayout &DL) : ConstFolder(DL), SQ(DL) {} in InstSimplifyFolder()
54 return simplifyBinOp(Opc, LHS, RHS, SQ); in FoldBinOp()
59 return simplifyBinOp(Opc, LHS, RHS, SQ); in FoldExactBinOp()
64 return simplifyBinOp(Opc, LHS, RHS, SQ); in FoldNoWrapBinOp()
69 return simplifyBinOp(Opc, LHS, RHS, FMF, SQ); in FoldBinOpFMF()
74 return simplifyUnOp(Opc, V, FMF, SQ); in FoldUnOpFMF()
78 return simplifyCmpInst(P, LHS, RHS, SQ); in FoldCmp()
83 return simplifyGEPInst(Ty, Ptr, IdxList, NW, SQ); in FoldGEP()
87 return simplifySelectInst(C, True, False, SQ); in FoldSelect()
[all …]
H A DValueTracking.h109 const SimplifyQuery &SQ,
122 const SimplifyQuery &SQ);
169 LLVM_ABI bool isKnownNonNegative(const Value *V, const SimplifyQuery &SQ,
174 LLVM_ABI bool isKnownPositive(const Value *V, const SimplifyQuery &SQ,
179 LLVM_ABI bool isKnownNegative(const Value *V, const SimplifyQuery &SQ,
185 const SimplifyQuery &SQ, unsigned Depth = 0);
197 const SimplifyQuery &SQ, unsigned Depth = 0);
247 const SimplifyQuery &SQ,
252 const SimplifyQuery &SQ,
265 FPClassTest InterestedClasses, const SimplifyQuery &SQ, unsigned Depth = 0);
[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.cpp72 const SimplifyQuery SQ = getBestSimplifyQuery(AR, DL); in run() local
78 MSSAU ? &*MSSAU : nullptr, SQ, false, Threshold, in run()
H A DLoopInstSimplify.cpp46 SimplifyQuery SQ(DL, &TLI, &DT, &AC); in simplifyLoopInst() local
95 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()
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/InstCombine/
H A DInstCombiner.h77 SimplifyQuery SQ; variable
110 SQ(DL, &TLI, &DT, &AC, nullptr, /*UseInstrInfo*/ true, in InstCombiner()
338 const SimplifyQuery &getSimplifyQuery() const { return SQ; } in getSimplifyQuery()
435 llvm::computeKnownBits(V, Known, SQ.getWithInstruction(CxtI), Depth);
440 return llvm::computeKnownBits(V, SQ.getWithInstruction(CxtI), Depth);
446 return llvm::isKnownToBeAPowerOfTwo(V, OrZero, SQ.getWithInstruction(CxtI),
453 return llvm::MaskedValueIsZero(V, Mask, SQ.getWithInstruction(CxtI), Depth);
473 LHS, RHS, SQ.getWithInstruction(CxtI), IsNSW);
479 SQ.getWithInstruction(CxtI)); in computeOverflowForSignedMul()
487 SQ.getWithInstruction(CxtI)); in computeOverflowForUnsignedAdd()
[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.cpp213 if (SequenceHNode *SQ = dyn_cast<SequenceHNode>(CurrentNode)) in beginSequence() local
214 return SQ->Entries.size(); in beginSequence()
233 if (SequenceHNode *SQ = dyn_cast<SequenceHNode>(CurrentNode)) { in preflightElement() local
235 CurrentNode = SQ->Entries[Index]; in preflightElement()
250 if (SequenceHNode *SQ = dyn_cast<SequenceHNode>(CurrentNode)) { in preflightFlowElement() local
252 CurrentNode = SQ->Entries[index]; in preflightFlowElement()
296 if (SequenceHNode *SQ = dyn_cast<SequenceHNode>(CurrentNode)) { in beginBitSetScalar() local
297 BitValuesUsed.resize(SQ->Entries.size()); in beginBitSetScalar()
308 if (SequenceHNode *SQ = dyn_cast<SequenceHNode>(CurrentNode)) { in bitSetMatch() local
310 for (auto &N : SQ->Entries) { in bitSetMatch()
[all …]
/freebsd/contrib/unbound/daemon/
H A Dremote.c123 #ifdef SQ
124 #undef SQ
128 #define SQ "=" macro
792 if(!ssl_printf(ssl, "%s.num.queries"SQ"%lu\n", nm, in print_stats()
794 if(!ssl_printf(ssl, "%s.num.queries_ip_ratelimited"SQ"%lu\n", nm, in print_stats()
796 if(!ssl_printf(ssl, "%s.num.queries_cookie_valid"SQ"%lu\n", nm, in print_stats()
798 if(!ssl_printf(ssl, "%s.num.queries_cookie_client"SQ"%lu\n", nm, in print_stats()
800 if(!ssl_printf(ssl, "%s.num.queries_cookie_invalid"SQ"%lu\n", nm, in print_stats()
802 if(!ssl_printf(ssl, "%s.num.queries_discard_timeout"SQ"%lu\n", nm, in print_stats()
804 if(!ssl_printf(ssl, "%s.num.queries_wait_limit"SQ"%lu\n", nm, in print_stats()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DValueTracking.cpp177 const SimplifyQuery &SQ) { in haveNoCommonBitsSetSpecialCases() argument
183 isGuaranteedNotToBeUndef(M, SQ.AC, SQ.CxtI, SQ.DT)) in haveNoCommonBitsSetSpecialCases()
189 isGuaranteedNotToBeUndef(LHS, SQ.AC, SQ.CxtI, SQ.DT)) in haveNoCommonBitsSetSpecialCases()
197 isGuaranteedNotToBeUndef(LHS, SQ.AC, SQ.CxtI, SQ.DT) && in haveNoCommonBitsSetSpecialCases()
198 isGuaranteedNotToBeUndef(Y, SQ.AC, SQ.CxtI, SQ.DT)) in haveNoCommonBitsSetSpecialCases()
205 isGuaranteedNotToBeUndef(Y, SQ.AC, SQ.CxtI, SQ.DT)) in haveNoCommonBitsSetSpecialCases()
213 isGuaranteedNotToBeUndef(A, SQ.AC, SQ.CxtI, SQ.DT) && in haveNoCommonBitsSetSpecialCases()
214 isGuaranteedNotToBeUndef(B, SQ.AC, SQ.CxtI, SQ.DT)) in haveNoCommonBitsSetSpecialCases()
236 const SimplifyQuery &SQ) { in haveNoCommonBitsSet() argument
245 if (haveNoCommonBitsSetSpecialCases(LHS, RHS, SQ) || in haveNoCommonBitsSet()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/MCA/HardwareUnits/
H A DLSUnit.h413 LSUnit(const MCSchedModel &SM, unsigned LQ, unsigned SQ) in LSUnit() argument
414 : LSUnit(SM, LQ, SQ, /* NoAlias */ false) {} in LSUnit()
415 LSUnit(const MCSchedModel &SM, unsigned LQ, unsigned SQ, bool AssumeNoAlias) in LSUnit() argument
416 : LSUnitBase(SM, LQ, SQ, AssumeNoAlias), CurrentLoadGroupID(0), in LSUnit()
/freebsd/contrib/unbound/smallapp/
H A Dunbound-control.c213 #define SQ "=" macro
215 #define PR_UL_NM(str, var) printf("%s."str SQ"%lu\n", nm, (unsigned long)(var));
216 #define PR_UL(str, var) printf(str SQ"%lu\n", (unsigned long)(var));
217 #define PR_UL_SUB(str, nm, var) printf(str".%s"SQ"%lu\n", nm, (unsigned long)(var));
218 #define PR_TIMEVAL(str, var) printf(str SQ ARG_LL "d.%6.6d\n", \
220 #define PR_STATSTIME(str, var) printf(str SQ ARG_LL "d.%6.6d\n", \
222 #define PR_LL(str, var) printf(str SQ ARG_LL"d\n", (long long)(var));
256 printf("%s.requestlist.avg"SQ"%g\n", nm, in pr_stats()
273 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()
671 Value *V = simplifyInstruction(C, SQ); in rotateLoop()
1059 const SimplifyQuery &SQ, bool RotationOnly = true, in LoopRotation() argument
1062 LoopRotate LR(Threshold, LI, TTI, AC, DT, SE, MSSAU, SQ, RotationOnly, in LoopRotation()
H A DPromoteMemoryToRegister.cpp388 const SimplifyQuery SQ; member
442 AC(AC), SQ(DT.getRoot()->getDataLayout(), in PromoteMem2Reg()
832 if (rewriteSingleStoreAlloca(AI, Info, LBI, SQ.DL, DT, AC, in run()
844 promoteSingleBlockAlloca(AI, Info, LBI, SQ.DL, DT, AC, in run()
963 if (Value *V = simplifyInstruction(PN, SQ)) { in run()
1223 convertMetadataToAssumes(LI, V, SQ.DL, AC, &DT); in RenamePass()
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DLoopRotationUtils.h38 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 DInstCombineCalls.cpp1101 static std::optional<bool> getKnownSign(Value *Op, const SimplifyQuery &SQ) { in getKnownSign() argument
1102 KnownBits Known = computeKnownBits(Op, SQ); in getKnownSign()
1110 return isImpliedByDomCondition(ICmpInst::ICMP_SLT, X, Y, SQ.CxtI, SQ.DL); in getKnownSign()
1116 const SimplifyQuery &SQ) { in getKnownSignOrZero() argument
1117 if (std::optional<bool> Sign = getKnownSign(Op, SQ)) in getKnownSignOrZero()
1122 return isImpliedByDomCondition(ICmpInst::ICMP_SLE, X, Y, SQ.CxtI, SQ.DL); in getKnownSignOrZero()
1129 const SimplifyQuery &SQ) { in signBitMustBeTheSame() argument
1130 std::optional<bool> Known1 = getKnownSign(Op1, SQ); in signBitMustBeTheSame()
1133 std::optional<bool> Known0 = getKnownSign(Op0, SQ); in signBitMustBeTheSame()
1282 const SimplifyQuery &SQ) { in reassociateMinMaxWithConstants() argument
[all …]
H A DInstructionCombining.cpp480 if (Value *V = simplifyBinOp(Opcode, B, C, SQ.getWithInstruction(&I))) { in SimplifyAssociativeOrCommutative()
513 if (Value *V = simplifyBinOp(Opcode, A, B, SQ.getWithInstruction(&I))) { in SimplifyAssociativeOrCommutative()
541 if (Value *V = simplifyBinOp(Opcode, C, A, SQ.getWithInstruction(&I))) { in SimplifyAssociativeOrCommutative()
561 if (Value *V = simplifyBinOp(Opcode, C, A, SQ.getWithInstruction(&I))) { in SimplifyAssociativeOrCommutative()
695 static Value *tryFactorization(BinaryOperator &I, const SimplifyQuery &SQ, in tryFactorization() argument
718 V = simplifyBinOp(TopLevelOpcode, B, D, SQ.getWithInstruction(&I)); in tryFactorization()
738 V = simplifyBinOp(TopLevelOpcode, A, C, SQ.getWithInstruction(&I)); in tryFactorization()
1126 if (Value *V = tryFactorization(I, SQ, Builder, LHSOpcode, A, B, C, D)) in tryFactorizationFolds()
1134 tryFactorization(I, SQ, Builder, LHSOpcode, A, B, RHS, Ident)) in tryFactorizationFolds()
1142 tryFactorization(I, SQ, Builder, RHSOpcode, LHS, Ident, C, D)) in tryFactorizationFolds()
[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()
436 reassociateShiftAmtsOfTwoSameDirectionShifts(&I, SQ))) in commonShiftTransforms()
1042 const SimplifyQuery Q = SQ.getWithInstruction(&I); in visitShl()
1280 SQ.getWithInstruction(&I))) in visitLShr()
1602 const SimplifyQuery Q = SQ.getWithInstruction(&I); in visitLShr()
1712 SQ.getWithInstruction(&I))) in visitAShr()
1808 const SimplifyQuery Q = SQ.getWithInstruction(&I); in visitAShr()
H A DInstCombineSelect.cpp574 const SimplifyQuery &SQ) { in foldSelectICmpMinMax() argument
615 isKnownNonZero(CmpRHS, SQ)) { in foldSelectICmpMinMax()
1360 if (Value *V = simplifyWithOpReplaced(TrueVal, OldOp, NewOp, SQ, in foldSelectValueEquivalence()
1366 isGuaranteedNotToBeUndef(V, SQ.AC, &Sel, &DT)) in foldSelectValueEquivalence()
1376 if (isGuaranteedNotToBeUndef(NewOp, SQ.AC, &Sel, &DT)) in foldSelectValueEquivalence()
1390 isGuaranteedNotToBeUndef(NewOp, SQ.AC, &Sel, &DT)) in foldSelectValueEquivalence()
1414 if (simplifyWithOpReplaced(FalseVal, CmpLHS, CmpRHS, SQ, in foldSelectValueEquivalence()
1417 simplifyWithOpReplaced(FalseVal, CmpRHS, CmpLHS, SQ, in foldSelectValueEquivalence()
2017 if (Value *V = foldSelectICmpMinMax(ICI, TrueVal, FalseVal, Builder, SQ)) in foldSelectInstWithICmp()
3854 const SimplifyQuery &SQ) { in foldSelectBitTest() argument
[all …]
H A DInstCombineMulDivRem.cpp193 SQ.getWithInstruction(&I))) in visitMul()
956 SQ.getWithInstruction(&I))) in visitFMul()
990 ((I.hasNoInfs() && isKnownNeverNaN(Op0, SQ.getWithInstruction(&I))) || in visitFMul()
991 isKnownNeverNaN(&I, SQ.getWithInstruction(&I)))) { in visitFMul()
1673 SQ.getWithInstruction(&I))) in visitUDiv()
1753 SQ.getWithInstruction(&I))) in visitSDiv()
1854 if (isKnownNonNegative(Op1, SQ.getWithInstruction(&I))) { in visitSDiv()
2116 SQ.getWithInstruction(&I))) in visitFDiv()
2408 SQ.getWithInstruction(&I))) in visitURem()
2465 simplifyICmpInst(ICmpInst::ICMP_ULT, X, Op1, SQ.getWithInstruction(&I)); in visitURem()
[all …]
H A DInstCombineCompares.cpp1217 cast<BinaryOperator>(Val), SQ.getWithInstruction(Val), in foldSignBitTest()
1239 if (isKnownPositive(A, SQ.getWithInstruction(&Cmp))) in foldICmpWithZero()
1241 if (isKnownPositive(B, SQ.getWithInstruction(&Cmp))) in foldICmpWithZero()
1281 const SimplifyQuery Q = SQ.getWithInstruction(&Cmp); in foldICmpWithZero()
3243 const SimplifyQuery Q = SQ.getWithInstruction(&Cmp); in foldICmpAddConstant()
3691 const SimplifyQuery Q = SQ.getWithInstruction(&Cmp); in foldICmpBinOpEqualityWithConstant()
4208 const SimplifyQuery Q = SQ.getWithInstruction(&Cmp); in foldICmpIntrinsicWithConstant()
4340 if (Value *Res = simplifyICmpInst(Pred, Op, RHS, SQ)) in foldSelectICmp()
4709 foldShiftIntoShiftInAnotherHandOfAndInICmp(ICmpInst &I, const SimplifyQuery SQ, in foldShiftIntoShiftInAnotherHandOfAndInICmp() argument
4796 /*isNUW=*/false, SQ.getWithInstruction(&I))); in foldShiftIntoShiftInAnotherHandOfAndInICmp()
[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