/external/valgrind/gdbserver_tests/ |
passsigalrm.c | 26 struct sigaction sa; local 28 sa.sa_handler = sigalrm_handler; 29 sigemptyset(&sa.sa_mask); 30 sa.sa_flags = 0; 32 if (sigaction (SIGALRM, &sa, NULL) != 0) 55 sa.sa_handler = sigrtmin_handler; 56 sigemptyset(&sa.sa_mask); 57 sa.sa_flags = 0; 59 if (sigaction (SIGRTMIN, &sa, NULL) != 0)
|
/external/valgrind/none/tests/x86-linux/ |
sigcontext.c | 45 struct sigaction sa; local 49 sa.sa_handler = (void*)handler1; 50 sa.sa_flags = SA_SIGINFO; 51 sigfillset(&sa.sa_mask); 53 sigaction(SIGUSR1, &sa, NULL); 55 sa.sa_handler = (void*)handler2; 56 sa.sa_flags = 0; 57 sigfillset(&sa.sa_mask); 59 sigaction(SIGUSR2, &sa, NULL);
|
/test/vts-testcase/security/poc/target/kernel_bluetooth/30149612/ |
poc.cpp | 12 struct sockaddr sa; local 22 memset(&sa, 0, sizeof(sa)); 23 sa.sa_family = AF_BLUETOOTH; 25 if (bind(fd, &sa, 2)) { 31 len = sizeof(sa); 32 if (getsockname(fd, &sa, &len)) { 41 printf("%02x ", ((unsigned char*)&sa)[i]); 46 if (((unsigned char*)&sa)[i] != 0) {
|
/external/autotest/client/tests/ipv6connect/src/ |
ipv6connect.c | 39 struct sockaddr_in6 sa; local 46 memset(&sa, 0, sizeof(sa)); 52 inet_pton(AF_INET6, "::1", &sa.sin6_addr); 54 inet_pton(AF_INET6, "::ffff:127.0.0.1", &sa.sin6_addr); 56 if (!inet_ntop(AF_INET6, &sa.sin6_addr, buf, INET6_ADDRSTRLEN)) { 60 addr_len = sizeof(sa); 61 sa.sin6_family = AF_INET6; 62 sa.sin6_port = port; 63 if (connect(client_fd, (struct sockaddr*)(&sa), 99 struct sockaddr_in6 sa; local 128 struct sockaddr_in6 sa; local 220 struct sockaddr_in6 sa; local 269 struct sockaddr_in6 sa; local [all...] |
/external/mesa3d/src/mesa/drivers/dri/nouveau/ |
nv04_state_tex.c | 71 const struct gl_sampler_object *sa = _mesa_get_samplerobj(ctx, i); local 79 if (sa->MinFilter != GL_NEAREST && 80 sa->MinFilter != GL_LINEAR) { 81 lod_max = CLAMP(MIN2(sa->MaxLod, t->_MaxLambda), 85 sa->LodBias, -16, 15) * 8; 88 format |= nvgl_wrap_mode(sa->WrapT) << 28 | 89 nvgl_wrap_mode(sa->WrapS) << 24 | 95 filter |= log2i(sa->MaxAnisotropy) << 31 | 96 nvgl_filter_mode(sa->MagFilter) << 28 | 97 log2i(sa->MaxAnisotropy) << 27 [all...] |
/external/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/ |
default.pass.cpp | 52 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 53 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia)); 54 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia)); 55 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1)); 56 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia)); 57 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2)); 58 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2)); 60 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1)) [all...] |
default.pred.pass.cpp | 64 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 65 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); 66 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa); local 67 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa); 68 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0); 69 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); 70 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa) 74 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia), sa*sa); local [all...] |
/external/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/func.searchers.default.creation/ |
make_default_searcher.pass.cpp | 37 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 38 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia)); 39 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia)); 40 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1)); 41 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia)); 42 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2)); 43 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2)); 45 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1)) [all...] |
/external/libcxx/test/std/utilities/function.objects/func.search/func.search.default/ |
default.pass.cpp | 52 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 53 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia)); 54 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia)); 55 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1)); 56 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia)); 57 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2)); 58 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2)); 60 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1)) [all...] |
/prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.nonmodifying/alg.search/ |
search.pass.cpp | 27 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 28 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia)) == Iter1(ia)); 29 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1)) == Iter1(ia)); 30 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2)) == Iter1(ia+1)); 31 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2)) == Iter1(ia)); 32 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3)) == Iter1(ia+2)); 33 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3)) == Iter1(ia+2)); 35 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa)) == Iter1(ia+sa-1)) [all...] |
search_pred.pass.cpp | 37 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 39 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), count_equal()) == Iter1(ia)); 42 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), count_equal()) == Iter1(ia)); 43 assert(count_equal::count <= sa); 45 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), count_equal()) == Iter1(ia+1)); 46 assert(count_equal::count <= sa); 48 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), count_equal()) == Iter1(ia)); 51 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), count_equal()) == Iter1(ia+2)); 52 assert(count_equal::count <= sa); 54 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), count_equal()) == Iter1(ia+2)) [all...] |
/prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/experimental/func/func.searchers/func.searchers.default/ |
default.pass.cpp | 52 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 53 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia)); 54 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia)); 55 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1)); 56 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia)); 57 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2)); 58 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2)); 60 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1)) [all...] |
default.pred.pass.cpp | 64 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 65 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); 66 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa); local 67 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa); 68 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0); 69 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); 70 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa) 74 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia), sa*sa); local [all...] |
/prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/experimental/func/func.searchers/func.searchers.default/func.searchers.default.creation/ |
make_default_searcher.pass.cpp | 37 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 38 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia)); 39 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia)); 40 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1)); 41 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia)); 42 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2)); 43 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2)); 45 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1)) [all...] |
/external/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore/ |
default.pass.cpp | 52 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 53 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia)); 54 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia)); 55 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1)); 56 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia)); 57 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2)); 58 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2)); 60 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1)) 91 const unsigned sa = sizeof(ia)\/sizeof(ia[0]); local [all...] |
/external/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore_horspool/ |
default.pass.cpp | 52 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 53 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia)); 54 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia)); 55 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1)); 56 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia)); 57 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2)); 58 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2)); 60 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1)) 91 const unsigned sa = sizeof(ia)\/sizeof(ia[0]); local [all...] |
/external/libcxx/test/std/utilities/function.objects/func.search/func.search.bm/ |
default.pass.cpp | 53 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 54 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia)); 55 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia)); 56 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1)); 57 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia)); 58 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2)); 59 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2)); 61 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1)) 92 const unsigned sa = sizeof(ia)\/sizeof(ia[0]); local [all...] |
/external/libcxx/test/std/utilities/function.objects/func.search/func.search.bmh/ |
default.pass.cpp | 53 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 54 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia)); 55 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia)); 56 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1)); 57 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia)); 58 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2)); 59 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2)); 61 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1)) 92 const unsigned sa = sizeof(ia)\/sizeof(ia[0]); local [all...] |
/prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/experimental/func/func.searchers/func.searchers.boyer_moore/ |
default.pass.cpp | 52 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 53 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia)); 54 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia)); 55 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1)); 56 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia)); 57 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2)); 58 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2)); 60 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1)) 91 const unsigned sa = sizeof(ia)\/sizeof(ia[0]); local [all...] |
/prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/experimental/func/func.searchers/func.searchers.boyer_moore_horspool/ |
default.pass.cpp | 52 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 53 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia)); 54 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia)); 55 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1)); 56 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia)); 57 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2)); 58 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2)); 60 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1)) 91 const unsigned sa = sizeof(ia)\/sizeof(ia[0]); local [all...] |
/external/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/ |
search_pred.pass.cpp | 51 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 53 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), count_equal()) == Iter1(ia)); 56 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), count_equal()) == Iter1(ia)); 57 assert(count_equal::count <= sa); 59 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), count_equal()) == Iter1(ia+1)); 60 assert(count_equal::count <= sa); 62 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), count_equal()) == Iter1(ia)); 65 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), count_equal()) == Iter1(ia+2)); 66 assert(count_equal::count <= sa); 68 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), count_equal()) == Iter1(ia+2)) [all...] |
/external/valgrind/memcheck/tests/ |
sendmsg.c | 15 struct sockaddr_in sa; local 26 sa.sin_family = AF_INET; 27 sa.sin_addr.s_addr = htonl (INADDR_LOOPBACK); 28 sa.sin_port = htons (PORT); 29 if (connect (fd, (struct sockaddr *) &sa, sizeof (sa)) == -1) 59 if (connect (fd, (struct sockaddr *) &sa, sizeof (sa)) == -1)
|
/frameworks/base/libs/hwui/tests/unit/ |
main.cpp | 47 struct sigaction sa = gSigChain[sig]; local 48 sigaction(sig, &sa, nullptr); 59 struct sigaction sa; local 60 memset(&sa, 0, sizeof(sa)); 61 sa.sa_sigaction = >estSigHandler; 62 sa.sa_flags = SA_SIGINFO; 65 sigaction(sig, &sa, &old_sa);
|
/libcore/ojluni/src/main/java/java/net/ |
Proxy.java | 61 private SocketAddress sa; field in class:Proxy 77 sa = null; 89 * @param sa the {@code SocketAddress} for that proxy 93 public Proxy(Type type, SocketAddress sa) { 94 if ((type == Type.DIRECT) || !(sa instanceof InetSocketAddress)) 95 throw new IllegalArgumentException("type " + type + " is not compatible with address " + sa); 97 this.sa = sa; 117 return sa;
|
/prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.modifying.operations/alg.remove/ |
remove_if.pass.cpp | 34 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 35 // int* r = std::remove_if(ia, ia+sa, std::bind2nd(std::equal_to<int>(), 2)); 37 int* r = std::remove_if(ia, ia+sa, std::ref(cp)); 38 assert(r == ia + sa-3); 45 assert(cp.count() == sa); 58 const unsigned sa = 9; local 59 std::unique_ptr<int> ia[sa]; 69 Iter r = std::remove_if(Iter(ia), Iter(ia+sa), pred()); 70 assert(base(r) == ia + sa-3);
|