HomeSort by relevance Sort by last modified time
    Searched defs:jj (Results 1 - 25 of 64) sorted by null

1 2 3

  /external/chromium_org/third_party/webrtc/common_audio/signal_processing/
get_hanning_window.c 58 int jj; local
71 for (jj = 0; jj < size; jj++)
  /external/google-tv-pairing-protocol/java/src/com/google/polo/json/
Test.java 22 JSONStringer jj; local
121 jj = new JSONStringer();
122 s = jj
156 jj = new JSONStringer();
157 jj.array();
158 jj.value(1);
159 jj.array();
160 jj.value(null);
161 jj.array();
162 jj.object()
    [all...]
  /external/eigen/unsupported/Eigen/src/LevenbergMarquardt/
LMcovar.h 28 Index i, j, k, l, ii, jj; local
62 jj = ipvt[j];
68 if (ii > jj)
69 r(ii,jj) = r(i,j);
70 if (ii < jj)
71 r(jj,ii) = r(i,j);
73 wa[jj] = r(j,j);
  /external/eigen/unsupported/Eigen/src/NonLinearOptimization/
covar.h 15 Index i, j, k, l, ii, jj; local
49 jj = ipvt[j];
55 if (ii > jj)
56 r(ii,jj) = r(i,j);
57 if (ii < jj)
58 r(jj,ii) = r(i,j);
60 wa[jj] = r(j,j);
  /external/clang/test/CodeGenCXX/
debug-info-template-explicit-specialization.cpp 92 j<int> jj; variable
  /external/chromium_org/gpu/command_buffer/client/
vertex_array_object_manager_unittest.cc 88 for (size_t jj = 0; jj < 4u; ++jj) {
89 manager_->SetAttribEnable(jj, true);
110 for (size_t jj = 0; jj < 4; ++jj) {
113 jj, GL_VERTEX_ATTRIB_ARRAY_BUFFER_BINDING, &param));
114 EXPECT_EQ(expected[ii][jj], param)
115 << "id: " << ids[ii] << ", attrib: " << jj; local
    [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/eigen/Eigen/src/SparseLU/
SparseLU_panel_bmod.h 61 Index ksub,jj,nextl_col; local
88 for (jj = jcol; jj < jcol + w; jj++)
90 nextl_col = (jj-jcol) * m;
109 for (jj = jcol; jj < jcol + w; jj++)
111 nextl_col = (jj-jcol) * m;
156 for (jj = jcol; jj < jcol + w; jj++
    [all...]
  /external/libselinux/src/
label_android_property.c 53 unsigned int ii, jj; local
58 for (jj = ii + 1; jj < data->nspec; jj++) {
59 if ((!strcmp(spec_arr[jj].property_key, curr_spec->property_key))) {
63 (spec_arr[jj].lr.ctx_raw,
69 spec_arr[jj].lr.ctx_raw,
  /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 306 int z,jj; local
309 jj=(i>>2)<<2;
311 jj = i & ~3; /* process per 4 */
314 (unsigned char *)ctx->tmp,jj);
315 if (jj > 2)
317 if (ctx->tmp[jj-1] == '=')
320 if (ctx->tmp[jj-2] == '=')
324 /* z is now number of output bytes and jj is the
326 if (jj != i)
328 memmove(ctx->tmp, &ctx->tmp[jj], i-jj)
    [all...]
  /bootable/recovery/applypatch/
bsdiff.c 62 off_t i,j,k,x,tmp,jj,kk; local
84 jj=0;kk=0;
86 if(V[I[i]+h]<x) jj++;
89 jj+=start;kk+=jj;
92 while(i<jj) {
96 tmp=I[i];I[i]=I[jj+j];I[jj+j]=tmp;
104 while(jj+j<kk) {
105 if(V[I[jj+j]+h]==x)
    [all...]
  /external/bsdiff/
bsdiff.c 45 off_t i,j,k,x,tmp,jj,kk; local
67 jj=0;kk=0;
69 if(V[I[i]+h]<x) jj++;
72 jj+=start;kk+=jj;
75 while(i<jj) {
79 tmp=I[i];I[i]=I[jj+j];I[jj+j]=tmp;
87 while(jj+j<kk) {
88 if(V[I[jj+j]+h]==x)
    [all...]
  /external/bzip2/
decompress.c 360 Int32 ii, jj, kk; local
363 for (jj = MTFL_SIZE-1; jj >= 0; jj--) {
364 s->mtfa[kk] = (UChar)(ii * MTFL_SIZE + jj);
425 Int32 ii, jj, kk, pp, lno, off; local
466 for (jj = MTFL_SIZE-1; jj >= 0; jj--) {
467 s->mtfa[kk] = s->mtfa[s->mtfbase[ii] + jj];
    [all...]
  /external/chromium_org/courgette/third_party/
bsdiff_create.cc 55 int i,j,k,x,tmp,jj,kk; local
77 jj=0;kk=0;
79 if(V[I[i]+h]<x) jj++;
82 jj+=start;kk+=jj;
85 while(i<jj) {
89 tmp=I[i];I[i]=I[jj+j];I[jj+j]=tmp;
97 while(jj+j<kk) {
98 if(V[I[jj+j]+h]==x)
    [all...]
  /external/chromium_org/third_party/opus/src/tests/
test_opus_decode.c 287 int jj; local
288 for(jj=0;jj<j;jj++)packet[jj+1]=fast_rand()&255;
test_opus_api.c 711 opus_int32 i,j,jj,sz; local
742 for(jj=0;jj<=1275*2+3;jj++)
745 ret=opus_packet_parse(packet,jj,&toc,frames,size,&payload_offset);
747 if((jj&1)==1 && jj<=2551)
752 if(size[0]!=size[1] || size[0]!=((jj-1)>>1))test_failed();
826 for(jj=49;jj<=64;jj++
    [all...]
test_opus_encode.c 402 int jj,dec2; local
428 for(j=(frames[0]-packet);j<len;j++)for(jj=0;jj<8;jj++)packet[j]^=((!no_fuzz)&&((fast_rand()&1023)==0))<<jj;
  /external/clang/test/OpenMP/
for_loop_messages.cpp 18 int ii, jj, kk; local
116 for (int i = 0; jj < kk; ii++)
158 for (ii = 0; ii < 10; ++jj)
159 c[ii] = a[jj];
189 for (ii = 0; ii < 10; jj = ii + 2)
196 for (ii = 0; ii<10; jj> kk + 2)
215 for (ii = 0; ii < 10; ii ? ++ii : ++jj)
parallel_for_loop_messages.cpp 18 int ii, jj, kk; local
99 for (int i = 0; jj < kk; ii++)
134 for (ii = 0; ii < 10; ++jj)
135 c[ii] = a[jj];
160 for (ii = 0; ii < 10; jj = ii + 2)
166 for (ii = 0; ii<10; jj> kk + 2)
182 for (ii = 0; ii < 10; ii ? ++ii : ++jj)
simd_loop_messages.cpp 9 int ii, jj, kk; local
90 for (int i = 0; jj < kk; ii++)
125 for (ii = 0; ii < 10; ++jj)
126 c[ii] = a[jj];
151 for (ii = 0; ii < 10; jj = ii + 2)
157 for (ii = 0; ii < 10; jj > kk + 2)
173 for (ii = 0; ii < 10; ii ? ++ii : ++jj)
246 #pragma omp simd lastprivate(ii) linear(jj) collapse(2) // expected-note {{defined as linear}}
248 for (jj = 0; jj < 10; jj++) // expected-error {{loop iteration variable in the associated loop of 'omp simd' direc (…)
    [all...]
  /external/eigen/Eigen/src/IterativeLinearSolvers/
IncompleteLUT.h 325 Index jj = 0; local
327 while (jj < sizel)
330 // we must select first the smallest column index among ju(jj:sizel)
332 Index minrow = ju.segment(jj,sizel-jj).minCoeff(&k); // k is relative to the segment
333 k += jj;
334 if (minrow != ju(jj))
337 Index j = ju(jj);
338 swap(ju(jj), ju(k));
339 jr(minrow) = jj; jr(j) = k
    [all...]
  /external/eigen/bench/
sparse_setter.cpp 364 for(I jj = row_start; jj < row_end; jj++){
365 temp.push_back(std::make_pair(Aj[jj],Ax[jj]));
370 for(I jj = row_start, n = 0; jj < row_end; jj++, n++){
371 Aj[jj] = temp[n].first;
372 Ax[jj] = temp[n].second
387 I jj = row_end; local
    [all...]
  /external/libopus/tests/
test_opus_decode.c 287 int jj; local
288 for(jj=0;jj<j;jj++)packet[jj+1]=fast_rand()&255;
  /external/chromium_org/chrome/installer/mac/third_party/bsdiff/
goobsdiff.c 60 off_t i,j,k,x,tmp,jj,kk; local
82 jj=0;kk=0;
84 if(V[I[i]+h]<x) jj++;
87 jj+=start;kk+=jj;
90 while(i<jj) {
94 tmp=I[i];I[i]=I[jj+j];I[jj+j]=tmp;
102 while(jj+j<kk) {
103 if(V[I[jj+j]+h]==x)
    [all...]

Completed in 2017 milliseconds

1 2 3