1 .\" $NetBSD: msgsnd.2,v 1.1 1995/10/16 23:49:24 jtc Exp $
3 .\" Copyright (c) 1995 Frank van der Linden
4 .\" All rights reserved.
6 .\" Redistribution and use in source and binary forms, with or without
7 .\" modification, are permitted provided that the following conditions
9 .\" 1. Redistributions of source code must retain the above copyright
10 .\" notice, this list of conditions and the following disclaimer.
11 .\" 2. Redistributions in binary form must reproduce the above copyright
12 .\" notice, this list of conditions and the following disclaimer in the
13 .\" documentation and/or other materials provided with the distribution.
14 .\" 3. All advertising materials mentioning features or use of this software
15 .\" must display the following acknowledgement:
16 .\" This product includes software developed for the NetBSD Project
17 .\" by Frank van der Linden
18 .\" 4. The name of the author may not be used to endorse or promote products
19 .\" derived from this software without specific prior written permission
21 .\" THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
22 .\" IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
23 .\" OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
24 .\" IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
25 .\" INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
26 .\" NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
27 .\" DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
28 .\" THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
29 .\" (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
30 .\" THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
32 .\" $FreeBSD: src/lib/libc/gen/msgsnd.3,v 1.9.2.5 2001/12/14 18:33:51 ru Exp $
39 .Nd send a message to a message queue
47 .Fn msgsnd "int msqid" "const void *msgp" "size_t msgsz" "int msgflg"
51 system call sends a message to the message queue specified in
54 points to a structure containing the message.
56 consist of the following members:
58 long mtype; /* message type */
59 char mtext[1]; /* body of message */
63 is an integer greater than 0 that can be used for selecting messages (see
66 is an array of bytes, with a size up to that of the system limit
69 If the number of bytes already on the message queue plus
71 is bigger than the maximum number of bytes on the message queue
75 or the number of messages on all queues system-wide is already equal to
78 determines the action of
84 mask set in it, the call will return immediately.
89 set in it, the call will block until:
92 The condition which caused the call to block does no longer exist.
93 The message will be sent.
95 The message queue is removed, in which case -1 will be returned, and
100 The caller catches a signal.
101 The call returns with
107 After a successful call, the data structure associated with the message
108 queue is updated in the following way:
112 is incremented by the size of the message.
118 is set to the pid of the calling process.
121 is set to the current time.
126 The XSI Interprocess Communication family of functions is also available
127 as an implementation in userspace.
130 daemon has to be running.
134 variable is set in a process' environment, the process and its children
135 will use the userspace implementation.
142 is not a valid message queue identifier
144 The message queue was removed while
146 was waiting for a resource to become available in order to deliver the
150 is less than 0, or greater than
154 is not greater than 0.
156 The calling process does not have write access to the message queue.
158 There was no space for this message either on the queue, or in the whole
165 points to an invalid address.
167 The system call was interrupted by the delivery of a signal.
170 Message queues appeared in the first release of AT&T Unix System V.
175 specific userspace implementation (see
186 error value, which should be used
187 in the case of a removed message queue.