/src/libxml2/include/private/memory.h
Line | Count | Source |
1 | | #ifndef XML_MEMORY_H_PRIVATE__ |
2 | | #define XML_MEMORY_H_PRIVATE__ |
3 | | |
4 | | #include "../../libxml.h" |
5 | | |
6 | | #include <limits.h> |
7 | | #include <stddef.h> |
8 | | |
9 | | #ifndef SIZE_MAX |
10 | | #define SIZE_MAX ((size_t) -1) |
11 | | #endif |
12 | | |
13 | 6.57M | #define XML_MAX_ITEMS 1000000000 /* 1 billion */ |
14 | | |
15 | | XML_HIDDEN void |
16 | | xmlInitMemoryInternal(void); |
17 | | XML_HIDDEN void |
18 | | xmlCleanupMemoryInternal(void); |
19 | | |
20 | | /** |
21 | | * @array: pointer to array |
22 | | * @capacity: pointer to capacity (in/out) |
23 | | * @elemSize: size of an element in bytes |
24 | | * @min: elements in initial allocation |
25 | | * @max: maximum elements in the array |
26 | | * |
27 | | * Grow an array by at least one element, checking for overflow. |
28 | | * |
29 | | * Returns the new array size on success, -1 on failure. |
30 | | */ |
31 | | static XML_INLINE int |
32 | 236k | xmlGrowCapacity(int capacity, size_t elemSize, int min, int max) { |
33 | 236k | int extra; |
34 | | |
35 | 236k | if (capacity <= 0) { |
36 | 15.9k | #ifdef FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION |
37 | 15.9k | (void) min; |
38 | 15.9k | return(1); |
39 | | #else |
40 | | return(min); |
41 | | #endif |
42 | 15.9k | } |
43 | | |
44 | 220k | if ((capacity >= max) || |
45 | 220k | ((size_t) capacity > SIZE_MAX / 2 / elemSize)) |
46 | 199 | return(-1); |
47 | | |
48 | | /* Grow by 50% */ |
49 | 220k | extra = (capacity + 1) / 2; |
50 | | |
51 | 220k | if (capacity > max - extra) |
52 | 309 | return(max); |
53 | | |
54 | 219k | return(capacity + extra); |
55 | 220k | } Line | Count | Source | 32 | 229k | xmlGrowCapacity(int capacity, size_t elemSize, int min, int max) { | 33 | 229k | int extra; | 34 | | | 35 | 229k | if (capacity <= 0) { | 36 | 15.9k | #ifdef FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION | 37 | 15.9k | (void) min; | 38 | 15.9k | return(1); | 39 | | #else | 40 | | return(min); | 41 | | #endif | 42 | 15.9k | } | 43 | | | 44 | 213k | if ((capacity >= max) || | 45 | 213k | ((size_t) capacity > SIZE_MAX / 2 / elemSize)) | 46 | 199 | return(-1); | 47 | | | 48 | | /* Grow by 50% */ | 49 | 213k | extra = (capacity + 1) / 2; | 50 | | | 51 | 213k | if (capacity > max - extra) | 52 | 309 | return(max); | 53 | | | 54 | 213k | return(capacity + extra); | 55 | 213k | } |
Unexecuted instantiation: parserInternals.c:xmlGrowCapacity Unexecuted instantiation: threads.c:xmlGrowCapacity Unexecuted instantiation: tree.c:xmlGrowCapacity Line | Count | Source | 32 | 6.31k | xmlGrowCapacity(int capacity, size_t elemSize, int min, int max) { | 33 | 6.31k | int extra; | 34 | | | 35 | 6.31k | if (capacity <= 0) { | 36 | 0 | #ifdef FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION | 37 | 0 | (void) min; | 38 | 0 | return(1); | 39 | | #else | 40 | | return(min); | 41 | | #endif | 42 | 0 | } | 43 | | | 44 | 6.31k | if ((capacity >= max) || | 45 | 6.31k | ((size_t) capacity > SIZE_MAX / 2 / elemSize)) | 46 | 0 | return(-1); | 47 | | | 48 | | /* Grow by 50% */ | 49 | 6.31k | extra = (capacity + 1) / 2; | 50 | | | 51 | 6.31k | if (capacity > max - extra) | 52 | 0 | return(max); | 53 | | | 54 | 6.31k | return(capacity + extra); | 55 | 6.31k | } |
Unexecuted instantiation: valid.c:xmlGrowCapacity Unexecuted instantiation: xmlmemory.c:xmlGrowCapacity Unexecuted instantiation: catalog.c:xmlGrowCapacity Unexecuted instantiation: HTMLparser.c:xmlGrowCapacity Unexecuted instantiation: xmlregexp.c:xmlGrowCapacity Unexecuted instantiation: xmlschemas.c:xmlGrowCapacity Unexecuted instantiation: xpath.c:xmlGrowCapacity Unexecuted instantiation: encoding.c:xmlGrowCapacity Unexecuted instantiation: pattern.c:xmlGrowCapacity Unexecuted instantiation: xmlreader.c:xmlGrowCapacity Unexecuted instantiation: xinclude.c:xmlGrowCapacity |
56 | | |
57 | | #endif /* XML_MEMORY_H_PRIVATE__ */ |