HomeSort by: relevance | last modified time | path
    Searched refs:SA (Results 1 - 25 of 105) sorted by relevancy

1 2 3 4 5

  /src/external/gpl3/gcc/dist/gcc/
tree-outof-ssa.h 25 /* This structure (of which only a singleton SA exists) is used to
52 extern struct ssaexpand SA;
59 int p = partition_find (SA.map->var_partition, SSA_NAME_VERSION (exp));
60 if (SA.map->partition_to_view)
61 p = SA.map->partition_to_view[p];
63 return SA.partition_to_pseudo[p];
72 if (SA.values && bitmap_bit_p (SA.values, v))
78 extern void finish_out_of_ssa (struct ssaexpand *sa);
79 extern unsigned int rewrite_out_of_ssa (struct ssaexpand *sa);
    [all...]
machmode.def 252 ACCUM_MODE (SA, 4, 16, 15); /* s16.15 */
  /src/external/gpl3/gcc.old/dist/gcc/
tree-outof-ssa.h 25 /* This structure (of which only a singleton SA exists) is used to
52 extern struct ssaexpand SA;
59 int p = partition_find (SA.map->var_partition, SSA_NAME_VERSION (exp));
60 if (SA.map->partition_to_view)
61 p = SA.map->partition_to_view[p];
63 return SA.partition_to_pseudo[p];
72 if (SA.values && bitmap_bit_p (SA.values, v))
78 extern void finish_out_of_ssa (struct ssaexpand *sa);
79 extern unsigned int rewrite_out_of_ssa (struct ssaexpand *sa);
    [all...]
machmode.def 251 ACCUM_MODE (SA, 4, 16, 15); /* s16.15 */
  /src/external/apache2/llvm/dist/llvm/lib/MC/
MCObjectWriter.cpp 27 const MCSymbol &SA = A->getSymbol();
29 if (SA.isUndefined() || SB.isUndefined())
32 if (!SA.getFragment() || !SB.getFragment())
35 return isSymbolRefDifferenceFullyResolvedImpl(Asm, SA, SB, InSet);
  /src/external/bsd/zstd/dist/lib/dictBuilder/
divsufsort.h 40 * @param SA [0..n-1] The output array of suffixes.
46 divsufsort(const unsigned char *T, int *SA, int n, int openMP);
divsufsort.c 283 int *SA, int i, int size) {
288 for(v = SA[i], c = Td[PA[v]]; (j = 2 * i + 1) < size; SA[i] = SA[k], i = k) {
289 d = Td[PA[SA[k = j++]]];
290 if(d < (e = Td[PA[SA[j]]])) { k = j; d = e; }
293 SA[i] = v;
299 ss_heapsort(const unsigned char *Td, const int *PA, int *SA, int size) {
306 if(Td[PA[SA[m / 2]]] < Td[PA[SA[m]]]) { SWAP(SA[m], SA[m / 2]);
    [all...]
  /src/share/mk/
bsd.doc.mk 67 .for SA in ${SUBARTICLES}
69 realall: ${SA}.txt
70 realall: ${SA}.${PRINTABLE}
72 realall: ${SA}.html
91 .for SA in ${SUBARTICLES}
107 .for S in ${SRCS.${SA}}
108 SRCS2.${SA}+=${${S}:P}
110 .for S in ${DEPSRCS.${SA}}
111 DEPSRCS2.${SA}+=${${S}:P}
127 ${SA}.txt: ${SRCS2.${SA}} ${DEPSRCS2.${SA}
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/Frontend/
CompilerInvocation.cpp 228 CompilerInvocation::StringAllocator SA,
236 Args.push_back(SA(Value));
240 Args.push_back(SA(Twine(Spelling) + Value));
251 CompilerInvocation::StringAllocator SA,
253 denormalizeStringImpl(Args, Spelling, SA, OptClass, TableIndex, Twine(Value));
296 CompilerInvocation::StringAllocator SA,
302 denormalizeString(Args, Spelling, SA, OptClass, TableIndex,
313 CompilerInvocation::StringAllocator SA,
316 return denormalizeSimpleEnumImpl(Args, Spelling, SA, OptClass, TableIndex,
353 CompilerInvocation::StringAllocator SA,
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/
RDFCopy.cpp 63 void CopyPropagation::recordCopy(NodeAddr<StmtNode*> SA, EqualityMap &EM) {
64 CopyMap.insert(std::make_pair(SA.Id, EM));
65 Copies.push_back(SA.Id);
74 NodeAddr<StmtNode*> SA = IA;
76 if (interpretAsCopy(SA.Addr->getCode(), EM))
77 recordCopy(SA, EM);
138 auto SA = DFG.addr<InstrNode*>(C);
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...]
HexagonRDFOpt.cpp 165 NodeAddr<StmtNode*> SA = TA;
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);
182 dbgs() << "Partly dead: " << *SA.Addr->getCode();
183 Changed |= rewrite(SA, Remove);
RDFCopy.h 52 void recordCopy(NodeAddr<StmtNode*> SA, EqualityMap &EM);
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
ObjCARCAliasAnalysis.cpp 47 const Value *SA = GetRCIdentityRoot(LocA.Ptr);
50 AAResultBase::alias(MemoryLocation(SA, LocA.Size, LocA.AATags),
57 const Value *UA = GetUnderlyingObjCPtr(SA);
59 if (UA != SA || UB != SB) {
  /src/external/apache2/llvm/dist/llvm/lib/DebugInfo/DWARF/
DWARFDebugRnglists.cpp 209 if (auto SA = LookupPooledAddress(Value0))
210 CurrentBase = SA->Address;
243 if (auto SA = LookupPooledAddress(Value0))
244 Start = SA->Address;
251 if (auto SA = LookupPooledAddress(Value0))
252 Start = SA->Address;
254 if (auto SA = LookupPooledAddress(Value1))
255 End = SA->Address;
DWARFFormValue.cpp 384 object::SectionedAddress SA) const {
385 dumpAddress(OS, U->getAddressByteSize(), SA.Address);
387 SA.SectionIndex);
663 if (auto SA = getAsSectionedAddress())
664 return SA->Address;
678 Optional<object::SectionedAddress> SA = U->getAddrOffsetSectionItem(Index);
679 if (!SA)
682 SA->Address += (Value.uval & 0xffffffff);
683 return SA;
  /src/external/apache2/llvm/dist/clang/tools/libclang/
CXIndexDataConsumer.cpp 240 ScratchAlloc &SA) {
247 IdxCtx.getEntityInfo(PD, ProtEntities.back(), SA);
280 : SA(IdxCtx), ref_cnt(0) {
319 IdxCtx.getEntityInfo(InterD, IBInfo.ClassInfo, SA);
333 ScratchAlloc SA(IdxCtx);
334 AttrListInfo *attrs = SA.allocate<AttrListInfo>();
340 ScratchAlloc &SA) {
357 IdxCtx.getEntityInfo(BaseD, BaseEntities.back(), SA);
468 ScratchAlloc SA(*this);
470 SA.toCStr(filename)
    [all...]
CXIndexDataConsumer.h 37 ScratchAlloc(const ScratchAlloc &SA);
240 ScratchAlloc SA;
311 ScratchAlloc &SA);
325 CXIndexDataConsumer &IdxCtx, ScratchAlloc &SA);
468 ScratchAlloc &SA);
484 inline ScratchAlloc::ScratchAlloc(const ScratchAlloc &SA) : IdxCtx(SA.IdxCtx) {
  /src/sys/external/bsd/sljit/dist/sljit_src/
sljitNativeMIPS_64.c 40 return push_inst(compiler, ORI | SA(0) | TA(dst_ar) | IMM(imm), dst_ar);
43 return push_inst(compiler, ADDIU | SA(0) | TA(dst_ar) | IMM(imm), dst_ar);
47 return (imm & 0xffff) ? push_inst(compiler, ORI | SA(dst_ar) | TA(dst_ar) | IMM(imm), dst_ar) : SLJIT_SUCCESS;
83 FAIL_IF(push_inst(compiler, ORI | SA(dst_ar) | TA(dst_ar) | IMM(uimm >> 32), dst_ar));
91 return !(imm & 0xffff) ? SLJIT_SUCCESS : push_inst(compiler, ORI | SA(dst_ar) | TA(dst_ar) | IMM(imm), dst_ar);
116 FAIL_IF(push_inst(compiler, ORI | SA(dst_ar) | TA(dst_ar) | IMM(uimm >> 48), dst_ar));
120 return !(imm & 0xffff) ? SLJIT_SUCCESS : push_inst(compiler, ORI | SA(dst_ar) | TA(dst_ar) | IMM(imm), dst_ar);
233 return push_inst(compiler, XORI | SA(EQUAL_FLAG) | TA(EQUAL_FLAG) | IMM(1), EQUAL_FLAG);
239 FAIL_IF(push_inst(compiler, ORI | SA(0) | T(dst) | IMM((op & SLJIT_I32_OP) ? 32 : 64), UNMOVABLE_INS));
240 FAIL_IF(push_inst(compiler, SELECT_OP(DADDIU, ADDIU) | SA(0) | T(dst) | IMM(-1), DR(dst)))
    [all...]
sljitNativeMIPS_32.c 34 return push_inst(compiler, ORI | SA(0) | TA(dst_ar) | IMM(imm), dst_ar);
37 return push_inst(compiler, ADDIU | SA(0) | TA(dst_ar) | IMM(imm), dst_ar);
40 return (imm & 0xffff) ? push_inst(compiler, ORI | SA(dst_ar) | TA(dst_ar) | IMM(imm), dst_ar) : SLJIT_SUCCESS;
142 return push_inst(compiler, XORI | SA(EQUAL_FLAG) | TA(EQUAL_FLAG) | IMM(1), EQUAL_FLAG);
148 FAIL_IF(push_inst(compiler, ORI | SA(0) | T(dst) | IMM(32), UNMOVABLE_INS));
149 FAIL_IF(push_inst(compiler, ADDIU | SA(0) | T(dst) | IMM(-1), DR(dst)));
177 FAIL_IF(push_inst(compiler, ADDIU | SA(0) | TA(OTHER_FLAG) | IMM(src2), OTHER_FLAG));
218 FAIL_IF(push_inst(compiler, ADDIU | SA(0) | TA(EQUAL_FLAG) | IMM(src2), EQUAL_FLAG));
239 return push_inst(compiler, OR | SA(OTHER_FLAG) | TA(EQUAL_FLAG) | DA(OTHER_FLAG), OTHER_FLAG);
243 FAIL_IF(push_inst(compiler, ADDIU | SA(0) | T(TMP_REG2) | IMM(src2), DR(TMP_REG2)))
    [all...]
  /src/external/bsd/ipf/dist/rules/
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
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
  /src/external/apache2/mDNSResponder/dist/mDNSShared/
CommonServices.h 468 #define SOCKADDR_IS_IP_LOOPBACK( SA ) \
469 ( ( (const struct sockaddr *)( SA ) )->sa_family == AF_INET ) \
470 ? ( ( (const struct sockaddr_in *)( SA ) )->sin_addr.s_addr == htonl( INADDR_LOOPBACK ) ) \
471 : ( ( (const struct sockaddr *)( SA ) )->sa_family == AF_INET6 ) \
472 ? IN6_IS_ADDR_LOOPBACK( &( (const struct sockaddr_in6 *)( SA ) )->sin6_addr ) \
475 #define SOCKADDR_IS_IP_LOOPBACK( SA ) \
476 ( ( (const struct sockaddr *)( SA ) )->sa_family == AF_INET ) \
477 ? ( ( (const struct sockaddr_in *)( SA ) )->sin_addr.s_addr == htonl( INADDR_LOOPBACK ) ) \
488 #define SOCKADDR_IS_IP_LINK_LOCAL( SA ) \
489 ( ( ( (const struct sockaddr *)( SA ) )->sa_family == AF_INET )
    [all...]
  /src/external/apache2/llvm/dist/clang/include/clang/Frontend/
CompilerInvocation.h 240 /// \param SA - A function that given a Twine can allocate storage for a given
244 StringAllocator SA) const;
254 StringAllocator SA, bool DefaultDiagColor);
265 StringAllocator SA, const llvm::Triple &T,
278 StringAllocator SA, const llvm::Triple &T,
  /src/external/gpl2/groff/font/devdvi/
Makefile 12 MI S EX SA SB SC \
  /src/external/gpl3/binutils/dist/opcodes/
msp430-decode.opc 89 #define SA(a) OP (1, MSP430_Operand_Indirect, MSR_None, a)
215 SA (x + ld->pc + ld->op_ptr - 2);
219 SA (x);
240 SA (0);
450 ID (MSO_mov); SA ((srcr << 16) + IMMU(2)); DR (dstr);
560 ID (MSO_call); SA (IMMU(2) | (extb << 16));
568 ID (MSO_call); SA (pc + raddr + msp430->n_bytes);

Completed in 24 milliseconds

1 2 3 4 5