blob: b7bf6964ac27a46be795edeea9000c9b96cf766b (
plain)
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
|
/* kpathsea.c: creating and freeing library instances
Copyright 2009, 2012 Taco Hoekwater.
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
This library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with this library; if not, see <http://www.gnu.org/licenses/>. */
/* One big global struct, and a variable that points to it */
/*
* The code freeing the strings used in this struct is enabled/disabled
* by KPATHSEA_CAN_FREE.
*/
#include <kpathsea/config.h>
kpathsea
kpathsea_new (void)
{
kpathsea ret;
ret = xcalloc(1, sizeof(kpathsea_instance));
return ret;
}
#if KPATHSEA_CAN_FREE
#define string_free(a) if ((a) != NULL) free((char *)(a))
static void
str_llist_free (str_llist_type p)
{
str_llist_type q;
while (p != NULL) {
q = p->next;
free (p->str);
free (p);
p = q;
}
}
static void
cache_free (cache_entry *the_cache, int cache_size)
{
int f ;
for (f = 0; f < cache_size; f++) {
string_free (the_cache[f].key);
str_llist_free (the_cache[f].value[0]);
}
free (the_cache);
}
#endif /* KPATHSEA_CAN_FREE */
/* Sadly, quite a lot of the freeing is not safe:
it seems there are literals used all over. */
void
kpathsea_finish (kpathsea kpse)
{
#if KPATHSEA_CAN_FREE
int i;
kpse_format_info_type f;
#endif /* KPATHSEA_CAN_FREE */
if (kpse==NULL)
return;
#if KPATHSEA_CAN_FREE
/* free internal stuff */
hash_free (kpse->cnf_hash);
hash_free (kpse->db);
hash_free (kpse->alias_db);
str_list_free (&kpse->db_dir_list);
hash_free (kpse->link_table);
cache_free (kpse->the_cache, kpse->cache_length);
hash_free (kpse->map);
string_free (kpse->map_path);
string_free (kpse->elt);
/*string_free (kpse->path);*/
if (kpse->log_file != (FILE *)NULL)
fclose(kpse->log_file);
string_free (kpse->invocation_name);
string_free (kpse->invocation_short_name);
string_free (kpse->program_name);
string_free (kpse->fallback_font);
string_free (kpse->fallback_resolutions_string);
if(kpse->fallback_resolutions != NULL)
free(kpse->fallback_resolutions);
for (i = 0; i != kpse_last_format; ++i) {
f = kpse->format_info[i];
string_free (f.path);
string_free (f.override_path);
string_free (f.client_path);
/*string_free (f.cnf_path);*/
}
if (kpse->missfont != (FILE *)NULL)
fclose (kpse->missfont);
for (i = 0; i < (int)kpse->expansion_len; i++) {
string_free (kpse->expansions[i].var);
}
free (kpse->expansions);
if (kpse->saved_env != NULL) {
for (i = 0; i != kpse->saved_count; ++i)
string_free (kpse->saved_env[i]);
free (kpse->saved_env);
}
#endif /* KPATHSEA_CAN_FREE */
#if defined(WIN32) || defined(__CYGWIN__)
if (kpse->suffixlist != NULL) {
char **p;
for (p = kpse->suffixlist; *p; p++)
free (*p);
free (kpse->suffixlist);
kpse->suffixlist = NULL;
}
#endif /* WIN32 || __CYGWIN__ */
#if defined (KPSE_COMPAT_API)
if (kpse == kpse_def)
return;
#endif
free (kpse);
}
#if defined (KPSE_COMPAT_API)
kpathsea_instance kpse_def_inst;
kpathsea kpse_def = &kpse_def_inst;
#endif /* KPSE_COMPAT_API */
|
