/haiku/src/system/libroot/posix/string/ |
H A D | strstr.c | 10 strstr(const char *s1, const char *s2) argument 15 return (char *) s1; 17 for (; (s1 = strchr(s1, *s2)) != NULL; s1++) { 18 if (strncmp(s1, s2, s2len) == 0) 19 return (char *)s1;
|
H A D | strcasecmp.c | 42 strcasecmp(const char *s1, const char *s2) argument 44 const u_char *us1 = (const u_char *)s1; 57 strncasecmp(const char *s1, const char *s2, size_t n) argument 60 const u_char *us1 = (const u_char *)s1; 75 strcasecmp_l(const char *s1, const char *s2, locale_t locale) argument 78 *us1 = (const u_char *)s1, 89 strncasecmp_l(const char *s1, const char *s2, size_t n, locale_t locale) argument 93 *us1 = (const u_char *)s1,
|
/haiku/src/libs/libtelnet/ |
H A D | genget.c | 47 * The prefix function returns 0 if *s1 is not a prefix 48 * of *s2. If *s1 exactly matches *s2, the negative of 49 * the length is returned. If *s1 is a prefix of *s2, 50 * the length of *s1 is returned. 53 isprefix(char *s1, const char *s2) argument 58 if (*s1 == '\0') 60 os1 = s1; 61 c1 = *s1; 66 c1 = *++s1; 69 return(*s1 [all...] |
/haiku/headers/cpp/std/ |
H A D | straits.h | 59 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]); 81 return s1; 84 static char_type* move (char_type* s1, const char_type* s2, size_t n) argument 91 assign (s1[i], a[i]); 92 return s1; 95 static char_type* set (char_type* s1, cons argument 122 compare(const char_type* s1, const char_type* s2, size_t n) argument 126 copy(char_type* s1, const char_type* s2, size_t n) argument 128 move(char_type* s1, const char_type* s2, size_t n) argument 130 set(char_type* s1, const char_type& c, size_t n) argument [all...] |
/haiku/headers/os/locale/ |
H A D | Collator.h | 60 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 argument 83 return Compare(s1, s2) == 0; 88 BCollator::Greater(const char *s1, const char *s2) const argument 90 return Compare(s1, s2) > 0; 95 BCollator::GreaterOrEqual(const char *s1, const char *s2) const argument 97 return Compare(s1, s [all...] |
H A D | Locale.h | 45 int StringCompare(const char* s1, 47 int StringCompare(const BString* s1, 65 BLocale::StringCompare(const char* s1, const char* s2) const argument 67 return fCollator.Compare(s1, s2); 72 BLocale::StringCompare(const BString* s1, const BString* s2) const argument 74 return fCollator.Compare(s1->String(), s2->String());
|
/haiku/src/libs/iconv/ |
H A D | sjis.h | 26 Conversion between SJIS codes (s1,s2) and JISX0208 codes (c1,c2): 27 Example. (s1,s2) = 0x8140, (c1,c2) = 0x2121. 28 0x81 <= s1 <= 0x9F || 0xE0 <= s1 <= 0xEA, 32 94*2*(s1 < 0xE0 ? s1-0x81 : s1-0xC1) + (s2 < 0x80 ? s2-0x40 : s2-0x41) 34 Conversion (s1,s2) -> (c1,c2): 35 t1 := (s1 < 0xE0 ? s1 53 unsigned char s1, s2; local [all...] |
H A D | cp932.h | 68 Conversion between SJIS codes (s1,s2) and JISX0208 codes (c1,c2): 69 Example. (s1,s2) = 0x8140, (c1,c2) = 0x2121. 70 0x81 <= s1 <= 0x9F || 0xE0 <= s1 <= 0xEA, 74 94*2*(s1 < 0xE0 ? s1-0x81 : s1-0xC1) + (s2 < 0x80 ? s2-0x40 : s2-0x41) 76 Conversion (s1,s2) -> (c1,c2): 77 t1 := (s1 < 0xE0 ? s1 97 unsigned char s1, s2; local [all...] |
H A D | johab.h | 26 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. 31 0xD9 <= s1 <= 0xDE || 0xE0 <= s1 <= 0xF9, 36 94*(s1 < 0xE0 ? 2*s1-0x1B2 : 2*s1 63 unsigned char s1, s2; local [all...] |
H A D | shift_jisx0213.h | 247 unsigned int s1, s2; local 251 s1 = jch >> 8; 253 s1 -= 0x21; 255 if (s1 >= 0x5e) { 257 if (s1 >= 0xcd) /* rows 0x26E..0x27E */ 258 s1 -= 102; 259 else if (s1 >= 0x8b || s1 == 0x87) /* rows 0x228, 0x22C..0x22F */ 260 s1 -= 40; 262 s1 [all...] |
/haiku/src/system/libroot/posix/musl/math/ |
H A D | atanf.c | 43 float_t w,s1,s2,z; local 88 s1 = z*(aT[0]+w*(aT[2]+w*aT[4])); 91 return x - x*(s1+s2); 92 z = atanhi[id] - ((x*(s1+s2) - atanlo[id]) - x);
|
H A D | atan.c | 65 double_t w,s1,s2,z; local 110 s1 = z*(aT[0]+w*(aT[2]+w*(aT[4]+w*(aT[6]+w*(aT[8]+w*aT[10]))))); 113 return x - x*(s1+s2); 114 z = atanhi[id] - (x*(s1+s2) - atanlo[id] - x);
|
H A D | sqrt.c | 88 uint32_t r,t1,s1,ix1,q1; local 128 q = q1 = s0 = s1 = 0; /* [q,q1] = sqrt(x) */ 145 t1 = s1 + r; 148 s1 = t1 + r; 149 if ((t1&sign) == sign && (s1&sign) == 0)
|
H A D | atanl.c | 132 long double w, s1, s2, z; local 177 s1 = z*T_even(w); 180 return x - x*(s1+s2); 181 z = atanhi[id] - ((x*(s1+s2) - atanlo[id]) - x);
|
/haiku/src/add-ons/print/drivers/lpstyl/ |
H A D | Lpstyl.cpp | 82 int s1; local 87 s1 = _GetStatus('1'); 94 if (s1 == 1) { 99 } while (s1 == 1);
|
/haiku/src/system/libroot/posix/glibc/arch/sparc/ |
H A D | add_n.S | 45 ldx [%o1+%o5],%o3 ! load s1 limb 48 addcc %g1,%o3,%g1 ! add s1 limb to sum 52 movcs %xcc,1,%o4 ! if s1 add gave carry, record it
|
H A D | sub_n.S | 42 ldx [%o1+%o5],%o3 ! load s1 limb 45 subcc %o3,%g1,%g1 ! subtract s1 limb from sum 49 movcs %xcc,1,%o4 ! if s1 subtract gave carry, record it
|
/haiku/src/add-ons/kernel/file_systems/ntfs/libntfs/ |
H A D | unistr.h | 29 extern BOOL ntfs_names_are_equal(const ntfschar *s1, size_t s1_len, 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 D | HelperMacros.h | 262 #define __CPPUNIT_CONCATENATE_DIRECT( s1, s2 ) s1##s2 263 #define __CPPUNIT_CONCATENATE( s1, s2 ) __CPPUNIT_CONCATENATE_DIRECT( s1, s2 )
|
/haiku/src/bin/ |
H A D | comm.c | 218 stricoll(const char *s1, const char *s2) argument 222 for (p = line1; *s1; s1++) 223 *p++ = tolower((unsigned char)*s1);
|
/haiku/src/kits/tracker/ |
H A D | TrackerString.cpp | 394 const char* s1 = string1; local 397 if (IsStartOfGlyph(*s1) && *s1 == *s2) { 398 s1++; 401 while (IsInsideGlyph(*s1) && *s1 == *s2) { 402 s1++; 406 return !IsInsideGlyph(*s1) 407 && !IsInsideGlyph(*s2) && *(s1 - 1) == *(s2 - 1);
|
/haiku/src/libs/compat/freebsd_wlan/crypto/rijndael/ |
H A D | rijndael-alg-fst.c | 864 u32 s0, s1, s2, s3, t0, t1, t2, t3; local 874 s1 = GETU32(pt + 4) ^ rk[1]; 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]; 885 s1 = Te0[t1 >> 24] ^ Te1[(t2 >> 16) & 0xff] ^ Te2[(t3 >> 8) & 0xff] ^ Te3[t0 & 0xff] ^ rk[ 9]; 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 >> 24] ^ Te1[(s3 >> 16) & 0xff] ^ Te2[(s0 >> 8) & 0xff] ^ Te3[s1 1045 u32 s0, s1, s2, s3, t0, t1, t2, t3; local [all...] |
/haiku/src/system/libroot/posix/arch/riscv64/ |
H A D | sigsetjmp.S | 16 sd s1, 2*8(a0)
|
H A D | siglongjmp.S | 18 ld s1, 2*8(a0)
|
/haiku/src/system/boot/platform/efi/arch/riscv64/ |
H A D | arch_traps.h | 18 uint64 s1; member in struct:iframe
|