зеркало из https://github.com/microsoft/git.git
use QSORT, part 2
Convert two more qsort(3) calls to QSORT to reduce code size and for better safety and consistency. Signed-off-by: Rene Scharfe <l.s.r@web.de> Signed-off-by: Junio C Hamano <gitster@pobox.com>
This commit is contained in:
Родитель
a9a884aea5
Коммит
1b5294de40
|
@ -1531,8 +1531,7 @@ static void read_v2_anomalous_offsets(struct packed_git *p,
|
|||
opts->anomaly[opts->anomaly_nr++] = ntohl(idx2[off * 2 + 1]);
|
||||
}
|
||||
|
||||
if (1 < opts->anomaly_nr)
|
||||
qsort(opts->anomaly, opts->anomaly_nr, sizeof(uint32_t), cmp_uint32);
|
||||
QSORT(opts->anomaly, opts->anomaly_nr, cmp_uint32);
|
||||
}
|
||||
|
||||
static void read_idx_option(struct pack_idx_option *opts, const char *pack_name)
|
||||
|
|
|
@ -308,7 +308,7 @@ void shortlog_output(struct shortlog *log)
|
|||
struct strbuf sb = STRBUF_INIT;
|
||||
|
||||
if (log->sort_by_number)
|
||||
qsort(log->list.items, log->list.nr, sizeof(struct string_list_item),
|
||||
QSORT(log->list.items, log->list.nr,
|
||||
log->summary ? compare_by_counter : compare_by_list);
|
||||
for (i = 0; i < log->list.nr; i++) {
|
||||
const struct string_list_item *item = &log->list.items[i];
|
||||
|
|
Загрузка…
Ссылка в новой задаче