1 /* Copyright (c) 2012, 2014. The SimGrid Team.
2 * All rights reserved. */
4 /* This program is free software; you can redistribute it and/or modify it
5 * under the terms of the license (GNU LGPL) which comes with this package. */
7 /****************************************************************************
9 MESSAGE PASSING INTERFACE TEST CASE SUITE
11 Copyright IBM Corp. 1995
13 IBM Corp. hereby grants a non-exclusive license to use, copy, modify, and
14 distribute this software for any purpose and without fee provided that the
15 above copyright notice and the following paragraphs appear in all copies.
17 IBM Corp. makes no representation that the test cases comprising this
18 suite are correct or are an accurate representation of any standard.
20 In no event shall IBM be liable to any party for direct, indirect, special
21 incidental, or consequential damage arising out of the use of this software
22 even if IBM Corp. has been advised of the possibility of such damage.
24 IBM CORP. SPECIFICALLY DISCLAIMS ANY WARRANTIES INCLUDING, BUT NOT LIMITED
25 TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
26 PURPOSE. THE SOFTWARE PROVIDED HEREUNDER IS ON AN "AS IS" BASIS AND IBM
27 CORP. HAS NO OBLIGATION TO PROVIDE MAINTENANCE, SUPPORT, UPDATES,
28 ENHANCEMENTS, OR MODIFICATIONS.
30 ****************************************************************************
32 These test cases reflect an interpretation of the MPI Standard. They are
33 are, in most cases, unit tests of specific MPI behaviors. If a user of any
34 test case from this set believes that the MPI Standard requires behavior
35 different than that implied by the test case we would appreciate feedback.
37 Comments may be sent to:
41 ****************************************************************************
51 int main(int argc, char *argv[])
54 int *out, *in, i, j, k;
57 out = malloc(N * sizeof(int));
58 in = malloc(N * sizeof(int));
59 if ((out == NULL) || (in == NULL)) {
60 printf("Error: cannot allocate N bytes for in or out arrays\n");
63 MPI_Init(&argc, &argv);
64 MPI_Comm_rank(MPI_COMM_WORLD, &myself);
65 MPI_Comm_size(MPI_COMM_WORLD, &tasks);
66 for (j = 1; j <= MAXLEN; j *= 10) {
68 printf("* calling MPI_Alltoall with buffers of %d ints\n", j);
70 for (i = 0; i < j * tasks; i++)
73 MPI_Alltoall(out, j, MPI_INT, in, j, MPI_INT, MPI_COMM_WORLD);
75 for (i = 0; i < tasks; i++) {
76 for (k = 0; k < j; k++) {
77 if (in[k + i * j] != i) {
78 printf("<%d> bad answer (%d) at index %d of %d (should be %d)\n",
79 myself, in[k + i * j], k + i * j, j * tasks, i);
85 MPI_Barrier(MPI_COMM_WORLD);
87 printf("TEST COMPLETE\n");