| /external/clang/test/SemaCXX/ |
| address-space-references.cpp | 13 static int_1 i1; local
17 f0(i1);
|
| 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/mesa3d/src/gallium/auxiliary/draw/ |
| draw_gs_tmp.h | 28 #define LINE(flags,i0,i1) gs_line(gs,i0,i1)
29 #define TRIANGLE(flags,i0,i1,i2) gs_tri(gs,i0,i1,i2)
30 #define LINE_ADJ(flags,i0,i1,i2,i3) gs_line_adj(gs,i0,i1,i2,i3)
31 #define TRIANGLE_ADJ(flags,i0,i1,i2,i3,i4,i5) gs_tri_adj(gs,i0,i1,i2,i3,i4,i5)
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.special/ |
| db_swap_1.pass.cpp | 33 std::list<int>::iterator i1 = c1.begin(); local
37 c2.erase(i1);
38 std::list<int>::iterator j = i1;
39 c1.erase(i1);
48 std::list<int, min_allocator<int>>::iterator i1 = c1.begin(); local
52 c2.erase(i1);
53 std::list<int, min_allocator<int>>::iterator j = i1;
54 c1.erase(i1);
|
| /ndk/tests/device/test-stlport_shared-exception/jni/ |
| eh3.cpp | 7 int r, i1 = 1, i2 = 2, i3 = 3, i4 = 4, i5 = 5; variable
11 ~S() { r = i1 + i2 + i3 + i4 + i5; }
|
| eh18.cpp | 17 D(int i1, int i2) : VB(i2) { j = i1; }
25 pD(int i1, int i2) : VB(i2) { j = i1; }
|
| /ndk/tests/device/test-stlport_static-exception/jni/ |
| eh3.cpp | 7 int r, i1 = 1, i2 = 2, i3 = 3, i4 = 4, i5 = 5; variable
11 ~S() { r = i1 + i2 + i3 + i4 + i5; }
|
| eh18.cpp | 17 D(int i1, int i2) : VB(i2) { j = i1; }
25 pD(int i1, int i2) : VB(i2) { j = i1; }
|
| /external/chromium_org/third_party/tcmalloc/vendor/src/ |
| pagemap.h | 145 const Number i1 = k >> LEAF_BITS; local
147 if ((k >> BITS) > 0 || root_[i1] == NULL) {
150 return root_[i1]->values[i2];
155 const Number i1 = k >> LEAF_BITS; local
157 root_[i1]->values[i2] = v;
162 const Number i1 = key >> LEAF_BITS; local
165 if (i1 >= ROOT_LENGTH)
169 if (root_[i1] == NULL) {
173 root_[i1] = leaf;
189 const Number i1 = k >> LEAF_BITS local
248 const Number i1 = k >> (LEAF_BITS + INTERIOR_BITS); local
260 const Number i1 = k >> (LEAF_BITS + INTERIOR_BITS); local
268 const Number i1 = key >> (LEAF_BITS + INTERIOR_BITS); local
301 const Number i1 = k >> (LEAF_BITS + INTERIOR_BITS); local
[all...] |
| /external/compiler-rt/lib/sanitizer_common/tests/ |
| 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);
|
| /dalvik/dx/tests/074-dex-form35c-edge-case/ |
| Blort.java | 21 int i1 = 0; local
|
| /external/chromium_org/third_party/WebKit/Source/core/rendering/shapes/ |
| ShapeInterval.cpp | 38 bool operator() (const ShapeInterval& i1, const ShapeInterval& i2) const
40 return i1.x1 < i2.x1;
96 size_t i1 = 0; local
99 while (i1 < v1Size && i2 < v2Size) {
101 if (v1[i1].intersect(v2[i2], v12)) {
108 if (v1[i1].x2 < v2[i2].x2)
109 i1++;
116 if (v1[i1].x1 < v2[i2].x1)
117 i1++;
138 size_t i1 = 0, i2 = 0 local
[all...] |
| /external/clang/test/CXX/lex/lex.literal/lex.ext/ |
| p3.cpp | 4 int &i1 = 0x123_x1; variable
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector/vector.special/ |
| db_swap_1.pass.cpp | 32 std::vector<int>::iterator i1 = c1.begin(); local
36 c2.erase(i1);
37 c1.erase(i1);
46 std::vector<int, min_allocator<int>>::iterator i1 = c1.begin(); local
50 c2.erase(i1);
51 c1.erase(i1);
|
| /external/chromium_org/third_party/tcmalloc/chromium/src/ |
| pagemap.h | 348 const Number i1 = k >> LEAF_BITS; local
350 if ((k >> BITS) > 0 || root_[i1] == NULL) {
353 return root_[i1]->values[i2];
358 const Number i1 = k >> LEAF_BITS; local
360 root_[i1]->values[i2] = v;
365 const Number i1 = key >> LEAF_BITS; local
368 if (i1 >= ROOT_LENGTH)
372 if (root_[i1] == NULL) {
376 root_[i1] = leaf;
392 const Number i1 = k >> LEAF_BITS local
451 const Number i1 = k >> (LEAF_BITS + INTERIOR_BITS); local
463 const Number i1 = k >> (LEAF_BITS + INTERIOR_BITS); local
471 const Number i1 = key >> (LEAF_BITS + INTERIOR_BITS); local
504 const Number i1 = k >> (LEAF_BITS + INTERIOR_BITS); local
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/ |
| find_selectors.h | 53 * @param i1 Iterator on first sequence.
60 operator()(RandomAccessIterator1 i1, RandomAccessIterator2 i2, Pred pred)
61 { return pred(*i1); }
83 * @param i1 Iterator on first sequence.
90 operator()(RandomAccessIterator1 i1, RandomAccessIterator2 i2, Pred pred)
93 return pred(*i1, *(i1 + 1));
123 * @param i1 Iterator on first sequence.
130 operator()(RandomAccessIterator1 i1, RandomAccessIterator2 i2, Pred pred)
131 { return !pred(*i1, *i2);
[all...] |
| /bionic/libm/upstream-freebsd/lib/msun/src/ |
| s_modf.c | 35 int32_t i0,i1,j0; local
37 EXTRACT_WORDS(i0,i1,x);
45 if(((i0&i)|i1)==0) { /* x is integral */
68 if((i1&i)==0) { /* x is integral */
75 INSERT_WORDS(*iptr,i0,i1&(~i));
|
| /external/chromium_org/third_party/WebKit/Tools/Scripts/ |
| 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/fdlibm/ |
| 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/chromium_org/chrome_frame/test/ |
| proxy_factory_mock.cc | 70 void* i1 = NULL; local
73 proxy_factory_.GetAutomationServer(&launch_delegate_mock_, params, &i1);
76 EXPECT_EQ(i1, i2);
78 proxy_factory_.ReleaseAutomationServer(i1, &launch_delegate_mock_);
93 void* i1 = NULL; local
96 proxy_factory_.GetAutomationServer(&launch_delegate_mock_, params1, &i1);
99 EXPECT_NE(i1, i2);
101 proxy_factory_.ReleaseAutomationServer(i1, &launch_delegate_mock_);
114 void* i1 = NULL; local
119 proxy_factory_.GetAutomationServer(d1, params, &i1);
[all...] |
| /external/clang/test/CodeGen/ |
| atomics-inlining.c | 9 unsigned int i1, i2; variable
27 (void)__atomic_load(&i1, &i2, memory_order_seq_cst);
28 (void)__atomic_store(&i1, &i2, memory_order_seq_cst);
39 // ARM: = call arm_aapcscc i32 @__atomic_load_4(i8* bitcast (i32* @i1 to i8*)
40 // ARM: call arm_aapcscc void @__atomic_store_4(i8* bitcast (i32* @i1 to i8*), i32
51 // PPC32: = load atomic i32* @i1 seq_cst
52 // PPC32: store atomic i32 {{.*}}, i32* @i1 seq_cst
63 // PPC64: = load atomic i32* @i1 seq_cst
64 // PPC64: store atomic i32 {{.*}}, i32* @i1 seq_cst
75 // MIPS32: = load atomic i32* @i1 seq_cs
[all...] |
| /external/llvm/unittests/ADT/ |
| 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, i1), hash_combine(i1, i1, i2))
[all...] |
| /external/lzma/CPP/Common/ |
| MyCom.h | 195 #define MY_UNKNOWN_IMP2(i1, i2) MY_UNKNOWN_IMP_SPEC( \
196 MY_QUERYINTERFACE_ENTRY_UNKNOWN(i1) \
197 MY_QUERYINTERFACE_ENTRY(i1) \
201 #define MY_UNKNOWN_IMP3(i1, i2, i3) MY_UNKNOWN_IMP_SPEC( \
202 MY_QUERYINTERFACE_ENTRY_UNKNOWN(i1) \
203 MY_QUERYINTERFACE_ENTRY(i1) \
208 #define MY_UNKNOWN_IMP4(i1, i2, i3, i4) MY_UNKNOWN_IMP_SPEC( \
209 MY_QUERYINTERFACE_ENTRY_UNKNOWN(i1) \
210 MY_QUERYINTERFACE_ENTRY(i1) \
216 #define MY_UNKNOWN_IMP5(i1, i2, i3, i4, i5) MY_UNKNOWN_IMP_SPEC( \
[all...] |
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/iterator/ |
| iterator_concepts.hpp | 86 std::iter_swap(i1, i2);
89 Iterator i1; local
207 void interop_single_pass_constraints(Iterator1 const& i1, Iterator2 const& i2)
210 b = i1 == i2;
211 b = i1 != i2;
213 b = i2 == i1;
214 b = i2 != i1;
220 Iterator1 const& i1, Iterator2 const& i2,
225 b = i1 < i2;
226 b = i1 <= i2
[all...] |
| /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]) {
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 == wv1->size && i2 < wv2->size)
769 UWord i1, i2, k, sz; local
850 UWord i1, i2, k, sz; local
[all...] |
