/src/libzip/lib/zip_realloc.c
Line | Count | Source (jump to first uncovered line) |
1 | | /* |
2 | | zip_realloc.c -- reallocate with additional elements |
3 | | Copyright (C) 2009-2025 Dieter Baron and Thomas Klausner |
4 | | |
5 | | This file is part of libzip, a library to manipulate ZIP archives. |
6 | | The authors can be contacted at <info@libzip.org> |
7 | | |
8 | | Redistribution and use in source and binary forms, with or without |
9 | | modification, are permitted provided that the following conditions |
10 | | are met: |
11 | | 1. Redistributions of source code must retain the above copyright |
12 | | notice, this list of conditions and the following disclaimer. |
13 | | 2. Redistributions in binary form must reproduce the above copyright |
14 | | notice, this list of conditions and the following disclaimer in |
15 | | the documentation and/or other materials provided with the |
16 | | distribution. |
17 | | 3. The names of the authors may not be used to endorse or promote |
18 | | products derived from this software without specific prior |
19 | | written permission. |
20 | | |
21 | | THIS SOFTWARE IS PROVIDED BY THE AUTHORS ``AS IS'' AND ANY EXPRESS |
22 | | OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
23 | | WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
24 | | ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY |
25 | | DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
26 | | DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE |
27 | | GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
28 | | INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER |
29 | | IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR |
30 | | OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN |
31 | | IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
32 | | */ |
33 | | |
34 | | #include <stdlib.h> |
35 | | |
36 | | #include "zipint.h" |
37 | | |
38 | 19.2k | bool zip_realloc(void **memory, zip_uint64_t *alloced_elements, zip_uint64_t element_size, zip_uint64_t additional_elements, zip_error_t *error) { |
39 | 19.2k | zip_uint64_t new_alloced_elements; |
40 | 19.2k | void *new_memory; |
41 | | |
42 | 19.2k | if (additional_elements == 0) { |
43 | 0 | return true; |
44 | 0 | } |
45 | | |
46 | 19.2k | new_alloced_elements = *alloced_elements + additional_elements; |
47 | | |
48 | 19.2k | if (new_alloced_elements < additional_elements || new_alloced_elements > SIZE_MAX / element_size) { |
49 | 0 | zip_error_set(error, ZIP_ER_MEMORY, 0); |
50 | 0 | return false; |
51 | 0 | } |
52 | | |
53 | 19.2k | if ((new_memory = realloc(*memory, (size_t)(new_alloced_elements * element_size))) == NULL) { |
54 | 0 | zip_error_set(error, ZIP_ER_MEMORY, 0); |
55 | 0 | return false; |
56 | 0 | } |
57 | | |
58 | 19.2k | *memory = new_memory; |
59 | 19.2k | *alloced_elements = new_alloced_elements; |
60 | | |
61 | 19.2k | return true; |
62 | 19.2k | } |