BadVPN – Blame information for rev 1
?pathlinks?
Rev | Author | Line No. | Line |
---|---|---|---|
1 | office | 1 | /** |
2 | * @file exparray.h |
||
3 | * @author Ambroz Bizjak <ambrop7@gmail.com> |
||
4 | * |
||
5 | * @section LICENSE |
||
6 | * |
||
7 | * Redistribution and use in source and binary forms, with or without |
||
8 | * modification, are permitted provided that the following conditions are met: |
||
9 | * 1. Redistributions of source code must retain the above copyright |
||
10 | * notice, this list of conditions and the following disclaimer. |
||
11 | * 2. Redistributions in binary form must reproduce the above copyright |
||
12 | * notice, this list of conditions and the following disclaimer in the |
||
13 | * documentation and/or other materials provided with the distribution. |
||
14 | * 3. Neither the name of the author nor the |
||
15 | * names of its contributors may be used to endorse or promote products |
||
16 | * derived from this software without specific prior written permission. |
||
17 | * |
||
18 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND |
||
19 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
||
20 | * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
||
21 | * DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY |
||
22 | * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
||
23 | * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; |
||
24 | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND |
||
25 | * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
||
26 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS |
||
27 | * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
||
28 | * |
||
29 | * @section DESCRIPTION |
||
30 | * |
||
31 | * Dynamic array which grows exponentionally on demand. |
||
32 | */ |
||
33 | |||
34 | #ifndef BADVPN_MISC_EXPARRAY_H |
||
35 | #define BADVPN_MISC_EXPARRAY_H |
||
36 | |||
37 | #include <stddef.h> |
||
38 | #include <stdlib.h> |
||
39 | #include <limits.h> |
||
40 | |||
41 | #include <misc/debug.h> |
||
42 | |||
43 | struct ExpArray { |
||
44 | size_t esize; |
||
45 | size_t size; |
||
46 | void *v; |
||
47 | }; |
||
48 | |||
49 | static int ExpArray_init (struct ExpArray *o, size_t esize, size_t size) |
||
50 | { |
||
51 | ASSERT(esize > 0) |
||
52 | ASSERT(size > 0) |
||
53 | |||
54 | o->esize = esize; |
||
55 | o->size = size; |
||
56 | |||
57 | if (o->size > SIZE_MAX / o->esize) { |
||
58 | return 0; |
||
59 | } |
||
60 | |||
61 | if (!(o->v = malloc(o->size * o->esize))) { |
||
62 | return 0; |
||
63 | } |
||
64 | |||
65 | return 1; |
||
66 | } |
||
67 | |||
68 | static int ExpArray_resize (struct ExpArray *o, size_t size) |
||
69 | { |
||
70 | ASSERT(size > 0) |
||
71 | |||
72 | if (size <= o->size) { |
||
73 | return 1; |
||
74 | } |
||
75 | |||
76 | size_t newsize = o->size; |
||
77 | |||
78 | while (newsize < size) { |
||
79 | if (2 > SIZE_MAX / newsize) { |
||
80 | return 0; |
||
81 | } |
||
82 | |||
83 | newsize = 2 * newsize; |
||
84 | } |
||
85 | |||
86 | if (newsize > SIZE_MAX / o->esize) { |
||
87 | return 0; |
||
88 | } |
||
89 | |||
90 | void *newarr = realloc(o->v, newsize * o->esize); |
||
91 | if (!newarr) { |
||
92 | return 0; |
||
93 | } |
||
94 | |||
95 | o->size = newsize; |
||
96 | o->v = newarr; |
||
97 | |||
98 | return 1; |
||
99 | } |
||
100 | |||
101 | #endif |