/*****************************************************************************\ * test12.2.prog.c - Simple test program for Slurm regression test12.2. * Usage: test12.2.prog ***************************************************************************** * Copyright (C) 2005 The Regents of the University of California. * Produced at Lawrence Livermore National Laboratory (cf, DISCLAIMER). * Written by Morris Jette * CODE-OCEC-09-009. All rights reserved. * * This file is part of Slurm, a resource management program. * For details, see . * Please also read the included file: DISCLAIMER. * * Slurm 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. * * Slurm 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 Slurm; if not, write to the Free Software Foundation, Inc., * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. \*****************************************************************************/ #include #include #include #include #include #include #include #include int main (int argc, char **argv) { int exit_code, sleep_time, mem_kb; int i; long long int n; long long int file_size; int fd; char *mem = NULL; char *file_name; time_t time_start = time(NULL); int size, rank; if (argc != 6) { fprintf(stderr, "Usage: %s \n", argv[0]); exit(1); } exit_code = atoi(argv[1]); sleep_time = atoi(argv[2]); mem_kb = atoi(argv[3]); file_size = atoll(argv[4]); file_name = argv[5]; rank = atoi(getenv("SLURM_PROCID")); if (rank == 0) { mem = malloc(mem_kb * 1024); /* We need to do a memset on the memory or AIX will not count * the memory in the job step's Resident Set Size. */ memset(mem, 0, (mem_kb * 1024)); /* Then we touch some memory using the volatile keyword so * the compiler does not optimize out the memset. */ *(volatile char*)mem = *(volatile char*)mem; } if (rank == 1) { /* Don't use malloc() to write() and read() a blob * of memory as it will interfere with the memory * test, don't use stdio for the same reason, it * allocates memory. */ fd = open(file_name, O_WRONLY|O_CREAT|O_TRUNC, S_IRUSR|S_IWUSR); n = file_size/sizeof(int); for (i = 0; i < n; i++) { if (write(fd, &i, sizeof(int)) != sizeof(int)) { fprintf(stderr, "FAILURE: write error\n"); exit(1); } } fsync(fd); close(fd); } if (rank == 2) { sleep(5); fd = open(file_name, O_RDONLY, S_IRUSR|S_IWUSR); n = file_size/sizeof(int); for (i = 0; i < n; i++) { if (read(fd, &i, sizeof(int)) != sizeof(int)) { fprintf(stderr, "FAILURE: read error\n"); exit(1); } } close(fd); } sleep_time -= difftime(time(NULL), time_start); sleep(sleep_time); if (mem) free(mem); exit(exit_code); }