| /haiku-buildtools/legacy/gcc/gcc/config/rs6000/ |
| H A D | sol-c0.c | 44 char *range_end; member in struct:ex_shared1
|
| /haiku-buildtools/gcc/libsanitizer/sanitizer_common/ |
| H A D | sanitizer_posix.cc | 232 bool MemoryRangeIsAvailable(uptr range_start, uptr range_end) { argument
238 if (!IntervalsAreSeparate(start, end, range_start, range_end))
|
| H A D | sanitizer_win.cc | 132 bool MemoryRangeIsAvailable(uptr range_start, uptr range_end) { argument
|
| H A D | sanitizer_common.h | 63 bool MemoryRangeIsAvailable(uptr range_start, uptr range_end);
|
| /haiku-buildtools/legacy/binutils/libiberty/ |
| H A D | regex.c | 916 wchar_t range_end = *p++;
917 printf("%C-%C", range_start, range_end);
2684 charset[l+m+n+7] = range_end
2687 charset[l+m+n+2o+5] = range_end
2772 /* Allocate the space for range_start and range_end. */
2787 /* Allocate the space for range_start and range_end. */
4377 CHAR_T range_start, range_end;
4424 range_end = TRANSLATE (p[0]);
4428 && (range_start > range_end))? REG_ERANGE : REG_NOERROR;
4433 *(b - char_set[5] - 1) = range_end;
910 wchar_t range_end = *p++; local
4364 CHAR_T range_start, range_end; local
[all...] |
| /haiku-buildtools/gcc/libiberty/ |
| H A D | regex.c | 918 wchar_t range_end = *p++;
919 printf("%C-%C", range_start, range_end);
2686 charset[l+m+n+7] = range_end
2689 charset[l+m+n+2o+5] = range_end
2774 /* Allocate the space for range_start and range_end. */
2789 /* Allocate the space for range_start and range_end. */
4379 CHAR_T range_start, range_end;
4426 range_end = TRANSLATE (p[0]);
4430 && (range_start > range_end))? REG_ERANGE : REG_NOERROR;
4435 *(b - char_set[5] - 1) = range_end;
912 wchar_t range_end = *p++; local
4366 CHAR_T range_start, range_end; local
[all...] |
| /haiku-buildtools/binutils/libiberty/ |
| H A D | regex.c | 918 wchar_t range_end = *p++;
919 printf("%C-%C", range_start, range_end);
2687 charset[l+m+n+7] = range_end
2690 charset[l+m+n+2o+5] = range_end
2775 /* Allocate the space for range_start and range_end. */
2790 /* Allocate the space for range_start and range_end. */
4380 CHAR_T range_start, range_end;
4427 range_end = TRANSLATE (p[0]);
4431 && (range_start > range_end))? REG_ERANGE : REG_NOERROR;
4436 *(b - char_set[5] - 1) = range_end;
912 wchar_t range_end = *p++; local
4367 CHAR_T range_start, range_end; local
[all...] |
| /haiku-buildtools/binutils/gold/ |
| H A D | dwarf_reader.cc | 2160 std::vector<Offset_to_lineno_entry>::const_iterator range_end = it; local
2167 // equal_range [it, range_end) has a line_num != -1, it's a valid
2171 for (; it != range_end; ++it)
|
| /haiku-buildtools/legacy/gcc/gcc/fixinc/ |
| H A D | gnu-regex.c | 3088 unsigned int range_start, range_end;
3102 range_end = ((const unsigned char *) p)[0];
3109 if (range_start > range_end)
3113 char' -- the range is inclusive, so if `range_end' == 0xff
3116 for (this_char = range_start; this_char <= range_end; this_char++)
3074 unsigned int range_start, range_end; local
|
| /haiku-buildtools/gcc/gcc/c/ |
| H A D | c-typeck.c | 7108 tree range_end;
7823 push_range_stack (tree range_end, struct obstack * braced_init_obstack)
7836 p->range_end = range_end;
9174 !p->range_end || tree_int_cst_equal (p->index, p->range_end);
9186 if (tree_int_cst_equal (p->index, p->range_end) && !p->prev)
9193 if (finish && p->range_end && p->index == p->range_start)
9204 if (p->range_end && tree_int_cst_equal (p->index, p->range_end))
7081 tree range_end; member in struct:constructor_range_stack
7793 push_range_stack(tree range_end, struct obstack * braced_init_obstack) argument
[all...] |
| /haiku-buildtools/legacy/gcc/gcc/ |
| H A D | c-typeck.c | 5065 tree range_end;
5243 p->range_end = constructor_range_end;
5380 p->range_end = constructor_range_end;
5726 constructor_range_end = p->range_end;
5040 tree range_end; member in struct:constructor_stack
|
| /haiku-buildtools/binutils/bfd/ |
| H A D | xcofflink.c | 4684 bfd_vma range_start, range_end;
4695 range_end = range_start + *lineno_counts * linesz;
4702 && iisp->n_value < range_end)
4672 bfd_vma range_start, range_end; local
|