/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/ |
H A D | strlenopt-25.c | 10 int len, len2; local 13 len2 = strlen (p); 14 return len - len2;
|
/haiku-buildtools/legacy/gcc/libchill/ |
H A D | eqstr.c | 52 __eqstring (s1, len1, s2, len2) 56 int len2; 58 if (len1 != len2)
|
H A D | ltstr.c | 51 int __ltstring (s1, len1, s2, len2) 55 int len2; 59 i = memcmp (s1, s2, MIN (len1, len2)); 62 return (len1 < len2);
|
H A D | concatstr.c | 55 __concatstring (out, s1, len1, s2, len2) 59 int len2; 64 && ((s2 >= out && s2 < (out + len1 + len2)) 65 || (s2 + len2 > out && s2 <= out + len1))) 67 char *tmp = alloca (len2); 68 memcpy (tmp, s2, len2); 74 memcpy (&out[len1], s2, len2);
|
/haiku-buildtools/gcc/gcc/testsuite/gfortran.dg/ |
H A D | argument_checking_3.f90 | 20 character(len=2) :: len2 variable in program:test 22 len2 = '12' 25 call foo(len2) ! { dg-error "Rank mismatch in argument" } 28 call foobar(len2) ! { dg-warning "contains too few elements" } 32 call arr(len2) ! { dg-warning "contains too few elements" }
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.target/i386/ |
H A D | chkp-strlen-5.c | 12 size_t len2 = strlen (str2); local 14 return len1 + len2 + strlen (str1);
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/execute/ |
H A D | pr36321.c | 7 int len2 = strlen (str); local 9 char *b = (char *) __builtin_alloca (len2*3); 11 if ((int) (a-b) < (len2*3))
|
H A D | pr34176.c | 50 size_t len2 = list; local 53 size_t new_max = nitems + len2; 55 if (new_max != len2) 60 while (len2--)
|
H A D | strlen-1.c | 33 size_t off, len, len2, i; local 51 len2 = strlen (p); 52 if (len != len2)
|
/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 14 s[j--] = (i < len2 ? t[i] : t[len2 - 1] < 0 ? -1 : 0);
|
/haiku-buildtools/gcc/zlib/ |
H A D | adler32.c | 12 local uLong adler32_combine_ OF((uLong adler1, uLong adler2, z_off64_t len2)); 136 local uLong adler32_combine_(adler1, adler2, len2) 139 z_off64_t len2; 146 if (len2 < 0) 150 MOD63(len2); /* assumes len2 >= 0 */ 151 rem = (unsigned)len2; 165 uLong ZEXPORT adler32_combine(adler1, adler2, len2) 168 z_off_t len2; 170 return adler32_combine_(adler1, adler2, len2); [all...] |
H A D | crc32.c | 53 local uLong crc32_combine_ OF((uLong crc1, uLong crc2, z_off64_t len2)); 355 local uLong crc32_combine_(crc1, crc2, len2) 358 z_off64_t len2; 366 if (len2 <= 0) 383 /* apply len2 zeros to crc1 (first square will put the operator for one 386 /* apply zeros operator for this bit of len2 */ 388 if (len2 & 1) 390 len2 >>= 1; 393 if (len2 == 0) 398 if (len2 [all...] |
/haiku-buildtools/binutils/zlib/ |
H A D | adler32.c | 12 local uLong adler32_combine_ OF((uLong adler1, uLong adler2, z_off64_t len2)); 136 local uLong adler32_combine_(adler1, adler2, len2) 139 z_off64_t len2; 146 if (len2 < 0) 150 MOD63(len2); /* assumes len2 >= 0 */ 151 rem = (unsigned)len2; 165 uLong ZEXPORT adler32_combine(adler1, adler2, len2) 168 z_off_t len2; 170 return adler32_combine_(adler1, adler2, len2); [all...] |
H A D | crc32.c | 53 local uLong crc32_combine_ OF((uLong crc1, uLong crc2, z_off64_t len2)); 355 local uLong crc32_combine_(crc1, crc2, len2) 358 z_off64_t len2; 366 if (len2 <= 0) 383 /* apply len2 zeros to crc1 (first square will put the operator for one 386 /* apply zeros operator for this bit of len2 */ 388 if (len2 & 1) 390 len2 >>= 1; 393 if (len2 == 0) 398 if (len2 [all...] |
/haiku-buildtools/gcc/libstdc++-v3/testsuite/27_io/basic_ostream/ends/char/ |
H A D | 2.cc | 43 int_type len2 = str_01.size(); local 47 VERIFY( len3 == len1 + len2 + 1 );
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/27_io/basic_ostream/ends/wchar_t/ |
H A D | 2.cc | 41 int_type len2 = str_01.size(); local 45 VERIFY( len3 == len1 + len2 + 1 );
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/21_strings/char_traits/requirements/char/ |
H A D | 1.cc | 58 const int len2 = sizeof(str_lit2)/sizeof(char); local 59 char array2[len1 + len2 - 1]; // two terminating chars 60 std::char_traits<char>::copy(array2, str_lit2, len2);
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/21_strings/char_traits/requirements/wchar_t/ |
H A D | 1.cc | 58 const int len2 = sizeof(str_lit2)/sizeof(wchar_t); local 59 wchar_t array2[len1 + len2 - 1]; // two terminating chars 60 std::char_traits<wchar_t>::copy(array2, str_lit2, len2);
|
/haiku-buildtools/gcc/gcc/c-family/ |
H A D | c-ada-spec.c | 1008 int j, len2 = 0; local 1020 s[len2++] = 'c'; 1021 s[len2++] = '_'; 1031 s[len2++] = 'c'; 1032 s[len2++] = '_'; 1038 s[len2++] = 'u'; 1041 s[len2++] = '_'; 1048 len2 = 4; 1060 s[len2++] = '_'; 1065 s[len2 [all...] |
/haiku-buildtools/binutils/gold/ |
H A D | stringpool.cc | 345 const size_t len2 = h2.length; local 346 const size_t minlen = len1 < len2 ? len1 : len2; 348 const Stringpool_char* p2 = s2 + len2 - 1; 354 return len1 > len2; 364 size_t len2) 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/libsanitizer/sanitizer_common/ |
H A D | sanitizer_libc.cc | 193 uptr len2 = internal_strlen(needle); local 194 if (len1 < len2) return 0; 195 for (uptr pos = 0; pos <= len1 - len2; pos++) { 196 if (internal_memcmp(haystack + pos, needle, len2) == 0)
|
/haiku-buildtools/legacy/gcc/libio/ |
H A D | editbuf.cc | 672 int len1, len2; local 678 len2 = 0; 684 len2 = end->ptr(buffer) - start2; 686 new_str = (char*)malloc(len1 + len2 + 1); 688 if (len2 > 0) memcpy(new_str + len1, start2, len2); 689 new_str[len1+len2] = '\0'; 690 *lenp = len1+len2;
|
/haiku-buildtools/legacy/gcc/gcc/config/winnt/ |
H A D | fixinc-nt.c | 234 int len2 = strlen (s2); local 235 char *result = malloc (len1 + len2 + 1); 239 *(result + len1 + len2) = 0;
|
H A D | ld.c | 333 int len2 = strlen (s2); local 334 char *result = malloc (len1 + len2 + 1); 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); 153 strcpy (result + len1 + len2, s3); 154 *(result + len1 + len2 + len3) = 0; 1104 menu_line_lessp (line1, len1, line2, len2) 1108 int len2; 1110 int minlen = (len1 < len2 ? len1 : len2); 1137 menu_line_equal (line1, len1, line2, len2) 1141 int len2; 146 int len1 = strlen (s1), len2 = strlen (s2), len3 = strlen (s3); local [all...] |