HomeSort by relevance Sort by last modified time
    Searched defs:i0 (Results 26 - 50 of 99) sorted by null

12 3 4

  /external/clang/test/SemaCXX/
address-of-temporary.cpp 41 void i0() { S s = { Y().a }; } // expected-warning{{pointer is initialized by a temporary array}} function in namespace:PointerToArrayDecay
cxx1y-variable-templates_top_level.cpp 295 int i0 = var0<int,int>; local
  /frameworks/av/media/libstagefright/codecs/amrnb/enc/src/
s10_8pf.cpp 190 Word16 i0, i1, i2, i3, i4, i5, i6, i7, i8, i9;
208 // fix i0 on maximum of correlation position
209 i0 = pos_max[ipos[0]];
227 ps0 = add (dn[i0], dn[i1]);
228 alp0 = L_mult (rr[i0][i0], _1_16);
230 alp0 = L_mac (alp0, rr[i0][i1], _1_8);
239 s = L_mac (s, rr[i0][i3], _1_4); // index increment = step
260 alp1 = L_mac (alp1, rr[i0][i2], _1_8);
305 s = L_mac (s, rr[i0][i5], _1_4)
568 Word16 i0, i1, i2, i3, i4, i5, i6, i7, i9; local
    [all...]
c2_11pf.cpp 73 * The code length is 40, containing 2 nonzero pulses: i0...i1.
75 * Pulse i0 can have 2x8=16 possible positions, pulse i1 can have
78 * i0 : 1, 6, 11, 16, 21, 26, 31, 36.
179 The code length is 40, containing 2 nonzero pulses: i0...i1.
181 Pulse i0 can have 2x8=16 possible positions, pulse i1 can have
184 i0 : 1, 6, 11, 16, 21, 26, 31, 36.
411 Word16 i0; local
456 * i0 loop: try 8 positions. *
458 for (i0 = ipos[0]; i0 < L_CODE; i0 += STEP
    [all...]
c2_9pf.cpp 197 The code length is 40, containing 2 nonzero pulses: i0...i1. All pulses can
198 have two possible amplitudes: +1 or -1. Pulse i0 can have 8 possible positions,
203 first i0 : 0, 5, 10, 15, 20, 25, 30, 35.
205 second i0 : 1, 6, 11, 16, 21, 26, 31, 36.
209 first i0 : 0, 5, 10, 15, 20, 25, 30, 35.
211 second i0 : 2, 7, 12, 17, 22, 27, 32, 37.
215 first i0 : 0, 5, 10, 15, 20, 25, 30, 35.
217 second i0 : 1, 6, 11, 16, 21, 26, 31, 36.
221 first i0 : 0, 5, 10, 15, 20, 25, 30, 35.
223 second i0 : 1, 6, 11, 16, 21, 26, 31, 36
595 register Word16 i0; 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
160 i0 : 0, 5, 10, 15, 20, 25, 30, 35.
381 Word16 i0; local
434 * i0 loop: try 8 positions. *
438 for (i0 = ipos[0]; i0 < L_CODE; i0 += STEP)
440 if (dn2[i0] >= 0)
442 ps0 = dn[i0];
    [all...]
c4_17pf.cpp 165 The code length is 40, containing 4 nonzero pulses: i0...i3.
167 Pulse i0 to i2 can have 8 possible positions, pulse i3 can have
170 i0 : 0, 5, 10, 15, 20, 25, 30, 35.
394 Word16 i0; local
448 * i0 loop: try 4 positions (use position with max of corr.). *
451 for (i0 = ipos[0]; i0 < L_CODE; i0 += STEP)
453 if (dn2[i0] >= 0)
455 ps0 = dn[i0];
    [all...]
  /external/icu4c/test/cintltst/
utf16tst.c 353 int32_t i0, i=0, j, k, expectedIndex; local
356 i0=i;
359 log_err("U16_NEXT(from %d)=U+%04x != U+%04x\n", i0, c, result[cpIndex]);
361 j=i0;
381 j=i0=i;
386 log_err("U16_NEXT(from %d)=U+%04x != U+%04x=U16_GET(at %d)\n", i0, c, c2, j);
utf8tst.c 416 int32_t i0, i=0, j, k, expectedIndex; local
419 i0=i;
423 log_err("U8_NEXT(from %d)=U+%04x != U+%04x\n", i0, c, expected);
425 j=i0;
429 log_err("U8_NEXT_OR_FFFD(from %d)=U+%04x != U+%04x\n", i0, c, expected);
434 j=i0;
454 j=i0=i;
459 log_err("U8_NEXT(from %d)=U+%04x != U+%04x=U8_GET(at %d)\n", i0, c, c2, j);
464 log_err("U8_NEXT_OR_FFFD(from %d)=U+%04x != U+%04x=U8_GET_OR_FFFD(at %d)\n", i0, expected, c2, j);
    [all...]
  /external/javassist/src/main/javassist/bytecode/stackmap/
TypedBlock.java 182 int i0 = i; local
196 types[n] = new TypeData.ClassName(desc.substring(i0, ++i2));
198 types[n] = new TypeData.ClassName(desc.substring(i0 + 1, ++i2 - 1)
203 types[n] = new TypeData.ClassName(desc.substring(i0, ++i));
  /external/jmonkeyengine/engine/src/core/com/jme3/scene/shape/
Torus.java 194 int i0 = connectionStart; local
195 int i1 = i0 + 1;
201 sib.put((short)i0++);
208 // getIndexBuffer().put(i0++);
215 // getIndexBuffer().put(i0++);
Cylinder.java 361 int i0 = axisStart; local
362 int i1 = i0 + 1;
369 ib.put(index++, i0++);
373 ib.put(index++, i0++);
382 ib.put(index++, i0++);
Sphere.java 317 int i0 = iZStart; local
318 int i1 = i0 + 1;
324 idxBuf.put((short) i0++);
331 idxBuf.put((short) i0++);
  /frameworks/av/media/libstagefright/codecs/amrwbenc/src/
c2t64fx.c 56 Word32 i, j, k, i0, i1, ix, iy, pos, pos2; local
232 for (i0 = 0; i0 < L_SUBFR; i0 += STEP)
234 ps1 = dn[i0];
253 ix = i0;
266 i0 = (ix >> 1); /* pos of pulse 1 (0..31) */
275 i0 += NB_POS;
288 *index = add1((i0 << 6), i1);
  /frameworks/base/core/java/android/net/
SntpClient.java 172 int i0 = ((b0 & 0x80) == 0x80 ? (b0 & 0x7F) + 0x80 : b0); local
177 return ((long)i0 << 24) + ((long)i1 << 16) + ((long)i2 << 8) + (long)i3;
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/src/
debug.cpp 303 __i_node* i0 = __find_iterator(__i0); local
304 __c_node* c0 = i0 != nullptr ? i0->__c_ : nullptr;
305 if (i == nullptr && i0 != nullptr)
  /external/fdlibm/
e_pow.c 109 int i0,i1,i,j,k,yisint,n; local
113 i0 = ((*(int*)&one)>>29)^1; i1=1-i0;
  /external/jmonkeyengine/engine/src/tools/jme3tools/optimize/
TriangleCollector.java 160 Integer i0 = indexCache.get(vertIndicies[0]); local
166 if (i0 == null){
171 newIndices[0] = i0.intValue();
  /external/libvpx/libvpx/vp8/encoder/
encodemb.c 236 int i0; local
272 i0 = !type;
290 for (i = eob; i-- > i0;)
451 final_eob = i0 - 1;
  /external/opencv/cvaux/src/
cvsegment.cpp 367 char *i0, *i1, *i3, *i4 = 0; local
391 i0 = ptr + x - is_hole;
396 i1 = i0 + deltas[s];
404 *i0 = (char) (nbd | -128);
409 i3 = i0;
444 if( i4 == i0 && i3 == i1 )
  /frameworks/av/media/libstagefright/codecs/aacenc/src/
transform.c 111 int i0, i1, i2, i3; local
119 i0 = buf[1] + buf[3];
128 i4 = (i0 + i2) >> 1;
130 i5 = (i0 - i2) >> 1;
137 i0 = buf[ 9] + buf[11];
146 t1 = (i0 + i2) >> 1;
148 t3 = (i0 - i2) >> 1;
160 i0 = i1 + r3;
164 t0 = MULHIGH(SQRT1_2, r0 - i0);
165 t1 = MULHIGH(SQRT1_2, r0 + i0);
    [all...]
  /frameworks/base/core/tests/coretests/src/android/os/
AidlTest.java 320 int[] i0 = new int[]{34}; local
323 int[] ir = mRemote.intArray(i0, i1, i2);
  /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/
IdentityHashMap2Test.java 319 Integer i0 = new Integer(0); local
320 m.put(i0, "int");
323 assertEquals("Failed adding to bucket containing null2", "int", m.get(i0)
  /external/chromium/net/ftp/
ftp_network_transaction.cc 166 int i0, i1, i2, i3, p0, p1; local
167 if (sscanf_s(ptr, "%d,%d,%d,%d,%d,%d", &i0, &i1, &i2, &i3, &p0, &p1) != 6)
    [all...]
  /external/chromium_org/third_party/mesa/src/src/mesa/program/
prog_noise.c 215 int i0 = FASTFLOOR(x); local
216 int i1 = i0 + 1;
217 float x0 = x - i0;
225 n0 = t0 * t0 * grad1(perm[i0 & 0xff], x0);

Completed in 980 milliseconds

12 3 4