| /external/clang/test/Analysis/ |
| padding_c.c | 36 struct TrailingChar i1; member in struct:Helpless
67 int i1; member in struct:SmallIntSandwich
|
| padding_cpp.cpp | 48 int i1; member in class:InnerPaddedB
55 int i1; member in class:TailPaddedB
|
| padding_message.cpp | 22 int i1; member in struct:SmallIntSandwich
145 int i1; member in class:InnerPaddedB
|
| /external/clang/test/CXX/class/class.union/ |
| p1.cpp | 100 static int i1; // expected-warning {{static data member 'i1' in union is a C++11 extension}} member in union:U4
102 int U4::i1 = 10; member in class:U4
105 int& i1; // expected-error {{union member 'i1' has reference type 'int &'}} member in union:U5
|
| /external/clang/test/CXX/dcl.dcl/dcl.spec/dcl.constexpr/ |
| p1.cpp | 13 constexpr int i1 = 0; variable
|
| /external/clang/test/CXX/dcl.decl/dcl.init/dcl.init.list/ |
| p3.cpp | 86 const int& i1 = { 1 }; member in namespace:bullet6
|
| /external/clang/test/CodeGen/ |
| ms_struct-bitfield.c | 125 int i1; member in struct:__anon17150
|
| renderscript.c | 103 typedef struct {int i1, i2, i3, i4, i5; } sInt5; member in struct:__anon17175
|
| /external/clang/test/CodeGenCXX/ |
| constructor-init.cpp | 30 d1(3.4567), i1(1234), m1(100) { printf("N()\n"); }
34 int i1; member in struct:N
37 printf("f1 = %f d1 = %f i1 = %d ld = %f \n", f1,d1,i1, ld);
190 // CHECK-PR10720-NEXT: br i1
198 // CHECK-PR10720-NEXT: br i1
212 // CHECK-PR10720-NEXT: br i1
221 // CHECK-PR10720-NEXT: br i1
|
| copy-constructor-synthesis.cpp | 26 X() : f1(1.0), d1(2.0), i1(3), name("HELLO"), bf1(0xff), bf2(0xabcd),
32 printf("f1 = %f d1 = %f i1 = %d name(%s) \n", f1, d1, i1, name);
41 int i1; member in struct:X
146 // CHECK-NEXT: call void @llvm.memcpy.p0i8.p0i8.i64(i8* [[T4]], i8* [[T5]], i64 8, i32 8, i1 false)
175 // CHECK-NEXT: call void @llvm.memcpy.p0i8.p0i8.i64(i8* [[T4]], i8* [[T5]], i64 8, i32 8, i1 false)
|
| /external/clang/test/SemaCXX/ |
| cxx0x-initializer-aggregates.cpp | 10 int i1; member in struct:aggregate::S::T
14 int i1; member in struct:aggregate::S::U
|
| member-expr.cpp | 14 int i1 = x.f(); local
|
| qualified-id-lookup.cpp | 43 int &i1 = f1(); local
54 N::f1::type& i1 = x; local
64 int i1 = N::f1::member; variable
72 int v3 = ::i1;
|
| /external/clang/test/SemaTemplate/ |
| instantiate-declref.cpp | 61 Inner i1; local
62 i1.foo();
|
| /external/compiler-rt/lib/sanitizer_common/ |
| sanitizer_bitvector.h | 131 for (uptr i1 = 0; i1 < BV::kSize; i1++)
132 l2_[i0][i1].setAll();
147 uptr i1 = idx1(idx); local
149 if (!l1_[i0].getBit(i1)) {
150 l1_[i0].setBit(i1);
151 l2_[i0][i1].clear();
153 bool res = l2_[i0][i1].setBit(i2);
155 // idx, i0, i1, i2, res)
162 uptr i1 = idx1(idx); local
176 uptr i1 = idx1(idx); local
185 uptr i1 = l1_[i0].getAndClearFirstOne(); local
203 uptr i1 = t.getAndClearFirstOne(); local
222 uptr i1 = t.getAndClearFirstOne(); local
240 uptr i1 = t.getAndClearFirstOne(); local
261 uptr i1 = t.getAndClearFirstOne(); local
[all...] |
| /external/eigen/unsupported/test/ |
| BVH.cpp | 110 BallPointStuff<Dim> i1(pt), i2(pt);
113 i1.intersectObject(b[i]);
117 VERIFY(i1.count == i2.count);
129 BallPointStuff<Dim> i1(pt), i2(pt);
134 m1 = (std::min)(m1, i1.minimumOnObject(b[i]));
155 BallPointStuff<Dim> i1, i2; local
159 i1.intersectObjectObject(b[i], v[j]);
163 VERIFY(i1.count == i2.count);
180 BallPointStuff<Dim> i1, i2; local
186 m1 = (std::min)(m1, i1.minimumOnObjectObject(b[i], v[j]))
[all...] |
| /external/freetype/src/base/ |
| ftcalc.c | 284 FT_UInt32 lo1, hi1, lo2, hi2, lo, hi, i1, i2; local
291 i1 = lo1 * hi2;
295 /* Check carry overflow of i1 + i2 */
296 i1 += i2;
297 hi += (FT_UInt32)( i1 < i2 ) << 16;
299 hi += i1 >> 16;
300 i1 = i1 << 16;
302 /* Check carry overflow of i1 + lo */
303 lo += i1;
[all...] |
| /external/icu/icu4c/source/i18n/ |
| scriptset.cpp | 303 int32_t i1 = s1->nextSetBit(0); local
304 while ((diff = i0-i1) == 0 && i0 > 0) {
306 i1 = s1->nextSetBit(i1+1);
|
| /external/jacoco/org.jacoco.report.test/src/org/jacoco/report/internal/html/table/ |
| BarColumnTest.java | 93 final ITableItem i1 = createItem(15, 5); local
95 column.init(Arrays.asList(i1, i2), createNode(21, 29));
96 column.item(td, i1, resources, root);
122 final ITableItem i1 = createItem(20, 0); local
123 column.init(Arrays.asList(i1), createNode(20, 0));
124 column.item(td, i1, resources, root);
142 final ITableItem i1 = createItem(00, 20); local
143 column.init(Arrays.asList(i1), createNode(00, 20));
144 column.item(td, i1, resources, root);
162 final ITableItem i1 = createItem(00, 00) local
175 final ITableItem i1 = createItem(0, 123456); local
188 final ITableItem i1 = createItem(50, 50); local
199 final ITableItem i1 = createItem(50, 60); local
[all...] |
| CounterColumnTest.java | 165 final ITableItem i1 = createItem(30, 0); local
167 assertEquals(0, c.compare(i1, i1));
168 assertTrue(c.compare(i1, i2) > 0);
169 assertTrue(c.compare(i2, i1) < 0);
178 final ITableItem i1 = createItem(70, 30);
180 assertEquals(0, c.compare(i1, i1));
181 assertTrue(c.compare(i1, i2) > 0);
182 assertTrue(c.compare(i2, i1) < 0)
[all...] |
| LabelColumnTest.java | 112 final ITableItem i1 = createItem("abcdef", null); local
114 assertEquals(0, column.getComparator().compare(i1, i2));
120 final ITableItem i1 = createItem("hello", null); local
122 assertTrue(column.getComparator().compare(i1, i2) < 0);
123 assertTrue(column.getComparator().compare(i2, i1) > 0);
|
| PercentageColumnTest.java | 146 final ITableItem i1 = createItem(50, 50); local
148 assertTrue(c.compare(i1, i2) < 0);
149 assertTrue(c.compare(i2, i1) > 0);
150 assertEquals(0, c.compare(i1, i1));
|
| /external/llvm/unittests/ADT/ |
| HashingTest.cpp | 336 const int i1 = 42, i2 = 43, i3 = 123, i4 = 999, i5 = 0, i6 = 79; local
337 const int arr1[] = { i1, i2, i3, i4, i5, i6 };
338 EXPECT_EQ(hash_combine_range(arr1, arr1 + 1), hash_combine(i1));
339 EXPECT_EQ(hash_combine_range(arr1, arr1 + 2), hash_combine(i1, i2));
340 EXPECT_EQ(hash_combine_range(arr1, arr1 + 3), hash_combine(i1, i2, i3));
341 EXPECT_EQ(hash_combine_range(arr1, arr1 + 4), hash_combine(i1, i2, i3, i4));
343 hash_combine(i1, i2, i3, i4, i5));
345 hash_combine(i1, i2, i3, i4, i5, i6));
362 EXPECT_NE(hash_combine(i1, i1, i1), hash_combine(i1, i1, i2))
[all...] |
| /external/selinux/libsepol/cil/src/ |
| cil_find.c | 149 struct cil_list_item *i1, *i2; local
153 cil_list_for_each(i1, cp1->perms) {
154 struct cil_perm *p1 = i1->data;
|
| /external/skia/src/shaders/gradients/ |
| Sk4fLinearGradient.cpp | 125 const auto* i1 = fIntervals->end() - 1; local
127 while (i0 != i1) {
128 SkASSERT(i0 < i1);
129 SkASSERT(in_range(fx, i0->fT0, i1->fT1));
131 const auto* i = i0 + ((i1 - i0) >> 1);
134 i1 = i;
136 SkASSERT(in_range(fx, i->fT1, i1->fT1));
|
