1 /****************************************************************************
3 MESSAGE PASSING INTERFACE TEST CASE SUITE
5 Copyright IBM Corp. 1995
7 IBM Corp. hereby grants a non-exclusive license to use, copy, modify, and
8 distribute this software for any purpose and without fee provided that the
9 above copyright notice and the following paragraphs appear in all copies.
11 IBM Corp. makes no representation that the test cases comprising this
12 suite are correct or are an accurate representation of any standard.
14 In no event shall IBM be liable to any party for direct, indirect, special
15 incidental, or consequential damage arising out of the use of this software
16 even if IBM Corp. has been advised of the possibility of such damage.
18 IBM CORP. SPECIFICALLY DISCLAIMS ANY WARRANTIES INCLUDING, BUT NOT LIMITED
19 TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
20 PURPOSE. THE SOFTWARE PROVIDED HEREUNDER IS ON AN "AS IS" BASIS AND IBM
21 CORP. HAS NO OBLIGATION TO PROVIDE MAINTENANCE, SUPPORT, UPDATES,
22 ENHANCEMENTS, OR MODIFICATIONS.
24 ****************************************************************************
26 These test cases reflect an interpretation of the MPI Standard. They are
27 are, in most cases, unit tests of specific MPI behaviors. If a user of any
28 test case from this set believes that the MPI Standard requires behavior
29 different than that implied by the test case we would appreciate feedback.
31 Comments may be sent to:
35 ****************************************************************************
45 int main(int argc, char *argv[])
48 int *out, *in, i, j, k;
51 out = malloc(N * sizeof(int));
52 in = malloc(N * sizeof(int));
53 if ((out == NULL) || (in == NULL)) {
54 printf("Error: cannot allocate N bytes for in or out arrays\n");
57 MPI_Init(&argc, &argv);
58 MPI_Comm_rank(MPI_COMM_WORLD, &myself);
59 MPI_Comm_size(MPI_COMM_WORLD, &tasks);
60 for (j = 1; j <= MAXLEN; j *= 10) {
62 printf("* calling MPI_Alltoall with buffers of %d ints\n", j);
64 for (i = 0; i < j * tasks; i++)
67 MPI_Alltoall(out, j, MPI_INT, in, j, MPI_INT, MPI_COMM_WORLD);
69 for (i = 0; i < tasks; i++) {
70 for (k = 0; k < j; k++) {
71 if (in[k + i * j] != i) {
72 printf("<%d> bad answer (%d) at index %d of %d (should be %d)\n",
73 myself, in[k + i * j], k + i * j, j * tasks, i);
79 MPI_Barrier(MPI_COMM_WORLD);
81 printf("TEST COMPLETE\n");