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
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
|
/* Copyright 2004,2007 ENSEIRB, 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 : common.h **/
/** **/
/** AUTHORS : David GOUDIN **/
/** Pascal HENON **/
/** Francois PELLEGRINI **/
/** Pierre RAMET **/
/** Cedric CHEVALIER **/
/** **/
/** FUNCTION : Part of a parallel direct block solver. **/
/** These lines are the common data **/
/** declarations for all modules. **/
/** **/
/** DATES : # Version 0.0 : from : 08 may 1998 **/
/** to : 08 jan 2001 **/
/** # Version 1.0 : from : 06 jun 2002 **/
/** to : 06 jun 2002 **/
/** # Version 2.0 : from : 13 jun 2005 **/
/** to : 07 jun 2007 **/
/** **/
/************************************************************/
#define COMMON_H
/*
** Machine configuration values.
** The end of the X_ARCH variable is built with parts of the
** `uname -m`, `uname -r`, and `uname -s` commands.
*/
#define X_C_RESTRICT
#if (defined X_ARCHpower_ibm_aix)
#define X_INCLUDE_ESSL
#undef X_C_RESTRICT
#endif /* (defined X_ARCHpower_ibm_aix) */
/*
** Compiler optimizations.
*/
#ifdef __GNUC__
#define restrict __restrict
#else /* __GNUC__ */
#ifndef X_C_RESTRICT
#define restrict
#endif /* X_C_RESTRICT */
#endif /* __GNUC__ */
/*
** The includes.
*/
#include <ctype.h>
#include <math.h>
#include <memory.h>
#include <stdio.h>
#include <stdarg.h>
#include <stdlib.h>
#ifdef HAVE_MALLOC_H
#include <malloc.h> /* Deprecated, but required on some old systems */
#endif /* HAVE_MALLOC_H */
#include <string.h>
#include <time.h> /* For the effective calls to clock () */
#include <limits.h>
#include <float.h>
#include <sys/types.h>
#include <sys/time.h>
#include <sys/resource.h>
#include <unistd.h>
#ifdef SCOTCH_PTSCOTCH
#include <mpi.h>
#endif /* SCOTCH_PTSCOTCH */
#ifdef SCOTCH_PTHREAD
#include <pthread.h>
#endif /* SCOTCH_PTHREAD */
#ifdef X_INCLUDE_ESSL
#include <essl.h>
#endif /* X_INCLUDE_ESSL */
/*
** Working definitions.
*/
#define memAlloc(size) malloc((size) | 8) /* For platforms which return NULL for malloc(0) */
#define memAlloca(size) alloca(size)
#define memRealloc(ptr,size) realloc((ptr),((size) | 8))
#define memFree(ptr) (free ((char *) (ptr)), 0)
#define memFreea(ptr) (0) /* Freeing function if memAlloca implemented as malloc */
#define memSet(ptr,val,siz) memset((ptr),(val),(siz))
#define memCpy(dst,src,siz) memcpy((dst),(src),(siz))
#define memMov(dst,src,siz) memmove((dst),(src),(siz))
#define MIN(x,y) (((x) < (y)) ? (x) : (y))
#define MAX(x,y) (((x) < (y)) ? (y) : (x))
#define ABS(x) MAX ((x), -(x))
#define SIGN(x) (((x) < 0) ? -1 : 1)
/*
** Handling of generic types.
*/
#ifdef DOUBLE /*+ If double data type wanted +*/
#ifndef FLOAT /*+ If type not overriden +*/
#define FLOAT double /*+ Generic floating-point type +*/
#define FLOAT_MAX MAXDOUBLE
#define BLAS_DOUBLE /*+ Sets double BLAS calls +*/
#define COMM_FLOAT MPI_DOUBLE /*+ Generic MPI floating-point type +*/
#endif /* FLOAT */
#else /* DOUBLE */
#ifndef FLOAT /*+ If type not overriden +*/
#define FLOAT float /*+ Generic floating-point type +*/
#define FLOAT_MAX MAXFLOAT
#define BLAS_FLOAT /*+ Sets float BLAS calls +*/
#define COMM_FLOAT MPI_FLOAT /*+ Generic MPI floating-point type +*/
#endif /* FLOAT */
#endif /* DOUBLE */
#ifndef INT /* If type not overriden */
#ifdef LONG /* If long ints not wanted */
#define INT long /* Generic integer type to long */
#else /* LONG */
#define INT int /* Generic integer type to int */
#endif /* LONG */
#endif /* INT */
#define INT_TYPE_VAL_int 1
#define INT_TYPE_VAL_long 2
#define INT_TYPE_EXPAND(t) (INT_TYPE_EXPAND_TWO(t))
#define INT_TYPE_EXPAND_TWO(t) (INT_TYPE_VAL_##t)
#define INT_TYPE (INT_TYPE_EXPAND (INT))
#ifndef COMM_INT
#if (INT_TYPE == INT_TYPE_VAL_long)
#define COMM_INT MPI_LONG /* Generic MPI integer type */
#ifndef INT_MAX
#define INT_MAX MAXLONG /* Hmm, it is an existing macro */
#endif /* INT_MAX */
#else /* (INT_TYPE == INT_TYPE_VAL_long) */
#define COMM_INT MPI_INT /*+ Generic MPI integer type +*/
#ifndef INT_MAX
#define INT_MAX MAXINT
#endif /* INT_MAX */
#endif /* (INT_TYPE == INT_TYPE_VAL_long) */
#endif /* COMM_INT */
#ifndef INT_BITS
#define INT_BITS (sizeof (INT) * 8)
#endif /* INT_BITS */
#define byte unsigned char /* Byte type */
#ifndef BYTE
#define BYTE byte
#endif /* BYTE */
#ifndef COMM_BYTE
#define COMM_BYTE MPI_BYTE
#endif /* COMM_BYTE */
#define COMM_PART COMM_BYTE
/*
** Handling of timers.
*/
/** The clock type. **/
typedef struct Clock_ {
double time[2]; /*+ The start and accumulated times +*/
} Clock;
/*
** Handling of files.
*/
/** The file structure. **/
typedef struct File_ {
char * name; /*+ File name +*/
FILE * pntr; /*+ File pointer +*/
char * mode; /*+ Opening mode +*/
} File;
/*
** Handling of generic BLAS.
*/
#ifdef BLAS_DOUBLE
#define AXPY daxpy
#define GEMM dgemm
#define GEMV dgemv
#define GEAM dgeam
#define GECP dgecp
#define SYMM gsymm
#define TRSM dtrsm
#define GEF dgef
#define POF dpof
#define PPF dppf
#define GER dger
#define GETMO dgetmo
#define SYR dsyr
#define SPR dspr
#define SYRK dsyrk
#define COPY dcopy
#define SCAL dscal
#define V_DIV dv_div
#define POTRF dpotrf
#define POTF2 dpotf2
#else
#define AXPY saxpy
#define GEMM sgemm
#define GEMV sgemv
#define GEAM sgeam
#define GECP sgecp
#define SYMM ssymm
#define TRSM strsm
#define GEF sgef
#define POF spof
#define PPF sppf
#define GER sger
#define GETMO sgetmo
#define SYR ssyr
#define SPR sspr
#define SYRK ssyrk
#define COPY scopy
#define SCAL sscal
#define V_DIV sv_div
#define POTRF spotrf
#define POTF2 spotf2
#endif
/*
** Function prototypes.
*/
void * memAllocGroup (void **, ...);
void * memReallocGroup (void *, ...);
void * memOffset (void *, ...);
void usagePrint (FILE * const, const char (* []));
int fileNameDistExpand (char ** const, const int, const int, const int);
void errorProg (const char * const);
void errorPrint (const char * const, ...);
void errorPrintW (const char * const, ...);
int intLoad (FILE * const, INT * const);
int intSave (FILE * const, const INT);
void intAscn (INT * restrict const, const INT, const INT);
void intPerm (INT * restrict const, const INT);
void intRandReset (void);
void intRandInit (void);
INT intRandVal (INT);
void intSort1asc1 (void * const, const INT);
void intSort2asc1 (void * const, const INT);
void intSort2asc2 (void * const, const INT);
INT intSearchDicho (const INT * const, const INT, const INT, const INT);
void clockInit (Clock * const);
void clockStart (Clock * const);
void clockStop (Clock * const);
double clockVal (Clock * const);
double clockGet (void);
/*
** Macro definitions.
*/
#define clockInit(clk) ((clk)->time[0] = (clk)->time[1] = 0)
#define clockStart(clk) ((clk)->time[0] = clockGet ())
#define clockStop(clk) ((clk)->time[1] += (clockGet () - (clk)->time[0]))
#define clockVal(clk) ((clk)->time[1])
#ifdef MPI_INT
#define clockGet() (MPI_Wtime ())
#endif /* MPI_INT */
#define intRandVal(ival) ((INT) (((unsigned INT) random ()) % ((unsigned INT) (ival))))
#define DATASIZE(n,p,i) ((INT) (((n) + ((p) - 1 - (i))) / (p)))
#define FORTRAN(nu,nl,pl,pc) \
void nu pl; \
void nl pl \
{ nu pc; } \
void nl##_ pl \
{ nu pc; } \
void nl##__ pl \
{ nu pc; } \
void nu pl
|
