Home
last modified time | relevance | path

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

12345678910>>...20

/external/icu/icu4c/source/data/curr/
Dksf.txt8 "mɔni mǝ á bǝlɔŋ bǝ kaksa bɛ táatáaŋzǝn",
12 "mɔni mǝ á angóla",
16 "mɔni mǝ á ɔstralí",
20 "mɔni mǝ á barǝ́n",
24 "mɔni mǝ á burundí",
28 "mɔni mǝ á botswana",
32 "mɔni mǝ á kanada",
36 "mɔni mǝ á kɔngó",
40 "mɔni mǝ á swís",
44 "mɔni mǝ á cín",
[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/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/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 …]
Dxattr.c29 struct node_info ni; in read_all_xattrs() local
36 F2FS_FT_XATTR, TYPE_XATTR, &ni); in read_all_xattrs()
50 struct node_info ni; in read_all_xattrs() local
53 get_node_info(sbi, xnid, &ni); in read_all_xattrs()
54 ret = dev_read_block(txattr_addr + inline_size, ni.blk_addr); in read_all_xattrs()
88 struct node_info ni; in write_all_xattrs() local
112 get_node_info(sbi, xnid, &ni); in write_all_xattrs()
113 blkaddr = ni.blk_addr; in write_all_xattrs()
116 ret = dev_read_block(xattr_node, ni.blk_addr); in write_all_xattrs()
139 struct node_info ni; in f2fs_setxattr() local
[all …]
Dsegment.c109 struct node_info ni; in new_data_block() local
120 get_node_info(sbi, dn->nid, &ni); in new_data_block()
121 set_summary(&sum, dn->nid, dn->ofs_in_node, ni.version); in new_data_block()
140 struct node_info ni; in f2fs_quota_size() local
148 get_node_info(qf->sbi, qf->ino, &ni); in f2fs_quota_size()
149 ASSERT(dev_read_block(inode, ni.blk_addr) >= 0); in f2fs_quota_size()
161 struct node_info ni; in f2fs_read() local
180 get_node_info(sbi, ino, &ni); in f2fs_read()
181 ASSERT(dev_read_block(inode, ni.blk_addr) >= 0); in f2fs_read()
251 struct node_info ni; in f2fs_write_ex() local
[all …]
Dfsck.c228 struct node_info ni; in is_valid_summary() local
237 get_node_info(sbi, nid, &ni); in is_valid_summary()
239 if (!IS_VALID_BLK_ADDR(sbi, ni.blk_addr)) in is_valid_summary()
243 ret = dev_read_block(node_blk, ni.blk_addr); in is_valid_summary()
388 struct node_info *ni) in sanity_check_nid() argument
398 get_node_info(sbi, nid, ni); in sanity_check_nid()
399 if (ni->ino == 0) { in sanity_check_nid()
404 if (ni->blk_addr == NEW_ADDR) { in sanity_check_nid()
409 if (!IS_VALID_BLK_ADDR(sbi, ni->blk_addr)) { in sanity_check_nid()
410 ASSERT_MSG("blkaddress is not valid. [0x%x]", ni->blk_addr); in sanity_check_nid()
[all …]
/external/llvm-project/polly/test/ScheduleOptimizer/
Dpattern-matching-based-opts_5.ll39 ; CHECK: if (ni >= 1) {
47 ; CHECK-NEXT: for (int c2 = 0; c2 <= floord(ni - 1, 96); c2 += 1) {
49 ; CHECK-NEXT: for (int c3 = 96 * c2; c3 <= min(ni - 1, 96 * c2 + 95); c3 += 1)
55 ; CHECK-NEXT: if (ni >= 96 * c2 + 4)
57 ; CHECK-NEXT: for (int c4 = 0; c4 <= min(23, -24 * c2 + ni / 4 - 1); c4 += 1)
96 … if ((ni >= 96 * c2 + 5 && 96 * c2 + 7 >= ni && c3 >= 0) || (ni >= 96 * c2 + 8…
97 ; CHECK-NEXT: if (96 * c2 + 7 >= ni) {
110 ; CHECK-NEXT: if (ni >= 96 * c2 + 6) {
119 ; CHECK-NEXT: if (96 * c2 + 7 == ni) {
120 ; CHECK-NEXT: Stmt_for_body6(ni - 1, 2048 * c0 + 8 * c3, 256 * c…
[all …]
/external/libaom/libaom/test/
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_txfm2d_test.cc92 for (int ni = 0; ni < txfm2d_size; ++ni) { in RunRoundtripCheck() local
95 input[ni] = extreme_input; // extreme case in RunRoundtripCheck()
97 input[ni] = rnd.Rand16() % input_base; in RunRoundtripCheck()
107 for (int ni = 0; ni < txfm2d_size; ++ni) { in RunRoundtripCheck() local
108 ref_input[ni] = input[ni]; in RunRoundtripCheck()
117 for (int ni = 0; ni < txfm2d_size; ++ni) { in RunRoundtripCheck() local
118 ref_coeffs_int[ni] = (int32_t)round(ref_coeffs[ni]); in RunRoundtripCheck()
123 for (int ni = 0; ni < txfm2d_size; ++ni) { in RunRoundtripCheck() local
124 expected[ni] = input[ni]; in RunRoundtripCheck()
137 for (int ni = 0; ni < txfm2d_size; ++ni) { in RunRoundtripCheck() local
[all …]
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/llvm-project/lldb/source/Plugins/SymbolFile/DWARF/
DDebugNamesDWARFIndex.cpp36 for (const DebugNames::NameIndex &ni : debug_names) { in GetUnits() local
37 for (uint32_t cu = 0; cu < ni.getCUCount(); ++cu) in GetUnits()
38 result.insert(ni.getCUOffset(cu)); in GetUnits()
76 const DebugNames::NameIndex &ni, in MaybeLogLookupError() argument
83 ni.getUnitOffset(), name); in MaybeLogLookupError()
103 for (const DebugNames::NameIndex &ni: *m_debug_names_up) { in GetGlobalVariables()
104 for (DebugNames::NameTableEntry nte: ni) { in GetGlobalVariables()
109 llvm::Expected<DebugNames::Entry> entry_or = ni.getEntry(&entry_offset); in GetGlobalVariables()
110 for (; entry_or; entry_or = ni.getEntry(&entry_offset)) { in GetGlobalVariables()
118 MaybeLogLookupError(entry_or.takeError(), ni, nte.getString()); in GetGlobalVariables()
[all …]
/external/javassist/src/main/javassist/bytecode/
DEnclosingMethodAttribute.java50 int ni = cp.addNameAndTypeInfo(methodName, methodDesc); in EnclosingMethodAttribute() local
54 bvalue[2] = (byte)(ni >>> 8); in EnclosingMethodAttribute()
55 bvalue[3] = (byte)ni; in EnclosingMethodAttribute()
69 int ni = 0; in EnclosingMethodAttribute() local
73 bvalue[2] = (byte)(ni >>> 8); in EnclosingMethodAttribute()
74 bvalue[3] = (byte)ni; in EnclosingMethodAttribute()
109 int ni = cp.getNameAndTypeName(mi); in methodName() local
110 return cp.getUtf8Info(ni); in methodName()
/external/cldr/tools/java/org/unicode/cldr/tool/
DGeneratedPluralSamples.java101 Status getStatus(FixedDecimal ni) {
102 long newValue = ni.getIntegerValue() * offset + ni.getDecimalDigits();
181 void add(FixedDecimal ni) {
182 Set<Range> set = data[ni.getVisibleDecimalDigitCount()];
184 switch (item.getStatus(ni)) {
192 set.add(new Range(ni, ni));
274 for (FixedDecimal ni : digitToSample) {
275 if (ni != null) {
276 samples2.add(ni);
297 private void add(FixedDecimal ni) {
[all …]
/external/llvm-project/polly/lib/External/isl/test_inputs/codegen/
Dgemm.st1 …ni, nj, nk] -> { S_4[i, j, k] : k <= -1 + nk and k >= 0 and j <= -1 + nj and j >= 0 and i <= -1 + …
4 - filter: "[ni, nj, nk] -> { S_4[i, j, k]; S_2[i, j] }"
6 …schedule: "[ni, nj, nk] -> [{ S_4[i, j, k] -> [(i)]; S_2[i, j] -> [(i)] }, { S_4[i, j, k] -> [(j)]…
11 - filter: "[ni, nj, nk] -> { S_2[i, j] }"
12 - filter: "[ni, nj, nk] -> { S_4[i, j, k] }"
/external/llvm-project/polly/test/FlattenSchedule/
Dgemm.ll5 ; C[ni][nj]
6 ; A[ni][nk]
11 define void @gemm(i32 %ni, i32 %nj, i32 %nk, double %alpha, double %beta, double* noalias nonnull %…
13 br label %ni.for
15 ni.for:
16 %i = phi i32 [0, %entry], [%i.inc, %ni.inc]
18 br i1 %i.cmp, label %nj.for, label %ni.exit
21 %j = phi i32 [0, %ni.for], [%j.inc, %nj.inc]
77 br label %ni.inc
79 ni.inc:
[all …]
/external/llvm-project/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/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/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()
/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/icu/icu4c/source/data/region/
Dbm.txt9 AG{"Antiga-ni-Barbuda"}
109 KN{"Kristɔfo-Senu-ni-Ɲevɛs"}
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"}
216 VC{"Vinisɛn-Senu-ni-Grenadini"}
[all …]
/external/llvm-project/lld/test/COFF/
Dpdb-lib.s17 # CHECK-NEXT: pdb file ni: 0 ``, src file ni: 0 ``
21 # CHECK-NEXT: pdb file ni: 0 ``, src file ni: 0 ``
25 # CHECK-NEXT: pdb file ni: 1 `{{.*foo.pdb}}`, src file ni: 0 ``

12345678910>>...20