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
|
/*
* Copyright (c) 2015-2020 Intel, Inc. All rights reserved.
* Copyright (c) 2015 Mellanox Technologies, Inc.
* All rights reserved.
* Copyright (c) 2021-2022 Nanook Consulting All rights reserved.
* $COPYRIGHT$
*
* Additional copyrights may follow
*
* $HEADER$
*
*/
#include "test_publish.h"
#include "src/include/pmix_globals.h"
#include <time.h>
typedef struct {
int in_progress;
size_t npdata;
pmix_pdata_t *pdata;
} lookup_cbdata;
static void release_cb(pmix_status_t status, void *cbdata)
{
int *ptr = (int *) cbdata;
PMIX_HIDE_UNUSED_PARAMS(status);
*ptr = 0;
}
static void lookup_cb(pmix_status_t status, pmix_pdata_t pdata[], size_t npdata, void *cbdata)
{
size_t i, j;
lookup_cbdata *cb = (lookup_cbdata *) cbdata;
pmix_pdata_t *tgt = cb->pdata;
PMIX_HIDE_UNUSED_PARAMS(status);
/* find the matching key in the provided info array - error if not found */
for (i = 0; i < npdata; i++) {
for (j = 0; j < cb->npdata; j++) {
if (0 == strcmp(pdata[i].key, tgt[j].key)) {
/* transfer the value to the pmix_pdata_t */
pmix_strncpy(tgt[j].proc.nspace, pdata[i].proc.nspace, PMIX_MAX_NSLEN);
tgt[j].proc.rank = pdata[i].proc.rank;
PMIx_Value_xfer(&tgt[j].value, &pdata[i].value);
break;
}
}
}
cb->in_progress = 0;
}
static int test_publish(char *my_nspace, int my_rank, int blocking)
{
int rc;
pmix_info_t info;
char data[512];
PMIX_INFO_CONSTRUCT(&info);
(void) snprintf(info.key, PMIX_MAX_KEYLEN, "%s:%d", my_nspace, my_rank);
(void) snprintf(data, 512, "data from proc %s:%d", my_nspace, my_rank);
info.value.type = PMIX_STRING;
info.value.data.string = strdup(data);
if (blocking) {
rc = PMIx_Publish(&info, 1);
} else {
int in_progress = 1;
rc = PMIx_Publish_nb(&info, 1, release_cb, &in_progress);
if (PMIX_SUCCESS == rc) {
PMIX_WAIT_FOR_COMPLETION(in_progress);
}
}
PMIX_INFO_DESTRUCT(&info);
return rc;
}
static int test_lookup(char *my_nspace, int my_rank, int blocking)
{
int rc;
pmix_pdata_t pdata;
char data[512];
char *keys[2];
PMIX_PDATA_CONSTRUCT(&pdata);
(void) snprintf(pdata.key, PMIX_MAX_KEYLEN, "%s:%d", my_nspace, my_rank);
(void) snprintf(data, 512, "data from proc %s:%d", my_nspace, my_rank);
if (blocking) {
if (PMIX_SUCCESS != (rc = PMIx_Lookup(&pdata, 1, NULL, 0))) {
PMIX_PDATA_DESTRUCT(&pdata);
return rc;
}
} else {
keys[0] = (char *) malloc(PMIX_MAX_KEYLEN * sizeof(char));
(void) snprintf(keys[0], PMIX_MAX_KEYLEN, "%s:%d", my_nspace, my_rank);
keys[1] = NULL;
lookup_cbdata cbdata;
cbdata.in_progress = 1;
cbdata.npdata = 1;
cbdata.pdata = &pdata;
/* copy the key across */
pmix_strncpy(pdata.key, keys[0], PMIX_MAX_KEYLEN);
rc = PMIx_Lookup_nb(keys, NULL, 0, lookup_cb, (void *) &cbdata);
if (PMIX_SUCCESS != rc) {
PMIX_PDATA_DESTRUCT(&pdata);
return rc;
}
PMIX_WAIT_FOR_COMPLETION(cbdata.in_progress);
}
if (PMIX_STRING != pdata.value.type || NULL == pdata.value.data.string) {
PMIX_PDATA_DESTRUCT(&pdata);
return PMIX_ERR_NOT_FOUND;
}
if (strncmp(data, pdata.value.data.string, strlen(data))) {
PMIX_PDATA_DESTRUCT(&pdata);
return PMIX_ERR_NOT_FOUND;
}
PMIX_PDATA_DESTRUCT(&pdata);
return rc;
}
static int test_unpublish(char *my_nspace, int my_rank, int blocking)
{
int rc;
char *keys[2];
keys[0] = (char *) malloc(PMIX_MAX_KEYLEN * sizeof(char));
(void) snprintf(keys[0], PMIX_MAX_KEYLEN, "%s:%d", my_nspace, my_rank);
keys[1] = NULL;
if (blocking) {
rc = PMIx_Unpublish(keys, NULL, 0);
} else {
int in_progress = 1;
rc = PMIx_Unpublish_nb(keys, NULL, 0, release_cb, &in_progress);
if (PMIX_SUCCESS == rc) {
PMIX_WAIT_FOR_COMPLETION(in_progress);
}
}
free(keys[0]);
return rc;
}
static int test_publish_lookup_common(char *my_nspace, int my_rank, int blocking)
{
int rc;
rc = test_publish(my_nspace, my_rank, blocking);
if (PMIX_SUCCESS != rc) {
TEST_ERROR(("%s:%d: %s failed.", my_nspace, my_rank,
blocking ? "PMIX_Publish" : "PMIX_Publish_nb"));
exit(rc);
}
TEST_VERBOSE(("%s:%d: %s succeeded.", my_nspace, my_rank,
blocking ? "PMIX_Publish" : "PMIX_Publish_nb"));
rc = test_lookup(my_nspace, my_rank, blocking);
if (PMIX_SUCCESS != rc) {
TEST_ERROR(
("%s:%d: %s failed.", my_nspace, my_rank, blocking ? "PMIX_Lookup" : "PMIX_Lookup_nb"));
exit(rc);
}
TEST_VERBOSE(("%s:%d: %s succeeded.\n", my_nspace, my_rank,
blocking ? "PMIX_Lookup" : "PMIX_Lookup_nb"));
rc = test_unpublish(my_nspace, my_rank, blocking);
if (PMIX_SUCCESS != rc) {
TEST_ERROR(("%s:%d: %s failed.", my_nspace, my_rank,
blocking ? "PMIX_Unpublish" : "PMIX_Unpublish_nb"));
exit(rc);
}
TEST_VERBOSE(("%s:%d: %s succeeded.", my_nspace, my_rank,
blocking ? "PMIX_Unpublish" : "PMIX_Unpublish_nb"));
rc = test_lookup(my_nspace, my_rank, blocking);
if (PMIX_ERR_NOT_FOUND != rc) {
TEST_ERROR(("%s:%d: %s function returned %d instead of PMIX_ERR_NOT_FOUND.", my_nspace,
my_rank, blocking ? "PMIX_Lookup" : "PMIX_Lookup_nb", rc));
exit(rc);
}
TEST_VERBOSE(
("%s:%d: %s succeeded.", my_nspace, my_rank,
blocking ? "PMIX_Lookup of non-existent key" : "PMIX_Lookup_nb of non-existent key"));
return PMIX_SUCCESS;
}
int test_publish_lookup(char *my_nspace, int my_rank)
{
int rc;
/* test blocking */
rc = test_publish_lookup_common(my_nspace, my_rank, 1);
if (PMIX_SUCCESS != rc) {
TEST_ERROR(("%s:%d: Publish/Lookup blocking test failed.", my_nspace, my_rank));
exit(rc);
}
/* test non-blocking */
rc = test_publish_lookup_common(my_nspace, my_rank, 0);
if (PMIX_SUCCESS != rc) {
TEST_ERROR(("%s:%d: Publish/Lookup non-blocking test failed.", my_nspace, my_rank));
exit(rc);
}
return PMIX_SUCCESS;
}
|
