PageRenderTime 40ms CodeModel.GetById 15ms RepoModel.GetById 0ms app.codeStats 0ms

/src/lib/libutil/imsg.c

https://github.com/mmatuska/relayd
C | 306 lines | 227 code | 56 blank | 23 comment | 55 complexity | aad2b2f439a2576609715b9cb88e8843 MD5 | raw file
  1. /* $OpenBSD: imsg.c,v 1.6 2014/06/30 00:26:22 deraadt 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 <errno.h>
  22. #include <stdlib.h>
  23. #include <string.h>
  24. #include <unistd.h>
  25. #include "imsg.h"
  26. int imsg_fd_overhead = 0;
  27. int imsg_get_fd(struct imsgbuf *);
  28. void
  29. imsg_init(struct imsgbuf *ibuf, int fd)
  30. {
  31. msgbuf_init(&ibuf->w);
  32. bzero(&ibuf->r, sizeof(ibuf->r));
  33. ibuf->fd = fd;
  34. ibuf->w.fd = fd;
  35. ibuf->pid = getpid();
  36. TAILQ_INIT(&ibuf->fds);
  37. }
  38. ssize_t
  39. imsg_read(struct imsgbuf *ibuf)
  40. {
  41. struct msghdr msg;
  42. struct cmsghdr *cmsg;
  43. union {
  44. struct cmsghdr hdr;
  45. char buf[CMSG_SPACE(sizeof(int) * 1)];
  46. } cmsgbuf;
  47. struct iovec iov;
  48. ssize_t n = -1;
  49. int fd;
  50. struct imsg_fd *ifd;
  51. bzero(&msg, sizeof(msg));
  52. iov.iov_base = ibuf->r.buf + ibuf->r.wpos;
  53. iov.iov_len = sizeof(ibuf->r.buf) - ibuf->r.wpos;
  54. msg.msg_iov = &iov;
  55. msg.msg_iovlen = 1;
  56. msg.msg_control = &cmsgbuf.buf;
  57. msg.msg_controllen = sizeof(cmsgbuf.buf);
  58. if ((ifd = calloc(1, sizeof(struct imsg_fd))) == NULL)
  59. return (-1);
  60. #ifndef __FreeBSD__ /* no getdtablecount() */
  61. again:
  62. if (getdtablecount() + imsg_fd_overhead +
  63. (CMSG_SPACE(sizeof(int))-CMSG_SPACE(0))/sizeof(int)
  64. >= getdtablesize()) {
  65. errno = EAGAIN;
  66. free(ifd);
  67. return (-1);
  68. }
  69. #endif
  70. if ((n = recvmsg(ibuf->fd, &msg, 0)) == -1) {
  71. if (errno == EMSGSIZE)
  72. goto fail;
  73. if (errno != EINTR && errno != EAGAIN)
  74. goto fail;
  75. #ifndef __FreeBSD__
  76. goto again;
  77. #endif
  78. }
  79. ibuf->r.wpos += n;
  80. for (cmsg = CMSG_FIRSTHDR(&msg); cmsg != NULL;
  81. cmsg = CMSG_NXTHDR(&msg, cmsg)) {
  82. if (cmsg->cmsg_level == SOL_SOCKET &&
  83. cmsg->cmsg_type == SCM_RIGHTS) {
  84. int i;
  85. int j;
  86. /*
  87. * We only accept one file descriptor. Due to C
  88. * padding rules, our control buffer might contain
  89. * more than one fd, and we must close them.
  90. */
  91. j = ((char *)cmsg + cmsg->cmsg_len -
  92. (char *)CMSG_DATA(cmsg)) / sizeof(int);
  93. for (i = 0; i < j; i++) {
  94. fd = ((int *)CMSG_DATA(cmsg))[i];
  95. if (ifd != NULL) {
  96. ifd->fd = fd;
  97. TAILQ_INSERT_TAIL(&ibuf->fds, ifd,
  98. entry);
  99. ifd = NULL;
  100. } else
  101. close(fd);
  102. }
  103. }
  104. /* we do not handle other ctl data level */
  105. }
  106. fail:
  107. if (ifd)
  108. free(ifd);
  109. return (n);
  110. }
  111. ssize_t
  112. imsg_get(struct imsgbuf *ibuf, struct imsg *imsg)
  113. {
  114. size_t av, left, datalen;
  115. av = ibuf->r.wpos;
  116. if (IMSG_HEADER_SIZE > av)
  117. return (0);
  118. memcpy(&imsg->hdr, ibuf->r.buf, sizeof(imsg->hdr));
  119. if (imsg->hdr.len < IMSG_HEADER_SIZE ||
  120. imsg->hdr.len > MAX_IMSGSIZE) {
  121. errno = ERANGE;
  122. return (-1);
  123. }
  124. if (imsg->hdr.len > av)
  125. return (0);
  126. datalen = imsg->hdr.len - IMSG_HEADER_SIZE;
  127. ibuf->r.rptr = ibuf->r.buf + IMSG_HEADER_SIZE;
  128. if ((imsg->data = malloc(datalen)) == NULL)
  129. return (-1);
  130. if (imsg->hdr.flags & IMSGF_HASFD)
  131. imsg->fd = imsg_get_fd(ibuf);
  132. else
  133. imsg->fd = -1;
  134. memcpy(imsg->data, ibuf->r.rptr, datalen);
  135. if (imsg->hdr.len < av) {
  136. left = av - imsg->hdr.len;
  137. memmove(&ibuf->r.buf, ibuf->r.buf + imsg->hdr.len, left);
  138. ibuf->r.wpos = left;
  139. } else
  140. ibuf->r.wpos = 0;
  141. return (datalen + IMSG_HEADER_SIZE);
  142. }
  143. int
  144. imsg_compose(struct imsgbuf *ibuf, u_int32_t type, u_int32_t peerid,
  145. pid_t pid, int fd, const void *data, u_int16_t datalen)
  146. {
  147. struct ibuf *wbuf;
  148. if ((wbuf = imsg_create(ibuf, type, peerid, pid, datalen)) == NULL)
  149. return (-1);
  150. if (imsg_add(wbuf, data, datalen) == -1)
  151. return (-1);
  152. wbuf->fd = fd;
  153. imsg_close(ibuf, wbuf);
  154. return (1);
  155. }
  156. int
  157. imsg_composev(struct imsgbuf *ibuf, u_int32_t type, u_int32_t peerid,
  158. pid_t pid, int fd, const struct iovec *iov, int iovcnt)
  159. {
  160. struct ibuf *wbuf;
  161. int i, datalen = 0;
  162. for (i = 0; i < iovcnt; i++)
  163. datalen += iov[i].iov_len;
  164. if ((wbuf = imsg_create(ibuf, type, peerid, pid, datalen)) == NULL)
  165. return (-1);
  166. for (i = 0; i < iovcnt; i++)
  167. if (imsg_add(wbuf, iov[i].iov_base, iov[i].iov_len) == -1)
  168. return (-1);
  169. wbuf->fd = fd;
  170. imsg_close(ibuf, wbuf);
  171. return (1);
  172. }
  173. /* ARGSUSED */
  174. struct ibuf *
  175. imsg_create(struct imsgbuf *ibuf, u_int32_t type, u_int32_t peerid,
  176. pid_t pid, u_int16_t datalen)
  177. {
  178. struct ibuf *wbuf;
  179. struct imsg_hdr hdr;
  180. datalen += IMSG_HEADER_SIZE;
  181. if (datalen > MAX_IMSGSIZE) {
  182. errno = ERANGE;
  183. return (NULL);
  184. }
  185. hdr.type = type;
  186. hdr.flags = 0;
  187. hdr.peerid = peerid;
  188. if ((hdr.pid = pid) == 0)
  189. hdr.pid = ibuf->pid;
  190. if ((wbuf = ibuf_dynamic(datalen, MAX_IMSGSIZE)) == NULL) {
  191. return (NULL);
  192. }
  193. if (imsg_add(wbuf, &hdr, sizeof(hdr)) == -1)
  194. return (NULL);
  195. return (wbuf);
  196. }
  197. int
  198. imsg_add(struct ibuf *msg, const void *data, u_int16_t datalen)
  199. {
  200. if (datalen)
  201. if (ibuf_add(msg, data, datalen) == -1) {
  202. ibuf_free(msg);
  203. return (-1);
  204. }
  205. return (datalen);
  206. }
  207. void
  208. imsg_close(struct imsgbuf *ibuf, struct ibuf *msg)
  209. {
  210. struct imsg_hdr *hdr;
  211. hdr = (struct imsg_hdr *)msg->buf;
  212. hdr->flags &= ~IMSGF_HASFD;
  213. if (msg->fd != -1)
  214. hdr->flags |= IMSGF_HASFD;
  215. hdr->len = (u_int16_t)msg->wpos;
  216. ibuf_close(&ibuf->w, msg);
  217. }
  218. void
  219. imsg_free(struct imsg *imsg)
  220. {
  221. free(imsg->data);
  222. }
  223. int
  224. imsg_get_fd(struct imsgbuf *ibuf)
  225. {
  226. int fd;
  227. struct imsg_fd *ifd;
  228. if ((ifd = TAILQ_FIRST(&ibuf->fds)) == NULL)
  229. return (-1);
  230. fd = ifd->fd;
  231. TAILQ_REMOVE(&ibuf->fds, ifd, entry);
  232. free(ifd);
  233. return (fd);
  234. }
  235. int
  236. imsg_flush(struct imsgbuf *ibuf)
  237. {
  238. while (ibuf->w.queued)
  239. if (msgbuf_write(&ibuf->w) < 0)
  240. return (-1);
  241. return (0);
  242. }
  243. void
  244. imsg_clear(struct imsgbuf *ibuf)
  245. {
  246. int fd;
  247. msgbuf_clear(&ibuf->w);
  248. while ((fd = imsg_get_fd(ibuf)) != -1)
  249. close(fd);
  250. }