/openbsd/gnu/llvm/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() 95 return simplifyInsertValueInst(Agg, Val, IdxList, SQ); in FoldInsertValue() [all …]
|
/openbsd/gnu/llvm/llvm/lib/Transforms/Scalar/ |
H A D | InstSimplifyPass.cpp | 29 static bool runImpl(Function &F, const SimplifyQuery &SQ, in runImpl() argument 38 if (!SQ.DT->isReachableFromEntry(&BB)) in runImpl() 54 if (Value *V = simplifyInstruction(&I, SQ, ORE)) { in runImpl() 67 RecursivelyDeleteTriviallyDeadInstructions(DeadInstsInBB, SQ.TLI); in runImpl() 108 const SimplifyQuery SQ(DL, TLI, DT, AC); in runOnFunction() local 109 return runImpl(F, SQ, ORE); in runOnFunction() 136 const SimplifyQuery SQ(DL, &TLI, &DT, &AC); in run() local 137 bool Changed = runImpl(F, SQ, &ORE); in run()
|
H A D | LoopDeletion.cpp | 180 const SimplifyQuery &SQ) { in getValueOnFirstIteration() argument 191 getValueOnFirstIteration(BO->getOperand(0), FirstIterValue, SQ); in getValueOnFirstIteration() 193 getValueOnFirstIteration(BO->getOperand(1), FirstIterValue, SQ); in getValueOnFirstIteration() 194 FirstIterV = simplifyBinOp(BO->getOpcode(), LHS, RHS, SQ); in getValueOnFirstIteration() 197 getValueOnFirstIteration(Cmp->getOperand(0), FirstIterValue, SQ); in getValueOnFirstIteration() 199 getValueOnFirstIteration(Cmp->getOperand(1), FirstIterValue, SQ); in getValueOnFirstIteration() 200 FirstIterV = simplifyICmpInst(Cmp->getPredicate(), LHS, RHS, SQ); in getValueOnFirstIteration() 207 FirstIterV = getValueOnFirstIteration(Selected, FirstIterValue, SQ); in getValueOnFirstIteration() 305 const SimplifyQuery SQ(DL); in canProveExitOnFirstIteration() local 326 getValueOnFirstIteration(Incoming, FirstIterValue, SQ); in canProveExitOnFirstIteration() [all …]
|
H A D | LoopRotation.cpp | 57 const SimplifyQuery SQ = getBestSimplifyQuery(AR, DL); in run() local 63 MSSAU ? &*MSSAU : nullptr, SQ, false, Threshold, in run() 119 const SimplifyQuery SQ = getBestSimplifyQuery(*this, F); in runOnLoop() local 133 return LoopRotation(L, LI, TTI, AC, &DT, &SE, MSSAU ? &*MSSAU : nullptr, SQ, in runOnLoop()
|
H A D | LoopInstSimplify.cpp | 51 SimplifyQuery SQ(DL, &TLI, &DT, &AC); in simplifyLoopInst() local 100 Value *V = simplifyInstruction(&I, SQ.getWithInstruction(&I)); in simplifyLoopInst()
|
/openbsd/usr.sbin/unbound/daemon/ |
H A D | remote.c | 107 #ifdef SQ 108 #undef SQ 112 #define SQ "=" macro 759 if(!ssl_printf(ssl, "%s.tcpusage"SQ"%lu\n", nm, in print_stats() 860 if(!print_longnum(ssl, "mem.streamwait"SQ, in print_mem() 985 if(!ssl_printf(ssl, "num.query.tcp"SQ"%lu\n", in print_ext() 991 if(!ssl_printf(ssl, "num.query.tls"SQ"%lu\n", in print_ext() 995 if(!ssl_printf(ssl, "num.query.ipv6"SQ"%lu\n", in print_ext() 997 if(!ssl_printf(ssl, "num.query.https"SQ"%lu\n", in print_ext() 1059 if(!ssl_printf(ssl, "msg.cache.count"SQ"%u\n", in print_ext() [all …]
|
/openbsd/usr.bin/file/magdir/ |
H A D | softquad | 10 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
|
/openbsd/gnu/llvm/llvm/lib/Support/ |
H A D | YAMLTraits.cpp | 218 if (SequenceHNode *SQ = dyn_cast<SequenceHNode>(CurrentNode)) in beginSequence() local 219 return SQ->Entries.size(); in beginSequence() 240 CurrentNode = SQ->Entries[Index].get(); in preflightElement() 257 CurrentNode = SQ->Entries[index].get(); in preflightFlowElement() 302 BitValuesUsed.resize(SQ->Entries.size()); in beginBitSetScalar() 315 for (auto &N : SQ->Entries) { in bitSetMatch() 336 assert(BitValuesUsed.size() == SQ->Entries.size()); in endBitSetScalar() 337 for (unsigned i = 0; i < SQ->Entries.size(); ++i) { in endBitSetScalar() 339 setError(SQ->Entries[i].get(), "unknown bit value"); in endBitSetScalar() 410 } else if (SequenceNode *SQ = dyn_cast<SequenceNode>(N)) { in createHNodes() local [all …]
|
/openbsd/regress/usr.bin/mandoc/mdoc/Sq/ |
H A D | empty.out_ascii | 1 SQ-EMPTY(1) General Commands Manual SQ-EMPTY(1)
|
H A D | empty.out_markdown | 1 SQ-EMPTY(1) - General Commands Manual
|
/openbsd/gnu/llvm/llvm/include/llvm/MCA/HardwareUnits/ |
H A D | LSUnit.h | 448 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()
|
/openbsd/gnu/llvm/llvm/lib/Transforms/Utils/ |
H A D | LoopRotationUtils.cpp | 63 const SimplifyQuery &SQ; member in __anonc14e6e560111::LoopRotate 72 const SimplifyQuery &SQ, bool RotationOnly, bool IsUtilMode, in LoopRotate() argument 75 MSSAU(MSSAU), SQ(SQ), RotationOnly(RotationOnly), in LoopRotate() 454 Value *V = simplifyInstruction(C, SQ); in rotateLoop() 839 const SimplifyQuery &SQ, bool RotationOnly = true, in LoopRotation() argument 842 LoopRotate LR(Threshold, LI, TTI, AC, DT, SE, MSSAU, SQ, RotationOnly, in LoopRotation()
|
H A D | PromoteMemoryToRegister.cpp | 302 const SimplifyQuery SQ; member 343 AC(AC), SQ(DT.getRoot()->getParent()->getParent()->getDataLayout(), in PromoteMem2Reg() 671 if (rewriteSingleStoreAlloca(AI, Info, LBI, SQ.DL, DT, AC)) { in run() 682 promoteSingleBlockAlloca(AI, Info, LBI, SQ.DL, DT, AC)) { in run() 800 if (Value *V = simplifyInstruction(PN, SQ)) { in run() 1053 convertMetadataToAssumes(LI, V, SQ.DL, AC, &DT); in RenamePass()
|
/openbsd/usr.sbin/unbound/smallapp/ |
H A D | unbound-control.c | 201 #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()
|
/openbsd/gnu/llvm/llvm/include/llvm/Transforms/Utils/ |
H A D | LoopRotationUtils.h | 35 MemorySSAUpdater *MSSAU, const SimplifyQuery &SQ,
|
/openbsd/regress/lib/libcrypto/x509/bettertls/certificates/ |
H A D | 2956.crt | 20 ztrtOCtTKuaZ8lltAsQBFzuIW5OOPA1nc7N5XJiWuBrUc/QGEjAlXLBEJqtjw+SQ
|
H A D | 1669.crt | 20 ISvsnUYvN1+HN2ZnTpEzevPyKiYx/SQ/xllb9xPaGWtZ9aq2Gkd383R9niOV3z36
|
H A D | 284.key | 25 hRgRUWxw1lZtr59c7ltMJO/SQ/dPPfO3/h+Q/QqsKjlqHa39mxlCIYsoY1nxruV+
|
H A D | 1972.key | 18 jRns2RCqtbLebsSSebWSUwe5iTUfbZR6nkyxODsCgYAMRFIImz42M6boydnC/2SQ
|
H A D | 1293.chain | 35 SQ/+cyGgWCm3inXBYkffwSdHGXQGa3uPz3nO0U824GGb8wqQA/fQLU2NK5yUrJR/
|
H A D | 3376.chain | 44 0oQBOnZLEtzeiLbB20ipLYE/3XS6Twi+SQ+8hvZiW8AZf28Z0AI6waNfmGmHuv1y
|
H A D | 271.chain | 46 SQ==
|
H A D | 1510.chain | 20 omeijkW7ArAy/SQ+LEqH20HIj22ZexJp1e8++H3+sZbTQKHXbEpOApbEPXbgwB17
|
/openbsd/gnu/llvm/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()
|
/openbsd/gnu/llvm/llvm/include/llvm/Transforms/InstCombine/ |
H A D | InstCombiner.h | 74 const SimplifyQuery SQ; variable 94 SQ(DL, &TLI, &DT, &AC), ORE(ORE), BFI(BFI), PSI(PSI), LI(LI) {} in InstCombiner() 373 const SimplifyQuery &getSimplifyQuery() const { return SQ; } in getSimplifyQuery()
|