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
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
|
/*
* h5ff_client_index.c: Client side test for index routines.
*/
#include <hdf5.h>
#include <mpi.h>
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include <string.h>
#define NTUPLES 256
static int my_rank = 0, my_size = 1;
static void
write_dataset(hid_t file_id, const char *dataset_name,
hsize_t total, hsize_t ncomponents, hid_t datatype_id,
hsize_t ntuples, hsize_t start, void *buf)
{
hid_t dataset_id;
hid_t file_space_id, mem_space_id;
hid_t tid1, rid1, trspl_id;
hsize_t dims[2] = {total, ncomponents};
hsize_t offset[2] = {start, 0};
hsize_t count[2] = {ntuples, ncomponents};
int rank = (ncomponents == 1) ? 1 : 2;
uint64_t version;
herr_t ret;
/* acquire container version 1 - EXACT. */
version = 1;
rid1 = H5RCacquire(file_id, &version, H5P_DEFAULT, H5_EVENT_STACK_NULL);
assert(1 == version);
/* create transaction object */
tid1 = H5TRcreate(file_id, rid1, (uint64_t)2);
assert(tid1);
trspl_id = H5Pcreate(H5P_TR_START);
ret = H5Pset_trspl_num_peers(trspl_id, (unsigned int) my_size);
assert(0 == ret);
ret = H5TRstart(tid1, trspl_id, H5_EVENT_STACK_NULL);
assert(0 == ret);
ret = H5Pclose(trspl_id);
assert(0 == ret);
/* Create the data space for the first dataset. */
file_space_id = H5Screate_simple(rank, dims, NULL);
assert(file_space_id);
/* Create a dataset. */
dataset_id = H5Dcreate_ff(file_id, dataset_name, datatype_id, file_space_id,
H5P_DEFAULT, H5P_DEFAULT, H5P_DEFAULT, tid1, H5_EVENT_STACK_NULL);
assert(dataset_id);
#ifdef H5_HAVE_INDEXING
/* Add indexing information */
ret = H5Xcreate_ff(file_id, H5X_PLUGIN_DUMMY, dataset_id, H5P_DEFAULT,
tid1, H5_EVENT_STACK_NULL);
assert(0 == ret);
#endif
mem_space_id = H5Screate_simple(rank, count, NULL);
assert(mem_space_id);
/* write data to datasets */
/*
ret = H5Sselect_hyperslab(file_space_id, H5S_SELECT_SET, offset,
NULL, count, NULL);
assert(0 == ret);
*/
/* Write the first dataset. */
ret = H5Dwrite_ff(dataset_id, datatype_id, mem_space_id, file_space_id,
H5P_DEFAULT, buf, tid1, H5_EVENT_STACK_NULL);
assert(0 == ret);
/* Close the data space for the first dataset. */
ret = H5Sclose(mem_space_id);
assert(0 == ret);
/* Close the first dataset. */
ret = H5Dclose_ff(dataset_id, H5_EVENT_STACK_NULL);
assert(0 == ret);
ret = H5Sclose(file_space_id);
assert(0 == ret);
/* Finish transaction 0. */
ret = H5TRfinish(tid1, H5P_DEFAULT, NULL, H5_EVENT_STACK_NULL);
assert(0 == ret);
/* release container version 0. */
ret = H5RCrelease(rid1, H5_EVENT_STACK_NULL);
assert(0 == ret);
ret = H5RCclose(rid1);
assert(0 == ret);
ret = H5TRclose(tid1);
assert(0 == ret);
}
static hid_t
query_and_view(hid_t file_id, const char *dataset_name)
{
double lower_bound1 = 39.1, upper_bound1 = 42.1;
int lower_bound2 = 295, upper_bound2 = 298;
hid_t query_id1, query_id2, query_id3, query_id4, query_id5, query_id6;
hid_t query_id, view_id;
hid_t dataset_id;
hid_t rid2;
uint64_t version;
herr_t ret;
/* Create a simple query */
/* query = (39.1 < x < 42.1) || (295 < x < 298) */
query_id1 = H5Qcreate(H5Q_TYPE_DATA_ELEM, H5Q_MATCH_GREATER_THAN,
H5T_NATIVE_DOUBLE, &lower_bound1);
assert(query_id1);
query_id2 = H5Qcreate(H5Q_TYPE_DATA_ELEM, H5Q_MATCH_LESS_THAN,
H5T_NATIVE_DOUBLE, &upper_bound1);
assert(query_id2);
query_id3 = H5Qcombine(query_id1, H5Q_COMBINE_AND, query_id2);
assert(query_id3);
query_id4 = H5Qcreate(H5Q_TYPE_DATA_ELEM, H5Q_MATCH_GREATER_THAN,
H5T_NATIVE_INT, &lower_bound2);
assert(query_id4);
query_id5 = H5Qcreate(H5Q_TYPE_DATA_ELEM, H5Q_MATCH_LESS_THAN,
H5T_NATIVE_INT, &upper_bound2);
assert(query_id5);
query_id6 = H5Qcombine(query_id4, H5Q_COMBINE_AND, query_id5);
assert(query_id6);
query_id = H5Qcombine(query_id3, H5Q_COMBINE_OR, query_id6);
assert(query_id);
/* acquire container version 2 - EXACT. */
version = 2;
rid2 = H5RCacquire(file_id, &version, H5P_DEFAULT, H5_EVENT_STACK_NULL);
assert(rid2 > 0);
assert(2 == version);
MPI_Barrier(MPI_COMM_WORLD);
dataset_id = H5Dopen_ff(file_id, dataset_name, H5P_DEFAULT, rid2,
H5_EVENT_STACK_NULL);
view_id = H5Vcreate_ff(dataset_id, query_id, H5P_DEFAULT, rid2,
H5_EVENT_STACK_NULL);
assert(view_id > 0);
/* TODO do stuff here */
H5Vclose(view_id);
ret = H5Dclose_ff(dataset_id, H5_EVENT_STACK_NULL);
assert(0 == ret);
/* release container version 2. */
ret = H5RCrelease(rid2, H5_EVENT_STACK_NULL);
assert(0 == ret);
ret = H5RCclose(rid2);
assert(0 == ret);
H5Qclose(query_id);
H5Qclose(query_id6);
H5Qclose(query_id5);
H5Qclose(query_id4);
H5Qclose(query_id3);
H5Qclose(query_id2);
H5Qclose(query_id1);
return query_id;
}
int
main(int argc, char **argv)
{
const char *file_name="eff_file_index.h5";
char dataset_name[64];
hsize_t ntuples = NTUPLES;
hsize_t ncomponents = 3;
hsize_t start, total;
int *data;
hid_t file_id, fapl_id;
herr_t ret;
hsize_t i, j;
MPI_Init(&argc, &argv);
getchar();
/* Call EFF_init to initialize the EFF stack. */
EFF_init(MPI_COMM_WORLD, MPI_INFO_NULL);
MPI_Comm_rank(MPI_COMM_WORLD, &my_rank);
MPI_Comm_size(MPI_COMM_WORLD, &my_size);
fprintf(stderr, "APP processes = %d, my rank is %d\n", my_size, my_rank);
/* In this example write one dataset per process */
memset(dataset_name, '\0', 64);
sprintf(dataset_name, "D%d", my_rank);
/*
start = ntuples * (hsize_t) my_rank;
total = ntuples * (hsize_t) my_size;
*/
/* We write to separate datasets */
start = 0;
total = ntuples;
/* Initialize the dataset. */
data = (int *) malloc(sizeof(int) * ncomponents * ntuples);
for (i = 0; i < ntuples; i++) {
for (j = 0; j < ncomponents; j++) {
data[ncomponents * i + j] = my_rank * ntuples + i;
}
}
MPI_Barrier(MPI_COMM_WORLD);
/* Choose the IOD VOL plugin to use with this file. */
fapl_id = H5Pcreate(H5P_FILE_ACCESS);
H5Pset_fapl_iod(fapl_id, MPI_COMM_WORLD, MPI_INFO_NULL);
/* Open an existing file. */
file_id = H5Fcreate_ff(file_name, H5F_ACC_TRUNC, H5P_DEFAULT, fapl_id,
H5_EVENT_STACK_NULL);
ret = H5Pclose(fapl_id);
assert(0 == ret);
write_dataset(file_id, dataset_name, total, ncomponents, H5T_NATIVE_INT,
ntuples, start, data);
MPI_Barrier(MPI_COMM_WORLD);
query_and_view(file_id, dataset_name);
MPI_Barrier(MPI_COMM_WORLD);
/* Close the file. */
ret = H5Fclose_ff(file_id, 1, H5_EVENT_STACK_NULL);
assert(0 == ret);
free(data);
MPI_Barrier(MPI_COMM_WORLD);
EFF_finalize();
MPI_Finalize();
return 0;
}
|
