| /external/ltp/testcases/open_posix_testsuite/conformance/interfaces/sigaction/ |
| 18-6.c | 56 struct sigaction sa; local
59 sa.sa_flags = 0;
60 sa.sa_handler = handler;
61 ret = sigemptyset(&sa.sa_mask);
69 ret = sigaction(SIGFPE, &sa, 0);
|
| 18-7.c | 56 struct sigaction sa; local
59 sa.sa_flags = 0;
60 sa.sa_handler = handler;
61 ret = sigemptyset(&sa.sa_mask);
69 ret = sigaction(SIGHUP, &sa, 0);
|
| 18-8.c | 56 struct sigaction sa; local
59 sa.sa_flags = 0;
60 sa.sa_handler = handler;
61 ret = sigemptyset(&sa.sa_mask);
69 ret = sigaction(SIGILL, &sa, 0);
|
| 18-9.c | 56 struct sigaction sa; local
59 sa.sa_flags = 0;
60 sa.sa_handler = handler;
61 ret = sigemptyset(&sa.sa_mask);
69 ret = sigaction(SIGINT, &sa, 0);
|
| 30-1.c | 95 struct sigaction sa; local
101 sa.sa_flags = 0;
103 sa.sa_handler = handler;
105 ret = sigemptyset(&sa.sa_mask);
116 ret = sigaction(SIG_INVALID, &sa, 0);
135 ret = sigaction(SIGKILL, &sa, 0);
152 ret = sigaction(SIGSTOP, &sa, 0);
164 sa.sa_handler = SIG_IGN;
171 ret = sigaction(SIGKILL, &sa, 0);
188 ret = sigaction(SIGSTOP, &sa, 0)
[all...] |
| /external/valgrind/memcheck/tests/amd64-linux/ |
| int3-amd64.c | 23 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/memcheck/tests/x86-linux/ |
| int3-x86.c | 23 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/none/tests/ |
| syscall-restart1.c | 35 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);
|
| syscall-restart2.c | 35 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/ltp/testcases/kernel/mem/mmapstress/ |
| mmap-corruption01.c | 81 struct sigaction sa; local
108 sa.sa_handler = finish;
109 sa.sa_flags = 0;
110 if (sigemptyset(&sa.sa_mask)) {
115 if (sigaction(SIGINT, &sa, 0) == -1) {
120 if (sigaction(SIGALRM, &sa, 0) == -1) {
128 if (sigaction(SIGALRM, &sa, 0) == -1) {
136 sa.sa_handler = finish;
137 if (sigaction(SIGQUIT, &sa, 0) == -1) {
141 if (sigaction(SIGTERM, &sa, 0) == -1)
[all...] |
| /external/ltp/testcases/open_posix_testsuite/conformance/interfaces/sigaction/templates/ |
| template_18-1.in | 56 struct sigaction sa;
59 sa.sa_flags = 0;
60 sa.sa_handler = handler;
61 ret = sigemptyset(&sa.sa_mask);
69 ret = sigaction(%%MYSIG%%, &sa, 0);
|
| /frameworks/rs/tests/java_api/RSUnitTests/src/com/android/rs/unittest/ |
| array_init.rs | 23 short sa[4] = {1, 1, 2, 3};
45 _RS_ASSERT(sa[0] == 1);
46 _RS_ASSERT(sa[1] == 1);
47 _RS_ASSERT(sa[2] == 2);
48 _RS_ASSERT(sa[3] == 3);
|
| /prebuilts/go/darwin-x86/src/index/suffixarray/ |
| qsufsort.go | 10 // This algorithm computes the suffix array sa by computing its inverse.
11 // Consecutive groups of suffixes in sa are labeled as sorted groups or
13 // up to their first h characters, and sa is h-ordered. Suffixes in their
19 // In the implementation, if sa[i] is negative, it indicates that i is
20 // the first element of a sorted group of length -sa[i], and can be skipped.
21 // An unsorted group sa[i:k] is given the group number of the index of its
31 sa := sortedByFirstByte(data)
32 if len(sa) < 2 {
33 return sa
37 inv := initGroups(sa, data
[all...] |
| /prebuilts/go/linux-x86/src/index/suffixarray/ |
| qsufsort.go | 10 // This algorithm computes the suffix array sa by computing its inverse.
11 // Consecutive groups of suffixes in sa are labeled as sorted groups or
13 // up to their first h characters, and sa is h-ordered. Suffixes in their
19 // In the implementation, if sa[i] is negative, it indicates that i is
20 // the first element of a sorted group of length -sa[i], and can be skipped.
21 // An unsorted group sa[i:k] is given the group number of the index of its
31 sa := sortedByFirstByte(data)
32 if len(sa) < 2 {
33 return sa
37 inv := initGroups(sa, data
[all...] |
| /external/jemalloc/test/unit/ |
| prng.c | 6 uint32_t sa, sb, ra, rb; local
9 sa = 42;
10 ra = prng_lg_range_u32(&sa, 32, atomic);
11 sa = 42;
12 rb = prng_lg_range_u32(&sa, 32, atomic);
21 sa = 42;
22 ra = prng_lg_range_u32(&sa, 32, atomic);
23 rb = prng_lg_range_u32(&sa, 32, atomic);
27 sa = 42;
28 ra = prng_lg_range_u32(&sa, 32, atomic)
43 uint64_t sa, sb, ra, rb; local
80 size_t sa, sb, ra, rb; local
[all...] |
| /external/pdfium/fpdfsdk/ |
| cba_annotiterator.cpp | 85 std::vector<CPDFSDK_Annot*>* sa,
87 CPDFSDK_Annot* pLeftTopAnnot = sa->at(idx);
90 sa->erase(sa->begin() + idx);
94 void CBA_AnnotIterator::AddSelectedToAnnots(std::vector<CPDFSDK_Annot*>* sa,
97 m_Annots.push_back(sa->at(aSelect->at(i)));
100 sa->erase(sa->begin() + aSelect->at(i));
110 std::vector<CPDFSDK_Annot*> sa; local
111 CollectAnnots(&sa);
142 std::vector<CPDFSDK_Annot*> sa; local
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.nonmodifying/alg.find.end/ |
| find_end_pred.pass.cpp | 38 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-4+1))
[all...] |
| /external/linux-kselftest/tools/testing/selftests/x86/ |
| ioperm.c | 28 struct sigaction sa; local
29 memset(&sa, 0, sizeof(sa));
30 sa.sa_sigaction = handler;
31 sa.sa_flags = SA_SIGINFO | flags;
32 sigemptyset(&sa.sa_mask);
33 if (sigaction(sig, &sa, 0))
40 struct sigaction sa; local
41 memset(&sa, 0, sizeof(sa));
[all...] |
| syscall_arg_fault.c | 32 struct sigaction sa; local
33 memset(&sa, 0, sizeof(sa));
34 sa.sa_sigaction = handler;
35 sa.sa_flags = SA_SIGINFO | flags;
36 sigemptyset(&sa.sa_mask);
37 if (sigaction(sig, &sa, 0))
|
| syscall_nt.c | 50 struct sigaction sa; local
51 memset(&sa, 0, sizeof(sa));
52 sa.sa_sigaction = handler;
53 sa.sa_flags = SA_SIGINFO | flags;
54 sigemptyset(&sa.sa_mask);
55 if (sigaction(sig, &sa, 0))
|
| /external/testng/src/test/java/test/assertion/ |
| SoftAssertTest.java | 17 final SoftAssert sa = new SoftAssert() { local
28 sa.assertTrue(true);
29 sa.assertTrue(false);
37 SoftAssert sa = new SoftAssert(); local
38 sa.assertTrue(true);
39 sa.assertTrue(false, message);
41 sa.assertAll();
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.modifying.operations/alg.remove/ |
| remove.pass.cpp | 30 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local
31 Iter r = std::remove(Iter(ia), Iter(ia+sa), 2);
32 assert(base(r) == ia + sa-3);
46 const unsigned sa = 9; local
47 std::unique_ptr<int> ia[sa];
54 Iter r = std::remove(Iter(ia), Iter(ia+sa), std::unique_ptr<int>());
55 assert(base(r) == ia + sa-3);
|
| /external/icu/icu4c/source/common/ |
| ucnv_set.cpp | 52 USetAdder sa={ local
60 sa.set=setFillIn;
66 cnv->sharedData->impl->getUnicodeSet(cnv, &sa, whichSet, pErrorCode);
|
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.count/ |
| count.pass.cpp | 36 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local
38 input_iterator<const int*>(ia + sa), 2) == 3);
40 input_iterator<const int*>(ia + sa), 7) == 0);
|
| /external/mesa3d/src/gallium/auxiliary/util/ |
| u_network.c | 114 struct sockaddr_in sa; local
117 memset(&sa, 0, sizeof(struct sockaddr_in));
122 memcpy((char *)&sa.sin_addr,host->h_addr_list[0],host->h_length);
123 sa.sin_family= host->h_addrtype;
124 sa.sin_port = htons(port);
130 if (connect(s, (struct sockaddr *)&sa, sizeof(sa))) {
147 struct sockaddr_in sa; local
148 memset(&sa, 0, sizeof(struct sockaddr_in));
150 sa.sin_family = AF_INET
[all...] |
