Lines Matching +defs:file +defs:start

30     UV start, end;
35     while (invlist_iternext(invlist, &start, &end)) {
36         assert(start >= offset);
38         for (UV i = start; i <= end; i++) {
59             int start = i++;
68                                              start + offset,
77  * this file.  An inversion list is here implemented as a malloc'd C UV array
357      * of the list proper, so start it just after them */
383                                  const UV start, const UV end)
385    /* Subject to change or removal.  Append the range from 'start' to 'end' at
397         offset = start != 0;
409         if (   array[final_element] > start
412             Perl_croak(aTHX_ "panic: attempting to append to an inversion list, but wasn't at the end of the list, final=%" UVuf ", start=%" UVuf ", match=%c",
413                      array[final_element], start,
422         if (array[final_element] == start) {
438     len += 2;   /* Includes an element each for the start and end of range */
456     array[len - 2] = start;
594      * The count is incremented when we start a range that's in an input's set,
595      * and decremented when we start a range that's not in a set.  So this
875      * to/from 2.  The count is incremented when we start a range that's in an
876      * input's set, and decremented when we start a range that's not in a set.
1077 Perl__add_range_to_invlist(pTHX_ SV* invlist, UV start, UV end)
1079     /* Add the range from 'start' to 'end' inclusive to the inversion list's
1094     SSize_t i_s;            /* index into the invlist array where 'start'
1103         _append_range_to_invlist(invlist, start, end);
1110         _append_range_to_invlist(invlist, start, end);
1122         if (start > cur_highest) {
1123             _append_range_to_invlist(invlist, start, end);
1147     if (start < array[0]) {
1152         if (UNLIKELY(start == 0)) {
1156             _append_range_to_invlist(range_invlist, start, end);
1174         array[0] = start;
1182             *     invlist[i_s] <= start < array[i_s+1]
1184         i_s = _invlist_search(invlist, start);
1197         i_e = (start == end)
1212          * ends at or above that range's start */
1218         if (start == array[i_s]) {
1254             start = array[i_s];
1265             array[i_s] = start;
1269     /* Here, we've dealt with the new range start extending any adjoining
1291             array[i_e] = start;
1293         else if (start <= array[i_e]) {
1318         array[i_e+1] = start;
1420 Perl__invlist_dump(pTHX_ PerlIO *file, I32 level,
1424      * inversion list 'invlist' to 'file' at 'level'  Each line is prefixed by
1437     UV start, end;
1443         Perl_dump_indent(aTHX_ level, file,
1450     while (invlist_iternext(invlist, &start, &end)) {
1452             Perl_dump_indent(aTHX_ level, file,
1454                                    indent, (UV)count, start);
1456         else if (end != start) {
1457             Perl_dump_indent(aTHX_ level, file,
1459                                 indent, (UV)count, start,         end);
1462             Perl_dump_indent(aTHX_ level, file, "%s[%" UVuf "] 0x%04" UVXf "\n",
1463                                             indent, (UV)count, start);