sysv_msg.c revision 1.68 1 1.68 pgoyette /* $NetBSD: sysv_msg.c,v 1.68 2015/05/13 01:00:16 pgoyette Exp $ */
2 1.26 thorpej
3 1.26 thorpej /*-
4 1.48 ad * Copyright (c) 1999, 2006, 2007 The NetBSD Foundation, Inc.
5 1.26 thorpej * All rights reserved.
6 1.26 thorpej *
7 1.26 thorpej * This code is derived from software contributed to The NetBSD Foundation
8 1.26 thorpej * by Jason R. Thorpe of the Numerical Aerospace Simulation Facility,
9 1.48 ad * NASA Ames Research Center, and by Andrew Doran.
10 1.26 thorpej *
11 1.26 thorpej * Redistribution and use in source and binary forms, with or without
12 1.26 thorpej * modification, are permitted provided that the following conditions
13 1.26 thorpej * are met:
14 1.26 thorpej * 1. Redistributions of source code must retain the above copyright
15 1.26 thorpej * notice, this list of conditions and the following disclaimer.
16 1.26 thorpej * 2. Redistributions in binary form must reproduce the above copyright
17 1.26 thorpej * notice, this list of conditions and the following disclaimer in the
18 1.26 thorpej * documentation and/or other materials provided with the distribution.
19 1.26 thorpej *
20 1.26 thorpej * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
21 1.26 thorpej * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
22 1.26 thorpej * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
23 1.26 thorpej * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
24 1.26 thorpej * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
25 1.26 thorpej * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
26 1.26 thorpej * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
27 1.26 thorpej * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
28 1.26 thorpej * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
29 1.26 thorpej * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
30 1.26 thorpej * POSSIBILITY OF SUCH DAMAGE.
31 1.26 thorpej */
32 1.9 cgd
33 1.1 cgd /*
34 1.1 cgd * Implementation of SVID messages
35 1.1 cgd *
36 1.26 thorpej * Author: Daniel Boulet
37 1.1 cgd *
38 1.1 cgd * Copyright 1993 Daniel Boulet and RTMX Inc.
39 1.1 cgd *
40 1.1 cgd * This system call was implemented by Daniel Boulet under contract from RTMX.
41 1.1 cgd *
42 1.1 cgd * Redistribution and use in source forms, with and without modification,
43 1.1 cgd * are permitted provided that this entire comment appears intact.
44 1.1 cgd *
45 1.1 cgd * Redistribution in binary form may occur without any restrictions.
46 1.1 cgd * Obviously, it would be nice if you gave credit where credit is due
47 1.1 cgd * but requiring it would be too onerous.
48 1.1 cgd *
49 1.1 cgd * This software is provided ``AS IS'' without any warranties of any kind.
50 1.1 cgd */
51 1.33 lukem
52 1.33 lukem #include <sys/cdefs.h>
53 1.68 pgoyette __KERNEL_RCSID(0, "$NetBSD: sysv_msg.c,v 1.68 2015/05/13 01:00:16 pgoyette Exp $");
54 1.23 tron
55 1.67 pgoyette #ifdef _KERNEL_OPT
56 1.67 pgoyette #include "opt_sysv.h"
57 1.67 pgoyette #endif
58 1.1 cgd
59 1.2 mycroft #include <sys/param.h>
60 1.2 mycroft #include <sys/kernel.h>
61 1.2 mycroft #include <sys/msg.h>
62 1.29 simonb #include <sys/sysctl.h>
63 1.29 simonb #include <sys/mount.h> /* XXX for <sys/syscallargs.h> */
64 1.10 cgd #include <sys/syscallargs.h>
65 1.42 elad #include <sys/kauth.h>
66 1.18 christos
67 1.1 cgd #define MSG_DEBUG
68 1.1 cgd #undef MSG_DEBUG_OK
69 1.1 cgd
70 1.20 christos #ifdef MSG_DEBUG_OK
71 1.21 christos #define MSG_PRINTF(a) printf a
72 1.20 christos #else
73 1.20 christos #define MSG_PRINTF(a)
74 1.20 christos #endif
75 1.20 christos
76 1.36 jdolecek static int nfree_msgmaps; /* # of free map entries */
77 1.36 jdolecek static short free_msgmaps; /* head of linked list of free map entries */
78 1.36 jdolecek static struct __msg *free_msghdrs; /* list of free msg headers */
79 1.36 jdolecek static char *msgpool; /* MSGMAX byte long msg buffer pool */
80 1.36 jdolecek static struct msgmap *msgmaps; /* MSGSEG msgmap structures */
81 1.36 jdolecek static struct __msg *msghdrs; /* MSGTQL msg headers */
82 1.48 ad
83 1.48 ad kmsq_t *msqs; /* MSGMNI msqid_ds struct's */
84 1.48 ad kmutex_t msgmutex; /* subsystem lock */
85 1.1 cgd
86 1.51 rmind static u_int msg_waiters = 0; /* total number of msgrcv waiters */
87 1.51 rmind static bool msg_realloc_state;
88 1.51 rmind static kcondvar_t msg_realloc_cv;
89 1.51 rmind
90 1.37 junyoung static void msg_freehdr(struct __msg *);
91 1.18 christos
92 1.68 pgoyette extern int kern_has_sysvmsg;
93 1.68 pgoyette
94 1.18 christos void
95 1.40 thorpej msginit(void)
96 1.1 cgd {
97 1.36 jdolecek int i, sz;
98 1.36 jdolecek vaddr_t v;
99 1.1 cgd
100 1.3 mycroft /*
101 1.3 mycroft * msginfo.msgssz should be a power of two for efficiency reasons.
102 1.3 mycroft * It is also pretty silly if msginfo.msgssz is less than 8
103 1.3 mycroft * or greater than about 256 so ...
104 1.3 mycroft */
105 1.1 cgd
106 1.3 mycroft i = 8;
107 1.3 mycroft while (i < 1024 && i != msginfo.msgssz)
108 1.3 mycroft i <<= 1;
109 1.50 rmind if (i != msginfo.msgssz) {
110 1.50 rmind panic("msginfo.msgssz = %d, not a small power of 2",
111 1.50 rmind msginfo.msgssz);
112 1.3 mycroft }
113 1.3 mycroft
114 1.3 mycroft if (msginfo.msgseg > 32767) {
115 1.50 rmind panic("msginfo.msgseg = %d > 32767", msginfo.msgseg);
116 1.3 mycroft }
117 1.3 mycroft
118 1.51 rmind /* Allocate the wired memory for our structures */
119 1.51 rmind sz = ALIGN(msginfo.msgmax) +
120 1.51 rmind ALIGN(msginfo.msgseg * sizeof(struct msgmap)) +
121 1.51 rmind ALIGN(msginfo.msgtql * sizeof(struct __msg)) +
122 1.51 rmind ALIGN(msginfo.msgmni * sizeof(kmsq_t));
123 1.62 uebayasi sz = round_page(sz);
124 1.62 uebayasi v = uvm_km_alloc(kernel_map, sz, 0, UVM_KMF_WIRED|UVM_KMF_ZERO);
125 1.39 yamt if (v == 0)
126 1.36 jdolecek panic("sysv_msg: cannot allocate memory");
127 1.36 jdolecek msgpool = (void *)v;
128 1.58 rmind msgmaps = (void *)((uintptr_t)msgpool + ALIGN(msginfo.msgmax));
129 1.58 rmind msghdrs = (void *)((uintptr_t)msgmaps +
130 1.58 rmind ALIGN(msginfo.msgseg * sizeof(struct msgmap)));
131 1.58 rmind msqs = (void *)((uintptr_t)msghdrs +
132 1.58 rmind ALIGN(msginfo.msgtql * sizeof(struct __msg)));
133 1.50 rmind
134 1.50 rmind for (i = 0; i < (msginfo.msgseg - 1); i++)
135 1.50 rmind msgmaps[i].next = i + 1;
136 1.50 rmind msgmaps[msginfo.msgseg - 1].next = -1;
137 1.50 rmind
138 1.3 mycroft free_msgmaps = 0;
139 1.3 mycroft nfree_msgmaps = msginfo.msgseg;
140 1.3 mycroft
141 1.50 rmind for (i = 0; i < (msginfo.msgtql - 1); i++) {
142 1.3 mycroft msghdrs[i].msg_type = 0;
143 1.50 rmind msghdrs[i].msg_next = &msghdrs[i + 1];
144 1.50 rmind }
145 1.50 rmind i = msginfo.msgtql - 1;
146 1.50 rmind msghdrs[i].msg_type = 0;
147 1.50 rmind msghdrs[i].msg_next = NULL;
148 1.3 mycroft free_msghdrs = &msghdrs[0];
149 1.3 mycroft
150 1.4 mycroft for (i = 0; i < msginfo.msgmni; i++) {
151 1.48 ad cv_init(&msqs[i].msq_cv, "msgwait");
152 1.50 rmind /* Implies entry is available */
153 1.50 rmind msqs[i].msq_u.msg_qbytes = 0;
154 1.50 rmind /* Reset to a known value */
155 1.50 rmind msqs[i].msq_u.msg_perm._seq = 0;
156 1.3 mycroft }
157 1.48 ad
158 1.48 ad mutex_init(&msgmutex, MUTEX_DEFAULT, IPL_NONE);
159 1.51 rmind cv_init(&msg_realloc_cv, "msgrealc");
160 1.51 rmind msg_realloc_state = false;
161 1.63 elad
162 1.68 pgoyette kern_has_sysvmsg = 1;
163 1.68 pgoyette
164 1.63 elad sysvipcinit();
165 1.51 rmind }
166 1.51 rmind
167 1.51 rmind static int
168 1.51 rmind msgrealloc(int newmsgmni, int newmsgseg)
169 1.51 rmind {
170 1.51 rmind struct msgmap *new_msgmaps;
171 1.51 rmind struct __msg *new_msghdrs, *new_free_msghdrs;
172 1.51 rmind char *old_msgpool, *new_msgpool;
173 1.51 rmind kmsq_t *new_msqs;
174 1.51 rmind vaddr_t v;
175 1.51 rmind int i, sz, msqid, newmsgmax, new_nfree_msgmaps;
176 1.51 rmind short new_free_msgmaps;
177 1.51 rmind
178 1.51 rmind if (newmsgmni < 1 || newmsgseg < 1)
179 1.51 rmind return EINVAL;
180 1.51 rmind
181 1.51 rmind /* Allocate the wired memory for our structures */
182 1.51 rmind newmsgmax = msginfo.msgssz * newmsgseg;
183 1.51 rmind sz = ALIGN(newmsgmax) +
184 1.51 rmind ALIGN(newmsgseg * sizeof(struct msgmap)) +
185 1.51 rmind ALIGN(msginfo.msgtql * sizeof(struct __msg)) +
186 1.51 rmind ALIGN(newmsgmni * sizeof(kmsq_t));
187 1.62 uebayasi sz = round_page(sz);
188 1.62 uebayasi v = uvm_km_alloc(kernel_map, sz, 0, UVM_KMF_WIRED|UVM_KMF_ZERO);
189 1.51 rmind if (v == 0)
190 1.51 rmind return ENOMEM;
191 1.51 rmind
192 1.51 rmind mutex_enter(&msgmutex);
193 1.51 rmind if (msg_realloc_state) {
194 1.51 rmind mutex_exit(&msgmutex);
195 1.51 rmind uvm_km_free(kernel_map, v, sz, UVM_KMF_WIRED);
196 1.51 rmind return EBUSY;
197 1.51 rmind }
198 1.51 rmind msg_realloc_state = true;
199 1.51 rmind if (msg_waiters) {
200 1.51 rmind /*
201 1.51 rmind * Mark reallocation state, wake-up all waiters,
202 1.51 rmind * and wait while they will all exit.
203 1.51 rmind */
204 1.51 rmind for (i = 0; i < msginfo.msgmni; i++)
205 1.51 rmind cv_broadcast(&msqs[i].msq_cv);
206 1.51 rmind while (msg_waiters)
207 1.51 rmind cv_wait(&msg_realloc_cv, &msgmutex);
208 1.51 rmind }
209 1.51 rmind old_msgpool = msgpool;
210 1.51 rmind
211 1.51 rmind /* We cannot reallocate less memory than we use */
212 1.51 rmind i = 0;
213 1.51 rmind for (msqid = 0; msqid < msginfo.msgmni; msqid++) {
214 1.51 rmind struct msqid_ds *mptr;
215 1.51 rmind kmsq_t *msq;
216 1.51 rmind
217 1.51 rmind msq = &msqs[msqid];
218 1.51 rmind mptr = &msq->msq_u;
219 1.51 rmind if (mptr->msg_qbytes || (mptr->msg_perm.mode & MSG_LOCKED))
220 1.51 rmind i = msqid;
221 1.51 rmind }
222 1.51 rmind if (i >= newmsgmni || (msginfo.msgseg - nfree_msgmaps) > newmsgseg) {
223 1.51 rmind mutex_exit(&msgmutex);
224 1.51 rmind uvm_km_free(kernel_map, v, sz, UVM_KMF_WIRED);
225 1.51 rmind return EBUSY;
226 1.51 rmind }
227 1.51 rmind
228 1.51 rmind new_msgpool = (void *)v;
229 1.58 rmind new_msgmaps = (void *)((uintptr_t)new_msgpool + ALIGN(newmsgmax));
230 1.58 rmind new_msghdrs = (void *)((uintptr_t)new_msgmaps +
231 1.58 rmind ALIGN(newmsgseg * sizeof(struct msgmap)));
232 1.58 rmind new_msqs = (void *)((uintptr_t)new_msghdrs +
233 1.58 rmind ALIGN(msginfo.msgtql * sizeof(struct __msg)));
234 1.51 rmind
235 1.51 rmind /* Initialize the structures */
236 1.51 rmind for (i = 0; i < (newmsgseg - 1); i++)
237 1.51 rmind new_msgmaps[i].next = i + 1;
238 1.51 rmind new_msgmaps[newmsgseg - 1].next = -1;
239 1.51 rmind new_free_msgmaps = 0;
240 1.51 rmind new_nfree_msgmaps = newmsgseg;
241 1.51 rmind
242 1.51 rmind for (i = 0; i < (msginfo.msgtql - 1); i++) {
243 1.51 rmind new_msghdrs[i].msg_type = 0;
244 1.51 rmind new_msghdrs[i].msg_next = &new_msghdrs[i + 1];
245 1.51 rmind }
246 1.51 rmind i = msginfo.msgtql - 1;
247 1.51 rmind new_msghdrs[i].msg_type = 0;
248 1.51 rmind new_msghdrs[i].msg_next = NULL;
249 1.51 rmind new_free_msghdrs = &new_msghdrs[0];
250 1.51 rmind
251 1.51 rmind for (i = 0; i < newmsgmni; i++) {
252 1.51 rmind new_msqs[i].msq_u.msg_qbytes = 0;
253 1.51 rmind new_msqs[i].msq_u.msg_perm._seq = 0;
254 1.51 rmind cv_init(&new_msqs[i].msq_cv, "msgwait");
255 1.51 rmind }
256 1.51 rmind
257 1.51 rmind /*
258 1.65 msaitoh * Copy all message queue identifiers, message headers and buffer
259 1.51 rmind * pools to the new memory location.
260 1.51 rmind */
261 1.51 rmind for (msqid = 0; msqid < msginfo.msgmni; msqid++) {
262 1.51 rmind struct __msg *nmsghdr, *msghdr, *pmsghdr;
263 1.51 rmind struct msqid_ds *nmptr, *mptr;
264 1.51 rmind kmsq_t *nmsq, *msq;
265 1.51 rmind
266 1.51 rmind msq = &msqs[msqid];
267 1.51 rmind mptr = &msq->msq_u;
268 1.51 rmind
269 1.51 rmind if (mptr->msg_qbytes == 0 &&
270 1.51 rmind (mptr->msg_perm.mode & MSG_LOCKED) == 0)
271 1.51 rmind continue;
272 1.51 rmind
273 1.51 rmind nmsq = &new_msqs[msqid];
274 1.51 rmind nmptr = &nmsq->msq_u;
275 1.51 rmind memcpy(nmptr, mptr, sizeof(struct msqid_ds));
276 1.51 rmind
277 1.51 rmind /*
278 1.51 rmind * Go through the message headers, and and copy each
279 1.51 rmind * one by taking the new ones, and thus defragmenting.
280 1.51 rmind */
281 1.51 rmind nmsghdr = pmsghdr = NULL;
282 1.51 rmind msghdr = mptr->_msg_first;
283 1.51 rmind while (msghdr) {
284 1.51 rmind short nnext = 0, next;
285 1.51 rmind u_short msgsz, segcnt;
286 1.51 rmind
287 1.51 rmind /* Take an entry from the new list of free msghdrs */
288 1.51 rmind nmsghdr = new_free_msghdrs;
289 1.51 rmind KASSERT(nmsghdr != NULL);
290 1.51 rmind new_free_msghdrs = nmsghdr->msg_next;
291 1.51 rmind
292 1.51 rmind nmsghdr->msg_next = NULL;
293 1.51 rmind if (pmsghdr) {
294 1.51 rmind pmsghdr->msg_next = nmsghdr;
295 1.51 rmind } else {
296 1.51 rmind nmptr->_msg_first = nmsghdr;
297 1.51 rmind pmsghdr = nmsghdr;
298 1.51 rmind }
299 1.51 rmind nmsghdr->msg_ts = msghdr->msg_ts;
300 1.51 rmind nmsghdr->msg_spot = -1;
301 1.51 rmind
302 1.51 rmind /* Compute the amount of segments and reserve them */
303 1.51 rmind msgsz = msghdr->msg_ts;
304 1.51 rmind segcnt = (msgsz + msginfo.msgssz - 1) / msginfo.msgssz;
305 1.51 rmind if (segcnt == 0)
306 1.51 rmind continue;
307 1.51 rmind while (segcnt--) {
308 1.51 rmind nnext = new_free_msgmaps;
309 1.51 rmind new_free_msgmaps = new_msgmaps[nnext].next;
310 1.51 rmind new_nfree_msgmaps--;
311 1.51 rmind new_msgmaps[nnext].next = nmsghdr->msg_spot;
312 1.51 rmind nmsghdr->msg_spot = nnext;
313 1.51 rmind }
314 1.51 rmind
315 1.51 rmind /* Copy all segments */
316 1.51 rmind KASSERT(nnext == nmsghdr->msg_spot);
317 1.51 rmind next = msghdr->msg_spot;
318 1.51 rmind while (msgsz > 0) {
319 1.51 rmind size_t tlen;
320 1.51 rmind
321 1.51 rmind if (msgsz >= msginfo.msgssz) {
322 1.51 rmind tlen = msginfo.msgssz;
323 1.51 rmind msgsz -= msginfo.msgssz;
324 1.51 rmind } else {
325 1.51 rmind tlen = msgsz;
326 1.51 rmind msgsz = 0;
327 1.51 rmind }
328 1.51 rmind
329 1.51 rmind /* Copy the message buffer */
330 1.51 rmind memcpy(&new_msgpool[nnext * msginfo.msgssz],
331 1.51 rmind &msgpool[next * msginfo.msgssz], tlen);
332 1.51 rmind
333 1.51 rmind /* Next entry of the map */
334 1.51 rmind nnext = msgmaps[nnext].next;
335 1.51 rmind next = msgmaps[next].next;
336 1.51 rmind }
337 1.51 rmind
338 1.51 rmind /* Next message header */
339 1.51 rmind msghdr = msghdr->msg_next;
340 1.51 rmind }
341 1.51 rmind nmptr->_msg_last = nmsghdr;
342 1.51 rmind }
343 1.51 rmind KASSERT((msginfo.msgseg - nfree_msgmaps) ==
344 1.51 rmind (newmsgseg - new_nfree_msgmaps));
345 1.51 rmind
346 1.51 rmind sz = ALIGN(msginfo.msgmax) +
347 1.51 rmind ALIGN(msginfo.msgseg * sizeof(struct msgmap)) +
348 1.51 rmind ALIGN(msginfo.msgtql * sizeof(struct __msg)) +
349 1.51 rmind ALIGN(msginfo.msgmni * sizeof(kmsq_t));
350 1.62 uebayasi sz = round_page(sz);
351 1.51 rmind
352 1.51 rmind for (i = 0; i < msginfo.msgmni; i++)
353 1.51 rmind cv_destroy(&msqs[i].msq_cv);
354 1.51 rmind
355 1.51 rmind /* Set the pointers and update the new values */
356 1.51 rmind msgpool = new_msgpool;
357 1.51 rmind msgmaps = new_msgmaps;
358 1.51 rmind msghdrs = new_msghdrs;
359 1.51 rmind msqs = new_msqs;
360 1.51 rmind
361 1.51 rmind free_msghdrs = new_free_msghdrs;
362 1.51 rmind free_msgmaps = new_free_msgmaps;
363 1.51 rmind nfree_msgmaps = new_nfree_msgmaps;
364 1.51 rmind msginfo.msgmni = newmsgmni;
365 1.51 rmind msginfo.msgseg = newmsgseg;
366 1.51 rmind msginfo.msgmax = newmsgmax;
367 1.51 rmind
368 1.51 rmind /* Reallocation completed - notify all waiters, if any */
369 1.51 rmind msg_realloc_state = false;
370 1.51 rmind cv_broadcast(&msg_realloc_cv);
371 1.51 rmind mutex_exit(&msgmutex);
372 1.51 rmind
373 1.51 rmind uvm_km_free(kernel_map, (vaddr_t)old_msgpool, sz, UVM_KMF_WIRED);
374 1.51 rmind return 0;
375 1.1 cgd }
376 1.1 cgd
377 1.3 mycroft static void
378 1.40 thorpej msg_freehdr(struct __msg *msghdr)
379 1.1 cgd {
380 1.48 ad
381 1.48 ad KASSERT(mutex_owned(&msgmutex));
382 1.48 ad
383 1.3 mycroft while (msghdr->msg_ts > 0) {
384 1.3 mycroft short next;
385 1.50 rmind KASSERT(msghdr->msg_spot >= 0);
386 1.50 rmind KASSERT(msghdr->msg_spot < msginfo.msgseg);
387 1.50 rmind
388 1.3 mycroft next = msgmaps[msghdr->msg_spot].next;
389 1.3 mycroft msgmaps[msghdr->msg_spot].next = free_msgmaps;
390 1.3 mycroft free_msgmaps = msghdr->msg_spot;
391 1.5 mycroft nfree_msgmaps++;
392 1.3 mycroft msghdr->msg_spot = next;
393 1.3 mycroft if (msghdr->msg_ts >= msginfo.msgssz)
394 1.3 mycroft msghdr->msg_ts -= msginfo.msgssz;
395 1.3 mycroft else
396 1.3 mycroft msghdr->msg_ts = 0;
397 1.3 mycroft }
398 1.50 rmind KASSERT(msghdr->msg_spot == -1);
399 1.3 mycroft msghdr->msg_next = free_msghdrs;
400 1.3 mycroft free_msghdrs = msghdr;
401 1.1 cgd }
402 1.1 cgd
403 1.1 cgd int
404 1.59 christos sys___msgctl50(struct lwp *l, const struct sys___msgctl50_args *uap,
405 1.59 christos register_t *retval)
406 1.16 thorpej {
407 1.54 dsl /* {
408 1.10 cgd syscallarg(int) msqid;
409 1.10 cgd syscallarg(int) cmd;
410 1.10 cgd syscallarg(struct msqid_ds *) buf;
411 1.54 dsl } */
412 1.26 thorpej struct msqid_ds msqbuf;
413 1.26 thorpej int cmd, error;
414 1.26 thorpej
415 1.26 thorpej cmd = SCARG(uap, cmd);
416 1.26 thorpej
417 1.26 thorpej if (cmd == IPC_SET) {
418 1.26 thorpej error = copyin(SCARG(uap, buf), &msqbuf, sizeof(msqbuf));
419 1.26 thorpej if (error)
420 1.26 thorpej return (error);
421 1.26 thorpej }
422 1.26 thorpej
423 1.44 ad error = msgctl1(l, SCARG(uap, msqid), cmd,
424 1.26 thorpej (cmd == IPC_SET || cmd == IPC_STAT) ? &msqbuf : NULL);
425 1.26 thorpej
426 1.26 thorpej if (error == 0 && cmd == IPC_STAT)
427 1.26 thorpej error = copyout(&msqbuf, SCARG(uap, buf), sizeof(msqbuf));
428 1.26 thorpej
429 1.26 thorpej return (error);
430 1.26 thorpej }
431 1.26 thorpej
432 1.26 thorpej int
433 1.44 ad msgctl1(struct lwp *l, int msqid, int cmd, struct msqid_ds *msqbuf)
434 1.26 thorpej {
435 1.44 ad kauth_cred_t cred = l->l_cred;
436 1.26 thorpej struct msqid_ds *msqptr;
437 1.48 ad kmsq_t *msq;
438 1.26 thorpej int error = 0, ix;
439 1.1 cgd
440 1.26 thorpej MSG_PRINTF(("call to msgctl1(%d, %d)\n", msqid, cmd));
441 1.1 cgd
442 1.26 thorpej ix = IPCID_TO_IX(msqid);
443 1.1 cgd
444 1.48 ad mutex_enter(&msgmutex);
445 1.48 ad
446 1.26 thorpej if (ix < 0 || ix >= msginfo.msgmni) {
447 1.26 thorpej MSG_PRINTF(("msqid (%d) out of range (0<=msqid<%d)\n", ix,
448 1.20 christos msginfo.msgmni));
449 1.48 ad error = EINVAL;
450 1.48 ad goto unlock;
451 1.3 mycroft }
452 1.1 cgd
453 1.48 ad msq = &msqs[ix];
454 1.48 ad msqptr = &msq->msq_u;
455 1.1 cgd
456 1.3 mycroft if (msqptr->msg_qbytes == 0) {
457 1.20 christos MSG_PRINTF(("no such msqid\n"));
458 1.48 ad error = EINVAL;
459 1.48 ad goto unlock;
460 1.3 mycroft }
461 1.26 thorpej if (msqptr->msg_perm._seq != IPCID_TO_SEQ(msqid)) {
462 1.20 christos MSG_PRINTF(("wrong sequence number\n"));
463 1.48 ad error = EINVAL;
464 1.48 ad goto unlock;
465 1.3 mycroft }
466 1.1 cgd
467 1.3 mycroft switch (cmd) {
468 1.3 mycroft case IPC_RMID:
469 1.1 cgd {
470 1.26 thorpej struct __msg *msghdr;
471 1.26 thorpej if ((error = ipcperm(cred, &msqptr->msg_perm, IPC_M)) != 0)
472 1.48 ad break;
473 1.3 mycroft /* Free the message headers */
474 1.26 thorpej msghdr = msqptr->_msg_first;
475 1.3 mycroft while (msghdr != NULL) {
476 1.26 thorpej struct __msg *msghdr_tmp;
477 1.3 mycroft
478 1.3 mycroft /* Free the segments of each message */
479 1.26 thorpej msqptr->_msg_cbytes -= msghdr->msg_ts;
480 1.5 mycroft msqptr->msg_qnum--;
481 1.3 mycroft msghdr_tmp = msghdr;
482 1.3 mycroft msghdr = msghdr->msg_next;
483 1.3 mycroft msg_freehdr(msghdr_tmp);
484 1.3 mycroft }
485 1.50 rmind KASSERT(msqptr->_msg_cbytes == 0);
486 1.50 rmind KASSERT(msqptr->msg_qnum == 0);
487 1.1 cgd
488 1.50 rmind /* Mark it as free */
489 1.50 rmind msqptr->msg_qbytes = 0;
490 1.48 ad cv_broadcast(&msq->msq_cv);
491 1.1 cgd }
492 1.3 mycroft break;
493 1.1 cgd
494 1.3 mycroft case IPC_SET:
495 1.26 thorpej if ((error = ipcperm(cred, &msqptr->msg_perm, IPC_M)))
496 1.48 ad break;
497 1.44 ad if (msqbuf->msg_qbytes > msqptr->msg_qbytes &&
498 1.63 elad kauth_authorize_system(cred, KAUTH_SYSTEM_SYSVIPC,
499 1.63 elad KAUTH_REQ_SYSTEM_SYSVIPC_MSGQ_OVERSIZE,
500 1.63 elad KAUTH_ARG(msqbuf->msg_qbytes),
501 1.63 elad KAUTH_ARG(msqptr->msg_qbytes), NULL) != 0) {
502 1.48 ad error = EPERM;
503 1.48 ad break;
504 1.48 ad }
505 1.26 thorpej if (msqbuf->msg_qbytes > msginfo.msgmnb) {
506 1.26 thorpej MSG_PRINTF(("can't increase msg_qbytes beyond %d "
507 1.26 thorpej "(truncating)\n", msginfo.msgmnb));
508 1.26 thorpej /* silently restrict qbytes to system limit */
509 1.26 thorpej msqbuf->msg_qbytes = msginfo.msgmnb;
510 1.3 mycroft }
511 1.26 thorpej if (msqbuf->msg_qbytes == 0) {
512 1.20 christos MSG_PRINTF(("can't reduce msg_qbytes to 0\n"));
513 1.48 ad error = EINVAL; /* XXX non-standard errno! */
514 1.48 ad break;
515 1.3 mycroft }
516 1.26 thorpej msqptr->msg_perm.uid = msqbuf->msg_perm.uid;
517 1.26 thorpej msqptr->msg_perm.gid = msqbuf->msg_perm.gid;
518 1.3 mycroft msqptr->msg_perm.mode = (msqptr->msg_perm.mode & ~0777) |
519 1.26 thorpej (msqbuf->msg_perm.mode & 0777);
520 1.26 thorpej msqptr->msg_qbytes = msqbuf->msg_qbytes;
521 1.43 kardel msqptr->msg_ctime = time_second;
522 1.3 mycroft break;
523 1.1 cgd
524 1.3 mycroft case IPC_STAT:
525 1.26 thorpej if ((error = ipcperm(cred, &msqptr->msg_perm, IPC_R))) {
526 1.20 christos MSG_PRINTF(("requester doesn't have read access\n"));
527 1.49 ad break;
528 1.3 mycroft }
529 1.26 thorpej memcpy(msqbuf, msqptr, sizeof(struct msqid_ds));
530 1.3 mycroft break;
531 1.1 cgd
532 1.3 mycroft default:
533 1.20 christos MSG_PRINTF(("invalid command %d\n", cmd));
534 1.48 ad error = EINVAL;
535 1.48 ad break;
536 1.3 mycroft }
537 1.3 mycroft
538 1.50 rmind unlock:
539 1.48 ad mutex_exit(&msgmutex);
540 1.26 thorpej return (error);
541 1.1 cgd }
542 1.1 cgd
543 1.1 cgd int
544 1.54 dsl sys_msgget(struct lwp *l, const struct sys_msgget_args *uap, register_t *retval)
545 1.16 thorpej {
546 1.54 dsl /* {
547 1.10 cgd syscallarg(key_t) key;
548 1.10 cgd syscallarg(int) msgflg;
549 1.54 dsl } */
550 1.48 ad int msqid, error = 0;
551 1.10 cgd int key = SCARG(uap, key);
552 1.10 cgd int msgflg = SCARG(uap, msgflg);
553 1.44 ad kauth_cred_t cred = l->l_cred;
554 1.26 thorpej struct msqid_ds *msqptr = NULL;
555 1.48 ad kmsq_t *msq;
556 1.48 ad
557 1.48 ad mutex_enter(&msgmutex);
558 1.1 cgd
559 1.20 christos MSG_PRINTF(("msgget(0x%x, 0%o)\n", key, msgflg));
560 1.1 cgd
561 1.5 mycroft if (key != IPC_PRIVATE) {
562 1.5 mycroft for (msqid = 0; msqid < msginfo.msgmni; msqid++) {
563 1.48 ad msq = &msqs[msqid];
564 1.48 ad msqptr = &msq->msq_u;
565 1.3 mycroft if (msqptr->msg_qbytes != 0 &&
566 1.26 thorpej msqptr->msg_perm._key == key)
567 1.3 mycroft break;
568 1.3 mycroft }
569 1.3 mycroft if (msqid < msginfo.msgmni) {
570 1.20 christos MSG_PRINTF(("found public key\n"));
571 1.3 mycroft if ((msgflg & IPC_CREAT) && (msgflg & IPC_EXCL)) {
572 1.20 christos MSG_PRINTF(("not exclusive\n"));
573 1.48 ad error = EEXIST;
574 1.48 ad goto unlock;
575 1.3 mycroft }
576 1.26 thorpej if ((error = ipcperm(cred, &msqptr->msg_perm,
577 1.26 thorpej msgflg & 0700 ))) {
578 1.20 christos MSG_PRINTF(("requester doesn't have 0%o access\n",
579 1.20 christos msgflg & 0700));
580 1.48 ad goto unlock;
581 1.3 mycroft }
582 1.5 mycroft goto found;
583 1.3 mycroft }
584 1.1 cgd }
585 1.1 cgd
586 1.20 christos MSG_PRINTF(("need to allocate the msqid_ds\n"));
587 1.5 mycroft if (key == IPC_PRIVATE || (msgflg & IPC_CREAT)) {
588 1.5 mycroft for (msqid = 0; msqid < msginfo.msgmni; msqid++) {
589 1.5 mycroft /*
590 1.5 mycroft * Look for an unallocated and unlocked msqid_ds.
591 1.5 mycroft * msqid_ds's can be locked by msgsnd or msgrcv while
592 1.5 mycroft * they are copying the message in/out. We can't
593 1.5 mycroft * re-use the entry until they release it.
594 1.5 mycroft */
595 1.48 ad msq = &msqs[msqid];
596 1.48 ad msqptr = &msq->msq_u;
597 1.5 mycroft if (msqptr->msg_qbytes == 0 &&
598 1.5 mycroft (msqptr->msg_perm.mode & MSG_LOCKED) == 0)
599 1.5 mycroft break;
600 1.5 mycroft }
601 1.5 mycroft if (msqid == msginfo.msgmni) {
602 1.20 christos MSG_PRINTF(("no more msqid_ds's available\n"));
603 1.48 ad error = ENOSPC;
604 1.48 ad goto unlock;
605 1.5 mycroft }
606 1.20 christos MSG_PRINTF(("msqid %d is available\n", msqid));
607 1.26 thorpej msqptr->msg_perm._key = key;
608 1.42 elad msqptr->msg_perm.cuid = kauth_cred_geteuid(cred);
609 1.42 elad msqptr->msg_perm.uid = kauth_cred_geteuid(cred);
610 1.42 elad msqptr->msg_perm.cgid = kauth_cred_getegid(cred);
611 1.42 elad msqptr->msg_perm.gid = kauth_cred_getegid(cred);
612 1.5 mycroft msqptr->msg_perm.mode = (msgflg & 0777);
613 1.5 mycroft /* Make sure that the returned msqid is unique */
614 1.26 thorpej msqptr->msg_perm._seq++;
615 1.26 thorpej msqptr->_msg_first = NULL;
616 1.26 thorpej msqptr->_msg_last = NULL;
617 1.26 thorpej msqptr->_msg_cbytes = 0;
618 1.5 mycroft msqptr->msg_qnum = 0;
619 1.5 mycroft msqptr->msg_qbytes = msginfo.msgmnb;
620 1.5 mycroft msqptr->msg_lspid = 0;
621 1.5 mycroft msqptr->msg_lrpid = 0;
622 1.5 mycroft msqptr->msg_stime = 0;
623 1.5 mycroft msqptr->msg_rtime = 0;
624 1.43 kardel msqptr->msg_ctime = time_second;
625 1.5 mycroft } else {
626 1.20 christos MSG_PRINTF(("didn't find it and wasn't asked to create it\n"));
627 1.48 ad error = ENOENT;
628 1.48 ad goto unlock;
629 1.1 cgd }
630 1.1 cgd
631 1.50 rmind found:
632 1.3 mycroft /* Construct the unique msqid */
633 1.3 mycroft *retval = IXSEQ_TO_IPCID(msqid, msqptr->msg_perm);
634 1.48 ad
635 1.50 rmind unlock:
636 1.50 rmind mutex_exit(&msgmutex);
637 1.48 ad return (error);
638 1.1 cgd }
639 1.1 cgd
640 1.1 cgd int
641 1.54 dsl sys_msgsnd(struct lwp *l, const struct sys_msgsnd_args *uap, register_t *retval)
642 1.16 thorpej {
643 1.54 dsl /* {
644 1.10 cgd syscallarg(int) msqid;
645 1.22 kleink syscallarg(const void *) msgp;
646 1.10 cgd syscallarg(size_t) msgsz;
647 1.10 cgd syscallarg(int) msgflg;
648 1.54 dsl } */
649 1.41 cube
650 1.44 ad return msgsnd1(l, SCARG(uap, msqid), SCARG(uap, msgp),
651 1.41 cube SCARG(uap, msgsz), SCARG(uap, msgflg), sizeof(long), copyin);
652 1.41 cube }
653 1.41 cube
654 1.41 cube int
655 1.44 ad msgsnd1(struct lwp *l, int msqidr, const char *user_msgp, size_t msgsz,
656 1.41 cube int msgflg, size_t typesz, copyin_t fetch_type)
657 1.41 cube {
658 1.48 ad int segs_needed, error = 0, msqid;
659 1.44 ad kauth_cred_t cred = l->l_cred;
660 1.26 thorpej struct msqid_ds *msqptr;
661 1.26 thorpej struct __msg *msghdr;
662 1.48 ad kmsq_t *msq;
663 1.3 mycroft short next;
664 1.1 cgd
665 1.64 skrll MSG_PRINTF(("call to msgsnd(%d, %p, %lld, %d)\n", msqidr,
666 1.64 skrll user_msgp, (long long)msgsz, msgflg));
667 1.60 njoly
668 1.60 njoly if ((ssize_t)msgsz < 0)
669 1.60 njoly return EINVAL;
670 1.60 njoly
671 1.53 rmind restart:
672 1.41 cube msqid = IPCID_TO_IX(msqidr);
673 1.1 cgd
674 1.48 ad mutex_enter(&msgmutex);
675 1.53 rmind /* In case of reallocation, we will wait for completion */
676 1.53 rmind while (__predict_false(msg_realloc_state))
677 1.53 rmind cv_wait(&msg_realloc_cv, &msgmutex);
678 1.48 ad
679 1.3 mycroft if (msqid < 0 || msqid >= msginfo.msgmni) {
680 1.20 christos MSG_PRINTF(("msqid (%d) out of range (0<=msqid<%d)\n", msqid,
681 1.20 christos msginfo.msgmni));
682 1.48 ad error = EINVAL;
683 1.48 ad goto unlock;
684 1.3 mycroft }
685 1.1 cgd
686 1.48 ad msq = &msqs[msqid];
687 1.48 ad msqptr = &msq->msq_u;
688 1.48 ad
689 1.3 mycroft if (msqptr->msg_qbytes == 0) {
690 1.20 christos MSG_PRINTF(("no such message queue id\n"));
691 1.48 ad error = EINVAL;
692 1.48 ad goto unlock;
693 1.3 mycroft }
694 1.41 cube if (msqptr->msg_perm._seq != IPCID_TO_SEQ(msqidr)) {
695 1.20 christos MSG_PRINTF(("wrong sequence number\n"));
696 1.48 ad error = EINVAL;
697 1.48 ad goto unlock;
698 1.3 mycroft }
699 1.1 cgd
700 1.26 thorpej if ((error = ipcperm(cred, &msqptr->msg_perm, IPC_W))) {
701 1.20 christos MSG_PRINTF(("requester doesn't have write access\n"));
702 1.48 ad goto unlock;
703 1.3 mycroft }
704 1.1 cgd
705 1.3 mycroft segs_needed = (msgsz + msginfo.msgssz - 1) / msginfo.msgssz;
706 1.34 nathanw MSG_PRINTF(("msgsz=%lld, msgssz=%d, segs_needed=%d\n",
707 1.34 nathanw (long long)msgsz, msginfo.msgssz, segs_needed));
708 1.3 mycroft for (;;) {
709 1.3 mycroft int need_more_resources = 0;
710 1.1 cgd
711 1.3 mycroft /*
712 1.18 christos * check msgsz [cannot be negative since it is unsigned]
713 1.3 mycroft * (inside this loop in case msg_qbytes changes while we sleep)
714 1.3 mycroft */
715 1.1 cgd
716 1.18 christos if (msgsz > msqptr->msg_qbytes) {
717 1.20 christos MSG_PRINTF(("msgsz > msqptr->msg_qbytes\n"));
718 1.48 ad error = EINVAL;
719 1.48 ad goto unlock;
720 1.3 mycroft }
721 1.1 cgd
722 1.3 mycroft if (msqptr->msg_perm.mode & MSG_LOCKED) {
723 1.20 christos MSG_PRINTF(("msqid is locked\n"));
724 1.3 mycroft need_more_resources = 1;
725 1.3 mycroft }
726 1.26 thorpej if (msgsz + msqptr->_msg_cbytes > msqptr->msg_qbytes) {
727 1.20 christos MSG_PRINTF(("msgsz + msg_cbytes > msg_qbytes\n"));
728 1.3 mycroft need_more_resources = 1;
729 1.3 mycroft }
730 1.3 mycroft if (segs_needed > nfree_msgmaps) {
731 1.20 christos MSG_PRINTF(("segs_needed > nfree_msgmaps\n"));
732 1.3 mycroft need_more_resources = 1;
733 1.3 mycroft }
734 1.3 mycroft if (free_msghdrs == NULL) {
735 1.20 christos MSG_PRINTF(("no more msghdrs\n"));
736 1.3 mycroft need_more_resources = 1;
737 1.3 mycroft }
738 1.1 cgd
739 1.3 mycroft if (need_more_resources) {
740 1.3 mycroft int we_own_it;
741 1.1 cgd
742 1.3 mycroft if ((msgflg & IPC_NOWAIT) != 0) {
743 1.26 thorpej MSG_PRINTF(("need more resources but caller "
744 1.26 thorpej "doesn't want to wait\n"));
745 1.48 ad error = EAGAIN;
746 1.48 ad goto unlock;
747 1.3 mycroft }
748 1.1 cgd
749 1.3 mycroft if ((msqptr->msg_perm.mode & MSG_LOCKED) != 0) {
750 1.20 christos MSG_PRINTF(("we don't own the msqid_ds\n"));
751 1.3 mycroft we_own_it = 0;
752 1.3 mycroft } else {
753 1.3 mycroft /* Force later arrivals to wait for our
754 1.3 mycroft request */
755 1.20 christos MSG_PRINTF(("we own the msqid_ds\n"));
756 1.3 mycroft msqptr->msg_perm.mode |= MSG_LOCKED;
757 1.3 mycroft we_own_it = 1;
758 1.3 mycroft }
759 1.51 rmind
760 1.51 rmind msg_waiters++;
761 1.20 christos MSG_PRINTF(("goodnight\n"));
762 1.48 ad error = cv_wait_sig(&msq->msq_cv, &msgmutex);
763 1.26 thorpej MSG_PRINTF(("good morning, error=%d\n", error));
764 1.51 rmind msg_waiters--;
765 1.51 rmind
766 1.53 rmind if (we_own_it)
767 1.53 rmind msqptr->msg_perm.mode &= ~MSG_LOCKED;
768 1.53 rmind
769 1.53 rmind /*
770 1.53 rmind * In case of such state, notify reallocator and
771 1.53 rmind * restart the call.
772 1.53 rmind */
773 1.53 rmind if (msg_realloc_state) {
774 1.52 yamt cv_broadcast(&msg_realloc_cv);
775 1.53 rmind mutex_exit(&msgmutex);
776 1.53 rmind goto restart;
777 1.53 rmind }
778 1.51 rmind
779 1.53 rmind if (error != 0) {
780 1.26 thorpej MSG_PRINTF(("msgsnd: interrupted system "
781 1.26 thorpej "call\n"));
782 1.48 ad error = EINTR;
783 1.48 ad goto unlock;
784 1.3 mycroft }
785 1.1 cgd
786 1.3 mycroft /*
787 1.3 mycroft * Make sure that the msq queue still exists
788 1.3 mycroft */
789 1.1 cgd
790 1.3 mycroft if (msqptr->msg_qbytes == 0) {
791 1.20 christos MSG_PRINTF(("msqid deleted\n"));
792 1.48 ad error = EIDRM;
793 1.48 ad goto unlock;
794 1.3 mycroft }
795 1.3 mycroft } else {
796 1.20 christos MSG_PRINTF(("got all the resources that we need\n"));
797 1.3 mycroft break;
798 1.3 mycroft }
799 1.1 cgd }
800 1.1 cgd
801 1.3 mycroft /*
802 1.3 mycroft * We have the resources that we need.
803 1.3 mycroft * Make sure!
804 1.3 mycroft */
805 1.1 cgd
806 1.50 rmind KASSERT((msqptr->msg_perm.mode & MSG_LOCKED) == 0);
807 1.50 rmind KASSERT(segs_needed <= nfree_msgmaps);
808 1.50 rmind KASSERT(msgsz + msqptr->_msg_cbytes <= msqptr->msg_qbytes);
809 1.50 rmind KASSERT(free_msghdrs != NULL);
810 1.1 cgd
811 1.3 mycroft /*
812 1.3 mycroft * Re-lock the msqid_ds in case we page-fault when copying in the
813 1.3 mycroft * message
814 1.3 mycroft */
815 1.1 cgd
816 1.50 rmind KASSERT((msqptr->msg_perm.mode & MSG_LOCKED) == 0);
817 1.3 mycroft msqptr->msg_perm.mode |= MSG_LOCKED;
818 1.1 cgd
819 1.3 mycroft /*
820 1.3 mycroft * Allocate a message header
821 1.3 mycroft */
822 1.1 cgd
823 1.3 mycroft msghdr = free_msghdrs;
824 1.3 mycroft free_msghdrs = msghdr->msg_next;
825 1.3 mycroft msghdr->msg_spot = -1;
826 1.3 mycroft msghdr->msg_ts = msgsz;
827 1.1 cgd
828 1.3 mycroft /*
829 1.3 mycroft * Allocate space for the message
830 1.3 mycroft */
831 1.1 cgd
832 1.3 mycroft while (segs_needed > 0) {
833 1.50 rmind KASSERT(nfree_msgmaps > 0);
834 1.50 rmind KASSERT(free_msgmaps != -1);
835 1.50 rmind KASSERT(free_msgmaps < msginfo.msgseg);
836 1.50 rmind
837 1.3 mycroft next = free_msgmaps;
838 1.20 christos MSG_PRINTF(("allocating segment %d to message\n", next));
839 1.3 mycroft free_msgmaps = msgmaps[next].next;
840 1.5 mycroft nfree_msgmaps--;
841 1.3 mycroft msgmaps[next].next = msghdr->msg_spot;
842 1.3 mycroft msghdr->msg_spot = next;
843 1.5 mycroft segs_needed--;
844 1.1 cgd }
845 1.1 cgd
846 1.3 mycroft /*
847 1.3 mycroft * Copy in the message type
848 1.3 mycroft */
849 1.48 ad mutex_exit(&msgmutex);
850 1.48 ad error = (*fetch_type)(user_msgp, &msghdr->msg_type, typesz);
851 1.48 ad mutex_enter(&msgmutex);
852 1.48 ad if (error != 0) {
853 1.26 thorpej MSG_PRINTF(("error %d copying the message type\n", error));
854 1.3 mycroft msg_freehdr(msghdr);
855 1.3 mycroft msqptr->msg_perm.mode &= ~MSG_LOCKED;
856 1.48 ad cv_broadcast(&msq->msq_cv);
857 1.48 ad goto unlock;
858 1.3 mycroft }
859 1.41 cube user_msgp += typesz;
860 1.1 cgd
861 1.3 mycroft /*
862 1.3 mycroft * Validate the message type
863 1.3 mycroft */
864 1.1 cgd
865 1.3 mycroft if (msghdr->msg_type < 1) {
866 1.3 mycroft msg_freehdr(msghdr);
867 1.3 mycroft msqptr->msg_perm.mode &= ~MSG_LOCKED;
868 1.48 ad cv_broadcast(&msq->msq_cv);
869 1.34 nathanw MSG_PRINTF(("mtype (%ld) < 1\n", msghdr->msg_type));
870 1.57 njoly error = EINVAL;
871 1.48 ad goto unlock;
872 1.3 mycroft }
873 1.1 cgd
874 1.3 mycroft /*
875 1.3 mycroft * Copy in the message body
876 1.3 mycroft */
877 1.3 mycroft
878 1.3 mycroft next = msghdr->msg_spot;
879 1.3 mycroft while (msgsz > 0) {
880 1.3 mycroft size_t tlen;
881 1.50 rmind KASSERT(next > -1);
882 1.50 rmind KASSERT(next < msginfo.msgseg);
883 1.50 rmind
884 1.3 mycroft if (msgsz > msginfo.msgssz)
885 1.3 mycroft tlen = msginfo.msgssz;
886 1.3 mycroft else
887 1.3 mycroft tlen = msgsz;
888 1.48 ad mutex_exit(&msgmutex);
889 1.48 ad error = copyin(user_msgp, &msgpool[next * msginfo.msgssz], tlen);
890 1.48 ad mutex_enter(&msgmutex);
891 1.48 ad if (error != 0) {
892 1.26 thorpej MSG_PRINTF(("error %d copying in message segment\n",
893 1.26 thorpej error));
894 1.3 mycroft msg_freehdr(msghdr);
895 1.3 mycroft msqptr->msg_perm.mode &= ~MSG_LOCKED;
896 1.48 ad cv_broadcast(&msq->msq_cv);
897 1.48 ad goto unlock;
898 1.3 mycroft }
899 1.3 mycroft msgsz -= tlen;
900 1.3 mycroft user_msgp += tlen;
901 1.3 mycroft next = msgmaps[next].next;
902 1.1 cgd }
903 1.50 rmind KASSERT(next == -1);
904 1.1 cgd
905 1.3 mycroft /*
906 1.3 mycroft * We've got the message. Unlock the msqid_ds.
907 1.3 mycroft */
908 1.1 cgd
909 1.3 mycroft msqptr->msg_perm.mode &= ~MSG_LOCKED;
910 1.1 cgd
911 1.3 mycroft /*
912 1.3 mycroft * Make sure that the msqid_ds is still allocated.
913 1.3 mycroft */
914 1.1 cgd
915 1.3 mycroft if (msqptr->msg_qbytes == 0) {
916 1.3 mycroft msg_freehdr(msghdr);
917 1.48 ad cv_broadcast(&msq->msq_cv);
918 1.48 ad error = EIDRM;
919 1.48 ad goto unlock;
920 1.3 mycroft }
921 1.3 mycroft
922 1.3 mycroft /*
923 1.3 mycroft * Put the message into the queue
924 1.3 mycroft */
925 1.1 cgd
926 1.26 thorpej if (msqptr->_msg_first == NULL) {
927 1.26 thorpej msqptr->_msg_first = msghdr;
928 1.26 thorpej msqptr->_msg_last = msghdr;
929 1.3 mycroft } else {
930 1.26 thorpej msqptr->_msg_last->msg_next = msghdr;
931 1.26 thorpej msqptr->_msg_last = msghdr;
932 1.3 mycroft }
933 1.26 thorpej msqptr->_msg_last->msg_next = NULL;
934 1.3 mycroft
935 1.26 thorpej msqptr->_msg_cbytes += msghdr->msg_ts;
936 1.5 mycroft msqptr->msg_qnum++;
937 1.44 ad msqptr->msg_lspid = l->l_proc->p_pid;
938 1.43 kardel msqptr->msg_stime = time_second;
939 1.3 mycroft
940 1.48 ad cv_broadcast(&msq->msq_cv);
941 1.48 ad
942 1.50 rmind unlock:
943 1.50 rmind mutex_exit(&msgmutex);
944 1.48 ad return error;
945 1.1 cgd }
946 1.1 cgd
947 1.1 cgd int
948 1.54 dsl sys_msgrcv(struct lwp *l, const struct sys_msgrcv_args *uap, register_t *retval)
949 1.16 thorpej {
950 1.54 dsl /* {
951 1.10 cgd syscallarg(int) msqid;
952 1.10 cgd syscallarg(void *) msgp;
953 1.10 cgd syscallarg(size_t) msgsz;
954 1.10 cgd syscallarg(long) msgtyp;
955 1.10 cgd syscallarg(int) msgflg;
956 1.54 dsl } */
957 1.41 cube
958 1.44 ad return msgrcv1(l, SCARG(uap, msqid), SCARG(uap, msgp),
959 1.41 cube SCARG(uap, msgsz), SCARG(uap, msgtyp), SCARG(uap, msgflg),
960 1.41 cube sizeof(long), copyout, retval);
961 1.41 cube }
962 1.41 cube
963 1.41 cube int
964 1.44 ad msgrcv1(struct lwp *l, int msqidr, char *user_msgp, size_t msgsz, long msgtyp,
965 1.41 cube int msgflg, size_t typesz, copyout_t put_type, register_t *retval)
966 1.41 cube {
967 1.3 mycroft size_t len;
968 1.44 ad kauth_cred_t cred = l->l_cred;
969 1.27 augustss struct msqid_ds *msqptr;
970 1.27 augustss struct __msg *msghdr;
971 1.48 ad int error = 0, msqid;
972 1.48 ad kmsq_t *msq;
973 1.3 mycroft short next;
974 1.1 cgd
975 1.64 skrll MSG_PRINTF(("call to msgrcv(%d, %p, %lld, %ld, %d)\n", msqidr,
976 1.34 nathanw user_msgp, (long long)msgsz, msgtyp, msgflg));
977 1.60 njoly
978 1.60 njoly if ((ssize_t)msgsz < 0)
979 1.60 njoly return EINVAL;
980 1.60 njoly
981 1.53 rmind restart:
982 1.41 cube msqid = IPCID_TO_IX(msqidr);
983 1.1 cgd
984 1.48 ad mutex_enter(&msgmutex);
985 1.53 rmind /* In case of reallocation, we will wait for completion */
986 1.53 rmind while (__predict_false(msg_realloc_state))
987 1.53 rmind cv_wait(&msg_realloc_cv, &msgmutex);
988 1.48 ad
989 1.3 mycroft if (msqid < 0 || msqid >= msginfo.msgmni) {
990 1.20 christos MSG_PRINTF(("msqid (%d) out of range (0<=msqid<%d)\n", msqid,
991 1.20 christos msginfo.msgmni));
992 1.48 ad error = EINVAL;
993 1.48 ad goto unlock;
994 1.3 mycroft }
995 1.1 cgd
996 1.48 ad msq = &msqs[msqid];
997 1.48 ad msqptr = &msq->msq_u;
998 1.48 ad
999 1.3 mycroft if (msqptr->msg_qbytes == 0) {
1000 1.20 christos MSG_PRINTF(("no such message queue id\n"));
1001 1.48 ad error = EINVAL;
1002 1.48 ad goto unlock;
1003 1.3 mycroft }
1004 1.41 cube if (msqptr->msg_perm._seq != IPCID_TO_SEQ(msqidr)) {
1005 1.20 christos MSG_PRINTF(("wrong sequence number\n"));
1006 1.48 ad error = EINVAL;
1007 1.48 ad goto unlock;
1008 1.3 mycroft }
1009 1.1 cgd
1010 1.26 thorpej if ((error = ipcperm(cred, &msqptr->msg_perm, IPC_R))) {
1011 1.20 christos MSG_PRINTF(("requester doesn't have read access\n"));
1012 1.48 ad goto unlock;
1013 1.3 mycroft }
1014 1.1 cgd
1015 1.3 mycroft msghdr = NULL;
1016 1.3 mycroft while (msghdr == NULL) {
1017 1.3 mycroft if (msgtyp == 0) {
1018 1.26 thorpej msghdr = msqptr->_msg_first;
1019 1.3 mycroft if (msghdr != NULL) {
1020 1.3 mycroft if (msgsz < msghdr->msg_ts &&
1021 1.3 mycroft (msgflg & MSG_NOERROR) == 0) {
1022 1.50 rmind MSG_PRINTF(("first msg on the queue "
1023 1.50 rmind "is too big (want %lld, got %d)\n",
1024 1.34 nathanw (long long)msgsz, msghdr->msg_ts));
1025 1.48 ad error = E2BIG;
1026 1.48 ad goto unlock;
1027 1.3 mycroft }
1028 1.26 thorpej if (msqptr->_msg_first == msqptr->_msg_last) {
1029 1.26 thorpej msqptr->_msg_first = NULL;
1030 1.26 thorpej msqptr->_msg_last = NULL;
1031 1.3 mycroft } else {
1032 1.26 thorpej msqptr->_msg_first = msghdr->msg_next;
1033 1.50 rmind KASSERT(msqptr->_msg_first != NULL);
1034 1.3 mycroft }
1035 1.3 mycroft }
1036 1.3 mycroft } else {
1037 1.26 thorpej struct __msg *previous;
1038 1.26 thorpej struct __msg **prev;
1039 1.1 cgd
1040 1.26 thorpej for (previous = NULL, prev = &msqptr->_msg_first;
1041 1.12 mycroft (msghdr = *prev) != NULL;
1042 1.12 mycroft previous = msghdr, prev = &msghdr->msg_next) {
1043 1.3 mycroft /*
1044 1.3 mycroft * Is this message's type an exact match or is
1045 1.3 mycroft * this message's type less than or equal to
1046 1.3 mycroft * the absolute value of a negative msgtyp?
1047 1.3 mycroft * Note that the second half of this test can
1048 1.3 mycroft * NEVER be true if msgtyp is positive since
1049 1.3 mycroft * msg_type is always positive!
1050 1.3 mycroft */
1051 1.3 mycroft
1052 1.50 rmind if (msgtyp != msghdr->msg_type &&
1053 1.50 rmind msghdr->msg_type > -msgtyp)
1054 1.50 rmind continue;
1055 1.50 rmind
1056 1.50 rmind MSG_PRINTF(("found message type %ld, requested %ld\n",
1057 1.50 rmind msghdr->msg_type, msgtyp));
1058 1.50 rmind if (msgsz < msghdr->msg_ts &&
1059 1.50 rmind (msgflg & MSG_NOERROR) == 0) {
1060 1.50 rmind MSG_PRINTF(("requested message on the queue "
1061 1.50 rmind "is too big (want %lld, got %d)\n",
1062 1.50 rmind (long long)msgsz, msghdr->msg_ts));
1063 1.50 rmind error = E2BIG;
1064 1.50 rmind goto unlock;
1065 1.50 rmind }
1066 1.50 rmind *prev = msghdr->msg_next;
1067 1.50 rmind if (msghdr != msqptr->_msg_last)
1068 1.3 mycroft break;
1069 1.50 rmind if (previous == NULL) {
1070 1.50 rmind KASSERT(prev == &msqptr->_msg_first);
1071 1.50 rmind msqptr->_msg_first = NULL;
1072 1.50 rmind msqptr->_msg_last = NULL;
1073 1.50 rmind } else {
1074 1.50 rmind KASSERT(prev != &msqptr->_msg_first);
1075 1.50 rmind msqptr->_msg_last = previous;
1076 1.3 mycroft }
1077 1.50 rmind break;
1078 1.3 mycroft }
1079 1.1 cgd }
1080 1.1 cgd
1081 1.3 mycroft /*
1082 1.3 mycroft * We've either extracted the msghdr for the appropriate
1083 1.3 mycroft * message or there isn't one.
1084 1.3 mycroft * If there is one then bail out of this loop.
1085 1.3 mycroft */
1086 1.3 mycroft if (msghdr != NULL)
1087 1.3 mycroft break;
1088 1.1 cgd
1089 1.1 cgd /*
1090 1.3 mycroft * Hmph! No message found. Does the user want to wait?
1091 1.1 cgd */
1092 1.1 cgd
1093 1.3 mycroft if ((msgflg & IPC_NOWAIT) != 0) {
1094 1.34 nathanw MSG_PRINTF(("no appropriate message found (msgtyp=%ld)\n",
1095 1.20 christos msgtyp));
1096 1.48 ad error = ENOMSG;
1097 1.48 ad goto unlock;
1098 1.3 mycroft }
1099 1.1 cgd
1100 1.3 mycroft /*
1101 1.3 mycroft * Wait for something to happen
1102 1.3 mycroft */
1103 1.1 cgd
1104 1.51 rmind msg_waiters++;
1105 1.20 christos MSG_PRINTF(("msgrcv: goodnight\n"));
1106 1.48 ad error = cv_wait_sig(&msq->msq_cv, &msgmutex);
1107 1.26 thorpej MSG_PRINTF(("msgrcv: good morning (error=%d)\n", error));
1108 1.51 rmind msg_waiters--;
1109 1.1 cgd
1110 1.53 rmind /*
1111 1.53 rmind * In case of such state, notify reallocator and
1112 1.53 rmind * restart the call.
1113 1.53 rmind */
1114 1.53 rmind if (msg_realloc_state) {
1115 1.52 yamt cv_broadcast(&msg_realloc_cv);
1116 1.53 rmind mutex_exit(&msgmutex);
1117 1.53 rmind goto restart;
1118 1.53 rmind }
1119 1.51 rmind
1120 1.53 rmind if (error != 0) {
1121 1.26 thorpej MSG_PRINTF(("msgsnd: interrupted system call\n"));
1122 1.48 ad error = EINTR;
1123 1.48 ad goto unlock;
1124 1.3 mycroft }
1125 1.1 cgd
1126 1.3 mycroft /*
1127 1.3 mycroft * Make sure that the msq queue still exists
1128 1.3 mycroft */
1129 1.1 cgd
1130 1.3 mycroft if (msqptr->msg_qbytes == 0 ||
1131 1.41 cube msqptr->msg_perm._seq != IPCID_TO_SEQ(msqidr)) {
1132 1.20 christos MSG_PRINTF(("msqid deleted\n"));
1133 1.48 ad error = EIDRM;
1134 1.48 ad goto unlock;
1135 1.3 mycroft }
1136 1.1 cgd }
1137 1.1 cgd
1138 1.3 mycroft /*
1139 1.3 mycroft * Return the message to the user.
1140 1.3 mycroft *
1141 1.3 mycroft * First, do the bookkeeping (before we risk being interrupted).
1142 1.3 mycroft */
1143 1.1 cgd
1144 1.26 thorpej msqptr->_msg_cbytes -= msghdr->msg_ts;
1145 1.5 mycroft msqptr->msg_qnum--;
1146 1.44 ad msqptr->msg_lrpid = l->l_proc->p_pid;
1147 1.43 kardel msqptr->msg_rtime = time_second;
1148 1.1 cgd
1149 1.3 mycroft /*
1150 1.3 mycroft * Make msgsz the actual amount that we'll be returning.
1151 1.3 mycroft * Note that this effectively truncates the message if it is too long
1152 1.3 mycroft * (since msgsz is never increased).
1153 1.3 mycroft */
1154 1.1 cgd
1155 1.34 nathanw MSG_PRINTF(("found a message, msgsz=%lld, msg_ts=%d\n",
1156 1.34 nathanw (long long)msgsz, msghdr->msg_ts));
1157 1.3 mycroft if (msgsz > msghdr->msg_ts)
1158 1.3 mycroft msgsz = msghdr->msg_ts;
1159 1.1 cgd
1160 1.3 mycroft /*
1161 1.3 mycroft * Return the type to the user.
1162 1.3 mycroft */
1163 1.48 ad mutex_exit(&msgmutex);
1164 1.41 cube error = (*put_type)(&msghdr->msg_type, user_msgp, typesz);
1165 1.48 ad mutex_enter(&msgmutex);
1166 1.26 thorpej if (error != 0) {
1167 1.26 thorpej MSG_PRINTF(("error (%d) copying out message type\n", error));
1168 1.3 mycroft msg_freehdr(msghdr);
1169 1.48 ad cv_broadcast(&msq->msq_cv);
1170 1.48 ad goto unlock;
1171 1.3 mycroft }
1172 1.41 cube user_msgp += typesz;
1173 1.3 mycroft
1174 1.3 mycroft /*
1175 1.3 mycroft * Return the segments to the user
1176 1.3 mycroft */
1177 1.1 cgd
1178 1.3 mycroft next = msghdr->msg_spot;
1179 1.3 mycroft for (len = 0; len < msgsz; len += msginfo.msgssz) {
1180 1.3 mycroft size_t tlen;
1181 1.50 rmind KASSERT(next > -1);
1182 1.50 rmind KASSERT(next < msginfo.msgseg);
1183 1.3 mycroft
1184 1.25 mrg if (msgsz - len > msginfo.msgssz)
1185 1.3 mycroft tlen = msginfo.msgssz;
1186 1.3 mycroft else
1187 1.25 mrg tlen = msgsz - len;
1188 1.48 ad mutex_exit(&msgmutex);
1189 1.61 njoly error = copyout(&msgpool[next * msginfo.msgssz],
1190 1.3 mycroft user_msgp, tlen);
1191 1.48 ad mutex_enter(&msgmutex);
1192 1.26 thorpej if (error != 0) {
1193 1.20 christos MSG_PRINTF(("error (%d) copying out message segment\n",
1194 1.26 thorpej error));
1195 1.3 mycroft msg_freehdr(msghdr);
1196 1.48 ad cv_broadcast(&msq->msq_cv);
1197 1.48 ad goto unlock;
1198 1.3 mycroft }
1199 1.3 mycroft user_msgp += tlen;
1200 1.3 mycroft next = msgmaps[next].next;
1201 1.1 cgd }
1202 1.1 cgd
1203 1.3 mycroft /*
1204 1.3 mycroft * Done, return the actual number of bytes copied out.
1205 1.3 mycroft */
1206 1.1 cgd
1207 1.3 mycroft msg_freehdr(msghdr);
1208 1.48 ad cv_broadcast(&msq->msq_cv);
1209 1.3 mycroft *retval = msgsz;
1210 1.48 ad
1211 1.50 rmind unlock:
1212 1.50 rmind mutex_exit(&msgmutex);
1213 1.48 ad return error;
1214 1.1 cgd }
1215 1.51 rmind
1216 1.51 rmind /*
1217 1.51 rmind * Sysctl initialization and nodes.
1218 1.51 rmind */
1219 1.51 rmind
1220 1.51 rmind static int
1221 1.51 rmind sysctl_ipc_msgmni(SYSCTLFN_ARGS)
1222 1.51 rmind {
1223 1.51 rmind int newsize, error;
1224 1.51 rmind struct sysctlnode node;
1225 1.51 rmind node = *rnode;
1226 1.51 rmind node.sysctl_data = &newsize;
1227 1.51 rmind
1228 1.51 rmind newsize = msginfo.msgmni;
1229 1.51 rmind error = sysctl_lookup(SYSCTLFN_CALL(&node));
1230 1.51 rmind if (error || newp == NULL)
1231 1.51 rmind return error;
1232 1.51 rmind
1233 1.55 ad sysctl_unlock();
1234 1.55 ad error = msgrealloc(newsize, msginfo.msgseg);
1235 1.55 ad sysctl_relock();
1236 1.55 ad return error;
1237 1.51 rmind }
1238 1.51 rmind
1239 1.51 rmind static int
1240 1.51 rmind sysctl_ipc_msgseg(SYSCTLFN_ARGS)
1241 1.51 rmind {
1242 1.51 rmind int newsize, error;
1243 1.51 rmind struct sysctlnode node;
1244 1.51 rmind node = *rnode;
1245 1.51 rmind node.sysctl_data = &newsize;
1246 1.51 rmind
1247 1.51 rmind newsize = msginfo.msgseg;
1248 1.51 rmind error = sysctl_lookup(SYSCTLFN_CALL(&node));
1249 1.51 rmind if (error || newp == NULL)
1250 1.51 rmind return error;
1251 1.51 rmind
1252 1.55 ad sysctl_unlock();
1253 1.55 ad error = msgrealloc(msginfo.msgmni, newsize);
1254 1.55 ad sysctl_relock();
1255 1.55 ad return error;
1256 1.51 rmind }
1257 1.51 rmind
1258 1.51 rmind SYSCTL_SETUP(sysctl_ipc_msg_setup, "sysctl kern.ipc subtree setup")
1259 1.51 rmind {
1260 1.51 rmind const struct sysctlnode *node = NULL;
1261 1.51 rmind
1262 1.51 rmind sysctl_createv(clog, 0, NULL, &node,
1263 1.51 rmind CTLFLAG_PERMANENT,
1264 1.51 rmind CTLTYPE_NODE, "ipc",
1265 1.51 rmind SYSCTL_DESCR("SysV IPC options"),
1266 1.51 rmind NULL, 0, NULL, 0,
1267 1.51 rmind CTL_KERN, KERN_SYSVIPC, CTL_EOL);
1268 1.51 rmind
1269 1.51 rmind if (node == NULL)
1270 1.51 rmind return;
1271 1.51 rmind
1272 1.51 rmind sysctl_createv(clog, 0, &node, NULL,
1273 1.51 rmind CTLFLAG_PERMANENT | CTLFLAG_READWRITE,
1274 1.51 rmind CTLTYPE_INT, "msgmni",
1275 1.51 rmind SYSCTL_DESCR("Max number of message queue identifiers"),
1276 1.51 rmind sysctl_ipc_msgmni, 0, &msginfo.msgmni, 0,
1277 1.51 rmind CTL_CREATE, CTL_EOL);
1278 1.51 rmind sysctl_createv(clog, 0, &node, NULL,
1279 1.51 rmind CTLFLAG_PERMANENT | CTLFLAG_READWRITE,
1280 1.51 rmind CTLTYPE_INT, "msgseg",
1281 1.51 rmind SYSCTL_DESCR("Max number of number of message segments"),
1282 1.51 rmind sysctl_ipc_msgseg, 0, &msginfo.msgseg, 0,
1283 1.51 rmind CTL_CREATE, CTL_EOL);
1284 1.51 rmind }
1285