Searched defs:s2 (Results 1 - 25 of 32) sorted by relevance

12

/bionic/libc/bionic/
H A Dstrcoll_l.cpp31 int strcoll_l(const char *s1, const char *s2, locale_t) { argument
32 return strcoll(s1, s2);
H A Dmemcmp.c30 int memcmp(const void *s1, const void *s2, size_t n) argument
34 const unsigned char* p2 = s2;
/bionic/libc/upstream-freebsd/lib/libc/string/
H A Dwcscat.c40 wcscat(wchar_t * __restrict s1, const wchar_t * __restrict s2) argument
47 while ((*cp++ = *s2++) != L'\0')
H A Dwcscmp.c48 wcscmp(const wchar_t *s1, const wchar_t *s2) argument
51 while (*s1 == *s2++)
55 return (*(const unsigned int *)s1 - *(const unsigned int *)--s2);
H A Dwcscpy.c40 wcscpy(wchar_t * __restrict s1, const wchar_t * __restrict s2) argument
45 while ((*cp++ = *s2++) != L'\0')
H A Dwcsncmp.c42 wcsncmp(const wchar_t *s1, const wchar_t *s2, size_t n) argument
48 if (*s1 != *s2++) {
51 *(const unsigned int *)--s2);
H A Dwcscasecmp.c34 wcscasecmp(const wchar_t *s1, const wchar_t *s2) argument
38 for (; *s1; s1++, s2++) {
40 c2 = towlower(*s2);
44 return (-*s2);
H A Dwmemcmp.c40 wmemcmp(const wchar_t *s1, const wchar_t *s2, size_t n) argument
45 if (*s1 != *s2) {
47 return *s1 > *s2 ? 1 : -1;
50 s2++;
H A Dwcsncasecmp.c34 wcsncasecmp(const wchar_t *s1, const wchar_t *s2, size_t n) argument
40 for (; *s1; s1++, s2++) {
42 c2 = towlower(*s2);
48 return (-*s2);
H A Dwcsncat.c40 wcsncat(wchar_t * __restrict s1, const wchar_t * __restrict s2, size_t n) argument
50 r = s2;
/bionic/libc/upstream-netbsd/lib/libc/string/
H A Dstrcoll.c51 strcoll(const char *s1, const char *s2) argument
55 _DIAGASSERT(s2 != NULL);
58 return (strcmp(s1, s2));
/bionic/libc/upstream-openbsd/lib/libc/locale/
H A Dwcscoll.c37 wcscoll(const wchar_t *s1, const wchar_t *s2) argument
40 return (wcscmp(s1, s2));
/bionic/libc/upstream-openbsd/lib/libc/string/
H A Dstrcmp.c41 strcmp(const char *s1, const char *s2) argument
43 while (*s1 == *s2++)
46 return (*(unsigned char *)s1 - *(unsigned char *)--s2);
H A Dstrncmp.c35 strncmp(const char *s1, const char *s2, size_t n) argument
41 if (*s1 != *s2++)
42 return (*(unsigned char *)s1 - *(unsigned char *)--s2);
H A Dstrcspn.c37 * Span the complement of string s2.
40 strcspn(const char *s1, const char *s2) argument
46 * Stop as soon as we find any character from s2. Note that there
47 * must be a NUL in s2; it suffices to stop when we find that, too.
51 spanp = s2;
H A Dstrpbrk.c34 * Find the first occurrence in s1 of a character in s2 (excluding NUL).
37 strpbrk(const char *s1, const char *s2) argument
43 for (scanp = s2; (sc = *scanp++) != 0;)
H A Dstrspn.c34 * Span the string s2 (skip characters that are in s2).
37 strspn(const char *s1, const char *s2) argument
43 * Skip any characters in s2, excluding the terminating \0.
47 for (spanp = s2; (sc = *spanp++) != 0;)
H A Dstrcasecmp.c77 strcasecmp(const char *s1, const char *s2) argument
81 const u_char *us2 = (const u_char *)s2;
90 strncasecmp(const char *s1, const char *s2, size_t n) argument
95 const u_char *us2 = (const u_char *)s2;
/bionic/libc/private/
H A Dbionic_string_utils.h22 static inline bool ends_with(const char* s1, const char* s2) { argument
24 size_t s2_length = strlen(s2);
28 return memcmp(s1 + (s1_length - s2_length), s2, s2_length) == 0;
/bionic/libm/upstream-freebsd/lib/msun/src/
H A Ds_atan.c76 double w,s1,s2,z; local
114 s2 = w*(aT[1]+w*(aT[3]+w*(aT[5]+w*(aT[7]+w*aT[9]))));
115 if (id<0) return x - x*(s1+s2);
117 z = atanhi[id] - ((x*(s1+s2) - atanlo[id]) - x);
H A Ds_atanf.c51 float w,s1,s2,z; local
86 s2 = w*(aT[1]+w*aT[3]);
87 if (id<0) return x - x*(s1+s2);
89 z = atanhi[id] - ((x*(s1+s2) - atanlo[id]) - x);
H A Ds_atanl.c36 long double w,s1,s2,z; local
79 s2 = w*T_odd(w);
80 if (id<0) return x - x*(s1+s2);
82 z = atanhi[id] - ((x*(s1+s2) - atanlo[id]) - x);
/bionic/libc/arch-mips/include/machine/
H A Dregdef.h77 #define s2 $18 macro
/bionic/libc/arch-mips64/include/machine/
H A Dregdef.h84 #define s2 $18 macro
/bionic/libc/upstream-openbsd/lib/libc/gdtoa/
H A Ddtoa.c119 j, j1, k, k0, k_check, leftright, m2, m5, s2, s5, local
271 s2 = j;
275 s2 = 0;
280 s2 += k;
512 s2 += i;
517 if (m2 > 0 && s2 > 0) {
518 i = m2 < s2 ? m2 : s2;
521 s2 -= i;
571 s2
[all...]

Completed in 234 milliseconds

12