blob: de4b459a1df764537f8355cc34fde713bb3290c8 [file] [log] [blame]
/*
* 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/06/2002 Port to LTP dbarrera@us.ibm.com
*/
/*
* Get and manipulate a message queue.
* Same as msgstress01 but gets the actual msgmni value under procfs.
*/
#define _XOPEN_SOURCE 500
#include <signal.h>
#include <errno.h>
#include <string.h>
#include <fcntl.h>
#include <stdlib.h>
#include <stdio.h>
#include <unistd.h>
#include <values.h>
#include <sys/types.h>
#include <sys/wait.h>
#include <sys/stat.h>
#include <sys/ipc.h>
#include <sys/msg.h>
#include "test.h"
#include "ipcmsg.h"
#include "../lib/libmsgctl.h"
char *TCID = "msgstress03";
int TST_TOTAL = 1;
#define MAXNPROCS 10000 /*These should be sufficient */
#define MAXNREPS 10000 /*Else they srewup the system un-necessarily */
static key_t keyarray[MAXNPROCS];
static int pidarray[MAXNPROCS];
static int tid;
static int MSGMNI, nprocs, nreps;
static int procstat;
static int mykid;
void setup(void);
void cleanup(void);
static int dotest(key_t key, int child_process);
static void sig_handler(int signo);
static char *opt_nprocs;
static char *opt_nreps;
static option_t options[] = {
{"n:", NULL, &opt_nprocs},
{"l:", NULL, &opt_nreps},
{NULL, NULL, NULL},
};
static void usage(void)
{
printf(" -n Number of processes\n");
printf(" -l Number of iterations\n");
}
int main(int argc, char **argv)
{
int i, j, ok, pid;
int count, status;
struct sigaction act;
tst_parse_opts(argc, argv, options, usage);
setup();
nreps = MAXNREPS;
nprocs = MSGMNI;
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;
}
}
srand(getpid());
tid = -1;
/* Setup signal handling routine */
memset(&act, 0, sizeof(act));
act.sa_handler = sig_handler;
sigemptyset(&act.sa_mask);
sigaddset(&act.sa_mask, SIGTERM);
if (sigaction(SIGTERM, &act, NULL) < 0) {
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) rand();
/* 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, each of which will
* create a message queue with one reader/writer
* pair which will read and write a number (iterations)
* of random length messages with specific values.
*/
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 != 0) {
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 int dotest(key_t key, int child_process)
{
int id, pid;
int ret, status;
sighold(SIGTERM);
TEST(msgget(key, IPC_CREAT | S_IRUSR | S_IWUSR));
if (TEST_RETURN < 0) {
printf("msgget() error in child %d: %s\n",
child_process, strerror(TEST_ERRNO));
return FAIL;
}
tid = id = TEST_RETURN;
sigrelse(SIGTERM);
fflush(stdout);
if ((pid = FORK_OR_VFORK()) < 0) {
printf("Fork failed (may be OK if under stress)\n");
TEST(msgctl(tid, IPC_RMID, 0));
if (TEST_RETURN < 0) {
printf("msgctl() error in cleanup: %s\n",
strerror(TEST_ERRNO));
}
return FAIL;
}
if (pid == 0)
exit(doreader(key, id, 1, child_process, nreps));
mykid = pid;
procstat = 2;
ret = dowriter(key, id, 1, child_process, nreps);
wait(&status);
if (ret != PASS)
exit(FAIL);
if ((!WIFEXITED(status) || (WEXITSTATUS(status) != PASS)))
exit(FAIL);
TEST(msgctl(id, IPC_RMID, 0));
if (TEST_RETURN < 0) {
printf("msgctl() failed: %s\n",
strerror(TEST_ERRNO));
return FAIL;
}
return PASS;
}
static void sig_handler(int signo LTP_ATTRIBUTE_UNUSED)
{
}
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();
MSGMNI = nr_msgqs - get_used_msgqueues();
if (MSGMNI > MAXNPROCS)
MSGMNI = MAXNPROCS;
if (MSGMNI <= 0) {
tst_resm(TBROK,
"Max number of message queues already used, cannot create more.");
cleanup();
}
}
void cleanup(void)
{
int status;
#ifdef DEBUG
tst_resm(TINFO, "Removing the message queue");
#endif
(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");
}
tst_rmdir();
}