/haiku-buildtools/legacy/gcc/libchill/ |
H A D | eqstr.c | 52 __eqstring (s1, len1, s2, len2) 54 int len1; 58 if (len1 != len2) 61 return ! memcmp (s1, s2, len1);
|
H A D | ltstr.c | 51 int __ltstring (s1, len1, s2, len2) 53 int len1; 59 i = memcmp (s1, s2, MIN (len1, len2)); 62 return (len1 < len2);
|
H A D | concatstr.c | 55 __concatstring (out, s1, len1, s2, len2) 57 int len1; 64 && ((s2 >= out && s2 < (out + len1 + len2)) 65 || (s2 + len2 > out && s2 <= out + len1))) 72 memmove (out, s1, len1); 74 memcpy (&out[len1], s2, len2);
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.target/i386/ |
H A D | chkp-strlen-5.c | 11 size_t len1 = strlen (str1); local 14 return len1 + len2 + strlen (str1);
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/ |
H A D | strlenopt-26.c | 9 size_t len1 = strlen (r); local 12 return len1 - strlen (r); // This strlen should be optimized into len1.
|
/haiku-buildtools/gcc/gcc/testsuite/gfortran.dg/ |
H A D | pr67805_2.f90 | 9 integer :: len1 component in type:template_t 18 character(tt%len1) :: ch1
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/27_io/basic_ostream/ends/char/ |
H A D | 2.cc | 36 int_type len1 = str_00.size(); local 38 VERIFY( static_cast<int_type>(osst_01.str().size()) == len1 ); 46 VERIFY( len1 < len3 ); 47 VERIFY( len3 == len1 + len2 + 1 );
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/27_io/basic_ostream/ends/wchar_t/ |
H A D | 2.cc | 34 int_type len1 = str_00.size(); local 36 VERIFY( static_cast<int_type>(osst_01.str().size()) == len1 ); 44 VERIFY( len1 < len3 ); 45 VERIFY( len3 == len1 + len2 + 1 );
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/torture/ |
H A D | 20131122-0.c | 7 f (long *s, long *t, int len1, int len2) argument 12 for (i = len1 - 1; i >= 0; i--)
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/27_io/basic_filebuf/sgetn/char/ |
H A D | 3.cc | 38 int_type len1 = fbuf01.sgetn(buffer, sizeof(buffer)); local 39 VERIFY( len1 == sizeof(buffer) );
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.target/powerpc/ |
H A D | vec-shr.c | 12 foo (complex *c, double *d, int len1) argument 15 for (i = 0; i < len1; i++)
|
/haiku-buildtools/gcc/libvtv/testsuite/libvtv.cc/ |
H A D | register_set_pair.cc | 64 uint32_t len1 = strlen (fake_names[i]); local 68 *value_ptr = len1; 73 len1);
|
H A D | register_set_pair_inserts.cc | 69 uint32_t len1 = strlen (fake_names[i]); local 73 *value_ptr = len1; 78 len1);
|
/haiku-buildtools/legacy/gcc/libf2c/libI77/ |
H A D | endfile.c | 48 int len1; local 51 while(fread(buf, len1 = len > BUFSIZ ? BUFSIZ : (int)len, 1, from)) { 52 if (!fwrite(buf, len1, 1, to)) 54 if ((len -= len1) <= 0)
|
/haiku-buildtools/gcc/libvtv/testsuite/libvtv.mt.cc/ |
H A D | register_set_pair_inserts_mt.cc | 73 uint32_t len1 = strlen (fake_names[i]); local 82 *value_ptr = len1; 87 len1);
|
H A D | register_set_pair_mt.cc | 73 uint32_t len1 = strlen (fake_names[i]); local 82 *value_ptr = len1; 87 len1);
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/21_strings/char_traits/requirements/char/ |
H A D | 1.cc | 57 const int len1 = sizeof(str_lit1)/sizeof(char); local 59 char array2[len1 + len2 - 1]; // two terminating chars
|
/haiku-buildtools/binutils/gold/ |
H A D | stringpool.cc | 344 const size_t len1 = h1.length; local 346 const size_t minlen = len1 < len2 ? len1 : len2; 347 const Stringpool_char* p1 = s1 + len1 - 1; 354 return len1 > len2; 362 size_t len1, 366 if (len1 > len2) 368 return memcmp(s1, s2 + len2 - len1, len1 * sizeof(Stringpool_char)) == 0; 361 is_suffix(const Stringpool_char* s1, size_t len1, const Stringpool_char* s2, size_t len2) argument
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/21_strings/char_traits/requirements/wchar_t/ |
H A D | 1.cc | 57 const int len1 = sizeof(str_lit1)/sizeof(wchar_t); local 59 wchar_t array2[len1 + len2 - 1]; // two terminating chars
|
/haiku-buildtools/legacy/gcc/gcc/config/winnt/ |
H A D | fixinc-nt.c | 233 int len1 = strlen (s1); local 235 char *result = malloc (len1 + len2 + 1); 238 strcpy (result + len1, s2); 239 *(result + len1 + len2) = 0;
|
H A D | ld.c | 332 int len1 = strlen (s1); local 334 char *result = malloc (len1 + len2 + 1); 337 strcpy (result + len1, s2); 338 *(result + len1 + len2) = 0;
|
/haiku-buildtools/legacy/gcc/texinfo/util/ |
H A D | install-info.c | 148 int len1 = strlen (s1), len2 = strlen (s2), len3 = strlen (s3); 149 char *result = (char *) xmalloc (len1 + len2 + len3 + 1); 152 strcpy (result + len1, s2); 153 strcpy (result + len1 + len2, s3); 154 *(result + len1 + len2 + len3) = 0; 1104 menu_line_lessp (line1, len1, line2, len2) 1106 int len1; 1110 int minlen = (len1 < len2 ? len1 : len2); 1137 menu_line_equal (line1, len1, line 146 int len1 = strlen (s1), len2 = strlen (s2), len3 = strlen (s3); local [all...] |
/haiku-buildtools/legacy/gcc/libio/ |
H A D | editbuf.cc | 672 int len1, len2; local 677 len1 = end->ptr(buffer) - start1; 682 len1 = buffer->gap_start() - start1; 686 new_str = (char*)malloc(len1 + len2 + 1); 687 memcpy(new_str, start1, len1); 688 if (len2 > 0) memcpy(new_str + len1, start2, len2); 689 new_str[len1+len2] = '\0'; 690 *lenp = len1+len2;
|
/haiku-buildtools/gcc/gcc/ |
H A D | gcov-tool.c | 66 int len1 = strlen (GCOV_DATA_SUFFIX); local 68 if (len > len1 && !strncmp (len -len1 + name, GCOV_DATA_SUFFIX, len1))
|
/haiku-buildtools/gcc/libsanitizer/sanitizer_common/ |
H A D | sanitizer_libc.cc | 192 uptr len1 = internal_strlen(haystack); local 194 if (len1 < len2) return 0; 195 for (uptr pos = 0; pos <= len1 - len2; pos++) {
|