Home
last modified time | relevance | path

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

12

/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
DInstSimplifyPass.cpp33 static bool runImpl(Function &F, const SimplifyQuery &SQ, in runImpl() argument
42 if (!SQ.DT->isReachableFromEntry(&BB)) in runImpl()
58 if (Value *V = SimplifyInstruction(&I, SQ, ORE)) { in runImpl()
71 RecursivelyDeleteTriviallyDeadInstructions(DeadInstsInBB, SQ.TLI); in runImpl()
112 const SimplifyQuery SQ(DL, TLI, DT, AC); in runOnFunction() local
113 return runImpl(F, SQ, ORE); in runOnFunction()
140 const SimplifyQuery SQ(DL, &TLI, &DT, &AC); in run() local
141 bool Changed = runImpl(F, SQ, &ORE); in run()
DLoopDeletion.cpp179 const SimplifyQuery &SQ) { in getValueOnFirstIteration() argument
190 getValueOnFirstIteration(BO->getOperand(0), FirstIterValue, SQ); in getValueOnFirstIteration()
192 getValueOnFirstIteration(BO->getOperand(1), FirstIterValue, SQ); in getValueOnFirstIteration()
193 FirstIterV = SimplifyBinOp(BO->getOpcode(), LHS, RHS, SQ); in getValueOnFirstIteration()
290 const SimplifyQuery SQ(DL); in canProveExitOnFirstIteration() local
311 getValueOnFirstIteration(Incoming, FirstIterValue, SQ); in canProveExitOnFirstIteration()
329 LHS = getValueOnFirstIteration(LHS, FirstIterValue, SQ); in canProveExitOnFirstIteration()
330 RHS = getValueOnFirstIteration(RHS, FirstIterValue, SQ); in canProveExitOnFirstIteration()
331 auto *KnownCondition = SimplifyICmpInst(Pred, LHS, RHS, SQ); in canProveExitOnFirstIteration()
366 getValueOnFirstIteration(SwitchValue, FirstIterValue, SQ); in canProveExitOnFirstIteration()
DLoopRotation.cpp58 const SimplifyQuery SQ = getBestSimplifyQuery(AR, DL); in run() local
65 MSSAU.hasValue() ? MSSAU.getPointer() : nullptr, SQ, false, in run()
122 const SimplifyQuery SQ = getBestSimplifyQuery(*this, F); in runOnLoop() local
139 MSSAU.hasValue() ? MSSAU.getPointer() : nullptr, SQ, in runOnLoop()
DLoopInstSimplify.cpp55 SimplifyQuery SQ(DL, &TLI, &DT, &AC); in simplifyLoopInst() local
104 Value *V = SimplifyInstruction(&I, SQ.getWithInstruction(&I)); in simplifyLoopInst()
DCorrelatedValuePropagation.cpp212 const SimplifyQuery &SQ) { in processPHI() argument
266 if (Value *V = SimplifyInstruction(P, SQ)) { in processPHI()
1017 const SimplifyQuery &SQ) { in runImpl() argument
1033 BBChanged |= processPHI(cast<PHINode>(II), LVI, DT, SQ); in runImpl()
DNewGVN.cpp508 const SimplifyQuery SQ; member in __anon2807e6e00211::NewGVN
665 SQ(DL, TLI, DT, AC, /*CtxI=*/nullptr, /*UseInstrInfo=*/false, in NewGVN()
1090 Value *V = SimplifyBinOp(Opcode, E->getOperand(0), E->getOperand(1), SQ); in createBinaryExpression()
1174 SimplifyCmpInst(Predicate, E->getOperand(0), E->getOperand(1), SQ); in createExpression()
1183 E->getOperand(2), SQ); in createExpression()
1189 SimplifyBinOp(E->getOpcode(), E->getOperand(0), E->getOperand(1), SQ); in createExpression()
1194 SimplifyCastInst(CI->getOpcode(), E->getOperand(0), CI->getType(), SQ); in createExpression()
1199 E->getType(), ArrayRef<Value *>(E->op_begin(), E->op_end()), SQ); in createExpression()
DEarlyCSE.cpp524 const SimplifyQuery SQ; member in __anon8faea6230311::EarlyCSE
605 : TLI(TLI), TTI(TTI), DT(DT), AC(AC), SQ(DL, &TLI, &DT, &AC), MSSA(MSSA), in EarlyCSE()
1328 if (Value *V = SimplifyInstruction(&Inst, SQ)) { in processNode()
/freebsd-12-stable/contrib/unbound/daemon/
Dremote.c103 #ifdef SQ
104 #undef SQ
108 #define SQ "=" macro
673 if(!ssl_printf(ssl, "%s.num.queries"SQ"%lu\n", nm, in print_stats()
675 if(!ssl_printf(ssl, "%s.num.queries_ip_ratelimited"SQ"%lu\n", nm, in print_stats()
677 if(!ssl_printf(ssl, "%s.num.queries_cookie_valid"SQ"%lu\n", nm, in print_stats()
679 if(!ssl_printf(ssl, "%s.num.queries_cookie_client"SQ"%lu\n", nm, in print_stats()
681 if(!ssl_printf(ssl, "%s.num.queries_cookie_invalid"SQ"%lu\n", nm, in print_stats()
683 if(!ssl_printf(ssl, "%s.num.cachehits"SQ"%lu\n", nm, in print_stats()
686 if(!ssl_printf(ssl, "%s.num.cachemiss"SQ"%lu\n", nm, in print_stats()
[all …]
/freebsd-12-stable/contrib/file/magic/Magdir/
Dsoftquad10 0 string \<!SQ\ DTD> Compiled SGML rules file
12 0 string \<!SQ\ A/E> A/E SGML Document binary
14 0 string \<!SQ\ STS> A/E SGML binary styles file
23 0 search/1 SQ\ BITMAP1 SoftQuad Raster Format text
24 #0 string SQ\ BITMAP2 SoftQuad Raster Format data
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Support/
DYAMLTraits.cpp219 if (SequenceHNode *SQ = dyn_cast<SequenceHNode>(CurrentNode)) in beginSequence() local
220 return SQ->Entries.size(); in beginSequence()
239 if (SequenceHNode *SQ = dyn_cast<SequenceHNode>(CurrentNode)) { in preflightElement() local
241 CurrentNode = SQ->Entries[Index].get(); in preflightElement()
256 if (SequenceHNode *SQ = dyn_cast<SequenceHNode>(CurrentNode)) { in preflightFlowElement() local
258 CurrentNode = SQ->Entries[index].get(); in preflightFlowElement()
302 if (SequenceHNode *SQ = dyn_cast<SequenceHNode>(CurrentNode)) { in beginBitSetScalar() local
303 BitValuesUsed.insert(BitValuesUsed.begin(), SQ->Entries.size(), false); in beginBitSetScalar()
314 if (SequenceHNode *SQ = dyn_cast<SequenceHNode>(CurrentNode)) { in bitSetMatch() local
316 for (auto &N : SQ->Entries) { in bitSetMatch()
[all …]
DAPInt.cpp2991 APInt SQ = D.sqrt(); in SolveQuadraticEquationWrap() local
2993 APInt Q = SQ * SQ; in SolveQuadraticEquationWrap()
2998 SQ -= 1; in SolveQuadraticEquationWrap()
3010 APInt::sdivrem(-B - (SQ+InexactSQ), TwoA, X, Rem); in SolveQuadraticEquationWrap()
3012 APInt::sdivrem(-B + SQ, TwoA, X, Rem); in SolveQuadraticEquationWrap()
3024 assert((SQ*SQ).sle(D) && "SQ = |_sqrt(D)_|, so SQ*SQ <= D"); in SolveQuadraticEquationWrap()
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/MCA/HardwareUnits/
DLSUnit.h448 LSUnit(const MCSchedModel &SM, unsigned LQ, unsigned SQ) in LSUnit() argument
449 : LSUnit(SM, LQ, SQ, /* NoAlias */ false) {} in LSUnit()
450 LSUnit(const MCSchedModel &SM, unsigned LQ, unsigned SQ, bool AssumeNoAlias) in LSUnit() argument
451 : LSUnitBase(SM, LQ, SQ, AssumeNoAlias), CurrentLoadGroupID(0), in LSUnit()
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/
DLoopRotationUtils.cpp70 const SimplifyQuery &SQ; member in __anonba9b9a210111::LoopRotate
79 const SimplifyQuery &SQ, bool RotationOnly, bool IsUtilMode, in LoopRotate() argument
82 MSSAU(MSSAU), SQ(SQ), RotationOnly(RotationOnly), in LoopRotate()
453 Value *V = SimplifyInstruction(C, SQ); in rotateLoop()
833 const SimplifyQuery &SQ, bool RotationOnly = true, in LoopRotation() argument
836 LoopRotate LR(Threshold, LI, TTI, AC, DT, SE, MSSAU, SQ, RotationOnly, in LoopRotation()
DPromoteMemoryToRegister.cpp232 const SimplifyQuery SQ; member
269 AC(AC), SQ(DT.getRoot()->getParent()->getParent()->getDataLayout(), in PromoteMem2Reg()
580 if (rewriteSingleStoreAlloca(AI, Info, LBI, SQ.DL, DT, AC)) { in run()
591 promoteSingleBlockAlloca(AI, Info, LBI, SQ.DL, DT, AC)) { in run()
705 if (Value *V = SimplifyInstruction(PN, SQ)) { in run()
962 !isKnownNonZero(V, SQ.DL, 0, AC, LI, &DT)) in RenamePass()
/freebsd-12-stable/contrib/unbound/smallapp/
Dunbound-control.c189 #define SQ "=" macro
191 #define PR_UL_NM(str, var) printf("%s."str SQ"%lu\n", nm, (unsigned long)(var));
192 #define PR_UL(str, var) printf(str SQ"%lu\n", (unsigned long)(var));
193 #define PR_UL_SUB(str, nm, var) printf(str".%s"SQ"%lu\n", nm, (unsigned long)(var));
194 #define PR_TIMEVAL(str, var) printf(str SQ ARG_LL "d.%6.6d\n", \
196 #define PR_STATSTIME(str, var) printf(str SQ ARG_LL "d.%6.6d\n", \
198 #define PR_LL(str, var) printf(str SQ ARG_LL"d\n", (long long)(var));
228 printf("%s.requestlist.avg"SQ"%g\n", nm, in pr_stats()
245 printf("%s.recursion.time.median"SQ"%g\n", nm, s->mesh_time_median); in pr_stats()
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
DLoopRotationUtils.h35 MemorySSAUpdater *MSSAU, const SimplifyQuery &SQ,
/freebsd-12-stable/contrib/llvm-project/llvm/lib/MCA/HardwareUnits/
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-12-stable/contrib/llvm-project/llvm/include/llvm/Transforms/InstCombine/
DInstCombiner.h72 const SimplifyQuery SQ; variable
92 SQ(DL, &TLI, &DT, &AC), ORE(ORE), BFI(BFI), PSI(PSI), LI(LI) {} in InstCombiner()
371 const SimplifyQuery &getSimplifyQuery() const { return SQ; } in getSimplifyQuery()
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/InstCombine/
DInstCombineMulDivRem.cpp144 SQ.getWithInstruction(&I))) in visitMul()
431 SQ.getWithInstruction(&I))) in visitFMul()
1009 SQ.getWithInstruction(&I))) in visitUDiv()
1103 SQ.getWithInstruction(&I))) in visitSDiv()
1331 SQ.getWithInstruction(&I))) in visitFDiv()
1477 SQ.getWithInstruction(&I))) in visitURem()
1528 SQ.getWithInstruction(&I))) in visitSRem()
1601 SQ.getWithInstruction(&I))) in visitFRem()
DInstCombineShifts.cpp60 BinaryOperator *Sh0, const SimplifyQuery &SQ, in reassociateShiftAmtsOfTwoSameDirectionShifts() argument
112 SQ.getWithInstruction(Sh0))); in reassociateShiftAmtsOfTwoSameDirectionShifts()
398 reassociateShiftAmtsOfTwoSameDirectionShifts(&I, SQ))) in commonShiftTransforms()
892 const SimplifyQuery Q = SQ.getWithInstruction(&I); in visitShl()
1040 SQ.getWithInstruction(&I))) in visitLShr()
1266 SQ.getWithInstruction(&I))) in visitAShr()
DInstructionCombining.cpp411 if (Value *V = SimplifyBinOp(Opcode, B, C, SQ.getWithInstruction(&I))) { in SimplifyAssociativeOrCommutative()
444 if (Value *V = SimplifyBinOp(Opcode, A, B, SQ.getWithInstruction(&I))) { in SimplifyAssociativeOrCommutative()
472 if (Value *V = SimplifyBinOp(Opcode, C, A, SQ.getWithInstruction(&I))) { in SimplifyAssociativeOrCommutative()
492 if (Value *V = SimplifyBinOp(Opcode, C, A, SQ.getWithInstruction(&I))) { in SimplifyAssociativeOrCommutative()
639 V = SimplifyBinOp(TopLevelOpcode, B, D, SQ.getWithInstruction(&I)); in tryFactorization()
658 V = SimplifyBinOp(TopLevelOpcode, A, C, SQ.getWithInstruction(&I)); in tryFactorization()
766 auto SQDistributive = SQ.getWithInstruction(&I).getWithoutUndef(); in SimplifyUsingDistributiveLaws()
805 auto SQDistributive = SQ.getWithInstruction(&I).getWithoutUndef(); in SimplifyUsingDistributiveLaws()
857 SimplifyQuery Q = SQ.getWithInstruction(&I); in SimplifySelectsFeedingBinaryOp()
1899 if (Value *V = SimplifyGEPInst(GEPEltType, Ops, SQ.getWithInstruction(&GEP))) in visitGetElementPtrInst()
[all …]
DInstCombineSelect.cpp1144 isGuaranteedNotToBeUndefOrPoison(CmpRHS, SQ.AC, &Sel, &DT)) { in foldSelectValueEquivalence()
1145 if (Value *V = simplifyWithOpReplaced(TrueVal, CmpLHS, CmpRHS, SQ, in foldSelectValueEquivalence()
1166 isGuaranteedNotToBeUndefOrPoison(CmpLHS, SQ.AC, &Sel, &DT)) in foldSelectValueEquivalence()
1167 if (Value *V = simplifyWithOpReplaced(TrueVal, CmpRHS, CmpLHS, SQ, in foldSelectValueEquivalence()
1198 if (simplifyWithOpReplaced(FalseVal, CmpLHS, CmpRHS, SQ, in foldSelectValueEquivalence()
1200 simplifyWithOpReplaced(FalseVal, CmpRHS, CmpLHS, SQ, in foldSelectValueEquivalence()
2649 SQ.getWithInstruction(&SI))) in visitSelectInst()
2733 if (Value *S = simplifyWithOpReplaced(TrueVal, CondVal, One, SQ, in visitSelectInst()
2736 if (Value *S = simplifyWithOpReplaced(FalseVal, CondVal, Zero, SQ, in visitSelectInst()
3240 if (Value *V = SimplifyAndInst(CondVal, Mask, SQ.getWithInstruction(&SI))) in visitSelectInst()
DInstCombineInternal.h112 BinaryOperator *Sh0, const SimplifyQuery &SQ,
654 Instruction *foldICmpBinOp(ICmpInst &Cmp, const SimplifyQuery &SQ);
/freebsd-12-stable/contrib/sendmail/contrib/
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
/freebsd-12-stable/contrib/unbound/dnstap/
Ddnstap.proto77 // | Stub |-SQ--------CQ->| Recursive|-RQ----AQ->| Auth. |
88 // SQ: STUB_QUERY

12