/external/clang/test/Sema/ |
H A D | unused-expr-system-header.c | 3 void f(int i1, int i2) { argument 6 COMMA_MACRO_1(i1 == i2, f(i1, i2)); // expected-warning {{comparison result unused}} \ 8 COMMA_MACRO_2(i1 == i2, f(i1, i2)); 9 COMMA_MACRO_3(i1 == i2, f(i1, i2)); // expected-warning {{comparison result unused}} \ 11 COMMA_MACRO_4(i1 == i2, f(i1, i2));
|
H A D | warn-logical-not-compare.c | 6 int test1(int i1, int i2) { argument 9 ret = !i1 == i2; 21 ret = !i1 != i2; 33 ret = !i1 < i2; 45 ret = !i1 > i2; 57 ret = !i1 <= i2; 69 ret = !i1 >= i2; 81 ret = i1 == i2; 82 ret = i1 != i2; 83 ret = i1 < i2; [all...] |
/external/clang/test/CodeGenCXX/ |
H A D | debug-info-indirect-field-decl.cpp | 16 // CHECK: !DIDerivedType(tag: DW_TAG_member, name: "i2", 22 int i2; member in union:Bar::__anon2211 26 Foo<Bar, &Bar::i2> the_foo;
|
/external/clang/test/SemaCXX/ |
H A D | warn-logical-not-compare.cpp | 7 bool test1(int i1, int i2, bool b1, bool b2) { argument 10 ret = !i1 == i2; 22 ret = !i1 != i2; 34 ret = !i1 < i2; 46 ret = !i1 > i2; 58 ret = !i1 <= i2; 70 ret = !i1 >= i2; 82 ret = i1 == i2; 83 ret = i1 != i2; 84 ret = i1 < i2; [all...] |
H A D | address-space-references.cpp | 14 static int_2 i2; local 18 f0(i2); // expected-error{{no matching function for call to 'f0'}}
|
H A D | __null.cpp | 7 int i2 = __null; local
|
/external/libcxx/test/std/iterators/stream.iterators/istreambuf.iterator/istreambuf.iterator_op!=/ |
H A D | not_equal.pass.cpp | 28 std::istreambuf_iterator<char> i2(inf2); 33 assert(!(i1 != i2)); 37 assert(!(i2 != i1)); 38 assert(!(i2 != i2)); 39 assert( (i2 != i3)); 40 assert( (i2 != i4)); 43 assert( (i3 != i2)); 48 assert( (i4 != i2)); 56 std::istreambuf_iterator<wchar_t> i2(inf [all...] |
/external/libcxx/test/std/iterators/stream.iterators/istreambuf.iterator/istreambuf.iterator_op==/ |
H A D | equal.pass.cpp | 28 std::istreambuf_iterator<char> i2(inf2); 33 assert( (i1 == i2)); 37 assert( (i2 == i1)); 38 assert( (i2 == i2)); 39 assert(!(i2 == i3)); 40 assert(!(i2 == i4)); 43 assert(!(i3 == i2)); 48 assert(!(i4 == i2)); 56 std::istreambuf_iterator<wchar_t> i2(inf [all...] |
/external/libcxx/test/std/re/re.iter/re.regiter/re.regiter.incr/ |
H A D | post.pass.cpp | 25 std::cregex_iterator i2 = i; local 27 assert(i2!= std::cregex_iterator()); 31 assert((*i2).size() == 1); 32 assert((*i2).position() == 0); 33 assert((*i2).str() == "555-1234"); 36 assert(i2!= std::cregex_iterator()); 40 assert((*i2).size() == 1); 41 assert((*i2).position() == 0); 42 assert((*i2).str() == "555-1234"); 45 assert(i2! 63 std::cregex_iterator i2 = i; local [all...] |
/external/v8/test/mjsunit/compiler/ |
H A D | regress-177883.js | 46 function __ZNK4Math5plane3dotERKNS_6float4E(i1, i2) { 48 i2 = i2 | 0; 49 return +(+HEAPF32[i1 >> 2] * +HEAPF32[i2 >> 2] + +HEAPF32[i1 + 4 >> 2] * +HEAPF32[i2 + 4 >> 2] + +HEAPF32[i1 + 8 >> 2] * +HEAPF32[i2 + 8 >> 2] + +HEAPF32[i1 + 12 >> 2] * +HEAPF32[i2 + 12 >> 2]); 52 function __ZNK4Math7frustum8clipmaskERKNS_5pointE(i1, i2) { 54 i2 = i2 | [all...] |
H A D | regress-register-allocator.js | 14 var i2 = HEAP32[i1 >> 2] | 0; 20 g(i2);
|
/external/libcxx/test/std/re/re.iter/re.tokiter/re.tokiter.comp/ |
H A D | equal.pass.cpp | 29 std::cregex_token_iterator i2 = i; local 30 assert(i2 == i); 31 assert(!(i2 != i)); 33 assert(!(i2 == i)); 34 assert(i2 != i);
|
/external/libcxx/test/std/iterators/stream.iterators/istream.iterator/istream.iterator.ops/ |
H A D | equal.pass.cpp | 31 std::istream_iterator<int> i2(inf1); 36 assert(i1 == i2); 41 assert(i2 == i2); 42 assert(i2 != i3); 43 assert(i2 != i4); 44 assert(i2 != i5);
|
/external/libcxx/test/std/iterators/stream.iterators/istreambuf.iterator/istreambuf.iterator_equal/ |
H A D | equal.pass.cpp | 26 std::istreambuf_iterator<char> i2(inf2); 31 assert( i1.equal(i2)); 35 assert( i2.equal(i1)); 36 assert( i2.equal(i2)); 37 assert(!i2.equal(i3)); 38 assert(!i2.equal(i4)); 41 assert(!i3.equal(i2)); 46 assert(!i4.equal(i2)); 54 std::istreambuf_iterator<wchar_t> i2(inf [all...] |
/external/clang/test/Parser/ |
H A D | namelookup-bug-2.c | 9 struct Object { int i2; } *X; member in struct:Object
|
/external/v8/test/mjsunit/regress/ |
H A D | regress-4325.js | 17 var i2 = new Inner(); 23 // Let Inner.map1 die by migrating i2 to Inner.map2: 24 print(i2.p1); 29 i2.p2 = 0.5; 33 o2.inner = i2;
|
/external/apache-commons-math/src/main/java/org/apache/commons/math/ |
H A D | DuplicateSampleAbscissaException.java | 36 * @param i2 index of another entry having the duplicate abscissa 38 public DuplicateSampleAbscissaException(double abscissa, int i1, int i2) { argument 40 abscissa, i1, i2);
|
/external/snakeyaml/src/test/java/org/yaml/snakeyaml/immutable/primitives/ |
H A D | BunchOfPrimitives.java | 32 public BunchOfPrimitives(int i1, int i2, int i3) { argument 36 public BunchOfPrimitives(long i1, double i2, boolean i3) { argument 37 this((int) i1, i2, i3);
|
/external/valgrind/none/tests/s390x/ |
H A D | 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 "\ [all...] |
H A D | 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"
|
H A D | 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"
|
H A D | 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/v8/test/mjsunit/asm/embenchen/ |
H A D | lua_binarytrees.js | 7386 var i1 = 0, i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0, i22 = 0, i23 = 0, i24 = 0, i25 = 0, i26 = 0, i27 = 0, i28 = 0, i29 = 0, i30 = 0, i31 = 0, i32 = 0; 7404 i2 = i7 + 8 | 0; 7405 i4 = HEAP32[i2 >> 2] | 0; 7427 i32 = i2; 7436 i2 = i7 >>> 12 & 16; 7437 i7 = i7 >>> i2; 7445 i3 = (i6 | i2 | i5 | i4 | i3) + (i7 >>> i3) | 0; 7450 i2 = i5 + 8 | 0; 7451 i6 = HEAP32[i2 >> 2] | 0; 7504 i32 = i2; [all...] |
/external/clang/test/CXX/lex/lex.literal/lex.ext/ |
H A D | p3.cpp | 7 int &i2 = 45_x1; variable
|
/external/jacoco/org.jacoco.report/src/org/jacoco/report/internal/html/table/ |
H A D | TableItemComparator.java | 29 public int compare(final ITableItem i1, final ITableItem i2) { argument 30 return comparator.compare(i1.getNode(), i2.getNode());
|