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
|
/*
* csync2 - cluster synchronization tool, 2nd generation
* Copyright (C) 2004 - 2015 LINBIT Information Technologies GmbH
* http://www.linbit.com; see also AUTHORS
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include "csync2.h"
#include <stdio.h>
#include <assert.h>
#include <stdlib.h>
#define RINGBUFF_LEN 10
static char *ringbuff[RINGBUFF_LEN];
int ringbuff_counter = 0;
// perl -e 'printf("\\%03o", $_) for(1..040)' | fold -64; echo
static char badchars[] =
"\001\002\003\004\005\006\007\010\011\012\013\014\015\016\017\020"
"\021\022\023\024\025\026\027\030\031\032\033\034\035\036\037\040"
"\177\"'%$:|\\";
const char *url_encode(const char *in)
{
char *out;
int i, j, k, len;
for (i=len=0; in[i]; i++, len++)
for (j=0; badchars[j]; j++)
if ( in[i] == badchars[j] ) { len+=2; break; }
out = malloc(len + 1);
for (i=k=0; in[i]; i++) {
for (j=0; badchars[j]; j++)
if ( in[i] == badchars[j] ) break;
if ( badchars[j] ) {
snprintf(out+k, 4, "%%%02X", in[i]);
k += 3;
} else
out[k++] = in[i];
}
assert(k==len);
out[k] = 0;
if ( ringbuff[ringbuff_counter] )
free(ringbuff[ringbuff_counter]);
ringbuff[ringbuff_counter++] = out;
if ( ringbuff_counter == RINGBUFF_LEN ) ringbuff_counter=0;
return out;
}
const char *url_decode(const char *in)
{
char *out, num[3]="XX";
int i, k, len;
for (i=len=0; in[i]; i++, len++)
if ( in[i] == '%' && in[i+1] && in[i+2] ) i+=2;
out = malloc(len + 1);
for (i=k=0; in[i]; i++)
if ( in[i] == '%' && in[i+1] && in[i+2] ) {
num[0] = in[++i];
num[1] = in[++i];
out[k++] = strtol(num, 0, 16);
} else
out[k++] = in[i];
assert(k==len);
out[k] = 0;
if ( ringbuff[ringbuff_counter] )
free(ringbuff[ringbuff_counter]);
ringbuff[ringbuff_counter++] = out;
if ( ringbuff_counter == RINGBUFF_LEN ) ringbuff_counter=0;
return out;
}
|
