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