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
|
/*
* Copyright (c) 2020 Triad National Security, LLC.
* All rights reserved.
*
* Copyright (c) 2021 Nanook Consulting. All rights reserved.
* $COPYRIGHT$
*
* Additional copyrights may follow
*
* $HEADER$
*/
/* Test of rank position identification inside group */
#include "pmix.h"
#include "test_common.h"
#include <stdio.h>
#include <stdlib.h>
/*
#include <assert.h>
#include <stdarg.h>
#include <sys/time.h>
#include <unistd.h>
*/
pmix_proc_t this_proc;
int main(int argc, char *argv[])
{
pmix_value_t *val;
size_t ninfo = 0;
test_params l_params;
validation_params v_params;
pmix_proc_t job_proc, peer_proc;
uint32_t i;
pmixt_pre_init(argc, argv, &l_params, &v_params, NULL);
/* initialization */
PMIXT_CHECK(PMIx_Init(&this_proc, NULL, ninfo), l_params, v_params);
/* Handles everything that needs to happen after PMIx_Init() */
pmixt_post_init(&this_proc, &l_params, &v_params);
job_proc = this_proc;
job_proc.rank = PMIX_RANK_WILDCARD;
PMIXT_CHECK(PMIx_Get(&job_proc, PMIX_JOB_SIZE, NULL, 0, &val), l_params, v_params);
pmixt_validate_predefined(&job_proc, PMIX_JOB_SIZE, val, PMIX_UINT32, &v_params);
free(val);
TEST_VERBOSE(("after PMIX_JOB_SIZE check"));
PMIXT_CHECK(PMIx_Get(&job_proc, PMIX_LOCAL_PEERS, NULL, 0, &val), l_params, v_params);
pmixt_validate_predefined(&job_proc, PMIX_LOCAL_PEERS, val, PMIX_STRING, &v_params);
free(val);
TEST_VERBOSE(("after PMIX_LOCAL_PEERS check"));
// validation data must be populated for all peers, remote and local, by this point
peer_proc = this_proc;
for (i = 0; i < v_params.pmix_job_size; i++) {
peer_proc.rank = i;
PMIXT_CHECK(PMIx_Get(&peer_proc, PMIX_LOCAL_RANK, NULL, 0, &val), l_params, v_params);
pmixt_validate_predefined(&peer_proc, PMIX_LOCAL_RANK, val, PMIX_UINT16, &v_params);
free(val);
TEST_VERBOSE(("after PMIX_LOCAL_RANK check for rank = %d", peer_proc.rank));
PMIXT_CHECK(PMIx_Get(&peer_proc, PMIX_NODEID, NULL, 0, &val), l_params, v_params);
pmixt_validate_predefined(&peer_proc, PMIX_NODEID, val, PMIX_UINT32, &v_params);
free(val);
TEST_VERBOSE(("after PMIX_NODEID check for rank = %d", peer_proc.rank));
PMIXT_CHECK(PMIx_Get(&peer_proc, PMIX_NODE_RANK, NULL, 0, &val), l_params, v_params);
pmixt_validate_predefined(&peer_proc, PMIX_NODE_RANK, val, PMIX_UINT16, &v_params);
free(val);
TEST_VERBOSE(("after PMIX_NODE_RANK check for rank = %d", peer_proc.rank));
PMIXT_CHECK(PMIx_Get(&peer_proc, PMIX_HOSTNAME, NULL, 0, &val), l_params, v_params);
pmixt_validate_predefined(&peer_proc, PMIX_HOSTNAME, val, PMIX_STRING, &v_params);
free(val);
TEST_VERBOSE(("after PMIX_HOSTNAME check for rank = %d", peer_proc.rank));
}
/* finalize */
PMIXT_CHECK(PMIx_Finalize(NULL, 0), l_params, v_params);
/* Handles cleanup */
pmixt_post_finalize(&this_proc, &l_params, &v_params);
}
|
