File: infodupx.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 (98 lines) | stat: -rw-r--r-- 2,672 bytes parent folder | download | duplicates (3)
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
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
/*
 * 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"
#ifdef HAVE_STRING_H
#include <string.h>
#endif

int main(int argc, char *argv[])
{
    int errs = 0;
    MPI::Info info1, infodup;
    int nkeys, nkeysdup, i, vallen, flag, flagdup;
    char *key, *keydup;
    char *value, *valdup;

    MTest_Init();

    key = new char[MPI::MAX_INFO_KEY];
    keydup = new char[MPI::MAX_INFO_KEY];
    value = new char[MPI::MAX_INFO_VAL];
    valdup = new char[MPI::MAX_INFO_VAL];

    info1 = MPI::Info::Create();
    /* Use only named keys in case the info implementation only supports
     * the predefined keys (e.g., IBM) */
    info1.Set("host", "myhost.myorg.org");
    info1.Set("file", "runfile.txt");
    info1.Set("soft", "2:1000:4,3:1000:7");

    infodup = info1.Dup();

    nkeysdup = infodup.Get_nkeys();
    nkeys = info1.Get_nkeys();
    if (nkeys != nkeysdup) {
        errs++;
        cout << "Dup'ed info has a different number of keys; is " <<
            nkeysdup << " should be " << nkeys << "\n";
    }
    vallen = MPI::MAX_INFO_VAL;
    for (i = 0; i < nkeys; i++) {
        /* MPI requires that the keys are in the same order after the dup */
        info1.Get_nthkey(i, key);
        infodup.Get_nthkey(i, keydup);
        if (strcmp(key, keydup)) {
            errs++;
            cout << "keys do not match: " << keydup << " should be " << key << "\n";
        }

        vallen = MPI::MAX_INFO_VAL;
        flag = info1.Get(key, vallen, value);
        flagdup = infodup.Get(keydup, vallen, valdup);
        if (!flag || !flagdup) {
            errs++;
            cout << "Info get failed for key " << key << "\n";
        } else if (strcmp(value, valdup)) {
            errs++;
            cout << "Info values for key " << key << " not the same after dup\n";
        }
    }

    /* Change info and check that infodup does NOT have the new value
     * (ensure that lazy dups are still duped) */
    info1.Set("path", "/a:/b:/c/d");

    flag = infodup.Get("path", vallen, value);
    if (flag) {
        errs++;
        cout << "inserting path into info changed infodup\n";
    }

    info1.Free();
    infodup.Free();

    MTest_Finalize(errs);
    delete[]key;
    delete[]keydup;
    delete[]value;
    delete[]valdup;


    return 0;
}