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