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
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
|
/*
* Copyright (C) 2019, Northwestern University and Argonne National Laboratory
* See COPYRIGHT notice in top-level directory.
*/
/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
*
* This program check whether BP file header information are synbced accross
* processes properly
*
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <strings.h> /* strcasecmp() */
#include <libgen.h> /* basename() */
#include <pnetcdf.h>
#include <testutils.h>
int cmp_int(int *in, int n, char *lbl){
int i, j;
int rank, np;
int nerrs = 0;
int *all;
MPI_Comm_rank(MPI_COMM_WORLD, &rank);
MPI_Comm_size(MPI_COMM_WORLD, &np);
all = malloc(sizeof(int) * np);
MPI_Gather(&n, 1, MPI_INT, all, 1, MPI_INT, 0, MPI_COMM_WORLD);
if (rank == 0) {
for(i = 1; i < np; i++){
if (all[i] != all[0]){
printf("Number of element at rank %d = %d, expect %d\n", i,
all[i], all[0]);
nerrs++;
}
}
}
for(j = 0; j < n; j++){
MPI_Gather(in + j, 1, MPI_INT, all, 1, MPI_INT, 0, MPI_COMM_WORLD);
if (rank == 0) {
for(i = 1; i < np; i++){
if (all[i] != all[0]){
printf("%s[%d] at rank %d = %d, expect %d\n", lbl, j, i,
all[i], all[0]);
nerrs++;
}
}
}
}
free(all);
return nerrs;
}
int main(int argc, char** argv) {
char filename[256], lbl[256];
int rank, np, err, nerrs=0;
int ncid, nvar, ndim;
int varid, dimid, len;
MPI_Offset dimlen;
int dimids[1024];
MPI_Init(&argc, &argv);
MPI_Comm_rank(MPI_COMM_WORLD, &rank);
MPI_Comm_size(MPI_COMM_WORLD, &np);
if (argc > 2) {
if (!rank) printf("Usage: %s [filename]\n",argv[0]);
MPI_Finalize();
return 1;
}
if (argc == 2) snprintf(filename, 256, "%s", argv[1]);
else strcpy(filename, "arrays.bp");
MPI_Bcast(filename, 256, MPI_CHAR, 0, MPI_COMM_WORLD);
if (rank == 0) {
char *cmd_str = (char*)malloc(strlen(argv[0]) + 256);
sprintf(cmd_str,
"*** TESTING C %s for checking offsets of new variables ",
basename(argv[0]));
printf("%-66s ------ ", cmd_str); fflush(stdout);
free(cmd_str);
}
err = ncmpi_open(MPI_COMM_WORLD, filename, NC_NOWRITE, MPI_INFO_NULL,
&ncid); CHECK_ERR
err = ncmpi_inq(ncid, &ndim, &nvar, NULL, NULL); CHECK_ERR
nerrs += cmp_int(&ndim, 1, "ndim");
nerrs += cmp_int(&nvar, 1, "nvar");
for(dimid = 0; dimid < ndim; dimid++){
err = ncmpi_inq_dimlen(ncid, dimid, &dimlen); CHECK_ERR
len = (int)dimlen;
sprintf(lbl, "size of dim %d", dimid);
nerrs += cmp_int(&len, 1, lbl);
}
for(varid = 0; varid < nvar; varid++){
err = ncmpi_inq_varndims(ncid, varid, &ndim); CHECK_ERR
sprintf(lbl, "ndim of var %d", varid);
nerrs += cmp_int(&ndim, 1, lbl);
if (ndim < 1024){
err = ncmpi_inq_vardimid(ncid, varid, dimids); CHECK_ERR
}
sprintf(lbl, "dims of var %d", varid);
nerrs += cmp_int(dimids, ndim, lbl);
}
ncmpi_close(ncid);
/* check if PnetCDF freed all internal malloc */
MPI_Offset malloc_size, sum_size;
err = ncmpi_inq_malloc_size(&malloc_size);
if (err == NC_NOERR) {
MPI_Reduce(&malloc_size, &sum_size, 1, MPI_OFFSET, MPI_SUM, 0,
MPI_COMM_WORLD);
if (rank == 0 && sum_size > 0)
printf("heap memory allocated by PnetCDF internally has %lld bytes yet to be freed\n",
sum_size);
if (malloc_size > 0) ncmpi_inq_malloc_list();
}
MPI_Allreduce(MPI_IN_PLACE, &nerrs, 1, MPI_INT, MPI_SUM, MPI_COMM_WORLD);
if (rank == 0) {
if (nerrs) printf(FAIL_STR,nerrs);
else printf(PASS_STR);
}
MPI_Finalize();
return (nerrs > 0);
}
|
