File: reduceboolx.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 (64 lines) | stat: -rw-r--r-- 1,739 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
/*
 * Copyright (C) by Argonne National Laboratory
 *     See COPYRIGHT in top-level directory
 */

/* Sanity check that logical operations can be performed on C++ bool types
 * via MPI::BOOL. */

#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"

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

    MTest_Init();

    size = comm.Get_size();
    rank = comm.Get_rank();

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

        for (root = 0; root < size; root++) {
            for (i = 0; i < count; i++) {
                // only rank 0's elements are set to true
                vin[i] = (rank ? false : true);
                vout[i] = false;
            }
            comm.Reduce(vin, vout, count, MPI::BOOL, MPI::LOR, root);
            if (rank == root) {
                for (i = 0; i < count; i++) {
                    if (vout[i] != true) {
                        errs++;
                        if (errs < 10)
                            cerr << rank << ": " << "count=" << count
                                << " root=" << root << " vout[" << i << "]=" << vout[i] << endl;
                    }
                }
            }
        }
        delete[]vin;
        delete[]vout;
    }

    MTest_Finalize(errs);
    return 0;
}