/external/stlport/test/unit/ |
H A D | bvector_test.cpp | 33 bool ii[3]= {1,0,1}; local 46 b.insert(b.begin(),(bool*)ii, ii+2);
|
/external/srec/srec/ca/ |
H A D | utt_proc.c | 40 int ii, frames = 0; local 48 for (ii = 0; ii < hUtt->data.gen_utt.num_chan; ii++) 50 evaluate_parameters(hUtt->data.gen_utt.backchan[ii]); 51 /* log_report ("%d ", hUtt->data.gen_utt.backchan[ii]->mean); */
|
H A D | catrans.c | 136 int ii, jj; local 148 for (ii = 0; ii <= hTransform->dim; ii++) 152 hTransform->mllr_acc.between[ii][jj] = 0; 153 hTransform->mllr_acc.within[ii][jj] = 0; 157 for (ii = 0; ii < hTransform->dim; ii++) 159 hTransform->imelda_acc.wmean[ii] 178 int ii, jj; local 253 int ii, jj; local [all...] |
H A D | pat_basi.c | 80 int ii, ret_code; local 152 for (ii = 0; ii < MAX_WTS; ii++) 153 hPattern->data.prep->exp_wt[ii] = 155 (double) - ii / (MUL_SCALE * hPattern->data.prep->add.scale)) +
|
/external/bzip2/ |
H A D | spewG.c | 40 int ii, kk, p; local 45 for (ii = 0; ii < p; ii++) 47 for (ii = 0; ii < p-1; ii++) 49 for (ii = 0; ii < p+1; ii [all...] |
/external/lldb/test/functionalities/data-formatter/data-formatter-stl/libcxx/multiset/ |
H A D | main.cpp | 25 intset ii; local 28 ii.insert(0); 29 ii.insert(1); 30 ii.insert(2); 31 ii.insert(3); 32 ii.insert(4); 33 ii.insert(5); 36 ii.insert(6); 39 ii.clear();
|
/external/lldb/test/functionalities/data-formatter/data-formatter-stl/libcxx/set/ |
H A D | main.cpp | 25 intset ii; local 28 ii.insert(0); 29 ii.insert(1); 30 ii.insert(2); 31 ii.insert(3); 32 ii.insert(4); 33 ii.insert(5); 36 ii.insert(6); 39 ii.clear();
|
/external/lldb/test/functionalities/data-formatter/data-formatter-stl/libstdcpp/map/ |
H A D | main.cpp | 12 intint_map ii; local 14 ii[0] = 0; // Set break point at this line. 15 ii[1] = 1; 16 ii[2] = 0;// Set break point at this line. 17 ii[3] = 1; 18 ii[4] = 0;// Set break point at this line. 19 ii[5] = 1; 20 ii[6] = 0; 21 ii[7] = 1; 22 ii[8 [all...] |
/external/srec/srec/clib/ |
H A D | imeld_tr.c | 45 int ii, jj; local 52 for (ii = 0; ii < dim; ii++) 54 vec[ii] = 0; 56 vec[ii] += prep->matrix[ii][jj] * fram[jj]; 58 vec[ii] = (imeldata) SHIFT_DOWN((int)vec[ii], 65 for (ii 84 int ii, jj; local [all...] |
H A D | matx_ops.h | 28 int ii, jj; local 35 for (ii = 0; ii < dimr; ii++) 39 sum += matrix[ii][jj] * vector[jj]; 40 outvec[ii] = sum;
|
H A D | log_add.c | 48 int ii; local 65 for (ii = 0; ii <= logtab->add_log_limit; ii++) { 66 table[ii] = (prdata)(logtab->scale * mul_scale * log(1 67 + exp(-(float)ii / ((float)logtab->scale * mul_scale))) 69 PRINT_SOME_CODE(" %d,", table[ii]); 78 for (ii = 0; ii <= logtab->add_log_limit; ii [all...] |
/external/valgrind/main/none/tests/x86/ |
H A D | bt_literal.c | 142 int i, ii; local 144 ii = i; 146 mash_reg_L(i), mash_mem_L(&ii), mash_reg_W(i));
|
/external/chromium_org/third_party/libvpx/source/libvpx/vp9/encoder/ |
H A D | vp9_cost.c | 44 const vp9_tree_index ii = tree[i + b]; local 46 if (ii <= 0) 47 costs[-ii] = cc; 49 cost(costs, tree, probs, ii, cc);
|
/external/clang/test/CodeGen/ |
H A D | unsigned-overflow.c | 6 unsigned int ii, ij, ik; variable 78 ii = ij + ik; 90 ii = ij - ik; 102 ii = ij * ik; 107 opaqueint(ii++); 109 // CHECK: [[T1:%.*]] = load i32* @ii 118 opaqueint(++ii); 120 // CHECK: [[T1:%.*]] = load i32* @ii
|
/external/clang/test/FixIt/ |
H A D | dereference-addressof.c | 8 void ii(int a) {} // expected-note{{passing argument to parameter 'a' here}} function 16 ii(&a); // expected-warning{{incompatible pointer to integer conversion passing 'int *' to parameter of type 'int'; remove &}}
|
/external/clang/test/SemaCXX/ |
H A D | init-priority-attr.cpp | 8 Two( int ii, int jj ) { i = ii; j = jj; k = count++; }; argument
|
/external/libvpx/libvpx/vp9/encoder/ |
H A D | vp9_cost.c | 44 const vp9_tree_index ii = tree[i + b]; local 46 if (ii <= 0) 47 costs[-ii] = cc; 49 cost(costs, tree, probs, ii, cc);
|
/external/lldb/test/functionalities/data-formatter/data-formatter-stl/libcxx/map/ |
H A D | main.cpp | 27 intint_map ii; local 29 ii[0] = 0; // Set break point at this line. 30 ii[1] = 1; 32 ii[2] = 0; 33 ii[3] = 1; 35 ii[4] = 0; 36 ii[5] = 1; 37 ii[6] = 0; 38 ii[7] = 1; 40 ii[8 [all...] |
/external/lldb/test/functionalities/data-formatter/data-formatter-stl/libcxx/multimap/ |
H A D | main.cpp | 27 intint_map ii; local 29 ii.emplace(0,0); // Set break point at this line. 30 ii.emplace(1,1); 32 ii.emplace(2,0); 33 ii.emplace(3,1); 35 ii.emplace(4,0); 36 ii.emplace(5,1); 37 ii.emplace(6,0); 38 ii.emplace(7,1); 40 ii [all...] |
/external/clang/test/CodeGenCXX/ |
H A D | debug-info-template-explicit-specialization.cpp | 85 i<int> ii; variable
|
/external/eigen/unsupported/Eigen/src/LevenbergMarquardt/ |
H A D | LMcovar.h | 28 Index i, j, k, l, ii, jj; local 67 ii = ipvt[i]; 68 if (ii > jj) 69 r(ii,jj) = r(i,j); 70 if (ii < jj) 71 r(jj,ii) = r(i,j);
|
/external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
H A D | covar.h | 15 Index i, j, k, l, ii, jj; local 54 ii = ipvt[i]; 55 if (ii > jj) 56 r(ii,jj) = r(i,j); 57 if (ii < jj) 58 r(jj,ii) = r(i,j);
|
/external/libcxx/test/algorithms/alg.nonmodifying/alg.search/ |
H A D | search.pass.cpp | 52 int ii[] = {1, 1, 2}; local 53 assert(std::search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3)) == Iter1(ih+3));
|
H A D | search_pred.pass.cpp | 95 int ii[] = {1, 1, 2}; local 96 assert(std::search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), count_equal()) == Iter1(ih+3));
|
/external/llvm/test/tools/llvm-cov/Inputs/ |
H A D | test.cpp | 28 void assign(int ii, int jj) { argument 29 grid[ii][jj] = (ii+1) * (jj+1); 33 for (int ii = 0; ii < 2; ii++) 35 assign(ii, jj); 51 for (int ii = 0; ii < 10; ++ii) { [all...] |