/external/strace/tests/ |
H A D | rt_sigaction.c | 41 struct sigaction sa, sa0; local 43 sa.sa_handler = SIG_IGN; 44 sigemptyset(&sa.sa_mask); 45 sigaddset(&sa.sa_mask, SIGHUP); 46 sigaddset(&sa.sa_mask, SIGINT); 47 sa.sa_flags = SA_RESTART; 48 assert(!sigaction(SIGUSR2, &sa, &sa0)); 50 sa.sa_handler = handle_signal; 51 sigemptyset(&sa.sa_mask); 52 sigaddset(&sa [all...] |
/external/strace/tests-m32/ |
H A D | rt_sigaction.c | 41 struct sigaction sa, sa0; local 43 sa.sa_handler = SIG_IGN; 44 sigemptyset(&sa.sa_mask); 45 sigaddset(&sa.sa_mask, SIGHUP); 46 sigaddset(&sa.sa_mask, SIGINT); 47 sa.sa_flags = SA_RESTART; 48 assert(!sigaction(SIGUSR2, &sa, &sa0)); 50 sa.sa_handler = handle_signal; 51 sigemptyset(&sa.sa_mask); 52 sigaddset(&sa [all...] |
/external/strace/tests-mx32/ |
H A D | rt_sigaction.c | 41 struct sigaction sa, sa0; local 43 sa.sa_handler = SIG_IGN; 44 sigemptyset(&sa.sa_mask); 45 sigaddset(&sa.sa_mask, SIGHUP); 46 sigaddset(&sa.sa_mask, SIGINT); 47 sa.sa_flags = SA_RESTART; 48 assert(!sigaction(SIGUSR2, &sa, &sa0)); 50 sa.sa_handler = handle_signal; 51 sigemptyset(&sa.sa_mask); 52 sigaddset(&sa [all...] |
/external/valgrind/none/tests/s390x/ |
H A D | op_exception.c | 17 struct sigaction sa; local 19 memset(&sa, 0, sizeof(sa)); 20 sa.sa_handler = handle_ill; 21 sigaction(SIGILL, &sa, NULL);
|
/external/libcxx/test/std/algorithms/alg.sorting/alg.sort/is.sorted/ |
H A D | is_sorted_until.pass.cpp | 28 unsigned sa = sizeof(a) / sizeof(a[0]); local 30 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); 35 unsigned sa = sizeof(a) / sizeof(a[0]); local 36 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); 40 unsigned sa = sizeof(a) / sizeof(a[0]); local 41 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); 45 unsigned sa local 50 unsigned sa = sizeof(a) / sizeof(a[0]); local 56 unsigned sa = sizeof(a) / sizeof(a[0]); local 61 unsigned sa = sizeof(a) / sizeof(a[0]); local 66 unsigned sa = sizeof(a) / sizeof(a[0]); local 71 unsigned sa = sizeof(a) / sizeof(a[0]); local 76 unsigned sa = sizeof(a) / sizeof(a[0]); local 81 unsigned sa = sizeof(a) / sizeof(a[0]); local 86 unsigned sa = sizeof(a) / sizeof(a[0]); local 91 unsigned sa = sizeof(a) / sizeof(a[0]); local 97 unsigned sa = sizeof(a) / sizeof(a[0]); local 102 unsigned sa = sizeof(a) / sizeof(a[0]); local 107 unsigned sa = sizeof(a) / sizeof(a[0]); local 112 unsigned sa = sizeof(a) / sizeof(a[0]); local 117 unsigned sa = sizeof(a) / sizeof(a[0]); local 122 unsigned sa = sizeof(a) / sizeof(a[0]); local 127 unsigned sa = sizeof(a) / sizeof(a[0]); local 132 unsigned sa = sizeof(a) / sizeof(a[0]); local 137 unsigned sa = sizeof(a) / sizeof(a[0]); local 142 unsigned sa = sizeof(a) / sizeof(a[0]); local 147 unsigned sa = sizeof(a) / sizeof(a[0]); local 152 unsigned sa = sizeof(a) / sizeof(a[0]); local 157 unsigned sa = sizeof(a) / sizeof(a[0]); local 162 unsigned sa = sizeof(a) / sizeof(a[0]); local 167 unsigned sa = sizeof(a) / sizeof(a[0]); local 172 unsigned sa = sizeof(a) / sizeof(a[0]); local [all...] |
H A D | is_sorted_until_comp.pass.cpp | 29 unsigned sa = sizeof(a) / sizeof(a[0]); local 31 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); 36 unsigned sa = sizeof(a) / sizeof(a[0]); local 37 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); 41 unsigned sa = sizeof(a) / sizeof(a[0]); local 42 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+1)); 46 unsigned sa = sizeof(a) / sizeof(a[0]); local 47 assert(std::is_sorted_until(Iter(a), Iter(a+sa), st 51 unsigned sa = sizeof(a) / sizeof(a[0]); local 57 unsigned sa = sizeof(a) / sizeof(a[0]); local 62 unsigned sa = sizeof(a) / sizeof(a[0]); local 67 unsigned sa = sizeof(a) / sizeof(a[0]); local 72 unsigned sa = sizeof(a) / sizeof(a[0]); local 77 unsigned sa = sizeof(a) / sizeof(a[0]); local 82 unsigned sa = sizeof(a) / sizeof(a[0]); local 87 unsigned sa = sizeof(a) / sizeof(a[0]); local 92 unsigned sa = sizeof(a) / sizeof(a[0]); local 98 unsigned sa = sizeof(a) / sizeof(a[0]); local 103 unsigned sa = sizeof(a) / sizeof(a[0]); local 108 unsigned sa = sizeof(a) / sizeof(a[0]); local 113 unsigned sa = sizeof(a) / sizeof(a[0]); local 118 unsigned sa = sizeof(a) / sizeof(a[0]); local 123 unsigned sa = sizeof(a) / sizeof(a[0]); local 128 unsigned sa = sizeof(a) / sizeof(a[0]); local 133 unsigned sa = sizeof(a) / sizeof(a[0]); local 138 unsigned sa = sizeof(a) / sizeof(a[0]); local 143 unsigned sa = sizeof(a) / sizeof(a[0]); local 148 unsigned sa = sizeof(a) / sizeof(a[0]); local 153 unsigned sa = sizeof(a) / sizeof(a[0]); local 158 unsigned sa = sizeof(a) / sizeof(a[0]); local 163 unsigned sa = sizeof(a) / sizeof(a[0]); local 168 unsigned sa = sizeof(a) / sizeof(a[0]); local 173 unsigned sa = sizeof(a) / sizeof(a[0]); local [all...] |
H A D | is_sorted.pass.cpp | 28 unsigned sa = sizeof(a) / sizeof(a[0]); local 30 assert(std::is_sorted(Iter(a), Iter(a+sa))); 35 unsigned sa = sizeof(a) / sizeof(a[0]); local 36 assert(std::is_sorted(Iter(a), Iter(a+sa))); 40 unsigned sa = sizeof(a) / sizeof(a[0]); local 41 assert(std::is_sorted(Iter(a), Iter(a+sa))); 45 unsigned sa = sizeof(a) / sizeof(a[0]); local 46 assert(!std::is_sorted(Iter(a), Iter(a+sa))); 50 unsigned sa = sizeof(a) / sizeof(a[0]); local 51 assert(std::is_sorted(Iter(a), Iter(a+sa))); 56 unsigned sa = sizeof(a) / sizeof(a[0]); local 61 unsigned sa = sizeof(a) / sizeof(a[0]); local 66 unsigned sa = sizeof(a) / sizeof(a[0]); local 71 unsigned sa = sizeof(a) / sizeof(a[0]); local 76 unsigned sa = sizeof(a) / sizeof(a[0]); local 81 unsigned sa = sizeof(a) / sizeof(a[0]); local 86 unsigned sa = sizeof(a) / sizeof(a[0]); local 91 unsigned sa = sizeof(a) / sizeof(a[0]); local 97 unsigned sa = sizeof(a) / sizeof(a[0]); local 102 unsigned sa = sizeof(a) / sizeof(a[0]); local 107 unsigned sa = sizeof(a) / sizeof(a[0]); local 112 unsigned sa = sizeof(a) / sizeof(a[0]); local 117 unsigned sa = sizeof(a) / sizeof(a[0]); local 122 unsigned sa = sizeof(a) / sizeof(a[0]); local 127 unsigned sa = sizeof(a) / sizeof(a[0]); local 132 unsigned sa = sizeof(a) / sizeof(a[0]); local 137 unsigned sa = sizeof(a) / sizeof(a[0]); local 142 unsigned sa = sizeof(a) / sizeof(a[0]); local 147 unsigned sa = sizeof(a) / sizeof(a[0]); local 152 unsigned sa = sizeof(a) / sizeof(a[0]); local 157 unsigned sa = sizeof(a) / sizeof(a[0]); local 162 unsigned sa = sizeof(a) / sizeof(a[0]); local 167 unsigned sa = sizeof(a) / sizeof(a[0]); local 172 unsigned sa = sizeof(a) / sizeof(a[0]); local [all...] |
H A D | is_sorted_comp.pass.cpp | 29 unsigned sa = sizeof(a) / sizeof(a[0]); local 31 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); 36 unsigned sa = sizeof(a) / sizeof(a[0]); local 37 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); 41 unsigned sa = sizeof(a) / sizeof(a[0]); local 42 assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); 46 unsigned sa = sizeof(a) / sizeof(a[0]); local 47 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); 51 unsigned sa = sizeof(a) / sizeof(a[0]); local 52 assert(std::is_sorted(Iter(a), Iter(a+sa), st 57 unsigned sa = sizeof(a) / sizeof(a[0]); local 62 unsigned sa = sizeof(a) / sizeof(a[0]); local 67 unsigned sa = sizeof(a) / sizeof(a[0]); local 72 unsigned sa = sizeof(a) / sizeof(a[0]); local 77 unsigned sa = sizeof(a) / sizeof(a[0]); local 82 unsigned sa = sizeof(a) / sizeof(a[0]); local 87 unsigned sa = sizeof(a) / sizeof(a[0]); local 92 unsigned sa = sizeof(a) / sizeof(a[0]); local 98 unsigned sa = sizeof(a) / sizeof(a[0]); local 103 unsigned sa = sizeof(a) / sizeof(a[0]); local 108 unsigned sa = sizeof(a) / sizeof(a[0]); local 113 unsigned sa = sizeof(a) / sizeof(a[0]); local 118 unsigned sa = sizeof(a) / sizeof(a[0]); local 123 unsigned sa = sizeof(a) / sizeof(a[0]); local 128 unsigned sa = sizeof(a) / sizeof(a[0]); local 133 unsigned sa = sizeof(a) / sizeof(a[0]); local 138 unsigned sa = sizeof(a) / sizeof(a[0]); local 143 unsigned sa = sizeof(a) / sizeof(a[0]); local 148 unsigned sa = sizeof(a) / sizeof(a[0]); local 153 unsigned sa = sizeof(a) / sizeof(a[0]); local 158 unsigned sa = sizeof(a) / sizeof(a[0]); local 163 unsigned sa = sizeof(a) / sizeof(a[0]); local 168 unsigned sa = sizeof(a) / sizeof(a[0]); local 173 unsigned sa = sizeof(a) / sizeof(a[0]); local [all...] |
/external/libcxx/test/std/algorithms/alg.nonmodifying/alg.is_permutation/ |
H A D | is_permutation.pass.cpp | 29 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 40 forward_iterator<const int*>(ia + sa), 44 forward_iterator<const int*>(ia + sa), 46 forward_iterator<const int*>(ib + sa)) == true); 48 forward_iterator<const int*>(ia + sa), 50 forward_iterator<const int*>(ib + sa - 1)) == false); 56 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 58 forward_iterator<const int*>(ia + sa), 62 forward_iterator<const int*>(ia + sa), 64 forward_iterator<const int*>(ib + sa)) 71 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 89 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 103 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 117 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 131 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 145 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 163 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 177 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 191 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 205 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 219 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 233 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 247 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 261 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 275 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 289 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 304 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 318 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 332 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 346 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 360 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 374 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 388 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 402 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 416 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 430 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 448 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 462 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 480 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 498 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 516 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 534 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 548 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 570 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 592 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local [all...] |
/external/libcxx/test/std/algorithms/alg.modifying.operations/alg.random.shuffle/ |
H A D | random_shuffle.pass.cpp | 27 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 28 std::random_shuffle(ia, ia+sa); 29 LIBCPP_ASSERT(std::equal(ia, ia+sa, ia1)); 30 assert(std::is_permutation(ia, ia+sa, ia1)); 31 std::random_shuffle(ia, ia+sa); 32 LIBCPP_ASSERT(std::equal(ia, ia+sa, ia2)); 33 assert(std::is_permutation(ia, ia+sa, ia2));
|
H A D | random_shuffle_urng.pass.cpp | 27 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 29 std::shuffle(ia, ia+sa, g); 30 LIBCPP_ASSERT(std::equal(ia, ia+sa, ia1)); 31 assert(std::is_permutation(ia, ia+sa, ia1)); 32 std::shuffle(ia, ia+sa, std::move(g)); 33 LIBCPP_ASSERT(std::equal(ia, ia+sa, ia2)); 34 assert(std::is_permutation(ia, ia+sa, ia2));
|
H A D | random_shuffle_rand.pass.cpp | 36 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 38 std::random_shuffle(ia, ia+sa, r); 39 LIBCPP_ASSERT(std::equal(ia, ia+sa, ia1)); 40 assert(std::is_permutation(ia, ia+sa, ia1));
|
/external/linux-kselftest/tools/testing/selftests/x86/ |
H A D | vdso_restorer.c | 55 struct real_sigaction sa; local 57 memset(&sa, 0, sizeof(sa)); 58 sa.handler = handler_with_siginfo; 59 sa.flags = SA_SIGINFO; 60 sa.restorer = NULL; /* request kernel-provided restorer */ 62 if (syscall(SYS_rt_sigaction, SIGUSR1, &sa, NULL, 8) != 0) 74 sa.flags = 0; 75 sa.handler = handler_without_siginfo; 76 if (syscall(SYS_sigaction, SIGUSR1, &sa, [all...] |
/external/valgrind/none/tests/ |
H A D | bug234814.c | 19 struct sigaction sa; local 20 sa.sa_handler = mysigbus; 21 sigemptyset(&sa.sa_mask); 22 sa.sa_flags = 0; 23 if (sigaction(SIGBUS, &sa, NULL) == -1) {
|
/external/valgrind/none/tests/x86/ |
H A D | badseg.c | 14 struct sigaction sa; local 17 sa.sa_sigaction = handler; 18 sigfillset(&sa.sa_mask); 19 sa.sa_flags = SA_SIGINFO; 21 sigaction(SIGSEGV, &sa, NULL);
|
/external/svox/pico/lib/ |
H A D | picosa.c | 61 * shortcut : sa 246 sa_subobj_t * sa; local 259 sa = (sa_subobj_t *) this->subObj; 261 /* sa->common = this->common; */ 263 sa->procState = SA_STEPSTATE_COLLECT; 265 sa->inspaceok = TRUE; 266 sa->needsmoreitems = TRUE; 268 sa->headxBottom = 0; 269 sa->headxLen = 0; 270 sa 433 sa_subobj_t * sa; local 449 sa_subobj_t * sa; local 489 saPosDItemSeqGetPosRight(register picodata_ProcessingUnit this, register sa_subobj_t *sa, const picoos_uint16 ind, const picoos_uint16 top, picoos_uint16 *rightind) argument 511 saDisambPos(register picodata_ProcessingUnit this, register sa_subobj_t *sa) argument 698 saCopyItemContent1to2(register picodata_ProcessingUnit this, register sa_subobj_t *sa, picoos_uint16 ind) argument 733 saLexIndLookup(register picodata_ProcessingUnit this, register sa_subobj_t *sa, picoklex_Lex lex, picoos_uint16 ind) argument 791 saGetNrVowel(register picodata_ProcessingUnit this, register sa_subobj_t *sa, const picoos_uint8 *sInChar, const picoos_uint16 inLen, const picoos_uint8 inPos, picoos_uint8 *nVow, picoos_uint8 *nVord) argument 829 saDoG2P(register picodata_ProcessingUnit this, register sa_subobj_t *sa, const picoos_uint8 *graph, const picoos_uint8 graphlen, const picoos_uint8 pos, picoos_uint8 *phones, const picoos_uint16 phonesmaxlen, picoos_uint16 *plen) argument 1005 saGraphemeToPhoneme(register picodata_ProcessingUnit this, register sa_subobj_t *sa, picoos_uint16 ind) argument 1044 saAddPhoneme(register sa_subobj_t *sa, picoos_uint16 pos, picoos_uint16 sym) argument 1078 saExtractPhonemes(register picodata_ProcessingUnit this, register sa_subobj_t *sa, picoos_uint16 pos, picodata_itemhead_t* head, const picoos_uint8* content) argument 1126 getNextPosSym(sa_subobj_t * sa, picoos_int16 * pos, picoos_int16 * sym, picoos_int16 rangeEnd) argument 1191 register sa_subobj_t *sa; local [all...] |
/external/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/func.searchers.default.creation/ |
H A D | make_default_searcher.pred.pass.cpp | 49 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 50 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); 51 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa); local 52 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa); 53 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0); 54 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); 55 do_search(Iter1(ia), Iter1(ia+sa), Iter 59 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia), sa*sa); local [all...] |
/external/ltp/testcases/kernel/syscalls/sendto/ |
H A D | sendto02.c | 44 static struct sockaddr_in sa; variable in typeref:struct:sockaddr_in 56 memset(&sa, 0, sizeof(sa)); 57 sa.sin_family = AF_INET; 58 sa.sin_addr.s_addr = inet_addr("127.0.0.1"); 59 sa.sin_port = htons(11111); 70 TEST(sendto(sockfd, NULL, 1, 0, (struct sockaddr *) &sa, sizeof(sa)));
|
/external/libcxx/test/std/algorithms/alg.nonmodifying/alg.adjacent.find/ |
H A D | adjacent_find.pass.cpp | 25 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 27 forward_iterator<const int*>(ia + sa)) == 33 forward_iterator<const int*>(ia + sa)) == 34 forward_iterator<const int*>(ia+sa));
|
/external/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore/ |
H A D | hash.pass.cpp | 58 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 59 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); 60 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa); local 61 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa); 62 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0); 63 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); 64 do_search(Iter1(ia), Iter1(ia+sa), Iter 68 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia), sa*sa); local 92 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 94 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa); local 102 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia), sa*sa); local [all...] |
H A D | hash.pred.pass.cpp | 71 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 72 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); 73 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa); local 74 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa); 75 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0); 76 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); 77 do_search(Iter1(ia), Iter1(ia+sa), Iter 81 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia), sa*sa); local 108 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 110 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa); local 118 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia), sa*sa); local [all...] |
H A D | pred.pass.cpp | 65 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 66 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); 67 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa); local 68 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa); 69 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0); 70 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); 71 do_search(Iter1(ia), Iter1(ia+sa), Iter 75 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia), sa*sa); local 101 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 103 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa); local 111 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.boyer_moore_horspool/ |
H A D | hash.pass.cpp | 57 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 58 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); 59 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa); local 60 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa); 61 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0); 62 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); 63 do_search(Iter1(ia), Iter1(ia+sa), Iter 67 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia), sa*sa); local 91 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 93 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa); local 101 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia), sa*sa); local [all...] |
H A D | hash.pred.pass.cpp | 70 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 71 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); 72 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa); local 73 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa); 74 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0); 75 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); 76 do_search(Iter1(ia), Iter1(ia+sa), Iter 80 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia), sa*sa); local 104 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 106 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa); local 114 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia), sa*sa); local [all...] |
H A D | 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), Iter 74 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia), sa*sa); local 98 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 100 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa); local 108 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia), sa*sa); local [all...] |