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
|
/* Copyright 2004,2007,2008,2010-2012,2014,2018,2019 IPB, Universite de Bordeaux, INRIA & CNRS
**
** This file is part of the Scotch software package for static mapping,
** graph partitioning and sparse matrix ordering.
**
** This software is governed by the CeCILL-C license under French law
** and abiding by the rules of distribution of free software. You can
** use, modify and/or redistribute the software under the terms of the
** CeCILL-C license as circulated by CEA, CNRS and INRIA at the following
** URL: "http://www.cecill.info".
**
** As a counterpart to the access to the source code and rights to copy,
** modify and redistribute granted by the license, users are provided
** only with a limited warranty and the software's author, the holder of
** the economic rights, and the successive licensors have only limited
** liability.
**
** In this respect, the user's attention is drawn to the risks associated
** with loading, using, modifying and/or developing or reproducing the
** software by the user in light of its specific status of free software,
** that may mean that it is complicated to manipulate, and that also
** therefore means that it is reserved for developers and experienced
** professionals having in-depth computer knowledge. Users are therefore
** encouraged to load and test the software's suitability as regards
** their requirements in conditions enabling the security of their
** systems and/or data to be ensured and, more generally, to use and
** operate it in the same conditions as regards security.
**
** The fact that you are presently reading this means that you have had
** knowledge of the CeCILL-C license and that you accept its terms.
*/
/************************************************************/
/** **/
/** NAME : amk_ccc.c **/
/** **/
/** AUTHOR : Francois PELLEGRINI **/
/** **/
/** FUNCTION : Creates the distance map for CCC **/
/** graphs, to be used to build the archi- **/
/** tecture description files for these **/
/** graphs. **/
/** **/
/** DATES : # Version 1.3 : from : 24 apr 1994 **/
/** to : 24 apr 1994 **/
/** # Version 2.0 : from : 13 jul 1994 **/
/** to : 12 nov 1994 **/
/** # Version 3.0 : from : 18 sep 1995 **/
/** to : 19 sep 1995 **/
/** # Version 3.2 : from : 07 may 1997 **/
/** to : 07 may 1997 **/
/** # Version 3.3 : from : 02 oct 1998 **/
/** to : 02 oct 1998 **/
/** # Version 3.4 : from : 03 feb 2000 **/
/** to : 03 feb 2000 **/
/** # Version 5.0 : from : 23 dec 2007 **/
/** to : 16 mar 2008 **/
/** # Version 5.1 : from : 01 jul 2010 **/
/** to : 14 feb 2011 **/
/** # Version 6.0 : from : 01 jan 2012 **/
/** to : 24 sep 2019 **/
/** **/
/************************************************************/
/*
** The defines and includes.
*/
#define AMK_CCC
#include "module.h"
#include "common.h"
#include "scotch.h"
#include "amk_ccc.h"
/*
** The static and global definitions.
*/
static int C_paraNum = 0; /* Number of parameters */
static int C_fileNum = 0; /* Number of file in arg list */
static File C_fileTab[C_FILENBR] = { /* The file array */
{ FILEMODEW } };
static C_VertDist * C_distaTab; /* Pointer to distance map table */
static C_Queue C_distaQueue; /* Distance queue */
static const char * C_usageList[] = { /* Usage list */
"amk_ccc <dim> [<output target file>] <options>",
" -h : Display this help",
" -V : Print program version and copyright",
NULL };
/*************************************************/
/* */
/* The main routine, which computes the distance */
/* triangular table. */
/* */
/*************************************************/
int
main (
int argc,
char * argv[])
{
SCOTCH_Num ccdim; /* Dimension of the graph */
SCOTCH_Num ccnbr; /* Number of vertices */
SCOTCH_Num ccbit; /* Mask variable */
SCOTCH_Num ccmax; /* Maximum terminal */
C_Vertex v, w, x; /* Vertex variables */
SCOTCH_Num d; /* Vertex distance to root */
SCOTCH_Num t; /* Vertex terminal value */
SCOTCH_Num i, j, k;
errorProg ("amk_ccc");
ccdim = 2;
if ((argc >= 2) && (argv[1][0] == '?')) { /* If need for help */
usagePrint (stdout, C_usageList);
return (EXIT_SUCCESS);
}
fileBlockInit (C_fileTab, C_FILENBR); /* Set default stream pointers */
for (i = 1; i < argc; i ++) { /* Loop for all option codes */
if ((argv[i][0] != '-') || (argv[i][1] == '\0') || (argv[i][1] == '.')) { /* If found a file name */
if (C_paraNum < 1) { /* If number of parameters not reached */
if ((ccdim = atoi (argv[i])) < 1) /* Get the dimension */
errorPrint ("main: invalid dimension '%s'", argv[i]);
C_paraNum ++;
continue; /* Process the other parameters */
}
if (C_fileNum < C_FILENBR) /* A file name has been given */
fileBlockName (C_fileTab, C_fileNum ++) = argv[i];
else
errorPrint ("main: too many file names given");
}
else { /* If found an option name */
switch (argv[i][1]) {
case 'H' : /* Give the usage message */
case 'h' :
usagePrint (stdout, C_usageList);
return (EXIT_SUCCESS);
case 'V' :
fprintf (stderr, "amk_ccc, version " SCOTCH_VERSION_STRING "\n");
fprintf (stderr, SCOTCH_COPYRIGHT_STRING "\n");
fprintf (stderr, SCOTCH_LICENSE_STRING "\n");
return (EXIT_SUCCESS);
default :
errorPrint ("main: unprocessed option '%s'", argv[i]);
}
}
}
fileBlockOpen (C_fileTab, C_FILENBR); /* Open all files */
ccnbr = ccdim * (1 << ccdim); /* Compute number of vertices */
ccbit = (1 << ccdim) - 1; /* Get maximum position number */
for (ccmax = ((1 << (ccdim + 1)) - 1), i = ccdim - 1; /* Compute biggest terminal value */
i != 0;
i >>= 1)
ccmax = (ccmax << 1) | (i & 1);
fprintf (C_filepntrarcout, "deco\n0\n" SCOTCH_NUMSTRING "\t" SCOTCH_NUMSTRING "\n", /* Print the file header */
(SCOTCH_Num) ccnbr, /* Print number of terminal domains */
(SCOTCH_Num) ccmax); /* Print biggest terminal value */
for (v.lvl = 0; v.lvl < ccdim; v.lvl ++) { /* For all levels */
for (v.pos = 0; v.pos <= ccbit; v.pos ++) { /* For all positions in these levels */
t = (1 << ccdim) | v.pos; /* Perform the hypercube cuts */
for (i = v.lvl, j = ccdim; j != 1; ) { /* Perform the cycle cuts */
t <<= 1;
k = (j + 1) >> 1;
if (i >= k) { /* If upper (smallest) half */
t |= 1;
i -= k;
j -= k;
}
else /* If lower (biggest) half */
j = k;
}
fprintf (C_filepntrarcout, SCOTCH_NUMSTRING "\t1\t" SCOTCH_NUMSTRING "\n",
(SCOTCH_Num) C_vertLabl (&v), /* Print terminal label */
(SCOTCH_Num) t); /* Print terminal number */
}
}
if ((C_queueInit (&C_distaQueue, ccmax) != 0) || /* Allocate the distance array */
((C_distaTab = (C_VertDist *) memAlloc (ccmax * sizeof (C_VertDist))) == NULL))
errorPrint ("main: out of memory");
for (v.lvl = 0; v.lvl < ccdim; v.lvl ++) { /* For all levels */
for (v.pos = 0; v.pos <= ccbit; v.pos ++) { /* For all positions in these levels */
for (i = 0; i < ccnbr; i ++) /* Initialize vertex table */
C_distaTab[i].queued = 0; /* Vertex not queued yet */
C_distaRoot (&v); /* Set the queue with root v */
while (C_distaGet (&w, &d)) { /* As long as the queue is not empty */
C_distaTab[C_vertLabl (&w)].dist = d; /* Keep the distance information */
d ++; /* Search for neighbors at next level */
x.lvl = w.lvl; /* Add neighbors to queue */
x.pos = w.pos ^ (1 << x.lvl);
C_distaPut (&x, d);
x.lvl = (w.lvl == 0) ? (ccdim - 1) : (w.lvl - 1);
x.pos = w.pos;
C_distaPut (&x, d);
x.lvl = (w.lvl == (ccdim - 1)) ? 0 : (w.lvl + 1);
C_distaPut (&x, d);
}
if (v.lvl + v.pos > 0) { /* Print distance triangular map line */
fprintf (C_filepntrarcout, SCOTCH_NUMSTRING,
(SCOTCH_Num) C_distaTab[0].dist);
for (i = 1; i < C_vertLabl (&v); i ++)
fprintf (C_filepntrarcout, " " SCOTCH_NUMSTRING,
(SCOTCH_Num) C_distaTab[i].dist);
fprintf (C_filepntrarcout, "\n");
}
}
}
fileBlockClose (C_fileTab, C_FILENBR); /* Always close explicitely to end eventual (un)compression tasks */
C_queueExit (&C_distaQueue);
memFree (C_distaTab);
return (EXIT_SUCCESS);
}
|
