add.c
1.61 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
/**
* \file
*
* \author Georg Hopp
*
* \copyright
* Copyright (C) 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 <search.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "class.h"
#include "interface/class.h"
#include "http/header.h"
#include "utils/hash.h"
static
inline
int
comp(const void * _a, const void * _b)
{
HttpHeader a = (HttpHeader)_a;
HttpHeader b = (HttpHeader)_b;
return (a->hash < b->hash)? -1 : (a->hash > b->hash)? 1 : 0;
}
HttpHeader
httpHeaderAdd(const HttpHeader * root, HttpHeader header)
{
HttpHeader * _found = tsearch(header, (void **)root, comp);
HttpHeader found;
if (NULL == _found) {
return NULL;
}
found = *_found;
if (found != header) {
if (found->cvalue >= N_VALUES) {
return NULL;
}
(found->nvalue)[found->cvalue] = (header->nvalue)[0];
(found->value)[(found->cvalue)++] = (header->value)[0];
found->size += header->size;
(header->value)[0] = NULL;
delete(header);
}
return found;
}
// vim: set ts=4 sw=4: