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 /refs | |
| 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 'refs')
| -rw-r--r-- | refs/files-backend.c | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/refs/files-backend.c b/refs/files-backend.c index 0709f60b8e..d16feb19c5 100644 --- a/refs/files-backend.c +++ b/refs/files-backend.c @@ -501,7 +501,7 @@ static void sort_ref_dir(struct ref_dir *dir) if (dir->sorted == dir->nr) return; - qsort(dir->entries, dir->nr, sizeof(*dir->entries), ref_entry_cmp); + QSORT(dir->entries, dir->nr, ref_entry_cmp); /* Remove any duplicates: */ for (i = 0, j = 0; j < dir->nr; j++) { |