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
|
/*
Copyright (C) 2013 Andrey Uzunov
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 3 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, see <http://www.gnu.org/licenses/>.
*/
/**
* @file mhd2spdy_structures.h
* @brief Common functions, macros.
* @author Andrey Uzunov
*/
#include "mhd2spdy_structures.h"
void
free_uri(struct URI * uri)
{
if(NULL != uri)
{
free(uri->full_uri);
free(uri->scheme);
free(uri->host_and_port);
free(uri->host);
free(uri->path);
free(uri->path_and_more);
free(uri->query);
free(uri->fragment);
uri->port = 0;
free(uri);
}
}
int
init_parse_uri(regex_t * preg)
{
// RFC 2396
// ^(([^:/?#]+):)?(//([^/?#]*))?([^?#]*)(\?([^#]*))?(#(.*))?
/*
scheme = $2
authority = $4
path = $5
query = $7
fragment = $9
*/
return regcomp(preg, "^(([^:/?#]+):)?(//([^/?#]*))?([^?#]*)(\\?([^#]*))?(#(.*))?", REG_EXTENDED);
}
void
deinit_parse_uri(regex_t * preg)
{
regfree(preg);
}
int
parse_uri(regex_t * preg,
char * full_uri,
struct URI ** uri)
{
int ret;
char *colon;
long long port;
size_t nmatch = 10;
regmatch_t pmatch[10];
if (0 != (ret = regexec(preg, full_uri, nmatch, pmatch, 0)))
return ret;
*uri = au_malloc(sizeof(struct URI));
if(NULL == *uri)
return -200;
(*uri)->full_uri = strdup(full_uri);
asprintf(&((*uri)->scheme), "%.*s",pmatch[2].rm_eo - pmatch[2].rm_so, &full_uri[pmatch[2].rm_so]);
asprintf(&((*uri)->host_and_port), "%.*s",pmatch[4].rm_eo - pmatch[4].rm_so, &full_uri[pmatch[4].rm_so]);
asprintf(&((*uri)->path), "%.*s",pmatch[5].rm_eo - pmatch[5].rm_so, &full_uri[pmatch[5].rm_so]);
asprintf(&((*uri)->path_and_more), "%.*s",pmatch[9].rm_eo - pmatch[5].rm_so, &full_uri[pmatch[5].rm_so]);
asprintf(&((*uri)->query), "%.*s",pmatch[7].rm_eo - pmatch[7].rm_so, &full_uri[pmatch[7].rm_so]);
asprintf(&((*uri)->fragment), "%.*s",pmatch[9].rm_eo - pmatch[9].rm_so, &full_uri[pmatch[9].rm_so]);
colon = strrchr((*uri)->host_and_port, ':');
if(NULL == colon)
{
(*uri)->host = strdup((*uri)->host_and_port);
(*uri)->port = 0;
return 0;
}
port = atoi(colon + 1);
if(port<1 || port >= 256 * 256)
{
free_uri(*uri);
return -100;
}
(*uri)->port = port;
asprintf(&((*uri)->host), "%.*s", (int)(colon - (*uri)->host_and_port), (*uri)->host_and_port);
return 0;
}
void
free_proxy(struct Proxy *proxy)
{
PRINT_INFO2("free proxy called for '%s'", proxy->url);
free(proxy->http_body);
free_uri(proxy->uri);
free(proxy->url);
free(proxy->http_uri);
free(proxy);
}
//TODO remove this
void *au_malloc(size_t size)
{
void *new_memory;
new_memory = malloc(size);
if(NULL != new_memory)
{
glob_opt.global_memory += size;
memset(new_memory, 0, size);
}
return new_memory;
}
bool
copy_buffer(const void *src, size_t src_size, void **dst, size_t *dst_size)
{
if(0 == src_size)
return true;
if(NULL == *dst)
*dst = malloc(src_size);
else
*dst = realloc(*dst, src_size + *dst_size);
if(NULL == *dst)
return false;
memcpy(*dst + *dst_size, src, src_size);
*dst_size += src_size;
return true;
}
|
