2 * Copyright (c) 2009, Stathis Kamperis
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
14 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
15 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
16 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
17 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
18 * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
19 * INCIDENTAL, SPECIAL, EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING,
20 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
21 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
22 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
23 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
24 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 #include <string.h> /* memset() */
36 #include <unistd.h> /* fork() */
39 #define MQNAME "/t_mq_timedsend"
45 /* Create a message queue for with capacity `1'. */
49 memset(&attr, 0, sizeof(attr));
50 attr.mq_maxmsg = 1; /* Maximum number of messages. */
51 attr.mq_msgsize = 1024; /* Maximum message size. */
53 md = mq_open(MQNAME, O_CREAT | O_EXCL | O_WRONLY, 0700, &attr);
54 assert(md != (mqd_t)-1);
56 /* Send a message to fill in the queue. */
57 assert(mq_send(md, "foo", sizeof("foo"), /* priority */ 0) != -1);
60 * Fork and let the parent block on mq_timedsend().
61 * Meanwhile, the child receives the old message from the queue, making
62 * room for parent to send the new one!
68 /* We are inside the child. */
69 md2 = mq_open(MQNAME, O_RDONLY);
70 assert(md2 != (mqd_t)-1);
72 char msg_recvd[8192]; /* Implementation defined. */
73 assert(mq_receive(md2, msg_recvd, sizeof(msg_recvd),
74 /* priority */ NULL) != -1);
76 /* Disassociate from message queue. */
77 assert(mq_close(md2) != -1);
79 /* We are inside the parent. */
80 /* Make sure the child has completed. */
82 assert(wait(&status) == pid);
85 * Determine if the child exited normally, or due to a SIGABRT
86 * signal being delivered to it by a failed assertion.
88 if (WIFSIGNALED(status)) {
89 assert(WTERMSIG(status) == SIGABRT);
90 return (EXIT_FAILURE);
94 * This shouldn't timeout now, since the queue is or is about to
95 * become empty. It may block though for a while.
97 struct timespec now, timeout;
99 assert(clock_gettime(CLOCK_REALTIME, &now) == 0);
100 timeout.tv_sec = now.tv_sec + 3;
101 timeout.tv_nsec = now.tv_nsec;
103 assert(mq_timedsend(md, "foo", sizeof("foo"), /* priority */ 0,
106 /* Disassociate from message queue. */
109 /* Remove message queue from the system. */
114 return (EXIT_SUCCESS);
117 /* Only reached by child upon success. */
118 return (EXIT_SUCCESS);