Home
last modified time | relevance | path

Searched refs:n (Results 1 – 25 of 40) sorted by relevance

12

/posix/
A Dbug-regex17.c66 int n, ret = 0; in do_test() local
71 n = regcomp (&re, tests[i].pattern, tests[i].flags); in do_test()
72 if (n != 0) in do_test()
75 regerror (n, &re, buf, sizeof (buf)); 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()
96 n, rm[n].rm_so, rm[n].rm_eo); in do_test()
A Dbug-regex18.c59 int n, ret = 0; in main() local
64 n = regcomp (&re, tests[i].pattern, tests[i].flags); in main()
65 if (n != 0) in main()
68 regerror (n, &re, buf, sizeof (buf)); 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()
89 n, rm[n].rm_so, rm[n].rm_eo); in main()
A Dbug-regex30.c64 int n = regcomp (&re, tests[i].pattern, tests[i].flags); in do_test() local
65 if (n != 0) in do_test()
68 regerror (n, &re, buf, sizeof (buf)); 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()
89 n, rm[n].rm_so, rm[n].rm_eo); in do_test()
A Dbug-regex11.c97 int n, ret = 0; in main() local
103 n = regcomp (&re, tests[i].pattern, tests[i].flags); in main()
104 if (n != 0) in main()
107 regerror (n, &re, buf, sizeof (buf)); 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()
128 tests[i].pattern, i, n, rm[n].rm_so, rm[n].rm_eo); in main()
A Dbug-regex2.c33 int n; in main() local
37 n = regcomp (&re, "a test", REG_EXTENDED); in main()
38 if (n != 0) in main()
41 regerror (n, &re, buf, sizeof (buf)); in main()
46 for (n = 0; n < 20; ++n) in main()
A Dbug-regex7.c33 int match, n; in main() local
48 n = 1; in main()
54 else if (regs.num_regs <= n || regs.start[n] != -1 || regs.end[n] != -1) in main()
73 n = 4; in main()
79 else if (regs.num_regs <= n || regs.start[n] != -1 || regs.end[n] != -1) in main()
A Dannexc.c567 #define H(n) \ argument
568 { #n ".h", n##_syms, sizeof (n##_syms) / sizeof (n##_syms[0]), \
569 n##_maybe, sizeof (n##_maybe) / sizeof (n##_maybe[0]), NULL }
570 #define Hc(n, s) \ argument
571 { #n ".h", n##_syms, sizeof (n##_syms) / sizeof (n##_syms[0]), \
572 n##_maybe, sizeof (n##_maybe) / sizeof (n##_maybe[0]), s }
573 #define Hs(n) \ argument
574 { "sys/" #n ".h", n##_syms, sizeof (n##_syms) / sizeof (n##_syms[0]), \
575 n##_maybe, sizeof (n##_maybe) / sizeof (n##_maybe[0]), NULL }
669 xstrndup (const char *s, size_t n) in xstrndup() argument
[all …]
A Dbug-regex9.c33 int n; in main() local
37 n = regcomp (&re, "^#! */.*/(k|ba||pdk|z)sh", REG_EXTENDED); in main()
38 if (n != 0) in main()
41 regerror (n, &re, buf, sizeof (buf)); in main()
46 for (n = 0; n < 20; ++n) in main()
A Dfnmatch_loop.c86 if (n == string_end || FOLD ((UCHAR) *n) != c) in FCT()
105 if (n != string_end && *n == L_('.') && no_leading_period) in FCT()
154 if (MEMCHR (n, L_('/'), string_end - n) == NULL) in FCT()
180 for (--p; n < endp; ++n, no_leading_period = false) in FCT()
187 while (n < string_end && *n != L_('/')) in FCT()
189 if (n < string_end && *n == L_('/') in FCT()
202 for (--p; n < endp; ++n, no_leading_period = false) in FCT()
901 if (n == string_end || c != (UCHAR) *n) in FCT()
910 if (n == string_end || c != FOLD ((UCHAR) *n)) in FCT()
915 ++n; in FCT()
[all …]
A Dgroup_member.c31 int n, size; in __group_member() local
38 n = __getgroups (size, groups); in __group_member()
41 while (n == size / 2); in __group_member()
43 while (n-- > 0) in __group_member()
44 if (groups[n] == gid) in __group_member()
A Dbug-regex3.c29 int n; in main() local
31 n = regcomp (&re, "[a-bA-B]", REG_ICASE); in main()
32 if (n != 0) in main()
35 regerror (n, &re, buf, sizeof (buf)); in main()
A Dfnmatch.c218 size_t *n) in fnmatch_convert_to_wide() argument
224 *n = strnlen (str, nw - 1); in fnmatch_convert_to_wide()
225 if (__glibc_likely (*n < nw)) in fnmatch_convert_to_wide()
228 *n = mbsrtowcs (buf->data, &p, *n + 1, &ps); in fnmatch_convert_to_wide()
229 if (__glibc_unlikely (*n == (size_t) -1)) in fnmatch_convert_to_wide()
239 *n = mbsrtowcs (NULL, &str, 0, &ps); in fnmatch_convert_to_wide()
240 if (__glibc_unlikely (*n == (size_t) -1)) in fnmatch_convert_to_wide()
248 mbsrtowcs (buf->data, &str, *n + 1, &ps); in fnmatch_convert_to_wide()
257 size_t n; in fnmatch() local
266 r = fnmatch_convert_to_wide (pattern, &wpattern, &n); in fnmatch()
[all …]
A Dbug-regex31.c17 ssize_t n = getline (&buf, &len, stdin); in main() local
18 if (n <= 0) in main()
20 if (buf[n - 1] == '\n') in main()
21 buf[n - 1] = '\0'; in main()
A Dbug-regex12.c44 int n, ret = 0; in main() local
50 n = regcomp (&re, tests[i].pattern, tests[i].flags); in main()
51 if (n != 0) in main()
54 regerror (n, &re, buf, sizeof (buf)); in main()
A Dregex_internal.h164 # define REGEX_COB128(n) (REGEX_COB64 ((n) >> 31 >> 31 >> 2) + REGEX_COB64 (n)) argument
165 # define REGEX_COB64(n) (REGEX_COB32 ((n) >> 31 >> 1) + REGEX_COB32 (n)) argument
166 # define REGEX_COB32(n) (REGEX_COB16 ((n) >> 16) + REGEX_COB16 (n)) argument
167 # define REGEX_COB16(n) (REGEX_COB8 ((n) >> 8) + REGEX_COB8 (n)) argument
168 # define REGEX_COB8(n) (REGEX_COB4 ((n) >> 4) + REGEX_COB4 (n)) argument
169 # define REGEX_COB4(n) (!!((n) & 8) + !!((n) & 4) + !!((n) & 2) + ((n) & 1)) argument
464 #define re_malloc(t,n) ((t *) malloc ((n) * sizeof (t))) argument
465 #define re_realloc(p,t,n) ((t *) realloc (p, (n) * sizeof (t))) argument
A Dtst-cpucount.c14 int n = CPU_COUNT (&c); in do_test() local
15 if (n != cnt) in do_test()
17 printf ("expected %d, not %d\n", cnt, n); in do_test()
A Dbug-getopt3.c15 one_test (const char *fmt, int argc, char *argv[], int n, int expected[n], in one_test() argument
16 int out[n]) in one_test() argument
21 for (int i = 0; i < n; ++i) in one_test()
A Dtst-wordexp-nocmd.c141 pid_t n = next_pid (); in subprocess() local
143 (int) n, (int) (n - expected_pid)); in subprocess()
144 TEST_VERIFY (n > expected_pid); in subprocess()
145 expected_pid = n + 1; in subprocess()
A Dtst-rfc3484-3.c69 # define h(n) n argument
71 # define h(n) __bswap_constant_32 (n) argument
107 __getline (char **lineptr, size_t *n, FILE *s) in __getline() argument
110 *n = 0; in __getline()
A Dtst-rfc3484.c69 # define h(n) n argument
71 # define h(n) __bswap_constant_32 (n) argument
99 __getline (char **lineptr, size_t *n, FILE *s) in __getline() argument
102 *n = 0; in __getline()
A Dtst-rfc3484-2.c69 # define h(n) n argument
71 # define h(n) __bswap_constant_32 (n) argument
76 __getline (char **lineptr, size_t *n, FILE *s) in __getline() argument
79 *n = 0; in __getline()
A Dbug-getopt5.c15 one_test (const char *fmt, int argc, char *argv[], int n, int expected[n]) in one_test() argument
20 for (int i = 0; i < n; ++i) in one_test()
A Dbug-getopt4.c14 one_test (const char *fmt, int argc, char *argv[], int n, int expected[n]) in one_test() argument
19 for (int i = 0; i < n; ++i) in one_test()
A DBOOST.tests91 . \n 0 1
110 \n* \n\n 0 2
125 \n+ \n\n 0 2
143 \n? \n\n 0 1
253 [\n] \n 0 1
325 abc\> abc\n 0 3
456 //[^\n]* "++i //here is a line comment\n" 4 28
468 ^[[:blank:]]*#([^\n]*\\[[:space:]]+)*[^\n]* "#define some_symbol(x) \\ \r\n foo();\\\r\n printf…
519 \n \n 0 1
523 n n 0 1
[all …]
A Dflexmember.h57 #define FLEXSIZEOF(type, member, n) \ argument
58 ((offsetof (type, member) + FLEXALIGNOF (type) - 1 + (n)) \

Completed in 36 milliseconds

12