/dalvik/vm/compiler/codegen/x86/ |
AnalysisO1.cpp | 337 int k, k2; local 343 for(k2 = 0; k2 < num_compile_entries; k2++) { 344 if(compileTable[k2].physicalReg == k) { 539 int k, k2, k3, jj; local 551 for(k2 = 0; k2 < num_bbs_for_method; k2++) { 552 currentBB = method_bbs_sorted[k2]; 1064 int k, k2; local 1226 int k, k2; local 1826 int k2; local [all...] |
/external/guava/guava/src/com/google/common/collect/ |
ImmutableSortedMap.java | 117 of(K k1, V v1, K k2, V v2) { 119 .put(k1, v1).put(k2, v2).build(); 130 of(K k1, V v1, K k2, V v2, K k3, V v3) { 132 .put(k1, v1).put(k2, v2).put(k3, v3).build(); 143 of(K k1, V v1, K k2, V v2, K k3, V v3, K k4, V v4) { 145 .put(k1, v1).put(k2, v2).put(k3, v3).put(k4, v4).build(); 156 of(K k1, V v1, K k2, V v2, K k3, V v3, K k4, V v4, K k5, V v5) { 158 .put(k1, v1).put(k2, v2).put(k3, v3).put(k4, v4).put(k5, v5).build();
|
/external/openfst/src/include/fst/ |
sparse-tuple-weight.h | 279 const K& k2 = (w2_it.Done()) ? w1_it.Value().first : w2_it.Value().first; local 282 if (k1 == k2) { 286 } else if (k1 < k2) { 290 ret->Push(k2, operator_mapper.Map(k2, v1_def, v2)); 307 const K& k2 = (w2_it.Done()) ? w1_it.Value().first : w2_it.Value().first; local 310 if (k1 == k2) { 314 } else if (k1 < k2) {
|
bi-table.h | 146 bool operator()(I k1, I k2) const { 147 return ht_->Key2T(k1) == ht_->Key2T(k2); 307 bool operator()(I k1, I k2) const { 308 return ht_->Key2Entry(k1) == ht_->Key2Entry(k2);
|
/external/chromium/testing/gmock/include/gmock/ |
gmock-generated-actions.h | 392 // SelectArgs<Result, ArgumentTuple, k1, k2, ..., k_n>::type is the 399 // SelectArgs<Result, ArgumentTuple, k1, k2, ..., k_n>::Select(args) 400 // returns the selected fields (k1, k2, ..., k_n) of args as a tuple. 406 // The numbers in list k1, k2, ..., k_n must be >= 0, where n can be 410 template <typename Result, typename ArgumentTuple, int k1, int k2, int k3, 415 GMOCK_FIELD_(ArgumentTuple, k2), GMOCK_FIELD_(ArgumentTuple, k3), 423 return SelectedArgs(get<k1>(args), get<k2>(args), get<k3>(args), 453 template <typename Result, typename ArgumentTuple, int k1, int k2> 455 k1, k2, -1, -1, -1, -1, -1, -1, -1, -1> { 458 GMOCK_FIELD_(ArgumentTuple, k2)); [all...] |
/external/webkit/Source/WebCore/platform/audio/ |
SincResampler.cpp | 177 float* k2 = k1 + m_kernelSize; local 197 sum2 += input * *k2; \ 199 ++k2;
|
/external/webkit/Source/WebCore/svg/ |
SVGFECompositeElement.cpp | 38 DEFINE_ANIMATED_NUMBER(SVGFECompositeElement, SVGNames::k2Attr, K2, k2) 93 return composite->setK2(k2()); 180 k1(), k2(), k3(), k4());
|
/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); 352 h += MUL64((k2 + d2), (k6 + d6)); 373 UINT32 k0,k1,k2,k3,k4,k5,k6,k7, local 378 k0 = *(k+0); k1 = *(k+1); k2 = *(k+2); k3 = *(k+3); 393 h1 += MUL64((k2 + d2), (k6 + d6)); 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); 444 h1 += MUL64((k2 + d2), (k6 + d6)) 475 UINT32 k0,k1,k2,k3,k4,k5,k6,k7, local [all...] |
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/engines/ |
TwofishEngine.java | 390 int k2 = sBoxKeys[2]; local 412 b0 = (P[P_03][b0] & 0xff) ^ b0(k2); 413 b1 = (P[P_13][b1] & 0xff) ^ b1(k2); 414 b2 = (P[P_23][b2] & 0xff) ^ b2(k2); 415 b3 = (P[P_33][b3] & 0xff) ^ b3(k2); 530 int k2 = k32[2]; local 548 b0 = (P[P_03][b0] & 0xff) ^ b0(k2); 549 b1 = (P[P_13][b1] & 0xff) ^ b1(k2); 550 b2 = (P[P_23][b2] & 0xff) ^ b2(k2); 551 b3 = (P[P_33][b3] & 0xff) ^ b3(k2); [all...] |
/external/chromium/net/http/ |
http_auth_handler_ntlm_portable.cc | 277 uint8 k1[8], k2[8]; local 279 DESMakeKey(reinterpret_cast<const uint8*>(passbuf.data()) + 7, k2); 284 DESEncrypt(k2, LM_MAGIC, hash + 8); 324 uint8 keybytes[21], k1[8], k2[8], k3[8]; local 330 DESMakeKey(keybytes + 7, k2); 334 DESEncrypt(k2, challenge, response + 8);
|
/external/openssl/crypto/ec/ |
ec_asn1.c | 105 unsigned int *k2, unsigned int *k3) 119 if (k2) 120 *k2 = group->poly[2]; 132 long k2; member in struct:x9_62_pentanomial_st 200 ASN1_SIMPLE(X9_62_PENTANOMIAL, k2, LONG), 399 unsigned int k1, k2, k3; 401 if (!EC_GROUP_get_pentanomial_basis(group, &k1, &k2, &k3)) 413 char_two->p.ppBasis->k2 = (long)k2; 850 if (!(char_two->m > penta->k3 && penta->k3 > penta->k2 && penta->k2 > penta->k1 && penta->k1 > 0) [all...] |
/external/clang/test/Sema/ |
struct-packed-align.c | 106 extern int k2[__alignof(union au6) == 2 ? 1 : -1];
|
/external/freetype/src/base/ |
fttrigon.c | 68 FT_UInt32 v1, v2, k1, k2, hi, lo1, lo2, lo3; local 78 k2 = (FT_UInt32)(FT_TRIG_SCALE & 0xFFFFL); /* constant */ 81 lo1 = k1 * v2 + k2 * v1; /* can't overflow */ 83 lo2 = ( k2 * v2 ) >> 16;
|
/external/opencv/cv/src/ |
cvundistort.cpp | 55 float k1 = dist_coeffs[0], k2 = dist_coeffs[1], k3 = dist_coeffs[4]; local 68 float kr = 1 + ((k3*r2 + k2)*r2 + k1)*r2; 106 float fx, float fy, float cx, float cy, float k1, float k2, uchar *pBuffer ); 193 float u0, v0, fx, fy, ifx, ify, x0, y0, k1, k2, k3, p1, p2; local 233 k1 = k[0]; k2 = k[1]; k3 = k[4]; 247 double kr = 1 + ((k3*r2 + k2)*r2 + k1)*r2; 277 double fx, fy, u0, v0, k1, k2, k3, p1, p2; local 342 k1 = k[0]; k2 = k[1]; k3 = k[4]; 358 double kr = 1 + ((k3*r2 + k2)*r2 + k1)*r2;
|
/external/qemu/distrib/sdl-1.2.15/Xcode/TemplatesForXcodeLeopard/SDL OpenGL Application/atlantis/ |
atlantis.c | 75 static double k2 = 0.05; local 78 save[1] = save[0]*k1 + k2*(save[3] + save[2]);
|
/external/qemu/distrib/sdl-1.2.15/Xcode/TemplatesForXcodeSnowLeopard/SDL OpenGL Application/atlantis/ |
atlantis.c | 75 static double k2 = 0.05; local 78 save[1] = save[0]*k1 + k2*(save[3] + save[2]);
|
/external/qemu/distrib/sdl-1.2.15/Xcode/TemplatesForXcodeTiger/SDL OpenGL Application/atlantis/ |
atlantis.c | 75 static double k2 = 0.05; local 78 save[1] = save[0]*k1 + k2*(save[3] + save[2]);
|
/external/llvm/include/llvm/ADT/ |
Hashing.h | 170 static const uint64_t k2 = 0x9ae16a3b2f90404fULL; member in namespace:llvm::hashing::detail 202 return shift_mix(y * k2 ^ z * k3 ^ seed) * k2; 219 uint64_t c = fetch64(s + len - 8) * k2; 244 uint64_t r = shift_mix((vf + ws) * k2 + (wf + vs) * k0); 245 return shift_mix((seed ^ (r * k0)) + vs) * k2; 260 return k2 ^ seed;
|
/external/aac/libSBRenc/src/ |
nf_est.cpp | 519 INT k2,kx; local 524 k2=freqBandTable[nSfb]; 536 ratio = fDivNorm(k2, kx, &ratio_e);
|
/external/opencv/ml/src/ |
mlknearest.cpp | 153 int i, j, count = end - start, k1 = 0, k2 = 0, d = var_count; local 194 for( ii1 = k2 - 1; ii1 > ii; ii1-- ) 206 k2 = MIN( k1, k-1 );
|
/external/webrtc/src/modules/audio_processing/utility/ |
fft4g.c | 1004 int j, k1, k2; local 1048 k2 = 2 * k1; 1051 wk1r = w[k2]; 1052 wk1i = w[k2 + 1]; 1077 wk1r = w[k2 + 2]; 1078 wk1i = w[k2 + 3]; 1109 int j, j1, j2, j3, k, k1, k2, m, m2; local 1165 k2 = 2 * k1; 1168 wk1r = w[k2] [all...] |
/external/clang/test/FixIt/ |
fixit.cpp | 192 int k2, // expected-error {{expected ';' at end of declaration}} member in struct:MoreAccidentalCommas
|
/external/apache-xml/src/main/java/org/apache/xalan/processor/ |
XSLTAttributeDef.java | 114 * @param k2 The XSLT name of the enumerated value. 115 * @param v2 An integer representation of k2. 118 boolean prefixedQNameValAllowed, int errorType, String k1, int v1, String k2, int v2) 130 m_enums.put(k2, v2); 145 * @param k2 The XSLT name of the enumerated value. 146 * @param v2 An integer representation of k2. 151 boolean prefixedQNameValAllowed, int errorType, String k1, int v1, String k2, int v2, String k3, int v3) 163 m_enums.put(k2, v2); 178 * @param k2 The XSLT name of the enumerated value. 179 * @param v2 An integer representation of k2 [all...] |
/external/dropbear/libtomcrypt/src/ciphers/ |
kseed.c | 188 #define F(L1, L2, R1, R2, K1, K2) \ 189 T2 = G((R1 ^ K1) ^ (R2 ^ K2)); \ 205 ulong32 tmp, k1, k2, k3, k4; local 217 LOAD32H(k2, key+4); 223 skey->kseed.K[2*i+1] = G(k2 - k4 + KCi[i]); 230 k1 = ((k1 >> 8) | (k2 << 24)) & 0xFFFFFFFF; 231 k2 = ((k2 >> 8) | (tmp << 24)) & 0xFFFFFFFF;
|
/external/webp/src/dsp/ |
enc_sse2.c | 79 // K2 = sqrt(2) * sin (pi/8) ~= 35468 / 2^16 87 // K2 = 35468 => k2 = -30068 93 const __m128i k2 = _mm_set1_epi16(-30068); local 132 // c = MUL(in1, K2) - MUL(in3, K1) = MUL(in1, k2) - MUL(in3, k1) + in1 - in3 133 const __m128i c1 = _mm_mulhi_epi16(in1, k2); 138 // d = MUL(in1, K1) + MUL(in3, K2) = MUL(in1, k1) + MUL(in3, k2) + in1 + in3 140 const __m128i d2 = _mm_mulhi_epi16(in3, k2); [all...] |