/freebsd-11-stable/contrib/libdivsufsort/lib/ |
H A D | divsufsort.c | 38 sort_typeBstar(const sauchar_t *T, saidx_t *SA, argument 59 type B* suffixes into the array SA. */ 66 SA[--m] = i; 94 PAb = SA + n - m; ISAb = SA + m; 97 SA[--BUCKET_BSTAR(c0, c1)] = i; 100 SA[--BUCKET_BSTAR(c0, c1)] = m - 1; 105 buf = SA + m, bufsize = (n - (2 * m)) / tmp; 128 sssort(T, PAb, SA + k, SA 195 construct_SA(const sauchar_t *T, saidx_t *SA, saidx_t *bucket_A, saidx_t *bucket_B, saidx_t n, saidx_t m) argument 259 construct_BWT(const sauchar_t *T, saidx_t *SA, saidx_t *bucket_A, saidx_t *bucket_B, saidx_t n, saidx_t m) argument 332 divsufsort(const sauchar_t *T, saidx_t *SA, saidx_t n) argument [all...] |
H A D | utils.c | 53 bw_transform(const sauchar_t *T, sauchar_t *U, saidx_t *SA, argument 66 if((A = SA) == NULL) { 102 if(SA == NULL) { 159 /* Checks the suffix array SA of the string T. */ 161 sufcheck(const sauchar_t *T, const saidx_t *SA, argument 170 if((T == NULL) || (SA == NULL) || (n < 0)) { 181 if((SA[i] < 0) || (n <= SA[i])) { 184 " SA[%" PRIdSAIDX_T "]=%" PRIdSAIDX_T "\n", 185 n - 1, i, SA[ 259 sa_search(const sauchar_t *T, saidx_t Tsize, const sauchar_t *P, saidx_t Psize, const saidx_t *SA, saidx_t SAsize, saidx_t *idx) argument 329 sa_simplesearch(const sauchar_t *T, saidx_t Tsize, const saidx_t *SA, saidx_t SAsize, saint_t c, saidx_t *idx) argument [all...] |
H A D | trsort.c | 98 tr_fixdown(const saidx_t *ISAd, saidx_t *SA, saidx_t i, saidx_t size) { argument 103 for(v = SA[i], c = ISAd[v]; (j = 2 * i + 1) < size; SA[i] = SA[k], i = k) { 104 d = ISAd[SA[k = j++]]; 105 if(d < (e = ISAd[SA[j]])) { k = j; d = e; } 108 SA[i] = v; 114 tr_heapsort(const saidx_t *ISAd, saidx_t *SA, saidx_t size) { argument 121 if(ISAd[SA[m / 2]] < ISAd[SA[ 264 tr_copy(saidx_t *ISA, const saidx_t *SA, saidx_t *first, saidx_t *a, saidx_t *b, saidx_t *last, saidx_t depth) argument 289 tr_partialcopy(saidx_t *ISA, const saidx_t *SA, saidx_t *first, saidx_t *a, saidx_t *b, saidx_t *last, saidx_t depth) argument 327 tr_introsort(saidx_t *ISA, const saidx_t *ISAd, saidx_t *SA, saidx_t *first, saidx_t *last, trbudget_t *budget) argument 555 trsort(saidx_t *ISA, saidx_t *SA, saidx_t n, saidx_t depth) argument [all...] |
H A D | sssort.c | 193 saidx_t *SA, saidx_t i, saidx_t size) { 198 for(v = SA[i], c = Td[PA[v]]; (j = 2 * i + 1) < size; SA[i] = SA[k], i = k) { 199 d = Td[PA[SA[k = j++]]]; 200 if(d < (e = Td[PA[SA[j]]])) { k = j; d = e; } 203 SA[i] = v; 209 ss_heapsort(const sauchar_t *Td, const saidx_t *PA, saidx_t *SA, saidx_t size) { argument 216 if(Td[PA[SA[m / 2]]] < Td[PA[SA[ 192 ss_fixdown(const sauchar_t *Td, const saidx_t *PA, saidx_t *SA, saidx_t i, saidx_t size) argument [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/MC/ |
H A D | MCObjectWriter.cpp | 27 const MCSymbol &SA = A->getSymbol(); local 29 if (SA.isUndefined() || SB.isUndefined()) 32 if (!SA.getFragment() || !SB.getFragment()) 35 return isSymbolRefDifferenceFullyResolvedImpl(Asm, SA, SB, InSet);
|
H A D | MCExpr.cpp | 518 const MCSymbol &SA = A->getSymbol(); local 521 if (SA.isUndefined() || SB.isUndefined()) 527 if (SA.getFragment() == SB.getFragment() && !SA.isVariable() && 528 !SA.isUnset() && !SB.isVariable() && !SB.isUnset()) { 529 Addend += (SA.getOffset() - SB.getOffset()); 533 if (Asm->isThumbFunc(&SA)) 538 if (Asm->getBackend().isMicroMips(&SA)) 550 const MCSection &SecA = *SA.getFragment()->getParent(); 564 if (Asm->isThumbFunc(&SA)) [all...] |
/freebsd-11-stable/usr.bin/bsdiff/bsdiff/ |
H A D | divsufsort64.h | 70 * @param SA[0..n-1] The output array of suffixes. 76 divsufsort64(const sauchar_t *T, saidx64_t *SA, saidx64_t n); 103 * @param SA[0..n-1] The suffix array. (can be NULL) 111 saidx64_t *SA /* can NULL */, 132 * @param SA[0..n-1] The input suffix array. 139 sufcheck64(const sauchar_t *T, const saidx64_t *SA, saidx64_t n, saint_t verbose); 147 * @param SA[0..SAsize-1] The input suffix array. 156 const saidx64_t *SA, saidx64_t SAsize, 163 * @param SA[0..SAsize-1] The input suffix array. 172 const saidx64_t *SA, saidx64_ [all...] |
/freebsd-11-stable/cddl/contrib/opensolaris/cmd/dtrace/test/tst/sparc/ustack/ |
H A D | tst.circstack.s | 35 save %sp, -SA(MINFRAME), %sp
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
H A D | RDFCopy.cpp | 63 void CopyPropagation::recordCopy(NodeAddr<StmtNode*> SA, EqualityMap &EM) { argument 64 CopyMap.insert(std::make_pair(SA.Id, EM)); 65 Copies.push_back(SA.Id); 74 NodeAddr<StmtNode*> SA = IA; local 76 if (interpretAsCopy(SA.Addr->getCode(), EM)) 77 recordCopy(SA, EM); 138 auto SA = DFG.addr<InstrNode*>(C); local 139 auto FS = CopyMap.find(SA.Id); 144 for (NodeAddr<DefNode*> DA : SA.Addr->members_if(DFG.IsDef, DFG)) { 153 NodeId AtCopy = getLocalReachingDef(SR, SA); [all...] |
H A D | HexagonRDFOpt.cpp | 165 NodeAddr<StmtNode*> SA = TA; local 166 for (NodeAddr<RefNode*> RA : SA.Addr->members(DFG)) { 167 R2I.insert(std::make_pair(RA.Id, SA.Id)); 169 if (!DeadInstrs.count(SA.Id)) 170 PartlyDead.insert(SA.Id); 180 auto SA = DFG.addr<StmtNode*>(N); local 182 dbgs() << "Partly dead: " << *SA.Addr->getCode(); 183 Changed |= rewrite(SA, Remove);
|
H A D | RDFCopy.h | 52 void recordCopy(NodeAddr<StmtNode*> SA, EqualityMap &EM);
|
H A D | HexagonOptAddrMode.cpp | 105 bool allValidCandidates(NodeAddr<StmtNode *> SA, NodeList &UNodeList); 212 bool HexagonOptAddrMode::allValidCandidates(NodeAddr<StmtNode *> SA, argument 244 void HexagonOptAddrMode::getAllRealUses(NodeAddr<StmtNode *> SA, argument 246 for (NodeAddr<DefNode *> DA : SA.Addr->members_if(DFG->IsDef, *DFG)) { 607 NodeAddr<StmtNode *> SA = AddAslUN.Addr->getOwner(*DFG); local 612 getAllRealUses(SA, UNodeList); 694 NodeAddr<StmtNode *> SA = IA; local 695 MachineInstr *MI = SA.Addr->getCode(); 707 getAllRealUses(SA, UNodeList); 709 if (!allValidCandidates(SA, UNodeLis [all...] |
/freebsd-11-stable/cddl/contrib/opensolaris/cmd/dtrace/test/tst/sparc/usdt/ |
H A D | tst.tailcall.ksh | 50 save %sp, -SA(MINFRAME + 4), %sp 59 save %sp, -SA(MINFRAME + 4), %sp
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | ObjCARCAliasAnalysis.cpp | 47 const Value *SA = GetRCIdentityRoot(LocA.Ptr); local 50 AAResultBase::alias(MemoryLocation(SA, LocA.Size, LocA.AATags), 57 const Value *UA = GetUnderlyingObjCPtr(SA, DL); 59 if (UA != SA || UB != SB) {
|
/freebsd-11-stable/cddl/contrib/opensolaris/cmd/dtrace/test/tst/sparc/pid/ |
H A D | tst.branch.s | 40 save %sp, -SA(MINFRAME + 4), %sp
|
H A D | tst.embedded.s | 40 save %sp, -SA(MINFRAME + 4), %sp
|
H A D | tst.br.s | 67 save %sp, -SA(MINFRAME + 4), %sp
|
/freebsd-11-stable/contrib/ipfilter/rules/ |
H A D | BASIC_1.FW | 25 block in log proto tcp all flags S/SA head 101 group 100 28 block in log proto tcp all flags S/SA head 201 group 200 85 block in log proto tcp from any to a.b.c.d/32 flags S/SA head 110 group 100 97 block return-rst in log proto tcp from any to any flags S/SA group 100
|
H A D | BASIC_2.FW | 59 pass in log quick proto tcp all flags S/SA keep state group 200 70 block return-rst in log proto tcp from any to any flags S/SA group 100
|
/freebsd-11-stable/contrib/groff/font/devdvi/ |
H A D | Makefile.sub | 6 MI S EX SA SB SC \
|
/freebsd-11-stable/gnu/usr.bin/groff/font/devdvi/ |
H A D | Makefile | 8 MI S EX SA SB SC \
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/DebugInfo/DWARF/ |
H A D | DWARFDebugRnglists.cpp | 214 if (auto SA = LookupPooledAddress(Value0)) 215 CurrentBase = SA->Address; 245 if (auto SA = LookupPooledAddress(Value0)) 246 Start = SA->Address;
|
H A D | DWARFFormValue.cpp | 368 object::SectionedAddress SA) const { 369 OS << format("0x%016" PRIx64, SA.Address); 371 SA.SectionIndex); 628 if (auto SA = getAsSectionedAddress()) 629 return SA->Address; 641 Optional<object::SectionedAddress> SA = U->getAddrOffsetSectionItem(Index); 642 if (!SA) 644 return SA;
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | RegAllocGreedy.cpp | 345 std::unique_ptr<SplitAnalysis> SA; member in class:__anon1792::RAGreedy 1188 ArrayRef<SplitAnalysis::BlockInfo> UseBlocks = SA->getUseBlocks(); 1228 SA->getFirstSplitPoint(BC.Number))) 1234 if (Intf.last() >= SA->getLastSplitPoint(BC.Number)) { 1287 SA->getFirstSplitPoint(Number))) 1296 if (Intf.last() >= SA->getLastSplitPoint(Number)) 1314 BitVector Todo = SA->getThroughBlocks(); 1373 if (!SA->getNumThroughBlocks()) 1413 /// SA around all use blocks instead of forming bundle regions. 1416 ArrayRef<SplitAnalysis::BlockInfo> UseBlocks = SA [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/RISCV/MCTargetDesc/ |
H A D | RISCVAsmBackend.cpp | 292 const MCSymbol &SA = A->getSymbol(); local 293 if (A->getKind() != MCSymbolRefExpr::VK_None || SA.isUndefined()) 301 Asm, SA, *AUIPCDF, false, true); 305 Value = Layout.getSymbolOffset(SA) + AUIPCTarget.getConstant();
|