-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathutil.c
More file actions
409 lines (312 loc) · 8.82 KB
/
util.c
File metadata and controls
409 lines (312 loc) · 8.82 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
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
#include "util.h"
#include <ctype.h>
#include <stdlib.h>
#define next_alloc(x) (((x)+16)*3/2)
static
int grow_alloc(void **p, size_t member_size, int nalloc, int nreserve)
{
if (next_alloc(nalloc) < nreserve)
nalloc = nreserve;
else
nalloc = next_alloc(nalloc);
*p = realloc(*p, nalloc * member_size);
return (*p) ? nalloc : 0;
}
void str_tolower(char *str)
{
char *p;
for (p = str; *p; p++)
*p = tolower(*p);
}
char *str_duplower(const char *s)
{
char *dup = strdup(s);
if (!dup)
return NULL;
str_tolower(dup);
return dup;
}
int istarts_with(const char *str, const char *pat)
{
int str_len = strlen(str);
int pat_len = strlen(pat);
if (pat_len > str_len)
return 0;
return strncasecmp(str, pat, pat_len) ? 0 : 1;
}
int starts_with(const char *str, const char *pat)
{
int str_len = strlen(str);
int pat_len = strlen(pat);
if (pat_len > str_len)
return 0;
return strncmp(str, pat, pat_len) ? 0 : 1;
}
/* if s_needs_url_encoding[c] is 1, c needs url encoding */
const static unsigned char s_needs_url_encoding[] = {
/* 0 */ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
/* 10 */ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
/* 20 */ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
/* 30 */ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
/* 40 */ 1, 1, 1, 1, 1, 0, 0, 1, 0, 0,
/* 50 */ 0, 0, 0, 0, 0, 0, 0, 0, 1, 1,
/* 60 */ 1, 1, 1, 1, 1, 0, 0, 0, 0, 0,
/* 70 */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
/* 80 */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
/* 90 */ 0, 1, 1, 1, 1, 0, 1, 0, 0, 0,
/* 100 */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
/* 110 */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
/* 120 */ 0, 0, 0, 1, 1, 1, 0, 1, 1, 1,
/* 130 */ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
/* 140 */ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
/* 150 */ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
/* 160 */ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
/* 170 */ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
/* 180 */ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
/* 190 */ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
/* 200 */ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
/* 210 */ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
/* 220 */ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
/* 230 */ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
/* 240 */ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
/* 250 */ 1, 1, 1, 1, 1, 1,
};
char *url_encode(const void *str)
{
/* Count new buffer length. Initialize len to 1 for terminated zero. */
int len = 1;
const unsigned char *p;
char *encoded;
char *current;
for (p = (const unsigned char *) str; *p; p++) {
if (s_needs_url_encoding[*p])
len += 3;
else
len += 1;
}
encoded = (char *) malloc(len);
if (!encoded)
return NULL;
current = encoded;
for (p = (const unsigned char *) str; *p; p++) {
if (s_needs_url_encoding[*p])
current += sprintf(current, "%%%02X", *p);
else
*(current++) = *p;
}
*current = '\0';
return encoded;
}
struct oss_kvlist * oss_kvlist_init(struct oss_kvlist *kvlist, int nreserve)
{
void *ptr;
memset(kvlist, 0, sizeof(*kvlist));
if (nreserve <= 0)
return kvlist;
ptr = calloc(nreserve, sizeof(struct oss_kv));
if (!ptr)
return NULL;
kvlist->items = (struct oss_kv *) ptr;
kvlist->n = 0;
kvlist->nalloc = nreserve;
return kvlist;
}
static
void oss_kvlist_free_kv(struct oss_kvlist *kvlist)
{
int i;
for (i = 0; i < kvlist->n; i++) {
struct oss_kv *kv = &kvlist->items[i];
free(kv->key);
free(kv->value);
}
}
void oss_kvlist_free(struct oss_kvlist *kvlist)
{
if (!kvlist || kvlist->nalloc == 0)
return;
oss_kvlist_free_kv(kvlist);
free(kvlist->items);
}
void oss_kvlist_clear(struct oss_kvlist *kvlist)
{
if (!kvlist || kvlist->nalloc == 0)
return;
oss_kvlist_free_kv(kvlist);
memset(kvlist->items, 0, kvlist->nalloc * sizeof(kvlist->items[0]));
kvlist->n = 0;
}
struct oss_kv * oss_kvlist_ifind(struct oss_kvlist *kvlist, const char *key)
{
int i;
for (i = 0; i < kvlist->n; i++) {
if (strcasecmp(kvlist->items[i].key, key) == 0)
return &kvlist->items[i];
}
return NULL;
}
static
int kvlist_icmp_key(const void *pa, const void *pb)
{
struct oss_kv *a = (struct oss_kv *) pa;
struct oss_kv *b = (struct oss_kv *) pb;
return strcasecmp(a->key, b->key);
}
static
int kvlist_cmp_key(const void *pa, const void *pb)
{
struct oss_kv *a = (struct oss_kv *) pa;
struct oss_kv *b = (struct oss_kv *) pb;
return strcmp(a->key, b->key);
}
void oss_kvlist_isort(struct oss_kvlist *kvlist)
{
qsort(kvlist->items, kvlist->n, sizeof(*kvlist->items), kvlist_icmp_key);
}
void oss_kvlist_sort(struct oss_kvlist *kvlist)
{
qsort(kvlist->items, kvlist->n, sizeof(*kvlist->items), kvlist_cmp_key);
}
static
void * free2(void *a, void *b)
{
free(a);
free(b);
return NULL;
}
struct oss_kv * oss_kvlist_append(struct oss_kvlist *kvlist, const char *key, const char *value)
{
struct oss_kv *item;
char *k = strdup(key);
char *v = strdup(value);
if (!k || !v) {
return free2(k, v);
}
item = oss_kvlist_append_nodup(kvlist, k, v);
if (!item) {
return free2(k, v);
}
return item;
}
struct oss_kv * oss_kvlist_append_nodup_v(struct oss_kvlist *kvlist, const char *key, char *value)
{
struct oss_kv *item;
char *k = strdup(key);
if (!k)
return NULL;
item = oss_kvlist_append_nodup(kvlist, k, value);
if (!item)
free(k);
return item;
}
struct oss_kv * oss_kvlist_append_nodup(struct oss_kvlist *kvlist, char *key, char *value)
{
struct oss_kv *item = NULL;
int nreserve = kvlist->n + 1;
int nalloc = kvlist->nalloc;
if (nreserve > nalloc) {
kvlist->nalloc = grow_alloc(&kvlist->items, sizeof(*kvlist->items), nalloc, nreserve);
if (!kvlist->nalloc)
return NULL;
}
item = &kvlist->items[kvlist->n++];
item->key = key;
item->value = value;
return item;
}
struct oss_buffer * oss_buffer_init(struct oss_buffer *buffer, int nreserve)
{
void *ptr = NULL;
memset(buffer, 0, sizeof(*buffer));
if (nreserve <= 0)
return buffer;
ptr = malloc(nreserve);
if (!ptr)
return NULL;
buffer->data = ptr;
buffer->n = 0;
buffer->nalloc = nreserve;
return buffer;
}
static void *memdup(const void *p, int size)
{
void *dup = malloc(size);
if (!dup)
return NULL;
memcpy(dup, p, size);
return dup;
}
struct oss_buffer *oss_buffer_assign(struct oss_buffer *buffer, const void *ptr, int size)
{
void *dup = memdup(ptr, size);
if (!dup)
return NULL;
oss_buffer_free(buffer);
buffer->data = dup;
buffer->n = size;
buffer->nalloc = size;
return buffer;
}
void oss_buffer_free(struct oss_buffer *buffer)
{
free(buffer->data);
oss_buffer_detach(buffer);
}
void oss_buffer_clear(struct oss_buffer *buffer)
{
if (!buffer || buffer->nalloc == 0)
return;
memset(buffer->data, 0, buffer->nalloc);
buffer->n = 0;
}
void oss_buffer_detach(struct oss_buffer *buffer)
{
oss_buffer_init(buffer, 0);
}
char * oss_buffer_detach_as_string(struct oss_buffer *buffer)
{
char *string = NULL;
if (!oss_buffer_append_zero(buffer)) {
oss_buffer_free(buffer);
return NULL;
}
string = buffer->data;
oss_buffer_detach(buffer);
return string;
}
char * oss_buffer_append(struct oss_buffer *buffer, const char *idata, int ilen)
{
int nreserve = buffer->n + ilen;
int nalloc = buffer->nalloc;
char *data = buffer->data;
if (nreserve > nalloc) {
nalloc = grow_alloc(&data, 1, nalloc, nreserve);
if (!nalloc)
return NULL;
buffer->nalloc = nalloc;
buffer->data = data;
}
memcpy(buffer->data + buffer->n, idata, ilen);
buffer->n += ilen;
return buffer->data + (buffer->n - ilen);
}
char * oss_buffer_append_zero(struct oss_buffer *buffer)
{
char zero = '\0';
return oss_buffer_append(buffer, &zero, 1);
}
char * oss_buffer_back(struct oss_buffer *buffer)
{
return &buffer->data[buffer->n - 1];
}
oss_i64 oss_fsize(FILE* fh)
{
oss_i64 size = -1;
oss_i64 old_offset = _ftelli64(fh);
if (oss_fseek(fh, 0, SEEK_END) != 0)
return -1;
size = oss_ftell(fh);
if (oss_fseek(fh , old_offset, SEEK_SET) != 0)
return -1;
return size;
}