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
|
/*
* (C) 2006-2007 by Pablo Neira Ayuso <pablo@netfilter.org>
*
* 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., 675 Mass Ave, Cambridge, MA 02139, USA.
*/
#include "cache.h"
#include "hash.h"
#include "log.h"
#include "conntrackd.h"
#include "netlink.h"
#include <libnetfilter_conntrack/libnetfilter_conntrack.h>
#include <sched.h>
#include <errno.h>
#include <string.h>
#include <time.h>
struct __dump_container {
int fd;
int type;
};
static int do_dump(void *data1, struct hashtable_node *n)
{
char buf[1024];
int size;
struct __dump_container *container = data1;
struct cache_object *obj = (struct cache_object *)n;
char *data = obj->data;
unsigned i;
/*
* XXX: Do not dump the entries that are scheduled to expire.
* These entries talk about already destroyed connections
* that we keep for some time just in case that we have to
* resent some lost messages. We do not show them to the
* user as he may think that the firewall replicas are not
* in sync. The branch below is a hack as it is quite
* specific and it breaks conntrackd modularity. Probably
* there's a nicer way to do this but until I come up with it...
*/
if (CONFIG(flags) & CTD_SYNC_FTFW && obj->status == C_OBJ_DEAD)
return 0;
/* do not show cached timeout, this may confuse users */
if (nfct_attr_is_set(obj->ct, ATTR_TIMEOUT))
nfct_attr_unset(obj->ct, ATTR_TIMEOUT);
memset(buf, 0, sizeof(buf));
size = nfct_snprintf(buf,
sizeof(buf),
obj->ct,
NFCT_T_UNKNOWN,
container->type,
0);
for (i = 0; i < obj->cache->num_features; i++) {
if (obj->cache->features[i]->dump) {
size += obj->cache->features[i]->dump(obj,
data,
buf+size,
container->type);
data += obj->cache->features[i]->size;
}
}
if (container->type != NFCT_O_XML) {
long tm = time(NULL);
size += sprintf(buf+size, " [active since %lds]",
tm - obj->lifetime);
}
size += sprintf(buf+size, "\n");
if (send(container->fd, buf, size, 0) == -1) {
if (errno != EPIPE)
return -1;
}
return 0;
}
void cache_dump(struct cache *c, int fd, int type)
{
struct __dump_container tmp = {
.fd = fd,
.type = type
};
hashtable_iterate(c->h, (void *) &tmp, do_dump);
}
struct __commit_container {
struct nfct_handle *h;
struct cache *c;
};
static void
__do_commit_step(struct __commit_container *tmp, struct cache_object *obj)
{
int ret, retry = 1;
struct nf_conntrack *ct = obj->ct;
retry:
if (nl_create_conntrack(tmp->h, ct, CONFIG(commit_timeout)) == -1) {
if (errno == EEXIST && retry == 1) {
ret = nl_destroy_conntrack(tmp->h, ct);
if (ret == 0 || (ret == -1 && errno == ENOENT)) {
if (retry) {
retry = 0;
goto retry;
}
}
dlog(LOG_ERR, "commit-destroy: %s", strerror(errno));
dlog_ct(STATE(log), ct, NFCT_O_PLAIN);
tmp->c->stats.commit_fail++;
} else {
dlog(LOG_ERR, "commit-create: %s", strerror(errno));
dlog_ct(STATE(log), ct, NFCT_O_PLAIN);
tmp->c->stats.commit_fail++;
}
} else {
tmp->c->stats.commit_ok++;
}
}
static int do_commit_related(void *data, struct hashtable_node *n)
{
struct cache_object *obj = (struct cache_object *)n;
if (ct_is_related(obj->ct))
__do_commit_step(data, obj);
/* keep iterating even if we have found errors */
return 0;
}
static int do_commit_master(void *data, struct hashtable_node *n)
{
struct cache_object *obj = (struct cache_object *)n;
if (ct_is_related(obj->ct))
return 0;
__do_commit_step(data, obj);
return 0;
}
/* no need to clone, called from child process */
void cache_commit(struct cache *c)
{
unsigned int commit_ok = c->stats.commit_ok;
unsigned int commit_fail = c->stats.commit_fail;
struct __commit_container tmp;
struct timeval commit_start, commit_stop, res;
tmp.h = nfct_open(CONNTRACK, 0);
if (tmp.h == NULL) {
dlog(LOG_ERR, "can't create handler to commit entries");
return;
}
tmp.c = c;
gettimeofday(&commit_start, NULL);
/* commit master conntrack first, then related ones */
hashtable_iterate(c->h, &tmp, do_commit_master);
hashtable_iterate(c->h, &tmp, do_commit_related);
gettimeofday(&commit_stop, NULL);
timersub(&commit_stop, &commit_start, &res);
/* calculate new entries committed */
commit_ok = c->stats.commit_ok - commit_ok;
commit_fail = c->stats.commit_fail - commit_fail;
/* log results */
dlog(LOG_NOTICE, "Committed %u new entries", commit_ok);
if (commit_fail)
dlog(LOG_NOTICE, "%u entries can't be "
"committed", commit_fail);
nfct_close(tmp.h);
dlog(LOG_NOTICE, "commit has taken %llu.%06llu seconds",
res.tv_sec, res.tv_usec);
}
static int do_flush(void *data, struct hashtable_node *n)
{
struct cache *c = data;
struct cache_object *obj = (struct cache_object *)n;
cache_del(c, obj);
cache_object_free(obj);
return 0;
}
void cache_flush(struct cache *c)
{
hashtable_iterate(c->h, c, do_flush);
c->stats.flush++;
}
|
