diff options
| author |  Junio C Hamano <gitster@pobox.com> | 2016-10-10 14:03:46 -0700 |
|---|---|---|
| committer | Junio C Hamano <gitster@pobox.com> | 2016-10-10 14:03:46 -0700 |
| commit | b8688adb12d086b161aa7c369126bdd56843a01b (patch) | |
| tree | c1d649861b902b5d72dcd8a0d3d970a2294bf5ef /line-log.c | |
| parent | Eighth batch for 2.11 (diff) | |
| parent | show-branch: use QSORT (diff) | |
| download | tgif-b8688adb12d086b161aa7c369126bdd56843a01b.tar.xz | |
Merge branch 'rs/qsort'
We call "qsort(array, nelem, sizeof(array[0]), fn)", and most of
the time third parameter is redundant. A new QSORT() macro lets us
omit it.
* rs/qsort:
show-branch: use QSORT
use QSORT, part 2
coccicheck: use --all-includes by default
remove unnecessary check before QSORT
use QSORT
add QSORT
Diffstat (limited to 'line-log.c')
| -rw-r--r-- | line-log.c | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/line-log.c b/line-log.c index 916e724870..65f3558b3b 100644 --- a/line-log.c +++ b/line-log.c @@ -113,7 +113,7 @@ void sort_and_merge_range_set(struct range_set *rs) int i; int o = 0; /* output cursor */ - qsort(rs->ranges, rs->nr, sizeof(struct range), range_cmp); + QSORT(rs->ranges, rs->nr, range_cmp); for (i = 0; i < rs->nr; i++) { if (rs->ranges[i].start == rs->ranges[i].end) |