Home
last modified time | relevance | path

Searched refs:SA (Results 1 – 25 of 368) sorted by relevance

12345678910>>...15

/external/valgrind/none/tests/mips64/
Drotate_swap.stdout.exp-mips64r22 drotr :: in 0x2000ffffffffffff, out 0xffff2000ffffffff, SA 16
3 drotr :: in 0xffff0000ffffffff, out 0xffffffff0000ffff, SA 16
4 drotr :: in 0x2000ffffffffffff, out 0xff2000ffffffffff, SA 8
5 drotr :: in 0x2000ffffffffffff, out 0xf2000fffffffffff, SA 4
6 drotr :: in 0x2000ffffffffffff, out 0xf90007ffffffffff, SA 5
7 drotr :: in 0x31415927ffffffff, out 0xffcc505649ffffff, SA 10
8 drotr :: in 0x2000ffffffffffff, out 0xf2000fffffffffff, SA 4
9 drotr :: in 0x2000ffffffffffff, out 0x2000ffffffffffff, SA 0
10 drotr :: in 0xeeeeffffffffffff, out 0xffffeeeeffffffff, SA 16
11 drotr :: in 0x2000ffffffffbbbb, out 0xffff77764001ffff, SA 31
[all …]
Drotate_swap.c3 #define TESTINST_DROTR(instruction, in, SA) \ argument
9 instruction" $t0, $t1, "#SA "\n\t" \
16 instruction, (long long) in, out, SA); \
19 #define TESTINST_DROTRV(instruction, in, SA) \ argument
29 : "r" (in), "r" (SA) \
33 instruction, (long long) in, out, SA); \
/external/clang/test/SemaCXX/
Dempty-class-layout.cpp4 #define SA(n, p) int a##n[(p) ? 1 : -1] macro
9 SA(0, sizeof(A) == 4);
12 SA(1, sizeof(B) == 1);
15 SA(2, sizeof(C) == 4);
22 SA(3, sizeof(G) == 2);
29 SA(4, sizeof(I) == 2);
34 SA(5, sizeof(J) == 3);
43 SA(6, sizeof(S1) == 24);
48 SA(7, sizeof(S2) == 24);
56 SA(8, sizeof(S4) == 2);
[all …]
Dclass-layout.cpp5 #define SA(n, p) int a##n[(p) ? 1 : -1] macro
12 SA(0, sizeof(A) == 8);
18 SA(1, sizeof(B) == 12);
27 SA(2, sizeof(C) == 8);
33 SA(3, sizeof(D) == 8);
40 SA(4, sizeof(E) == 5);
46 SA(5, sizeof(F) == 6);
51 SA(6, sizeof(H) == 1);
58 SA(6_1, sizeof(I) == 5);
64 SA(7, sizeof(A) == 1);
[all …]
/external/libdivsufsort/lib/
Ddivsufsort.c38 sort_typeBstar(const sauchar_t *T, saidx_t *SA, in sort_typeBstar() argument
66 SA[--m] = i; in sort_typeBstar()
94 PAb = SA + n - m; ISAb = SA + m; in sort_typeBstar()
97 SA[--BUCKET_BSTAR(c0, c1)] = i; in sort_typeBstar()
100 SA[--BUCKET_BSTAR(c0, c1)] = m - 1; in sort_typeBstar()
105 buf = SA + m, bufsize = (n - (2 * m)) / tmp; in sort_typeBstar()
128 sssort(T, PAb, SA + k, SA + l, in sort_typeBstar()
129 curbuf, bufsize, 2, n, *(SA + k) == (m - 1)); in sort_typeBstar()
133 buf = SA + m, bufsize = n - (2 * m); in sort_typeBstar()
138 sssort(T, PAb, SA + i, SA + j, in sort_typeBstar()
[all …]
Dutils.c53 bw_transform(const sauchar_t *T, sauchar_t *U, saidx_t *SA, in bw_transform() argument
66 if((A = SA) == NULL) { in bw_transform()
102 if(SA == NULL) { in bw_transform()
161 sufcheck(const sauchar_t *T, const saidx_t *SA, in sufcheck() argument
170 if((T == NULL) || (SA == NULL) || (n < 0)) { in sufcheck()
181 if((SA[i] < 0) || (n <= SA[i])) { in sufcheck()
185 n - 1, i, SA[i]); in sufcheck()
193 if(T[SA[i - 1]] > T[SA[i]]) { in sufcheck()
198 i - 1, SA[i - 1], T[SA[i - 1]], i, SA[i], T[SA[i]]); in sufcheck()
216 p = SA[i]; in sufcheck()
[all …]
Dtrsort.c98 tr_fixdown(const saidx_t *ISAd, saidx_t *SA, saidx_t i, saidx_t size) { in tr_fixdown() argument
103 for(v = SA[i], c = ISAd[v]; (j = 2 * i + 1) < size; SA[i] = SA[k], i = k) { in tr_fixdown()
104 d = ISAd[SA[k = j++]]; in tr_fixdown()
105 if(d < (e = ISAd[SA[j]])) { k = j; d = e; } in tr_fixdown()
108 SA[i] = v; in tr_fixdown()
114 tr_heapsort(const saidx_t *ISAd, saidx_t *SA, saidx_t size) { in tr_heapsort() argument
121 if(ISAd[SA[m / 2]] < ISAd[SA[m]]) { SWAP(SA[m], SA[m / 2]); } in tr_heapsort()
124 for(i = m / 2 - 1; 0 <= i; --i) { tr_fixdown(ISAd, SA, i, m); } in tr_heapsort()
125 if((size % 2) == 0) { SWAP(SA[0], SA[m]); tr_fixdown(ISAd, SA, 0, m); } in tr_heapsort()
127 t = SA[0], SA[0] = SA[i]; in tr_heapsort()
[all …]
Dsssort.c193 saidx_t *SA, saidx_t i, saidx_t size) { in ss_fixdown() argument
198 for(v = SA[i], c = Td[PA[v]]; (j = 2 * i + 1) < size; SA[i] = SA[k], i = k) { in ss_fixdown()
199 d = Td[PA[SA[k = j++]]]; in ss_fixdown()
200 if(d < (e = Td[PA[SA[j]]])) { k = j; d = e; } in ss_fixdown()
203 SA[i] = v; in ss_fixdown()
209 ss_heapsort(const sauchar_t *Td, const saidx_t *PA, saidx_t *SA, saidx_t size) { in ss_heapsort() argument
216 if(Td[PA[SA[m / 2]]] < Td[PA[SA[m]]]) { SWAP(SA[m], SA[m / 2]); } in ss_heapsort()
219 for(i = m / 2 - 1; 0 <= i; --i) { ss_fixdown(Td, PA, SA, i, m); } in ss_heapsort()
220 if((size % 2) == 0) { SWAP(SA[0], SA[m]); ss_fixdown(Td, PA, SA, 0, m); } in ss_heapsort()
222 t = SA[0], SA[0] = SA[i]; in ss_heapsort()
[all …]
/external/autotest/server/site_tests/bluetooth_SDP_ServiceAttributeRequest/
Dcontrol29 TP/SERVER/SA/BV-01-C
30 TP/SERVER/SA/BV-03-C
31 TP/SERVER/SA/BV-04-C
32 TP/SERVER/SA/BV-05-C
33 TP/SERVER/SA/BV-06-C
34 TP/SERVER/SA/BV-07-C
35 TP/SERVER/SA/BV-08-C
36 TP/SERVER/SA/BV-09-C
37 TP/SERVER/SA/BV-10-C
38 TP/SERVER/SA/BV-11-C
[all …]
/external/llvm/test/Linker/
Dtype-unique-type-array-b.ll7 ; 1 struct SA {
13 ; 7 void testB(SA sa) {
17 ; 11 void topB(B* b, SA sa) {
22 %struct.SA = type { i32 }
27 %sa = alloca %struct.SA, align 4
29 %agg.tmp = alloca %struct.SA, align 4
30 %coerce.dive = getelementptr %struct.SA, %struct.SA* %sa, i32 0, i32 0
34 …call void @llvm.dbg.declare(metadata %struct.SA* %sa, metadata !26, metadata !DIExpression()), !db…
36 %1 = bitcast %struct.SA* %agg.tmp to i8*, !dbg !28
37 %2 = bitcast %struct.SA* %sa to i8*, !dbg !28
[all …]
Dtype-unique-type-array-a.ll8 ; 1 struct SA {
14 ; 7 void testA(SA a) {
18 ; 11 void topA(A *a, SA sa) {
31 ; CHECK-NEXT: DW_AT_name {{.*}} "SA"
43 %struct.SA = type { i32 }
48 %sa = alloca %struct.SA, align 4
50 %agg.tmp = alloca %struct.SA, align 4
51 %coerce.dive = getelementptr %struct.SA, %struct.SA* %sa, i32 0, i32 0
55 …call void @llvm.dbg.declare(metadata %struct.SA* %sa, metadata !26, metadata !DIExpression()), !db…
57 %1 = bitcast %struct.SA* %agg.tmp to i8*, !dbg !28
[all …]
/external/libdivsufsort/examples/
Dsasearch.c72 saidx_t *SA; local
113 SA = (saidx_t *)malloc((size_t)n * sizeof(saidx_t));
114 if((T == NULL) || (SA == NULL)) {
142 if(fread(SA, sizeof(saidx_t), (size_t)n, fp) != (size_t)n) {
155 SA, (saidx_t)n, &left);
157 fprintf(stdout, "%" PRIdSAIDX_T "\n", SA[left + i]);
161 free(SA);
Dsuftest.c73 saidx_t *SA; local
129 SA = (saidx_t *)malloc((size_t)n * sizeof(saidx_t));
130 if((T == NULL) || (SA == NULL)) {
149 if(divsufsort(T, SA, (saidx_t)n) != 0) {
157 if(sufcheck(T, SA, (saidx_t)n, 1) != 0) { exit(EXIT_FAILURE); }
160 free(SA);
Dmksary.c73 saidx_t *SA; local
153 SA = (saidx_t *)malloc((size_t)n * sizeof(saidx_t));
154 if((T == NULL) || (SA == NULL)) {
173 if(divsufsort(T, SA, (saidx_t)n) != 0) {
181 if(fwrite(SA, sizeof(saidx_t), (size_t)n, ofp) != (size_t)n) {
189 free(SA);
/external/libdivsufsort/android_include/
Ddivsufsort.h76 divsufsort(const sauchar_t *T, saidx_t *SA, saidx_t n);
111 saidx_t *SA /* can NULL */,
139 sufcheck(const sauchar_t *T, const saidx_t *SA, saidx_t n, saint_t verbose);
156 const saidx_t *SA, saidx_t SAsize,
172 const saidx_t *SA, saidx_t SAsize,
Ddivsufsort64.h76 divsufsort64(const sauchar_t *T, saidx64_t *SA, saidx64_t n);
111 saidx64_t *SA /* can NULL */,
139 sufcheck64(const sauchar_t *T, const saidx64_t *SA, saidx64_t n, saint_t verbose);
156 const saidx64_t *SA, saidx64_t SAsize,
172 const saidx64_t *SA, saidx64_t SAsize,
/external/llvm/test/CodeGen/X86/
Dmmx-coalescing.ll3 %SA = type <{ %union.anon, i32, [4 x i8], i8*, i8*, i8*, i32, [4 x i8] }>
8 define i32 @test(%SA* %pSA, i16* %A, i32 %B, i32 %C, i32 %D, i8* %E) {
19 %v = getelementptr inbounds %SA, %SA* %pSA, i64 0, i32 0, i32 0
21 %SA0 = getelementptr inbounds %SA, %SA* %pSA, i64 0, i32 1
23 %SA1 = getelementptr inbounds %SA, %SA* %pSA, i64 0, i32 3
25 %SA2 = getelementptr inbounds %SA, %SA* %pSA, i64 0, i32 4
/external/clang/tools/libclang/
DIndexingContext.cpp25 ScratchAlloc &SA) { in ObjCProtocolListInfo() argument
32 IdxCtx.getEntityInfo(PD, ProtEntities.back(), SA); in ObjCProtocolListInfo()
65 : SA(IdxCtx), ref_cnt(0) { in AttrListInfo()
104 IdxCtx.getEntityInfo(InterD, IBInfo.ClassInfo, SA); in AttrListInfo()
118 ScratchAlloc SA(IdxCtx); in create() local
119 AttrListInfo *attrs = SA.allocate<AttrListInfo>(); in create()
125 ScratchAlloc &SA) { in CXXBasesListInfo() argument
142 IdxCtx.getEntityInfo(BaseD, BaseEntities.back(), SA); in CXXBasesListInfo()
251 ScratchAlloc SA(*this); in ppIncludedFile() local
253 SA.toCStr(filename), in ppIncludedFile()
[all …]
/external/llvm/lib/MC/
DMCObjectWriter.cpp28 const MCSymbol &SA = A->getSymbol(); in isSymbolRefDifferenceFullyResolved() local
30 if (SA.isUndefined() || SB.isUndefined()) in isSymbolRefDifferenceFullyResolved()
33 if (!SA.getFragment() || !SB.getFragment()) in isSymbolRefDifferenceFullyResolved()
36 return isSymbolRefDifferenceFullyResolvedImpl(Asm, SA, SB, InSet); in isSymbolRefDifferenceFullyResolved()
/external/cblas/testing/
Dc_zblat1.f87 DOUBLE PRECISION SA local
105 DATA SA, CA/0.3D0, (0.4D0,-0.7D0)/
223 CALL ZDSCALTEST(N,SA,CX,INCX)
251 SA = 0.0D0
256 CALL ZDSCALTEST(5,SA,CX,INCX)
259 SA = 1.0D0
264 CALL ZDSCALTEST(5,SA,CX,INCX)
267 SA = -1.0D0
272 CALL ZDSCALTEST(5,SA,CX,INCX)
602 DOUBLE PRECISION FUNCTION SDIFF(SA,SB)
[all …]
Dc_dblat1.f92 DOUBLE PRECISION SA, SB, SC, SS local
129 SA = DA1(K)
131 CALL DROTGTEST(SA,SB,SC,SS)
132 CALL STEST1(SA,DATRUE(K),DATRUE(K),SFAC)
156 + SA(10), STEMP(1), STRUE(8), SX(8) local
169 DATA SA/0.3D0, -1.0D0, 0.0D0, 1.0D0, 0.3D0, 0.3D0,
221 CALL DSCALTEST(N,SA((INCX-1)*5+NP1),SX,INCX)
247 DOUBLE PRECISION SA local
265 DATA SA/0.3D0/
363 CALL DAXPYTEST(N,SA,SX,INCX,SY,INCY)
[all …]
/external/eigen/blas/testing/
Dzblat1.f87 DOUBLE PRECISION SA local
105 DATA SA, CA/0.3D0, (0.4D0,-0.7D0)/
223 CALL ZDSCAL(N,SA,CX,INCX)
251 SA = 0.0D0
256 CALL ZDSCAL(5,SA,CX,INCX)
259 SA = 1.0D0
264 CALL ZDSCAL(5,SA,CX,INCX)
267 SA = -1.0D0
272 CALL ZDSCAL(5,SA,CX,INCX)
601 DOUBLE PRECISION FUNCTION SDIFF(SA,SB)
[all …]
/external/mdnsresponder/mDNSShared/
DCommonServices.h498 #define SOCKADDR_IS_IP_LOOPBACK( SA ) \ argument
499 ( ( (const struct sockaddr *)( SA ) )->sa_family == AF_INET ) \
500 ? ( ( (const struct sockaddr_in *)( SA ) )->sin_addr.s_addr == htonl( INADDR_LOOPBACK ) ) \
501 : ( ( (const struct sockaddr *)( SA ) )->sa_family == AF_INET6 ) \
502 ? IN6_IS_ADDR_LOOPBACK( &( (const struct sockaddr_in6 *)( SA ) )->sin6_addr ) \
505 #define SOCKADDR_IS_IP_LOOPBACK( SA ) \ argument
506 ( ( (const struct sockaddr *)( SA ) )->sa_family == AF_INET ) \
507 ? ( ( (const struct sockaddr_in *)( SA ) )->sin_addr.s_addr == htonl( INADDR_LOOPBACK ) ) \
518 #define SOCKADDR_IS_IP_LINK_LOCAL( SA ) \ argument
519 ( ( ( (const struct sockaddr *)( SA ) )->sa_family == AF_INET ) \
[all …]
/external/clang/test/Parser/
Dcxx-using-declaration.cpp6 struct SA { int V; }; struct
11 using typename A::SA; argument
17 SA x; //Still needs handling. in main()
/external/llvm/test/CodeGen/AMDGPU/
Dllvm.AMDGPU.class.ll10 ; SI-DAG: s_load_dword [[SA:s[0-9]+]], s{{\[[0-9]+:[0-9]+\]}}, 0xb
13 ; SI: v_cmp_class_f32_e32 vcc, [[SA]], [[VB]]
25 ; SI-DAG: s_load_dword [[SA:s[0-9]+]], s{{\[[0-9]+:[0-9]+\]}}, 0xb
28 ; SI: v_cmp_class_f32_e64 [[CMP:s\[[0-9]+:[0-9]+\]]], |[[SA]]|, [[VB]]
41 ; SI-DAG: s_load_dword [[SA:s[0-9]+]], s{{\[[0-9]+:[0-9]+\]}}, 0xb
44 ; SI: v_cmp_class_f32_e64 [[CMP:s\[[0-9]+:[0-9]+\]]], -[[SA]], [[VB]]
57 ; SI-DAG: s_load_dword [[SA:s[0-9]+]], s{{\[[0-9]+:[0-9]+\]}}, 0xb
60 ; SI: v_cmp_class_f32_e64 [[CMP:s\[[0-9]+:[0-9]+\]]], -|[[SA]]|, [[VB]]
74 ; SI: s_load_dword [[SA:s[0-9]+]], s{{\[[0-9]+:[0-9]+\]}}, 0xb
75 ; SI: v_cmp_class_f32_e64 [[COND:s\[[0-9]+:[0-9]+\]]], [[SA]], 1{{$}}
[all …]

12345678910>>...15