Home
last modified time | relevance | path

Searched refs:IA (Results 1 – 25 of 164) sorted by relevance

1234567

/third_party/icu/icu4j/main/tests/collate/src/com/ibm/icu/dev/test/search/
DSearchTest.java86 private static int[] IA(int... elements) { in IA() method in SearchTest
91 …xxxxxxxxxxxxxxxxxxxx", "fisher", null, TERTIARY, STANDARD_ELEMENT_COMPARISON, null, IA(-1), IA(0)),
92 …ly spring string", "string", null, TERTIARY, STANDARD_ELEMENT_COMPARISON, null, IA(13, -1), IA(6)),
93 …ng string", "string", null, TERTIARY, STANDARD_ELEMENT_COMPARISON, null, IA(13, 20, -1), IA(6, 6)),
94 …ing string", "string", null, TERTIARY, STANDARD_ELEMENT_COMPARISON, null, IA(6, 20, -1), IA(6, 6)),
95 …ing string", "string", null, TERTIARY, STANDARD_ELEMENT_COMPARISON, null, IA(0, 14, -1), IA(6, 6)),
96 SD("Scott Ganyo", "c", null, TERTIARY, STANDARD_ELEMENT_COMPARISON, null, IA(1, -1), IA(1)),
97 SD("Scott Ganyo", " ", null, TERTIARY, STANDARD_ELEMENT_COMPARISON, null, IA(5, -1), IA(1)),
98 … SD("\u0300\u0325", "\u0300", null, TERTIARY, STANDARD_ELEMENT_COMPARISON, null, IA(-1), IA(0)),
99 … SD("a\u0300\u0325", "\u0300", null, TERTIARY, STANDARD_ELEMENT_COMPARISON, null, IA(-1), IA(0)),
[all …]
/third_party/icu/ohos_icu4j/src/main/tests/ohos/global/icu/dev/test/search/
DSearchTest.java89 private static int[] IA(int... elements) { in IA() method in SearchTest
94 …xxxxxxxxxxxxxxxxxxxx", "fisher", null, TERTIARY, STANDARD_ELEMENT_COMPARISON, null, IA(-1), IA(0)),
95 …ly spring string", "string", null, TERTIARY, STANDARD_ELEMENT_COMPARISON, null, IA(13, -1), IA(6)),
96 …ng string", "string", null, TERTIARY, STANDARD_ELEMENT_COMPARISON, null, IA(13, 20, -1), IA(6, 6)),
97 …ing string", "string", null, TERTIARY, STANDARD_ELEMENT_COMPARISON, null, IA(6, 20, -1), IA(6, 6)),
98 …ing string", "string", null, TERTIARY, STANDARD_ELEMENT_COMPARISON, null, IA(0, 14, -1), IA(6, 6)),
99 SD("Scott Ganyo", "c", null, TERTIARY, STANDARD_ELEMENT_COMPARISON, null, IA(1, -1), IA(1)),
100 SD("Scott Ganyo", " ", null, TERTIARY, STANDARD_ELEMENT_COMPARISON, null, IA(5, -1), IA(1)),
101 … SD("\u0300\u0325", "\u0300", null, TERTIARY, STANDARD_ELEMENT_COMPARISON, null, IA(-1), IA(0)),
102 … SD("a\u0300\u0325", "\u0300", null, TERTIARY, STANDARD_ELEMENT_COMPARISON, null, IA(-1), IA(0)),
[all …]
/third_party/ffmpeg/libavutil/
Dcast5.c26 #define IA(x) ((x) >> 24) macro
36 … f = ((S1[IA(I)] + S2[IB(I)]) ^ S3[IC(I)]) - S4[ID(I)]; \
43 … f = ((S1[IA(I)] - S2[IB(I)]) + S3[IC(I)]) ^ S4[ID(I)]; \
50 … f = ((S1[IA(I)] ^ S2[IB(I)]) - S3[IC(I)]) + S4[ID(I)]; \
56 … z[0] = x[0] ^ S5[IB(x[3])] ^ S6[ID(x[3])] ^ S7[IA(x[3])] ^ S8[IC(x[3])] ^ S7[IA(x[2])]; \
57 … z[1] = x[2] ^ S5[IA(z[0])] ^ S6[IC(z[0])] ^ S7[IB(z[0])] ^ S8[ID(z[0])] ^ S8[IC(x[2])]; \
58 … z[2] = x[3] ^ S5[ID(z[1])] ^ S6[IC(z[1])] ^ S7[IB(z[1])] ^ S8[IA(z[1])] ^ S5[IB(x[2])]; \
59 … z[3] = x[1] ^ S5[IC(z[2])] ^ S6[IB(z[2])] ^ S7[ID(z[2])] ^ S8[IA(z[2])] ^ S6[ID(x[2])]; \
64 … x[0] = z[2] ^ S5[IB(z[1])] ^ S6[ID(z[1])] ^ S7[IA(z[1])] ^ S8[IC(z[1])] ^ S7[IA(z[0])]; \
65 … x[1] = z[0] ^ S5[IA(x[0])] ^ S6[IC(x[0])] ^ S7[IB(x[0])] ^ S8[ID(x[0])] ^ S8[IC(z[0])]; \
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/
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) -> bool { in collect() argument
[all …]
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() argument
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.Id); in run()
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, DA); in rewrite()
[all …]
DRDFGraph.cpp889 for (NodeAddr<InstrNode*> IA : BA.Addr->members(*this)) in build()
890 for (NodeAddr<RefNode*> RA : IA.Addr->members(*this)) in build()
1023 void DataFlowGraph::pushAllDefs(NodeAddr<InstrNode*> IA, DefStackMap &DefM) { in pushAllDefs() argument
1024 pushClobbers(IA, DefM); in pushAllDefs()
1025 pushDefs(IA, DefM); in pushAllDefs()
1030 void DataFlowGraph::pushClobbers(NodeAddr<InstrNode*> IA, DefStackMap &DefM) { in pushClobbers() argument
1046 for (NodeAddr<DefNode*> DA : IA.Addr->members_if(IsDef, *this)) { in pushClobbers()
1052 NodeList Rel = getRelatedRefs(IA, DA); in pushClobbers()
1074 void DataFlowGraph::pushDefs(NodeAddr<InstrNode*> IA, DefStackMap &DefM) { in pushDefs() argument
1092 for (NodeAddr<DefNode*> DA : IA.Addr->members_if(IsDef, *this)) { in pushDefs()
[all …]
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, DefStackMap &DM);
[all …]
DRDFLiveness.cpp169 auto Block = [this] (NodeAddr<InstrNode*> IA) -> MachineBasicBlock* { in getAllReachingDefs() argument
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() argument
324 NodeAddr<BlockNode*> BA = IA.Addr->getOwner(DFG); in getNearestAliasedRef()
326 NodeId FindId = IA.Id; in getNearestAliasedRef()
688 for (NodeAddr<InstrNode*> IA : BA.Addr->members(DFG)) { in computeLiveIns()
689 for (NodeAddr<RefNode*> RA : IA.Addr->members(DFG)) in computeLiveIns()
[all …]
/third_party/typescript/tests/baselines/reference/
DgenericTypeWithMultipleBases3.symbols2 interface IA<T> {
3 >IA : Symbol(IA, Decl(genericTypeWithMultipleBases3.ts, 0, 0))
7 >foo : Symbol(IA.foo, Decl(genericTypeWithMultipleBases3.ts, 0, 17))
26 interface IC<T> extends IA<T>, IB<T> { }
29 >IA : Symbol(IA, Decl(genericTypeWithMultipleBases3.ts, 0, 0))
40 >c.foo : Symbol(IA.foo, Decl(genericTypeWithMultipleBases3.ts, 0, 17))
42 >foo : Symbol(IA.foo, Decl(genericTypeWithMultipleBases3.ts, 0, 17))
DgenericTypeWithMultipleBases3.js2 interface IA<T> {
14 interface IC<T> extends IA<T>, IB<T> { }
DgenericTypeWithMultipleBases3.types2 interface IA<T> {
18 interface IC<T> extends IA<T>, IB<T> { }
/third_party/boost/boost/sort/common/
Dint_array.hpp53 template<class IA>
56 bool operator ( )(const IA & A1, const IA & A2) const in operator ( )()
62 template<class IA>
65 bool operator ( )(const IA & A1, const IA & A2) const in operator ( )()
/third_party/boost/boost/numeric/ublas/experimental/
Dsparse_view.hpp116 template<class L, std::size_t IB, class IA, class JA, class TA>
118 public matrix_expression<compressed_matrix_view<L, IB, IA, JA, TA> > {
128 typedef compressed_matrix_view<L, IB, IA, JA, TA> self_type;
147 typedef IA rowptr_array_type;
297 template<class L, std::size_t IB, class IA, class JA, class TA >
298 const typename compressed_matrix_view<L,IB,IA,JA,TA>::value_type
299 compressed_matrix_view<L,IB,IA,JA,TA>::zero_ = value_type/*zero*/();
302 template<class L, std::size_t IB, class IA, class JA, class TA >
303 compressed_matrix_view<L,IB,IA,JA,TA>
307 , const IA & ia in make_compressed_matrix_view()
[all …]
/third_party/boost/libs/numeric/ublas/test/
Dsparse_view_test.cpp44 const unsigned int IA[] = { 1, 3, 5, 7 }; variable
61 …std::cout << ( ublas::make_compressed_matrix_view<ublas::row_major,IB>(3,4,NNZ,IA,JA,VA) ) << std:… in BOOST_AUTO_TEST_CASE()
65 COMPMATVIEW viewA(3,4,NNZ,IA,JA,VA); in BOOST_AUTO_TEST_CASE()
77 … , ublas::c_array_view<const unsigned int>(4,&(IA[0])) in BOOST_AUTO_TEST_CASE()
85 std::copy(&(IA[0]),&(IA[4]),ia); in BOOST_AUTO_TEST_CASE()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/IR/
DDebugLoc.cpp91 while (DILocation *IA = CurInlinedAt->getInlinedAt()) { in appendInlinedAt() local
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/boost/boost/numeric/ublas/
Dfwd.hpp73 template<class V, class IA = indirect_array<> >
84 template<class M, class IA = indirect_array<> >
90 template<class M, class IA = indirect_array<> >
115 …template<class T, std::size_t IB = 0, class IA = unbounded_array<std::size_t>, class TA = unbounde…
117 …template<class T, std::size_t IB = 0, class IA = unbounded_array<std::size_t>, class TA = unbounde…
222 …template<class T, class L = row_major, std::size_t IB = 0, class IA = unbounded_array<std::size_t>…
224 …template<class T, class L = row_major, std::size_t IB = 0, class IA = unbounded_array<std::size_t>…
Dvector_proxy.hpp1163 template<class V, class IA>
1165 public vector_expression<vector_indirect<V, IA> > {
1167 typedef vector_indirect<V, IA> self_type;
1174 typedef const IA const_indirect_array_type;
1175 typedef IA indirect_array_type;
1367 typedef typename IA::const_iterator const_subiterator_type;
1368 typedef typename IA::const_iterator subiterator_type;
1656 template<class V, class IA>
1658 …vector_indirect<V, IA> project (vector_indirect<V, IA> &data, const typename vector_indirect<V, IA… in project()
1661 template<class V, class IA>
[all …]
Dvector_sparse.hpp837 template<class T, std::size_t IB, class IA, class TA>
839 public vector_container<compressed_vector<T, IB, IA, TA> > {
844 typedef compressed_vector<T, IB, IA, TA> self_type;
851 typedef typename IA::value_type size_type;
852 typedef typename IA::difference_type difference_type;
860 typedef IA index_array_type;
1207 typedef typename IA::const_iterator const_subiterator_type;
1208 typedef typename IA::iterator subiterator_type;
1467 template<class T, std::size_t IB, class IA, class TA>
1468 …const typename compressed_vector<T, IB, IA, TA>::value_type compressed_vector<T, IB, IA, TA>::zero…
[all …]
/third_party/typescript/tests/cases/projects/MultipleLevels/B/
DB.ts6 public Create(): IA
12 export interface IA
/third_party/typescript/tests/cases/projects/MultipleLevels/
Db.ts6 public Create(): IA
12 export interface IA
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/
DLexicalScopes.cpp132 if (auto *IA = DL->getInlinedAt()) { in findLexicalScope() local
133 auto I = InlinedLexicalScopeMap.find(std::make_pair(Scope, IA)); in findLexicalScope()
142 const DILocation *IA) { in getOrCreateLexicalScope() argument
143 if (IA) { in getOrCreateLexicalScope()
147 return getOrCreateLexicalScope(IA); in getOrCreateLexicalScope()
151 return getOrCreateInlinedScope(Scope, IA); in getOrCreateLexicalScope()
DTargetRegisterInfo.cpp309 for (SuperRegClassIterator IA(RCA, this, true); IA.isValid(); ++IA) { in getCommonSuperRegClass() local
310 unsigned FinalA = composeSubRegIndices(IA.getSubReg(), SubA); in getCommonSuperRegClass()
314 firstCommonClass(IA.getMask(), IB.getMask(), this); in getCommonSuperRegClass()
329 *BestPreA = IA.getSubReg(); in getCommonSuperRegClass()
/third_party/typescript/tests/cases/compiler/
DgenericTypeWithMultipleBases3.ts1 interface IA<T> { interface
13 interface IC<T> extends IA<T>, IB<T> { }
/third_party/libunwind/doc/
Dlibunwind-ia64.tex8 …a64}{David Mosberger-Tang}{Programming Library}{IA-64-specific support in libunwind}libunwind-ia64…
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-64,
138 used. The IA-64 architecture defines several application registers
[all …]

1234567