| /external/quake/quake/src/QW/qwfwd/ |
| qwfwd.c | 168 int i1;
local
198 i1 = s;
201 if (p->s >= i1)
202 i1 = p->s + 1;
207 retval = select(i1, &rfds, (fd_set *)0, (fd_set *)0, &tv);
213 i1 = recvfrom(s, buffer, 4096, 0, (struct sockaddr *) &fsin, &alen);
214 if(i1 > 0) {
219 send(p->s, buffer, i1, 0);
230 send(p->s, buffer, i1, 0);
238 i1 = recv(p->s, buffer, 4096, 0);
[all...] |
| /frameworks/base/media/libdrm/mobile2/src/util/ustl-1.0/ |
| umap.h | 48 inline map (const_iterator i1, const_iterator i2) : vector<pair<K,V> >() { insert (i1, i2); }
57 inline void assign (const_iterator i1, const_iterator i2) { clear(); insert (i1, i2); }
64 void insert (const_iterator i1, const_iterator i2);
143 /// Inserts elements from range [i1,i2) into the container.
145 void map<K,V>::insert (const_iterator i1, const_iterator i2)
147 assert (i1 <= i2);
148 reserve (size() + distance (i1, i2));
149 for (; i1 != i2; ++i1
[all...] |
| umultimap.h | 48 inline multimap (const_iterator i1, const_iterator i2) : vector<pair<K,V> > () { insert (i1, i2); }
55 inline void assign (const_iterator i1, const_iterator i2) { clear(); insert (i1, i2); }
63 void insert (const_iterator i1, const_iterator i2);
108 /// Inserts elements from range [i1,i2) into the container.
110 void multimap<K,V>::insert (const_iterator i1, const_iterator i2)
112 assert (i1 <= i2);
113 reserve (size() + distance (i1, i2));
114 for (; i1 != i2; ++i1
[all...] |
| /external/openssl/crypto/0.9.9-dev/aes/ |
| aes-armv4.pl | 32 $i1="r7";
236 ldr $i1,[$key,#-4]
241 eor $s3,$s3,$i1
248 and $i1,lr,$s0
250 ldr $t1,[$tbl,$i1,lsl#2] @ Te3[s0>>0]
255 and $i1,lr,$s1,lsr#16 @ i0
259 ldr $i1,[$tbl,$i1,lsl#2] @ Te1[s1>>16]
263 eor $s0,$s0,$i1,ror#8
268 and $i1,lr,$s2,lsr#8 @ i
[all...] |
| /external/opencore/codecs_v2/audio/gsm_amr/amr_nb/enc/src/ |
| c4_17pf.cpp | 171 i1 : 1, 6, 11, 16, 21, 26, 31, 36.
395 Word16 i1; local
460 * i1 loop: 8 positions. *
476 for (i1 = ipos[1]; i1 < L_CODE; i1 += STEP)
479 /* ps1 = add(ps0, dn[i1], pOverflow); */
480 ps1 = ps0 + dn[i1];
482 /* alp1 = alp0 + rr[i0][i1] + 1/2*rr[i1][i1]; *
[all...] |
| c3_14pf.cpp | 157 Pulse i0 can have 8 possible positions, pulses i1 and i2 can have
161 i1 : 1, 6, 11, 16, 21, 26, 31, 36.
382 Word16 i1; local
448 * i1 loop: 8 positions. *
464 for (i1 = ipos[1]; i1 < L_CODE; i1 += STEP)
467 /* ps1 = add(ps0, dn[i1], pOverflow); */
468 ps1 = ps0 + dn[i1];
470 /* alp1 = alp0 + rr[i0][i1] + 1/2*rr[i1][i1]; *
[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
80 * i1 : 0, 5, 10, 15, 20, 25, 30, 35.
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
186 i1 : 0, 5, 10, 15, 20, 25, 30, 35.
412 Word16 i1; local
466 * i1 loop: 8 positions. *
480 for (i1 = ipos[1]; i1 < L_CODE; i1 += STEP
[all...] |
| c2_9pf.cpp | 197 The code length is 40, containing 2 nonzero pulses: i0...i1. All pulses can
199 pulse i1 can have 8 positions. Also coded is which track pair should be used,
204 i1 : 2, 7, 12, 17, 22, 27, 32, 37.
206 i1 : 3, 8, 13, 18, 23, 28, 33, 38.
210 i1 : 3, 8, 13, 18, 23, 28, 33, 38.
212 i1 : 4, 9, 14, 19, 24, 29, 34, 39.
216 i1 : 2, 7, 12, 17, 22, 27, 32, 37.
218 i1 : 4, 9, 14, 19, 24, 29, 34, 39.
222 i1 : 3, 8, 13, 18, 23, 28, 33, 38.
224 i1 : 4, 9, 14, 19, 24, 29, 34, 39
596 register Word16 i1; local
[all...] |
| s10_8pf.cpp | 76 5. Use array Index[] to store indexes i1:i9, and then use memcpy
189 Word16 i0, i1, i2, i3, i4, i5, i6, i7, i8, i9;
211 // i1 loop: *
225 i1 = pos_max[ipos[1]];
226 ps0 = add (dn[i0], dn[i1]);
228 alp0 = L_mac (alp0, rr[i1][i1], _1_16);
229 alp0 = L_mac (alp0, rr[i0][i1], _1_8);
239 s = L_mac (s, rr[i1][i3], _1_4); // index increment = step
262 alp1 = L_mac (alp1, rr[i1][i2], _1_8)
567 Word16 i0, i1, i2, i3, i4, i5, i6, i7, i9; local
[all...] |
| /frameworks/base/media/libstagefright/codecs/amrnb/enc/src/ |
| c4_17pf.cpp | 171 i1 : 1, 6, 11, 16, 21, 26, 31, 36.
395 Word16 i1; local
460 * i1 loop: 8 positions. *
476 for (i1 = ipos[1]; i1 < L_CODE; i1 += STEP)
479 /* ps1 = add(ps0, dn[i1], pOverflow); */
480 ps1 = ps0 + dn[i1];
482 /* alp1 = alp0 + rr[i0][i1] + 1/2*rr[i1][i1]; *
[all...] |
| c3_14pf.cpp | 157 Pulse i0 can have 8 possible positions, pulses i1 and i2 can have
161 i1 : 1, 6, 11, 16, 21, 26, 31, 36.
382 Word16 i1; local
448 * i1 loop: 8 positions. *
464 for (i1 = ipos[1]; i1 < L_CODE; i1 += STEP)
467 /* ps1 = add(ps0, dn[i1], pOverflow); */
468 ps1 = ps0 + dn[i1];
470 /* alp1 = alp0 + rr[i0][i1] + 1/2*rr[i1][i1]; *
[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
80 * i1 : 0, 5, 10, 15, 20, 25, 30, 35.
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
186 i1 : 0, 5, 10, 15, 20, 25, 30, 35.
412 Word16 i1; local
466 * i1 loop: 8 positions. *
480 for (i1 = ipos[1]; i1 < L_CODE; i1 += STEP
[all...] |
| c2_9pf.cpp | 197 The code length is 40, containing 2 nonzero pulses: i0...i1. All pulses can
199 pulse i1 can have 8 positions. Also coded is which track pair should be used,
204 i1 : 2, 7, 12, 17, 22, 27, 32, 37.
206 i1 : 3, 8, 13, 18, 23, 28, 33, 38.
210 i1 : 3, 8, 13, 18, 23, 28, 33, 38.
212 i1 : 4, 9, 14, 19, 24, 29, 34, 39.
216 i1 : 2, 7, 12, 17, 22, 27, 32, 37.
218 i1 : 4, 9, 14, 19, 24, 29, 34, 39.
222 i1 : 3, 8, 13, 18, 23, 28, 33, 38.
224 i1 : 4, 9, 14, 19, 24, 29, 34, 39
596 register Word16 i1; local
[all...] |
| /dalvik/libcore/math/src/test/java/tests/api/java/math/ |
| BigIntegerTest.java | 1167 BigInteger i1 = element[0], i2 = element[1]; local
1189 BigInteger i1 = element[0], i2 = element[1]; local
1211 BigInteger i1 = element[0], i2 = element[1]; local
1233 BigInteger i1 = element[0]; local
1253 BigInteger i1 = element[0], i2 = element[1]; local
[all...] |
| /cts/tools/vm-tests/src/dot/junit/opcodes/sget/d/ |
| T_sget_5.d | 19 .field public i1 I
27 iput v2, v3, dot.junit.opcodes.sget.d.T_sget_5.i1 I
34 sget v1, dot.junit.opcodes.sget.d.T_sget_5.i1 I
|
| /cts/tools/vm-tests/src/dot/junit/opcodes/sget_boolean/d/ |
| T_sget_boolean_5.d | 19 .field public i1 Z
27 iput-boolean v2, v3, dot.junit.opcodes.sget_boolean.d.T_sget_boolean_5.i1 Z
34 sget-boolean v1, dot.junit.opcodes.sget_boolean.d.T_sget_boolean_5.i1 Z
|
| /cts/tools/vm-tests/src/dot/junit/opcodes/sget_byte/d/ |
| T_sget_byte_5.d | 19 .field public i1 B
27 iput-byte v2, v3, dot.junit.opcodes.sget_byte.d.T_sget_byte_5.i1 B
34 sget-byte v1, dot.junit.opcodes.sget_byte.d.T_sget_byte_5.i1 B
|
| /cts/tools/vm-tests/src/dot/junit/opcodes/sget_char/d/ |
| T_sget_char_5.d | 19 .field public i1 C
27 iput-char v2, v3, dot.junit.opcodes.sget_char.d.T_sget_char_5.i1 C
34 sget-char v1, dot.junit.opcodes.sget_char.d.T_sget_char_5.i1 C
|
| /cts/tools/vm-tests/src/dot/junit/opcodes/sget_object/d/ |
| T_sget_object_5.d | 19 .field public i1 Ljava/lang/Object;
27 iput-object v2, v3, dot.junit.opcodes.sget_object.d.T_sget_object_5.i1 Ljava/lang/Object;
34 sget-object v1, dot.junit.opcodes.sget_object.d.T_sget_object_5.i1 Ljava/lang/Object;
|
| /cts/tools/vm-tests/src/dot/junit/opcodes/sget_short/d/ |
| T_sget_short_5.d | 19 .field public i1 S
27 iput-short v2, v3, dot.junit.opcodes.sget_short.d.T_sget_short_5.i1 S
34 sget-short v1, dot.junit.opcodes.sget_short.d.T_sget_short_5.i1 S
|
| /cts/tools/vm-tests/src/dot/junit/opcodes/sget_wide/d/ |
| T_sget_wide_5.d | 19 .field public i1 J
27 iput-wide v0, v3, dot.junit.opcodes.sget_wide.d.T_sget_wide_5.i1 J
34 sget-wide v1, dot.junit.opcodes.sget_wide.d.T_sget_wide_5.i1 J
|
| /dalvik/libcore/luni/src/main/java/java/lang/ |
| Math.java | 548 * @param i1
552 * @return the larger of {@code i1} and {@code i2}.
554 public static int max(int i1, int i2) {
555 return i1 > i2 ? i1 : i2;
650 * @param i1
654 * @return the smaller of {@code i1} and {@code i2}.
656 public static int min(int i1, int i2) {
657 return i1 < i2 ? i1 : i2
[all...] |
| /external/apache-http/src/org/apache/http/message/ |
| BasicHeaderValueParser.java | 361 int i1 = pos; local
384 while (i1 < i2 && (HTTP.isWhitespace(buffer.charAt(i1)))) {
385 i1++;
388 while ((i2 > i1) && (HTTP.isWhitespace(buffer.charAt(i2 - 1)))) {
392 if (((i2 - i1) >= 2)
393 && (buffer.charAt(i1) == '"')
395 i1++;
398 value = buffer.substring(i1, i2);
|
| /external/icu4c/test/intltest/ |
| itercoll.h | 109 void assertEqual(CollationElementIterator &i1, CollationElementIterator &i2);
|
| /system/extras/tests/bionic/libstdc++/ |
| test_climits.cpp | 52 volatile int i1 = INT_MAX; local
|
