aboutsummaryrefslogtreecommitdiffstats
path: root/diffcore-order.c
diff options
context:
space:
mode:
authorJunio C Hamano <gitster@pobox.com>2016-10-10 14:03:46 -0700
committerJunio C Hamano <gitster@pobox.com>2016-10-10 14:03:46 -0700
commitb8688adb12d086b161aa7c369126bdd56843a01b (patch)
treec1d649861b902b5d72dcd8a0d3d970a2294bf5ef /diffcore-order.c
parentEighth batch for 2.11 (diff)
parentshow-branch: use QSORT (diff)
downloadgit-b8688adb12d086b161aa7c369126bdd56843a01b.tar.gz
git-b8688adb12d086b161aa7c369126bdd56843a01b.zip
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 'diffcore-order.c')
-rw-r--r--diffcore-order.c2
1 files changed, 1 insertions, 1 deletions
diff --git a/diffcore-order.c b/diffcore-order.c
index 69d41f7a57..1957f822a5 100644
--- a/diffcore-order.c
+++ b/diffcore-order.c
@@ -101,7 +101,7 @@ void order_objects(const char *orderfile, obj_path_fn_t obj_path,
objs[i].orig_order = i;
objs[i].order = match_order(obj_path(objs[i].obj));
}
- qsort(objs, nr, sizeof(*objs), compare_objs_order);
+ QSORT(objs, nr, compare_objs_order);
}
static const char *pair_pathtwo(void *obj)