Searched refs:SQ (Results 1 - 25 of 28) sorted by relevance

12

/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DInstSimplifyPass.cpp31 static bool runImpl(Function &F, const SimplifyQuery &SQ, argument
40 if (!SQ.DT->isReachableFromEntry(&BB))
56 if (Value *V = SimplifyInstruction(&I, SQ, ORE)) {
69 RecursivelyDeleteTriviallyDeadInstructions(DeadInstsInBB, SQ.TLI);
110 const SimplifyQuery SQ(DL, TLI, DT, AC);
111 return runImpl(F, SQ, ORE);
138 const SimplifyQuery SQ(DL, &TLI, &DT, &AC);
139 bool Changed = runImpl(F, SQ, &ORE);
H A DLoopRotation.cpp44 const SimplifyQuery SQ = getBestSimplifyQuery(AR, DL); local
51 SQ, false, Threshold, false);
99 const SimplifyQuery SQ = getBestSimplifyQuery(*this, F); variable
109 MSSAU.hasValue() ? MSSAU.getPointer() : nullptr, SQ,
H A DLoopInstSimplify.cpp55 SimplifyQuery SQ(DL, &TLI, &DT, &AC);
104 Value *V = SimplifyInstruction(&I, SQ.getWithInstruction(&I));
H A DCorrelatedValuePropagation.cpp213 const SimplifyQuery &SQ) {
267 if (Value *V = SimplifyInstruction(P, SQ)) {
831 const SimplifyQuery &SQ) {
847 BBChanged |= processPHI(cast<PHINode>(II), LVI, DT, SQ);
212 processPHI(PHINode *P, LazyValueInfo *LVI, DominatorTree *DT, const SimplifyQuery &SQ) argument
830 runImpl(Function &F, LazyValueInfo *LVI, DominatorTree *DT, const SimplifyQuery &SQ) argument
H A DEarlyCSE.cpp486 const SimplifyQuery SQ; member in class:__anon2669::EarlyCSE
567 : TLI(TLI), TTI(TTI), DT(DT), AC(AC), SQ(DL, &TLI, &DT, &AC), MSSA(MSSA),
1037 if (Value *V = SimplifyInstruction(Inst, SQ)) {
H A DNewGVN.cpp506 const SimplifyQuery SQ;
663 SQ(DL, TLI, DT, AC, /*CtxI=*/nullptr, /*UseInstrInfo=*/false) {}
1057 Value *V = SimplifyBinOp(Opcode, E->getOperand(0), E->getOperand(1), SQ);
1154 SimplifyCmpInst(Predicate, E->getOperand(0), E->getOperand(1), SQ);
1163 E->getOperand(2), SQ);
1169 SimplifyBinOp(E->getOpcode(), E->getOperand(0), E->getOperand(1), SQ);
1174 SimplifyCastInst(CI->getOpcode(), E->getOperand(0), CI->getType(), SQ);
1179 E->getType(), ArrayRef<Value *>(E->op_begin(), E->op_end()), SQ);
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DLoopRotationUtils.h35 MemorySSAUpdater *MSSAU, const SimplifyQuery &SQ,
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Support/
H A DYAMLTraits.cpp209 if (SequenceHNode *SQ = dyn_cast<SequenceHNode>(CurrentNode))
210 return SQ->Entries.size();
229 if (SequenceHNode *SQ = dyn_cast<SequenceHNode>(CurrentNode)) {
231 CurrentNode = SQ->Entries[Index].get();
246 if (SequenceHNode *SQ = dyn_cast<SequenceHNode>(CurrentNode)) {
248 CurrentNode = SQ->Entries[index].get();
292 if (SequenceHNode *SQ = dyn_cast<SequenceHNode>(CurrentNode)) {
293 BitValuesUsed.insert(BitValuesUsed.begin(), SQ->Entries.size(), false);
304 if (SequenceHNode *SQ = dyn_cast<SequenceHNode>(CurrentNode)) {
306 for (auto &N : SQ
[all...]
H A DAPInt.cpp2996 APInt SQ = D.sqrt();
2998 APInt Q = SQ * SQ;
3000 // The calculated SQ may actually be greater than the exact (non-integer)
3001 // value. If that's the case, decrement SQ to get a value that is lower.
3003 SQ -= 1;
3008 // SQ is rounded down (i.e SQ * SQ <= D), so the roots may be inexact.
3010 // may be greater than the exact one, since we would be subtracting SQ
[all...]
/freebsd-11-stable/contrib/unbound/daemon/
H A Dremote.c102 #ifdef SQ
103 #undef SQ macro
107 #define SQ "=" macro
699 if(!ssl_printf(ssl, "%s.num.queries"SQ"%lu\n", nm,
701 if(!ssl_printf(ssl, "%s.num.queries_ip_ratelimited"SQ"%lu\n", nm,
703 if(!ssl_printf(ssl, "%s.num.cachehits"SQ"%lu\n", nm,
706 if(!ssl_printf(ssl, "%s.num.cachemiss"SQ"%lu\n", nm,
708 if(!ssl_printf(ssl, "%s.num.prefetch"SQ"%lu\n", nm,
710 if(!ssl_printf(ssl, "%s.num.expired"SQ"%lu\n", nm,
712 if(!ssl_printf(ssl, "%s.num.recursivereplies"SQ"
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/MCA/HardwareUnits/
H A DLSUnit.h421 LSUnit(const MCSchedModel &SM, unsigned LQ, unsigned SQ) argument
422 : LSUnit(SM, LQ, SQ, /* NoAlias */ false) {}
423 LSUnit(const MCSchedModel &SM, unsigned LQ, unsigned SQ, bool AssumeNoAlias) argument
424 : LSUnitBase(SM, LQ, SQ, AssumeNoAlias), CurrentLoadGroupID(0),
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DLoopRotationUtils.cpp59 const SimplifyQuery &SQ; member in class:__anon2781::LoopRotate
67 const SimplifyQuery &SQ, bool RotationOnly, bool IsUtilMode)
69 MSSAU(MSSAU), SQ(SQ), RotationOnly(RotationOnly),
365 Value *V = SimplifyInstruction(C, SQ);
667 const SimplifyQuery &SQ, bool RotationOnly = true,
672 LoopRotate LR(Threshold, LI, TTI, AC, DT, SE, MSSAU, SQ, RotationOnly,
64 LoopRotate(unsigned MaxHeaderSize, LoopInfo *LI, const TargetTransformInfo *TTI, AssumptionCache *AC, DominatorTree *DT, ScalarEvolution *SE, MemorySSAUpdater *MSSAU, const SimplifyQuery &SQ, bool RotationOnly, bool IsUtilMode) argument
664 LoopRotation(Loop *L, LoopInfo *LI, const TargetTransformInfo *TTI, AssumptionCache *AC, DominatorTree *DT, ScalarEvolution *SE, MemorySSAUpdater *MSSAU, const SimplifyQuery &SQ, bool RotationOnly = true, unsigned Threshold = unsigned(-1), bool IsUtilMode = true) argument
H A DPromoteMemoryToRegister.cpp235 const SimplifyQuery SQ; member in struct:__anon3231::PromoteMem2Reg
272 AC(AC), SQ(DT.getRoot()->getParent()->getParent()->getDataLayout(),
566 if (rewriteSingleStoreAlloca(AI, Info, LBI, SQ.DL, DT, AC)) {
577 promoteSingleBlockAlloca(AI, Info, LBI, SQ.DL, DT, AC)) {
694 if (Value *V = SimplifyInstruction(PN, SQ)) {
950 !isKnownNonZero(V, SQ.DL, 0, AC, LI, &DT))
/freebsd-11-stable/contrib/unbound/smallapp/
H A Dunbound-control.c181 #define SQ "=" macro
204 #define PR_UL_NM(str, var) printf("%s."str SQ"%lu\n", nm, (unsigned long)(var));
205 #define PR_UL(str, var) printf(str SQ"%lu\n", (unsigned long)(var));
206 #define PR_UL_SUB(str, nm, var) printf(str".%s"SQ"%lu\n", nm, (unsigned long)(var));
207 #define PR_TIMEVAL(str, var) printf(str SQ ARG_LL "d.%6.6d\n", \
209 #define PR_STATSTIME(str, var) printf(str SQ ARG_LL "d.%6.6d\n", \
211 #define PR_LL(str, var) printf(str SQ ARG_LL"d\n", (long long)(var));
233 printf("%s.requestlist.avg"SQ"%g\n", nm,
250 printf("%s.recursion.time.median"SQ"%g\n", nm, s->mesh_time_median);
/freebsd-11-stable/contrib/llvm-project/llvm/lib/MCA/HardwareUnits/
H A DLSUnit.cpp24 LSUnitBase::LSUnitBase(const MCSchedModel &SM, unsigned LQ, unsigned SQ, argument
26 : LQSize(LQ), SQSize(SQ), UsedLQEntries(0), UsedSQEntries(0),
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/InstCombine/
H A DInstCombineMulDivRem.cpp173 SQ.getWithInstruction(&I)))
396 SQ.getWithInstruction(&I)))
956 SQ.getWithInstruction(&I)))
1050 SQ.getWithInstruction(&I)))
1205 SQ.getWithInstruction(&I)))
1355 SQ.getWithInstruction(&I)))
1406 SQ.getWithInstruction(&I)))
1485 SQ.getWithInstruction(&I)))
H A DInstCombineInternal.h326 const SimplifyQuery SQ; member in class:llvm::InstCombiner
345 DL(DL), SQ(DL, &TLI, &DT, &AC), ORE(ORE), BFI(BFI), PSI(PSI), LI(LI) {}
395 BinaryOperator *Sh0, const SimplifyQuery &SQ,
924 Instruction *foldICmpBinOp(ICmpInst &Cmp, const SimplifyQuery &SQ);
H A DInstructionCombining.cpp351 if (Value *V = SimplifyBinOp(Opcode, B, C, SQ.getWithInstruction(&I))) {
384 if (Value *V = SimplifyBinOp(Opcode, A, B, SQ.getWithInstruction(&I))) {
412 if (Value *V = SimplifyBinOp(Opcode, C, A, SQ.getWithInstruction(&I))) {
432 if (Value *V = SimplifyBinOp(Opcode, C, A, SQ.getWithInstruction(&I))) {
578 V = SimplifyBinOp(TopLevelOpcode, B, D, SQ.getWithInstruction(&I));
597 V = SimplifyBinOp(TopLevelOpcode, A, C, SQ.getWithInstruction(&I));
704 Value *L = SimplifyBinOp(TopLevelOpcode, A, C, SQ.getWithInstruction(&I));
705 Value *R = SimplifyBinOp(TopLevelOpcode, B, C, SQ.getWithInstruction(&I));
741 Value *L = SimplifyBinOp(TopLevelOpcode, A, B, SQ.getWithInstruction(&I));
742 Value *R = SimplifyBinOp(TopLevelOpcode, A, C, SQ
[all...]
H A DInstCombineShifts.cpp35 BinaryOperator *Sh0, const SimplifyQuery &SQ,
105 SQ.getWithInstruction(Sh0)));
389 reassociateShiftAmtsOfTwoSameDirectionShifts(&I, SQ)))
926 const SimplifyQuery Q = SQ.getWithInstruction(&I);
1049 SQ.getWithInstruction(&I)))
1247 SQ.getWithInstruction(&I)))
34 reassociateShiftAmtsOfTwoSameDirectionShifts( BinaryOperator *Sh0, const SimplifyQuery &SQ, bool AnalyzeForSignBitExtraction) argument
H A DInstCombineAddSub.cpp1208 SQ.getWithInstruction(&I)))
1476 SQ.getWithInstruction(&I)))
1682 SQ.getWithInstruction(&I)))
2158 SQ.getWithInstruction(&I)))
2180 SQ.getWithInstruction(&I)))
2207 if (I.hasNoSignedZeros() || CannotBeNegativeZero(Op0, SQ.TLI)) {
H A DInstCombineAndOrXor.cpp1147 const SimplifyQuery Q = SQ.getWithInstruction(&CxtI);
1725 SQ.getWithInstruction(&I)))
2189 const SimplifyQuery Q = SQ.getWithInstruction(&CxtI);
2450 SQ.getWithInstruction(&I)))
2851 if (Value *OrICmp = SimplifyBinOp(Instruction::Or, LHS, RHS, SQ)) {
2854 if (Value *AndICmp = SimplifyBinOp(Instruction::And, LHS, RHS, SQ)) {
2968 SQ.getWithInstruction(&I)))
H A DInstCombineCompares.cpp1379 cast<BinaryOperator>(Val), SQ.getWithInstruction(Val),
3470 foldShiftIntoShiftInAnotherHandOfAndInICmp(ICmpInst &I, const SimplifyQuery SQ, argument
3557 /*isNUW=*/false, SQ.getWithInstruction(&I)));
3572 auto CanFold = [NewShAmt, WidestBitWidth, NarrowestShift, SQ,
3588 KnownBits Known = computeKnownBits(C, SQ.DL);
3599 KnownBits Known = computeKnownBits(C, SQ.DL);
3702 Instruction *InstCombiner::foldICmpBinOp(ICmpInst &I, const SimplifyQuery &SQ) { argument
3703 const SimplifyQuery Q = SQ.getWithInstruction(&I);
4063 if (Value *V = foldShiftIntoShiftInAnotherHandOfAndInICmp(I, SQ, Builder))
5456 const SimplifyQuery Q = SQ
[all...]
H A DInstCombineVectorOps.cpp323 SQ.getWithInstruction(&EI)))
1032 VecOp, ScalarOp, IdxOp, SQ.getWithInstruction(&IE)))
1905 LHS, RHS, SVI.getMask(), SVI.getType(), SQ.getWithInstruction(&SVI)))
H A DInstCombinePHI.cpp1140 if (Value *V = SimplifyInstruction(&PN, SQ.getWithInstruction(&PN)))
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DCodeGenPrepare.cpp3093 const SimplifyQuery &SQ; member in class:__anon1701::SimplificationTracker
3102 : SQ(sq) {}
3122 if (Value *V = SimplifyInstruction(cast<Instruction>(PI), SQ)) {
3200 const SimplifyQuery &SQ; member in class:__anon1701::AddressingModeCombiner
3207 : CommonType(nullptr), SQ(_SQ), Original(OriginalValue) {}
3311 Type *IntPtrTy = SQ.DL.getIntPtrType(AddrModes[0].OriginalValue->getType());
3361 SimplificationTracker ST(SQ);
4788 const SimplifyQuery SQ(*DL, TLInfo);
4789 AddressingModeCombiner AddrModes(SQ, Addr);

Completed in 321 milliseconds

12