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
|
/* 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 : hgraph.c **/
/** **/
/** AUTHOR : Francois PELLEGRINI **/
/** **/
/** FUNCTION : This module handles the source graph **/
/** functions. **/
/** **/
/** DATES : # Version 4.0 : from : 17 jan 2002 **/
/** to 01 dec 2003 **/
/** # Version 5.0 : from : 19 dec 2006 **/
/** to 19 dec 2006 **/
/** **/
/************************************************************/
/*
** The defines and includes.
*/
#define HGRAPH
#include "module.h"
#include "common.h"
#include "graph.h"
#include "hgraph.h"
/****************************************/
/* */
/* These routines handle source graphs. */
/* */
/****************************************/
/* This routine initializes a source graph
** structure.
** It returns:
** - 0 : in all cases.
*/
int
hgraphInit (
Hgraph * restrict const grafptr)
{
memSet (grafptr, 0, sizeof (Hgraph)); /* Initialize graph fields */
grafptr->s.flagval = GRAPHFREETABS; /* By default, free all arrays */
return (0);
}
/* This routine frees a source graph structure.
** It returns:
** - VOID : in all cases.
*/
void
hgraphExit (
Hgraph * restrict const grafptr)
{
hgraphFree (grafptr);
}
/* This routine frees a source graph structure.
** It returns:
** - VOID : in all cases.
*/
void
hgraphFree (
Hgraph * restrict const grafptr)
{
if ((grafptr->vnhdtax != NULL) && /* Free end vertex array for non-halo vertices */
(grafptr->vnhdtax != grafptr->s.vendtax) &&
((grafptr->s.flagval & HGRAPHFREEVHND) != 0))
memFree (grafptr->vnhdtax);
graphFree (&grafptr->s); /* Free graph data */
#ifdef SCOTCH_DEBUG_HGRAPH2
memSet (grafptr, ~0, sizeof (Hgraph)); /* Purge graph fields */
#endif /* SCOTCH_DEBUG_HGRAPH2 */
}
|
