/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 {{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));
|
H A D | tentative-decls.c | 22 int i1 = 1; // expected-note {{previous definition is here}} variable 23 int i1 = 2; // expected-error {{redefinition of 'i1'}} variable 24 int i1; variable 25 int i1; variable
|
/external/clang/test/SemaCXX/ |
H A D | conditional-expr.cpp | 42 int i1, i2, b1 : 3, b2 : 3; member in struct:Fields 75 int i1 = ToBool() ? 0 : 1; local 78 i1 ? throw 0 : throw 1; 79 i1 ? test() : throw 1; 80 i1 ? throw 0 : test(); 81 i1 ? test() : test(); 82 i1 = i1 ? throw 0 : 0; 83 i1 = i1 [all...] |
H A D | address-space-references.cpp | 13 static int_1 i1; local 17 f0(i1);
|
H A D | rval-references.cpp | 32 int i1 = 0; local 33 int &&virr4 = i1; // expected-error {{rvalue reference to type 'int' cannot bind to lvalue of type 'int'}} 35 int &&virr6 = static_cast<int&&>(i1); 36 (void)static_cast<not_int&&>(i1); // expected-error {{types are not compatible}} 38 int i2 = over(i1); 43 int i4 = over2(i1); 46 ilr_c1 vilr1 = i1; 47 ilr_c2 vilr2 = i1;
|
/external/clang/test/SemaTemplate/ |
H A D | fun-template-def.cpp | 19 T f1(T t1, U u1, int i1) argument 21 T t2 = i1; 22 t2 = i1 + u1; 27 i1 = t1[u1]; 28 i1 *= t1; 30 i1(u1, t1); // error 31 u1(i1, t1); 33 U u2 = (T)i1; 35 dynamic_cast<U>(const_cast<T>(i1))))); 37 new U(i1, t [all...] |
/external/fdlibm/ |
H A D | s_rint.c | 44 unsigned i,i1; local 48 i1 = __LO(x); 52 if(((i0&0x7fffffff)|i1)==0) return x; 53 i1 |= (i0&0x0fffff); 55 i0 |= ((i1|-i1)>>12)&0x80000; 64 if(((i0&i)|i1)==0) return x; /* x is integral */ 66 if(((i0&i)|i1)!=0) { 67 if(j0==19) i1 = 0x40000000; else 76 if((i1 [all...] |
H A D | s_ceil.c | 38 int i0,i1,j0; local 41 i1 = __LO(x); 46 if(i0<0) {i0=0x80000000;i1=0;} 47 else if((i0|i1)!=0) { i0=0x3ff00000;i1=0;} 51 if(((i0&i)|i1)==0) return x; /* x is integral */ 54 i0 &= (~i); i1=0; 62 if((i1&i)==0) return x; /* x is integral */ 67 j = i1 + (1<<(52-j0)); 68 if(j<i1) i [all...] |
H A D | s_floor.c | 38 int i0,i1,j0; local 41 i1 = __LO(x); 46 if(i0>=0) {i0=i1=0;} 47 else if(((i0&0x7fffffff)|i1)!=0) 48 { i0=0xbff00000;i1=0;} 52 if(((i0&i)|i1)==0) return x; /* x is integral */ 55 i0 &= (~i); i1=0; 63 if((i1&i)==0) return x; /* x is integral */ 68 j = i1+(1<<(52-j0)); 69 if(j<i1) i [all...] |
H A D | s_modf.c | 39 int i0,i1,j0; local 42 i1 = __LO(x); /* low x */ 51 if(((i0&i)|i1)==0) { /* x is integral */ 69 if((i1&i)==0) { /* x is integral */ 76 __LOp(iptr) = i1&(~i);
|
/external/clang/test/CXX/expr/ |
H A D | p3.cpp | 14 int i1 = a + b; local
|
/external/clang/test/CodeGenCXX/ |
H A D | PR5050-constructor-conversion.cpp | 7 struct A { A(const A&, int i1 = 1); };
|
H A D | cxx0x-initializer-references.cpp | 5 int i1, i2; member in struct:reference::A
|
/external/clang/test/Parser/ |
H A D | namelookup-bug-2.c | 5 struct Object {int i1; } *P; member in struct:Object
|
/external/compiler-rt/lib/sanitizer_common/tests/ |
H A D | sanitizer_stackdepot_test.cc | 22 u32 i1 = StackDepotPut(s1, ARRAY_SIZE(s1)); local 24 const uptr *sp1 = StackDepotGet(i1, &sz1); 37 u32 i1 = StackDepotPut(0, 0); local 39 const uptr *sp1 = StackDepotGet(i1, &sz1); 51 u32 i1 = StackDepotPut(s1, ARRAY_SIZE(s1)); local 53 EXPECT_EQ(i1, i2); 55 const uptr *sp1 = StackDepotGet(i1, &sz1); 63 u32 i1 = StackDepotPut(s1, ARRAY_SIZE(s1)); local 66 EXPECT_NE(i1, i2);
|
/external/clang/test/CXX/lex/lex.literal/lex.ext/ |
H A D | p3.cpp | 4 int &i1 = 0x123_x1; variable
|
H A D | p4.cpp | 4 int &i1 = 0.123_x1; variable
|
H A D | p5.cpp | 7 double &i1 = "foo"_x1; variable
|
H A D | p6.cpp | 6 double &i1 = 'a'_x1; // expected-error {{no matching literal operator}} variable
|
/external/webkit/Tools/Scripts/ |
H A D | find-extra-includes | 85 for my $i1 (sort keys %{ $includes{$file} }) { 87 next if $i1 eq $i2; 88 if ($totalIncludes{$i2}{$i1}) { 89 my $b1 = $i1; 93 print "$paths{$file} does not need to include $i1, because $i2 does\n" if $b1 ne $b2;
|
/external/llvm/unittests/ADT/ |
H A D | HashingTest.cpp | 337 const int i1 = 42, i2 = 43, i3 = 123, i4 = 999, i5 = 0, i6 = 79; local 338 const int arr1[] = { i1, i2, i3, i4, i5, i6 }; 339 EXPECT_EQ(hash_combine_range(arr1, arr1 + 1), hash_combine(i1)); 340 EXPECT_EQ(hash_combine_range(arr1, arr1 + 2), hash_combine(i1, i2)); 341 EXPECT_EQ(hash_combine_range(arr1, arr1 + 3), hash_combine(i1, i2, i3)); 342 EXPECT_EQ(hash_combine_range(arr1, arr1 + 4), hash_combine(i1, i2, i3, i4)); 344 hash_combine(i1, i2, i3, i4, i5)); 346 hash_combine(i1, i2, i3, i4, i5, i6)); 363 EXPECT_NE(hash_combine(i1, i1, i [all...] |
/external/valgrind/main/helgrind/ |
H A D | 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]) { 711 i1++; 713 if (wv1->words[i1] > wv2->words[i2]) { 716 i1++; 720 tl_assert(i1 <= wv1->size); 722 tl_assert(i1 == wv1->size || i2 == wv2->size); 723 if (i1 769 UWord i1, i2, k, sz; local 850 UWord i1, i2, k, sz; local [all...] |
/external/icu4c/test/cintltst/ |
H A D | citertst.h | 115 static void assertEqual(UCollationElements *i1, UCollationElements *i2);
|
/external/llvm/utils/TableGen/ |
H A D | X86DisassemblerTables.h | 94 /// @param i1 - The indentation level to use with stream o1. 100 uint32_t &i1, 123 /// @param i1 - The indent level to use with stream o1. 129 uint32_t &i1, 158 /// @param i1 - The indent level to use with stream o1. 165 uint32_t &i1, 223 /// @param i1 - The indent level to use with stream o1. 227 uint32_t &i1,
|
/external/webkit/Source/JavaScriptCore/wtf/ |
H A D | TCPageMap.h | 129 const Number i1 = k >> LEAF_BITS; local 131 return root_[i1]->values[i2]; 136 const Number i1 = k >> LEAF_BITS; local 138 root_[i1]->values[i2] = v; 143 const Number i1 = key >> LEAF_BITS; local 146 if (root_[i1] == NULL) { 150 root_[i1] = leaf; 231 const Number i1 = k >> (LEAF_BITS + INTERIOR_BITS); local 234 return reinterpret_cast<Leaf*>(root_->ptrs[i1]->ptrs[i2])->values[i3]; 239 const Number i1 local 247 const Number i1 = key >> (LEAF_BITS + INTERIOR_BITS); local [all...] |