Searched refs:s2 (Results 1 - 25 of 59) sorted by relevance

123

/haiku/src/system/libroot/posix/string/
H A Dstrstr.c10 strstr(const char *s1, const char *s2) argument
13 /* Check for the null s2 case. */
14 if (*s2 == '\0')
16 s2len = strlen(s2);
17 for (; (s1 = strchr(s1, *s2)) != NULL; s1++) {
18 if (strncmp(s1, s2, s2len) == 0)
H A Dstrcasecmp.c42 strcasecmp(const char *s1, const char *s2) argument
45 const u_char *us2 = (const u_char *)s2;
57 strncasecmp(const char *s1, const char *s2, size_t n) argument
61 const u_char *us2 = (const u_char *)s2;
75 strcasecmp_l(const char *s1, const char *s2, locale_t locale) argument
79 *us2 = (const u_char *)s2;
89 strncasecmp_l(const char *s1, const char *s2, size_t n, locale_t locale) argument
94 *us2 = (const u_char *)s2;
/haiku/headers/os/locale/
H A DCollator.h60 int Compare(const char* s1, const char* s2)
62 bool Equal(const char* s1, const char* s2)
64 bool Greater(const char* s1, const char* s2)
66 bool GreaterOrEqual(const char* s1, const char* s2)
81 BCollator::Equal(const char *s1, const char *s2) const
83 return Compare(s1, s2) == 0;
88 BCollator::Greater(const char *s1, const char *s2) const
90 return Compare(s1, s2) > 0;
95 BCollator::GreaterOrEqual(const char *s1, const char *s2) const
97 return Compare(s1, s2) >
[all...]
H A DLocale.h46 const char* s2) const;
48 const BString* s2) const;
65 BLocale::StringCompare(const char* s1, const char* s2) const
67 return fCollator.Compare(s1, s2);
72 BLocale::StringCompare(const BString* s1, const BString* s2) const
74 return fCollator.Compare(s1->String(), s2->String());
/haiku/src/libs/iconv/
H A Dsjis.h26 Conversion between SJIS codes (s1,s2) and JISX0208 codes (c1,c2):
27 Example. (s1,s2) = 0x8140, (c1,c2) = 0x2121.
29 0x40 <= s2 <= 0x7E || 0x80 <= s2 <= 0xFC,
32 94*2*(s1 < 0xE0 ? s1-0x81 : s1-0xC1) + (s2 < 0x80 ? s2-0x40 : s2-0x41)
34 Conversion (s1,s2) -> (c1,c2):
36 t2 := (s2 < 0x80 ? s2
53 unsigned char s1, s2; local
[all...]
H A Dcp932.h68 Conversion between SJIS codes (s1,s2) and JISX0208 codes (c1,c2):
69 Example. (s1,s2) = 0x8140, (c1,c2) = 0x2121.
71 0x40 <= s2 <= 0x7E || 0x80 <= s2 <= 0xFC,
74 94*2*(s1 < 0xE0 ? s1-0x81 : s1-0xC1) + (s2 < 0x80 ? s2-0x40 : s2-0x41)
76 Conversion (s1,s2) -> (c1,c2):
78 t2 := (s2 < 0x80 ? s2
97 unsigned char s1, s2; local
[all...]
H A Djohab.h26 Conversion between JOHAB codes (s1,s2) and KSX1001 codes (c1,c2):
27 Example. (s1,s2) = 0xD931, (c1,c2) = 0x2121.
28 (s1,s2) = 0xDEF1, (c1,c2) = 0x2C71.
29 (s1,s2) = 0xE031, (c1,c2) = 0x4A21.
30 (s1,s2) = 0xF9FE, (c1,c2) = 0x7D7E.
32 0x31 <= s2 <= 0x7E || 0x91 <= s2 <= 0xFE,
36 94*(s1 < 0xE0 ? 2*s1-0x1B2 : 2*s1-0x197) + (s2 < 0x91 ? s2-0x31 : s2
63 unsigned char s1, s2; local
[all...]
H A Dshift_jisx0213.h247 unsigned int s1, s2; local
252 s2 = jch & 0x7f;
254 s2 -= 0x21;
266 s2 += 0x5e;
272 if (s2 < 0x3f)
273 s2 += 0x40;
275 s2 += 0x41;
280 conv->ostate = (s1 << 8) | s2;
286 r[1] = s2;
/haiku/headers/cpp/std/
H A Dstraits.h59 static int compare (const char_type* s1, const char_type* s2, size_t n) argument
63 if (ne (s1[i], s2[i]))
64 return lt (s1[i], s2[i]) ? -1 : 1;
77 static char_type* copy (char_type* s1, const char_type* s2, size_t n) argument
80 assign (s1[n], s2[n]);
84 static char_type* move (char_type* s1, const char_type* s2, size_t n) argument
89 assign (a[i], s2[i]);
122 static int compare (const char_type* s1, const char_type* s2, size_t n) argument
123 { return memcmp (s1, s2, n); }
126 static char_type* copy (char_type* s1, const char_type* s2, size_ argument
128 move(char_type* s1, const char_type* s2, size_t n) argument
[all...]
/haiku/src/libs/libtelnet/
H A Dgenget.c52 * of *s2. If *s1 exactly matches *s2, the negative of
53 * the length is returned. If *s1 is a prefix of *s2,
57 isprefix(char *s1, const char *s2) argument
66 c2 = *s2;
71 c2 = *++s2;
73 return(*s1 ? 0 : (*s2 ? (s1 - os1) : (os1 - s1)));
/haiku/src/system/libroot/posix/musl/math/
H A Datanf.c43 float_t w,s1,s2,z; local
89 s2 = w*(aT[1]+w*aT[3]);
91 return x - x*(s1+s2);
92 z = atanhi[id] - ((x*(s1+s2) - atanlo[id]) - x);
H A Datan.c65 double_t w,s1,s2,z; local
111 s2 = w*(aT[1]+w*(aT[3]+w*(aT[5]+w*(aT[7]+w*aT[9]))));
113 return x - x*(s1+s2);
114 z = atanhi[id] - (x*(s1+s2) - atanlo[id] - x);
H A Datanl.c132 long double w, s1, s2, z; local
178 s2 = w*T_odd(w);
180 return x - x*(s1+s2);
181 z = atanhi[id] - ((x*(s1+s2) - atanlo[id]) - x);
/haiku/src/add-ons/kernel/file_systems/ntfs/libntfs/
H A Dunistr.h30 const ntfschar *s2, size_t s2_len, const IGNORE_CASE_BOOL ic,
38 extern int ntfs_ucsncmp(const ntfschar *s1, const ntfschar *s2, size_t n);
40 extern int ntfs_ucsncasecmp(const ntfschar *s1, const ntfschar *s2, size_t n,
/haiku/headers/tools/cppunit/cppunit/extensions/
H A DHelperMacros.h262 #define __CPPUNIT_CONCATENATE_DIRECT( s1, s2 ) s1##s2
263 #define __CPPUNIT_CONCATENATE( s1, s2 ) __CPPUNIT_CONCATENATE_DIRECT( s1, s2 )
/haiku/src/bin/
H A Dcomm.c218 stricoll(const char *s1, const char *s2) argument
225 for (p = line2; *s2; s2++)
226 *p++ = tolower((unsigned char)*s2);
/haiku/src/libs/compat/freebsd_wlan/crypto/rijndael/
H A Drijndael-alg-fst.c864 u32 s0, s1, s2, s3, t0, t1, t2, t3; local
875 s2 = GETU32(pt + 8) ^ rk[2];
879 t0 = Te0[s0 >> 24] ^ Te1[(s1 >> 16) & 0xff] ^ Te2[(s2 >> 8) & 0xff] ^ Te3[s3 & 0xff] ^ rk[ 4];
880 t1 = Te0[s1 >> 24] ^ Te1[(s2 >> 16) & 0xff] ^ Te2[(s3 >> 8) & 0xff] ^ Te3[s0 & 0xff] ^ rk[ 5];
881 t2 = Te0[s2 >> 24] ^ Te1[(s3 >> 16) & 0xff] ^ Te2[(s0 >> 8) & 0xff] ^ Te3[s1 & 0xff] ^ rk[ 6];
882 t3 = Te0[s3 >> 24] ^ Te1[(s0 >> 16) & 0xff] ^ Te2[(s1 >> 8) & 0xff] ^ Te3[s2 & 0xff] ^ rk[ 7];
886 s2 = Te0[t2 >> 24] ^ Te1[(t3 >> 16) & 0xff] ^ Te2[(t0 >> 8) & 0xff] ^ Te3[t1 & 0xff] ^ rk[10];
889 t0 = Te0[s0 >> 24] ^ Te1[(s1 >> 16) & 0xff] ^ Te2[(s2 >> 8) & 0xff] ^ Te3[s3 & 0xff] ^ rk[12];
890 t1 = Te0[s1 >> 24] ^ Te1[(s2 >> 16) & 0xff] ^ Te2[(s3 >> 8) & 0xff] ^ Te3[s0 & 0xff] ^ rk[13];
891 t2 = Te0[s2 >> 2
1045 u32 s0, s1, s2, s3, t0, t1, t2, t3; local
[all...]
/haiku/src/system/libroot/posix/arch/riscv64/
H A Dsigsetjmp.S17 sd s2, 3*8(a0)
H A Dsiglongjmp.S19 ld s2, 3*8(a0)
/haiku/src/kits/tracker/
H A DTrackerString.cpp395 const char* s2 = string2; local
397 if (IsStartOfGlyph(*s1) && *s1 == *s2) {
399 s2++;
401 while (IsInsideGlyph(*s1) && *s1 == *s2) {
403 s2++;
407 && !IsInsideGlyph(*s2) && *(s1 - 1) == *(s2 - 1);
/haiku/src/system/libroot/posix/glibc/arch/sparc/
H A Dadd_n.S43 1: ldx [%o2+%o5],%g1 ! load s2 limb
46 addcc %g1,%o4,%g1 ! add s2 limb and carry variable
H A Dsub_n.S40 1: ldx [%o2+%o5],%g1 ! load s2 limb
43 addcc %g1,%o4,%g1 ! add s2 limb and carry variable
/haiku/src/system/boot/platform/efi/arch/riscv64/
H A Darch_traps.h27 uint64 s2; member in struct:iframe
/haiku/src/apps/haikudepot/model/
H A DLanguageModel.h51 static int _NullSafeStrCmp(const char* s1, const char* s2);
/haiku/src/system/libroot/posix/glibc/regex/
H A Dregex.c48 # define re_search_2(bufp, st1, s1, st2, s2, startpos, range, regs, stop) \
49 __re_search_2 (bufp, st1, s1, st2, s2, startpos, range, regs, stop)

Completed in 257 milliseconds

123