/* * Copyright (c) International Business Machines Corp., 2002 * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See * the GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA * * 06/30/2001 Port to Linux nsharoff@us.ibm.com * 11/11/2002 Port to LTP dbarrera@us.ibm.com */ /* * Get and manipulate a message queue. */ #define _XOPEN_SOURCE 500 #include #include #include #include #include #include #include #include #include #include #include #include "test.h" #include "ipcmsg.h" #include "libmsgctl.h" char *TCID = "msgstress02"; int TST_TOTAL = 1; #define MAXNREPS 1000 #ifndef CONFIG_COLDFIRE #define MAXNPROCS 1000000 /* This value is set to an arbitrary high limit. */ #else #define MAXNPROCS 100000 /* Coldfire can't deal with 1000000 */ #endif #define MAXNKIDS 10 static key_t keyarray[MAXNPROCS]; static int pidarray[MAXNPROCS]; static int rkidarray[MAXNKIDS]; static int wkidarray[MAXNKIDS]; static int tid; static int nprocs, nreps, nkids, MSGMNI; static int procstat; void setup(void); void cleanup(void); static void term(int); static int dotest(key_t, int); static void cleanup_msgqueue(int i, int tid); static char *opt_nprocs; static char *opt_nkids; static char *opt_nreps; static option_t options[] = { {"n:", NULL, &opt_nprocs}, {"c:", NULL, &opt_nkids}, {"l:", NULL, &opt_nreps}, {NULL, NULL, NULL}, }; static void usage(void) { printf(" -n Number of processes\n"); printf(" -c Number of read/write child pairs\n"); printf(" -l Number of iterations\n"); } int main(int argc, char **argv) { int i, j, ok, pid; int count, status; tst_parse_opts(argc, argv, options, usage); setup(); nreps = MAXNREPS; nprocs = MSGMNI; nkids = MAXNKIDS; if (opt_nreps) { nreps = atoi(opt_nreps); if (nreps > MAXNREPS) { tst_resm(TINFO, "Requested number of iterations too large, " "setting to Max. of %d", MAXNREPS); nreps = MAXNREPS; } } if (opt_nprocs) { nprocs = atoi(opt_nprocs); if (nprocs > MSGMNI) { tst_resm(TINFO, "Requested number of processes too large, " "setting to Max. of %d", MSGMNI); nprocs = MSGMNI; } } if (opt_nkids) { nkids = atoi(opt_nkids); if (nkids > MAXNKIDS) { tst_resm(TINFO, "Requested number of read/write pairs too " "large, setting to Max. of %d", MAXNKIDS); nkids = MAXNKIDS; } } procstat = 0; srand48((unsigned)getpid() + (unsigned)(getppid() << 16)); tid = -1; /* Setup signal handleing routine */ if (sigset(SIGTERM, term) == SIG_ERR) { tst_brkm(TFAIL, NULL, "Sigset SIGTERM failed"); } /* Set up array of unique keys for use in allocating message * queues */ for (i = 0; i < nprocs; i++) { ok = 1; do { /* Get random key */ keyarray[i] = (key_t) lrand48(); /* Make sure key is unique and not private */ if (keyarray[i] == IPC_PRIVATE) { ok = 0; continue; } for (j = 0; j < i; j++) { if (keyarray[j] == keyarray[i]) { ok = 0; break; } ok = 1; } } while (ok == 0); } /* Fork a number of processes (nprocs), each of which will * create a message queue with several (nkids) reader/writer * pairs which will read and write a number (iterations) * of random length messages with specific values (keys). */ for (i = 0; i < nprocs; i++) { fflush(stdout); if ((pid = FORK_OR_VFORK()) < 0) { tst_brkm(TFAIL, NULL, "\tFork failed (may be OK if under stress)"); } /* Child does this */ if (pid == 0) { procstat = 1; exit(dotest(keyarray[i], i)); } pidarray[i] = pid; } count = 0; while (1) { if ((wait(&status)) > 0) { if (status >> 8 != PASS) { tst_brkm(TFAIL, NULL, "Child exit status = %d", status >> 8); } count++; } else { if (errno != EINTR) { break; } #ifdef DEBUG tst_resm(TINFO, "Signal detected during wait"); #endif } } /* Make sure proper number of children exited */ if (count != nprocs) { tst_brkm(TFAIL, NULL, "Wrong number of children exited, Saw %d, Expected %d", count, nprocs); } tst_resm(TPASS, "Test ran successfully!"); cleanup(); tst_exit(); } static void cleanup_msgqueue(int i, int tid) { /* * Decrease the value of i by 1 because it * is getting incremented even if the fork * is failing. */ i--; /* * Kill all children & free message queue. */ for (; i >= 0; i--) { (void)kill(rkidarray[i], SIGKILL); (void)kill(wkidarray[i], SIGKILL); } if (msgctl(tid, IPC_RMID, 0) < 0) { tst_brkm(TFAIL | TERRNO, NULL, "Msgctl error in cleanup"); } } static int dotest(key_t key, int child_process) { int id, pid; int i, count, status, exit_status; sighold(SIGTERM); if ((id = msgget(key, IPC_CREAT | S_IRUSR | S_IWUSR)) < 0) { printf("msgget() error in child %d: %s\n", child_process, strerror(errno)); return FAIL; } tid = id; sigrelse(SIGTERM); exit_status = PASS; for (i = 0; i < nkids; i++) { fflush(stdout); if ((pid = FORK_OR_VFORK()) < 0) { printf("Fork failure in the first child of child group %d\n", child_process); cleanup_msgqueue(i, tid); return FAIL; } /* First child does this */ if (pid == 0) { procstat = 2; exit(doreader(key, tid, getpid(), child_process, nreps)); } rkidarray[i] = pid; fflush(stdout); if ((pid = FORK_OR_VFORK()) < 0) { printf("Fork failure in the second child of child group %d\n", child_process); /* * Kill the reader child process */ (void)kill(rkidarray[i], SIGKILL); cleanup_msgqueue(i, tid); return FAIL; } /* Second child does this */ if (pid == 0) { procstat = 2; exit(dowriter(key, tid, rkidarray[i], child_process, nreps)); } wkidarray[i] = pid; } /* Parent does this */ count = 0; while (1) { if ((wait(&status)) > 0) { if (status >> 8 != PASS) { printf("Child exit status = %d from child group %d\n", status >> 8, child_process); for (i = 0; i < nkids; i++) { kill(rkidarray[i], SIGTERM); kill(wkidarray[i], SIGTERM); } if (msgctl(tid, IPC_RMID, 0) < 0) { printf("msgctl() error: %s\n", strerror(errno)); } return FAIL; } count++; } else { if (errno != EINTR) { break; } } } /* Make sure proper number of children exited */ if (count != (nkids * 2)) { printf("Wrong number of children exited in child group %d, saw %d, expected %d\n", child_process, count, (nkids * 2)); if (msgctl(tid, IPC_RMID, 0) < 0) { printf("msgctl() error: %s\n", strerror(errno)); } return FAIL; } if (msgctl(id, IPC_RMID, 0) < 0) { printf("msgctl() failure in child group %d: %s\n", child_process, strerror(errno)); return FAIL; } return exit_status; } static void term(int sig LTP_ATTRIBUTE_UNUSED) { int i; if (procstat == 0) { #ifdef DEBUG tst_resm(TINFO, "SIGTERM signal received, test killing kids"); #endif for (i = 0; i < nprocs; i++) { if (pidarray[i] > 0) { if (kill(pidarray[i], SIGTERM) < 0) { printf("Kill failed to kill child %d", i); exit(FAIL); } } } return; } if (procstat == 2) { fflush(stdout); exit(PASS); } if (tid == -1) { exit(FAIL); } for (i = 0; i < nkids; i++) { if (rkidarray[i] > 0) kill(rkidarray[i], SIGTERM); if (wkidarray[i] > 0) kill(wkidarray[i], SIGTERM); } } void setup(void) { int nr_msgqs; tst_tmpdir(); tst_sig(FORK, DEF_HANDLER, cleanup); TEST_PAUSE; nr_msgqs = get_max_msgqueues(); if (nr_msgqs < 0) cleanup(); nr_msgqs -= get_used_msgqueues(); if (nr_msgqs <= 0) { tst_resm(TBROK, "Max number of message queues already used, cannot create more."); cleanup(); } /* * Since msgmni scales to the memory size, it may reach huge values * that are not necessary for this test. * That's why we define NR_MSGQUEUES as a high boundary for it. */ MSGMNI = min(nr_msgqs, NR_MSGQUEUES); } void cleanup(void) { int status; #ifdef DEBUG tst_resm(TINFO, "Removing the message queue"); #endif fflush(stdout); (void)msgctl(tid, IPC_RMID, NULL); if ((status = msgctl(tid, IPC_STAT, NULL)) != -1) { (void)msgctl(tid, IPC_RMID, NULL); tst_resm(TFAIL, "msgctl(tid, IPC_RMID) failed"); } fflush(stdout); tst_rmdir(); }