Home
last modified time | relevance | path

Searched refs:IA (Results 1 - 25 of 68) sorted by relevance

123

/third_party/icu/icu4j/main/tests/collate/src/com/ibm/icu/dev/test/search/
H A DSearchTest.java86 private static int[] IA(int... elements) { in IA() method in SearchTest
91 SD("xxxxxxxxxxxxxxxxxxxx", "fisher", null, TERTIARY, STANDARD_ELEMENT_COMPARISON, null, IA(-1), IA(0)),
92 SD("silly spring string", "string", null, TERTIARY, STANDARD_ELEMENT_COMPARISON, null, IA(13, -1), IA(6)),
93 SD("silly spring string string", "string", null, TERTIARY, STANDARD_ELEMENT_COMPARISON, null, IA(13, 20, -1), IA(6, 6)),
94 SD("silly string spring string", "string", null, TERTIARY, STANDARD_ELEMENT_COMPARISON, null, IA(6, 20, -1), IA(6, 6)),
95 SD("string spring string", "string", null, TERTIARY, STANDARD_ELEMENT_COMPARISON, null, IA(
[all...]
/third_party/icu/ohos_icu4j/src/main/tests/ohos/global/icu/dev/test/search/
H A DSearchTest.java89 private static int[] IA(int... elements) { in IA() method in SearchTest
94 SD("xxxxxxxxxxxxxxxxxxxx", "fisher", null, TERTIARY, STANDARD_ELEMENT_COMPARISON, null, IA(-1), IA(0)),
95 SD("silly spring string", "string", null, TERTIARY, STANDARD_ELEMENT_COMPARISON, null, IA(13, -1), IA(6)),
96 SD("silly spring string string", "string", null, TERTIARY, STANDARD_ELEMENT_COMPARISON, null, IA(13, 20, -1), IA(6, 6)),
97 SD("silly string spring string", "string", null, TERTIARY, STANDARD_ELEMENT_COMPARISON, null, IA(6, 20, -1), IA(6, 6)),
98 SD("string spring string", "string", null, TERTIARY, STANDARD_ELEMENT_COMPARISON, null, IA(
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/
H A DRDFDeadCode.cpp82 void DeadCodeElimination::scanInstr(NodeAddr<InstrNode*> IA, in scanInstr() argument
84 if (!DFG.IsCode<NodeAttrs::Stmt>(IA)) in scanInstr()
86 if (!isLiveInstr(NodeAddr<StmtNode*>(IA).Addr->getCode())) in scanInstr()
88 for (NodeAddr<RefNode*> RA : IA.Addr->members(DFG)) { in scanInstr()
96 NodeAddr<InstrNode*> IA = DA.Addr->getOwner(DFG); in processDef() local
97 for (NodeAddr<UseNode*> UA : IA.Addr->members_if(DFG.IsUse, DFG)) { in processDef()
101 for (NodeAddr<DefNode*> TA : DFG.getRelatedRefs(IA, DA)) in processDef()
129 for (NodeAddr<InstrNode*> IA : BA.Addr->members(DFG)) in collect()
130 scanInstr(IA, WorkQ); in collect()
150 auto IsDead = [this] (NodeAddr<InstrNode*> IA) in collect()
[all...]
H A DRDFCopy.cpp72 for (NodeAddr<InstrNode*> IA : BA.Addr->members(DFG)) { in scanBlock()
73 if (DFG.IsCode<NodeAttrs::Stmt>(IA)) { in scanBlock()
74 NodeAddr<StmtNode*> SA = IA; in scanBlock()
89 NodeAddr<InstrNode*> IA) { in getLocalReachingDef()
90 NodeAddr<RefNode*> RA = L.getNearestAliasedRef(RefRR, IA); in getLocalReachingDef()
164 NodeAddr<InstrNode*> IA = UA.Addr->getOwner(DFG); in run() local
165 assert(DFG.IsCode<NodeAttrs::Stmt>(IA)); in run()
166 NodeId AtUse = getLocalReachingDef(SR, IA); in run()
176 << *NodeAddr<StmtNode*>(IA).Addr->getCode(); in run()
197 auto FC = CopyMap.find(IA in run()
88 getLocalReachingDef(RegisterRef RefRR, NodeAddr<InstrNode*> IA) getLocalReachingDef() argument
[all...]
H A DHexagonRDFOpt.cpp95 bool rewrite(NodeAddr<InstrNode*> IA, SetVector<NodeId> &Remove);
96 void removeOperand(NodeAddr<InstrNode*> IA, unsigned OpNum);
189 void HexagonDCE::removeOperand(NodeAddr<InstrNode*> IA, unsigned OpNum) { in removeOperand() argument
190 MachineInstr *MI = NodeAddr<StmtNode*>(IA).Addr->getCode(); in removeOperand()
200 NodeList Refs = IA.Addr->members(DFG); in removeOperand()
215 bool HexagonDCE::rewrite(NodeAddr<InstrNode*> IA, SetVector<NodeId> &Remove) { in rewrite() argument
216 if (!getDFG().IsCode<NodeAttrs::Stmt>(IA)) in rewrite()
219 MachineInstr &MI = *NodeAddr<StmtNode*>(IA).Addr->getCode(); in rewrite()
258 for (NodeAddr<DefNode*> DA : IA.Addr->members_if(DFG.IsDef, DFG)) { in rewrite()
261 Defs = DFG.getRelatedRefs(IA, D in rewrite()
[all...]
H A DRDFGraph.cpp889 for (NodeAddr<InstrNode*> IA : BA.Addr->members(*this)) in build()
890 for (NodeAddr<RefNode*> RA : IA.Addr->members(*this)) in build()
1021 // Push all definitions from the instruction node IA to an appropriate
1023 void DataFlowGraph::pushAllDefs(NodeAddr<InstrNode*> IA, DefStackMap &DefM) { in pushAllDefs() argument
1024 pushClobbers(IA, DefM); in pushAllDefs()
1025 pushDefs(IA, DefM); in pushAllDefs()
1028 // Push all definitions from the instruction node IA to an appropriate
1030 void DataFlowGraph::pushClobbers(NodeAddr<InstrNode*> IA, DefStackMap &DefM) { in pushClobbers() argument
1039 // - if there are two or more related defs in IA (i.e. coming from in pushClobbers()
1046 for (NodeAddr<DefNode*> DA : IA in pushClobbers()
1074 pushDefs(NodeAddr<InstrNode*> IA, DefStackMap &DefM) pushDefs() argument
1128 getRelatedRefs(NodeAddr<InstrNode*> IA, NodeAddr<RefNode*> RA) const getRelatedRefs() argument
1154 getNextRelated(NodeAddr<InstrNode*> IA, NodeAddr<RefNode*> RA) const getNextRelated() argument
1193 locateNextRef(NodeAddr<InstrNode*> IA, NodeAddr<RefNode*> RA, Predicate P) const locateNextRef() argument
1215 getNextShadow(NodeAddr<InstrNode*> IA, NodeAddr<RefNode*> RA, bool Create) getNextShadow() argument
1236 getNextShadow(NodeAddr<InstrNode*> IA, NodeAddr<RefNode*> RA) const getNextShadow() argument
1566 linkRefUp(NodeAddr<InstrNode*> IA, NodeAddr<T> TA, DefStack &DS) linkRefUp() argument
[all...]
H A DRDFGraph.h736 void pushAllDefs(NodeAddr<InstrNode*> IA, DefStackMap &DM);
754 NodeAddr<RefNode*> getNextRelated(NodeAddr<InstrNode*> IA,
756 NodeAddr<RefNode*> getNextImp(NodeAddr<InstrNode*> IA,
758 NodeAddr<RefNode*> getNextImp(NodeAddr<InstrNode*> IA,
760 NodeAddr<RefNode*> getNextShadow(NodeAddr<InstrNode*> IA,
762 NodeAddr<RefNode*> getNextShadow(NodeAddr<InstrNode*> IA,
765 NodeList getRelatedRefs(NodeAddr<InstrNode*> IA,
842 locateNextRef(NodeAddr<InstrNode*> IA, NodeAddr<RefNode*> RA,
853 void pushClobbers(NodeAddr<InstrNode*> IA, DefStackMap &DM);
854 void pushDefs(NodeAddr<InstrNode*> IA, DefStackMa
865 NodeAddr<InstrNode*> IA = RA.Addr->getOwner(*this); removeFromOwner() local
[all...]
H A DRDFLiveness.cpp169 auto Block = [this] (NodeAddr<InstrNode*> IA) -> MachineBasicBlock* { in getAllReachingDefs()
170 if (IA.Addr->getKind() == NodeAttrs::Stmt) in getAllReachingDefs()
171 return NodeAddr<StmtNode*>(IA).Addr->getCode()->getParent(); in getAllReachingDefs()
172 assert(IA.Addr->getKind() == NodeAttrs::Phi); in getAllReachingDefs()
173 NodeAddr<PhiNode*> PA = IA; in getAllReachingDefs()
323 NodeAddr<InstrNode*> IA) { in getNearestAliasedRef()
324 NodeAddr<BlockNode*> BA = IA.Addr->getOwner(DFG); in getNearestAliasedRef()
326 NodeId FindId = IA.Id; in getNearestAliasedRef()
332 // Do not scan IA (which is what B would point to). in getNearestAliasedRef()
688 for (NodeAddr<InstrNode*> IA in computeLiveIns()
322 getNearestAliasedRef(RegisterRef RefRR, NodeAddr<InstrNode*> IA) getNearestAliasedRef() argument
1001 NodeAddr<InstrNode*> IA = DA.Addr->getOwner(DFG); traverse() local
1070 NodeAddr<InstrNode*> IA = I; traverse() local
[all...]
H A DHexagonOptAddrMode.cpp179 NodeAddr<InstrNode *> IA = UA.Addr->getOwner(*DFG); in canRemoveAddasl() local
182 NodeAddr<RefNode*> AA = LV->getNearestAliasedRef(OffsetRR, IA); in canRemoveAddasl()
187 MachineInstr &UseMI = *NodeAddr<StmtNode *>(IA).Addr->getCode(); in canRemoveAddasl()
301 NodeAddr<InstrNode *> IA = UA.Addr->getOwner(*DFG); in isSafeToExtLR() local
306 NodeAddr<RefNode*> AA = LV->getNearestAliasedRef(LRExtRR, IA); in isSafeToExtLR()
314 MachineInstr *UseMI = NodeAddr<StmtNode *>(IA).Addr->getCode(); in isSafeToExtLR()
690 for (auto IA : BA.Addr->members(*DFG)) { in processBlock()
691 if (!DFG->IsCode<NodeAttrs::Stmt>(IA)) in processBlock()
694 NodeAddr<StmtNode *> SA = IA; in processBlock()
704 << Print<NodeAddr<InstrNode *>>(IA, *DF in processBlock()
[all...]
H A DRDFCopy.h54 NodeId getLocalReachingDef(RegisterRef RefRR, NodeAddr<InstrNode*> IA);
H A DRDFDeadCode.h59 void scanInstr(NodeAddr<InstrNode*> IA, SetQueue<NodeId> &WorkQ);
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/IR/
H A DDebugLoc.cpp91 while (DILocation *IA = CurInlinedAt->getInlinedAt()) { in appendInlinedAt()
93 if (auto *Found = Cache[IA]) { in appendInlinedAt()
98 if (ReplaceLast && !IA->getInlinedAt()) in appendInlinedAt()
100 InlinedAtLocations.push_back(IA); in appendInlinedAt()
101 CurInlinedAt = IA; in appendInlinedAt()
/third_party/ffmpeg/libavutil/
H A Dcast5.c30 #define IA(x) ((x) >> 24) macro
40 f = ((S1[IA(I)] + S2[IB(I)]) ^ S3[IC(I)]) - S4[ID(I)]; \
47 f = ((S1[IA(I)] - S2[IB(I)]) + S3[IC(I)]) ^ S4[ID(I)]; \
54 f = ((S1[IA(I)] ^ S2[IB(I)]) - S3[IC(I)]) + S4[ID(I)]; \
60 z[0] = x[0] ^ S5[IB(x[3])] ^ S6[ID(x[3])] ^ S7[IA(x[3])] ^ S8[IC(x[3])] ^ S7[IA(x[2])]; \
61 z[1] = x[2] ^ S5[IA(z[0])] ^ S6[IC(z[0])] ^ S7[IB(z[0])] ^ S8[ID(z[0])] ^ S8[IC(x[2])]; \
62 z[2] = x[3] ^ S5[ID(z[1])] ^ S6[IC(z[1])] ^ S7[IB(z[1])] ^ S8[IA(z[1])] ^ S5[IB(x[2])]; \
63 z[3] = x[1] ^ S5[IC(z[2])] ^ S6[IB(z[2])] ^ S7[ID(z[2])] ^ S8[IA(z[2])] ^ S6[ID(x[2])]; \
68 x[0] = z[2] ^ S5[IB(z[1])] ^ S6[ID(z[1])] ^ S7[IA(
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/
H A DLexicalScopes.cpp132 if (auto *IA = DL->getInlinedAt()) { in findLexicalScope()
133 auto I = InlinedLexicalScopeMap.find(std::make_pair(Scope, IA)); in findLexicalScope()
142 const DILocation *IA) { in getOrCreateLexicalScope()
143 if (IA) { in getOrCreateLexicalScope()
147 return getOrCreateLexicalScope(IA); in getOrCreateLexicalScope()
151 return getOrCreateInlinedScope(Scope, IA); in getOrCreateLexicalScope()
141 getOrCreateLexicalScope(const DILocalScope *Scope, const DILocation *IA) getOrCreateLexicalScope() argument
H A DTargetRegisterInfo.cpp309 for (SuperRegClassIterator IA(RCA, this, true); IA.isValid(); ++IA) {
310 unsigned FinalA = composeSubRegIndices(IA.getSubReg(), SubA);
314 firstCommonClass(IA.getMask(), IB.getMask(), this);
329 *BestPreA = IA.getSubReg();
/third_party/libunwind/libunwind/doc/
H A Dlibunwind-ia64.tex8 \begin{Name}{3}{libunwind-ia64}{David Mosberger-Tang}{Programming Library}{IA-64-specific support in libunwind}libunwind-ia64 -- IA-64-specific support in libunwind
14 The IA-64 version of \Prog{libunwind} uses a platform-string of
22 implementation has been tested only with IA-64 Linux.
24 When targeting IA-64, the \Prog{libunwind} header file defines the
32 One special feature of IA-64 is the use of NaT bits to support
58 For a detailed description of the IA-64 register usage convention,
68 The IA-64-version of \Prog{libunwind} defines three kinds of register
81 identifies a stack frame. The IA-64 architecture defines two stacks
91 \textbf{Note:} Due to the way the call instruction works on IA
[all...]
/third_party/typescript/tests/baselines/reference/
H A DgenericTypeWithMultipleBases3.js2 interface IA<T> {
14 interface IC<T> extends IA<T>, IB<T> { }
/third_party/rust/crates/bindgen/bindgen-tests/tests/expectations/tests/
H A Dobjc_escape.rs27 impl IA for A {}
28 pub trait IA: Sized + std::ops::Deref { traits
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/AsmPrinter/
H A DDwarfDebug.h81 DbgEntity(const DINode *N, const DILocation *IA, unsigned ID) in DbgEntity() argument
82 : Entity(N), InlinedAt(IA), SubclassID(ID) {} in DbgEntity()
139 DbgVariable(const DILocalVariable *V, const DILocation *IA) in DbgVariable() argument
140 : DbgEntity(V, IA, DbgVariableKind) {} in DbgVariable()
240 DbgLabel(const DILabel *L, const DILocation *IA, const MCSymbol *Sym = nullptr) in DbgLabel() argument
241 : DbgEntity(L, IA, DbgLabelKind), Sym(Sym) {} in DbgLabel()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/
H A DLexicalScopes.h186 LexicalScope *findInlinedScope(const DILocalScope *N, const DILocation *IA) { in findInlinedScope() argument
187 auto I = InlinedLexicalScopeMap.find(std::make_pair(N, IA)); in findInlinedScope()
204 /// getOrCreateLexicalScope - Find lexical scope for the given Scope/IA. If
207 const DILocation *IA = nullptr);
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/
H A DTypeBasedAliasAnalysis.cpp507 int IA = PathA.size() - 1; in getLeastCommonType() local
511 while (IA >= 0 && IB >= 0) { in getLeastCommonType()
512 if (PathA[IA] == PathB[IB]) in getLeastCommonType()
513 Ret = PathA[IA]; in getLeastCommonType()
516 --IA; in getLeastCommonType()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/MC/
H A DMCCodeView.cpp291 MCCVFunctionInfo::LineInfo &IA = I->second; in getFunctionLineEntries() local
296 FilteredLines.back().getFileNum() != IA.File || in getFunctionLineEntries()
297 FilteredLines.back().getLine() != IA.Line || in getFunctionLineEntries()
298 FilteredLines.back().getColumn() != IA.Col) { in getFunctionLineEntries()
301 FuncId, IA.File, IA.Line, IA.Col, false, false)); in getFunctionLineEntries()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/IPO/
H A DPruneEH.cpp139 if (const auto *IA = dyn_cast<InlineAsm>(ICS.getCalledValue())) in runImpl()
140 if (IA->hasSideEffects()) in runImpl()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Utils/
H A DValueMapper.cpp364 if (const InlineAsm *IA = dyn_cast<InlineAsm>(V)) { in mapValue()
366 FunctionType *NewTy = IA->getFunctionType(); in mapValue()
370 if (NewTy != IA->getFunctionType()) in mapValue()
371 V = InlineAsm::get(NewTy, IA->getAsmString(), IA->getConstraintString(), in mapValue()
372 IA->hasSideEffects(), IA->isAlignStack()); in mapValue()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/MCA/
H A DInstrBuilder.h63 const MCRegisterInfo &RI, const MCInstrAnalysis *IA);

Completed in 19 milliseconds

123