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
|
#include "cp_types.h"
#include "cp_proto.h"
int vert_free(struct Vertlist **vertlist)
{
struct Vertlist *trace,*clobber;
if (*vertlist==NULL) return 1;
trace=*vertlist;
while (trace!=NULL)
{
clobber=trace;
trace=trace->next;
free(clobber);
}
*vertlist=NULL;
return 1;
} /* vert_free */
int edge_free(struct Edgelist **edgelist)
{
struct Edgelist *trace,*clobber;
if (*edgelist==NULL) return 1;
trace=*edgelist;
while (trace!=NULL)
{
clobber=trace;
trace=trace->next;
free(clobber);
}
*edgelist=NULL;
return 1;
} /* edge_free */
int cent_free(struct Centlist **centlist)
{
struct Centlist *trace,*clobber;
if (*centlist==NULL) return 1;
trace=*centlist;
while (trace!=NULL)
{
clobber=trace;
trace=trace->next;
free(clobber);
}
*centlist=NULL;
return 1;
} /* cent_free */
int path_free(struct Pathlist **pathlist)
{
struct Pathlist *trace,*clobber;
if (*pathlist==NULL) return 1;
trace=*pathlist;
while (trace!=NULL)
{
clobber=trace;
trace=trace->next;
free(clobber);
}
*pathlist=NULL;
return 1;
} /* path_free */
int free_redfaces(struct RedList **redlist)
{
struct RedList *kil;
if ((*redlist)==NULL) return 0;
while (*redlist && (*redlist)->next!=*redlist) /* collapse list by one */
{
(*redlist)->prev->next=(*redlist)->next;
(*redlist)->next->prev=(*redlist)->prev;
kil=*redlist;
*redlist=(*redlist)->prev;
free(kil);
kil=NULL;
}
free(*redlist);
*redlist=NULL;
return 1;
} /* free_redfaces */
int free_bdrydata(struct BdryData **bdrydata)
{
struct BdryData *kil;
if ((*bdrydata)==NULL) return 0;
while (*bdrydata && (*bdrydata)->next!=*bdrydata) /* collapse list by one */
{
(*bdrydata)->prev->next=(*bdrydata)->next;
(*bdrydata)->next->prev=(*bdrydata)->prev;
kil=*bdrydata;
*bdrydata=(*bdrydata)->prev;
free(kil);
kil=NULL;
}
free(*bdrydata);
*bdrydata=NULL;
return 1;
} /* free_bdrydata */
int free_overlaps(struct p_data *p)
/* free pointers to overlaps */
{
int v;
for (v=1;v<=p->nodecount;v++)
if (p->packK_ptr[v].overlaps)
{
free(p->packK_ptr[v].overlaps);
p->packK_ptr[v].overlaps=NULL;
}
p->overlap_status=0;
return 1;
} /* free_overlaps */
int free_p_data(struct p_data **pack)
/* get rid of a packing and free its space */
{
int i;
struct p_data *p;
p=*pack;
if (!p) return 1;
free_overlaps(p);
free_redfaces(&(p->redfaces));
if (p->rwb_flags) free(p->rwb_flags);
if (p->f_util) free(p->f_util);
vert_free(&(p->vlist));
vert_free(&(p->flist));
edge_free(&(p->elist));
edge_free(&(p->vertex_map));
if (p->faces) free(p->faces);
if (p->packR_ptr) free(p->packR_ptr);
if (p->packK_ptr)
{
for (i=1;i<=p->nodecount;i++)
if (p->packK_ptr[i].flower) free(p->packK_ptr[i].flower);
free(p->packK_ptr);
}
if (p->edge_pair) free(p->edge_pair);
free(p);
*pack=NULL;
return 1;
} /* free_p_data */
int free_p_light(struct p_light **plight)
{
struct p_light *pl;
pl=*plight;
if (!pl) return 1;
if (pl->counts) free(pl->counts);
if (pl->var_indices) free(pl->var_indices);
if (pl->orig_indices) free(pl->orig_indices);
if (pl->radii) free(pl->radii);
if (pl->aim_indices) free(pl->aim_indices);
if (pl->aims) free(pl->aims);
free(pl);
*plight=NULL;
return 1;
} /* free_p_light */
|