From 01cae0a58790fa05b7671394de6beb3fb359587d Mon Sep 17 00:00:00 2001 From: Egor00f Date: Sun, 22 Feb 2026 14:37:41 +0500 Subject: [PATCH] libc.obj: malloc_test: use fprintf(stderr, ... https://git.kolibrios.org/KolibriOS/kolibrios/pulls/311#issuecomment-4213 --- .../develop/ktcc/trunk/libc.obj/samples/malloc_test.c | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) diff --git a/programs/develop/ktcc/trunk/libc.obj/samples/malloc_test.c b/programs/develop/ktcc/trunk/libc.obj/samples/malloc_test.c index d2f2bfce1..ef53d4a5c 100644 --- a/programs/develop/ktcc/trunk/libc.obj/samples/malloc_test.c +++ b/programs/develop/ktcc/trunk/libc.obj/samples/malloc_test.c @@ -9,7 +9,7 @@ if (func()) { \ printf("[SUCCESS]\tTest %s is ok.\n\n", #func); \ } else { \ - printf("[FAIL]\tTest %s failed.\n\n", #func); \ + fprintf(stderr, "[FAIL]\tTest %s failed.\n\n", #func); \ exit(EXIT_FAILURE); \ } @@ -44,17 +44,17 @@ bool test_malloc_multiple_allocations() for (int j = 1; j < sizeof(ptr) / sizeof(*ptr); j++) { if (i != j) { if (ptr[i] == ptr[j]) { - printf("ptrs[%d] == ptrs[%d].\n", i, j); + fprintf(stderr, "ptrs[%d] == ptrs[%d].\n", i, j); return false; } else if (IN_RANGE( (char*)GET_MEM_NODE_HEADER(ptr[i]) + GET_MEM_NODE_HEADER(ptr[i])->size, (char*)GET_MEM_NODE_HEADER(ptr[i]), (char*)GET_MEM_NODE_HEADER(ptr[j]), GET_MEM_NODE_HEADER(ptr[j])->size)) { - printf("node %p in node %p", GET_MEM_NODE_HEADER(ptr[i]), GET_MEM_NODE_HEADER(ptr[j])); + fprintf(stderr, "node %p in node %p", GET_MEM_NODE_HEADER(ptr[i]), GET_MEM_NODE_HEADER(ptr[j])); // additional info, may help with debug - printf("node %p\n size:%p\n free:%p\n next: %p\n last: %p\n", GET_MEM_NODE_HEADER(ptr[i]), GET_MEM_NODE_HEADER(ptr[i])->size, GET_MEM_NODE_HEADER(ptr[i])->free, GET_MEM_NODE_HEADER(ptr[i])->next, GET_MEM_NODE_HEADER(ptr[i])->last); - printf("node %p\n size:%p\n free:%p\n next: %p\n last: %p\n", GET_MEM_NODE_HEADER(ptr[j]), GET_MEM_NODE_HEADER(ptr[j])->size, GET_MEM_NODE_HEADER(ptr[j])->free, GET_MEM_NODE_HEADER(ptr[j])->next, GET_MEM_NODE_HEADER(ptr[j])->last); + fprintf(stderr, "node %p\n size:%p\n free:%p\n next: %p\n last: %p\n", GET_MEM_NODE_HEADER(ptr[i]), GET_MEM_NODE_HEADER(ptr[i])->size, GET_MEM_NODE_HEADER(ptr[i])->free, GET_MEM_NODE_HEADER(ptr[i])->next, GET_MEM_NODE_HEADER(ptr[i])->last); + fprintf(stderr, "node %p\n size:%p\n free:%p\n next: %p\n last: %p\n", GET_MEM_NODE_HEADER(ptr[j]), GET_MEM_NODE_HEADER(ptr[j])->size, GET_MEM_NODE_HEADER(ptr[j])->free, GET_MEM_NODE_HEADER(ptr[j])->next, GET_MEM_NODE_HEADER(ptr[j])->last); exit(EXIT_FAILURE); } }