/posix/ |
A D | runptests.c | 32 } tests[] = variable 44 for (cnt = 0; cnt < sizeof (tests) / sizeof (tests[0]); ++cnt) in main() 45 if (tests[cnt].str == NULL) in main() 48 (int) strlen (tests[cnt].reg), in main() 51 else if (tests[cnt].reg == NULL) in main() 52 printf ("!!! %s\n", tests[cnt].str); in main() 60 tests[cnt].str); in main() 63 err = regcomp (&re, tests[cnt].reg, tests[cnt].options); in main() 66 if (tests[cnt].start == -2) in main() 78 else if (tests[cnt].start == -2) in main() [all …]
|
A D | bug-regex11.c | 32 } tests[] = { variable 101 for (i = 0; i < sizeof (tests) / sizeof (tests[0]); ++i) in main() 103 n = regcomp (&re, tests[i].pattern, tests[i].flags); in main() 108 printf ("%s: regcomp %zd failed: %s\n", tests[i].pattern, i, buf); in main() 113 if (regexec (&re, tests[i].string, tests[i].nmatch, rm, 0)) in main() 115 printf ("%s: regexec %zd failed\n", tests[i].pattern, i); in main() 121 for (n = 0; n < tests[i].nmatch; ++n) in main() 122 if (rm[n].rm_so != tests[i].rm[n].rm_so in main() 123 || rm[n].rm_eo != tests[i].rm[n].rm_eo) in main() 125 if (tests[i].rm[n].rm_so == -1 && tests[i].rm[n].rm_eo == -1) in main() [all …]
|
A D | bug-regex28.c | 26 struct tests struct 33 static const struct tests tests[] = { variable 48 static const size_t tests_size = sizeof (tests) / sizeof (tests[0]); 57 re_set_syntax (tests[i].syntax); in do_test() 59 const char *re = re_compile_pattern (tests[i].regex, in do_test() 60 strlen (tests[i].regex), &r); in do_test() 65 size_t len = strlen (tests[i].string); in do_test() 66 int rv = re_search (&r, tests[i].string, len, 0, len, NULL); in do_test() 67 TEST_VERIFY (rv == tests[i].retval); in do_test() 69 printf ("info: i=%zu rv=%d expected=%d\n", i, rv, tests[i].retval); in do_test()
|
A D | bug-regex17.c | 33 } tests[] = { variable 69 for (i = 0; i < sizeof (tests) / sizeof (tests[0]); ++i) in do_test() 71 n = regcomp (&re, tests[i].pattern, tests[i].flags); in do_test() 81 if (regexec (&re, tests[i].string, tests[i].nmatch, rm, 0)) in do_test() 89 for (n = 0; n < tests[i].nmatch; ++n) in do_test() 90 if (rm[n].rm_so != tests[i].rm[n].rm_so in do_test() 91 || rm[n].rm_eo != tests[i].rm[n].rm_eo) in do_test() 93 if (tests[i].rm[n].rm_so == -1 && tests[i].rm[n].rm_eo == -1) in do_test()
|
A D | bug-regex18.c | 33 } tests[] = { variable 62 for (i = 0; i < sizeof (tests) / sizeof (tests[0]); ++i) in main() 64 n = regcomp (&re, tests[i].pattern, tests[i].flags); in main() 74 if (regexec (&re, tests[i].string, tests[i].nmatch, rm, 0)) in main() 82 for (n = 0; n < tests[i].nmatch; ++n) in main() 83 if (rm[n].rm_so != tests[i].rm[n].rm_so in main() 84 || rm[n].rm_eo != tests[i].rm[n].rm_eo) in main() 86 if (tests[i].rm[n].rm_so == -1 && tests[i].rm[n].rm_eo == -1) in main()
|
A D | bug-regex30.c | 33 } tests[] = { variable 60 for (size_t i = 0; i < sizeof (tests) / sizeof (tests[0]); ++i) in do_test() 64 int n = regcomp (&re, tests[i].pattern, tests[i].flags); in do_test() 74 if (regexec (&re, tests[i].string, tests[i].nmatch, rm, 0)) in do_test() 82 for (n = 0; n < tests[i].nmatch; ++n) in do_test() 83 if (rm[n].rm_so != tests[i].rm[n].rm_so in do_test() 84 || rm[n].rm_eo != tests[i].rm[n].rm_eo) in do_test() 86 if (tests[i].rm[n].rm_so == -1 && tests[i].rm[n].rm_eo == -1) in do_test()
|
A D | bug-regex27.c | 23 struct tests struct 29 } tests[] = { argument 43 for (i = 0; i < sizeof (tests) / sizeof (tests[i]); ++i) in main() 46 if (regcomp (&r, tests[i].regex, tests[i].cflags)) in main() 52 int rv = regexec (&r, tests[i].string, 0, NULL, 0); in main() 53 if (rv != tests[i].retval) in main() 56 i, rv, tests[i].retval); in main()
|
A D | bug-regex20.c | 39 } tests[] = { variable 198 for (i = 0; i < sizeof (tests) / sizeof (tests[0]); ++i) in main() 202 re_set_syntax (tests[i].syntax); in main() 204 err = re_compile_pattern (tests[i].pattern, strlen (tests[i].pattern), in main() 215 if (optimized != tests[i].optimize) in main() 222 int str_len = strlen (tests[i].string); in main() 224 if (res != tests[i].res) in main() 234 if (res != tests[i].res) in main() 245 err = re_compile_pattern (tests[i].pattern, strlen (tests[i].pattern), in main() 264 if (res != tests[i].res) in main() [all …]
|
A D | bug-regex13.c | 32 } tests[] = { variable 74 for (i = 0; i < sizeof (tests) / sizeof (tests[0]); ++i) in main() 77 re_set_syntax (tests[i].syntax); in main() 79 err = re_compile_pattern (tests[i].pattern, strlen (tests[i].pattern), in main() 88 start = re_search (®buf, tests[i].string, strlen (tests[i].string), in main() 89 0, strlen (tests[i].string), NULL); in main() 90 if (start != tests[i].start) in main()
|
A D | bug-regex12.c | 31 } tests[] = { variable 48 for (i = 0; i < sizeof (tests) / sizeof (tests[0]); ++i) in main() 50 n = regcomp (&re, tests[i].pattern, tests[i].flags); in main() 60 if (! regexec (&re, tests[i].string, tests[i].nmatch, in main() 61 tests[i].nmatch ? rm : NULL, 0)) in main()
|
A D | testfnm.c | 10 } tests[] = { variable 68 for (i = 0; i < sizeof (tests) / sizeof (*tests); i++) in main() 72 match = fnmatch (tests[i].pattern, tests[i].name, tests[i].flags); in main() 74 printf ("[%2zd] %s %s %s -> %s\n", i, tests[i].pattern, in main() 76 tests[i].name, in main() 77 match != tests[i].expected ? "FAIL" : "OK"); in main() 79 if (match != tests[i].expected) in main()
|
A D | Makefile | 115 tests += tst-glob_lstat_compat 121 tests += tst-spawn4-compat 126 tests-container := bug-ga2 tst-vfork3 135 tests += tst-getopt-cancel tst-_Fork 138 tests += $(tests-static) 160 ifeq ($(run-built-tests),yes) 168 tests-special += $(objpfx)annexc.out 169 ifeq ($(run-built-tests),yes) 181 ifeq ($(run-built-tests),yes) 298 tst-pcre-ARGS = PCRE.tests [all …]
|
A D | bug-regex19.c | 38 } tests[] = { variable 418 for (i = 0; i < sizeof (tests) / sizeof (tests[0]); ++i) in do_test() 421 ret |= do_one_test (&tests[i], ""); in do_test() 423 ret |= do_one_test (&tests[i], "UTF-8 "); in do_test() 424 ret |= do_mb_tests (&tests[i]); in do_test() 426 ret |= do_one_test (&tests[i], "UTF-8 "); in do_test() 427 ret |= do_mb_tests (&tests[i]); in do_test()
|
A D | wordexp-test.c | 220 static int tests; variable 375 printf ("info: test %d (%s): ", ++tests, tc->words); in testit()
|
A D | tst-regex.input | 392 * Rules (tests): Fix last change. 521 * Rules (tests): Depend on tests-static only if build-static == yes. 706 * posix/globtest.sh: More tests. 3532 (tests): Add do-gencat-test. 4174 (tests): Set to iconv-test. 4183 * Make-dist (+tsrcs): Also use tests-statc where tests is used. 4663 * iconvdata/TESTS: Name new tests. 6758 tests-static. 7859 New tests for rpmatch function by 7886 (comma). Added more tests. [all …]
|
A D | tst-fnmatch.input | 24 # any specific tests. I.e., the tests below are in no case sufficient. 431 # Some home-grown tests. 822 # Some home-grown tests. 866 # Following are tests outside the scope of IEEE 2003.2 since they are using 867 # locales other than the C locale. The main focus of the tests is on the 1086 # Duplicate the "Test of GNU extensions." tests but for C.UTF-8.
|
A D | PTESTS | 243 #W These two tests have the same problem as the test in GA135. No match
|
A D | BOOST.tests | 3 ; this file contains a script of tests to run through regress.exe
|
/posix/rxspencer/ |
A D | tests | 183 # The following two tests are not correct: 191 # Same reason as for the two tests above: 206 # These four tests checks for undefined behavior. Our implementation does 216 # These two tests probably fails due to an arbitrary limit on the number of 249 # use the four tests.
|