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

1 2 3 4

  /external/webkit/JavaScriptCore/tests/mozilla/js1_5/Regress/
regress-80981.js 56 var i2 = 3011; variable
57 var n = new Array (i2);
82 for (i=0; i<i2; i++) {n[i] = 0;}
85 while (k++ <= i2)
87 switch (j = (k*73)%i2)
    [all...]
  /dalvik/dx/tests/074-dex-form35c-edge-case/
Blort.java 22 int i2 = 0; local
  /external/dropbear/libtomcrypt/testprof/
pkcs_1_test.c 9 unsigned long x, y, l1, l2, l3, i1, i2, lparamlen, saltlen, modlen; local
70 buf[1][i2 = abs(rand()) % (l1 - 1)] ^= 1;
  /dalvik/dx/tests/084-dex-high-register-moves/
Blort.java 26 int i2 = 0; local
  /dalvik/tests/027-arithmetic/src/
Main.java 14 int i1, i2; local
17 i2 = mBytes[4] | mBytes[5] << 8 | mBytes[6] << 16 | mBytes[7] << 24;
18 l = i1 | ((long)i2 << 32);
21 + " and " + Integer.toHexString(i2));
  /external/stlport/test/unit/
iter_test.cpp 132 vector<bool>::iterator i2 = boolVector.begin(); local
133 ++i2;
136 bool v1 = *i2;
138 iter_swap( i1, i2 );
140 CPPUNIT_ASSERT(( *i1 == v1 && *i2 == v0 ));
list_test.cpp 63 list<int>::iterator i2 = l2.begin(); local
76 CPPUNIT_ASSERT( i2 == l1.begin() );
  /external/webkit/WebCore/platform/graphics/filters/
FEComposite.cpp 112 unsigned char i2 = srcPixelArrayB->get(pixelOffset + channel); local
114 double result = scaledK1 * i1 * i2 + k2 * i1 + k3 * i2 + scaledK4;
  /system/extras/tests/bionic/libstdc++/
test_climits.cpp 53 volatile int i2 = INT_MIN; local
  /cts/tests/tests/graphics/src/android/graphics/cts/
RadialGradientTest.java 97 int i2 = idx; // index of next higher color and position local
98 double delta = (dist - positions[i1]) / (positions[i2] - positions[i1]);
100 delta * Color.alpha(colors[i2]));
102 delta * Color.red(colors[i2]));
104 delta * Color.green(colors[i2]));
106 delta * Color.blue(colors[i2]));
SweepGradientTest.java 127 int i2 = idx; // index of next higher color and position local
128 double delta = (relPos - positions[i1]) / (positions[i2] - positions[i1]);
130 delta * Color.alpha(colors[i2]));
132 delta * Color.red(colors[i2]));
134 delta * Color.green(colors[i2]));
136 delta * Color.blue(colors[i2]));
  /dalvik/libcore/luni/src/main/java/java/io/
DataInputStream.java 356 int i2 = ((buff[4] & 0xff) << 24) | ((buff[5] & 0xff) << 16) | local
359 return ((i1 & 0xffffffffL) << 32) | (i2 & 0xffffffffL);
  /dalvik/libcore/security/src/main/java/org/bouncycastle/crypto/engines/
DESEngine.java 382 int i1, i2; local
385 i2 = newKey[i + 1];
388 | ((i2 & 0x00fc0000) >>> 10) | ((i2 & 0x00000fc0) >>> 6);
391 | ((i2 & 0x0003f000) >>> 4) | (i2 & 0x0000003f);
  /external/apache-http/src/org/apache/http/impl/cookie/
BrowserCompatSpec.java 116 int i2 = headervalue.indexOf(';', i1); local
117 if (i2 == -1) {
118 i2 = headervalue.length();
121 DateUtils.parseDate(headervalue.substring(i1, i2), this.datepatterns);
  /external/apache-http/src/org/apache/http/message/
BasicHeaderValueParser.java 382 int i2 = pos; local
384 while (i1 < i2 && (HTTP.isWhitespace(buffer.charAt(i1)))) {
388 while ((i2 > i1) && (HTTP.isWhitespace(buffer.charAt(i2 - 1)))) {
389 i2--;
392 if (((i2 - i1) >= 2)
394 && (buffer.charAt(i2 - 1) == '"')) {
396 i2--;
398 value = buffer.substring(i1, i2);
  /external/opencore/codecs_v2/audio/gsm_amr/amr_nb/enc/src/
s10_8pf.cpp 189 Word16 i0, i1, i2, i3, i4, i5, i6, i7, i8, i9;
232 // i2 and i3 loop
250 for (i2 = ipos[2]; i2 < L_CODE; i2 += step)
253 ps1 = add (ps0, dn[i2]);
256 alp1 = L_mac (alp0, rr[i2][i2], _1_16);
259 alp1 = L_mac (alp1, rr[i0][i2], _1_8);
262 alp1 = L_mac (alp1, rr[i1][i2], _1_8)
567 Word16 i0, i1, i2, i3, i4, i5, i6, i7, i9; local
    [all...]
c3_14pf.cpp 155 The code length is 40, containing 3 nonzero pulses: i0...i2.
157 Pulse i0 can have 8 possible positions, pulses i1 and i2 can have
163 i2 : 2, 7, 12, 17, 22, 27, 32, 37.
383 Word16 i2; local
460 * "rr[i0][i2]" is a pointer initialized to "&rr[i0][ipos[2]]" *
503 * i2 loop: 8 positions. *
518 for (i2 = ipos[2]; i2 < L_CODE; i2 += STEP)
521 /* ps1 = add(ps0, dn[i2], pOverflow); *
    [all...]
c4_17pf.cpp 167 Pulse i0 to i2 can have 8 possible positions, pulse i3 can have
172 i2 : 2, 7, 12, 17, 22, 27, 32, 37.
396 Word16 i2; local
513 * i2 loop: 8 positions. *
528 for (i2 = ipos[2]; i2 < L_CODE; i2 += STEP)
531 /* ps1 = add(ps0, dn[i2], pOverflow); */
532 ps1 = ps0 + dn[i2];
534 /* alp1 = alp0 + rr[i0][i2] + rr[i1][i2] + 1/2*rr[i2][i2]; *
    [all...]
  /external/webkit/JavaScriptCore/wtf/
TCPageMap.h 130 const Number i2 = k & (LEAF_LENGTH-1); local
131 return root_[i1]->values[i2];
137 const Number i2 = k & (LEAF_LENGTH-1); local
138 root_[i1]->values[i2] = v;
232 const Number i2 = (k >> LEAF_BITS) & (INTERIOR_LENGTH-1); local
234 return reinterpret_cast<Leaf*>(root_->ptrs[i1]->ptrs[i2])->values[i3];
240 const Number i2 = (k >> LEAF_BITS) & (INTERIOR_LENGTH-1); local
242 reinterpret_cast<Leaf*>(root_->ptrs[i1]->ptrs[i2])->values[i3] = v;
248 const Number i2 = (key >> LEAF_BITS) & (INTERIOR_LENGTH-1); local
258 if (root_->ptrs[i1]->ptrs[i2] == NULL)
    [all...]
  /frameworks/base/media/libstagefright/codecs/amrnb/enc/src/
s10_8pf.cpp 190 Word16 i0, i1, i2, i3, i4, i5, i6, i7, i8, i9;
233 // i2 and i3 loop
251 for (i2 = ipos[2]; i2 < L_CODE; i2 += step)
254 ps1 = add (ps0, dn[i2]);
257 alp1 = L_mac (alp0, rr[i2][i2], _1_16);
260 alp1 = L_mac (alp1, rr[i0][i2], _1_8);
263 alp1 = L_mac (alp1, rr[i1][i2], _1_8)
568 Word16 i0, i1, i2, i3, i4, i5, i6, i7, i9; local
    [all...]
  /external/freetype/src/base/
ftcalc.c 261 FT_UInt32 lo1, hi1, lo2, hi2, lo, hi, i1, i2; local
269 i2 = lo2 * hi1;
272 /* Check carry overflow of i1 + i2 */
273 i1 += i2;
274 hi += (FT_UInt32)( i1 < i2 ) << 16;
  /external/icu4c/common/
utrie2.c 38 int32_t i2, block; local
45 i2=(UTRIE2_LSCP_INDEX_2_OFFSET-(0xd800>>UTRIE2_SHIFT_2))+
48 i2=trie->index1[c>>UTRIE2_SHIFT_1]+
51 block=trie->index2[i2];
609 int32_t i2, i2Limit; local
610 i2=(c>>UTRIE2_SHIFT_2)&UTRIE2_INDEX_2_MASK;
616 for(; i2<i2Limit; ++i2) {
618 block=(int32_t)idx[i2Block+i2]<<UTRIE2_INDEX_SHIFT;
620 block=trie->newTrie->index2[i2Block+i2];
    [all...]
  /external/speex/libspeex/
lsp.c 560 int i2=0; local
561 for(i=0;i<m;i++,i2+=2){
566 xout1 = xin1 - 2.f*x_freq[i2] * *n1 + *n2;
567 xout2 = xin2 - 2.f*x_freq[i2+1] * *n3 + *n4;
  /external/stlport/src/
locale.cpp 299 _Locale_impl* i2 = L2._M_impl; local
308 impl->insert( i2, _STLP_STD::collate<char>::id);
310 impl->insert( i2, _STLP_STD::collate<wchar_t>::id);
314 impl->insert( i2, _STLP_STD::ctype<char>::id);
315 impl->insert( i2, _STLP_STD::codecvt<char, char, mbstate_t>::id);
317 impl->insert( i2, _STLP_STD::ctype<wchar_t>::id);
318 impl->insert( i2, _STLP_STD::codecvt<wchar_t, char, mbstate_t>::id);
322 impl->insert( i2, _STLP_STD::moneypunct<char, true>::id);
323 impl->insert( i2, _STLP_STD::moneypunct<char, false>::id);
324 impl->insert( i2, _STLP_STD::money_get<char, istreambuf_iterator<char, char_traits<char> > >::id)
    [all...]
  /external/tcpdump/
print-atalk.c 554 int i1, i2, i3; local
559 if (sscanf(line, "%d.%d.%d %256s", &i1, &i2, &i3,
562 i3 |= ((i1 << 8) | i2) << 8;
563 else if (sscanf(line, "%d.%d %256s", &i1, &i2,
566 i3 = (((i1 << 8) | i2) << 8) | 255;

Completed in 987 milliseconds

1 2 3 4