| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.unique/ |
| unique_copy_pred.pass.cpp | 125 const int ii[] = {0, 1, 1, 1, 2, 2, 2}; local
126 const unsigned si = sizeof(ii)/sizeof(ii[0]);
129 r = std::unique_copy(InIter(ii), InIter(ii+si), OutIter(ji), count_equal());
|
| /external/skia/src/compute/skc/ |
| scheduler.cpp | 155 for (skc_uint ii=0; ii<size; ii++)
156 scheduler->available.indices[ii] = ii;
|
| /external/skqp/src/compute/skc/ |
| scheduler.cpp | 155 for (skc_uint ii=0; ii<size; ii++)
156 scheduler->available.indices[ii] = ii;
|
| /frameworks/av/media/libeffects/lvm/lib/Bundle/src/ |
| LVM_Control.c | 512 LVM_INT16 ii, jj; local
523 for( ii = 0; ii < pParams->EQNB_NBands; ii++)
525 if((pParams->pEQNB_BandDefinition[ii].Frequency >= pInstance->HeadroomParams.pHeadroomDefinition[jj].Limit_Low) &&
526 (pParams->pEQNB_BandDefinition[ii].Frequency <= pInstance->HeadroomParams.pHeadroomDefinition[jj].Limit_High))
528 if(pParams->pEQNB_BandDefinition[ii].Gain > MaxGain)
530 MaxGain = pParams->pEQNB_BandDefinition[ii].Gain;
1003 LVM_UINT16 ii, NBands; local
1063 LVM_UINT16 ii; local
[all...] |
| /external/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/ |
| default.pass.cpp | 77 int ii[] = {1, 1, 2}; local
78 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3));
|
| /external/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/func.searchers.default.creation/ |
| make_default_searcher.pass.cpp | 62 int ii[] = {1, 1, 2}; local
63 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3));
|
| make_default_searcher.pred.pass.cpp | 74 int ii[] = {1, 1, 2}; local
75 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
|
| /external/libcxx/test/std/utilities/function.objects/func.search/func.search.default/ |
| default.pass.cpp | 77 int ii[] = {1, 1, 2}; local
78 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3));
|
| default.pred.pass.cpp | 89 int ii[] = {1, 1, 2}; local
90 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
|
| /external/skia/src/gpu/text/ |
| GrAtlasManager.cpp | 105 SkImageInfo ii = SkImageInfo::Make(sProxy->width(), sProxy->height(), local
108 if (!bm.tryAllocPixels(ii)) {
117 bool result = sContext->readPixels(ii, bm.getPixels(), bm.rowBytes(), 0, 0);
|
| /external/skqp/src/gpu/text/ |
| GrAtlasManager.cpp | 105 SkImageInfo ii = SkImageInfo::Make(sProxy->width(), sProxy->height(), local
108 if (!bm.tryAllocPixels(ii)) {
118 bool result = sContext->readPixels(ii, bm.getPixels(), bm.rowBytes(), 0, 0);
|
| /external/clang/test/OpenMP/ |
| taskloop_misc_messages.c | 369 for (__int128 ii = 0; ii < 10; ii++) {
370 c[ii] = a[ii] + b[ii];
|
| taskloop_simd_misc_messages.c | 368 for (__int128 ii = 0; ii < 10; ii++) {
369 c[ii] = a[ii] + b[ii];
|
| /external/eigen/unsupported/Eigen/CXX11/src/TensorSymmetry/ |
| StaticSymmetry.h | 121 template<typename Index, std::size_t N, int... ii, int... jj>
122 constexpr static inline std::array<Index, N> tensor_static_symgroup_index_permute(std::array<Index, N> idx, internal::numeric_list<int, ii...>, internal::numeric_list<int, jj...>)
124 return {{ idx[ii]..., idx[jj]... }};
127 template<typename Index, int... ii>
128 static inline std::vector<Index> tensor_static_symgroup_index_permute(std::vector<Index> idx, internal::numeric_list<int, ii...>)
130 std::vector<Index> result{{ idx[ii]... }};
|
| /external/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore/ |
| default.pass.cpp | 77 int ii[] = {1, 1, 2}; local
78 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3));
116 char ii[] = {1, 1, 2}; local
117 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3));
|
| hash.pass.cpp | 83 int ii[] = {1, 1, 2}; local
84 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
117 char ii[] = {1, 1, 2}; local
118 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
|
| hash.pred.pass.cpp | 98 int ii[] = {1, 1, 2}; local
99 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
135 char ii[] = {1, 1, 2}; local
136 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
|
| pred.pass.cpp | 92 int ii[] = {1, 1, 2}; local
93 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
126 char ii[] = {1, 1, 2}; local
127 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
|
| /external/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore_horspool/ |
| default.pass.cpp | 77 int ii[] = {1, 1, 2}; local
78 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3));
116 char ii[] = {1, 1, 2}; local
117 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3));
|
| hash.pass.cpp | 82 int ii[] = {1, 1, 2}; local
83 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
116 char ii[] = {1, 1, 2}; local
117 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
|
| hash.pred.pass.cpp | 95 int ii[] = {1, 1, 2}; local
96 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
129 char ii[] = {1, 1, 2}; local
130 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
|
| pred.pass.cpp | 89 int ii[] = {1, 1, 2}; local
90 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
123 char ii[] = {1, 1, 2}; local
124 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
|
| /external/libcxx/test/std/utilities/function.objects/func.search/func.search.bm/ |
| default.pass.cpp | 78 int ii[] = {1, 1, 2}; local
79 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3));
117 char ii[] = {1, 1, 2}; local
118 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3));
|
| hash.pass.cpp | 84 int ii[] = {1, 1, 2}; local
85 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
118 char ii[] = {1, 1, 2}; local
119 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
|
| hash.pred.pass.cpp | 99 int ii[] = {1, 1, 2}; local
100 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
136 char ii[] = {1, 1, 2}; local
137 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
|
