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
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
|
/*
* Copyright (c) 2004-2010 The Trustees of Indiana University and Indiana
* University Research and Technology
* Corporation. All rights reserved.
* Copyright (c) 2004-2011 The University of Tennessee and The University
* of Tennessee Research Foundation. All rights
* reserved.
* Copyright (c) 2004-2005 High Performance Computing Center Stuttgart,
* University of Stuttgart. All rights reserved.
* Copyright (c) 2004-2005 The Regents of the University of California.
* All rights reserved.
* Copyright (c) 2006-2013 Los Alamos National Security, LLC.
* All rights reserved.
* Copyright (c) 2009-2012 Cisco Systems, Inc. All rights reserved.
* Copyright (c) 2011 Oak Ridge National Labs. All rights reserved.
* Copyright (c) 2013-2020 Intel, Inc. All rights reserved.
* Copyright (c) 2015 Mellanox Technologies, Inc. All rights reserved.
* Copyright (c) 2019 IBM Corporation. All rights reserved.
* Copyright (c) 2021-2025 Nanook Consulting All rights reserved.
* $COPYRIGHT$
*
* Additional copyrights may follow
*
* $HEADER$
*
*/
#define _GNU_SOURCE
#include <stdbool.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <time.h>
#include <unistd.h>
#include <libgen.h>
#include <pmix.h>
#include "examples.h"
#define NITER 10
int main(int argc, char **argv)
{
pmix_proc_t myproc;
int rc, n;
pmix_value_t *val = NULL;
pmix_proc_t proc;
uint32_t nprocs;
pmix_info_t info[2], lkinfo[2];
pmix_pdata_t pdata;
pmix_persistence_t firstread = PMIX_PERSIST_FIRST_READ;
int timeout=10;
char *tmp;
int iters;
size_t ninfo, bcount=0;
char *keys[3];
if (1 < argc) {
iters = strtol(argv[1], NULL, 10);
} else {
iters = NITER;
}
/* init us */
if (PMIX_SUCCESS != (rc = PMIx_Init(&myproc, NULL, 0))) {
fprintf(stderr, "Client ns %s rank %d: PMIx_Init failed: %d\n", myproc.nspace, myproc.rank,
rc);
exit(0);
}
/* get our job size */
PMIX_PROC_CONSTRUCT(&proc);
PMIX_LOAD_PROCID(&proc, myproc.nspace, PMIX_RANK_WILDCARD);
if (PMIX_SUCCESS != (rc = PMIx_Get(&proc, PMIX_JOB_SIZE, NULL, 0, &val))) {
fprintf(stderr, "Client ns %s rank %d: PMIx_Get job size failed: %d\n", myproc.nspace,
myproc.rank, rc);
goto done;
}
nprocs = val->data.uint32;
PMIX_VALUE_RELEASE(val);
// require at least 4 procs
if (nprocs < 4) {
if (0 == myproc.rank) {
fprintf(stderr, "%s requires at least 4 processes\n", basename(argv[0]));
}
exit(1);
}
PMIX_INFO_LOAD(&info[1], PMIX_PERSISTENCE, &firstread, PMIX_PERSIST);
PMIX_INFO_LOAD(&lkinfo[0], PMIX_WAIT, NULL, PMIX_BOOL);
PMIX_INFO_LOAD(&lkinfo[1], PMIX_TIMEOUT, &timeout, PMIX_INT);
if (myproc.rank < 2) {
ninfo = 2;
for (n=0; n < iters; n++) {
if (0 == myproc.rank) {
if (n % 2) { // delay us a bit so other ranks get ahead
sleep(1);
}
/* publish something */
if (0 > asprintf(&tmp, "FOOBAR:%s.%u:%d", myproc.nspace, myproc.rank, n)) {
goto done;
}
PMIX_INFO_LOAD(&info[0], tmp, &n, PMIX_INT);
free(tmp);
if (PMIX_SUCCESS != (rc = PMIx_Publish(info, ninfo))) {
fprintf(stderr, "Client ns %s rank %d: PMIx_Publish failed: %d\n", myproc.nspace,
myproc.rank, rc);
goto done;
}
PMIX_INFO_DESTRUCT(&info[0]);
/* lookup other rank's value */
PMIX_PDATA_CONSTRUCT(&pdata);
if (0 > asprintf(&tmp, "BAZ:%s.%u:%d", myproc.nspace, 1, n)) {
goto done;
}
PMIX_LOAD_KEY(pdata.key, tmp);
free(tmp);
// lookup value
if (PMIX_SUCCESS != (rc = PMIx_Lookup(&pdata, 1, lkinfo, 2))) {
fprintf(stderr, "Client ns %s rank %d: PMIx_Lookup failed: %d\n", myproc.nspace,
myproc.rank, rc);
goto done;
}
/* check the return for value and source */
if (0 != strncmp(myproc.nspace, pdata.proc.nspace, PMIX_MAX_NSLEN)) {
fprintf(stderr, "Client ns %s rank %d: PMIx_Lookup returned wrong nspace: %s\n",
myproc.nspace, myproc.rank, pdata.proc.nspace);
goto done;
}
if (1 != pdata.proc.rank) {
fprintf(stderr, "Client ns %s rank %d: PMIx_Lookup returned wrong rank: %d\n",
myproc.nspace, myproc.rank, pdata.proc.rank);
goto done;
}
if (PMIX_INT != pdata.value.type) {
fprintf(stderr, "Client ns %s rank %d: PMIx_Lookup returned wrong type: %d\n",
myproc.nspace, myproc.rank, pdata.value.type);
goto done;
}
if (n != pdata.value.data.integer) {
fprintf(stderr, "Client ns %s rank %d: PMIx_Lookup returned wrong value: %d\n",
myproc.nspace, myproc.rank, (int) pdata.value.data.uint8);
goto done;
}
PMIX_PDATA_DESTRUCT(&pdata);
fprintf(stderr, "PUBLISH-LOOKUP SUCCEEDED: %d\n", n);
ninfo = 2;
} else if (1 == myproc.rank) {
if (0 == n) {
sleep(1);
}
/* lookup other rank's value */
PMIX_PDATA_CONSTRUCT(&pdata);
if (0 > asprintf(&tmp, "FOOBAR:%s.%u:%d", myproc.nspace, 0, n)) {
goto done;
}
PMIX_LOAD_KEY(pdata.key, tmp);
free(tmp);
// check value
if (PMIX_SUCCESS != (rc = PMIx_Lookup(&pdata, 1, lkinfo, 2))) {
fprintf(stderr, "Client ns %s rank %d: PMIx_Lookup failed: %d\n", myproc.nspace,
myproc.rank, rc);
goto done;
}
/* check the return for value and source */
if (0 != strncmp(myproc.nspace, pdata.proc.nspace, PMIX_MAX_NSLEN)) {
fprintf(stderr, "Client ns %s rank %d: PMIx_Lookup returned wrong nspace: %s\n",
myproc.nspace, myproc.rank, pdata.proc.nspace);
goto done;
}
if (0 != pdata.proc.rank) {
fprintf(stderr, "Client ns %s rank %d: PMIx_Lookup returned wrong rank: %d\n",
myproc.nspace, myproc.rank, pdata.proc.rank);
goto done;
}
if (PMIX_INT != pdata.value.type) {
fprintf(stderr, "Client ns %s rank %d: PMIx_Lookup returned wrong type: %d\n",
myproc.nspace, myproc.rank, pdata.value.type);
goto done;
}
if (n != pdata.value.data.integer) {
fprintf(stderr, "Client ns %s rank %d: PMIx_Lookup returned wrong value: %d\n",
myproc.nspace, myproc.rank, (int) pdata.value.data.uint8);
goto done;
}
PMIX_PDATA_DESTRUCT(&pdata);
/* publish something */
if (0 > asprintf(&tmp, "BAZ:%s.%u:%d", myproc.nspace, myproc.rank, n)) {
goto done;
}
PMIX_INFO_LOAD(&info[0], tmp, &n, PMIX_INT);
free(tmp);
if (PMIX_SUCCESS != (rc = PMIx_Publish(info, 2))) {
fprintf(stderr, "Client ns %s rank %d: PMIx_Publish failed: %d\n", myproc.nspace,
myproc.rank, rc);
goto done;
}
PMIX_INFO_DESTRUCT(&info[0]);
}
}
goto done;
}
// we cannot participate in the "firstread" cases as only
// one other proc can read the value
/* lookup other rank's value */
for (n=0; n < iters; n++) {
if (2 == myproc.rank) {
if (n % 2) { // delay us a bit so other ranks get ahead
sleep(1);
}
// publish something
if (0 > asprintf(&tmp, "BIGTEST:%s.%u:%d", myproc.nspace, myproc.rank, n)) {
goto done;
}
bcount = 1234 + n;
PMIX_INFO_LOAD(&info[0], tmp, &bcount, PMIX_SIZE);
free(tmp);
fprintf(stderr, "Client ns %s rank %d: Published: %lu\n", myproc.nspace,
myproc.rank, (unsigned long)bcount);
if (PMIX_SUCCESS != (rc = PMIx_Publish(info, 1))) {
fprintf(stderr, "Client ns %s rank %d: PMIx_Publish failed: %d\n", myproc.nspace,
myproc.rank, rc);
goto done;
}
PMIX_INFO_DESTRUCT(&info[0]);
} else {
// everyone else retrieves it
PMIX_PDATA_CONSTRUCT(&pdata);
if (0 > asprintf(&tmp, "BIGTEST:%s.%u:%d", myproc.nspace, 2, n)) {
goto done;
}
PMIX_LOAD_KEY(pdata.key, tmp);
free(tmp);
// check value
if (PMIX_SUCCESS != (rc = PMIx_Lookup(&pdata, 1, lkinfo, 2))) {
fprintf(stderr, "Client ns %s rank %d: PMIx_Lookup failed: %d\n", myproc.nspace,
myproc.rank, rc);
goto done;
}
/* check the return for value and source */
if (!PMIX_CHECK_NSPACE(myproc.nspace, pdata.proc.nspace)) {
fprintf(stderr, "Client ns %s rank %d: PMIx_Lookup returned wrong nspace: %s\n",
myproc.nspace, myproc.rank, pdata.proc.nspace);
goto done;
}
if (2 != pdata.proc.rank) {
fprintf(stderr, "Client ns %s rank %d: PMIx_Lookup returned wrong rank: %d\n",
myproc.nspace, myproc.rank, pdata.proc.rank);
goto done;
}
if (PMIX_SIZE != pdata.value.type) {
fprintf(stderr, "Client ns %s rank %d: PMIx_Lookup returned wrong type: %s\n",
myproc.nspace, myproc.rank, PMIx_Data_type_string(pdata.value.type));
goto done;
}
bcount = pdata.value.data.size;
if (bcount != (size_t)(1234 + n)) {
fprintf(stderr, "Client ns %s rank %d: PMIx_Lookup returned wrong value: %lu\n",
myproc.nspace, myproc.rank, (unsigned long)bcount);
goto done;
}
PMIX_PDATA_DESTRUCT(&pdata);
fprintf(stderr, "Client ns %s rank %d: PUBLISH-LOOKUP BIGTEST SUCCEEDED: %d\n",
myproc.nspace, myproc.rank, n);
}
}
PMIX_LOAD_PROCID(&proc, myproc.nspace, PMIX_RANK_WILDCARD);
rc = PMIx_Fence(&proc, 1, NULL, 0);
if (2 == myproc.rank) {
if (0 > asprintf(&keys[0], "BIGTEST:%s.%u:%d", myproc.nspace, myproc.rank, 0)) {
goto done;
}
if (0 > asprintf(&keys[1], "BIGTEST:%s.%u:%d", myproc.nspace, myproc.rank, 1)) {
goto done;
}
keys[2] = NULL;
if (PMIX_SUCCESS != (rc = PMIx_Unpublish(keys, NULL, 0))) {
fprintf(stderr, "Client ns %s rank %d: PMIx_Unpublish failed: %d\n", myproc.nspace,
myproc.rank, rc);
goto done;
}
// purge the rest
if (PMIX_SUCCESS != (rc = PMIx_Unpublish(NULL, NULL, 0))) {
fprintf(stderr, "Client ns %s rank %d: PMIx_Unpublish purge failed: %d\n", myproc.nspace,
myproc.rank, rc);
goto done;
}
// verify the purge
if (0 > asprintf(&tmp, "BIGTEST:%s.%u:%d", myproc.nspace, 2, 2)) {
goto done;
}
PMIX_LOAD_KEY(pdata.key, tmp);
free(tmp);
// check value
rc = PMIx_Lookup(&pdata, 1, NULL, 0);
// should not be found
if (PMIX_SUCCESS == rc) {
fprintf(stderr, "Client ns %s rank %d: Purge failed\n",
myproc.nspace, myproc.rank);
goto done;
} else {
fprintf(stderr, "Client ns %s rank %d: Purge succeeded: %s\n",
myproc.nspace, myproc.rank, PMIx_Error_string(rc));
}
// now publish something on different persistences
firstread = PMIX_PERSIST_PROC;
PMIX_INFO_LOAD(&info[1], PMIX_PERSISTENCE, &firstread, PMIX_PERSIST);
if (0 > asprintf(&tmp, "RANGETEST:%s.%u:0", myproc.nspace, myproc.rank)) {
goto done;
}
bcount = 1;
PMIX_INFO_LOAD(&info[0], tmp, &bcount, PMIX_SIZE);
free(tmp);
if (PMIX_SUCCESS != (rc = PMIx_Publish(info, 2))) {
fprintf(stderr, "Client ns %s rank %d: PMIx_Publish failed: %d\n", myproc.nspace,
myproc.rank, rc);
goto done;
}
PMIX_INFO_DESTRUCT(&info[0]);
firstread = PMIX_PERSIST_APP;
PMIX_INFO_LOAD(&info[1], PMIX_PERSISTENCE, &firstread, PMIX_PERSIST);
if (0 > asprintf(&tmp, "RANGETEST:%s.%u:1", myproc.nspace, myproc.rank)) {
goto done;
}
bcount = 2;
PMIX_INFO_LOAD(&info[0], tmp, &bcount, PMIX_SIZE);
free(tmp);
if (PMIX_SUCCESS != (rc = PMIx_Publish(info, 2))) {
fprintf(stderr, "Client ns %s rank %d: PMIx_Publish failed: %d\n", myproc.nspace,
myproc.rank, rc);
goto done;
}
PMIX_INFO_DESTRUCT(&info[0]);
firstread = PMIX_PERSIST_SESSION;
PMIX_INFO_LOAD(&info[1], PMIX_PERSISTENCE, &firstread, PMIX_PERSIST);
if (0 > asprintf(&tmp, "RANGETEST:%s.%u:2", myproc.nspace, myproc.rank)) {
goto done;
}
bcount = 3;
PMIX_INFO_LOAD(&info[0], tmp, &bcount, PMIX_SIZE);
free(tmp);
if (PMIX_SUCCESS != (rc = PMIx_Publish(info, 2))) {
fprintf(stderr, "Client ns %s rank %d: PMIx_Publish failed: %d\n", myproc.nspace,
myproc.rank, rc);
goto done;
}
PMIX_INFO_DESTRUCT(&info[0]);
// unpublish only those on the app persistence
if (0 > asprintf(&keys[0], "RANGETEST:%s.%u:1", myproc.nspace, myproc.rank)) {
goto done;
}
keys[1] = NULL;
firstread = PMIX_PERSIST_APP;
PMIX_INFO_LOAD(&info[0], PMIX_PERSISTENCE, &firstread, PMIX_PERSIST);
if (PMIX_SUCCESS != (rc = PMIx_Unpublish(keys, info, 1))) {
fprintf(stderr, "Client ns %s rank %d: PMIx_Unpublish of app persistence failed: %s\n", myproc.nspace,
myproc.rank, PMIx_Error_string(rc));
goto done;
} else {
fprintf(stderr, "Client ns %s rank %d: PMIx_Unpublish of app persistence succeeded\n", myproc.nspace,
myproc.rank);
}
// verify the app persistence keys are gone
PMIX_PDATA_CONSTRUCT(&pdata);
if (0 > asprintf(&tmp, "RANGETEST:%s.%u:1", myproc.nspace, myproc.rank)) {
goto done;
}
PMIX_LOAD_KEY(pdata.key, tmp);
free(tmp);
// check value
rc = PMIx_Lookup(&pdata, 1, NULL, 0);
if (PMIX_SUCCESS == rc) {
fprintf(stderr, "Client ns %s rank %d: PMIx_Lookup succeeded instead of failed\n", myproc.nspace,
myproc.rank);
goto done;
} else {
fprintf(stderr, "Client ns %s rank %d: PMIx_Lookup of app persistence value correctly failed: %s\n", myproc.nspace,
myproc.rank, PMIx_Error_string(rc));
}
PMIX_PDATA_DESTRUCT(&pdata);
// verify the session persistence key is still there
PMIX_PDATA_CONSTRUCT(&pdata);
if (0 > asprintf(&tmp, "RANGETEST:%s.%u:2", myproc.nspace, myproc.rank)) {
goto done;
}
PMIX_LOAD_KEY(pdata.key, tmp);
free(tmp);
// check value
rc = PMIx_Lookup(&pdata, 1, NULL, 0);
if (PMIX_SUCCESS != rc) {
fprintf(stderr, "Client ns %s rank %d: PMIx_Lookup failed: %s\n", myproc.nspace,
myproc.rank, PMIx_Error_string(rc));
goto done;
} else {
fprintf(stderr, "Client ns %s rank %d: PMIx_Lookup of session persistence value succeeded\n", myproc.nspace,
myproc.rank);
}
PMIX_PDATA_DESTRUCT(&pdata);
}
done:
/* finalize us */
if (PMIX_SUCCESS != (rc = PMIx_Finalize(NULL, 0))) {
fprintf(stderr, "Client ns %s rank %d:PMIx_Finalize failed: %d\n", myproc.nspace,
myproc.rank, rc);
} else {
fprintf(stderr, "Client ns %s rank %d:PMIx_Finalize successfully completed\n",
myproc.nspace, myproc.rank);
}
fflush(stderr);
return (0);
}
|
