diff options
| author | Junio C Hamano <gitster@pobox.com> | 2016-10-11 00:03:46 +0300 |
|---|---|---|
| committer | Junio C Hamano <gitster@pobox.com> | 2016-10-11 00:03:46 +0300 |
| commit | b8688adb12d086b161aa7c369126bdd56843a01b (patch) | |
| tree | c1d649861b902b5d72dcd8a0d3d970a2294bf5ef /ref-filter.c | |
| parent | a23ca1b8dc42ffd4de2ef30d67ce1e21ded29886 (diff) | |
| parent | 7e65c75c31de751f58945a22e91e120c10ab6e87 (diff) | |
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 'ref-filter.c')
| -rw-r--r-- | ref-filter.c | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/ref-filter.c b/ref-filter.c index 9a8f55e45a..d4c2931f3a 100644 --- a/ref-filter.c +++ b/ref-filter.c @@ -1573,7 +1573,7 @@ static int compare_refs(const void *a_, const void *b_) void ref_array_sort(struct ref_sorting *sorting, struct ref_array *array) { ref_sorting = sorting; - qsort(array->items, array->nr, sizeof(struct ref_array_item *), compare_refs); + QSORT(array->items, array->nr, compare_refs); } static void append_literal(const char *cp, const char *ep, struct ref_formatting_state *state) |