Lines Matching refs:end
73 if (in1->start <= in2->end && in2->start <= in1->end)
80 output->end = MAX(in1->end, in2->end);
91 const char *end,
101 while (curr < end && *curr != '\n')
131 (SVN_IS_VALID_REVNUM((range)->start) && ((range)->start < (range)->end))
165 if (!(r1->start <= r2->end && r2->start <= r1->end))
167 else if (r1->start == r2->start && r1->end == r2->end)
169 else if (r1->end == r2->start || r2->end == r1->start)
171 else if (r1->start <= r2->start && r1->end >= r2->end)
173 else if (r2->start <= r1->start && r2->end >= r1->end)
328 the other. We'll end up pusing two new ranges onto
352 r2->start = r1->end;
354 r1->end = r2->start;
380 if (r2->start < r1->start || r2->end > r1->end)
392 r1->end = MAX(r1->end, r2->end);
399 /* *LASTRANGE and NEW_RANGE share an end point. */
400 tmp_revnum = r1->end;
401 r1->end = r2->end;
404 r2->start = r1->end;
405 r2->end = tmp_revnum;
407 else if (r1->end == r2->end)
409 /* *LASTRANGE and NEW_RANGE share an end point. */
410 r1->end = r2->start;
416 nor end points. */
418 r3->start = r2->end;
419 r3->end = r1->end;
422 r1->end = r2->start;
469 if (range->start == range->end - 1)
470 *s = apr_psprintf(pool, "%ld%s", range->end, mark);
471 else if (range->start - 1 == range->end)
473 else if (range->start < range->end)
474 *s = apr_psprintf(pool, "%ld-%ld%s", range->start + 1, range->end, mark);
475 else if (range->start > range->end)
476 *s = apr_psprintf(pool, "%ld-%ld%s", range->start, range->end + 1, mark);
480 _("bad range {start=%ld,end=%ld,inheritable=%d}"),
481 range->start, range->end, range->inheritable);
499 s = apr_psprintf(pool, _("bad range {start=%ld,end=%ld,inheritable=%d}"),
500 range->start, range->end, range->inheritable);
516 parse_rangelist(const char **input, const char *end,
523 while (curr < end && *curr != '\n' && isspace(*curr))
526 if (*curr == '\n' || curr == end)
533 while (curr < end && *curr != '\n')
541 && curr != end)
546 mrange->end = firstrev;
568 "'%ld-%ld' with same start and end "
570 mrange->end = secondrev;
573 if (*curr == '\n' || curr == end)
588 if (*curr == ',' || *curr == '\n' || curr == end)
645 if (ranges[i]->start >= ranges[i]->end)
652 if (ranges[i]->end > ranges[i + 1]->start)
654 else if (ranges[i]->end == ranges[i+1]->start
683 if (lastrange->start <= range->end
684 && range->start <= lastrange->end)
690 if (range->start < lastrange->end
708 lastrange->end = MAX(range->end, lastrange->end);
725 parse_revision_line(const char **input, const char *end, svn_mergeinfo_t hash,
734 SVN_ERR(parse_pathname(input, end, &pathname, scratch_pool));
742 SVN_ERR(parse_rangelist(input, end, rangelist, scratch_pool));
748 if (*input != end && *(*input) != '\n')
750 _("Could not find end of line in range list line "
753 if (*input != end)
786 parse_top(const char **input, const char *end, svn_mergeinfo_t hash,
791 while (*input < end)
794 SVN_ERR(parse_revision_line(input, end, hash, iterpool));
862 svn_revnum_t start, end;
878 * Return the iterator, or NULL if the iteration has reached its end.
894 ? APR_ARRAY_IDX(it->rl, it->i - 1, svn_merge_range_t *)->end
896 it->interval.end = range->start;
902 it->interval.end = range->end;
910 * Return IT, or return NULL at the end of iteration. */
939 while ((it = rlii_update(it)) && it->interval.start == it->interval.end)
949 * (RL[0]->start, MI_* RL[0]->end), // i=0, in_range
950 * (RL[0]->end, MI_NONE, RL[1]->start),
951 * (RL[1]->start, MI_* RL[1]->end),
953 * (RL[n-2]->end, MI_NONE, RL[n-1]->start),
954 * (RL[n-1]->start, MI_* RL[n-1]->end),
956 * Return IT, or return NULL at the end of iteration. */
963 while ((it = rlii_update(it)) && it->interval.start == it->interval.end)
999 mrange->end = b->accu_interval.end;
1010 SVN_ERR_ASSERT_NO_RETURN(interval->start < interval->end);
1011 SVN_ERR_ASSERT_NO_RETURN(interval->start == b->accu_interval.end);
1013 /* Extend the accumulating interval, or end it and start another? */
1016 b->accu_interval.end = interval->end;
1054 /* Keep choosing the next input revision (whether a start or end of a range)
1058 svn_revnum_t r_next = !it[1] ? it[0]->interval.end
1059 : !it[0] ? it[1]->interval.end
1060 : MIN(it[0]->interval.end, it[1]->interval.end);
1064 interval.end = r_next;
1070 SVN_ERR_ASSERT(interval.start < interval.end);
1074 if (it[0] && it[0]->interval.end <= r_next)
1076 if (it[1] && it[1]->interval.end <= r_next)
1079 r_last = interval.end;
1140 *result = (first->start + 1 <= second->end)
1141 && (second->start + 1 <= first->end)
1158 *result = (first->start <= second->start) && (second->end <= first->end)
1164 /* Swap start and end fields of RANGE. */
1169 range->start = range->end;
1170 range->end = swap;
1314 tmp_range.end = elt2->end;
1326 if (elt2->start == elt1->start && elt2->end == elt1->end)
1340 tmp_range.end = elt1->start;
1346 start and rangelist2 end. */
1348 tmp_range.end = MIN(elt2->end, elt1->end);
1362 if (elt2->end > elt1->end)
1370 tmp_range.end = elt1->end;
1381 working_elt2.start = elt1->end;
1382 working_elt2.end = elt2->end;
1421 /* Copy the current rangelist2 element if we didn't hit the end
1675 || lrange->end != rrange->end)
1874 /* Handle the elements that need commas at the end. */
2021 svn_revnum_t end,
2040 start, end, inheritable,
2061 svn_revnum_t end,
2071 || !SVN_IS_VALID_REVNUM(end)
2072 || end < start)
2093 svn_rangelist__initialize(start, end, inheritable, scratch_pool);
2264 assert(SVN_IS_VALID_REVNUM(range->end));
2265 assert(range->start != range->end);
2267 if (range->start < range->end)
2268 return rev > range->start && rev <= range->end;
2270 return rev > range->end && rev <= range->start;
2354 || (range->end > *youngest_rev))
2355 *youngest_rev = range->end;
2476 if (range->start + offset > 0 && range->end + offset > 0)
2479 range->end = range->end + offset;
2522 svn_revnum_t end,
2531 range->end = end;
2577 range->end = segment->range_end;