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
|
/*
* 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 (c) 2022 Triad National Security, LLC.
* All rights reserved.
*
* $COPYRIGHT$
*
* Additional copyrights may follow
*
* $HEADER$
*
*/
/*
* This test simulates the way Open MPI uses the PMIx_Group_construct to
* implement MPI4 functions:
* - MPI_Comm_create_from_group
* - MPI_Intercomm_create_from_groups
*/
#define _GNU_SOURCE
#include <pthread.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <unistd.h>
#include <pmix.h>
#include "examples.h"
static pmix_proc_t myproc;
static uint32_t get_timeout = 600; /* default 600 secs to get remote data */
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, ret;
pmix_value_t *val = NULL;
pmix_proc_t proc, *procs;
uint32_t nprocs, n;
mylock_t lock;
pmix_info_t *results, *info, tinfo[2];
size_t nresults, cid, lcid, ninfo, m;
pmix_data_array_t darray;
void *grpinfo, *list;
char hostname[1024];
pmix_value_t value;
bool idassigned = false;
EXAMPLES_HIDE_UNUSED_PARAMS(argc, argv);
gethostname(hostname, 1024);
/* 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(1);
}
fprintf(stderr, "Client ns %s rank %d host %s pid %lu: Running\n",
myproc.nspace, myproc.rank, hostname, (unsigned long)getpid());
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");
}
exit(1);
}
/* 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;
}
// put some "modex" data
if (0 > asprintf(&value.data.string, "btl-tcp-%u", myproc.rank)) {
goto done;
}
value.type = PMIX_STRING;
rc = PMIx_Put(PMIX_GLOBAL, "modex-btl", &value);
free(value.data.string);
if (PMIX_SUCCESS != rc) {
goto done;
}
if (0 > asprintf(&value.data.string, "btl-smcuda-%u", myproc.rank)) {
goto done;
}
rc = PMIx_Put(PMIX_GLOBAL, "modex-btl", &value);
free(value.data.string);
if (PMIX_SUCCESS != rc) {
goto done;
}
// commit it
rc = PMIx_Commit();
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;
}
PMIX_PROC_CREATE(procs, nprocs);
for (n = 0; n < nprocs; n++) {
PMIX_PROC_LOAD(&procs[n], myproc.nspace, n);
}
grpinfo = PMIx_Info_list_start();
rc = PMIx_Info_list_add(grpinfo, PMIX_GROUP_ASSIGN_CONTEXT_ID, NULL, PMIX_BOOL);
if (PMIX_SUCCESS != rc) {
fprintf(stderr, "Client ns %s rank %d: PMIx_Info_list_add failed: %s\n",
myproc.nspace, myproc.rank, PMIx_Error_string(rc));
goto done;
}
list = PMIx_Info_list_start();
lcid = 1234UL + (unsigned long) myproc.rank;
rc = PMIx_Info_list_add(list, PMIX_GROUP_LOCAL_CID, &lcid, PMIX_SIZE);
if (PMIX_SUCCESS != rc) {
fprintf(stderr, "Client ns %s rank %d: PMIx_Info_list_add failed: %s\n",
myproc.nspace, myproc.rank, PMIx_Error_string(rc));
goto done;
}
rc = PMIx_Info_list_convert(list, &darray);
if (PMIX_SUCCESS != rc) {
fprintf(stderr, "Client ns %s rank %d: PMIx_Info_list_convert failed: %s\n",
myproc.nspace, myproc.rank, PMIx_Error_string(rc));
goto done;
}
rc = PMIx_Info_list_add(grpinfo, PMIX_GROUP_INFO, &darray, PMIX_DATA_ARRAY);
if (PMIX_SUCCESS != rc) {
fprintf(stderr, "Client ns %s rank %d: PMIx_Info_list_add failed: %s\n",
myproc.nspace, myproc.rank, PMIx_Error_string(rc));
goto done;
}
PMIx_Info_list_release(list);
PMIX_DATA_ARRAY_DESTRUCT(&darray);
rc = PMIx_Info_list_convert(grpinfo, &darray);
if (PMIX_SUCCESS != rc) {
fprintf(stderr, "Client ns %s rank %d: PMIx_Info_list_convert failed: %s\n",
myproc.nspace, myproc.rank, PMIx_Error_string(rc));
goto done;
}
info = (pmix_info_t*)darray.array;
ninfo = darray.size;
PMIx_Info_list_release(grpinfo);
rc = PMIx_Group_construct("ourgroup", procs, nprocs, info, ninfo, &results, &nresults);
PMIX_DATA_ARRAY_DESTRUCT(&darray);
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;
}
/* check the results for our global CID*/
if (NULL != results) {
cid = 0;
for (m=0; m < nresults; m++) {
if (PMIX_CHECK_KEY(&results[m], PMIX_GROUP_CONTEXT_ID)) {
PMIX_VALUE_GET_NUMBER(rc, &results[m].value, cid, size_t);
idassigned = true;
break;
}
}
fprintf(stderr, "Rank %d Group construct complete with status %s KEY %s CID assigned: %s value: %lu\n",
myproc.rank, PMIx_Error_string(rc), results[0].key, idassigned ? "T" : "F", (unsigned long) cid);
} else {
fprintf(stderr, "Rank %d Group construct complete, but no CID returned\n", myproc.rank);
}
PMIX_PROC_FREE(procs, nprocs);
/*
* destruct the group
*/
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;
}
PMIX_INFO_CONSTRUCT(&tinfo[0]);
PMIX_INFO_LOAD(&tinfo[0], PMIX_GROUP_CONTEXT_ID, &cid, PMIX_SIZE);
PMIX_INFO_SET_QUALIFIER(&tinfo[0]);
PMIX_INFO_CONSTRUCT(&tinfo[1]);
PMIX_INFO_LOAD(&tinfo[1], PMIX_TIMEOUT, &get_timeout, PMIX_UINT32);
for (n = 0; n < nprocs; n++) {
proc.rank = n;
if (PMIX_SUCCESS != (rc = PMIx_Get(&proc, PMIX_GROUP_LOCAL_CID, tinfo, 2, &val))) {
fprintf(stderr, "Client ns %s rank %d: PMIx_Get of LOCAL CID for rank %d failed: %s\n",
myproc.nspace, myproc.rank, n, PMIx_Error_string(rc));
continue;
}
if (PMIX_SIZE != val->type) {
fprintf(stderr, "%s:%d: PMIx_Get LOCAL CID for rank %d returned wrong type: %s\n", myproc.nspace,
myproc.rank, n, PMIx_Data_type_string(val->type));
PMIX_VALUE_RELEASE(val);
continue;
}
if ((1234UL + (unsigned long)n) != val->data.size) {
fprintf(stderr, "%s:%d: PMIx_Get LOCAL CID for rank %d returned wrong value: %s\n",
myproc.nspace, myproc.rank, n, PMIx_Value_string(val));
PMIX_VALUE_RELEASE(val);
continue;
}
fprintf(stderr, "%s:%d: PMIx_Get LOCAL CID for rank %u SUCCESS value: %s\n",
myproc.nspace, myproc.rank, n, PMIx_Value_string(val));
PMIX_VALUE_RELEASE(val);
}
done:
/* finalize us */
DEBUG_CONSTRUCT_LOCK(&lock);
PMIx_Deregister_event_handler(1, op_callbk, &lock);
DEBUG_WAIT_THREAD(&lock);
DEBUG_DESTRUCT_LOCK(&lock);
if (PMIX_SUCCESS != (ret = PMIx_Finalize(NULL, 0))) {
fprintf(stderr, "Client ns %s rank %d:PMIx_Finalize failed: %s\n", myproc.nspace,
myproc.rank, PMIx_Error_string(ret));
rc = ret;
}
fprintf(stderr, "%s:%d COMPLETE\n", myproc.nspace, myproc.rank);
fflush(stderr);
return (rc);
}
|