4 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License version 2 only,
8 * as published by the Free Software Foundation.
10 * This program is distributed in the hope that it will be useful, but
11 * WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * General Public License version 2 for more details (a copy is included
14 * in the LICENSE file that accompanied this code).
16 * You should have received a copy of the GNU General Public License
17 * version 2 along with this program; If not, see
18 * http://www.gnu.org/licenses/gpl-2.0.html
23 * Copyright (c) 2003, 2010, Oracle and/or its affiliates. All rights reserved.
24 * Use is subject to license terms.
26 * Copyright (c) 2012, Intel Corporation.
29 * This file is part of Lustre, http://www.lustre.org/
31 * lustre/tests/write_disjoint.c
33 * Each loop does 3 things:
34 * - rank 0 truncates to 0
35 * - all ranks agree on a random chunk size
36 * - all ranks race to write their pattern to their chunk of the file
37 * - rank 0 makes sure that the resulting file size is ranks * chunk size
38 * - rank 0 makes sure that everyone's patterns went to the right place
40 * compile: mpicc -g -Wall -o write_disjoint write_disjoint.c
41 * run: mpirun -np N -machlist <hostlist file> write_disjoint
42 * or: pdsh -w <N hosts> write_disjoint
43 * or: prun -n N [-N M] write_disjoint
48 #include <sys/types.h>
58 /* Chosen arbitrarily. Actually running this large will take a long time.*/
59 #define CHUNK_MAX_SIZE (1024 * 1024 * 16)
61 void rprintf(int rank, int loop, const char *fmt, ...)
65 printf("rank %d, loop %d: ", rank, loop);
71 MPI_Abort(MPI_COMM_WORLD, -1); /* This will exit() according to man */
74 #define CHUNK_SIZE(n) chunk_size[(n) % 2]
76 int main(int argc, char *argv[])
79 unsigned long chunk_size[2];
80 int rank, noProcessors, done;
87 char *filename = "/mnt/lustre/write_disjoint";
89 int max_size = CHUNK_MAX_SIZE;
91 unsigned int seed = 0;
92 int seed_provided = 0;
94 error = MPI_Init(&argc, &argv);
95 if (error != MPI_SUCCESS)
96 rprintf(-1, -1, "MPI_Init failed: %d\n", error);
97 /* Parse command line options */
98 while ((c = getopt(argc, argv, "f:n:m:s:")) != EOF) {
105 numloops = strtoul(optarg, NULL, 0);
108 max_size = strtoul(optarg, NULL, 0);
109 if (max_size > CHUNK_MAX_SIZE)
110 rprintf(-1, -1, "Chunk size larger than %d.\n",
114 seed = strtoul(optarg, NULL, 0);
120 MPI_Comm_size(MPI_COMM_WORLD, &noProcessors);
121 MPI_Comm_rank(MPI_COMM_WORLD, &rank);
123 chunk_buf = malloc(noProcessors * sizeof(chunk_buf[0]));
124 for (i = 0; i < noProcessors; i++) {
125 chunk_buf[i] = malloc(max_size);
126 memset(chunk_buf[i], 'A' + i, max_size);
128 read_buf = malloc(noProcessors * max_size);
131 fd = open(filename, O_WRONLY | O_CREAT | O_TRUNC, 0666);
133 rprintf(rank, -1, "open() returned %s\n",
136 MPI_Barrier(MPI_COMM_WORLD);
138 fd = open(filename, O_RDWR);
140 rprintf(rank, -1, "open() returned %s\n", strerror(errno));
144 seed = (unsigned int)time(NULL);
145 printf("random seed: %d\n", seed);
149 for (n = 0; n < numloops; n++) {
150 /* reset the environment */
152 ret = truncate(filename, 0);
154 rprintf(rank, n, "truncate() returned %s\n",
159 MPI_Bcast(&random, 1, MPI_INT, 0, MPI_COMM_WORLD);
160 CHUNK_SIZE(n) = random % max_size;
162 if (n % 1000 == 0 && rank == 0)
163 printf("loop %d: chunk_size %lu\n", n, CHUNK_SIZE(n));
165 if (stat(filename, &stat_buf) < 0)
166 rprintf(rank, n, "error stating %s: %s\n",
167 filename, strerror(errno));
169 if (stat_buf.st_size != 0)
171 "filesize = %lu. Should be zero after truncate\n",
174 MPI_Barrier(MPI_COMM_WORLD);
177 offset = rank * CHUNK_SIZE(n);
178 lseek(fd, offset, SEEK_SET);
182 ret = write(fd, chunk_buf[rank] + done,
183 CHUNK_SIZE(n) - done);
184 if (ret < 0 && errno != EINTR)
185 rprintf(rank, n, "write() returned %s\n",
189 } while (done != CHUNK_SIZE(n));
191 MPI_Barrier(MPI_COMM_WORLD);
193 /* Check the result */
194 if (stat(filename, &stat_buf) < 0)
195 rprintf(rank, n, "error stating %s: %s\n",
196 filename, strerror(errno));
198 if (stat_buf.st_size != CHUNK_SIZE(n) * noProcessors) {
200 printf("loop %d: chunk_size %lu, file size was %lu\n",
201 n - 1, CHUNK_SIZE(n - 1),
202 CHUNK_SIZE(n - 1) * noProcessors);
204 "invalid file size %lu instead of %lu = %lu * %u\n",
205 (unsigned long)stat_buf.st_size,
206 CHUNK_SIZE(n) * noProcessors,
207 CHUNK_SIZE(n), noProcessors);
211 if (lseek(fd, 0, SEEK_SET) < 0)
212 rprintf(rank, n, "error seeking to 0: %s\n",
217 ret = read(fd, read_buf + done,
218 CHUNK_SIZE(n) * noProcessors - done);
220 rprintf(rank, n, "read returned %s\n",
224 } while (done != CHUNK_SIZE(n) * noProcessors);
226 for (i = 0; i < noProcessors; i++) {
230 if (!memcmp(read_buf + (i * CHUNK_SIZE(n)),
231 chunk_buf[i], CHUNK_SIZE(n)))
234 /* print out previous chunk sizes */
236 printf("loop %d: chunk_size %lu\n",
237 n - 1, CHUNK_SIZE(n - 1));
239 printf("loop %d: chunk %d corrupted with chunk_size %lu, page_size %d\n",
240 n, i, CHUNK_SIZE(n), getpagesize());
241 printf("ranks:\tpage boundry\tchunk boundry\tpage boundry\n");
242 for (j = 1 ; j < noProcessors; j++) {
243 int b = j * CHUNK_SIZE(n);
245 printf("%c -> %c:\t%d\t%d\t%d\n",
246 'A' + j - 1, 'A' + j,
247 b & ~(getpagesize() - 1), b,
248 (b + getpagesize()) &
249 ~(getpagesize() - 1));
252 sprintf(command, "od -Ad -a %s", filename);
253 ret = system(command);
254 rprintf(0, n, "data check error - exiting\n");
257 MPI_Barrier(MPI_COMM_WORLD);
260 printf("Finished after %d loops\n", n);