HomeSort by relevance Sort by last modified time
    Searched refs:k0 (Results 26 - 50 of 95) sorted by null

12 3 4

  /packages/apps/Camera/jni/feature_stab/db_vlvm/
db_utilities_poly.cpp 104 double k0,k1; local
131 k0=min4_c0*c3c3through4_min_c2-c1*c1;
137 db_SolveCubic(c_roots,&nr_c_roots,1.0,-c2,k1,k0);
176 double k0,k1; local
203 k0=min4_c0*c3c3through4_min_c2-c1*c1;
209 db_SolveCubic(c_roots,&nr_c_roots,1.0,-c2,k1,k0);
  /packages/apps/Camera2/jni/feature_stab/db_vlvm/
db_utilities_poly.cpp 104 double k0,k1; local
131 k0=min4_c0*c3c3through4_min_c2-c1*c1;
137 db_SolveCubic(c_roots,&nr_c_roots,1.0,-c2,k1,k0);
176 double k0,k1; local
203 k0=min4_c0*c3c3through4_min_c2-c1*c1;
209 db_SolveCubic(c_roots,&nr_c_roots,1.0,-c2,k1,k0);
  /packages/apps/LegacyCamera/jni/feature_stab/db_vlvm/
db_utilities_poly.cpp 104 double k0,k1; local
131 k0=min4_c0*c3c3through4_min_c2-c1*c1;
137 db_SolveCubic(c_roots,&nr_c_roots,1.0,-c2,k1,k0);
176 double k0,k1; local
203 k0=min4_c0*c3c3through4_min_c2-c1*c1;
209 db_SolveCubic(c_roots,&nr_c_roots,1.0,-c2,k1,k0);
  /external/bzip2/
bzlib.c 564 s->state_out_ch = s->k0;
568 if (k1 != s->k0) { s->k0 = k1; continue; };
574 if (k1 != s->k0) { s->k0 = k1; continue; };
580 if (k1 != s->k0) { s->k0 = k1; continue; };
585 BZ_GET_FAST(s->k0); BZ_RAND_UPD_MASK;
586 s->k0 ^= BZ_RAND_MASK; s->nblock_used++;
596 Int32 c_k0 = s->k0;
    [all...]
  /external/webrtc/src/modules/audio_coding/codecs/isac/fix/source/
fft.c 74 WebRtc_Word16 k0, k1, k2, k3, k4, kk; local
98 k0 = kk;
99 k1 = k0 + 60;
103 akpQx = RexQx[k0] + RexQx[k2];
104 akmQx = RexQx[k0] - RexQx[k2];
107 bkpQx = ImxQx[k0] + ImxQx[k2];
108 bkmQx = ImxQx[k0] - ImxQx[k2];
112 RexQx[k0] = akpQx + ajpQx;
113 ImxQx[k0] = bkpQx + bjpQx;
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/engines/
TwofishEngine.java 389 int k0 = sBoxKeys[0]; local
401 gSBox[i*2] = gMDS0[(P[P_01][b0] & 0xff) ^ b0(k0)];
402 gSBox[i*2+1] = gMDS1[(P[P_11][b1] & 0xff) ^ b1(k0)];
403 gSBox[i*2+0x200] = gMDS2[(P[P_21][b2] & 0xff) ^ b2(k0)];
404 gSBox[i*2+0x201] = gMDS3[(P[P_31][b3] & 0xff) ^ b3(k0)];
420 [(P[P_02][b0] & 0xff) ^ b0(k1)] & 0xff) ^ b0(k0)];
422 [(P[P_12][b1] & 0xff) ^ b1(k1)] & 0xff) ^ b1(k0)];
424 [(P[P_22][b2] & 0xff) ^ b2(k1)] & 0xff) ^ b2(k0)];
426 [(P[P_32][b3] & 0xff) ^ b3(k1)] & 0xff) ^ b3(k0)];
529 int k0 = k32[0] local
    [all...]
  /external/chromium_org/third_party/mesa/src/src/mesa/main/
mipmap.c 160 const GLuint k0 = (srcWidth == dstWidth) ? 0 : 1; local
175 for (i = j = 0, k = k0; i < (GLuint) dstWidth;
188 for (i = j = 0, k = k0; i < (GLuint) dstWidth;
200 for (i = j = 0, k = k0; i < (GLuint) dstWidth;
211 for (i = j = 0, k = k0; i < (GLuint) dstWidth;
222 for (i = j = 0, k = k0; i < (GLuint) dstWidth;
235 for (i = j = 0, k = k0; i < (GLuint) dstWidth;
247 for (i = j = 0, k = k0; i < (GLuint) dstWidth;
258 for (i = j = 0, k = k0; i < (GLuint) dstWidth;
269 for (i = j = 0, k = k0; i < (GLuint) dstWidth
794 const GLuint k0 = (srcWidth == dstWidth) ? 0 : 1; local
    [all...]
  /external/mesa3d/src/mesa/main/
mipmap.c 153 const GLuint k0 = (srcWidth == dstWidth) ? 0 : 1; local
168 for (i = j = 0, k = k0; i < (GLuint) dstWidth;
181 for (i = j = 0, k = k0; i < (GLuint) dstWidth;
193 for (i = j = 0, k = k0; i < (GLuint) dstWidth;
204 for (i = j = 0, k = k0; i < (GLuint) dstWidth;
215 for (i = j = 0, k = k0; i < (GLuint) dstWidth;
228 for (i = j = 0, k = k0; i < (GLuint) dstWidth;
240 for (i = j = 0, k = k0; i < (GLuint) dstWidth;
251 for (i = j = 0, k = k0; i < (GLuint) dstWidth;
262 for (i = j = 0, k = k0; i < (GLuint) dstWidth
787 const GLuint k0 = (srcWidth == dstWidth) ? 0 : 1; local
    [all...]
  /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/
u_gen_mipmap.c 173 const uint k0 = (srcWidth == dstWidth) ? 0 : 1; local
188 for (i = j = 0, k = k0; i < (uint) dstWidth;
201 for (i = j = 0, k = k0; i < (uint) dstWidth;
213 for (i = j = 0, k = k0; i < (uint) dstWidth;
224 for (i = j = 0, k = k0; i < (uint) dstWidth;
235 for (i = j = 0, k = k0; i < (uint) dstWidth;
248 for (i = j = 0, k = k0; i < (uint) dstWidth;
260 for (i = j = 0, k = k0; i < (uint) dstWidth;
271 for (i = j = 0, k = k0; i < (uint) dstWidth;
282 for (i = j = 0, k = k0; i < (uint) dstWidth
550 const uint k0 = (srcWidth == dstWidth) ? 0 : 1; local
    [all...]
  /external/mesa3d/src/gallium/auxiliary/util/
u_gen_mipmap.c 173 const uint k0 = (srcWidth == dstWidth) ? 0 : 1; local
188 for (i = j = 0, k = k0; i < (uint) dstWidth;
201 for (i = j = 0, k = k0; i < (uint) dstWidth;
213 for (i = j = 0, k = k0; i < (uint) dstWidth;
224 for (i = j = 0, k = k0; i < (uint) dstWidth;
235 for (i = j = 0, k = k0; i < (uint) dstWidth;
248 for (i = j = 0, k = k0; i < (uint) dstWidth;
260 for (i = j = 0, k = k0; i < (uint) dstWidth;
271 for (i = j = 0, k = k0; i < (uint) dstWidth;
282 for (i = j = 0, k = k0; i < (uint) dstWidth
550 const uint k0 = (srcWidth == dstWidth) ? 0 : 1; local
    [all...]
  /external/srec/srec/cfront/
sp_fft.c 486 unsigned n, m, n4, i, j, k, ii, k0; local
530 k0 = indexTbl[k] + j;
531 k0 <<= 1;
532 comp_L_butterfly1(j, n4, cc1, ss1, cc3, ss3, data + k0);
544 k0 = indexTbl[k];
545 k0 <<= 1;
546 four_point_fft1(data + k0);
554 k0 = indexTbl[k];
555 k0 <<= 1;
557 /* k0 = 0 implies these nodes have been computed *
    [all...]
  /external/clang/test/SemaCXX/
address-of-temporary.cpp 51 void k0() { consume(S { Y().a }); } function in namespace:PointerToArrayDecay
  /external/eigen/unsupported/test/
FFTW.cpp 37 for (size_t k0=0;k0<(size_t)fftbuf.size();++k0) {
39 long double phinc = -2.*k0* pi / timebuf.size();
44 complex<long double> x = promote(fftbuf[k0]);
47 //cerr << k0 << "\t" << acc << "\t" << x << "\t" << sqrt(norm(dif)) << endl;
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/src/
hash.cpp 189 // Start searching list of potential primes: L * k0 + indices[in]
193 size_t k0 = n / L; local
194 size_t in = static_cast<size_t>(std::lower_bound(indices, indices + M, n - k0 * L)
196 n = L * k0 + indices[in];
563 ++k0;
566 n = L * k0 + indices[in];
  /frameworks/opt/datetimepicker/src/com/android/datetimepicker/time/
TimePickerDialog.java 811 int k0 = KeyEvent.KEYCODE_0;
826 Node minuteFirstDigit = new Node(k0, k1, k2, k3, k4, k5);
827 Node minuteSecondDigit = new Node(k0, k1, k2, k3, k4, k5, k6, k7, k8, k9)
    [all...]
  /external/chromium/testing/gmock/include/gmock/
gmock-generated-matchers.h 53 // TupleFields<Tuple, k0, ..., kn> is for selecting fields from a
57 // GetSelectedFields(t): returns fields k0, ..., and kn of t as a tuple.
64 template <class Tuple, int k0 = -1, int k1 = -1, int k2 = -1, int k3 = -1,
70 template <class Tuple, int k0, int k1, int k2, int k3, int k4, int k5, int k6,
74 typedef ::std::tr1::tuple<GMOCK_FIELD_TYPE_(Tuple, k0),
82 return type(get<k0>(t), get<k1>(t), get<k2>(t), get<k3>(t), get<k4>(t),
99 template <class Tuple, int k0>
100 class TupleFields<Tuple, k0, -1, -1, -1, -1, -1, -1, -1, -1, -1> {
102 typedef ::std::tr1::tuple<GMOCK_FIELD_TYPE_(Tuple, k0)> type;
105 return type(get<k0>(t))
    [all...]
  /external/openssh/
umac.c 340 UINT32 k0,k1,k2,k3,k4,k5,k6,k7; local
348 k0 = *(k+0); k1 = *(k+1); k2 = *(k+2); k3 = *(k+3);
350 h += MUL64((k0 + d0), (k4 + d4));
373 UINT32 k0,k1,k2,k3,k4,k5,k6,k7, local
378 k0 = *(k+0); k1 = *(k+1); k2 = *(k+2); k3 = *(k+3);
387 h1 += MUL64((k0 + d0), (k4 + d4));
399 k0 = k8; k1 = k9; k2 = k10; k3 = k11;
420 UINT32 k0,k1,k2,k3,k4,k5,k6,k7, local
426 k0 = *(k+0); k1 = *(k+1); k2 = *(k+2); k3 = *(k+3);
436 h1 += MUL64((k0 + d0), (k4 + d4))
475 UINT32 k0,k1,k2,k3,k4,k5,k6,k7, local
    [all...]
  /external/eigen/Eigen/src/Core/
PermutationMatrix.h 569 int k0 = r++; local
570 int kPrev = k0;
571 mask.coeffRef(k0) = true;
572 for(int k=m_permutation.indices().coeff(k0); k!=k0; k=m_permutation.indices().coeff(k))
576 (dst,((Side==OnTheLeft) ^ Transposed) ? k0 : kPrev));
  /dalvik/vm/compiler/template/mips/
TEMPLATE_RESTORE_STATE.S 44 lw k0, r_K0*4(a0) # restore k0
TEMPLATE_SAVE_STATE.S 56 sw k0, r_K0*4(a0) # save k0
TEMPLATE_MEM_OP_DECODE.S 76 sw k0, r_K0*-4(sp) # push k0
123 lw k0, r_K0*-4(sp) # pop k0
  /external/svox/pico/lib/
picofftsg.c 670 picoos_int32 j0, k0, j1, k1, l, m, i, j, k, nh, m2; local
681 for (k0 = 0; k0 < m; k0 += 4) {
682 k = k0;
683 for (j = j0; j < j0 + k0; j += 4) {
846 k1 = j0 + k0;
913 for (k0 = 0; k0 < m; k0 += 4)
1029 picoos_int32 j0, k0, j1, k1, l, m, i, j, k, nh, m2; local
1583 picoos_int32 j0, k0, j1, k1, l, m, i, j, k, nh; local
    [all...]
  /frameworks/native/services/sensorservice/
Fusion.cpp 410 const float k0 = (1-cosf(lwedT))*(ilwe*ilwe); local
421 Phi[0][0] = I33 - wx*(k1*ilwe) + wx2*k0;
422 Phi[1][0] = wx*k0 - I33dT - wx2*(ilwe*ilwe*ilwe)*(lwedT-k1);
456 // | K0 | * | L 0 | * P = | K0*L 0 | * | P00 P10 | = | K0*L*P00 K0*L*P10 |
  /external/valgrind/main/VEX/switchback/
test_bzip2.c 740 Int32 k0; member in struct:__anon29461
    [all...]
  /external/valgrind/main/exp-sgcheck/tests/
hackedbz2.c 763 Int32 k0; member in struct:__anon29928
    [all...]

Completed in 927 milliseconds

12 3 4