Searched refs:sa (Results 26 - 50 of 577) sorted by relevance

1234567891011>>

/external/chromium_org/native_client_sdk/src/libraries/nacl_io/syscalls/socket/
H A Dgetnameinfo.c11 int getnameinfo(const struct sockaddr* sa, socklen_t salen, char* host, argument
14 int getnameinfo(const struct sockaddr* sa, socklen_t salen, char* host,
18 return ki_getnameinfo(sa, salen, host, hostlen, serv, servlen, flags);
/external/clang/test/Index/
H A Dcomplete-hiding.c16 struct StructA sa = { }; local
/external/clang/test/SemaCXX/
H A Dprimary-base.cpp12 int sa[sizeof(F) == sizeof(A) ? 1 : -1]; variable
/external/libcxx/test/algorithms/alg.nonmodifying/alg.adjacent.find/
H A Dadjacent_find_pred.pass.cpp26 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local
28 forward_iterator<const int*>(ia + sa),
36 forward_iterator<const int*>(ia + sa),
38 forward_iterator<const int*>(ia+sa));
/external/libcxx/test/algorithms/alg.nonmodifying/alg.all_of/
H A Dall_of.pass.cpp33 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local
35 input_iterator<const int*>(ia + sa), test1()) == true);
41 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local
43 input_iterator<const int*>(ia + sa), test1()) == false);
/external/valgrind/main/exp-sgcheck/tests/
H A Dstackerr.c23 __attribute__((noinline)) void foo ( long* sa, int n ) argument
27 sa[i] = 0;
30 __attribute__((noinline)) void bar ( long* sa, int n ) argument
32 foo(sa, n);
/external/valgrind/main/gdbserver_tests/
H A Dpasssigalrm.c26 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/main/none/tests/x86-linux/
H A Dsigcontext.c45 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);
/external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/nouveau/
H A Dnv04_state_tex.c71 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
[all...]
/external/mesa3d/src/mesa/drivers/dri/nouveau/
H A Dnv04_state_tex.c71 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
[all...]
/external/libcxx/test/algorithms/alg.nonmodifying/alg.search/
H A Dsearch.pass.cpp27 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))
[all...]
H A Dsearch_pred.pass.cpp37 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), Iter
[all...]
/external/chromium_org/components/nacl/loader/nonsfi/
H A Dirt_exception_handling.cc89 struct sigaction sa; local
92 memset(&sa, 0, sizeof(sa));
93 sigemptyset(&sa.sa_mask);
94 sa.sa_sigaction = SignalCatch;
95 sa.sa_flags = SA_ONSTACK | SA_SIGINFO;
99 sigaddset(&sa.sa_mask, kSignals[a]);
104 if (sigaction(kSignals[a], &sa, NULL) != 0)
/external/libcxx/test/algorithms/alg.nonmodifying/mismatch/
H A Dmismatch_pred.pass.cpp32 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local
35 input_iterator<const int*>(ia + sa),
44 input_iterator<const int*>(ia + sa),
46 input_iterator<const int*>(ib + sa),
54 assert(std::mismatch(ia, ia + sa, ib, std::equal_to<int>()) ==
57 assert(std::mismatch(ia, ia + sa, ib, ib + sa, std::equal_to<int>()) ==
59 assert(std::mismatch(ia, ia + sa, ib, ib + 2, std::equal_to<int>()) ==
H A Dmismatch.pass.cpp29 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local
32 input_iterator<const int*>(ia + sa),
41 input_iterator<const int*>(ia + sa),
43 input_iterator<const int*>(ib + sa)) ==
50 input_iterator<const int*>(ia + sa),
/external/lldb/test/python_api/default-constructor/
H A Dsb_function.py12 sa = obj.GetStartAddress()
16 sb_address.fuzz_obj(sa)
/external/valgrind/main/memcheck/tests/
H A Dsendmsg.c14 struct sockaddr_in sa; local
25 sa.sin_family = AF_INET;
26 sa.sin_addr.s_addr = htonl (INADDR_LOOPBACK);
27 sa.sin_port = htons (PORT);
28 if (connect (fd, (struct sockaddr *) &sa, sizeof (sa)) == -1)
58 if (connect (fd, (struct sockaddr *) &sa, sizeof (sa)) == -1)
/external/valgrind/main/memcheck/tests/amd64-linux/
H A Dint3-amd64.c23 struct sigaction sa; local
24 sa.sa_flags = SA_RESTART | SA_SIGINFO;
25 sigfillset(&sa.sa_mask);
26 sa.sa_sigaction = handler;
27 sigaction(sig, &sa, NULL);
/external/valgrind/main/memcheck/tests/x86-linux/
H A Dint3-x86.c23 struct sigaction sa; local
24 sa.sa_flags = SA_RESTART | SA_SIGINFO;
25 sigfillset(&sa.sa_mask);
26 sa.sa_sigaction = handler;
27 sigaction(sig, &sa, NULL);
/external/valgrind/main/none/tests/
H A Dsyscall-restart1.c35 struct sigaction sa; local
37 sa.sa_handler = handler;
38 sigfillset(&sa.sa_mask);
39 sa.sa_flags = 0; /* no SA_RESTART */
41 sigaction(SIGUSR1, &sa, NULL);
H A Dsyscall-restart2.c35 struct sigaction sa; local
37 sa.sa_handler = handler;
38 sigfillset(&sa.sa_mask);
39 sa.sa_flags = SA_RESTART;
41 sigaction(SIGUSR1, &sa, NULL);
/external/libcxx/test/algorithms/alg.nonmodifying/alg.find.end/
H A Dfind_end_pred.pass.cpp38 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local
41 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b+1), count_equal()) == Iter1(ia+sa-1));
42 assert(count_equal::count <= 1*(sa-1+1));
45 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(c), Iter2(c+2), count_equal()) == Iter1(ia+18));
46 assert(count_equal::count <= 2*(sa-2+1));
49 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(d), Iter2(d+3), count_equal()) == Iter1(ia+15));
50 assert(count_equal::count <= 3*(sa-3+1));
53 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(e), Iter2(e+4), count_equal()) == Iter1(ia+11));
54 assert(count_equal::count <= 4*(sa
[all...]
/external/libcxx/test/algorithms/alg.modifying.operations/alg.remove/
H A Dremove.pass.cpp31 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local
32 Iter r = std::remove(Iter(ia), Iter(ia+sa), 2);
33 assert(base(r) == ia + sa-3);
48 const unsigned sa = 9; local
49 std::unique_ptr<int> ia[sa];
56 Iter r = std::remove(Iter(ia), Iter(ia+sa), std::unique_ptr<int>());
57 assert(base(r) == ia + sa-3);
H A Dremove_if.pass.cpp32 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local
33 int* r = std::remove_if(ia, ia+sa, std::bind2nd(std::equal_to<int>(), 2));
34 assert(r == ia + sa-3);
54 const unsigned sa = 9; local
55 std::unique_ptr<int> ia[sa];
65 Iter r = std::remove_if(Iter(ia), Iter(ia+sa), pred());
66 assert(base(r) == ia + sa-3);
/external/libcxx/test/algorithms/alg.sorting/alg.lex.comparison/
H A Dlexicographical_compare.pass.cpp28 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local
30 assert(!std::lexicographical_compare(ia, ia+sa, ib, ib+2));
31 assert(std::lexicographical_compare(ib, ib+2, ia, ia+sa));
32 assert(!std::lexicographical_compare(ia, ia+sa, ib, ib+3));
33 assert(std::lexicographical_compare(ib, ib+3, ia, ia+sa));
34 assert(std::lexicographical_compare(ia, ia+sa, ib+1, ib+3));
35 assert(!std::lexicographical_compare(ib+1, ib+3, ia, ia+sa));

Completed in 2119 milliseconds

1234567891011>>