forked from MapServer/tinyows
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy patharray.c
More file actions
210 lines (160 loc) · 4.22 KB
/
array.c
File metadata and controls
210 lines (160 loc) · 4.22 KB
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
/*
Copyright (c) <2007-2012> <Barbara Philippot - Olivier Courtin>
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
IN THE SOFTWARE.
*/
#include <stdlib.h>
#include <stdio.h> /* FILE */
#include <string.h> /* strncmp */
#include <limits.h>
#include <assert.h>
#include "../ows/ows.h"
/*
* Initialize an array structure
*/
array *array_init()
{
array *arr = NULL;
arr = malloc(sizeof(array));
assert(arr);
arr->first = NULL;
arr->last = NULL;
return arr;
}
/*
* Free an array structure
*/
void array_free(array * a)
{
array_node *an = NULL;
array_node *an_to_free = NULL;
assert(a);
for (an = a->first ; an ; /* empty */) {
an_to_free = an;
an = an->next;
buffer_free(an_to_free->key);
buffer_free(an_to_free->value);
free(an_to_free);
an_to_free = NULL;
}
free(a);
a = NULL;
}
/*
* Add a given buffer to the end of an array
* Carefull key and value are passed by reference
* and will be released by array_free !
*/
void array_add(array * a, buffer * key, buffer * value)
{
array_node *an;
assert(a);
assert(key);
assert(value);
an = malloc(sizeof(array_node));
assert(an);
an->key = key;
an->value = value;
if (!a->first) a->first = an;
else a->last->next = an;
a->last = an;
a->last->next = NULL;
}
/*
* Check if a given key string is or not in the array
*/
bool array_is_key(const array * a, const char *key)
{
array_node *an;
size_t ks;
assert(a);
assert(key);
for (ks = strlen(key), an = a->first ; an ; an = an->next)
if (ks == an->key->use)
if (buffer_case_cmp(an->key, key))
return true;
return false;
}
/*
* Check if a given value string is or not in the array
*/
bool array_is_value(const array * a, const char *value)
{
array_node *an;
size_t vs;
assert(a);
assert(value);
for (vs = strlen(value), an = a->first ; an ; an = an->next)
if (vs == an->value->use)
if (buffer_case_cmp(an->value, value))
return true;
return false;
}
/*
* Return a value buffer from an array (from key value)
* You must be sure key is defined for this array, see is_key() above
* Carreful return a reference on the array buf itself !
*/
buffer *array_get(const array * a, const char *key)
{
array_node *an;
size_t ks;
assert(a);
assert(key);
for (ks = strlen(key), an = a->first ; an ; an = an->next) {
if (ks == an->key->use)
if (buffer_case_cmp(an->key, key))
break;
}
assert(an);
return an->value;
}
/*
* Return a key buffer from an array (from value)
*/
buffer *array_get_key(const array * a, const char *value)
{
array_node *an;
size_t vs;
assert(a);
assert(value);
for (vs = strlen(value), an = a->first ; an ; an = an->next) {
if (vs == an->value->use)
if (buffer_case_cmp(an->value, value))
break;
}
assert(an);
return an->key;
}
#ifdef OWS_DEBUG
/*
* Flush an array to a given file
* (mainly to debug purpose)
*/
void array_flush(const array * a, FILE * output)
{
array_node *an;
assert(a);
assert(output);
for (an = a->first ; an ; an = an->next) {
fprintf(output, "[");
buffer_flush(an->key, output);
fprintf(output, "] -> ");
buffer_flush(an->value, output);
fprintf(output, "\n");
}
}
#endif