| /external/clang/test/Sema/ |
| unused-expr-system-header.c | 3 void f(int i1, int i2) {
6 COMMA_MACRO_1(i1 == i2, f(i1, i2)); // expected-warning {{expression result unused}}
7 COMMA_MACRO_2(i1 == i2, f(i1, i2));
8 COMMA_MACRO_3(i1 == i2, f(i1, i2)); // expected-warning {{expression result unused}}
9 COMMA_MACRO_4(i1 == i2, f(i1, i2));
|
| tentative-decls.c | 29 static int i2 = 5; // expected-note 1 {{previous definition is here}} variable
30 int i2 = 3; // expected-error{{non-static declaration of 'i2' follows static declaration}} variable
|
| /dalvik/dx/tests/044-dex-math-ops/ |
| Blort.java | 24 public void blort(int i1, int i2) {
27 i = i1 + i2;
28 i = i1 - i2;
29 i = i1 * i2;
30 i = i1 / i2;
31 i = i1 % i2;
32 i = i1 & i2;
33 i = i1 | i2;
34 i = i1 ^ i2;
35 i = i1 << i2;
[all...] |
| /external/valgrind/main/none/tests/s390x/ |
| opcodes.h | 19 #define RIL_RI(op1,r1,op2,i2) \
21 ".long 0x" #i2 "\n\t"
22 #define RIE_RRI0(op1,r1,r3,i2,u0,op2) \
24 ".long 0x" #i2 #u0 #op2 "\n\t"
26 #define SIY_IRD(op1,i2,b1,dl1,dh1,op2) \
27 ".short 0x" #op1 #i2 "\n\t" \
32 #define RIL_RU(op1,r1,op2,i2) \
34 ".long 0x" #i2 "\n\t"
35 #define RIL_RP(op1,r1,op2,i2) \
37 ".long 0x" #i2 "\n\t
[all...] |
| and.c | 5 #define nihh(r1,i2) ".long 0xa5" #r1 "4" #i2 "\n\t"
6 #define nihl(r1,i2) ".long 0xa5" #r1 "5" #i2 "\n\t"
7 #define nilh(r1,i2) ".long 0xa5" #r1 "6" #i2 "\n\t"
8 #define nill(r1,i2) ".long 0xa5" #r1 "7" #i2 "\n\t"
|
| insert.c | 5 #define iihh(r1,i2) ".long 0xa5" #r1 "0" #i2 "\n\t"
6 #define iihl(r1,i2) ".long 0xa5" #r1 "1" #i2 "\n\t"
7 #define iilh(r1,i2) ".long 0xa5" #r1 "2" #i2 "\n\t"
8 #define iill(r1,i2) ".long 0xa5" #r1 "3" #i2 "\n\t"
|
| or.c | 5 #define oihh(r1,i2) ".long 0xa5" #r1 "8" #i2 "\n\t"
6 #define oihl(r1,i2) ".long 0xa5" #r1 "9" #i2 "\n\t"
7 #define oilh(r1,i2) ".long 0xa5" #r1 "a" #i2 "\n\t"
8 #define oill(r1,i2) ".long 0xa5" #r1 "b" #i2 "\n\t"
|
| /external/clang/test/Parser/ |
| namelookup-bug-2.c | 8 struct Object { int i2; } *X; member in struct:Object
|
| /cts/tools/vm-tests-tf/src/dot/junit/opcodes/invoke_static/ |
| TestClass.java | 30 public static int testArgsOrder(int i1, int i2){
33 int i = i1 / i2;
|
| /cts/tools/vm-tests-tf/src/dot/junit/opcodes/invoke_static_range/ |
| TestClass.java | 30 public static int testArgsOrder(int i1, int i2){
33 int i = i1 / i2;
|
| /external/clang/test/SemaCXX/ |
| address-space-references.cpp | 14 static int_2 i2; local
18 f0(i2); // expected-error{{no matching function for call to 'f0'}}
|
| __null.cpp | 7 int i2 = __null; local
|
| /dalvik/dx/tests/074-dex-form35c-edge-case/ |
| Blort.java | 22 int i2 = 0; local
|
| /external/clang/test/CXX/lex/lex.literal/lex.ext/ |
| p3.cpp | 7 int &i2 = 45_x1; variable
|
| p4.cpp | 7 int &i2 = 45._x1; variable
|
| p5.cpp | 8 double &i2 = u8"foo"_x1; variable
|
| p6.cpp | 8 double &i2 = L'a'_x1; variable
|
| /external/llvm/utils/TableGen/ |
| X86DisassemblerTables.cpp | 306 uint32_t &i2,
316 o2.indent(i2) << "{ /* ModRMDecision */" << "\n";
317 i2++;
319 o2.indent(i2) << stringForDecisionType(dt) << "," << "\n";
320 o2.indent(i2) << 0 << " /* EmptyTable */\n";
322 i2--;
323 o2.indent(i2) << "}";
354 o2.indent(i2) << "{ /* struct ModRMDecision */" << "\n";
355 i2++;
357 o2.indent(i2) << stringForDecisionType(dt) << "," << "\n"
[all...] |
| X86DisassemblerTables.h | 95 /// @param i2 - The indentation level to use with stream o2.
101 uint32_t &i2,
124 /// @param i2 - The indent level to use with stream o2.
130 uint32_t &i2,
159 /// @param i2 - The indent level to use with stream o2.
166 uint32_t &i2,
224 /// @param i2 - The indent level to use with stream o2.
228 uint32_t &i2) const;
|
| /external/clang/test/CodeGenCXX/ |
| cxx0x-initializer-references.cpp | 5 int i1, i2; member in struct:reference::A
|
| /external/icu4c/test/cintltst/ |
| citertst.h | 115 static void assertEqual(UCollationElements *i1, UCollationElements *i2);
|
| /external/webkit/Tools/Scripts/ |
| find-extra-includes | 86 for my $i2 (keys %{ $includes{$file} }) {
87 next if $i1 eq $i2;
88 if ($totalIncludes{$i2}{$i1}) {
93 print "$paths{$file} does not need to include $i1, because $i2 does\n" if $b1 ne $b2;
|
| /frameworks/base/core/java/android/os/ |
| WorkSource.java | 190 for (int i2=0; i2<N2 && i1<N1; i2++) {
191 if (uids2[i2] == uids1[i1]) {
195 while (i1 < N1 && uids2[i2] > uids1[i1]) {
212 for (int i2=0; i2<N2; i2++) {
213 if (i1 >= N1 || uids2[i2] < uids1[i1]) {
218 uids1[0] = uids2[i2];
[all...] |
| /external/chromium/chrome/browser/sync/engine/ |
| syncer.h | 149 Iterator2 i2 = begin2; local
150 while (i1 != end1 && i2 != end2) {
151 if (*i1 == *i2)
153 if (*i1 > *i2)
154 ++i2;
|
| /external/valgrind/main/helgrind/ |
| hg_wordset.c | 699 UWord i1, i2, k, sz; local
705 i1 = i2 = 0;
707 if (i1 >= wv1->size || i2 >= wv2->size)
710 if (wv1->words[i1] < wv2->words[i2]) {
713 if (wv1->words[i1] > wv2->words[i2]) {
714 i2++;
717 i2++;
721 tl_assert(i2 <= wv2->size);
722 tl_assert(i1 == wv1->size || i2 == wv2->size);
723 if (i1 == wv1->size && i2 < wv2->size)
769 UWord i1, i2, k, sz; local
850 UWord i1, i2, k, sz; local
[all...] |
