summaryrefslogtreecommitdiff
path: root/commit.c
diff options
context:
space:
mode:
authorJunio C Hamano <gitster@pobox.com>2012-04-17 11:07:01 -0700
committerJunio C Hamano <gitster@pobox.com>2012-04-17 11:07:01 -0700
commit7365c95d2d67cbbb74c2040918d2ecde06231d93 (patch)
tree59eeaaaf0a202c7860d784643e86bd9fb32cb52c /commit.c
parentfbc08ea177f8284d10c62ad39de51edb21af88b0 (diff)
downloadgit-7365c95d2d67cbbb74c2040918d2ecde06231d93.tar.gz
mergesort: rename it to llist_mergesort()
Even though the function is generic enough, <anything>sort() inherits connotations from the standard function qsort() that sorts an array. Rename it to llist_mergesort() and describe the external interface in its header file. This incidentally avoids name clashes with mergesort() some platforms declare in, and contaminate user namespace with, their <stdlib.h>. Reported-by: Brian Gernhardt Signed-off-by: Junio C Hamano <gitster@pobox.com>
Diffstat (limited to 'commit.c')
-rw-r--r--commit.c4
1 files changed, 2 insertions, 2 deletions
diff --git a/commit.c b/commit.c
index 0759b2ca65..84304c00ff 100644
--- a/commit.c
+++ b/commit.c
@@ -429,8 +429,8 @@ static void commit_list_set_next(void *a, void *next)
void commit_list_sort_by_date(struct commit_list **list)
{
- *list = mergesort(*list, commit_list_get_next, commit_list_set_next,
- commit_list_compare_by_date);
+ *list = llist_mergesort(*list, commit_list_get_next, commit_list_set_next,
+ commit_list_compare_by_date);
}
struct commit *pop_most_recent_commit(struct commit_list **list,