/src/PROJ/curl/lib/dynbuf.c
Line | Count | Source (jump to first uncovered line) |
1 | | /*************************************************************************** |
2 | | * _ _ ____ _ |
3 | | * Project ___| | | | _ \| | |
4 | | * / __| | | | |_) | | |
5 | | * | (__| |_| | _ <| |___ |
6 | | * \___|\___/|_| \_\_____| |
7 | | * |
8 | | * Copyright (C) Daniel Stenberg, <daniel@haxx.se>, et al. |
9 | | * |
10 | | * This software is licensed as described in the file COPYING, which |
11 | | * you should have received as part of this distribution. The terms |
12 | | * are also available at https://curl.se/docs/copyright.html. |
13 | | * |
14 | | * You may opt to use, copy, modify, merge, publish, distribute and/or sell |
15 | | * copies of the Software, and permit persons to whom the Software is |
16 | | * furnished to do so, under the terms of the COPYING file. |
17 | | * |
18 | | * This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY |
19 | | * KIND, either express or implied. |
20 | | * |
21 | | * SPDX-License-Identifier: curl |
22 | | * |
23 | | ***************************************************************************/ |
24 | | |
25 | | #include "curl_setup.h" |
26 | | #include "dynbuf.h" |
27 | | #include "curl_printf.h" |
28 | | #ifdef BUILDING_LIBCURL |
29 | | #include "curl_memory.h" |
30 | | #endif |
31 | | #include "memdebug.h" |
32 | | |
33 | 0 | #define MIN_FIRST_ALLOC 32 |
34 | | |
35 | | #define DYNINIT 0xbee51da /* random pattern */ |
36 | | |
37 | | /* |
38 | | * Init a dynbuf struct. |
39 | | */ |
40 | | void Curl_dyn_init(struct dynbuf *s, size_t toobig) |
41 | 0 | { |
42 | 0 | DEBUGASSERT(s); |
43 | 0 | DEBUGASSERT(toobig); |
44 | 0 | s->bufr = NULL; |
45 | 0 | s->leng = 0; |
46 | 0 | s->allc = 0; |
47 | 0 | s->toobig = toobig; |
48 | | #ifdef DEBUGBUILD |
49 | | s->init = DYNINIT; |
50 | | #endif |
51 | 0 | } |
52 | | |
53 | | /* |
54 | | * free the buffer and re-init the necessary fields. It doesn't touch the |
55 | | * 'init' field and thus this buffer can be reused to add data to again. |
56 | | */ |
57 | | void Curl_dyn_free(struct dynbuf *s) |
58 | 0 | { |
59 | 0 | DEBUGASSERT(s); |
60 | 0 | Curl_safefree(s->bufr); |
61 | 0 | s->leng = s->allc = 0; |
62 | 0 | } |
63 | | |
64 | | /* |
65 | | * Store/append an chunk of memory to the dynbuf. |
66 | | */ |
67 | | static CURLcode dyn_nappend(struct dynbuf *s, |
68 | | const unsigned char *mem, size_t len) |
69 | 0 | { |
70 | 0 | size_t indx = s->leng; |
71 | 0 | size_t a = s->allc; |
72 | 0 | size_t fit = len + indx + 1; /* new string + old string + zero byte */ |
73 | | |
74 | | /* try to detect if there's rubbish in the struct */ |
75 | 0 | DEBUGASSERT(s->init == DYNINIT); |
76 | 0 | DEBUGASSERT(s->toobig); |
77 | 0 | DEBUGASSERT(indx < s->toobig); |
78 | 0 | DEBUGASSERT(!s->leng || s->bufr); |
79 | 0 | DEBUGASSERT(a <= s->toobig); |
80 | 0 | DEBUGASSERT(!len || mem); |
81 | |
|
82 | 0 | if(fit > s->toobig) { |
83 | 0 | Curl_dyn_free(s); |
84 | 0 | return CURLE_TOO_LARGE; |
85 | 0 | } |
86 | 0 | else if(!a) { |
87 | 0 | DEBUGASSERT(!indx); |
88 | | /* first invoke */ |
89 | 0 | if(MIN_FIRST_ALLOC > s->toobig) |
90 | 0 | a = s->toobig; |
91 | 0 | else if(fit < MIN_FIRST_ALLOC) |
92 | 0 | a = MIN_FIRST_ALLOC; |
93 | 0 | else |
94 | 0 | a = fit; |
95 | 0 | } |
96 | 0 | else { |
97 | 0 | while(a < fit) |
98 | 0 | a *= 2; |
99 | 0 | if(a > s->toobig) |
100 | | /* no point in allocating a larger buffer than this is allowed to use */ |
101 | 0 | a = s->toobig; |
102 | 0 | } |
103 | | |
104 | 0 | if(a != s->allc) { |
105 | | /* this logic is not using Curl_saferealloc() to make the tool not have to |
106 | | include that as well when it uses this code */ |
107 | 0 | void *p = realloc(s->bufr, a); |
108 | 0 | if(!p) { |
109 | 0 | Curl_dyn_free(s); |
110 | 0 | return CURLE_OUT_OF_MEMORY; |
111 | 0 | } |
112 | 0 | s->bufr = p; |
113 | 0 | s->allc = a; |
114 | 0 | } |
115 | | |
116 | 0 | if(len) |
117 | 0 | memcpy(&s->bufr[indx], mem, len); |
118 | 0 | s->leng = indx + len; |
119 | 0 | s->bufr[s->leng] = 0; |
120 | 0 | return CURLE_OK; |
121 | 0 | } |
122 | | |
123 | | /* |
124 | | * Clears the string, keeps the allocation. This can also be called on a |
125 | | * buffer that already was freed. |
126 | | */ |
127 | | void Curl_dyn_reset(struct dynbuf *s) |
128 | 0 | { |
129 | 0 | DEBUGASSERT(s); |
130 | 0 | DEBUGASSERT(s->init == DYNINIT); |
131 | 0 | DEBUGASSERT(!s->leng || s->bufr); |
132 | 0 | if(s->leng) |
133 | 0 | s->bufr[0] = 0; |
134 | 0 | s->leng = 0; |
135 | 0 | } |
136 | | |
137 | | /* |
138 | | * Specify the size of the tail to keep (number of bytes from the end of the |
139 | | * buffer). The rest will be dropped. |
140 | | */ |
141 | | CURLcode Curl_dyn_tail(struct dynbuf *s, size_t trail) |
142 | 0 | { |
143 | 0 | DEBUGASSERT(s); |
144 | 0 | DEBUGASSERT(s->init == DYNINIT); |
145 | 0 | DEBUGASSERT(!s->leng || s->bufr); |
146 | 0 | if(trail > s->leng) |
147 | 0 | return CURLE_BAD_FUNCTION_ARGUMENT; |
148 | 0 | else if(trail == s->leng) |
149 | 0 | return CURLE_OK; |
150 | 0 | else if(!trail) { |
151 | 0 | Curl_dyn_reset(s); |
152 | 0 | } |
153 | 0 | else { |
154 | 0 | memmove(&s->bufr[0], &s->bufr[s->leng - trail], trail); |
155 | 0 | s->leng = trail; |
156 | 0 | s->bufr[s->leng] = 0; |
157 | 0 | } |
158 | 0 | return CURLE_OK; |
159 | |
|
160 | 0 | } |
161 | | |
162 | | /* |
163 | | * Appends a buffer with length. |
164 | | */ |
165 | | CURLcode Curl_dyn_addn(struct dynbuf *s, const void *mem, size_t len) |
166 | 0 | { |
167 | 0 | DEBUGASSERT(s); |
168 | 0 | DEBUGASSERT(s->init == DYNINIT); |
169 | 0 | DEBUGASSERT(!s->leng || s->bufr); |
170 | 0 | return dyn_nappend(s, mem, len); |
171 | 0 | } |
172 | | |
173 | | /* |
174 | | * Append a null-terminated string at the end. |
175 | | */ |
176 | | CURLcode Curl_dyn_add(struct dynbuf *s, const char *str) |
177 | 0 | { |
178 | 0 | size_t n; |
179 | 0 | DEBUGASSERT(str); |
180 | 0 | DEBUGASSERT(s); |
181 | 0 | DEBUGASSERT(s->init == DYNINIT); |
182 | 0 | DEBUGASSERT(!s->leng || s->bufr); |
183 | 0 | n = strlen(str); |
184 | 0 | return dyn_nappend(s, (unsigned char *)str, n); |
185 | 0 | } |
186 | | |
187 | | /* |
188 | | * Append a string vprintf()-style |
189 | | */ |
190 | | CURLcode Curl_dyn_vaddf(struct dynbuf *s, const char *fmt, va_list ap) |
191 | 0 | { |
192 | 0 | #ifdef BUILDING_LIBCURL |
193 | 0 | int rc; |
194 | 0 | DEBUGASSERT(s); |
195 | 0 | DEBUGASSERT(s->init == DYNINIT); |
196 | 0 | DEBUGASSERT(!s->leng || s->bufr); |
197 | 0 | DEBUGASSERT(fmt); |
198 | 0 | rc = Curl_dyn_vprintf(s, fmt, ap); |
199 | |
|
200 | 0 | if(!rc) |
201 | 0 | return CURLE_OK; |
202 | 0 | else if(rc == MERR_TOO_LARGE) |
203 | 0 | return CURLE_TOO_LARGE; |
204 | 0 | return CURLE_OUT_OF_MEMORY; |
205 | | #else |
206 | | char *str; |
207 | | str = vaprintf(fmt, ap); /* this allocs a new string to append */ |
208 | | |
209 | | if(str) { |
210 | | CURLcode result = dyn_nappend(s, (unsigned char *)str, strlen(str)); |
211 | | free(str); |
212 | | return result; |
213 | | } |
214 | | /* If we failed, we cleanup the whole buffer and return error */ |
215 | | Curl_dyn_free(s); |
216 | | return CURLE_OK; |
217 | | #endif |
218 | 0 | } |
219 | | |
220 | | /* |
221 | | * Append a string printf()-style |
222 | | */ |
223 | | CURLcode Curl_dyn_addf(struct dynbuf *s, const char *fmt, ...) |
224 | 0 | { |
225 | 0 | CURLcode result; |
226 | 0 | va_list ap; |
227 | 0 | DEBUGASSERT(s); |
228 | 0 | DEBUGASSERT(s->init == DYNINIT); |
229 | 0 | DEBUGASSERT(!s->leng || s->bufr); |
230 | 0 | va_start(ap, fmt); |
231 | 0 | result = Curl_dyn_vaddf(s, fmt, ap); |
232 | 0 | va_end(ap); |
233 | 0 | return result; |
234 | 0 | } |
235 | | |
236 | | /* |
237 | | * Returns a pointer to the buffer. |
238 | | */ |
239 | | char *Curl_dyn_ptr(const struct dynbuf *s) |
240 | 0 | { |
241 | 0 | DEBUGASSERT(s); |
242 | 0 | DEBUGASSERT(s->init == DYNINIT); |
243 | 0 | DEBUGASSERT(!s->leng || s->bufr); |
244 | 0 | return s->bufr; |
245 | 0 | } |
246 | | |
247 | | /* |
248 | | * Returns an unsigned pointer to the buffer. |
249 | | */ |
250 | | unsigned char *Curl_dyn_uptr(const struct dynbuf *s) |
251 | 0 | { |
252 | 0 | DEBUGASSERT(s); |
253 | 0 | DEBUGASSERT(s->init == DYNINIT); |
254 | 0 | DEBUGASSERT(!s->leng || s->bufr); |
255 | 0 | return (unsigned char *)s->bufr; |
256 | 0 | } |
257 | | |
258 | | /* |
259 | | * Returns the length of the buffer. |
260 | | */ |
261 | | size_t Curl_dyn_len(const struct dynbuf *s) |
262 | 0 | { |
263 | 0 | DEBUGASSERT(s); |
264 | 0 | DEBUGASSERT(s->init == DYNINIT); |
265 | 0 | DEBUGASSERT(!s->leng || s->bufr); |
266 | 0 | return s->leng; |
267 | 0 | } |
268 | | |
269 | | /* |
270 | | * Set a new (smaller) length. |
271 | | */ |
272 | | CURLcode Curl_dyn_setlen(struct dynbuf *s, size_t set) |
273 | 0 | { |
274 | 0 | DEBUGASSERT(s); |
275 | 0 | DEBUGASSERT(s->init == DYNINIT); |
276 | 0 | DEBUGASSERT(!s->leng || s->bufr); |
277 | 0 | if(set > s->leng) |
278 | 0 | return CURLE_BAD_FUNCTION_ARGUMENT; |
279 | 0 | s->leng = set; |
280 | 0 | s->bufr[s->leng] = 0; |
281 | 0 | return CURLE_OK; |
282 | 0 | } |