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
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
|
/*
* Copyright (C) 2015, 2016 "IoT.bzh"
* Author: José Bollo <jose.bollo@iot.bzh>
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#define _GNU_SOURCE
#include <stdint.h>
#include <stdlib.h>
#include <string.h>
/*
* Test if 'c' is to be escaped or not.
* Any character that is not in [-.0-9A-Z_a-z~]
* must be escaped.
* Note that space versus + is not managed here.
*/
static inline int should_escape(char c)
{
/* ASCII CODES OF UNESCAPED CHARS
car hx/oct idx
'-' 2d/055 1
'.' 2e/056 2
'0' 30/060 3
... ..
'9' 39/071 12
'A' 41/101 13
... ..
'Z' 5a/132 38
'_' 5f/137 39
'a' 61/141 40
... ..
'z' 7a/172 65
'~' 7e/176 66
*/
/* [-.0-9A-Z_a-z~] */
if (c <= 'Z') {
/* [-.0-9A-Z] */
if (c < '0') {
/* [-.] */
return c != '-' && c != '.';
} else {
/* [0-9A-Z] */
return c < 'A' && c > '9';
}
} else {
/* [_a-z~] */
if (c <= 'z') {
/* [_a-z] */
return c < 'a' && c != '_';
} else {
/* [~] */
return c != '~';
}
}
}
/*
* returns the ASCII char for the hexadecimal
* digit of the binary value 'f'.
* returns 0 if f isn't in [0 ... 15].
*/
static inline char bin2hex(int f)
{
if ((f & 15) != f)
f = 0;
else if (f < 10)
f += '0';
else
f += 'A' - 10;
return (char)f;
}
/*
* returns the binary value for the hexadecimal
* digit whose char is 'c'.
* returns -1 if c isn't i n[0-9A-Fa-f]
*/
static inline int hex2bin(char c)
{
/* [0-9A-Fa-f] */
if (c <= 'F') {
/* [0-9A-F] */
if (c <= '9') {
/* [0-9] */
if (c >= '0') {
return (int)(c - '0');
}
} else if (c >= 'A') {
/* [A-F] */
return (int)(c - ('A' - 10));
}
} else {
/* [a-f] */
if (c >= 'a' && c <= 'f') {
return (int)(c - ('a' - 10));
}
}
return -1;
}
/*
* returns the length that will have the text 'itext' of length
* 'ilen' when escaped. When 'ilen' == 0, strlen is used to
* compute the size of 'itext'.
*/
static size_t escaped_length(const char *itext, size_t ilen)
{
char c;
size_t i, r;
if (!ilen)
ilen = strlen(itext);
c = itext[i = r = 0];
while (i < ilen) {
r += c != ' ' && should_escape(c) ? 3 : 1;
c = itext[++i];
}
return r;
}
/*
* Escapes the text 'itext' of length 'ilen'.
* When 'ilen' == 0, strlen is used to compute the size of 'itext'.
* The escaped text is put in 'otext' of length 'olen'.
* Returns the length of the escaped text (it can be greater than 'olen').
* When 'olen' is greater than the needed length, an extra null terminator
* is appened to the escaped string.
*/
static size_t escape_to(const char *itext, size_t ilen, char *otext, size_t olen)
{
char c;
size_t i, r;
if (!ilen)
ilen = strlen(itext);
c = itext[i = r = 0];
while (i < ilen) {
if (c == ' ')
c = '+';
else if (should_escape(c)) {
if (r < olen)
otext[r] = '%';
r++;
if (r < olen)
otext[r] = bin2hex((c >> 4) & 15);
r++;
c = bin2hex(c & 15);
}
if (r < olen)
otext[r] = c;
r++;
c = itext[++i];
}
if (r < olen)
otext[r] = 0;
return r;
}
/*
* returns the length of 'itext' of length 'ilen' that can be unescaped.
* compute the size of 'itext' when 'ilen' == 0.
*/
static size_t unescapable_length(const char *itext, size_t ilen)
{
char c;
size_t i;
c = itext[i = 0];
while (i < ilen) {
if (c != '%')
i++;
else {
if (i + 3 > ilen
|| hex2bin(itext[i + 1]) < 0
|| hex2bin(itext[i + 2]) < 0)
break;
i += 3;
}
c = itext[i];
}
return i;
}
/*
* returns the length that will have the text 'itext' of length
* 'ilen' when escaped. When 'ilen' == 0, strlen is used to
* compute the size of 'itext'.
*/
static size_t unescaped_length(const char *itext, size_t ilen)
{
char c;
size_t i, r;
c = itext[i = r = 0];
while (i < ilen) {
i += (size_t)(1 + ((c == '%') << 1));
r++;
c = itext[i];
}
return r;
}
static size_t unescape_to(const char *itext, size_t ilen, char *otext, size_t olen)
{
char c;
size_t i, r;
int h, l;
ilen = unescapable_length(itext, ilen);
c = itext[i = r = 0];
while (i < ilen) {
if (c != '%') {
if (c == '+')
c = ' ';
i++;
} else {
if (i + 2 >= ilen)
break;
h = hex2bin(itext[i + 1]);
l = hex2bin(itext[i + 2]);
c = (char)((h << 4) | l);
i += 3;
}
if (r < olen)
otext[r] = c;
r++;
c = itext[i];
}
if (r < olen)
otext[r] = 0;
return r;
}
/* create an url */
char *escape_url(const char *base, const char *path, const char * const *args, size_t *length)
{
int i;
size_t lb, lp, lq, l, L;
const char *null;
char *result;
/* ensure args */
if (!args) {
null = NULL;
args = &null;
}
/* compute lengths */
lb = base ? strlen(base) : 0;
lp = path ? strlen(path) : 0;
lq = 0;
i = 0;
while (args[i]) {
lq += 1 + escaped_length(args[i], strlen(args[i]));
i++;
if (args[i])
lq += 1 + escaped_length(args[i], strlen(args[i]));
i++;
}
/* allocation */
L = lb + lp + lq + 1;
result = malloc(L + 1);
if (result) {
/* make the resulting url */
l = lb;
if (lb) {
memcpy(result, base, lb);
if (result[l - 1] != '/' && path && path[0] != '/')
result[l++] = '/';
}
if (lp) {
memcpy(result + l, path, lp);
l += lp;
}
i = 0;
while (args[i]) {
if (i) {
result[l++] = '&';
} else if (base || path) {
result[l] = memchr(result, '?', l) ? '&' : '?';
l++;
}
l += escape_to(args[i], strlen(args[i]), result + l, L - l);
i++;
if (args[i]) {
result[l++] = '=';
l += escape_to(args[i], strlen(args[i]), result + l, L - l);
}
i++;
}
result[l] = 0;
if (length)
*length = l;
}
return result;
}
char *escape_args(const char * const *args, size_t *length)
{
return escape_url(NULL, NULL, args, length);
}
const char **unescape_args_size(const char *args, size_t size)
{
const char **r;
char c, s, *p;
int h, l;
size_t i, na, nr;
/* estimate the size to allocate (bigger if empty values exists -&&&&) */
na = !!size;
for (nr = i = 0 ; i < size ; i++) {
c = args[i];
if (c == 0)
size = i;
else if (c == '&')
na++;
else if (c == '%') {
if (i + 2 >= size
|| hex2bin(args[i + 1]) < 0
|| hex2bin(args[i + 2]) < 0)
size = i;
else
nr += 2;
}
}
/* allocates the storage */
r = malloc(1 + size - nr + (2 * na + 1) * sizeof(char *));
if (!r)
return r;
/* unescape and fill the storage */
p = (void*)&r[2 * na + 1];
na = 0;
s = 0;
i = 0;
do {
c = i >= size ? '&' : args[i++];
switch (c) {
case '+':
c = ' ';
break;
case '%':
h = hex2bin(args[i++]);
l = hex2bin(args[i++]);
c = (char)((h << 4) | l);
break;
case '&':
if (s) {
if (s == 1)
r[na++] = NULL;
s = 0;
*p++ = 0;
}
c = 0;
break;
case '=':
if (!s)
r[na++] = p;
*p++ = 0;
r[na++] = p;
s = 2;
c = 0;
break;
}
if (c) {
if (!s) {
r[na++] = p;
s = 1;
}
*p++ = c;
}
} while (i < size);
*p = 0;
r[na] = NULL;
return r;
}
const char **unescape_args(const char *args)
{
return unescape_args_size(args, SIZE_MAX);
}
char *escape(const char *text, size_t textlen, size_t *reslength)
{
size_t len;
char *result;
len = 1 + escaped_length(text, textlen);
result = malloc(len);
if (result)
escape_to(text, textlen, result, len);
if (reslength)
*reslength = len - 1;
return result;
}
char *unescape(const char *text, size_t textlen, size_t *reslength)
{
size_t len;
char *result;
len = 1 + unescaped_length(text, textlen);
result = malloc(len);
if (result)
unescape_to(text, textlen, result, len);
if (reslength)
*reslength = len - 1;
return result;
}
#if TEST_ESCAPE
#include <stdio.h>
int main(int ac, char **av)
{
int i;
char *x = escape_args((void*)++av, NULL);
char *y = escape(x, strlen(x), NULL);
char *z = unescape(y, strlen(y), NULL);
const char **v = unescape_args(x);
printf("%s\n%s\n%s\n", x, y, z);
free(x);
free(y);
free(z);
i = 0;
while(v[i]) {
printf("%s=%s / %s=%s\n", av[i], av[i+1], v[i], v[i+1]);
i += 2;
}
free(v);
return 0;
}
#endif
/* vim: set colorcolumn=80: */
|