Source code pulled from OpenBSD for OpenNTPD. The place to contribute to this code is via the OpenBSD CVS tree.
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

309 lines
5.8 KiB

  1. /* $OpenBSD: imsg-buffer.c,v 1.12 2019/01/20 02:50:03 bcook Exp $ */
  2. /*
  3. * Copyright (c) 2003, 2004 Henning Brauer <henning@openbsd.org>
  4. *
  5. * Permission to use, copy, modify, and distribute this software for any
  6. * purpose with or without fee is hereby granted, provided that the above
  7. * copyright notice and this permission notice appear in all copies.
  8. *
  9. * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
  10. * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
  11. * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
  12. * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
  13. * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
  14. * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
  15. * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
  16. */
  17. #include <sys/types.h>
  18. #include <sys/queue.h>
  19. #include <sys/socket.h>
  20. #include <sys/uio.h>
  21. #include <limits.h>
  22. #include <errno.h>
  23. #include <stdlib.h>
  24. #include <string.h>
  25. #include <unistd.h>
  26. #include "imsg.h"
  27. static int ibuf_realloc(struct ibuf *, size_t);
  28. static void ibuf_enqueue(struct msgbuf *, struct ibuf *);
  29. static void ibuf_dequeue(struct msgbuf *, struct ibuf *);
  30. struct ibuf *
  31. ibuf_open(size_t len)
  32. {
  33. struct ibuf *buf;
  34. if ((buf = calloc(1, sizeof(struct ibuf))) == NULL)
  35. return (NULL);
  36. if ((buf->buf = malloc(len)) == NULL) {
  37. free(buf);
  38. return (NULL);
  39. }
  40. buf->size = buf->max = len;
  41. buf->fd = -1;
  42. return (buf);
  43. }
  44. struct ibuf *
  45. ibuf_dynamic(size_t len, size_t max)
  46. {
  47. struct ibuf *buf;
  48. if (max < len)
  49. return (NULL);
  50. if ((buf = ibuf_open(len)) == NULL)
  51. return (NULL);
  52. if (max > 0)
  53. buf->max = max;
  54. return (buf);
  55. }
  56. static int
  57. ibuf_realloc(struct ibuf *buf, size_t len)
  58. {
  59. unsigned char *b;
  60. /* on static buffers max is eq size and so the following fails */
  61. if (buf->wpos + len > buf->max) {
  62. errno = ERANGE;
  63. return (-1);
  64. }
  65. b = recallocarray(buf->buf, buf->size, buf->wpos + len, 1);
  66. if (b == NULL)
  67. return (-1);
  68. buf->buf = b;
  69. buf->size = buf->wpos + len;
  70. return (0);
  71. }
  72. int
  73. ibuf_add(struct ibuf *buf, const void *data, size_t len)
  74. {
  75. if (buf->wpos + len > buf->size)
  76. if (ibuf_realloc(buf, len) == -1)
  77. return (-1);
  78. memcpy(buf->buf + buf->wpos, data, len);
  79. buf->wpos += len;
  80. return (0);
  81. }
  82. void *
  83. ibuf_reserve(struct ibuf *buf, size_t len)
  84. {
  85. void *b;
  86. if (buf->wpos + len > buf->size)
  87. if (ibuf_realloc(buf, len) == -1)
  88. return (NULL);
  89. b = buf->buf + buf->wpos;
  90. buf->wpos += len;
  91. return (b);
  92. }
  93. void *
  94. ibuf_seek(struct ibuf *buf, size_t pos, size_t len)
  95. {
  96. /* only allowed to seek in already written parts */
  97. if (pos + len > buf->wpos)
  98. return (NULL);
  99. return (buf->buf + pos);
  100. }
  101. size_t
  102. ibuf_size(struct ibuf *buf)
  103. {
  104. return (buf->wpos);
  105. }
  106. size_t
  107. ibuf_left(struct ibuf *buf)
  108. {
  109. return (buf->max - buf->wpos);
  110. }
  111. void
  112. ibuf_close(struct msgbuf *msgbuf, struct ibuf *buf)
  113. {
  114. ibuf_enqueue(msgbuf, buf);
  115. }
  116. int
  117. ibuf_write(struct msgbuf *msgbuf)
  118. {
  119. struct iovec iov[IOV_MAX];
  120. struct ibuf *buf;
  121. unsigned int i = 0;
  122. ssize_t n;
  123. memset(&iov, 0, sizeof(iov));
  124. TAILQ_FOREACH(buf, &msgbuf->bufs, entry) {
  125. if (i >= IOV_MAX)
  126. break;
  127. iov[i].iov_base = buf->buf + buf->rpos;
  128. iov[i].iov_len = buf->wpos - buf->rpos;
  129. i++;
  130. }
  131. again:
  132. if ((n = writev(msgbuf->fd, iov, i)) == -1) {
  133. if (errno == EINTR)
  134. goto again;
  135. if (errno == ENOBUFS)
  136. errno = EAGAIN;
  137. return (-1);
  138. }
  139. if (n == 0) { /* connection closed */
  140. errno = 0;
  141. return (0);
  142. }
  143. msgbuf_drain(msgbuf, n);
  144. return (1);
  145. }
  146. void
  147. ibuf_free(struct ibuf *buf)
  148. {
  149. if (buf == NULL)
  150. return;
  151. freezero(buf->buf, buf->size);
  152. free(buf);
  153. }
  154. void
  155. msgbuf_init(struct msgbuf *msgbuf)
  156. {
  157. msgbuf->queued = 0;
  158. msgbuf->fd = -1;
  159. TAILQ_INIT(&msgbuf->bufs);
  160. }
  161. void
  162. msgbuf_drain(struct msgbuf *msgbuf, size_t n)
  163. {
  164. struct ibuf *buf, *next;
  165. for (buf = TAILQ_FIRST(&msgbuf->bufs); buf != NULL && n > 0;
  166. buf = next) {
  167. next = TAILQ_NEXT(buf, entry);
  168. if (buf->rpos + n >= buf->wpos) {
  169. n -= buf->wpos - buf->rpos;
  170. ibuf_dequeue(msgbuf, buf);
  171. } else {
  172. buf->rpos += n;
  173. n = 0;
  174. }
  175. }
  176. }
  177. void
  178. msgbuf_clear(struct msgbuf *msgbuf)
  179. {
  180. struct ibuf *buf;
  181. while ((buf = TAILQ_FIRST(&msgbuf->bufs)) != NULL)
  182. ibuf_dequeue(msgbuf, buf);
  183. }
  184. int
  185. msgbuf_write(struct msgbuf *msgbuf)
  186. {
  187. struct iovec iov[IOV_MAX];
  188. struct ibuf *buf;
  189. unsigned int i = 0;
  190. ssize_t n;
  191. struct msghdr msg;
  192. struct cmsghdr *cmsg;
  193. union {
  194. struct cmsghdr hdr;
  195. char buf[CMSG_SPACE(sizeof(int))];
  196. } cmsgbuf;
  197. memset(&iov, 0, sizeof(iov));
  198. memset(&msg, 0, sizeof(msg));
  199. memset(&cmsgbuf, 0, sizeof(cmsgbuf));
  200. TAILQ_FOREACH(buf, &msgbuf->bufs, entry) {
  201. if (i >= IOV_MAX)
  202. break;
  203. iov[i].iov_base = buf->buf + buf->rpos;
  204. iov[i].iov_len = buf->wpos - buf->rpos;
  205. i++;
  206. if (buf->fd != -1)
  207. break;
  208. }
  209. msg.msg_iov = iov;
  210. msg.msg_iovlen = i;
  211. if (buf != NULL && buf->fd != -1) {
  212. msg.msg_control = (caddr_t)&cmsgbuf.buf;
  213. msg.msg_controllen = sizeof(cmsgbuf.buf);
  214. cmsg = CMSG_FIRSTHDR(&msg);
  215. cmsg->cmsg_len = CMSG_LEN(sizeof(int));
  216. cmsg->cmsg_level = SOL_SOCKET;
  217. cmsg->cmsg_type = SCM_RIGHTS;
  218. *(int *)CMSG_DATA(cmsg) = buf->fd;
  219. }
  220. again:
  221. if ((n = sendmsg(msgbuf->fd, &msg, 0)) == -1) {
  222. if (errno == EINTR)
  223. goto again;
  224. if (errno == ENOBUFS)
  225. errno = EAGAIN;
  226. return (-1);
  227. }
  228. if (n == 0) { /* connection closed */
  229. errno = 0;
  230. return (0);
  231. }
  232. /*
  233. * assumption: fd got sent if sendmsg sent anything
  234. * this works because fds are passed one at a time
  235. */
  236. if (buf != NULL && buf->fd != -1) {
  237. close(buf->fd);
  238. buf->fd = -1;
  239. }
  240. msgbuf_drain(msgbuf, n);
  241. return (1);
  242. }
  243. static void
  244. ibuf_enqueue(struct msgbuf *msgbuf, struct ibuf *buf)
  245. {
  246. TAILQ_INSERT_TAIL(&msgbuf->bufs, buf, entry);
  247. msgbuf->queued++;
  248. }
  249. static void
  250. ibuf_dequeue(struct msgbuf *msgbuf, struct ibuf *buf)
  251. {
  252. TAILQ_REMOVE(&msgbuf->bufs, buf, entry);
  253. if (buf->fd != -1)
  254. close(buf->fd);
  255. msgbuf->queued--;
  256. ibuf_free(buf);
  257. }