| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/bfin/ |
| arith_mode.s | 5 R0.L = A0;
6 R0.L = A0 (FU);
7 R0.L = A0 (IS);
8 R0.L = A0 (IU);
9 R0.L = A0 (T);
10 R0.L = A0 (TFU); // Not documented
11 R0.L = A0 (S2RND);
12 R0.L = A0 (ISS2);
13 R0.L = A0 (IH);
17 R0 = A0;
[all...] |
| invalid_arith_mode.s | 7 R0.L = A0 (W32);
11 R0 = A0 (T);
12 R0 = A0 (TFU);
13 R0 = A0 (IH);
14 R0 = A0 (W32);
30 A0 = R1.L * R2.H (IU);
31 A0 = R1.L * R2.H (T);
32 A0 = R1.L * R2.H (TFU);
33 A0 = R1.L * R2.H (S2RND);
34 A0 = R1.L * R2.H (ISS2)
[all...] |
| logical2.s | 46 //Dreg_lo = CC = BXORSHIFT ( A0, Dreg ) ; /* (b) */
47 R0.L = CC = BXORSHIFT(A0, R0);
48 R0.L = CC = BXORSHIFT(A0, R1);
50 R3.L = CC = BXORSHIFT(A0, R0);
51 R3.L = CC = BXORSHIFT(A0, R1);
53 //Dreg_lo = CC = BXOR ( A0, Dreg ) ; /* (b) */
54 R0.L = CC = BXOR(A0, R0);
55 R0.L = CC = BXOR(A0, R1);
57 R3.L = CC = BXOR(A0, R0);
58 R3.L = CC = BXOR(A0, R1)
[all...] |
| parallel2.s | 2 A0 = A1 || P0 = [sp+20];
3 a1 = a0 || P0 = [p5+24];
4 a0 = R0 || P0 = [P4+28]; define
7 R4 = A0 (fu) || P0 = [p3+36];
9 R6 = a0 || P0 = [P4+44];
11 R6 = A0, R7 = a1 || P0 = [P4+52];
12 r1 = a1, r0 = a0 (fu) || P0 = [P4+56];
14 A0.X = r5.l || p0 = [p4+60];
16 r0.l = a0.x || r1 = [i0 ++ m1];
18 A0.L = r3.l || r0 = [i0 ++ m3]
33 a0 = a0 << 31 || r0 = [fp - 28]; define
70 a0 = rot A0 by 0 || R5 = W [P3] (z); define
[all...] |
| logical.s | 34 R7.l = CC = bxor (a0, r0);
35 r7.l = cc = BXOR (A0, R1);
37 r5.L = Cc = BxoR (A0, A1, CC);
38 R4.L = cC = bXor (a0, a1, cc);
43 r3.l = cc = bxorshift (a0, R7);
44 R2.l = cC = BxoRsHIft (A0, R2);
46 A0 = BXORSHIFT (A0, A1, CC);
47 a0 = BxorShift (a0, A1, Cc) define
[all...] |
| parallel.s | 10 BITMUX(R1, R0, A0) (ASR) || I1 -= 4;
11 Bitmux (r2, R3, a0) (aSr) || I0 += 2;
13 bitmux (r4, r5, a0) (asl) || Sp = [P0];
14 BiTMux (R7, r6, a0) (ASl) || FP = [P1++];
19 a0 = abs a0 || p2 = [Sp+60] || r0 = [i0]; define
20 A0 = ABS A1 || P3 = [FP-60] || R1 = [I1++M0];
21 A1 = Abs a0 || P4 = [fp-4] || r2 = [i1++];
23 A1 = abs a1, a0 = ABS A0 || R4=[p5+56] || r0.h = w [I0]
75 a0 = r5.l * R7.H (w32) || r4 = b [p5] (z) || [i0++m0] = R5; define
76 a0 = r0.h * r0.l || r5 = b [p0] (x) || [i0++M0] =R6; define
121 a0 = -a1 || w [p0] = r6.L || r3.L = w [i3--]; define
[all...] |
| parallel3.s | 29 r7 = A1 + A0, r5 = A1 - A0|| [p3--] = P0;
30 r3 = a0 + a1, r6 = a0 - a1 (s)|| [p3+28] = P0;
57 a1 = r2.l * r3.h, a0 = r2.h * R3.H|| [fp++] = P0;
58 A0 = R1.l * R0.L, A1 += R1.h * R0.h|| [fp--] = P0;
59 A1 = R5.h * R7.H, A0 += r5.L * r7.l (w32)|| [fp+0] = P0;
60 a1 += r0.H * r1.H, A0 = R0.L * R1.l (is)|| [fp+60] = P0;
61 a1 = r3.h * r4.h (m), a0 += r3.l * R4.L (FU)|| [p0] = P1;
62 A1 += r4.H * R4.L, a0 -= r4.h * r4.h|| [p0] = P2
[all...] |
| shift2.s | 163 //A0 = A0 >>> uimm5 ; /* arithmetic right shift (b) */
164 A0 = A0 >>> 0;
165 A0 = A0 >>> 15;
166 A0 = A0 >>> 31;
168 //A0 = A0 << uimm5 ; /* logical left shift (b) *
229 a0 = a0 >> 7 ; \/* Accumulator right shift *\/ define
231 a0 = a0 << 7 ; \/* Accumulator left shift *\/ define
240 a0 = lshift a0 by r7.l ; define
247 a0 = rot a0 by 22 ; \/* rotate Accumulator left *\/ define
248 a0 = rot a0 by -32 ; \/* rotate Accumulator left *\/ define
249 a0 = rot a0 by 31 ; \/* rotate Accumulator left *\/ define
256 a0 = rot a0 by r3.l ; define
[all...] |
| /external/clang/test/CXX/temp/temp.decls/temp.fct/temp.over.link/ |
| p6.cpp | 4 struct A0 {
8 template<int X, int Y> void f0(A0<X, Y>) { } // expected-note{{previous}}
9 template<int N, int M> void f0(A0<M, N>) { }
10 template<int V1, int V2> void f0(A0<V1, V2>) { } // expected-error{{redefinition}}
12 template<int X, int Y> void f1(A0<0, (X + Y)>) { } // expected-note{{previous}}
13 template<int X, int Y> void f1(A0<0, (X - Y)>) { }
14 template<int A, int B> void f1(A0<0, (A + B)>) { } // expected-error{{redefinition}}
16 template<int X, int Y> void A0<X, Y>::g0() { }
|
| /external/clang/test/CodeGen/ |
| pr5406.c | 5 typedef struct { char x[3]; } A0;
12 A0 a3;
|
| /external/fec/ |
| encode_rs.h | 30 #undef A0
31 #define A0 (NN) /* Special reserved value encoding zero in index form */
41 if(feedback != A0){ /* feedback term is non-zero */
53 if(feedback != A0)
|
| char.h | 20 #define A0 (NN)
|
| int.h | 20 #define A0 (NN)
|
| /external/libcxx/test/std/utilities/memory/allocator.traits/allocator.traits.members/ |
| destroy.pass.cpp | 47 struct A0
50 ~A0() {++count;}
53 int A0::count = 0;
58 A0::count = 0;
60 std::aligned_storage<sizeof(A0)>::type a0; local
61 std::allocator_traits<A<int> >::construct(a, (A0*)&a0);
62 assert(A0::count == 0);
63 std::allocator_traits<A<int> >::destroy(a, (A0*)&a0)
71 std::aligned_storage<sizeof(A0)>::type a0; local
[all...] |
| construct.pass.cpp | 49 struct A0
52 A0() {++count;}
55 int A0::count = 0;
85 A0::count = 0;
87 std::aligned_storage<sizeof(A0)>::type a0; local
88 assert(A0::count == 0);
89 std::allocator_traits<A<int> >::construct(a, (A0*)&a0);
90 assert(A0::count == 1)
113 std::aligned_storage<sizeof(A0)>::type a0; local
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/memory/allocator.traits/allocator.traits.members/ |
| destroy.pass.cpp | 47 struct A0
50 ~A0() {++count;}
53 int A0::count = 0;
58 A0::count = 0;
60 std::aligned_storage<sizeof(A0)>::type a0; local
61 std::allocator_traits<A<int> >::construct(a, (A0*)&a0);
62 assert(A0::count == 0);
63 std::allocator_traits<A<int> >::destroy(a, (A0*)&a0)
71 std::aligned_storage<sizeof(A0)>::type a0; local
[all...] |
| construct.pass.cpp | 49 struct A0
52 A0() {++count;}
55 int A0::count = 0;
85 A0::count = 0;
87 std::aligned_storage<sizeof(A0)>::type a0; local
88 assert(A0::count == 0);
89 std::allocator_traits<A<int> >::construct(a, (A0*)&a0);
90 assert(A0::count == 1)
113 std::aligned_storage<sizeof(A0)>::type a0; local
[all...] |
| /external/clang/INPUTS/ |
| macro_pounder_fn.c | 6 #define A0(A, B) A B
7 #define A1(A, B) A0(A,B) A0(A,B) A0(A,B) A0(A,B) A0(A,B) A0(A,B)
|
| macro_pounder_obj.c | 6 #define A0 a b
7 #define A1 A0 A0 A0 A0 A0 A0
|
| /external/clang/test/Index/ |
| annotate-comments-preprocessor.c | 14 #define A0 0
22 int A[] = { A0, A1, A2, A3, A4, A5, A6 };
24 #if A0 /** Aaa. */
|
| /frameworks/av/media/libeffects/lvm/lib/Common/src/ |
| Filters.h | 34 * Biquad with coefficients A0, A1, A2, B1 and B2 coefficients
39 LVM_INT16 A0;
49 * Biquad with coefficients A0, A1 and B1 coefficients
54 LVM_INT16 A0;
|
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/mmix/ |
| greg1.s | 5 A0 GREG 0
|
| /external/clang/test/Analysis/ |
| NewDeleteLeaks-PR19102.cpp | 3 class A0 {};
26 new A0; // expected-warning@+1 {{Potential memory leak}}
|
| /external/clang/test/CXX/temp/temp.param/ |
| p9-0x.cpp | 27 struct A0 { template<typename U> struct B; };
28 template<typename U = int> struct A0::B { };
|
| /frameworks/av/media/libeffects/lvm/lib/Eq/src/ |
| LVEQNB_CalcCoef.c | 60 /* a0 = (0.5 + b2) / 2 */
102 LVM_INT32 A0;
142 factor = 0x7fff; /* Initialise to 1.0 for the a0 coefficient */
153 * Calculate the B1 and A0 coefficients
156 A0 = ((B1 >> 16) * (CosErr >> 10)) >> 6; /* Temporary storage for (0.5 - b2/2) * coserr(t0) */
157 B1 -= A0; /* B1 = (0.5 - b2/2) * (1 - coserr(t0)) */
158 A0 = (0x40000000 + B2) >> 1; /* A0 = (0.5 + b2) */
163 pCoefficients->A0 = A0;
[all...] |
