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
|
/*
* 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-2023 Nanook Consulting All rights reserved.
* $COPYRIGHT$
*
* Additional copyrights may follow
*
* $HEADER$
*
*/
#include <pthread.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <unistd.h>
#include <libgen.h>
#include <pmix.h>
#include "examples.h"
static pmix_proc_t myproc;
static void notification_fn(size_t evhdlr_registration_id, pmix_status_t status,
const pmix_proc_t *source, pmix_info_t info[], size_t ninfo,
pmix_info_t results[], size_t nresults,
pmix_event_notification_cbfunc_fn_t cbfunc, void *cbdata)
{
EXAMPLES_HIDE_UNUSED_PARAMS(evhdlr_registration_id, source,
info, ninfo, results, nresults,
cbfunc, cbdata);
fprintf(stderr, "Client %s:%d NOTIFIED with status %d\n", myproc.nspace, myproc.rank, status);
}
static void op_callbk(pmix_status_t status, void *cbdata)
{
mylock_t *lock = (mylock_t *) cbdata;
lock->status = status;
DEBUG_WAKEUP_THREAD(lock);
}
static void errhandler_reg_callbk(pmix_status_t status, size_t errhandler_ref, void *cbdata)
{
mylock_t *lock = (mylock_t *) cbdata;
EXAMPLES_HIDE_UNUSED_PARAMS(errhandler_ref);
lock->status = status;
DEBUG_WAKEUP_THREAD(lock);
}
int main(int argc, char **argv)
{
int rc;
pmix_value_t *val = NULL;
pmix_proc_t proc, *procs, *parray;
uint32_t nprocs;
mylock_t lock;
pmix_info_t *results, info[2];
size_t nresults, cid, n, m, psize;
pmix_data_array_t dry;
char *tmp;
pmix_query_t query;
int i;
bool addmembers = false;
bool testquery = false;
EXAMPLES_HIDE_UNUSED_PARAMS(argc, argv);
for (i=1; i < argc; i++) {
if (0 == strcmp(argv[i], "--add-members")) {
addmembers = true;
} else if (0 == strcmp(argv[i], "--test-query")) {
testquery = true;
} else {
fprintf(stderr, "Usage: %s [--add-members] [--test-query]\n", basename(argv[0]));
exit(1);
}
}
/* init us */
if (PMIX_SUCCESS != (rc = PMIx_Init(&myproc, NULL, 0))) {
fprintf(stderr, "Client ns %s rank %d: PMIx_Init failed: %s\n", myproc.nspace, myproc.rank,
PMIx_Error_string(rc));
exit(0);
}
fprintf(stderr, "Client ns %s rank %d: Running\n", myproc.nspace, myproc.rank);
PMIX_PROC_CONSTRUCT(&proc);
PMIX_LOAD_PROCID(&proc, myproc.nspace, PMIX_RANK_WILDCARD);
/* get our job size */
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: %s\n", myproc.nspace,
myproc.rank, PMIx_Error_string(rc));
goto done;
}
nprocs = val->data.uint32;
PMIX_VALUE_RELEASE(val);
if (nprocs < 4) {
if (0 == myproc.rank) {
fprintf(stderr, "This example requires a minimum of 4 processes\n");
}
goto done;
}
fprintf(stderr, "Client %s:%d universe size %d\n", myproc.nspace, myproc.rank, nprocs);
/* register our default errhandler */
DEBUG_CONSTRUCT_LOCK(&lock);
PMIx_Register_event_handler(NULL, 0, NULL, 0, notification_fn, errhandler_reg_callbk,
(void *) &lock);
DEBUG_WAIT_THREAD(&lock);
rc = lock.status;
DEBUG_DESTRUCT_LOCK(&lock);
if (PMIX_SUCCESS != rc) {
goto done;
}
/* call fence to sync */
PMIX_PROC_CONSTRUCT(&proc);
PMIX_LOAD_PROCID(&proc, myproc.nspace, PMIX_RANK_WILDCARD);
if (PMIX_SUCCESS != (rc = PMIx_Fence(&proc, 1, NULL, 0))) {
fprintf(stderr, "Client ns %s rank %d: PMIx_Fence failed: %d\n", myproc.nspace, myproc.rank,
rc);
goto done;
}
/* rank=0,2,3 construct a new group */
if (0 == myproc.rank || 2 == myproc.rank || 3 == myproc.rank) {
fprintf(stderr, "%d executing Group_construct\n", myproc.rank);
nprocs = 3;
PMIX_PROC_CREATE(procs, nprocs);
PMIX_PROC_LOAD(&procs[0], myproc.nspace, 0);
PMIX_PROC_LOAD(&procs[1], myproc.nspace, 2);
PMIX_PROC_LOAD(&procs[2], myproc.nspace, 3);
PMIX_INFO_LOAD(&info[0], PMIX_GROUP_ASSIGN_CONTEXT_ID, NULL, PMIX_BOOL);
if (addmembers && 3 == myproc.rank) {
PMIX_DATA_ARRAY_CONSTRUCT(&dry, 2, PMIX_PROC);
parray = (pmix_proc_t*)dry.array;
PMIX_LOAD_PROCID(&parray[0], myproc.nspace, 7);
PMIX_LOAD_PROCID(&parray[1], myproc.nspace, 10);
PMIX_INFO_LOAD(&info[1], PMIX_GROUP_ADD_MEMBERS, &dry, PMIX_DATA_ARRAY);
PMIX_DATA_ARRAY_DESTRUCT(&dry);
rc = PMIx_Group_construct("ourgroup", procs, nprocs, info, 2, &results, &nresults);
} else {
rc = PMIx_Group_construct("ourgroup", procs, nprocs, info, 1, &results, &nresults);
}
if (PMIX_SUCCESS != rc) {
fprintf(stderr, "Client ns %s rank %d: PMIx_Group_construct failed: %s\n",
myproc.nspace, myproc.rank, PMIx_Error_string(rc));
goto done;
}
/* we should have a single results object */
if (NULL != results) {
cid = 0;
for (n=0; n < nresults; n++) {
if (PMIX_CHECK_KEY(&results[n], PMIX_GROUP_CONTEXT_ID)) {
PMIX_VALUE_GET_NUMBER(rc, &results[n].value, cid, size_t);
fprintf(stderr, "%d Group construct complete with status %s KEY %s CID %lu\n",
myproc.rank, PMIx_Error_string(rc), results[n].key, (unsigned long) cid);
} else if (PMIX_CHECK_KEY(&results[n], PMIX_GROUP_MEMBERSHIP)) {
parray = (pmix_proc_t*)results[n].value.data.darray->array;
psize = results[n].value.data.darray->size;
if (0 == myproc.rank) {
fprintf(stderr, "NUM MEMBERS: %u MEMBERSHIP:\n", (unsigned)psize);
for (m=0; m < psize; m++) {
fprintf(stderr, "\t%s:%u\n", parray[m].nspace, parray[m].rank);
}
}
}
}
PMIX_INFO_FREE(results, nresults);
} else {
fprintf(stderr, "%d Group construct complete, but results returned\n", myproc.rank);
}
PMIX_PROC_FREE(procs, nprocs);
if (!addmembers) {
fprintf(stderr, "%d executing Group_destruct\n", myproc.rank);
rc = PMIx_Group_destruct("ourgroup", NULL, 0);
if (PMIX_SUCCESS != rc) {
fprintf(stderr, "Client ns %s rank %d: PMIx_Group_destruct failed: %s\n", myproc.nspace,
myproc.rank, PMIx_Error_string(rc));
goto done;
}
}
}
if (testquery && 0 == myproc.rank) {
/* first ask for a list of active namespaces */
PMIX_QUERY_CONSTRUCT(&query);
PMIX_ARGV_APPEND(rc, query.keys, PMIX_QUERY_NAMESPACES);
rc = PMIx_Query_info(&query, 1, &results, &nresults);
if (PMIX_SUCCESS != rc ) {
fprintf(stderr, "Error: PMIx_Query_info for namespaces failed: %d (%s)\n", rc, PMIx_Error_string(rc));
goto done;
}
fprintf(stderr, "\n\n--> Query returned (ninfo %d)\n", (int)nresults);
for (n = 0; n < nresults; ++n) {
tmp = PMIx_Info_string(&results[n]);
fprintf(stderr, "%s\n", tmp);
free(tmp);
}
fprintf(stderr, "<--- END\n\n\n");
PMIX_QUERY_DESTRUCT(&query);
PMIX_INFO_FREE(results, nresults);
/* we can then parse the results to find a namespace of interest, and
* query about that namespace in particular. Or we can simply query
* for info on ALL namespaces */
PMIX_QUERY_CONSTRUCT(&query);
PMIX_ARGV_APPEND(rc, query.keys, PMIX_QUERY_NAMESPACE_INFO);
rc = PMIx_Query_info(&query, 1, &results, &nresults);
if (PMIX_SUCCESS != rc ) {
fprintf(stderr, "Error: PMIx_Query_info for namespace info failed: %d (%s)\n", rc, PMIx_Error_string(rc));
goto done;
}
fprintf(stderr, "--> Query returned (ninfo %d)\n", (int)nresults);
for (n = 0; n < nresults; ++n) {
tmp = PMIx_Info_string(&results[n]);
fprintf(stderr, "%s\n", tmp);
free(tmp);
}
fprintf(stderr, "<--- END\n\n\n");
PMIX_QUERY_DESTRUCT(&query);
PMIX_INFO_FREE(results, nresults);
}
done:
/* finalize us */
DEBUG_CONSTRUCT_LOCK(&lock);
PMIx_Deregister_event_handler(1, op_callbk, &lock);
DEBUG_WAIT_THREAD(&lock);
DEBUG_DESTRUCT_LOCK(&lock);
fprintf(stderr, "Client ns %s rank %d: Finalizing\n", myproc.nspace, myproc.rank);
if (PMIX_SUCCESS != (rc = PMIx_Finalize(NULL, 0))) {
fprintf(stderr, "Client ns %s rank %d:PMIx_Finalize failed: %s\n", myproc.nspace,
myproc.rank, PMIx_Error_string(rc));
} else {
fprintf(stderr, "Client ns %s rank %d:PMIx_Finalize successfully completed\n",
myproc.nspace, myproc.rank);
}
fprintf(stderr, "%s:%d COMPLETE\n", myproc.nspace, myproc.rank);
fflush(stderr);
return (0);
}
|
