| /external/clang/test/Modules/Inputs/normal-module-map/ |
| a1.h | 1 int a1; variable
|
| /bionic/libm/ |
| fake_long_double.c | 21 int (isinf)(double a1) { return __isinf(a1); }
29 int __fpclassifyl(long double a1) { return __fpclassifyd(a1); }
30 int __isfinitel(long double a1) { return __isfinite(a1); }
31 int __isinfl(long double a1) { return __isinf(a1); }
32 int __isnanl(long double a1) { return isnan(a1); }
[all...] |
| /external/clang/test/SemaCXX/ |
| deleted-operator.cpp | 9 PR10757 a1; local
11 if(~a1) {} // expected-error {{overload resolution selected deleted operator}} expected-note 8 {{built-in candidate}}
12 if(a1==a1) {} // expected-error {{overload resolution selected deleted operator}} expected-note 121 {{built-in candidate}}
|
| /external/clang/test/Sema/Inputs/ |
| format-unused-system-args.h | 4 #define PRINT2(fmt, a1, a2) \
5 printf((fmt), (a1), (a2))
7 #define PRINT1(fmt, a1) \
8 PRINT2((fmt), (a1), 0)
|
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/list/list.ops/ |
| unique.pass.cpp | 19 int a1[] = {2, 1, 1, 4, 4, 4, 4, 3, 3}; local
21 std::list<int> c(a1, a1+sizeof(a1)/sizeof(a1[0]));
|
| merge.pass.cpp | 19 int a1[] = {1, 3, 7, 9, 10}; local
22 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
|
| reverse.pass.cpp | 19 int a1[] = {11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0}; local
21 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
|
| sort.pass.cpp | 19 int a1[] = {4, 8, 1, 0, 5, 7, 2, 3, 6, 11, 10, 9}; local
21 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
|
| sort_comp.pass.cpp | 20 int a1[] = {4, 8, 1, 0, 5, 7, 2, 3, 6, 11, 10, 9}; local
22 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
|
| unique_pred.pass.cpp | 24 int a1[] = {2, 1, 1, 4, 4, 4, 4, 3, 3}; local
26 std::list<int> c(a1, a1+sizeof(a1)/sizeof(a1[0]));
|
| remove.pass.cpp | 19 int a1[] = {1, 2, 3, 4}; local
21 std::list<int> c(a1, a1+4);
|
| /external/valgrind/main/drd/ |
| drd_thread_bitmap.h | 35 Bool bm_access_load_1_triggers_conflict(const Addr a1)
37 DRD_(bm_access_load_1)(DRD_(sg_bm)(DRD_(running_thread_get_segment)()), a1);
39 a1);
43 Bool bm_access_load_2_triggers_conflict(const Addr a1)
45 if ((a1 & 1) == 0)
47 bm_access_aligned_load(DRD_(sg_bm)(DRD_(running_thread_get_segment)()), a1, 2);
49 a1, 2);
54 a1, a1 + 2, eLoad);
56 a1, a1 + 2, eLoad)
[all...] |
| drd_suppression.c | 62 void DRD_(start_suppression)(const Addr a1, const Addr a2,
67 a1, a2 - a1, reason);
69 tl_assert(a1 <= a2);
70 DRD_(bm_access_range_store)(s_suppressed, a1, a2);
73 void DRD_(finish_suppression)(const Addr a1, const Addr a2)
77 a1, a2 - a1);
81 tl_assert(a1 <= a2);
82 DRD_(bm_clear_store)(s_suppressed, a1, a2)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/numerics/numarray/template.valarray/valarray.members/ |
| sum.pass.cpp | 23 T a1[] = {1.5, 2.5, 3, 4, 5.5}; local
24 const unsigned N1 = sizeof(a1)/sizeof(a1[0]);
25 std::valarray<T> v1(a1, N1);
|
| max.pass.cpp | 23 T a1[] = {1.5, 2.5, -3, 4, -5.5}; local
24 const unsigned N1 = sizeof(a1)/sizeof(a1[0]);
25 std::valarray<T> v1(a1, N1);
35 T a1[] = {1.5, 2.5, -3, 4, -5.5}; local
36 const unsigned N1 = sizeof(a1)/sizeof(a1[0]);
37 std::valarray<T> v1(a1, N1);
|
| min.pass.cpp | 23 T a1[] = {1.5, 2.5, -3, 4, 5.5}; local
24 const unsigned N1 = sizeof(a1)/sizeof(a1[0]);
25 std::valarray<T> v1(a1, N1);
35 T a1[] = {1.5, 2.5, -3, 4, 5.5}; local
36 const unsigned N1 = sizeof(a1)/sizeof(a1[0]);
37 std::valarray<T> v1(a1, N1);
|
| /external/clang/test/CodeGenCXX/ |
| bool-bitfield.cpp | 8 void func1(bool b, A& a1)
10 if ((a1.m_sorted = b)) {}
|
| /external/clang/test/Sema/ |
| array-declared-as-incorrect-type.c | 3 extern int a1[];
4 int a1[1]; variable
|
| /ndk/sources/cxx-stl/llvm-libc++/test/utilities/allocator.adaptor/scoped.adaptor.operators/ |
| eq.pass.cpp | 35 typedef std::scoped_allocator_adaptor<A1<int>> A;
36 A a1(A1<int>(3));
37 A a2 = a1;
38 assert(a2 == a1);
39 assert(!(a2 != a1));
42 typedef std::scoped_allocator_adaptor<A1<int>, A2<int>> A;
43 A a1(A1<int>(4), A2<int>(5));
44 A a2 = a1;
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/utilities/utility/operators/ |
| rel_ops.pass.cpp | 39 A a1(1);
41 assert(a1 == a1);
42 assert(a1 != a2);
43 assert(a1 < a2);
44 assert(a2 > a1);
45 assert(a1 <= a1);
46 assert(a1 <= a2);
48 assert(a2 >= a1);
[all...] |
| /dalvik/vm/mterp/mips/ |
| OP_CONST_4.S | 3 sll a1, rINST, 16 # a1 <- Bxxx0000
6 sra a1, a1, 28 # a1 <- sssssssB (sign-extended)
9 SET_VREG_GOTO(a1, a0, t0) # fp[A] <- a1
|
| OP_FILL_ARRAY_DATA.S | 4 FETCH(a1, 2) # a1 <- BBBB (hi)
6 sll a1, a1, 16 # a1 <- BBBBbbbb
7 or a1, a0, a1 # a1 <- BBBBbbbb
9 EAS1(a1, rPC, a1) # a1 <- PC + BBBBbbbb*2 (array data off.
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/utilities/memory/default.allocator/allocator.globals/ |
| eq.pass.cpp | 27 std::allocator<int> a1; local
29 assert(a1 == a2);
30 assert(!(a1 != a2));
|
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/list/list.special/ |
| swap.pass.cpp | 22 int a1[] = {1, 3, 7, 9, 10}; local
24 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
28 assert(c2 == std::list<int>(a1, a1+sizeof(a1)/sizeof(a1[0])));
31 int a1[] = {1, 3, 7, 9, 10} local
41 int a1[] = {1, 3, 7, 9, 10}; local
51 int a1[] = {1, 3, 7, 9, 10}; local
64 int a1[] = {1, 3, 7, 9, 10}; local
77 int a1[] = {1, 3, 7, 9, 10}; local
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/vector/vector.special/ |
| swap.pass.cpp | 22 int a1[] = {1, 3, 7, 9, 10}; local
24 std::vector<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
28 assert(c2 == std::vector<int>(a1, a1+sizeof(a1)/sizeof(a1[0])));
31 int a1[] = {1, 3, 7, 9, 10} local
41 int a1[] = {1, 3, 7, 9, 10}; local
51 int a1[] = {1, 3, 7, 9, 10}; local
64 int a1[] = {1, 3, 7, 9, 10}; local
77 int a1[] = {1, 3, 7, 9, 10}; local
[all...] |
