]> git.proxmox.com Git - mirror_frr.git/blob - lib/buffer.c
Merge pull request #5625 from qlyoung/fix-zapi-ipset-name-nullterm
[mirror_frr.git] / lib / buffer.c
1 /*
2 * Buffering of output and input.
3 * Copyright (C) 1998 Kunihiro Ishiguro
4 *
5 * This file is part of GNU Zebra.
6 *
7 * GNU Zebra is free software; you can redistribute it and/or modify
8 * it under the terms of the GNU General Public License as published
9 * by the Free Software Foundation; either version 2, or (at your
10 * option) any later version.
11 *
12 * GNU Zebra is distributed in the hope that it will be useful, but
13 * WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * General Public License for more details.
16 *
17 * You should have received a copy of the GNU General Public License along
18 * with this program; see the file COPYING; if not, write to the Free Software
19 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
20 */
21
22 #include <zebra.h>
23
24 #include "memory.h"
25 #include "buffer.h"
26 #include "log.h"
27 #include "network.h"
28 #include "lib_errors.h"
29
30 #include <stddef.h>
31
32 DEFINE_MTYPE_STATIC(LIB, BUFFER, "Buffer")
33 DEFINE_MTYPE_STATIC(LIB, BUFFER_DATA, "Buffer data")
34
35 /* Buffer master. */
36 struct buffer {
37 /* Data list. */
38 struct buffer_data *head;
39 struct buffer_data *tail;
40
41 /* Size of each buffer_data chunk. */
42 size_t size;
43 };
44
45 /* Data container. */
46 struct buffer_data {
47 struct buffer_data *next;
48
49 /* Location to add new data. */
50 size_t cp;
51
52 /* Pointer to data not yet flushed. */
53 size_t sp;
54
55 /* Actual data stream (variable length). */
56 unsigned char data[]; /* real dimension is buffer->size */
57 };
58
59 /* It should always be true that: 0 <= sp <= cp <= size */
60
61 /* Default buffer size (used if none specified). It is rounded up to the
62 next page boundery. */
63 #define BUFFER_SIZE_DEFAULT 4096
64
65 #define BUFFER_DATA_FREE(D) XFREE(MTYPE_BUFFER_DATA, (D))
66
67 /* Make new buffer. */
68 struct buffer *buffer_new(size_t size)
69 {
70 struct buffer *b;
71
72 b = XCALLOC(MTYPE_BUFFER, sizeof(struct buffer));
73
74 if (size)
75 b->size = size;
76 else {
77 static size_t default_size;
78 if (!default_size) {
79 long pgsz = sysconf(_SC_PAGESIZE);
80 default_size = ((((BUFFER_SIZE_DEFAULT - 1) / pgsz) + 1)
81 * pgsz);
82 }
83 b->size = default_size;
84 }
85
86 return b;
87 }
88
89 /* Free buffer. */
90 void buffer_free(struct buffer *b)
91 {
92 buffer_reset(b);
93 XFREE(MTYPE_BUFFER, b);
94 }
95
96 /* Make string clone. */
97 char *buffer_getstr(struct buffer *b)
98 {
99 size_t totlen = 0;
100 struct buffer_data *data;
101 char *s;
102 char *p;
103
104 for (data = b->head; data; data = data->next)
105 totlen += data->cp - data->sp;
106 if (!(s = XMALLOC(MTYPE_TMP, totlen + 1)))
107 return NULL;
108 p = s;
109 for (data = b->head; data; data = data->next) {
110 memcpy(p, data->data + data->sp, data->cp - data->sp);
111 p += data->cp - data->sp;
112 }
113 *p = '\0';
114 return s;
115 }
116
117 /* Clear and free all allocated data. */
118 void buffer_reset(struct buffer *b)
119 {
120 struct buffer_data *data;
121 struct buffer_data *next;
122
123 for (data = b->head; data; data = next) {
124 next = data->next;
125 BUFFER_DATA_FREE(data);
126 }
127 b->head = b->tail = NULL;
128 }
129
130 /* Add buffer_data to the end of buffer. */
131 static struct buffer_data *buffer_add(struct buffer *b)
132 {
133 struct buffer_data *d;
134
135 d = XMALLOC(MTYPE_BUFFER_DATA,
136 offsetof(struct buffer_data, data) + b->size);
137 d->cp = d->sp = 0;
138 d->next = NULL;
139
140 if (b->tail)
141 b->tail->next = d;
142 else
143 b->head = d;
144 b->tail = d;
145
146 return d;
147 }
148
149 /* Write data to buffer. */
150 void buffer_put(struct buffer *b, const void *p, size_t size)
151 {
152 struct buffer_data *data = b->tail;
153 const char *ptr = p;
154
155 /* We use even last one byte of data buffer. */
156 while (size) {
157 size_t chunk;
158
159 /* If there is no data buffer add it. */
160 if (data == NULL || data->cp == b->size)
161 data = buffer_add(b);
162
163 chunk = ((size <= (b->size - data->cp)) ? size
164 : (b->size - data->cp));
165 memcpy((data->data + data->cp), ptr, chunk);
166 size -= chunk;
167 ptr += chunk;
168 data->cp += chunk;
169 }
170 }
171
172 /* Insert character into the buffer. */
173 void buffer_putc(struct buffer *b, uint8_t c)
174 {
175 buffer_put(b, &c, 1);
176 }
177
178 /* Put string to the buffer. */
179 void buffer_putstr(struct buffer *b, const char *c)
180 {
181 buffer_put(b, c, strlen(c));
182 }
183
184 /* Expand \n to \r\n */
185 void buffer_put_crlf(struct buffer *b, const void *origp, size_t origsize)
186 {
187 struct buffer_data *data = b->tail;
188 const char *p = origp, *end = p + origsize, *lf;
189 size_t size;
190
191 lf = memchr(p, '\n', end - p);
192
193 /* We use even last one byte of data buffer. */
194 while (p < end) {
195 size_t avail, chunk;
196
197 /* If there is no data buffer add it. */
198 if (data == NULL || data->cp == b->size)
199 data = buffer_add(b);
200
201 size = (lf ? lf : end) - p;
202 avail = b->size - data->cp;
203
204 chunk = (size <= avail) ? size : avail;
205 memcpy(data->data + data->cp, p, chunk);
206
207 p += chunk;
208 data->cp += chunk;
209
210 if (lf && size <= avail) {
211 /* we just copied up to (including) a '\n' */
212 if (data->cp == b->size)
213 data = buffer_add(b);
214 data->data[data->cp++] = '\r';
215 if (data->cp == b->size)
216 data = buffer_add(b);
217 data->data[data->cp++] = '\n';
218
219 p++;
220 lf = memchr(p, '\n', end - p);
221 }
222 }
223 }
224
225 /* Keep flushing data to the fd until the buffer is empty or an error is
226 encountered or the operation would block. */
227 buffer_status_t buffer_flush_all(struct buffer *b, int fd)
228 {
229 buffer_status_t ret;
230 struct buffer_data *head;
231 size_t head_sp;
232
233 if (!b->head)
234 return BUFFER_EMPTY;
235 head_sp = (head = b->head)->sp;
236 /* Flush all data. */
237 while ((ret = buffer_flush_available(b, fd)) == BUFFER_PENDING) {
238 if ((b->head == head) && (head_sp == head->sp)
239 && (errno != EINTR))
240 /* No data was flushed, so kernel buffer must be full.
241 */
242 return ret;
243 head_sp = (head = b->head)->sp;
244 }
245
246 return ret;
247 }
248
249 /* Flush enough data to fill a terminal window of the given scene (used only
250 by vty telnet interface). */
251 buffer_status_t buffer_flush_window(struct buffer *b, int fd, int width,
252 int height, int erase_flag,
253 int no_more_flag)
254 {
255 int nbytes;
256 int iov_alloc;
257 int iov_index;
258 struct iovec *iov;
259 struct iovec small_iov[3];
260 char more[] = " --More-- ";
261 char erase[] = {0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08,
262 0x08, 0x08, ' ', ' ', ' ', ' ', ' ', ' ',
263 ' ', ' ', ' ', ' ', 0x08, 0x08, 0x08, 0x08,
264 0x08, 0x08, 0x08, 0x08, 0x08, 0x08};
265 struct buffer_data *data;
266 int column;
267
268 if (!b->head)
269 return BUFFER_EMPTY;
270
271 if (height < 1)
272 height = 1;
273 else if (height >= 2)
274 height--;
275 if (width < 1)
276 width = 1;
277
278 /* For erase and more data add two to b's buffer_data count.*/
279 if (b->head->next == NULL) {
280 iov_alloc = array_size(small_iov);
281 iov = small_iov;
282 } else {
283 iov_alloc = ((height * (width + 2)) / b->size) + 10;
284 iov = XMALLOC(MTYPE_TMP, iov_alloc * sizeof(*iov));
285 }
286 iov_index = 0;
287
288 /* Previously print out is performed. */
289 if (erase_flag) {
290 iov[iov_index].iov_base = erase;
291 iov[iov_index].iov_len = sizeof erase;
292 iov_index++;
293 }
294
295 /* Output data. */
296 column = 1; /* Column position of next character displayed. */
297 for (data = b->head; data && (height > 0); data = data->next) {
298 size_t cp;
299
300 cp = data->sp;
301 while ((cp < data->cp) && (height > 0)) {
302 /* Calculate lines remaining and column position after
303 displaying
304 this character. */
305 if (data->data[cp] == '\r')
306 column = 1;
307 else if ((data->data[cp] == '\n')
308 || (column == width)) {
309 column = 1;
310 height--;
311 } else
312 column++;
313 cp++;
314 }
315 iov[iov_index].iov_base = (char *)(data->data + data->sp);
316 iov[iov_index++].iov_len = cp - data->sp;
317 data->sp = cp;
318
319 if (iov_index == iov_alloc)
320 /* This should not ordinarily happen. */
321 {
322 iov_alloc *= 2;
323 if (iov != small_iov) {
324 iov = XREALLOC(MTYPE_TMP, iov,
325 iov_alloc * sizeof(*iov));
326 } else {
327 /* This should absolutely never occur. */
328 flog_err_sys(
329 EC_LIB_SYSTEM_CALL,
330 "%s: corruption detected: iov_small overflowed; "
331 "head %p, tail %p, head->next %p",
332 __func__, (void *)b->head,
333 (void *)b->tail, (void *)b->head->next);
334 iov = XMALLOC(MTYPE_TMP,
335 iov_alloc * sizeof(*iov));
336 memcpy(iov, small_iov, sizeof(small_iov));
337 }
338 }
339 }
340
341 /* In case of `more' display need. */
342 if (b->tail && (b->tail->sp < b->tail->cp) && !no_more_flag) {
343 iov[iov_index].iov_base = more;
344 iov[iov_index].iov_len = sizeof more;
345 iov_index++;
346 }
347
348
349 #ifdef IOV_MAX
350 /* IOV_MAX are normally defined in <sys/uio.h> , Posix.1g.
351 example: Solaris2.6 are defined IOV_MAX size at 16. */
352 {
353 struct iovec *c_iov = iov;
354 nbytes = 0; /* Make sure it's initialized. */
355
356 while (iov_index > 0) {
357 int iov_size;
358
359 iov_size =
360 ((iov_index > IOV_MAX) ? IOV_MAX : iov_index);
361 if ((nbytes = writev(fd, c_iov, iov_size)) < 0) {
362 flog_err(EC_LIB_SOCKET,
363 "%s: writev to fd %d failed: %s",
364 __func__, fd, safe_strerror(errno));
365 break;
366 }
367
368 /* move pointer io-vector */
369 c_iov += iov_size;
370 iov_index -= iov_size;
371 }
372 }
373 #else /* IOV_MAX */
374 if ((nbytes = writev(fd, iov, iov_index)) < 0)
375 flog_err(EC_LIB_SOCKET, "%s: writev to fd %d failed: %s",
376 __func__, fd, safe_strerror(errno));
377 #endif /* IOV_MAX */
378
379 /* Free printed buffer data. */
380 while (b->head && (b->head->sp == b->head->cp)) {
381 struct buffer_data *del;
382 if (!(b->head = (del = b->head)->next))
383 b->tail = NULL;
384 BUFFER_DATA_FREE(del);
385 }
386
387 if (iov != small_iov)
388 XFREE(MTYPE_TMP, iov);
389
390 return (nbytes < 0) ? BUFFER_ERROR
391 : (b->head ? BUFFER_PENDING : BUFFER_EMPTY);
392 }
393
394 /* This function (unlike other buffer_flush* functions above) is designed
395 to work with non-blocking sockets. It does not attempt to write out
396 all of the queued data, just a "big" chunk. It returns 0 if it was
397 able to empty out the buffers completely, 1 if more flushing is
398 required later, or -1 on a fatal write error. */
399 buffer_status_t buffer_flush_available(struct buffer *b, int fd)
400 {
401
402 /* These are just reasonable values to make sure a significant amount of
403 data is written. There's no need to go crazy and try to write it all
404 in one shot. */
405 #ifdef IOV_MAX
406 #define MAX_CHUNKS ((IOV_MAX >= 16) ? 16 : IOV_MAX)
407 #else
408 #define MAX_CHUNKS 16
409 #endif
410 #define MAX_FLUSH 131072
411
412 struct buffer_data *d;
413 size_t written;
414 struct iovec iov[MAX_CHUNKS];
415 size_t iovcnt = 0;
416 size_t nbyte = 0;
417
418 if (fd < 0)
419 return BUFFER_ERROR;
420
421 for (d = b->head; d && (iovcnt < MAX_CHUNKS) && (nbyte < MAX_FLUSH);
422 d = d->next, iovcnt++) {
423 iov[iovcnt].iov_base = d->data + d->sp;
424 nbyte += (iov[iovcnt].iov_len = d->cp - d->sp);
425 }
426
427 if (!nbyte)
428 /* No data to flush: should we issue a warning message? */
429 return BUFFER_EMPTY;
430
431 /* only place where written should be sign compared */
432 if ((ssize_t)(written = writev(fd, iov, iovcnt)) < 0) {
433 if (ERRNO_IO_RETRY(errno))
434 /* Calling code should try again later. */
435 return BUFFER_PENDING;
436 flog_err(EC_LIB_SOCKET, "%s: write error on fd %d: %s",
437 __func__, fd, safe_strerror(errno));
438 return BUFFER_ERROR;
439 }
440
441 /* Free printed buffer data. */
442 while (written > 0) {
443 if (!(d = b->head)) {
444 flog_err(
445 EC_LIB_DEVELOPMENT,
446 "%s: corruption detected: buffer queue empty, but written is %lu",
447 __func__, (unsigned long)written);
448 break;
449 }
450 if (written < d->cp - d->sp) {
451 d->sp += written;
452 return BUFFER_PENDING;
453 }
454
455 written -= (d->cp - d->sp);
456 if (!(b->head = d->next))
457 b->tail = NULL;
458 BUFFER_DATA_FREE(d);
459 }
460
461 return b->head ? BUFFER_PENDING : BUFFER_EMPTY;
462
463 #undef MAX_CHUNKS
464 #undef MAX_FLUSH
465 }
466
467 buffer_status_t buffer_write(struct buffer *b, int fd, const void *p,
468 size_t size)
469 {
470 ssize_t nbytes;
471
472 #if 0
473 /*
474 * Should we attempt to drain any previously buffered data?
475 * This could help reduce latency in pushing out the data if
476 * we are stuck in a long-running thread that is preventing
477 * the main select loop from calling the flush thread...
478 */
479 if (b->head && (buffer_flush_available(b, fd) == BUFFER_ERROR))
480 return BUFFER_ERROR;
481 #endif
482 if (b->head)
483 /* Buffer is not empty, so do not attempt to write the new data.
484 */
485 nbytes = 0;
486 else if ((nbytes = write(fd, p, size)) < 0) {
487 if (ERRNO_IO_RETRY(errno))
488 nbytes = 0;
489 else {
490 flog_err(EC_LIB_SOCKET, "%s: write error on fd %d: %s",
491 __func__, fd, safe_strerror(errno));
492 return BUFFER_ERROR;
493 }
494 }
495 /* Add any remaining data to the buffer. */
496 {
497 size_t written = nbytes;
498 if (written < size)
499 buffer_put(b, ((const char *)p) + written,
500 size - written);
501 }
502 return b->head ? BUFFER_PENDING : BUFFER_EMPTY;
503 }