| /external/pdfium/third_party/libopenjpeg20/ |
| sparse_array.c | 7 * Copyright (c) 2017, IntoPix SA <contact@intopix.com>
50 opj_sparse_array_int32_t* sa; local
59 sa = (opj_sparse_array_int32_t*) opj_calloc(1,
61 sa->width = width;
62 sa->height = height;
63 sa->block_width = block_width;
64 sa->block_height = block_height;
65 sa->block_count_hor = opj_uint_ceildiv(width, block_width);
66 sa->block_count_ver = opj_uint_ceildiv(height, block_height);
67 if (sa->block_count_hor > ((OPJ_UINT32)~0U) / sa->block_count_ver)
[all...] |
| /prebuilts/go/darwin-x86/src/net/ |
| cgo_socknew.go | 24 sa := syscall.RawSockaddrInet4{Family: syscall.AF_INET}
25 copy(sa.Addr[:], ip)
26 return (*C.struct_sockaddr)(unsafe.Pointer(&sa))
30 sa := syscall.RawSockaddrInet6{Family: syscall.AF_INET6, Scope_id: uint32(zone)}
31 copy(sa.Addr[:], ip)
32 return (*C.struct_sockaddr)(unsafe.Pointer(&sa))
|
| cgo_sockold.go | 24 sa := syscall.RawSockaddrInet4{Len: syscall.SizeofSockaddrInet4, Family: syscall.AF_INET}
25 copy(sa.Addr[:], ip)
26 return (*C.struct_sockaddr)(unsafe.Pointer(&sa))
30 sa := syscall.RawSockaddrInet6{Len: syscall.SizeofSockaddrInet6, Family: syscall.AF_INET6, Scope_id: uint32(zone)}
31 copy(sa.Addr[:], ip)
32 return (*C.struct_sockaddr)(unsafe.Pointer(&sa))
|
| iprawsock_posix.go | 14 func sockaddrToIP(sa syscall.Sockaddr) Addr {
15 switch sa := sa.(type) {
17 return &IPAddr{IP: sa.Addr[0:]}
19 return &IPAddr{IP: sa.Addr[0:], Zone: zoneCache.name(int(sa.ZoneId))}
49 n, sa, err := c.fd.readFrom(b)
50 switch sa := sa.(type) {
52 addr = &IPAddr{IP: sa.Addr[0:]
[all...] |
| /prebuilts/go/linux-x86/src/net/ |
| cgo_socknew.go | 24 sa := syscall.RawSockaddrInet4{Family: syscall.AF_INET}
25 copy(sa.Addr[:], ip)
26 return (*C.struct_sockaddr)(unsafe.Pointer(&sa))
30 sa := syscall.RawSockaddrInet6{Family: syscall.AF_INET6, Scope_id: uint32(zone)}
31 copy(sa.Addr[:], ip)
32 return (*C.struct_sockaddr)(unsafe.Pointer(&sa))
|
| cgo_sockold.go | 24 sa := syscall.RawSockaddrInet4{Len: syscall.SizeofSockaddrInet4, Family: syscall.AF_INET}
25 copy(sa.Addr[:], ip)
26 return (*C.struct_sockaddr)(unsafe.Pointer(&sa))
30 sa := syscall.RawSockaddrInet6{Len: syscall.SizeofSockaddrInet6, Family: syscall.AF_INET6, Scope_id: uint32(zone)}
31 copy(sa.Addr[:], ip)
32 return (*C.struct_sockaddr)(unsafe.Pointer(&sa))
|
| iprawsock_posix.go | 14 func sockaddrToIP(sa syscall.Sockaddr) Addr {
15 switch sa := sa.(type) {
17 return &IPAddr{IP: sa.Addr[0:]}
19 return &IPAddr{IP: sa.Addr[0:], Zone: zoneCache.name(int(sa.ZoneId))}
49 n, sa, err := c.fd.readFrom(b)
50 switch sa := sa.(type) {
52 addr = &IPAddr{IP: sa.Addr[0:]
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.nonmodifying/alg.count/ |
| count_if.pass.cpp | 33 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local
35 input_iterator<const int*>(ia + sa),
38 input_iterator<const int*>(ia + sa),
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.nonmodifying/alg.find.end/ |
| find_end.pass.cpp | 27 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local
29 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b+1)) == Iter1(ia+sa-1));
31 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(c), Iter2(c+2)) == Iter1(ia+18));
33 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(d), Iter2(d+3)) == Iter1(ia+15));
35 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(e), Iter2(e+4)) == Iter1(ia+11));
37 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(f), Iter2(f+5)) == Iter1(ia+6));
39 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(g), Iter2(g+6)) == Iter1(ia));
41 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(h), Iter2(h+7)) == Iter1(ia+sa));
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.nonmodifying/mismatch/ |
| mismatch_pred.pass.cpp | 33 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local
41 assert(std::mismatch(II(ia), II(ia + sa), II(ib), EQ())
43 assert(std::mismatch(RAI(ia), RAI(ia + sa), RAI(ib), EQ())
47 assert(std::mismatch(RAI(ia), RAI(ia + sa), RAI(ib), std::ref(bcp))
49 assert(bcp.count() > 0 && bcp.count() < sa);
53 assert(std::mismatch(II(ia), II(ia + sa), II(ib), II(ib + sb), EQ())
55 assert(std::mismatch(RAI(ia), RAI(ia + sa), RAI(ib), RAI(ib + sb), EQ())
58 assert(std::mismatch(II(ia), II(ia + sa), II(ib), II(ib + sb), std::ref(bcp))
60 assert(bcp.count() > 0 && bcp.count() < std::min(sa, sb));
63 assert(std::mismatch(ia, ia + sa, ib, EQ()) =
[all...] |
| /external/icu/icu4c/source/common/ |
| uchar.cpp | 656 const USetAdder *sa=(const USetAdder *)context; local
657 sa->add(sa->set, start);
663 #define USET_ADD_CP_AND_NEXT(sa, cp) sa->add(sa->set, cp); sa->add(sa->set, cp+1)
666 uchar_addPropertyStarts(const USetAdder *sa, UErrorCode *pErrorCode) {
672 utrie2_enum(&propsTrie, NULL, _enumPropertyStartsRange, sa);
[all...] |
| /external/ltp/testcases/open_posix_testsuite/stress/threads/pthread_kill/ |
| stress.c | 106 struct sigaction sa; local
107 sigemptyset(&sa.sa_mask);
108 sa.sa_flags = 0;
109 sa.sa_handler = floodsighdl;
111 if ((ret = sigaction(SIGABRT, &sa, NULL))) {
115 if ((ret = sigaction(SIGBUS, &sa, NULL))) {
174 struct sigaction sa; local
175 sigemptyset(&sa.sa_mask);
176 sa.sa_flags = 0;
177 sa.sa_handler = syncsighdl
233 struct sigaction sa; local
[all...] |
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/ |
| search_n_pred.pass.cpp | 52 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local
54 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 0, count_equal()) == Iter(ia));
55 assert(count_equal::count <= sa);
57 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 0, count_equal()) == Iter(ia+0));
58 assert(count_equal::count <= sa);
60 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 0, count_equal()) == Iter(ia+sa));
61 assert(count_equal::count <= sa);
63 assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 0, count_equal()) == Iter(ia+sa))
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.nonmodifying/alg.search/ |
| search_n_pred.pass.cpp | 39 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local
41 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 0, count_equal()) == Iter(ia));
42 assert(count_equal::count <= sa);
44 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 0, count_equal()) == Iter(ia+0));
45 assert(count_equal::count <= sa);
47 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 0, count_equal()) == Iter(ia+sa));
48 assert(count_equal::count <= sa);
50 assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 0, count_equal()) == Iter(ia+sa))
[all...] |
| /external/ltp/testcases/kernel/syscalls/kill/ |
| kill10.c | 188 static inline int k_sigaction(int sig, struct sigaction *sa, struct sigaction *osa);
284 struct sigaction sa; local
299 sa.sa_handler = SIG_DFL;
300 sigemptyset(&sa.sa_mask);
301 sa.sa_flags = 0;
304 k_sigaction(SIGTRAP, &sa, NULL);
307 k_sigaction(SIGCONT, &sa, NULL);
309 sa.sa_handler = set_create_procs;
312 k_sigaction(SIGALRM, &sa, NULL);
314 sa.sa_handler = NULL
491 struct sigaction sa; local
[all...] |
| /external/compiler-rt/lib/builtins/ |
| mulodi4.c | 41 di_int sa = a >> (N - 1); local
42 di_int abs_a = (a ^ sa) - sa;
47 if (sa == sb)
|
| mulosi4.c | 41 si_int sa = a >> (N - 1); local
42 si_int abs_a = (a ^ sa) - sa;
47 if (sa == sb)
|
| muloti4.c | 43 ti_int sa = a >> (N - 1); local
44 ti_int abs_a = (a ^ sa) - sa;
49 if (sa == sb)
|
| mulvdi3.c | 39 di_int sa = a >> (N - 1); local
40 di_int abs_a = (a ^ sa) - sa;
45 if (sa == sb)
|
| mulvsi3.c | 39 si_int sa = a >> (N - 1); local
40 si_int abs_a = (a ^ sa) - sa;
45 if (sa == sb)
|
| mulvti3.c | 41 ti_int sa = a >> (N - 1); local
42 ti_int abs_a = (a ^ sa) - sa;
47 if (sa == sb)
|
| /external/curl/lib/ |
| sockaddr.h | 29 struct sockaddr sa; member in union:Curl_sockaddr_storage::__anon17368
|
| /external/curl/tests/server/ |
| server_sockaddr.h | 31 struct sockaddr sa; member in union:__anon17432
|
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.adjacent.find/ |
| adjacent_find.pass.cpp | 37 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local
39 forward_iterator<const int*>(ia + sa)) ==
45 forward_iterator<const int*>(ia + sa)) ==
46 forward_iterator<const int*>(ia+sa));
|
| adjacent_find_pred.pass.cpp | 41 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local
43 forward_iterator<const int*>(ia + sa),
51 forward_iterator<const int*>(ia + sa),
53 forward_iterator<const int*>(ia+sa));
|
