Home
last modified time | relevance | path

Searched refs:p (Results 1 – 25 of 26) sorted by relevance

12

/string/
A Dstrspn.c44 memset (p + 64, 0, 64); in STRSPN()
45 memset (p + 128, 0, 64); in STRSPN()
53 p[*s++] = 1; in STRSPN()
57 if (!p[s[0]]) return 0; in STRSPN()
58 if (!p[s[1]]) return 1; in STRSPN()
59 if (!p[s[2]]) return 2; in STRSPN()
60 if (!p[s[3]]) return 3; in STRSPN()
67 c0 = p[s[0]]; in STRSPN()
68 c1 = p[s[1]]; in STRSPN()
69 c2 = p[s[2]]; in STRSPN()
[all …]
A Dstrcspn.c40 memset (p + 64, 0, 64); in STRCSPN()
41 memset (p + 128, 0, 64); in STRCSPN()
47 p[tmp = *s++] = 1; in STRCSPN()
51 if (p[s[0]]) return 0; in STRCSPN()
52 if (p[s[1]]) return 1; in STRCSPN()
53 if (p[s[2]]) return 2; in STRCSPN()
54 if (p[s[3]]) return 3; in STRCSPN()
62 c0 = p[s[0]]; in STRCSPN()
63 c1 = p[s[1]]; in STRCSPN()
64 c2 = p[s[2]]; in STRCSPN()
[all …]
A Dtst-strcoll-overflow.c38 char *p = malloc (SIZE); in do_test() local
39 if (p == NULL) in do_test()
45 memset (p, 'x', SIZE - 1); in do_test()
46 p[SIZE - 1] = 0; in do_test()
47 printf ("info: strcoll result: %d\n", strcoll (p, p)); in do_test()
A Dtest-strlen.c43 const CHAR *p; in simple_STRLEN() local
45 for (p = s; *p; ++p); in simple_STRLEN()
46 return p - s; in simple_STRLEN()
51 builtin_strlen (const CHAR *p) in builtin_strlen() argument
53 return __builtin_strlen (p); in builtin_strlen()
113 p[i] = 0; in do_random_tests()
116 p[i] = random () & 255; in do_random_tests()
117 if (i >= align && i < len + align && !p[i]) in do_random_tests()
118 p[i] = (random () & 127) + 1; in do_random_tests()
123 if (CALL (impl, (CHAR *) (p + align)) != len) in do_random_tests()
[all …]
A Dargz-create.c32 char *p; in __argz_create() local
45 for (p = *argz, ap = argv; *ap; ++ap, ++p) in __argz_create()
46 p = __stpcpy (p, *ap); in __argz_create()
A Dstrrchr.c30 const char *found, *p; in STRRCHR() local
40 while ((p = strchr (s, c)) != NULL) in STRRCHR()
42 found = p; in STRRCHR()
43 s = p + 1; in STRRCHR()
A Dbasename.c24 char *p = strrchr (filename, '/'); in __basename() local
25 return p ? p + 1 : (char *) filename; in __basename()
A Dtest-rawmemchr.c87 unsigned char *p = buf1 + page_size - 512; in do_random_tests() local
108 p[i] = seek_char; in do_random_tests()
111 p[i] = random () & 255; in do_random_tests()
112 if (i < pos + align && p[i] == seek_char) in do_random_tests()
113 p[i] = seek_char + 13; in do_random_tests()
120 len = ~(uintptr_t) (p + align) - ((r >> 5) & 31); in do_random_tests()
121 result = (char *) (p + pos + align); in do_random_tests()
124 if (CALL (impl, (char *) (p + align), seek_char) != result) in do_random_tests()
128 CALL (impl, (char *) (p + align), seek_char), in do_random_tests()
129 result, p); in do_random_tests()
A Dtest-strrchr.c156 p[i] = seek_char; in do_random_tests()
158 p[i] = 0; in do_random_tests()
161 p[i] = random () & 255; in do_random_tests()
163 && p[i] == seek_char) in do_random_tests()
164 p[i] = seek_char + 13; in do_random_tests()
165 if (i < len + align && !p[i]) in do_random_tests()
167 p[i] = seek_char - 13; in do_random_tests()
168 if (!p[i]) in do_random_tests()
169 p[i] = 140; in do_random_tests()
175 result = (CHAR *) (p + pos + align); in do_random_tests()
[all …]
A Dmemccpy.c33 void *p = memchr (src, c, n); in __memccpy() local
35 if (p != NULL) in __memccpy()
36 return __mempcpy (dest, src, p - src + 1); in __memccpy()
A Dtest-strchr.c193 p[i] = seek_char; in do_random_tests()
195 p[i] = 0; in do_random_tests()
198 p[i] = random () & 255; in do_random_tests()
200 p[i] = seek_char + 13; in do_random_tests()
201 if (i < len + align && !p[i]) in do_random_tests()
203 p[i] = seek_char - 13; in do_random_tests()
204 if (!p[i]) in do_random_tests()
205 p[i] = 140; in do_random_tests()
211 result = (CHAR *) (p + pos + align); in do_random_tests()
213 result = (CHAR *) (p + len + align); in do_random_tests()
[all …]
A Dmemfrob.c23 char *p = (char *) s; in memfrob() local
26 *p++ ^= 42; in memfrob()
A Dtest-memrchr.c92 unsigned char *p = buf1 + page_size - 512; in do_random_tests() local
113 p[i] = seek_char; in do_random_tests()
116 p[i] = random () & 255; in do_random_tests()
117 if (p[i] == seek_char) in do_random_tests()
118 p[i] = seek_char + 13; in do_random_tests()
123 result = (char *) (p + pos + align); in do_random_tests()
128 if (CALL (impl, (char *) (p + align), seek_char, len) != result) in do_random_tests()
132 CALL (impl, (char *) (p + align), seek_char, len), in do_random_tests()
133 result, p); in do_random_tests()
A Dtest-memset.c154 UCHAR *p, *res; in do_random_tests() local
166 p = (UCHAR *) (buf1 + page_size) - size; in do_random_tests()
188 p[i] = o; in do_random_tests()
190 p[i] = o; in do_random_tests()
196 p[i + align] = p2[i]; in do_random_tests()
197 if (p[i + align] == c) in do_random_tests()
198 p[i + align] = o; in do_random_tests()
201 if (res != p + align) in do_random_tests()
208 if (p[i] != o) in do_random_tests()
216 if (p[i] != c) in do_random_tests()
[all …]
A Denvz.c35 const char *p = name; in envz_entry() local
39 while (envz_len && *p == *envz && *p && *p != SEP) in envz_entry()
40 p++, envz++, envz_len--; in envz_entry()
42 if ((*envz == '\0' || *envz == SEP) && (*p == '\0' || *p == SEP)) in envz_entry()
A Dtest-strnlen.c131 CHAR *p = (CHAR *) (buf1 + page_size - 512 * sizeof (CHAR)); in do_random_tests() local
146 p[i] = 0; in do_random_tests()
149 p[i] = random () & 255; in do_random_tests()
150 if (i >= align && i < len + align && !p[i]) in do_random_tests()
151 p[i] = (random () & 127) + 1; in do_random_tests()
158 && CALL (impl, (CHAR *) (p + align), len - 1) != len - 1) in do_random_tests()
162 CALL (impl, (CHAR *) (p + align), len - 1), len - 1, p); in do_random_tests()
165 if (CALL (impl, (CHAR *) (p + align), len) != len) in do_random_tests()
169 CALL (impl, (CHAR *) (p + align), len), len, p); in do_random_tests()
172 if (CALL (impl, (CHAR *) (p + align), len + 1) != len) in do_random_tests()
[all …]
A Dstr-two-way.h140 k = p = 1; in critical_factorization()
150 p = j - max_suffix; in critical_factorization()
155 if (k != p) in critical_factorization()
159 j += p; in critical_factorization()
167 k = p = 1; in critical_factorization()
170 *period = p; in critical_factorization()
175 k = p = 1; in critical_factorization()
190 if (k != p) in critical_factorization()
194 j += p; in critical_factorization()
202 k = p = 1; in critical_factorization()
[all …]
A Dtest-strpbrk.c163 UCHAR *p = (UCHAR *) (buf1 + page_size) - 512; in do_random_tests() local
201 p[i] = '\0'; in do_random_tests()
203 p[i] = rej[random () % (rlen + 1)]; in do_random_tests()
205 p[i] = random () & BIG_CHAR; in do_random_tests()
208 p[i] = random () & BIG_CHAR; in do_random_tests()
209 if (STRCHR ((CHAR *) rej, p[i])) in do_random_tests()
211 p[i] = random () & BIG_CHAR; in do_random_tests()
212 if (STRCHR ((CHAR *) rej, p[i])) in do_random_tests()
213 p[i] = c; in do_random_tests()
221 if (CALL (impl, (CHAR *) (p + align), (CHAR *) rej) != result) in do_random_tests()
[all …]
A Dtst-xbzero-opt.c208 unsigned char *p = first + i*PATTERN_SIZE; in count_test_patterns() local
209 if (p + PATTERN_SIZE - buf > bufsiz) in count_test_patterns()
211 if (memcmp (p, test_pattern, PATTERN_SIZE) == 0) in count_test_patterns()
298 void *p; in do_test() local
299 int err = posix_memalign (&p, page_alignment, co_stack_size); in do_test()
300 if (err || !p) in do_test()
305 co_stack_buffer = p; in do_test()
A Dtest-memchr.c147 UCHAR *p = (UCHAR *) (buf1 + page_size) - 512; in do_random_tests() local
168 p[i] = seek_char; in do_random_tests()
171 p[i] = random () & BIG_CHAR; in do_random_tests()
172 if (i < pos + align && p[i] == seek_char) in do_random_tests()
173 p[i] = seek_char + 13; in do_random_tests()
181 len = ~(uintptr_t) (p + align) - ((r >> 5) & 31); in do_random_tests()
182 result = (CHAR *) (p + pos + align); in do_random_tests()
188 if (CALL (impl, (CHAR *) (p + align), seek_char, len) != result) in do_random_tests()
192 CALL (impl, (CHAR *) (p + align), seek_char, len), in do_random_tests()
193 result, p); in do_random_tests()
A Dtest-strspn.c148 UCHAR *p = (UCHAR *) (buf1 + page_size) - 512; in do_random_tests() local
184 p[i] = '\0'; in do_random_tests()
187 p[i] = random () & BIG_CHAR; in do_random_tests()
188 if (STRCHR ((CHAR *) acc, p[i])) in do_random_tests()
189 p[i] = '\0'; in do_random_tests()
192 p[i] = random () & BIG_CHAR; in do_random_tests()
194 p[i] = acc [random () % alen]; in do_random_tests()
198 if (CALL (impl, (CHAR *) (p + align), in do_random_tests()
203 CALL (impl, (CHAR *) (p + align), (CHAR *) acc), in do_random_tests()
A Dtester.c529 char *p; in test_strlen() local
582 char *p; in test_strchr() local
614 char *p; in test_strchrnul() local
643 char *p; in test_rawmemchr() local
649 check (rawmemchr (p, 'R') == p+8, 6+i); in test_rawmemchr()
689 char *p; in test_strrchr() local
1418 char *p, *q; in test_strndup() local
1422 if (p != NULL) in test_strndup()
1431 free (p); in test_strndup()
1434 if (p != NULL) in test_strndup()
[all …]
A Dmemmem.c39 #define hash2(p) (((size_t)(p)[0] - ((size_t)(p)[-1] << 3)) % sizeof (shift)) argument
A Dstrstr.c62 #define hash2(p) (((size_t)(p)[0] - ((size_t)(p)[-1] << 3)) % sizeof (shift)) argument
A Dstrxfrm_l.c244 for (size_t p = backw_len; p > 0; p--) in do_xfrm() local
255 for (i = 1; i < p; i++) in do_xfrm()
333 for (size_t p = backw_len; p > 0; p--) in do_xfrm() local
344 for (i = 1; i < p; i++) in do_xfrm()

Completed in 38 milliseconds

12