diff options
| author | 2026-09-27 15:06:22 +0900 | |
|---|---|---|
| committer | 2026-09-27 15:06:22 +0900 | |
| commit | 8b48fa72d359de89215f50cbf6ac8c77ae5de9b4 (patch) | |
| tree | 07c02aa1437e53e0994ef0ec89edf752c4b309a8 /src/ptrarray.h | |
| parent | 32428abacb909988e8e960a8845a6430b17b6a60 (diff) | |
| download | libplist-8b48fa72d359de89215f50cbf6ac8c77ae5de9b4.tar.gz libplist-8b48fa72d359de89215f50cbf6ac8c77ae5de9b4.tar.bz2 | |
ptrarray: Handle realloc() failure in ptr_array_insert()
ptr_array_insert() assigned the result of realloc() directly to
pa->pdata and bumped the capacity without checking for failure, so on
out-of-memory the old buffer was leaked and the following store or
memmove() wrote through a NULL pointer.
Keep the old buffer on failure and return -1 from ptr_array_insert()
and ptr_array_add(). The callers now handle the error:
- the array lookup cache (plist.c) is dropped instead of silently going
out of sync with the node list; lookups then fall back to walking
the children, as they do before the cache exists
- bplist parsing (used_indexes) and serialization (objects) return
PLIST_ERR_NO_MEM; ignoring the error in parse_bin_node_at_index()
would otherwise loop forever since the array never grows
Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Diffstat (limited to 'src/ptrarray.h')
| -rw-r--r-- | src/ptrarray.h | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/src/ptrarray.h b/src/ptrarray.h index ed67351..28a521f 100644 --- a/src/ptrarray.h +++ b/src/ptrarray.h @@ -31,8 +31,8 @@ typedef struct ptrarray_t { ptrarray_t *ptr_array_new(int capacity); void ptr_array_free(ptrarray_t *pa); -void ptr_array_add(ptrarray_t *pa, void *data); -void ptr_array_insert(ptrarray_t *pa, void *data, long index); +int ptr_array_add(ptrarray_t *pa, void *data); +int ptr_array_insert(ptrarray_t *pa, void *data, long index); void ptr_array_remove(ptrarray_t *pa, long index); void ptr_array_set(ptrarray_t *pa, void *data, long index); void* ptr_array_index(ptrarray_t *pa, long index); |
