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
|
/*
* Copyright 1998-1999, University of Notre Dame.
* Authors: Brian W. Barrett, Arun F. Rodrigues, Jeffrey M. Squyres,
* and Andrew Lumsdaine
*
* This file is part of XMPI
*
* You should have received a copy of the License Agreement for XMPI
* along with the software; see the file LICENSE. If not, contact
* Office of Research, University of Notre Dame, Notre Dame, IN 46556.
*
* Permission to modify the code and to distribute modified code is
* granted, provided the text of this NOTICE is retained, a notice that
* the code was modified is included with the above COPYRIGHT NOTICE and
* with the COPYRIGHT NOTICE in the LICENSE file, and that the LICENSE
* file is distributed with the modified code.
*
* LICENSOR MAKES NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR IMPLIED.
* By way of example, but not limitation, Licensor MAKES NO
* REPRESENTATIONS OR WARRANTIES OF MERCHANTABILITY OR FITNESS FOR ANY
* PARTICULAR PURPOSE OR THAT THE USE OF THE LICENSED SOFTWARE COMPONENTS
* OR DOCUMENTATION WILL NOT INFRINGE ANY PATENTS, COPYRIGHTS, TRADEMARKS
* OR OTHER RIGHTS.
*
* Additional copyrights may follow.
*
* $Id: ndi_resolve.c,v 1.3 1999/11/08 06:20:37 bbarrett Exp $
*
* Function: - node identifier resolution
*/
#include <stdlib.h>
#include <all_list.h>
#include <ndi.h>
#include <net.h>
#include <portable.h>
#include <typical.h>
/*
* local functions
*/
static int ndi_cast();
/*
* ndi_resolve
*
* Function: - node identifier resolution
* - expands "special" node identifiers into
* multiple specific node identifiers
* Accepts: - node ID list
* Returns: - resolved node ID list or null
*/
LIST *
ndi_resolve(nodelist)
LIST * nodelist;
{
struct ndi newnode; /* new list element */
struct ndi * p; /* current list element */
LIST * newnodelist; /* resolved node ID list */
int4 index; /* index counter */
/*
* Initialize the new list.
*/
newnodelist = al_init(sizeof(struct ndi), 0);
if (newnodelist == 0) return(0);
/*
* Resolve each entry in the given list.
*/
index = 0;
p = (struct ndi *) al_top(nodelist);
while (p) {
if (p->ndi_node == HOST2OTB) {
if (ndi_cast(newnodelist, 0, NT_ITB | NT_CAST,
&index)) {
al_free(newnodelist);
return(0);
}
} else if (p->ndi_node == HOST2ALL) {
if (ndi_cast(newnodelist, 0, NT_CAST, &index)) {
al_free(newnodelist);
return(0);
}
} else if (p->ndi_node == HOST2COMP) {
if (ndi_cast(newnodelist, 0, NT_WASTE | NT_CAST,
&index)) {
al_free(newnodelist);
return(0);
}
} else {
newnode.ndi_node = p->ndi_node;
newnode.ndi_flags = p->ndi_flags;
newnode.ndi_count = p->ndi_count;
newnode.ndi_index = index++;
if (al_append(newnodelist, &newnode) == 0) {
al_free(newnodelist);
return(0);
}
}
p = (struct ndi *) al_next(nodelist, p);
}
return(newnodelist);
}
/*
* ndi_cast
*
* Function: - expands a cast of nodes
* Accepts: - node type
* - node mask
* - current index ptr
* Returns: - 0 or ERROR
*/
static int
ndi_cast(nodelist, type, mask, ixp)
LIST * nodelist;
int4 type;
int4 mask;
int *ixp;
{
int4 nnodes; /* node array size */
int4 *pnodes; /* node array */
int i;
struct ndi newnode; /* new list element */
nnodes = getntype(type, mask);
if (nnodes < 0) return(LAMERROR);
if (nnodes == 0) return(0);
pnodes = (int4 *) malloc((unsigned) (nnodes * sizeof(int4)));
if (pnodes == 0) return(LAMERROR);
if (getnodes(pnodes, nnodes, type, mask)) {
free((char *) pnodes);
return(LAMERROR);
}
for (i = 0; i < nnodes; ++i) {
newnode.ndi_node = pnodes[i];
newnode.ndi_flags = 0;
newnode.ndi_count = 1;
newnode.ndi_index = (*ixp)++;
if (al_append(nodelist, &newnode) == 0) {
free((char *) pnodes);
return(LAMERROR);
}
}
free((char *) pnodes);
return(0);
}
|
