/external/valgrind/none/tests/mips64/ |
D | rotate_swap.stdout.exp-mips64r2 | 2 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 …]
|
D | rotate_swap.c | 3 #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/libdivsufsort/lib/ |
D | divsufsort.c | 38 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 …]
|
D | trsort.c | 98 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 …]
|
D | utils.c | 53 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 …]
|
/external/clang/test/SemaCXX/ |
D | class-layout.cpp | 5 #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 …]
|
D | empty-class-layout.cpp | 4 #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 …]
|
/external/autotest/server/site_tests/bluetooth_SDP_ServiceAttributeRequest/ |
D | control | 28 TP/SERVER/SA/BV-01-C 29 TP/SERVER/SA/BV-03-C 30 TP/SERVER/SA/BV-04-C 31 TP/SERVER/SA/BV-05-C 32 TP/SERVER/SA/BV-06-C 33 TP/SERVER/SA/BV-07-C 34 TP/SERVER/SA/BV-08-C 35 TP/SERVER/SA/BV-09-C 36 TP/SERVER/SA/BV-10-C 37 TP/SERVER/SA/BV-11-C [all …]
|
/external/llvm/test/Linker/ |
D | type-unique-type-array-b.ll | 7 ; 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 …]
|
D | type-unique-type-array-a.ll | 8 ; 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/libcxx/test/std/utilities/allocator.adaptor/allocator.adaptor.members/ |
D | construct_pair.pass.cpp | 39 using SA = std::scoped_allocator_adaptor<Alloc>; in test_no_inner_alloc() typedef 44 SA A(CA); in test_no_inner_alloc() 49 std::tuple<std::allocator_arg_t, SA&>&&, in test_no_inner_alloc() 50 std::tuple<SA&>&& in test_no_inner_alloc() 62 using SA = std::scoped_allocator_adaptor<Alloc>; in test_no_inner_alloc() typedef 67 SA A(CA); in test_no_inner_alloc() 72 std::tuple<std::allocator_arg_t, SA&>&&, in test_no_inner_alloc() 92 using SA = std::scoped_allocator_adaptor<Outer, Inner>; in test_with_inner_alloc() typedef 100 SA A(O, I); in test_with_inner_alloc() 119 using SA = std::scoped_allocator_adaptor<Outer, Inner>; in test_with_inner_alloc() typedef [all …]
|
D | construct_pair_const_lvalue_pair.pass.cpp | 42 using SA = std::scoped_allocator_adaptor<Alloc>; in test_no_inner_alloc() typedef 47 SA A(CA); in test_no_inner_alloc() 53 std::tuple<std::allocator_arg_t, SA&, int&>&&, in test_no_inner_alloc() 54 std::tuple<int const&, SA&>&& in test_no_inner_alloc() 69 using SA = std::scoped_allocator_adaptor<Alloc>; in test_no_inner_alloc() typedef 74 SA A(CA); in test_no_inner_alloc() 80 std::tuple<std::allocator_arg_t, SA&, int const&>&&, in test_no_inner_alloc() 103 using SA = std::scoped_allocator_adaptor<Outer, Inner>; in test_with_inner_alloc() typedef 111 SA A(O, I); in test_with_inner_alloc() 134 using SA = std::scoped_allocator_adaptor<Outer, Inner>; in test_with_inner_alloc() typedef [all …]
|
D | construct_pair_rvalue.pass.cpp | 42 using SA = std::scoped_allocator_adaptor<Alloc>; in test_no_inner_alloc() typedef 47 SA A(CA); in test_no_inner_alloc() 53 std::tuple<std::allocator_arg_t, SA&, int&>&&, in test_no_inner_alloc() 54 std::tuple<int const&&, SA&>&& in test_no_inner_alloc() 69 using SA = std::scoped_allocator_adaptor<Alloc>; in test_no_inner_alloc() typedef 74 SA A(CA); in test_no_inner_alloc() 80 std::tuple<std::allocator_arg_t, SA&, int&&>&&, in test_no_inner_alloc() 103 using SA = std::scoped_allocator_adaptor<Outer, Inner>; in test_with_inner_alloc() typedef 111 SA A(O, I); in test_with_inner_alloc() 134 using SA = std::scoped_allocator_adaptor<Outer, Inner>; in test_with_inner_alloc() typedef [all …]
|
D | construct_pair_values.pass.cpp | 41 using SA = std::scoped_allocator_adaptor<Alloc>; in test_no_inner_alloc() typedef 46 SA A(CA); in test_no_inner_alloc() 51 std::tuple<std::allocator_arg_t, SA&, int&>&&, in test_no_inner_alloc() 52 std::tuple<int const&&, SA&>&& in test_no_inner_alloc() 66 using SA = std::scoped_allocator_adaptor<Alloc>; in test_no_inner_alloc() typedef 71 SA A(CA); in test_no_inner_alloc() 76 std::tuple<std::allocator_arg_t, SA&, int&&>&&, in test_no_inner_alloc() 98 using SA = std::scoped_allocator_adaptor<Outer, Inner>; in test_with_inner_alloc() typedef 106 SA A(O, I); in test_with_inner_alloc() 127 using SA = std::scoped_allocator_adaptor<Outer, Inner>; in test_with_inner_alloc() typedef [all …]
|
D | construct_pair_piecewise.pass.cpp | 42 using SA = std::scoped_allocator_adaptor<Alloc>; in test_no_inner_alloc() typedef 47 SA A(CA); in test_no_inner_alloc() 54 std::tuple<std::allocator_arg_t, SA&, int&>&&, in test_no_inner_alloc() 55 std::tuple<int const&&, SA&>&& in test_no_inner_alloc() 69 using SA = std::scoped_allocator_adaptor<Alloc>; in test_no_inner_alloc() typedef 74 SA A(CA); in test_no_inner_alloc() 81 std::tuple<std::allocator_arg_t, SA&, int&&>&&, in test_no_inner_alloc() 103 using SA = std::scoped_allocator_adaptor<Outer, Inner>; in test_with_inner_alloc() typedef 111 SA A(O, I); in test_with_inner_alloc() 134 using SA = std::scoped_allocator_adaptor<Outer, Inner>; in test_with_inner_alloc() typedef [all …]
|
D | construct_type.pass.cpp | 42 using SA = std::scoped_allocator_adaptor<Outer, Inner>; in test_bullet_one() typedef 48 SA A(O, I); in test_bullet_one() 75 using SA = std::scoped_allocator_adaptor<Outer, Inner>; in test_bullet_two() typedef 81 SA A(O, I); in test_bullet_two() 87 SA::inner_allocator_type&, int&, int const&, int&&>(O, ptr))); in test_bullet_two() 108 using SA = std::scoped_allocator_adaptor<Outer, Inner>; in test_bullet_three() typedef 114 SA A(O, I); in test_bullet_three() 121 SA::inner_allocator_type&>(O, ptr))); in test_bullet_three()
|
/external/scapy/doc/scapy/ |
D | usage.rst | 375 flags=SA window=8190 chksum=0xcdc7 urgptr=0 options=[('MSS', 536)] | 378 From the above output, we can see Google returned “SA” or SYN-ACK flags indicating an open port. 395 …data > 192.168.1.1:https S ======> IP / TCP 192.168.1.1:https > 192.168.1.100:ftp-data SA / Padding 403 https SA 417 80 SA RA SA 418 443 SA SA SA 422 …laying only certain responses. The example below will only display packets with the “SA” flag set:: 424 >>> ans.nsummary(lfilter = lambda (s,r): r.sprintf("%TCP.flags%") == "SA") 425 …1.100:ftp_data > 192.168.1.1:https S ======> IP / TCP 192.168.1.1:https > 192.168.1.100:ftp_data SA 429 …>>> ans.summary(lfilter = lambda (s,r): r.sprintf("%TCP.flags%") == "SA",prn=lambda(s,r):r.sprintf… [all …]
|
/external/libdivsufsort/examples/ |
D | sasearch.c | 72 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);
|
D | suftest.c | 73 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);
|
/external/llvm/lib/Target/Hexagon/ |
D | RDFCopy.cpp | 77 void CopyPropagation::recordCopy(NodeAddr<StmtNode*> SA, EqualityMap &EM) { in recordCopy() argument 78 CopyMap.insert(std::make_pair(SA.Id, EM)); in recordCopy() 79 Copies.push_back(SA.Id); in recordCopy() 85 RDefMap[I.second][SA.Id] = FS->second.top()->Id; in recordCopy() 124 NodeAddr<StmtNode*> SA = IA; in scanBlock() local 126 if (interpretAsCopy(SA.Addr->getCode(), EM)) in scanBlock() 127 recordCopy(SA, EM); in scanBlock() 176 auto SA = DFG.addr<InstrNode*>(C); in run() local 177 auto FS = CopyMap.find(SA.Id); in run() 182 for (NodeAddr<DefNode*> DA : SA.Addr->members_if(DFG.IsDef, DFG)) { in run() [all …]
|
/external/llvm/test/CodeGen/X86/ |
D | mmx-coalescing.ll | 3 %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/ |
D | CXIndexDataConsumer.cpp | 237 ScratchAlloc &SA) { in ObjCProtocolListInfo() argument 244 IdxCtx.getEntityInfo(PD, ProtEntities.back(), SA); in ObjCProtocolListInfo() 277 : SA(IdxCtx), ref_cnt(0) { in AttrListInfo() 316 IdxCtx.getEntityInfo(InterD, IBInfo.ClassInfo, SA); in AttrListInfo() 330 ScratchAlloc SA(IdxCtx); in create() local 331 AttrListInfo *attrs = SA.allocate<AttrListInfo>(); in create() 337 ScratchAlloc &SA) { in CXXBasesListInfo() argument 354 IdxCtx.getEntityInfo(BaseD, BaseEntities.back(), SA); in CXXBasesListInfo() 463 ScratchAlloc SA(*this); in ppIncludedFile() local 465 SA.toCStr(filename), in ppIncludedFile() [all …]
|
/external/swiftshader/third_party/LLVM/lib/CodeGen/ |
D | RegAllocGreedy.cpp | 172 std::auto_ptr<SplitAnalysis> SA; member in __anon97cedd6b0111::RAGreedy 674 ArrayRef<SplitAnalysis::BlockInfo> UseBlocks = SA->getUseBlocks(); in addSplitConstraints() 707 if (Intf.last() >= SA->getLastSplitPoint(BC.Number)) in addSplitConstraints() 761 if (Intf.last() >= SA->getLastSplitPoint(Number)) in addThroughConstraints() 780 BitVector Todo = SA->getThroughBlocks(); in growRegion() 837 if (!SA->getNumThroughBlocks()) in calcCompactRegion() 877 ArrayRef<SplitAnalysis::BlockInfo> UseBlocks = SA->getUseBlocks(); in calcSpillCost() 898 ArrayRef<SplitAnalysis::BlockInfo> UseBlocks = SA->getUseBlocks(); in calcGlobalSplitCost() 956 unsigned Reg = SA->getParent().reg; in splitAroundRegion() 960 ArrayRef<SplitAnalysis::BlockInfo> UseBlocks = SA->getUseBlocks(); in splitAroundRegion() [all …]
|
/external/cblas/testing/ |
D | c_zblat1.f | 87 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 …]
|
/external/eigen/blas/testing/ |
D | zblat1.f | 129 DOUBLE PRECISION SA local 147 DATA SA, CA/0.3D0, (0.4D0,-0.7D0)/ 265 CALL ZDSCAL(N,SA,CX,INCX) 293 SA = 0.0D0 298 CALL ZDSCAL(5,SA,CX,INCX) 301 SA = 1.0D0 306 CALL ZDSCAL(5,SA,CX,INCX) 309 SA = -1.0D0 314 CALL ZDSCAL(5,SA,CX,INCX) 644 DOUBLE PRECISION FUNCTION SDIFF(SA,SB) [all …]
|