1
/* Copyright 2004,2007 ENSEIRB, INRIA & CNRS
3
** This file is part of the Scotch software package for static mapping,
4
** graph partitioning and sparse matrix ordering.
6
** This software is governed by the CeCILL-C license under French law
7
** and abiding by the rules of distribution of free software. You can
8
** use, modify and/or redistribute the software under the terms of the
9
** CeCILL-C license as circulated by CEA, CNRS and INRIA at the following
10
** URL: "http://www.cecill.info".
12
** As a counterpart to the access to the source code and rights to copy,
13
** modify and redistribute granted by the license, users are provided
14
** only with a limited warranty and the software's author, the holder of
15
** the economic rights, and the successive licensors have only limited
18
** In this respect, the user's attention is drawn to the risks associated
19
** with loading, using, modifying and/or developing or reproducing the
20
** software by the user in light of its specific status of free software,
21
** that may mean that it is complicated to manipulate, and that also
22
** therefore means that it is reserved for developers and experienced
23
** professionals having in-depth computer knowledge. Users are therefore
24
** encouraged to load and test the software's suitability as regards
25
** their requirements in conditions enabling the security of their
26
** systems and/or data to be ensured and, more generally, to use and
27
** operate it in the same conditions as regards security.
29
** The fact that you are presently reading this means that you have had
30
** knowledge of the CeCILL-C license and that you accept its terms.
32
/************************************************************/
34
/** NAME : mapping_io.h **/
36
/** AUTHOR : Francois PELLEGRINI **/
38
/** FUNCTION : These lines are the declarations for **/
39
/** the mapping handling routines. **/
41
/** DATES : # Version 0.0 : from : 15 dec 1992 **/
42
/** to 01 apr 1993 **/
43
/** # Version 1.0 : from : 04 oct 1993 **/
44
/** to 06 oct 1993 **/
45
/** # Version 1.1 : from : 15 oct 1993 **/
46
/** to 15 oct 1993 **/
47
/** # Version 1.3 : from : 09 apr 1994 **/
48
/** to 11 may 1994 **/
49
/** # Version 2.0 : from : 06 jun 1994 **/
50
/** to 02 nov 1994 **/
51
/** # Version 2.1 : from : 07 apr 1995 **/
52
/** to 18 jun 1995 **/
53
/** # Version 3.0 : from : 01 jul 1995 **/
54
/** to 04 jul 1995 **/
55
/** # Version 3.1 : from : 30 oct 1995 **/
56
/** to 06 jun 1996 **/
57
/** # Version 3.2 : from : 23 aug 1996 **/
58
/** to 26 may 1998 **/
59
/** # Version 3.3 : from : 19 oct 1998 **/
60
/** to 30 mar 1999 **/
61
/** # Version 4.0 : from : 11 dec 2001 **/
62
/** to 13 nov 2005 **/
63
/** # Version 5.0 : from : 13 sep 2006 **/
64
/** to 13 sep 2006 **/
66
/************************************************************/
74
/*+ Ordering option flags. +*/
76
#define MAPNONE 0x0000 /* No options set */
77
#define MAPFREEPART 0x0001 /* Free partition array */
80
** The type definitions.
83
/*+ This structure defines a source label
84
to target label mapping element. +*/
86
typedef struct MappingLoadMap_ {
87
Gnum slblnum; /*+ Source graph vertex label: FIRST +*/
88
Gnum tlblnum; /*+ Target architecture vertex label +*/
91
/*+ The source graph sort structure, used to
92
sort vertices by increasing label value. +*/
94
typedef struct MappingLoadPerm {
95
Gnum vlblnum; /*+ Vertex label: FIRST +*/
96
Gnum vertnum; /*+ Vertex number +*/