Home
last modified time | relevance | path

Searched refs:ni (Results 1 – 25 of 597) sorted by relevance

12345678910>>...24

/external/icu/icu4c/source/data/curr/
Dksf.txt7 "mɔni mǝ á bǝlɔŋ bǝ kaksa bɛ táatáaŋzǝn",
11 "mɔni mǝ á angóla",
15 "mɔni mǝ á ɔstralí",
19 "mɔni mǝ á barǝ́n",
23 "mɔni mǝ á burundí",
27 "mɔni mǝ á botswana",
31 "mɔni mǝ á kanada",
35 "mɔni mǝ á kɔngó",
39 "mɔni mǝ á swís",
43 "mɔni mǝ á cín",
[all …]
Dhu.txt75 "azerbajdzsáni manat (1993–2006)",
79 "azerbajdzsáni manat",
175 "bhutáni ngultrum",
467 "iráni rial",
495 "kirgizisztáni szom",
523 "kazahsztáni tenge",
707 "ománi rial",
735 "pakisztáni rúpia",
799 "Szudáni dínár (1992–2007)",
803 "szudáni font",
[all …]
/external/libaom/libaom/tools/txfm_analyzer/
Dtxfm_graph.cc223 for (int ni = 0; ni < node_num; ni++) { in propagate() local
224 int outIdx = get_idx(stage_idx, ni, node_num); in propagate()
257 for (int ni = 0; ni < node_num; ni++) { in graph_reset_visited() local
258 int idx = get_idx(si, ni, node_num); in graph_reset_visited()
288 for (int ni = 0; ni < node_num; ni++) { in propagate_estimate_amlify() local
289 estimate_value(node, stage_num, node_num, stage_idx, ni, estimate_bit); in propagate_estimate_amlify()
290 amplify_value(node, stage_num, node_num, stage_idx, ni, amplify_bit); in propagate_estimate_amlify()
296 for (int ni = 0; ni < node_num; ni++) { in init_graph() local
297 int outIdx = get_idx(si, ni, node_num); in init_graph()
299 node[outIdx].nodeIdx = ni; in init_graph()
[all …]
Dtxfm_gen_code.cc151 for (int ni = 0; ni < node_num; ni++) { in gen_code_c() local
152 int idx = get_idx(si, ni, node_num); in gen_code_c()
171 for (int ni = 0; ni < node_num; ni++) { in gen_code_c() local
172 int idx = get_idx(si, ni, node_num); in gen_code_c()
272 for (int ni = 0; ni < node_num; ni++) { in gen_cospi_list_sse2() local
273 int idx = get_idx(si, ni, node_num); in gen_cospi_list_sse2()
371 for (int ni = 0; ni < node_num; ni++) { in gen_code_sse2() local
372 int idx = get_idx(si, ni, node_num); in gen_code_sse2()
387 for (int ni = 0; ni < node_num; ni++) { in gen_cospi_list_sse4_1() local
388 int idx = get_idx(si, ni, node_num); in gen_cospi_list_sse4_1()
[all …]
/external/tcpdump/
Dprint-rip.c98 register const struct rip_netinfo *ni) in rip_entry_print_v1() argument
103 family = EXTRACT_16BITS(&ni->rip_family); in rip_entry_print_v1()
106 print_unknown_data(ndo, (const uint8_t *)&ni->rip_family, "\n\t ", RIP_ROUTELEN); in rip_entry_print_v1()
109 if (EXTRACT_16BITS(&ni->rip_tag) || in rip_entry_print_v1()
110 EXTRACT_32BITS(&ni->rip_dest_mask) || in rip_entry_print_v1()
111 EXTRACT_32BITS(&ni->rip_router)) { in rip_entry_print_v1()
113 print_unknown_data(ndo, (const uint8_t *)&ni->rip_family, "\n\t ", RIP_ROUTELEN); in rip_entry_print_v1()
118 ipaddr_string(ndo, &ni->rip_dest), in rip_entry_print_v1()
119 EXTRACT_32BITS(&ni->rip_metric))); in rip_entry_print_v1()
123 ipaddr_string(ndo, &ni->rip_dest), in rip_entry_print_v1()
[all …]
Dprint-ripng.c97 rip6_entry_print(netdissect_options *ndo, register const struct netinfo6 *ni, int metric) in rip6_entry_print() argument
100 l = ND_PRINT((ndo, "%s/%d", ip6addr_string(ndo, &ni->rip6_dest), ni->rip6_plen)); in rip6_entry_print()
101 if (ni->rip6_tag) in rip6_entry_print()
102 l += ND_PRINT((ndo, " [%d]", EXTRACT_16BITS(&ni->rip6_tag))); in rip6_entry_print()
104 l += ND_PRINT((ndo, " (%d)", ni->rip6_metric)); in rip6_entry_print()
112 register const struct netinfo6 *ni; in ripng_print() local
124 j = length_left / sizeof(*ni); in ripng_print()
133 if (j * sizeof(*ni) != length_left) in ripng_print()
137 for (ni = rp->rip6_nets; length_left >= sizeof(*ni); in ripng_print()
138 length_left -= sizeof(*ni), ++ni) { in ripng_print()
[all …]
/external/epid-sdk/ext/ipp/sources/ippcp/
Dpcpbnu32_arith_div.c129 cpSize ni; in cpDiv_BNU32() local
132 for(ni=sizeX-1; ni>0; ni--) in cpDiv_BNU32()
133 pX[ni] = (pX[ni]<<nlz) | (pX[ni-1]>>(32-nlz)); in cpDiv_BNU32()
136 for(ni=sizeY-1; ni>0; ni--) in cpDiv_BNU32()
137 pY[ni] = (pY[ni]<<nlz) | (pY[ni-1]>>(32-nlz)); in cpDiv_BNU32()
182 cpSize ni; in cpDiv_BNU32() local
183 for(ni=0; ni<sizeX; ni++) in cpDiv_BNU32()
184 pX[ni] = (pX[ni]>>nlz) | (pX[ni+1]<<(32-nlz)); in cpDiv_BNU32()
185 for(ni=0; ni<sizeY-1; ni++) in cpDiv_BNU32()
186 pY[ni] = (pY[ni]>>nlz) | (pY[ni+1]<<(32-nlz)); in cpDiv_BNU32()
/external/epid-sdk/epid/member/unittests/
Djoin_request-test.cc75 IssuerNonce const& ni) { in ValidateJoinRequest() argument
115 ni}; in ValidateJoinRequest()
126 IssuerNonce ni; in TEST_F() local
134 EpidCreateJoinRequest(nullptr, &pub_key, &ni, &join_request)); in TEST_F()
136 EpidCreateJoinRequest(ctx, nullptr, &ni, &join_request)); in TEST_F()
139 EXPECT_EQ(kEpidBadArgErr, EpidCreateJoinRequest(ctx, &pub_key, &ni, nullptr)); in TEST_F()
151 IssuerNonce ni = { in TEST_F() local
166 EpidCreateJoinRequest(member, &pub_key, &ni, &join_request)); in TEST_F()
178 IssuerNonce ni = { in TEST_F() local
201 sts = EpidCreateJoinRequest((MemberCtx*)member.get(), &pub_key, &ni, in TEST_F()
[all …]
/external/epid-sdk/epid/member/tiny/unittests/
Djoin_request-test.cc74 IssuerNonce const& ni) { in ValidateJoinRequest() argument
114 ni}; in ValidateJoinRequest()
125 IssuerNonce ni; in TEST_F() local
133 EpidCreateJoinRequest(nullptr, &pub_key, &ni, &join_request)); in TEST_F()
135 EpidCreateJoinRequest(ctx, nullptr, &ni, &join_request)); in TEST_F()
138 EXPECT_EQ(kEpidBadArgErr, EpidCreateJoinRequest(ctx, &pub_key, &ni, nullptr)); in TEST_F()
143 IssuerNonce ni; in TEST_F() local
151 EpidCreateJoinRequest(ctx, &pub_key, &ni, &join_request)); in TEST_F()
163 IssuerNonce ni = { in TEST_F() local
178 EpidCreateJoinRequest(member, &pub_key, &ni, &join_request)); in TEST_F()
[all …]
/external/f2fs-tools/fsck/
Ddump.c53 struct node_info ni; in nat_dump() local
58 ni.nid = nid; in nat_dump()
62 node_info_from_raw_nat(&ni, &raw_nat); in nat_dump()
63 ret = dev_read_block(node_block, ni.blk_addr); in nat_dump()
65 if (ni.blk_addr != 0x0) { in nat_dump()
70 ni.nid, ni.ino, in nat_dump()
73 ni.blk_addr, pack); in nat_dump()
80 node_info_from_raw_nat(&ni, in nat_dump()
82 if (ni.blk_addr == 0) in nat_dump()
85 ret = dev_read_block(node_block, ni.blk_addr); in nat_dump()
[all …]
Dfsck.c224 struct node_info ni; in is_valid_summary() local
233 get_node_info(sbi, nid, &ni); in is_valid_summary()
235 if (!IS_VALID_BLK_ADDR(sbi, ni.blk_addr)) in is_valid_summary()
239 ret = dev_read_block(node_blk, ni.blk_addr); in is_valid_summary()
380 struct node_info *ni) in sanity_check_nid() argument
390 get_node_info(sbi, nid, ni); in sanity_check_nid()
391 if (ni->ino == 0) { in sanity_check_nid()
396 if (ni->blk_addr == NEW_ADDR) { in sanity_check_nid()
401 if (!IS_VALID_BLK_ADDR(sbi, ni->blk_addr)) { in sanity_check_nid()
402 ASSERT_MSG("blkaddress is not valid. [0x%x]", ni->blk_addr); in sanity_check_nid()
[all …]
Dsegment.c68 struct node_info ni; in new_data_block() local
80 get_node_info(sbi, dn->nid, &ni); in new_data_block()
81 set_summary(&sum, dn->nid, dn->ofs_in_node, ni.version); in new_data_block()
96 struct node_info ni; in f2fs_read() local
115 get_node_info(sbi, ino, &ni); in f2fs_read()
116 ASSERT(dev_read_block(inode, ni.blk_addr) >= 0); in f2fs_read()
179 struct node_info ni; in f2fs_write() local
197 get_node_info(sbi, ino, &ni); in f2fs_write()
198 ASSERT(dev_read_block(inode, ni.blk_addr) >= 0); in f2fs_write()
259 write_inode(ni.blk_addr, inode); in f2fs_write()
[all …]
Dxattr.c34 struct node_info ni; in read_all_xattrs() local
37 get_node_info(sbi, le32_to_cpu(inode->i.i_xattr_nid), &ni); in read_all_xattrs()
38 ret = dev_read_block(txattr_addr + inline_size, ni.blk_addr); in read_all_xattrs()
72 struct node_info ni; in write_all_xattrs() local
96 get_node_info(sbi, xnid, &ni); in write_all_xattrs()
97 blkaddr = ni.blk_addr; in write_all_xattrs()
100 ret = dev_read_block(xattr_node, ni.blk_addr); in write_all_xattrs()
122 struct node_info ni; in f2fs_setxattr() local
146 get_node_info(sbi, ino, &ni); in f2fs_setxattr()
149 ret = dev_read_block(inode, ni.blk_addr); in f2fs_setxattr()
[all …]
Dnode.c65 struct node_info ni; in new_node_block() local
87 get_node_info(sbi, dn->nid, &ni); in new_node_block()
88 set_summary(&sum, dn->nid, 0, ni.version); in new_node_block()
190 struct node_info ni; in get_dnode_of_data() local
203 get_node_info(sbi, nids[0], &ni); in get_dnode_of_data()
204 nblk[0] = ni.blk_addr; in get_dnode_of_data()
226 struct node_info ni; in get_dnode_of_data() local
228 get_node_info(sbi, nids[i], &ni); in get_dnode_of_data()
232 ret = dev_read_block(dn->node_blk, ni.blk_addr); in get_dnode_of_data()
235 nblk[i] = ni.blk_addr; in get_dnode_of_data()
/external/libaom/libaom/test/
Dav1_inv_txfm2d_test.cc69 for (int ni = 0; ni < txfm2d_size; ++ni) { in RunRoundtripCheck() local
72 input[ni] = extreme_input; // extreme case in RunRoundtripCheck()
74 input[ni] = rnd.Rand16() % input_base; in RunRoundtripCheck()
84 for (int ni = 0; ni < txfm2d_size; ++ni) { in RunRoundtripCheck() local
85 ref_input[ni] = input[ni]; in RunRoundtripCheck()
94 for (int ni = 0; ni < txfm2d_size; ++ni) { in RunRoundtripCheck() local
95 ref_coeffs_int[ni] = (int32_t)round(ref_coeffs[ni]); in RunRoundtripCheck()
100 for (int ni = 0; ni < txfm2d_size; ++ni) { in RunRoundtripCheck() local
101 expected[ni] = input[ni]; in RunRoundtripCheck()
114 for (int ni = 0; ni < txfm2d_size; ++ni) { in RunRoundtripCheck() local
[all …]
Dav1_fwd_txfm1d_test.cc81 for (int ni = 0; ni < txfm_size; ++ni) { in TEST() local
82 input[ni] = rnd.Rand16() % input_base - rnd.Rand16() % input_base; in TEST()
83 ref_input[ni] = static_cast<double>(input[ni]); in TEST()
89 for (int ni = 0; ni < txfm_size; ++ni) { in TEST() local
91 abs(output[ni] - static_cast<int32_t>(round(ref_output[ni]))), in TEST()
Dav1_inv_txfm1d_test.cc139 for (int ni = 0; ni < txfm_size; ++ni) { in TEST() local
140 input[ni] = rnd.Rand16() % input_base - rnd.Rand16() % input_base; in TEST()
146 for (int ni = 0; ni < txfm_size; ++ni) { in TEST() local
148 abs(input[ni] - round_shift(round_trip_output[ni], in TEST()
/external/v8/src/compiler/
Dloop-analysis.cc76 for (NodeInfo& ni : info_) { in Print()
77 if (ni.node == nullptr) continue; in Print()
79 int index = ni.node->id() * width_ + INDEX(i); in Print()
92 PrintF(" #%d:%s\n", ni.node->id(), ni.node->op()->mnemonic()); in Print()
381 for (NodeInfo& ni : info_) { in FinishLoopTree()
382 if (ni.node == nullptr) continue; in FinishLoopTree()
386 int pos = ni.node->id() * width_; in FinishLoopTree()
407 CHECK(ni.node->opcode() != IrOpcode::kReturn); in FinishLoopTree()
409 AddNodeToLoop(&ni, innermost, innermost_index); in FinishLoopTree()
427 for (NodeInfo& ni : info_) { in FinishSingleLoop()
[all …]
/external/cldr/tools/java/org/unicode/cldr/tool/
DGeneratedPluralSamples.java98 Status getStatus(FixedDecimal ni) {
99 long newValue = ni.getIntegerValue() * offset + ni.getDecimalDigits();
176 void add(FixedDecimal ni) {
177 Set<Range> set = data[ni.getVisibleDecimalDigitCount()];
179 switch (item.getStatus(ni)) {
187 set.add(new Range(ni, ni));
267 for (FixedDecimal ni : digitToSample) {
268 if (ni != null) {
269 samples2.add(ni);
275 private void add(FixedDecimal ni) {
[all …]
/external/llvm/test/CodeGen/SystemZ/
Dinsert-04.ll9 ; CHECK-NOT: ni
20 ; CHECK-NOT: ni
32 ; CHECK-NOT: ni
43 ; CHECK-NOT: ni
54 ; CHECK-NOT: ni
65 ; CHECK-NOT: ni
76 ; CHECK-NOT: ni
87 ; CHECK-NOT: ni
98 ; CHECK-NOT: ni
109 ; CHECK-NOT: ni
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/test/CodeGen/SystemZ/
Dinsert-04.ll9 ; CHECK-NOT: ni
20 ; CHECK-NOT: ni
32 ; CHECK-NOT: ni
43 ; CHECK-NOT: ni
54 ; CHECK-NOT: ni
65 ; CHECK-NOT: ni
76 ; CHECK-NOT: ni
87 ; CHECK-NOT: ni
98 ; CHECK-NOT: ni
109 ; CHECK-NOT: ni
[all …]
/external/icu/icu4c/source/data/region/
Dbm.txt8 AG{"Antiga-ni-Barbuda"}
108 KN{"Kristɔfo-Senu-ni-Ɲevɛs"}
130 MK{"Macedɔni"}
165 PM{"Piyɛri-Senu-ni-Mikelɔŋ"}
183 SH{"Ɛlɛni Senu"}
186 SL{"Siyera Lewɔni"}
191 ST{"Sawo Tome-ni-Prinicipe"}
195 TC{"Turiki Gun ni Kayiki"}
206 TT{"Trinite-ni-Tobago"}
210 UA{"Ukɛrɛni"}
[all …]
/external/icu/android_icu4j/src/main/java/android/icu/impl/
DNorm2AllModes.java93 public Normalizer2WithImpl(Normalizer2Impl ni) { in Normalizer2WithImpl() argument
94 impl=ni; in Normalizer2WithImpl()
179 public DecomposeNormalizer2(Normalizer2Impl ni) { in DecomposeNormalizer2() argument
180 super(ni); in DecomposeNormalizer2()
212 public ComposeNormalizer2(Normalizer2Impl ni, boolean fcc) { in ComposeNormalizer2() argument
213 super(ni); in ComposeNormalizer2()
271 public FCDNormalizer2(Normalizer2Impl ni) { in FCDNormalizer2() argument
272 super(ni); in FCDNormalizer2()
302 private Norm2AllModes(Normalizer2Impl ni) { in Norm2AllModes() argument
303 impl=ni; in Norm2AllModes()
[all …]
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/
DNorm2AllModes.java83 public Normalizer2WithImpl(Normalizer2Impl ni) { in Normalizer2WithImpl() argument
84 impl=ni; in Normalizer2WithImpl()
166 public DecomposeNormalizer2(Normalizer2Impl ni) { in DecomposeNormalizer2() argument
167 super(ni); in DecomposeNormalizer2()
196 public ComposeNormalizer2(Normalizer2Impl ni, boolean fcc) { in ComposeNormalizer2() argument
197 super(ni); in ComposeNormalizer2()
252 public FCDNormalizer2(Normalizer2Impl ni) { in FCDNormalizer2() argument
253 super(ni); in FCDNormalizer2()
283 private Norm2AllModes(Normalizer2Impl ni) { in Norm2AllModes() argument
284 impl=ni; in Norm2AllModes()
[all …]
/external/antlr/runtime/Java/src/main/java/org/antlr/runtime/tree/
DTreeParser.java203 int ni = nodes.length-1; in inContext() local
205 while ( ni>=0 && t!=null ) { in inContext()
206 if ( nodes[ni].equals("...") ) { in inContext()
208 if ( ni==0 ) return true; // ... at start is no-op in inContext()
209 String goal = nodes[ni-1]; in inContext()
213 ni--; in inContext()
216 if ( !name.equals(nodes[ni]) ) { in inContext()
221 ni--; in inContext()
225 if ( t==null && ni>=0 ) return false; // at root but more nodes to match in inContext()

12345678910>>...24