p_post_vars.c
1.7 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
/**
* \file
*
* \author Georg Hopp
*
* \copyright
* Copyright © 2012 Georg Hopp
*
* 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/>.
*/
#include <string.h>
#include <sys/types.h>
#include "http/parser.h"
#include "http/request.h"
#include "hash.h"
#include "class.h"
/**
* \todo this is very similar to other pair parsing
* things... key1=val1<delim>key2=val2<delim>...keyn=valn
* Generalize this!!!!
*/
void
httpParserPostVars(HttpParser this)
{
HttpRequest request = (HttpRequest)this->current;
char * pair = this->current->body;
ssize_t togo = this->current->nbody;
while(NULL != pair && 0 < togo) {
char * key = pair;
char * eqsign = memchr(key, '=', togo);
char * value;
size_t nvalue;
if (NULL == eqsign) {
return;
}
togo -= (eqsign - key);
pair = memchr(eqsign, '&', togo);
if (NULL == pair) {
pair = &(this->current->body[this->current->nbody]);
}
nvalue = pair-eqsign-1;
value = (0 != nvalue)? eqsign+1 : NULL;
hashAdd(request->post,
new(HashValue, key, eqsign-key, value, nvalue));
pair++;
togo -= (pair - eqsign);
}
}
// vim: set ts=4 sw=4: