File: uexscan.cxx

package info (click to toggle)
mpich 4.0.2-3
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 423,384 kB
  • sloc: ansic: 1,088,434; cpp: 71,364; javascript: 40,763; f90: 22,829; sh: 17,463; perl: 14,773; xml: 14,418; python: 10,265; makefile: 9,246; fortran: 8,008; java: 4,355; asm: 324; ruby: 176; lisp: 19; php: 8; sed: 4
file content (79 lines) | stat: -rw-r--r-- 1,925 bytes parent folder | download | duplicates (4)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
/*
 * Copyright (C) by Argonne National Laboratory
 *     See COPYRIGHT in top-level directory
 */

#include "mpi.h"
#include "mpitestconf.h"
#ifdef HAVE_IOSTREAM
// Not all C++ compilers have iostream instead of iostream.h
#include <iostream>
#ifdef HAVE_NAMESPACE_STD
// Those that do often need the std namespace; otherwise, a bare "cout"
// is likely to fail to compile
using namespace std;
#endif
#else
#include <iostream.h>
#endif
#include "mpitestcxx.h"

void uop(const void *invec, void *inoutvec, int count, const MPI::Datatype & datatype)
{
    int i;
    int *cin = (int *) invec, *cout = (int *) inoutvec;

    for (i = 0; i < count; i++) {
        cout[i] = cin[i] + cout[i];
    }
}

int main(int argc, char **argv)
{
    MPI::Op sumop;
    MPI::Intracomm comm = MPI::COMM_WORLD;
    int errs = 0;
    int i, count, rank;

    MTest_Init();

    sumop.Init(uop, true);
    rank = comm.Get_rank();

    for (count = 1; count < 66000; count = count * 2) {
        int *vin, *vout;
        vin = new int[count];
        vout = new int[count];

        for (i = 0; i < count; i++) {
            vin[i] = i;
            vout[i] = -1;
        }
        comm.Exscan(vin, vout, count, MPI::INT, sumop);
        if (rank == 0) {
            for (i = 0; i < count; i++) {
                if (vout[i] != -1) {
                    errs++;
                    if (errs < 10) {
                        cerr << "vout[" << i << "] = " << vout[i] << endl;
                    }
                }
            }
        } else {
            for (i = 0; i < count; i++) {
                if (vout[i] != i * (rank)) {
                    errs++;
                    if (errs < 10) {
                        cerr << "vout[" << i << "] = " << vout[i] << endl;
                    }
                }
            }
        }
        delete[]vin;
        delete[]vout;
    }

    sumop.Free();
    MTest_Finalize(errs);
    return 0;
}