diff options
| author | René Scharfe <l.s.r@web.de> | 2016-09-29 17:27:31 +0200 |
|---|---|---|
| committer | Junio C Hamano <gitster@pobox.com> | 2016-09-29 15:42:18 -0700 |
| commit | 9ed0d8d6e6de7737fe9a658446318b86e57c6fad (patch) | |
| tree | 82fdefc7bd543c99091f5b634947360f75100deb /line-log.c | |
| parent | dbc540c7a5827529a3f58befc9e5b81a31ec8fab (diff) | |
| download | git-9ed0d8d6e6de7737fe9a658446318b86e57c6fad.tar.gz | |
use QSORT
Apply the semantic patch contrib/coccinelle/qsort.cocci to the code
base, replacing calls of qsort(3) with QSORT. The resulting code is
shorter and supports empty arrays with NULL pointers.
Signed-off-by: Rene Scharfe <l.s.r@web.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
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) |