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 /builtin/mktree.c | |
| parent | add QSORT (diff) | |
| download | tgif-9ed0d8d6e6de7737fe9a658446318b86e57c6fad.tar.xz | |
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 'builtin/mktree.c')
| -rw-r--r-- | builtin/mktree.c | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/builtin/mktree.c b/builtin/mktree.c index 4282b62c59..de9b40fc63 100644 --- a/builtin/mktree.c +++ b/builtin/mktree.c @@ -46,7 +46,7 @@ static void write_tree(unsigned char *sha1) size_t size; int i; - qsort(entries, used, sizeof(*entries), ent_compare); + QSORT(entries, used, ent_compare); for (size = i = 0; i < used; i++) size += 32 + entries[i]->len; |