/external/clang/test/CodeGenCXX/ |
catch-undef-behavior.cpp | 233 int k1 = a[n]; local 250 return k1 + *r1 + k2; 272 const int *k1 = a + n; local 279 return *k1 + *k2;
|
/external/clang/test/SemaCXX/ |
dr1301.cpp | 66 int k1 = K().j.n; // expected-error {{call to implicitly-deleted default}} variable
|
/prebuilts/ndk/9/platforms/android-19/arch-mips64/usr/include/machine/ |
regdef.h | 93 #define k1 $27 macro
|
/external/chromium_org/chrome/app/ |
chrome_exe_main_win.cc | 28 unsigned short k1 = ::GetAsyncKeyState(VK_CONTROL); local 31 if ((k1 & kPressedMask) && (k2 & kPressedMask))
|
/external/eigen/test/ |
product_large.cpp | 46 std::ptrdiff_t k1 = internal::random<int>(10,100)*16; local 50 internal::computeProductBlockingSizes<float,float>(k1,m1,n1);
|
/development/perftests/panorama/feature_stab/db_vlvm/ |
db_utilities_poly.cpp | 104 double k0,k1; local 132 k1=c1*c3+min4_c0; 137 db_SolveCubic(c_roots,&nr_c_roots,1.0,-c2,k1,k0); 176 double k0,k1; local 204 k1=c1*c3+min4_c0; 209 db_SolveCubic(c_roots,&nr_c_roots,1.0,-c2,k1,k0);
|
db_metrics.h | 328 int k1=0; local 356 x_i[k1]=x_i[ind1]; 357 x_i[k1+1]=x_i[ind1+1]; 359 xp_i[k1]=xp_i[ind1]; 360 xp_i[k1+1]=xp_i[ind1+1]; 362 k1=k1+2;
|
/external/chromium_org/third_party/webrtc/common_audio/resampler/ |
sinc_resampler.cc | 307 const float* const k1 = kernel_ptr + offset_idx * kKernelSize; 308 const float* const k2 = k1 + kKernelSize; 310 // Ensure |k1|, |k2| are 16-byte aligned for SIMD usage. Should always be 312 assert(0u == (reinterpret_cast<uintptr_t>(k1) & 0x0F)); 322 input_ptr, k1, k2, kernel_interpolation_factor); 361 float SincResampler::Convolve_C(const float* input_ptr, const float* k1, 371 sum1 += *input_ptr * *k1++;
|
/packages/apps/Camera/jni/feature_stab/db_vlvm/ |
db_utilities_poly.cpp | 104 double k0,k1; local 132 k1=c1*c3+min4_c0; 137 db_SolveCubic(c_roots,&nr_c_roots,1.0,-c2,k1,k0); 176 double k0,k1; local 204 k1=c1*c3+min4_c0; 209 db_SolveCubic(c_roots,&nr_c_roots,1.0,-c2,k1,k0);
|
db_metrics.h | 328 int k1=0; local 356 x_i[k1]=x_i[ind1]; 357 x_i[k1+1]=x_i[ind1+1]; 359 xp_i[k1]=xp_i[ind1]; 360 xp_i[k1+1]=xp_i[ind1+1]; 362 k1=k1+2;
|
/packages/apps/LegacyCamera/jni/feature_stab/db_vlvm/ |
db_utilities_poly.cpp | 104 double k0,k1; local 132 k1=c1*c3+min4_c0; 137 db_SolveCubic(c_roots,&nr_c_roots,1.0,-c2,k1,k0); 176 double k0,k1; local 204 k1=c1*c3+min4_c0; 209 db_SolveCubic(c_roots,&nr_c_roots,1.0,-c2,k1,k0);
|
db_metrics.h | 328 int k1=0; local 356 x_i[k1]=x_i[ind1]; 357 x_i[k1+1]=x_i[ind1+1]; 359 xp_i[k1]=xp_i[ind1]; 360 xp_i[k1+1]=xp_i[ind1+1]; 362 k1=k1+2;
|
/external/aac/libSBRdec/src/ |
sbrdec_freq_sca.cpp | 195 Choose a stop band between k1 and 64 depending on stopFreq (0..13), 292 INT k1; local 306 k1 = 2*k0; 308 num_bands0 = numberOfBands(bpo_div16, k0, k1, 0); 309 num_bands1 = numberOfBands(bpo_div16, k1, k2, hHeaderData->bs_data.alterScale ); 317 CalcBands(diff0, k0, k1, num_bands0); 327 CalcBands(diff1, k1, k2, num_bands1); 338 cumSum(k1, diff1, num_bands1, &v_k_master[num_bands0]); 343 k1=k2; 345 num_bands0 = numberOfBands(bpo_div16, k0, k1, 0) [all...] |
/external/aac/libSBRenc/src/ |
sbrenc_freq_sca.cpp | 424 INT k1 = 0, i; local 450 k1=2*k0; 452 num_bands0=numberOfBands(b_p_o, k0, k1, FL2FXCONST_DBL(0.5f)); 453 num_bands1=numberOfBands(b_p_o, k1, k2, warp); 455 CalcBands(diff0, k0, k1, num_bands0);/*CalcBands1 => diff0 */ 466 CalcBands(diff1, k1, k2, num_bands1); /* CalcBands2 => diff1 */ 475 cumSum(k1, diff1, num_bands1, &v_k_master[num_bands0]); 481 k1=k2; 483 num_bands0=numberOfBands(b_p_o, k0, k1, FL2FXCONST_DBL(0.5f)); 484 CalcBands(diff0, k0, k1, num_bands0);/* CalcBands1 => diff0 * [all...] |
/external/guava/guava/src/com/google/common/collect/ |
ImmutableMultimap.java | 72 public static <K, V> ImmutableMultimap<K, V> of(K k1, V v1) { 73 return ImmutableListMultimap.of(k1, v1); 79 public static <K, V> ImmutableMultimap<K, V> of(K k1, V v1, K k2, V v2) { 80 return ImmutableListMultimap.of(k1, v1, k2, v2); 87 K k1, V v1, K k2, V v2, K k3, V v3) { 88 return ImmutableListMultimap.of(k1, v1, k2, v2, k3, v3); 95 K k1, V v1, K k2, V v2, K k3, V v3, K k4, V v4) { 96 return ImmutableListMultimap.of(k1, v1, k2, v2, k3, v3, k4, v4); 103 K k1, V v1, K k2, V v2, K k3, V v3, K k4, V v4, K k5, V v5) { 104 return ImmutableListMultimap.of(k1, v1, k2, v2, k3, v3, k4, v4, k5, v5) [all...] |
ImmutableSetMultimap.java | 72 public static <K, V> ImmutableSetMultimap<K, V> of(K k1, V v1) { 74 builder.put(k1, v1); 83 public static <K, V> ImmutableSetMultimap<K, V> of(K k1, V v1, K k2, V v2) { 85 builder.put(k1, v1); 96 K k1, V v1, K k2, V v2, K k3, V v3) { 98 builder.put(k1, v1); 110 K k1, V v1, K k2, V v2, K k3, V v3, K k4, V v4) { 112 builder.put(k1, v1); 125 K k1, V v1, K k2, V v2, K k3, V v3, K k4, V v4, K k5, V v5) { 127 builder.put(k1, v1) [all...] |
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
ImmutableMultimap.java | 71 public static <K, V> ImmutableMultimap<K, V> of(K k1, V v1) { 72 return ImmutableListMultimap.of(k1, v1); 78 public static <K, V> ImmutableMultimap<K, V> of(K k1, V v1, K k2, V v2) { 79 return ImmutableListMultimap.of(k1, v1, k2, v2); 86 K k1, V v1, K k2, V v2, K k3, V v3) { 87 return ImmutableListMultimap.of(k1, v1, k2, v2, k3, v3); 94 K k1, V v1, K k2, V v2, K k3, V v3, K k4, V v4) { 95 return ImmutableListMultimap.of(k1, v1, k2, v2, k3, v3, k4, v4); 102 K k1, V v1, K k2, V v2, K k3, V v3, K k4, V v4, K k5, V v5) { 103 return ImmutableListMultimap.of(k1, v1, k2, v2, k3, v3, k4, v4, k5, v5) [all...] |
ImmutableSetMultimap.java | 67 public static <K, V> ImmutableSetMultimap<K, V> of(K k1, V v1) { 69 builder.put(k1, v1); 78 public static <K, V> ImmutableSetMultimap<K, V> of(K k1, V v1, K k2, V v2) { 80 builder.put(k1, v1); 91 K k1, V v1, K k2, V v2, K k3, V v3) { 93 builder.put(k1, v1); 105 K k1, V v1, K k2, V v2, K k3, V v3, K k4, V v4) { 107 builder.put(k1, v1); 120 K k1, V v1, K k2, V v2, K k3, V v3, K k4, V v4, K k5, V v5) { 122 builder.put(k1, v1) [all...] |
ImmutableSortedMap.java | 93 of(K k1, V v1) { 94 return create(Ordering.natural(), entryOf(k1, v1)); 98 of(K k1, V v1, K k2, V v2) { 100 .put(k1, v1).put(k2, v2).build(); 104 of(K k1, V v1, K k2, V v2, K k3, V v3) { 106 .put(k1, v1).put(k2, v2).put(k3, v3).build(); 110 of(K k1, V v1, K k2, V v2, K k3, V v3, K k4, V v4) { 112 .put(k1, v1).put(k2, v2).put(k3, v3).put(k4, v4).build(); 116 of(K k1, V v1, K k2, V v2, K k3, V v3, K k4, V v4, K k5, V v5) { 118 .put(k1, v1).put(k2, v2).put(k3, v3).put(k4, v4).put(k5, v5).build() [all...] |
/external/chromium_org/third_party/WebKit/Source/platform/audio/ |
SincResampler.cpp | 240 float* k1 = m_kernelStorage.data() + offsetIndex * m_kernelSize; local 241 float* k2 = k1 + m_kernelSize; 258 sum1 += input * *k1; \ 260 ++k1; \ 283 bool k1Aligned = !(reinterpret_cast<uintptr_t>(k1) & 0x0F); 288 mK1 = _mm_##l1##_ps(k1); \ 297 k1 += 4; \ 310 } else if (k1Aligned && !k2Aligned) { // only k1 aligned
|
/external/chromium_org/tools/resources/ |
optimize-png-files.sh | 84 pngout -q -k1 -s1 -f$j $opts $file 90 pngout -q -k1 -s1 -b$i -f$j $opts $file 158 pngout -q -k1 -ks -s1 -n$i $file 178 pngout -q -k1 -ks -s0 -r $file 270 pngout -q -k1 -s1 $file 278 pngout -q -k1 -ks -s$i $file 281 pngout -q -k1 -ks -s1 $file
|
/external/chromium_org/third_party/mesa/src/src/mesa/program/ |
prog_noise.c | 352 int i1, j1, k1; /* Offsets for second corner of simplex in (i,j,k) coords */ local 360 k1 = 0; 368 k1 = 0; 376 k1 = 1; 386 k1 = 1; 394 k1 = 0; 402 k1 = 0; 417 z1 = z0 - k1 + G3; 445 t1 * t1 * grad3(perm[ii + i1 + perm[jj + j1 + perm[kk + k1]]], x1, 525 int i1, j1, k1, l1; /* The integer offsets for the second simplex corner * local [all...] |
/external/mesa3d/src/mesa/program/ |
prog_noise.c | 352 int i1, j1, k1; /* Offsets for second corner of simplex in (i,j,k) coords */ local 360 k1 = 0; 368 k1 = 0; 376 k1 = 1; 386 k1 = 1; 394 k1 = 0; 402 k1 = 0; 417 z1 = z0 - k1 + G3; 445 t1 * t1 * grad3(perm[ii + i1 + perm[jj + j1 + perm[kk + k1]]], x1, 525 int i1, j1, k1, l1; /* The integer offsets for the second simplex corner * local [all...] |
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/ |
jsdifflib.js | 254 var i1 = j1 = k1 = block = 0; 262 if (i1 + k1 == i2 && j1 + k1 == j2) { 263 k1 += k2; 265 if (k1) non_adjacent.push([i1, j1, k1]); 268 k1 = k2; 273 if (k1) non_adjacent.push([i1, j1, k1]);
|
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/ |
WNafUtil.java | 114 BigInteger k0 = g, k1 = h; local 117 while (k0.signum() > 0 || k1.signum() > 0 || d0 > 0 || d1 > 0) 119 int n0 = (k0.intValue() + d0) & 7, n1 = (k1.intValue() + d1) & 7; 151 k1 = k1.shiftRight(1);
|