There's no reason to preserve the incoming order of the
heads we're requested to fetch. By having them sorted, we
can replace some of the quadratic algorithms with linear
ones.
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
return ret;
}
+static int compare_heads(const void *a, const void *b)
+{
+ return strcmp(*(const char **)a, *(const char **)b);
+}
+
struct ref *fetch_pack(struct fetch_pack_args *my_args,
int fd[], struct child_process *conn,
const struct ref *ref,
st.st_mtime = 0;
}
- if (heads && nr_heads)
+ if (heads && nr_heads) {
nr_heads = remove_duplicates(nr_heads, heads);
+ qsort(heads, nr_heads, sizeof(*heads), compare_heads);
+ }
+
if (!ref) {
packet_flush(fd[1]);
die("no matching remote head");