From 8d3043dcec8ba0244d49d553a900c83425fb2bf4 Mon Sep 17 00:00:00 2001 From: Michael Chirico Date: Thu, 19 Dec 2024 22:07:04 -0800 Subject: [PATCH] fine, %lu --- src/forder.c | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/forder.c b/src/forder.c index 0d5c88eca..0630195a3 100644 --- a/src/forder.c +++ b/src/forder.c @@ -953,7 +953,7 @@ void radix_i(int from, int to, int radix) { uint8_t *restrict my_key = key[radix]+from; // safe to write as we don't use this radix again uint8_t *o = (uint8_t *)malloc(my_n * sizeof(uint8_t)); if (!o) - STOP(_("Failed to allocate %u bytes for '%s'."), my_n * sizeof(uint8_t), "o"); // # nocov + STOP(_("Failed to allocate %lu bytes for '%s'."), my_n * sizeof(uint8_t), "o"); // # nocov // if last key (i.e. radix+1==nradix) there are no more keys to reorder so we could reorder osub by reference directly and save allocating and populating o just // to use it once. However, o's type is uint8_t so many moves within this max-256 vector should be faster than many moves in osub (4 byte or 8 byte ints) [1 byte // type is always aligned]