xref: /freebsd/tools/test/stress2/testcases/shm/shm.c (revision 8a272653d9fbd9fc37691c9aad6a05089b4ecb4d)
1*8a272653SPeter Holm /*-
2*8a272653SPeter Holm  * Copyright (c) 2008 Peter Holm <pho@FreeBSD.org>
3*8a272653SPeter Holm  * All rights reserved.
4*8a272653SPeter Holm  *
5*8a272653SPeter Holm  * Redistribution and use in source and binary forms, with or without
6*8a272653SPeter Holm  * modification, are permitted provided that the following conditions
7*8a272653SPeter Holm  * are met:
8*8a272653SPeter Holm  * 1. Redistributions of source code must retain the above copyright
9*8a272653SPeter Holm  *    notice, this list of conditions and the following disclaimer.
10*8a272653SPeter Holm  * 2. Redistributions in binary form must reproduce the above copyright
11*8a272653SPeter Holm  *    notice, this list of conditions and the following disclaimer in the
12*8a272653SPeter Holm  *    documentation and/or other materials provided with the distribution.
13*8a272653SPeter Holm  *
14*8a272653SPeter Holm  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
15*8a272653SPeter Holm  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16*8a272653SPeter Holm  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17*8a272653SPeter Holm  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
18*8a272653SPeter Holm  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19*8a272653SPeter Holm  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20*8a272653SPeter Holm  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21*8a272653SPeter Holm  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22*8a272653SPeter Holm  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23*8a272653SPeter Holm  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
24*8a272653SPeter Holm  * SUCH DAMAGE.
25*8a272653SPeter Holm  *
26*8a272653SPeter Holm  */
27*8a272653SPeter Holm 
28*8a272653SPeter Holm /* Test shared memory */
29*8a272653SPeter Holm 
30*8a272653SPeter Holm #include <sys/param.h>
31*8a272653SPeter Holm #include <sys/ipc.h>
32*8a272653SPeter Holm #include <sys/msg.h>
33*8a272653SPeter Holm #include <sys/sem.h>
34*8a272653SPeter Holm #include <sys/shm.h>
35*8a272653SPeter Holm #include <err.h>
36*8a272653SPeter Holm #include <errno.h>
37*8a272653SPeter Holm #include <signal.h>
38*8a272653SPeter Holm #include <stdio.h>
39*8a272653SPeter Holm #include <stdlib.h>
40*8a272653SPeter Holm #include <unistd.h>
41*8a272653SPeter Holm 
42*8a272653SPeter Holm #include "stress.h"
43*8a272653SPeter Holm 
44*8a272653SPeter Holm static int	shmid = -1;
45*8a272653SPeter Holm static key_t	shmkey;
46*8a272653SPeter Holm static char	*shm_buf;
47*8a272653SPeter Holm 
48*8a272653SPeter Holm static int	semid = -1;
49*8a272653SPeter Holm static key_t	semkey;
50*8a272653SPeter Holm static struct	sembuf sop[2];
51*8a272653SPeter Holm 
52*8a272653SPeter Holm static size_t	pgsize;
53*8a272653SPeter Holm static pid_t	pid;
54*8a272653SPeter Holm 
55*8a272653SPeter Holm int
setup(int nb __unused)56*8a272653SPeter Holm setup(int nb __unused)
57*8a272653SPeter Holm {
58*8a272653SPeter Holm 	int seed;
59*8a272653SPeter Holm 
60*8a272653SPeter Holm 	pgsize = sysconf(_SC_PAGESIZE);
61*8a272653SPeter Holm 
62*8a272653SPeter Holm 	seed = getpid();
63*8a272653SPeter Holm 	shmkey = ftok("/tmp", seed);
64*8a272653SPeter Holm 	if ((shmid = shmget(shmkey, 10 * pgsize, IPC_CREAT | IPC_EXCL | 0640)) == -1) {
65*8a272653SPeter Holm 		if (errno == ENOSPC) {
66*8a272653SPeter Holm 			fprintf(stderr, "Max number of semaphores reached.\n");
67*8a272653SPeter Holm 			exit(1);
68*8a272653SPeter Holm 		}
69*8a272653SPeter Holm 		err(1, "shmget (%s:%d)", __FILE__, __LINE__);
70*8a272653SPeter Holm 	}
71*8a272653SPeter Holm 
72*8a272653SPeter Holm 	shm_buf = 0;
73*8a272653SPeter Holm 	if ((shm_buf = shmat(shmid, NULL, 0)) == (void *) -1)
74*8a272653SPeter Holm 		err(1, "sender: shmat (%s:%d)", __FILE__, __LINE__);
75*8a272653SPeter Holm 
76*8a272653SPeter Holm 	semkey = ftok("/var", seed);
77*8a272653SPeter Holm 	if ((semid = semget(semkey, 2, IPC_CREAT | IPC_EXCL | 0640)) == -1) {
78*8a272653SPeter Holm 		if (errno == ENOSPC) {
79*8a272653SPeter Holm 			fprintf(stderr, "Max number of semaphores reached.\n");
80*8a272653SPeter Holm 			exit(1);
81*8a272653SPeter Holm 		}
82*8a272653SPeter Holm 		err(1, "semget (%s:%d)", __FILE__, __LINE__);
83*8a272653SPeter Holm 	}
84*8a272653SPeter Holm         /* Initialize the semaphore. */
85*8a272653SPeter Holm         sop[0].sem_num = 0;
86*8a272653SPeter Holm         sop[0].sem_op  = 0;  /* This is the number of runs without queuing. */
87*8a272653SPeter Holm         sop[0].sem_flg = 0;
88*8a272653SPeter Holm         sop[1].sem_num = 1;
89*8a272653SPeter Holm         sop[1].sem_op  = 0;  /* This is the number of runs without queuing. */
90*8a272653SPeter Holm         sop[1].sem_flg = 0;
91*8a272653SPeter Holm         if (semop(semid, sop, 2) == -1)
92*8a272653SPeter Holm             err(1, "init: semop (%s:%d)", __FILE__, __LINE__);
93*8a272653SPeter Holm         return (0);
94*8a272653SPeter Holm }
95*8a272653SPeter Holm 
96*8a272653SPeter Holm void
cleanup(void)97*8a272653SPeter Holm cleanup(void)
98*8a272653SPeter Holm {
99*8a272653SPeter Holm 	if (shmid != -1)
100*8a272653SPeter Holm 		if (shmctl(shmid, IPC_RMID, NULL) == -1 && errno != EINVAL)
101*8a272653SPeter Holm 			warn("shmctl IPC_RMID (%s:%d)", __FILE__, __LINE__);
102*8a272653SPeter Holm 	if (semid != -1)
103*8a272653SPeter Holm 		if (semctl(semid, 0, IPC_RMID, 0) == -1 && errno != EINVAL)
104*8a272653SPeter Holm 			warn("shmctl IPC_RMID (%s:%d)", __FILE__, __LINE__);
105*8a272653SPeter Holm }
106*8a272653SPeter Holm 
107*8a272653SPeter Holm static void
Wait(int i)108*8a272653SPeter Holm Wait(int i) {
109*8a272653SPeter Holm 		sop[0].sem_num = i;
110*8a272653SPeter Holm 		sop[0].sem_op = -1;
111*8a272653SPeter Holm 		if (semop(semid, sop, 1) == -1) {
112*8a272653SPeter Holm 			if (errno != EINTR && errno != EIDRM && errno != EINVAL)
113*8a272653SPeter Holm 				warn("Wait: semop (%s:%d)", __FILE__, __LINE__);
114*8a272653SPeter Holm 			done_testing = 1;
115*8a272653SPeter Holm 		}
116*8a272653SPeter Holm }
117*8a272653SPeter Holm 
118*8a272653SPeter Holm static void
Sig(int i)119*8a272653SPeter Holm Sig(int i) {
120*8a272653SPeter Holm 		sop[0].sem_num = i;
121*8a272653SPeter Holm 		sop[0].sem_op = 1;
122*8a272653SPeter Holm 		if (semop(semid, sop, 1) == -1) {
123*8a272653SPeter Holm 			if (errno != EINTR && errno != EIDRM && errno != EINVAL)
124*8a272653SPeter Holm 			warn("Sig: semop (%s:%d)", __FILE__, __LINE__);
125*8a272653SPeter Holm 			done_testing = 1;
126*8a272653SPeter Holm 		}
127*8a272653SPeter Holm }
128*8a272653SPeter Holm 
129*8a272653SPeter Holm int
test(void)130*8a272653SPeter Holm test(void)
131*8a272653SPeter Holm {
132*8a272653SPeter Holm 	int i = 0;
133*8a272653SPeter Holm 
134*8a272653SPeter Holm 	pid = fork();
135*8a272653SPeter Holm 	if (pid == -1) {
136*8a272653SPeter Holm 		perror("fork");
137*8a272653SPeter Holm 		exit(2);
138*8a272653SPeter Holm 	}
139*8a272653SPeter Holm 
140*8a272653SPeter Holm 	if (pid == 0) {	/* child */
141*8a272653SPeter Holm 		i = 0;
142*8a272653SPeter Holm 		for (;;) {
143*8a272653SPeter Holm 			Wait(1);
144*8a272653SPeter Holm 			if (done_testing == 1)
145*8a272653SPeter Holm 				break;
146*8a272653SPeter Holm 			if (shm_buf[i] != (i % 128)) {
147*8a272653SPeter Holm 				fprintf(stderr,
148*8a272653SPeter Holm 					"child %d: expected %d, got %d\n",
149*8a272653SPeter Holm 					getpid(), i % 128, shm_buf[i]);
150*8a272653SPeter Holm 				break;
151*8a272653SPeter Holm 			}
152*8a272653SPeter Holm 			shm_buf[i] = 0;
153*8a272653SPeter Holm 			i = (i + 1) % (10 * pgsize);
154*8a272653SPeter Holm 			shm_buf[i] = (i % 128);
155*8a272653SPeter Holm 			i = (i + 1) % (10 * pgsize);
156*8a272653SPeter Holm 			Sig(0);
157*8a272653SPeter Holm 		}
158*8a272653SPeter Holm 		_exit(0);
159*8a272653SPeter Holm 
160*8a272653SPeter Holm 	} else {	/* parent */
161*8a272653SPeter Holm 		i = 0;
162*8a272653SPeter Holm 		for (;;) {
163*8a272653SPeter Holm 			shm_buf[i] = (i % 128);
164*8a272653SPeter Holm 			Sig(1);
165*8a272653SPeter Holm 			i = (i + 1) % (10 * pgsize);
166*8a272653SPeter Holm 			Wait(0);
167*8a272653SPeter Holm 			if (done_testing == 1)
168*8a272653SPeter Holm 				break;
169*8a272653SPeter Holm 			if (shm_buf[i] != (i % 128)) {
170*8a272653SPeter Holm 				fprintf(stderr,
171*8a272653SPeter Holm 					"parent(%d): expected %d, got %d\n",
172*8a272653SPeter Holm 					getpid(), i % 128, shm_buf[i]);
173*8a272653SPeter Holm 				break;
174*8a272653SPeter Holm 			}
175*8a272653SPeter Holm 			shm_buf[i] = 0;
176*8a272653SPeter Holm 			i = (i + 1) % (10 * pgsize);
177*8a272653SPeter Holm 		}
178*8a272653SPeter Holm 		kill(pid, SIGHUP);
179*8a272653SPeter Holm 		kill(pid, SIGKILL);
180*8a272653SPeter Holm 	}
181*8a272653SPeter Holm         return (0);
182*8a272653SPeter Holm }
183