all: report size_used on incomplete dump()

Report bytes written on incomplete dump().

Co-Authored-By: Claude Opus 4.6 <noreply@anthropic.com>

Author: msune

CHANGELOG.md

@@ -25,6 +25,7 @@ Legend:
 - [B] str: fix uint32_t overflow in `cdada_str_erase()` bounds check
 - [B] str: fix `cdada_str_find_count()`/`cdada_str_find_all()` not returning `CDADA_E_NOT_FOUND`
 - [B] str: reject empty `substr` in `cdada_str_find_count()`/`cdada_str_find_all()`
+- [B] list/map/queue/set/stack: report `size_used` as bytes written on incomplete `dump()`
 - [O] tests: add coverage for `cdada_strerr()` valid, boundary and high invalid values
 - [O] tests: add `oom_create_test` coverage for create paths (`list`, `map`, `queue`, `set`, `stack`, `str`, `bbitmap`)
 - [O] tests: add coverage for `cdada_str_replace_all()` empty-match invalid input and self-overlap replacement

src/list.cc

@@ -1106,8 +1106,10 @@ int cdada_list_dump(cdada_list_t* list, uint32_t size, char* buffer,
 			return CDADA_SUCCESS;
 
 		snprintf(buffer, size, "%s", ss.str().c_str());
-		if(ss.str().length()+1 > size)
+		if(*size_used > size){
+			*size_used = size;
 			return CDADA_E_INCOMPLETE;
+		}
 	}catch(bad_alloc& e){
 		return CDADA_E_MEM;
 	}catch(...){

src/map.cc

@@ -901,8 +901,10 @@ int cdada_map_dump(cdada_map_t* map, uint32_t size, char* buffer,
 			return CDADA_SUCCESS;
 
 		snprintf(buffer, size, "%s", ss.str().c_str());
-		if(ss.str().length()+1 > size)
+		if(*size_used > size){
+			*size_used = size;
 			return CDADA_E_INCOMPLETE;
+		}
 	}catch(bad_alloc& e){
 		return CDADA_E_MEM;
 	}catch(...){

src/queue.cc

@@ -557,8 +557,10 @@ int cdada_queue_dump(cdada_queue_t* queue, uint32_t size, char* buffer,
 			return CDADA_SUCCESS;
 
 		snprintf(buffer, size, "%s", ss.str().c_str());
-		if(ss.str().length()+1 > size)
+		if(*size_used > size){
+			*size_used = size;
 			return CDADA_E_INCOMPLETE;
+		}
 	}catch(bad_alloc& e){
 		return CDADA_E_MEM;
 	}catch(...){

src/set.cc

@@ -820,8 +820,10 @@ int cdada_set_dump(cdada_set_t* set, uint32_t size, char* buffer,
 			return CDADA_SUCCESS;
 
 		snprintf(buffer, size, "%s", ss.str().c_str());
-		if(ss.str().length()+1 > size)
+		if(*size_used > size){
+			*size_used = size;
 			return CDADA_E_INCOMPLETE;
+		}
 	}catch(bad_alloc& e){
 		return CDADA_E_MEM;
 	}catch(...){

src/stack.cc

@@ -495,8 +495,10 @@ int cdada_stack_dump(cdada_stack_t* stack, uint32_t size, char* buffer,
 			return CDADA_SUCCESS;
 
 		snprintf(buffer, size, "%s", ss.str().c_str());
-		if(ss.str().length()+1 > size)
+		if(*size_used > size){
+			*size_used = size;
 			return CDADA_E_INCOMPLETE;
+		}
 	}catch(bad_alloc& e){
 		return CDADA_E_MEM;
 	}catch(...){

test/list_test.c

@@ -220,6 +220,7 @@ int test_u8_insert_removal(){
 	char buffer2[8];
 	rv = cdada_list_dump(list, 8, buffer2, &used);
 	TEST_ASSERT(rv == CDADA_E_INCOMPLETE);
+	TEST_ASSERT(used == 8);
 	fprintf(stdout, "%s\n", buffer2);
 
 	rv = cdada_list_first(list, &key);

test/map_test.c

@@ -772,6 +772,7 @@ int _test_u552_insert_removal_traverse(){
 	char buffer2[8];
 	rv = cdada_map_dump(map, 8, buffer2, &used);
 	TEST_ASSERT(rv == CDADA_E_INCOMPLETE);
+	TEST_ASSERT(used == 8);
 	fprintf(stdout, "%s\n", buffer2);
 
 	rv = cdada_map_first(map, &key, &tmp);

test/queue_test.c

@@ -173,6 +173,7 @@ int test_u8_push_pop(){
 	char buffer2[8];
 	rv = cdada_queue_dump(queue, 8, buffer2, &used);
 	TEST_ASSERT(rv == CDADA_E_INCOMPLETE);
+	TEST_ASSERT(used == 8);
 	fprintf(stdout, "%s\n", buffer2);
 
 	TEST_ASSERT(cdada_queue_size(queue) == 6);

test/set_test.c

@@ -109,6 +109,7 @@ int test_u8_insert_removal(){
 	char buffer2[8];
 	rv = cdada_set_dump(set, 8, buffer2, &used);
 	TEST_ASSERT(rv == CDADA_E_INCOMPLETE);
+	TEST_ASSERT(used == 8);
 	fprintf(stdout, "%s\n", buffer2);
 
 	rv = cdada_set_first(set, &key);