/pfPorts/openbgpd/files/patch-bgpd_buffer.c

https://github.com/vongrippen/pfsense-tools · C · 234 lines · 208 code · 21 blank · 5 comment · 41 complexity · 38ec05b3d501ce8c0863c2877cd3cebe MD5 · raw file

  1. Index: bgpd/buffer.c
  2. ===================================================================
  3. RCS file: /home/cvs/private/hrs/openbgpd/bgpd/buffer.c,v
  4. retrieving revision 1.1.1.1
  5. retrieving revision 1.1.1.2
  6. diff -u -p -r1.1.1.1 -r1.1.1.2
  7. --- bgpd/buffer.c 30 Jun 2009 05:46:15 -0000 1.1.1.1
  8. +++ bgpd/buffer.c 9 Jul 2009 16:49:54 -0000 1.1.1.2
  9. @@ -1,4 +1,4 @@
  10. -/* $OpenBSD: buffer.c,v 1.39 2008/03/24 16:11:02 deraadt Exp $ */
  11. +/* $OpenBSD: buffer.c,v 1.43 2009/06/06 06:33:15 eric Exp $ */
  12. /*
  13. * Copyright (c) 2003, 2004 Henning Brauer <henning@openbsd.org>
  14. @@ -16,18 +16,19 @@
  15. * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
  16. */
  17. -#include <sys/types.h>
  18. +#include <sys/param.h>
  19. +#include <sys/queue.h>
  20. +#include <sys/socket.h>
  21. #include <sys/uio.h>
  22. #include <errno.h>
  23. -#include <limits.h>
  24. -#include <stdio.h>
  25. #include <stdlib.h>
  26. #include <string.h>
  27. #include <unistd.h>
  28. -#include "bgpd.h"
  29. +#include "imsg.h"
  30. +int buf_realloc(struct buf *, size_t);
  31. void buf_enqueue(struct msgbuf *, struct buf *);
  32. void buf_dequeue(struct msgbuf *, struct buf *);
  33. @@ -42,35 +43,55 @@ buf_open(size_t len)
  34. free(buf);
  35. return (NULL);
  36. }
  37. - buf->size = len;
  38. + buf->size = buf->max = len;
  39. buf->fd = -1;
  40. return (buf);
  41. }
  42. struct buf *
  43. -buf_grow(struct buf *buf, size_t len)
  44. +buf_dynamic(size_t len, size_t max)
  45. {
  46. - void *p;
  47. + struct buf *buf;
  48. - if ((p = realloc(buf->buf, buf->size + len)) == NULL) {
  49. - free(buf->buf);
  50. - buf->buf = NULL;
  51. - buf->size = 0;
  52. + if (max < len)
  53. + return (NULL);
  54. +
  55. + if ((buf = buf_open(len)) == NULL)
  56. return (NULL);
  57. - }
  58. - buf->buf = p;
  59. - buf->size += len;
  60. + if (max > 0)
  61. + buf->max = max;
  62. return (buf);
  63. }
  64. int
  65. +buf_realloc(struct buf *buf, size_t len)
  66. +{
  67. + u_char *b;
  68. +
  69. + /* on static buffers max is eq size and so the following fails */
  70. + if (buf->wpos + len > buf->max) {
  71. + errno = ENOMEM;
  72. + return (-1);
  73. + }
  74. +
  75. + b = realloc(buf->buf, buf->wpos + len);
  76. + if (b == NULL)
  77. + return (-1);
  78. + buf->buf = b;
  79. + buf->size = buf->wpos + len;
  80. +
  81. + return (0);
  82. +}
  83. +
  84. +int
  85. buf_add(struct buf *buf, const void *data, size_t len)
  86. {
  87. if (buf->wpos + len > buf->size)
  88. - return (-1);
  89. + if (buf_realloc(buf, len) == -1)
  90. + return (-1);
  91. memcpy(buf->buf + buf->wpos, data, len);
  92. buf->wpos += len;
  93. @@ -83,27 +104,60 @@ buf_reserve(struct buf *buf, size_t len)
  94. void *b;
  95. if (buf->wpos + len > buf->size)
  96. - return (NULL);
  97. + if (buf_realloc(buf, len) == -1)
  98. + return (NULL);
  99. b = buf->buf + buf->wpos;
  100. buf->wpos += len;
  101. return (b);
  102. }
  103. -int
  104. +void *
  105. +buf_seek(struct buf *buf, size_t pos, size_t len)
  106. +{
  107. + /* only allowed to seek in already written parts */
  108. + if (pos + len > buf->wpos)
  109. + return (NULL);
  110. +
  111. + return (buf->buf + pos);
  112. +}
  113. +
  114. +size_t
  115. +buf_size(struct buf *buf)
  116. +{
  117. + return (buf->wpos);
  118. +}
  119. +
  120. +size_t
  121. +buf_left(struct buf *buf)
  122. +{
  123. + return (buf->max - buf->wpos);
  124. +}
  125. +
  126. +void
  127. buf_close(struct msgbuf *msgbuf, struct buf *buf)
  128. {
  129. buf_enqueue(msgbuf, buf);
  130. - return (1);
  131. }
  132. int
  133. -buf_write(int sock, struct buf *buf)
  134. +buf_write(struct msgbuf *msgbuf)
  135. {
  136. + struct iovec iov[IOV_MAX];
  137. + struct buf *buf, *next;
  138. + unsigned int i = 0;
  139. ssize_t n;
  140. - if ((n = write(sock, buf->buf + buf->rpos,
  141. - buf->size - buf->rpos)) == -1) {
  142. + bzero(&iov, sizeof(iov));
  143. + TAILQ_FOREACH(buf, &msgbuf->bufs, entry) {
  144. + if (i >= IOV_MAX)
  145. + break;
  146. + iov[i].iov_base = buf->buf + buf->rpos;
  147. + iov[i].iov_len = buf->size - buf->rpos;
  148. + i++;
  149. + }
  150. +
  151. + if ((n = writev(msgbuf->fd, iov, i)) == -1) {
  152. if (errno == EAGAIN || errno == ENOBUFS ||
  153. errno == EINTR) /* try later */
  154. return (0);
  155. @@ -116,11 +170,19 @@ buf_write(int sock, struct buf *buf)
  156. return (-2);
  157. }
  158. - if (buf->rpos + n < buf->size) { /* not all data written yet */
  159. - buf->rpos += n;
  160. - return (0);
  161. - } else
  162. - return (1);
  163. + for (buf = TAILQ_FIRST(&msgbuf->bufs); buf != NULL && n > 0;
  164. + buf = next) {
  165. + next = TAILQ_NEXT(buf, entry);
  166. + if (buf->rpos + n >= buf->size) {
  167. + n -= buf->size - buf->rpos;
  168. + buf_dequeue(msgbuf, buf);
  169. + } else {
  170. + buf->rpos += n;
  171. + n = 0;
  172. + }
  173. + }
  174. +
  175. + return (0);
  176. }
  177. void
  178. @@ -152,13 +214,13 @@ msgbuf_write(struct msgbuf *msgbuf)
  179. {
  180. struct iovec iov[IOV_MAX];
  181. struct buf *buf, *next;
  182. - int i = 0;
  183. + unsigned int i = 0;
  184. ssize_t n;
  185. struct msghdr msg;
  186. struct cmsghdr *cmsg;
  187. union {
  188. - struct cmsghdr hdr;
  189. - char buf[CMSG_SPACE(sizeof(int))];
  190. + struct cmsghdr hdr;
  191. + char buf[CMSG_SPACE(sizeof(int))];
  192. } cmsgbuf;
  193. bzero(&iov, sizeof(iov));
  194. @@ -167,7 +229,7 @@ msgbuf_write(struct msgbuf *msgbuf)
  195. if (i >= IOV_MAX)
  196. break;
  197. iov[i].iov_base = buf->buf + buf->rpos;
  198. - iov[i].iov_len = buf->size - buf->rpos;
  199. + iov[i].iov_len = buf->wpos - buf->rpos;
  200. i++;
  201. if (buf->fd != -1)
  202. break;
  203. @@ -211,8 +273,8 @@ msgbuf_write(struct msgbuf *msgbuf)
  204. for (buf = TAILQ_FIRST(&msgbuf->bufs); buf != NULL && n > 0;
  205. buf = next) {
  206. next = TAILQ_NEXT(buf, entry);
  207. - if (buf->rpos + n >= buf->size) {
  208. - n -= buf->size - buf->rpos;
  209. + if (buf->rpos + n >= buf->wpos) {
  210. + n -= buf->wpos - buf->rpos;
  211. buf_dequeue(msgbuf, buf);
  212. } else {
  213. buf->rpos += n;