| /libcore/luni/src/main/native/ |
| libcore_icu_AlphabeticIndex.cpp | 130 AlphabeticIndex::ImmutableIndex* ii = ai->buildImmutableIndex(status); local
134 return reinterpret_cast<uintptr_t>(ii);
142 AlphabeticIndex::ImmutableIndex* ii = immutableIndexFromPeer(peer); local
143 return ii->getBucketCount();
147 AlphabeticIndex::ImmutableIndex* ii = immutableIndexFromPeer(peer); local
153 jint result = ii->getBucketIndex(string.unicodeString(), status);
161 AlphabeticIndex::ImmutableIndex* ii = immutableIndexFromPeer(peer); local
162 const AlphabeticIndex::Bucket* bucket = ii->getBucket(index);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.unique/ |
| unique.pass.cpp | 78 int ii[] = {0, 1, 1, 1, 2, 2, 2}; local
79 const unsigned si = sizeof(ii)/sizeof(ii[0]);
80 r = std::unique(Iter(ii), Iter(ii+si));
81 assert(base(r) == ii + 3);
82 assert(ii[0] == 0);
83 assert(ii[1] == 1);
84 assert(ii[2] == 2);
157 Ptr ii[7] local
[all...] |
| unique_copy.pass.cpp | 84 const int ii[] = {0, 1, 1, 1, 2, 2, 2}; local
85 const unsigned si = sizeof(ii)/sizeof(ii[0]);
87 r = std::unique_copy(InIter(ii), InIter(ii+si), OutIter(ji));
|
| unique_pred.pass.cpp | 102 int ii[] = {0, 1, 1, 1, 2, 2, 2}; local
103 const unsigned si = sizeof(ii)/sizeof(ii[0]);
105 r = std::unique(Iter(ii), Iter(ii+si), count_equal());
106 assert(base(r) == ii + 3);
107 assert(ii[0] == 0);
108 assert(ii[1] == 1);
109 assert(ii[2] == 2);
197 Ptr ii[7] local
[all...] |
| /sdk/emulator/qtools/ |
| bb2sym.cpp | 66 for (uint32_t ii = 0; ii < num_static_bb; ++ii) {
67 trace->ReadStatic(&blocks[ii].bb);
68 blocks[ii].is_thumb = blocks[ii].bb.bb_addr & 1;
69 blocks[ii].bb.bb_addr &= ~1;
70 blocks[ii].sym = NULL;
71 blocks[ii].inner = NULL;
72 trace->ReadStaticInsns(blocks[ii].bb.num_insns, insns)
106 int ii; local
[all...] |
| /libcore/luni/src/test/java/libcore/icu/ |
| AlphabeticIndexTest.java | 27 private static void assertHasLabel(AlphabeticIndex.ImmutableIndex ii, String string, String expectedLabel) {
28 int index = ii.getBucketIndex(string);
29 String label = ii.getBucketLabel(index);
196 AlphabeticIndex.ImmutableIndex ii = ai.getImmutableIndex(); local
197 assertEquals(ai.getBucketCount(), ii.getBucketCount());
201 AlphabeticIndex.ImmutableIndex ii = createIndex(Locale.US); local
203 ii.getBucketIndex(null);
210 AlphabeticIndex.ImmutableIndex ii = createIndex(Locale.US); local
212 ii.getBucketLabel(-1);
218 ii.getBucketLabel(123456)
[all...] |
| /development/apps/Development/src/com/android/development/ |
| InstrumentationList.java | 64 InstrumentationInfo ii = mList.get(position); local
65 return new ComponentName(ii.packageName, ii.name);
|
| /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/ |
| LinkedHashSetTest.java | 165 Integer ii = (Integer) oo; local
166 assertTrue("Incorrect element found", ii.intValue() == j);
|
| /external/chromium_org/gpu/command_buffer/tests/ |
| gl_depth_texture_unittest.cc | 145 for (size_t ii = 0; ii < arraysize(format_types); ++ii) {
146 const FormatType& format_type = format_types[ii];
162 << "iteration: " << ii; local
|
| /external/chromium_org/third_party/angle_dx11/tests/compiler_tests/ |
| ExpressionLimit_test.cpp | 59 for (int ii = 0; ii < length; ++ii) {
60 *ss << "+ vec4(" << ii << ")"; local
115 for (int ii = 0; ii < length; ++ii) {
116 *ss << "vec4 function" << (ii + 1) << "() {\n"
117 << " return function" << ii << "();\n"
|
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/draw/ |
| draw_pt.c | 231 uint ii = 0; local
241 ii = elem[start + i];
247 ii = elem[start + i];
253 ii = elem[start + i];
260 ii += draw->pt.user.eltBias;
262 draw->pt.user.eltBias, ii);
266 ii = start + i;
267 debug_printf("Vertex %u:\n", ii);
275 ii = draw->instance_id / draw->pt.vertex_element[j].instance_divisor;
279 ptr += draw->pt.vertex_buffer[buf].stride * ii;
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/llvmpipe/ |
| lp_tile_image.c | 160 uint ii = i + x, jj = j + y; local
161 uint src_offset = (jj / tile_h * tiles_per_row + ii / tile_w)
163 uint dst_offset = jj * dst_stride + ii;
180 uint ii = i + x, jj = j + y; local
181 uint src_offset = (jj / tile_h * tiles_per_row + ii / tile_w)
183 uint dst_offset = jj * dst_stride + ii;
200 uint ii = i + x, jj = j + y; local
201 uint tile_offset = ((jj / tile_h) * tiles_per_row + ii / tile_w);
208 ii, jj);
250 uint ii = i + x, jj = j + y local
270 uint ii = i + x, jj = j + y; local
289 uint ii = i + x, jj = j + y; local
[all...] |
| /external/chromium_org/third_party/openssl/openssl/crypto/evp/ |
| bio_b64.c | 146 int ret=0,i,ii,j,k,x,n,num,ret_code=0; local
283 for (ii=0; ii<n; ii++)
284 ctx->tmp[ii]=p[ii];
|
| /external/chromium_org/third_party/sqlite/src/tool/ |
| speedtest8inst1.c | 74 int ii; local
75 for(ii=0; zLeft[ii] && zRight[ii]; ii++){
76 if( zLeft[ii]!=zRight[ii] ) return 0;
78 return( zLeft[ii]==zRight[ii] );
141 int ii; local
[all...] |
| /external/clang/test/Sema/ |
| complex-int.c | 9 int ii; local
12 result = arr*ii;
13 result = ii*brr;
|
| /external/clang/test/SemaTemplate/ |
| address-spaces.cpp | 73 identity<int> ii = accept_arg_in_address_space_1(int_1); local
|
| /external/dropbear/libtommath/etc/ |
| pprime.c | 178 int res, ii; local
263 /* now try base x=bases[ii] */
264 for (ii = 0; ii < li; ii++) {
265 mp_set (&x, bases[ii]);
322 if (ii == li)
333 printf("B == \n%s\n\nG == %d\n", buf, bases[ii]);
|
| /external/iputils/ninfod/ |
| ninfod_name.c | 172 int llen, ii; local
189 for (ii = 0; ii < llen; ii++) {
190 if (!isascii(name[i+ii]))
192 if (ii == 0 || ii == llen-1) {
193 if (!isalpha(name[i+ii]) && !isdigit(name[i+ii]))
195 } else if (!isalnum(name[i+ii]) && name[i+ii] != '-'
[all...] |
| /external/libffi/testsuite/libffi.call/ |
| nested_struct.c | 18 int ii; member in struct:cls_struct_16byte2
36 result.d.c = b0.c + b1.ii + b2.d.c;
37 result.e.ii = b0.c + b1.ii + b2.e.ii;
43 b1.ii, b1.dd, b1.ff,
45 b2.e.ii, b2.e.dd, b2.e.ff,
47 result.e.ii, result.e.dd, result.e.ff);
141 CHECK( res_dbl.d.c == (e_dbl.c + f_dbl.ii + g_dbl.d.c));
142 CHECK( res_dbl.e.ii == (e_dbl.c + f_dbl.ii + g_dbl.e.ii))
[all...] |
| nested_struct1.c | 18 int ii; member in struct:cls_struct_16byte2
37 result.d.c = b0.c + b1.ii + b2.d.c;
38 result.e.ii = b0.c + b1.ii + b2.e.ii;
44 b1.ii, b1.dd, b1.ff,
46 b2.e.ii, b2.e.dd, b2.e.ff,
49 result.e.ii, result.e.dd, result.e.ff);
148 CHECK( res_dbl.d.c == (e_dbl.c + f_dbl.ii + g_dbl.d.c));
149 CHECK( res_dbl.e.ii == (e_dbl.c + f_dbl.ii + g_dbl.e.ii))
[all...] |
| /external/libselinux/src/ |
| label_android_property.c | 53 unsigned int ii, jj; local
56 for (ii = 0; ii < data->nspec; ii++) {
57 curr_spec = &spec_arr[ii];
58 for (jj = ii + 1; jj < data->nspec; jj++) {
|
| /external/mesa3d/src/gallium/auxiliary/draw/ |
| draw_pt.c | 231 uint ii = 0; local
241 ii = elem[start + i];
247 ii = elem[start + i];
253 ii = elem[start + i];
260 ii += draw->pt.user.eltBias;
262 draw->pt.user.eltBias, ii);
266 ii = start + i;
267 debug_printf("Vertex %u:\n", ii);
275 ii = draw->instance_id / draw->pt.vertex_element[j].instance_divisor;
279 ptr += draw->pt.vertex_buffer[buf].stride * ii;
[all...] |
| /external/mesa3d/src/gallium/drivers/llvmpipe/ |
| lp_tile_image.c | 160 uint ii = i + x, jj = j + y; local
161 uint src_offset = (jj / tile_h * tiles_per_row + ii / tile_w)
163 uint dst_offset = jj * dst_stride + ii;
180 uint ii = i + x, jj = j + y; local
181 uint src_offset = (jj / tile_h * tiles_per_row + ii / tile_w)
183 uint dst_offset = jj * dst_stride + ii;
200 uint ii = i + x, jj = j + y; local
201 uint tile_offset = ((jj / tile_h) * tiles_per_row + ii / tile_w);
208 ii, jj);
250 uint ii = i + x, jj = j + y local
270 uint ii = i + x, jj = j + y; local
289 uint ii = i + x, jj = j + y; local
[all...] |
| /external/openssl/crypto/evp/ |
| bio_b64.c | 146 int ret=0,i,ii,j,k,x,n,num,ret_code=0; local
283 for (ii=0; ii<n; ii++)
284 ctx->tmp[ii]=p[ii];
|
| /external/ppp/pppd/ |
| md5.c | 73 /* FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4 */
90 #define II(a, b, c, d, x, s, ac) \
129 unsigned int i, ii; local
146 for (i = 0, ii = 0; i < 16; i++, ii += 4)
147 in[i] = (((UINT4)mdContext->in[ii+3]) << 24) |
148 (((UINT4)mdContext->in[ii+2]) << 16) |
149 (((UINT4)mdContext->in[ii+1]) << 8) |
150 ((UINT4)mdContext->in[ii]);
166 unsigned int i, ii; local
[all...] |
