ip_flow.c revision 1.53 1 1.53 thorpej /* $NetBSD: ip_flow.c,v 1.53 2008/04/09 05:14:20 thorpej Exp $ */
2 1.1 matt
3 1.1 matt /*-
4 1.1 matt * Copyright (c) 1998 The NetBSD Foundation, Inc.
5 1.1 matt * All rights reserved.
6 1.1 matt *
7 1.1 matt * This code is derived from software contributed to The NetBSD Foundation
8 1.1 matt * by the 3am Software Foundry ("3am"). It was developed by Matt Thomas.
9 1.1 matt *
10 1.1 matt * Redistribution and use in source and binary forms, with or without
11 1.1 matt * modification, are permitted provided that the following conditions
12 1.1 matt * are met:
13 1.1 matt * 1. Redistributions of source code must retain the above copyright
14 1.1 matt * notice, this list of conditions and the following disclaimer.
15 1.1 matt * 2. Redistributions in binary form must reproduce the above copyright
16 1.1 matt * notice, this list of conditions and the following disclaimer in the
17 1.1 matt * documentation and/or other materials provided with the distribution.
18 1.1 matt * 3. All advertising materials mentioning features or use of this software
19 1.1 matt * must display the following acknowledgement:
20 1.1 matt * This product includes software developed by the NetBSD
21 1.1 matt * Foundation, Inc. and its contributors.
22 1.1 matt * 4. Neither the name of The NetBSD Foundation nor the names of its
23 1.1 matt * contributors may be used to endorse or promote products derived
24 1.1 matt * from this software without specific prior written permission.
25 1.1 matt *
26 1.1 matt * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
27 1.1 matt * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
28 1.1 matt * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
29 1.1 matt * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
30 1.1 matt * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
31 1.1 matt * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
32 1.1 matt * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
33 1.1 matt * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
34 1.1 matt * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
35 1.1 matt * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
36 1.1 matt * POSSIBILITY OF SUCH DAMAGE.
37 1.1 matt */
38 1.22 lukem
39 1.22 lukem #include <sys/cdefs.h>
40 1.53 thorpej __KERNEL_RCSID(0, "$NetBSD: ip_flow.c,v 1.53 2008/04/09 05:14:20 thorpej Exp $");
41 1.1 matt
42 1.1 matt #include <sys/param.h>
43 1.1 matt #include <sys/systm.h>
44 1.1 matt #include <sys/malloc.h>
45 1.1 matt #include <sys/mbuf.h>
46 1.1 matt #include <sys/domain.h>
47 1.1 matt #include <sys/protosw.h>
48 1.1 matt #include <sys/socket.h>
49 1.1 matt #include <sys/socketvar.h>
50 1.1 matt #include <sys/errno.h>
51 1.1 matt #include <sys/time.h>
52 1.1 matt #include <sys/kernel.h>
53 1.7 thorpej #include <sys/pool.h>
54 1.1 matt #include <sys/sysctl.h>
55 1.1 matt
56 1.1 matt #include <net/if.h>
57 1.1 matt #include <net/if_dl.h>
58 1.1 matt #include <net/route.h>
59 1.1 matt #include <net/pfil.h>
60 1.1 matt
61 1.1 matt #include <netinet/in.h>
62 1.1 matt #include <netinet/in_systm.h>
63 1.1 matt #include <netinet/ip.h>
64 1.1 matt #include <netinet/in_pcb.h>
65 1.1 matt #include <netinet/in_var.h>
66 1.1 matt #include <netinet/ip_var.h>
67 1.1 matt
68 1.44 liamjfoy /*
69 1.44 liamjfoy * Similar code is very well commented in netinet6/ip6_flow.c
70 1.44 liamjfoy */
71 1.44 liamjfoy
72 1.53 thorpej struct ipflow {
73 1.53 thorpej LIST_ENTRY(ipflow) ipf_list; /* next in active list */
74 1.53 thorpej LIST_ENTRY(ipflow) ipf_hash; /* next ipflow in bucket */
75 1.53 thorpej struct in_addr ipf_dst; /* destination address */
76 1.53 thorpej struct in_addr ipf_src; /* source address */
77 1.53 thorpej uint8_t ipf_tos; /* type-of-service */
78 1.53 thorpej struct route ipf_ro; /* associated route entry */
79 1.53 thorpej u_long ipf_uses; /* number of uses in this period */
80 1.53 thorpej u_long ipf_last_uses; /* number of uses in last period */
81 1.53 thorpej u_long ipf_dropped; /* ENOBUFS retured by if_output */
82 1.53 thorpej u_long ipf_errors; /* other errors returned by if_output */
83 1.53 thorpej u_int ipf_timer; /* lifetime timer */
84 1.53 thorpej time_t ipf_start; /* creation time */
85 1.53 thorpej };
86 1.53 thorpej
87 1.53 thorpej #define IPFLOW_HASHBITS 6 /* should not be a multiple of 8 */
88 1.53 thorpej
89 1.42 ad POOL_INIT(ipflow_pool, sizeof(struct ipflow), 0, 0, 0, "ipflowpl", NULL,
90 1.42 ad IPL_NET);
91 1.7 thorpej
92 1.5 thorpej LIST_HEAD(ipflowhead, ipflow);
93 1.5 thorpej
94 1.1 matt #define IPFLOW_TIMER (5 * PR_SLOWHZ)
95 1.43 liamjfoy #define IPFLOW_DEFAULT_HASHSIZE (1 << IPFLOW_HASHBITS)
96 1.5 thorpej
97 1.43 liamjfoy static struct ipflowhead *ipflowtable = NULL;
98 1.5 thorpej static struct ipflowhead ipflowlist;
99 1.1 matt static int ipflow_inuse;
100 1.5 thorpej
101 1.5 thorpej #define IPFLOW_INSERT(bucket, ipf) \
102 1.5 thorpej do { \
103 1.5 thorpej LIST_INSERT_HEAD((bucket), (ipf), ipf_hash); \
104 1.5 thorpej LIST_INSERT_HEAD(&ipflowlist, (ipf), ipf_list); \
105 1.26 perry } while (/*CONSTCOND*/ 0)
106 1.5 thorpej
107 1.5 thorpej #define IPFLOW_REMOVE(ipf) \
108 1.5 thorpej do { \
109 1.5 thorpej LIST_REMOVE((ipf), ipf_hash); \
110 1.5 thorpej LIST_REMOVE((ipf), ipf_list); \
111 1.26 perry } while (/*CONSTCOND*/ 0)
112 1.5 thorpej
113 1.3 matt #ifndef IPFLOW_MAX
114 1.1 matt #define IPFLOW_MAX 256
115 1.3 matt #endif
116 1.3 matt int ip_maxflows = IPFLOW_MAX;
117 1.43 liamjfoy int ip_hashsize = IPFLOW_DEFAULT_HASHSIZE;
118 1.1 matt
119 1.45 liamjfoy static size_t
120 1.51 dyoung ipflow_hash(const struct ip *ip)
121 1.1 matt {
122 1.45 liamjfoy size_t hash = ip->ip_tos;
123 1.45 liamjfoy size_t idx;
124 1.45 liamjfoy
125 1.45 liamjfoy for (idx = 0; idx < 32; idx += IPFLOW_HASHBITS) {
126 1.45 liamjfoy hash += (ip->ip_dst.s_addr >> (32 - idx)) +
127 1.45 liamjfoy (ip->ip_src.s_addr >> idx);
128 1.45 liamjfoy }
129 1.45 liamjfoy
130 1.43 liamjfoy return hash & (ip_hashsize-1);
131 1.1 matt }
132 1.1 matt
133 1.1 matt static struct ipflow *
134 1.51 dyoung ipflow_lookup(const struct ip *ip)
135 1.1 matt {
136 1.45 liamjfoy size_t hash;
137 1.1 matt struct ipflow *ipf;
138 1.1 matt
139 1.45 liamjfoy hash = ipflow_hash(ip);
140 1.1 matt
141 1.30 christos LIST_FOREACH(ipf, &ipflowtable[hash], ipf_hash) {
142 1.1 matt if (ip->ip_dst.s_addr == ipf->ipf_dst.s_addr
143 1.1 matt && ip->ip_src.s_addr == ipf->ipf_src.s_addr
144 1.1 matt && ip->ip_tos == ipf->ipf_tos)
145 1.1 matt break;
146 1.1 matt }
147 1.1 matt return ipf;
148 1.1 matt }
149 1.1 matt
150 1.43 liamjfoy int
151 1.43 liamjfoy ipflow_init(int table_size)
152 1.7 thorpej {
153 1.43 liamjfoy struct ipflowhead *new_table;
154 1.45 liamjfoy size_t i;
155 1.7 thorpej
156 1.43 liamjfoy new_table = (struct ipflowhead *)malloc(sizeof(struct ipflowhead) *
157 1.43 liamjfoy table_size, M_RTABLE, M_NOWAIT);
158 1.43 liamjfoy
159 1.43 liamjfoy if (new_table == NULL)
160 1.43 liamjfoy return 1;
161 1.43 liamjfoy
162 1.43 liamjfoy if (ipflowtable != NULL)
163 1.43 liamjfoy free(ipflowtable, M_RTABLE);
164 1.43 liamjfoy
165 1.43 liamjfoy ipflowtable = new_table;
166 1.43 liamjfoy ip_hashsize = table_size;
167 1.43 liamjfoy
168 1.7 thorpej LIST_INIT(&ipflowlist);
169 1.43 liamjfoy for (i = 0; i < ip_hashsize; i++)
170 1.7 thorpej LIST_INIT(&ipflowtable[i]);
171 1.43 liamjfoy
172 1.43 liamjfoy return 0;
173 1.7 thorpej }
174 1.7 thorpej
175 1.1 matt int
176 1.29 perry ipflow_fastforward(struct mbuf *m)
177 1.1 matt {
178 1.51 dyoung struct ip *ip;
179 1.51 dyoung struct ip ip_store;
180 1.1 matt struct ipflow *ipf;
181 1.1 matt struct rtentry *rt;
182 1.40 dyoung const struct sockaddr *dst;
183 1.1 matt int error;
184 1.6 sommerfe int iplen;
185 1.1 matt
186 1.1 matt /*
187 1.1 matt * Are we forwarding packets? Big enough for an IP packet?
188 1.1 matt */
189 1.3 matt if (!ipforwarding || ipflow_inuse == 0 || m->m_len < sizeof(struct ip))
190 1.1 matt return 0;
191 1.14 sommerfe
192 1.14 sommerfe /*
193 1.19 wiz * Was packet received as a link-level multicast or broadcast?
194 1.14 sommerfe * If so, don't try to fast forward..
195 1.14 sommerfe */
196 1.14 sommerfe if ((m->m_flags & (M_BCAST|M_MCAST)) != 0)
197 1.14 sommerfe return 0;
198 1.24 itojun
199 1.1 matt /*
200 1.1 matt * IP header with no option and valid version and length
201 1.1 matt */
202 1.51 dyoung if (IP_HDR_ALIGNED_P(mtod(m, const void *)))
203 1.25 thorpej ip = mtod(m, struct ip *);
204 1.25 thorpej else {
205 1.51 dyoung memcpy(&ip_store, mtod(m, const void *), sizeof(ip_store));
206 1.25 thorpej ip = &ip_store;
207 1.25 thorpej }
208 1.6 sommerfe iplen = ntohs(ip->ip_len);
209 1.5 thorpej if (ip->ip_v != IPVERSION || ip->ip_hl != (sizeof(struct ip) >> 2) ||
210 1.13 proff iplen < sizeof(struct ip) || iplen > m->m_pkthdr.len)
211 1.1 matt return 0;
212 1.1 matt /*
213 1.1 matt * Find a flow.
214 1.1 matt */
215 1.1 matt if ((ipf = ipflow_lookup(ip)) == NULL)
216 1.1 matt return 0;
217 1.1 matt
218 1.1 matt /*
219 1.18 thorpej * Verify the IP header checksum.
220 1.2 thorpej */
221 1.18 thorpej switch (m->m_pkthdr.csum_flags &
222 1.20 thorpej ((m->m_pkthdr.rcvif->if_csum_flags_rx & M_CSUM_IPv4) |
223 1.18 thorpej M_CSUM_IPv4_BAD)) {
224 1.18 thorpej case M_CSUM_IPv4|M_CSUM_IPv4_BAD:
225 1.18 thorpej return (0);
226 1.18 thorpej
227 1.18 thorpej case M_CSUM_IPv4:
228 1.18 thorpej /* Checksum was okay. */
229 1.18 thorpej break;
230 1.18 thorpej
231 1.18 thorpej default:
232 1.18 thorpej /* Must compute it ourselves. */
233 1.18 thorpej if (in_cksum(m, sizeof(struct ip)) != 0)
234 1.18 thorpej return (0);
235 1.18 thorpej break;
236 1.18 thorpej }
237 1.2 thorpej
238 1.2 thorpej /*
239 1.1 matt * Route and interface still up?
240 1.1 matt */
241 1.50 dyoung if ((rt = rtcache_validate(&ipf->ipf_ro)) == NULL ||
242 1.48 dyoung (rt->rt_ifp->if_flags & IFF_UP) == 0)
243 1.1 matt return 0;
244 1.1 matt
245 1.1 matt /*
246 1.1 matt * Packet size OK? TTL?
247 1.1 matt */
248 1.1 matt if (m->m_pkthdr.len > rt->rt_ifp->if_mtu || ip->ip_ttl <= IPTTLDEC)
249 1.1 matt return 0;
250 1.1 matt
251 1.1 matt /*
252 1.18 thorpej * Clear any in-bound checksum flags for this packet.
253 1.18 thorpej */
254 1.18 thorpej m->m_pkthdr.csum_flags = 0;
255 1.18 thorpej
256 1.18 thorpej /*
257 1.1 matt * Everything checks out and so we can forward this packet.
258 1.1 matt * Modify the TTL and incrementally change the checksum.
259 1.24 itojun *
260 1.9 mycroft * This method of adding the checksum works on either endian CPU.
261 1.9 mycroft * If htons() is inlined, all the arithmetic is folded; otherwise
262 1.32 perry * the htons()s are combined by CSE due to the const attribute.
263 1.18 thorpej *
264 1.18 thorpej * Don't bother using HW checksumming here -- the incremental
265 1.18 thorpej * update is pretty fast.
266 1.1 matt */
267 1.1 matt ip->ip_ttl -= IPTTLDEC;
268 1.12 itohy if (ip->ip_sum >= (u_int16_t) ~htons(IPTTLDEC << 8))
269 1.11 mycroft ip->ip_sum -= ~htons(IPTTLDEC << 8);
270 1.8 mycroft else
271 1.2 thorpej ip->ip_sum += htons(IPTTLDEC << 8);
272 1.25 thorpej
273 1.25 thorpej /*
274 1.25 thorpej * Done modifying the header; copy it back, if necessary.
275 1.51 dyoung *
276 1.51 dyoung * XXX Use m_copyback_cow(9) here? --dyoung
277 1.25 thorpej */
278 1.41 christos if (IP_HDR_ALIGNED_P(mtod(m, void *)) == 0)
279 1.41 christos memcpy(mtod(m, void *), &ip_store, sizeof(ip_store));
280 1.6 sommerfe
281 1.6 sommerfe /*
282 1.24 itojun * Trim the packet in case it's too long..
283 1.6 sommerfe */
284 1.6 sommerfe if (m->m_pkthdr.len > iplen) {
285 1.6 sommerfe if (m->m_len == m->m_pkthdr.len) {
286 1.6 sommerfe m->m_len = iplen;
287 1.6 sommerfe m->m_pkthdr.len = iplen;
288 1.6 sommerfe } else
289 1.6 sommerfe m_adj(m, iplen - m->m_pkthdr.len);
290 1.2 thorpej }
291 1.1 matt
292 1.1 matt /*
293 1.1 matt * Send the packet on it's way. All we can get back is ENOBUFS
294 1.1 matt */
295 1.1 matt ipf->ipf_uses++;
296 1.5 thorpej PRT_SLOW_ARM(ipf->ipf_timer, IPFLOW_TIMER);
297 1.16 thorpej
298 1.16 thorpej if (rt->rt_flags & RTF_GATEWAY)
299 1.16 thorpej dst = rt->rt_gateway;
300 1.16 thorpej else
301 1.40 dyoung dst = rtcache_getdst(&ipf->ipf_ro);
302 1.16 thorpej
303 1.16 thorpej if ((error = (*rt->rt_ifp->if_output)(rt->rt_ifp, m, dst, rt)) != 0) {
304 1.1 matt if (error == ENOBUFS)
305 1.1 matt ipf->ipf_dropped++;
306 1.1 matt else
307 1.1 matt ipf->ipf_errors++;
308 1.1 matt }
309 1.1 matt return 1;
310 1.1 matt }
311 1.1 matt
312 1.1 matt static void
314 1.1 matt ipflow_addstats(struct ipflow *ipf)
315 1.49 dyoung {
316 1.49 dyoung struct rtentry *rt;
317 1.50 dyoung
318 1.49 dyoung if ((rt = rtcache_validate(&ipf->ipf_ro)) != NULL)
319 1.52 thorpej rt->rt_use += ipf->ipf_uses;
320 1.52 thorpej ipstat[IP_STAT_CANTFORWARD] += ipf->ipf_errors + ipf->ipf_dropped;
321 1.52 thorpej ipstat[IP_STAT_TOTAL] += ipf->ipf_uses;
322 1.52 thorpej ipstat[IP_STAT_FORWARD] += ipf->ipf_uses;
323 1.1 matt ipstat[IP_STAT_FASTFORWARD] += ipf->ipf_uses;
324 1.1 matt }
325 1.1 matt
326 1.29 perry static void
327 1.1 matt ipflow_free(struct ipflow *ipf)
328 1.1 matt {
329 1.1 matt int s;
330 1.1 matt /*
331 1.1 matt * Remove the flow from the hash table (at elevated IPL).
332 1.1 matt * Once it's off the list, we can deal with it at normal
333 1.1 matt * network IPL.
334 1.17 thorpej */
335 1.5 thorpej s = splnet();
336 1.1 matt IPFLOW_REMOVE(ipf);
337 1.1 matt splx(s);
338 1.38 joerg ipflow_addstats(ipf);
339 1.1 matt rtcache_free(&ipf->ipf_ro);
340 1.35 tls ipflow_inuse--;
341 1.7 thorpej s = splnet();
342 1.35 tls pool_put(&ipflow_pool, ipf);
343 1.1 matt splx(s);
344 1.1 matt }
345 1.53 thorpej
346 1.53 thorpej static struct ipflow *
347 1.1 matt ipflow_reap(bool just_one)
348 1.3 matt {
349 1.3 matt while (just_one || ipflow_inuse > ip_maxflows) {
350 1.3 matt struct ipflow *ipf, *maybe_ipf = NULL;
351 1.3 matt int s;
352 1.5 thorpej
353 1.5 thorpej ipf = LIST_FIRST(&ipflowlist);
354 1.5 thorpej while (ipf != NULL) {
355 1.5 thorpej /*
356 1.5 thorpej * If this no longer points to a valid route
357 1.5 thorpej * reclaim it.
358 1.50 dyoung */
359 1.5 thorpej if (rtcache_validate(&ipf->ipf_ro) == NULL)
360 1.5 thorpej goto done;
361 1.5 thorpej /*
362 1.5 thorpej * choose the one that's been least recently
363 1.5 thorpej * used or has had the least uses in the
364 1.5 thorpej * last 1.5 intervals.
365 1.5 thorpej */
366 1.5 thorpej if (maybe_ipf == NULL ||
367 1.5 thorpej ipf->ipf_timer < maybe_ipf->ipf_timer ||
368 1.5 thorpej (ipf->ipf_timer == maybe_ipf->ipf_timer &&
369 1.5 thorpej ipf->ipf_last_uses + ipf->ipf_uses <
370 1.5 thorpej maybe_ipf->ipf_last_uses +
371 1.5 thorpej maybe_ipf->ipf_uses))
372 1.5 thorpej maybe_ipf = ipf;
373 1.1 matt ipf = LIST_NEXT(ipf, ipf_list);
374 1.3 matt }
375 1.3 matt ipf = maybe_ipf;
376 1.3 matt done:
377 1.3 matt /*
378 1.3 matt * Remove the entry from the flow table.
379 1.17 thorpej */
380 1.5 thorpej s = splnet();
381 1.3 matt IPFLOW_REMOVE(ipf);
382 1.3 matt splx(s);
383 1.38 joerg ipflow_addstats(ipf);
384 1.3 matt rtcache_free(&ipf->ipf_ro);
385 1.3 matt if (just_one)
386 1.7 thorpej return ipf;
387 1.3 matt pool_put(&ipflow_pool, ipf);
388 1.1 matt ipflow_inuse--;
389 1.3 matt }
390 1.1 matt return NULL;
391 1.1 matt }
392 1.1 matt
393 1.53 thorpej void
394 1.53 thorpej ipflow_prune(void)
395 1.53 thorpej {
396 1.53 thorpej
397 1.53 thorpej (void) ipflow_reap(false);
398 1.53 thorpej }
399 1.53 thorpej
400 1.29 perry void
401 1.1 matt ipflow_slowtimo(void)
402 1.49 dyoung {
403 1.5 thorpej struct rtentry *rt;
404 1.2 thorpej struct ipflow *ipf, *next_ipf;
405 1.30 christos
406 1.5 thorpej for (ipf = LIST_FIRST(&ipflowlist); ipf != NULL; ipf = next_ipf) {
407 1.37 dyoung next_ipf = LIST_NEXT(ipf, ipf_list);
408 1.50 dyoung if (PRT_SLOW_ISEXPIRED(ipf->ipf_timer) ||
409 1.5 thorpej (rt = rtcache_validate(&ipf->ipf_ro)) == NULL) {
410 1.5 thorpej ipflow_free(ipf);
411 1.5 thorpej } else {
412 1.49 dyoung ipf->ipf_last_uses = ipf->ipf_uses;
413 1.52 thorpej rt->rt_use += ipf->ipf_uses;
414 1.52 thorpej ipstat[IP_STAT_TOTAL] += ipf->ipf_uses;
415 1.52 thorpej ipstat[IP_STAT_FORWARD] += ipf->ipf_uses;
416 1.5 thorpej ipstat[IP_STAT_FASTFORWARD] += ipf->ipf_uses;
417 1.1 matt ipf->ipf_uses = 0;
418 1.1 matt }
419 1.1 matt }
420 1.1 matt }
421 1.1 matt
422 1.29 perry void
423 1.1 matt ipflow_create(const struct route *ro, struct mbuf *m)
424 1.51 dyoung {
425 1.1 matt const struct ip *const ip = mtod(m, const struct ip *);
426 1.45 liamjfoy struct ipflow *ipf;
427 1.1 matt size_t hash;
428 1.1 matt int s;
429 1.1 matt
430 1.1 matt /*
431 1.1 matt * Don't create cache entries for ICMP messages.
432 1.3 matt */
433 1.1 matt if (ip_maxflows == 0 || ip->ip_p == IPPROTO_ICMP)
434 1.1 matt return;
435 1.1 matt /*
436 1.1 matt * See if an existing flow struct exists. If so remove it from it's
437 1.1 matt * list and free the old route. If not, try to malloc a new one
438 1.1 matt * (if we aren't at our limit).
439 1.1 matt */
440 1.1 matt ipf = ipflow_lookup(ip);
441 1.3 matt if (ipf == NULL) {
442 1.53 thorpej if (ipflow_inuse >= ip_maxflows) {
443 1.1 matt ipf = ipflow_reap(true);
444 1.36 mrg } else {
445 1.7 thorpej s = splnet();
446 1.35 tls ipf = pool_get(&ipflow_pool, PR_NOWAIT);
447 1.1 matt splx(s);
448 1.1 matt if (ipf == NULL)
449 1.1 matt return;
450 1.1 matt ipflow_inuse++;
451 1.39 dyoung }
452 1.1 matt memset(ipf, 0, sizeof(*ipf));
453 1.17 thorpej } else {
454 1.5 thorpej s = splnet();
455 1.1 matt IPFLOW_REMOVE(ipf);
456 1.1 matt splx(s);
457 1.38 joerg ipflow_addstats(ipf);
458 1.1 matt rtcache_free(&ipf->ipf_ro);
459 1.1 matt ipf->ipf_uses = ipf->ipf_last_uses = 0;
460 1.1 matt ipf->ipf_errors = ipf->ipf_dropped = 0;
461 1.1 matt }
462 1.1 matt
463 1.1 matt /*
464 1.1 matt * Fill in the updated information.
465 1.46 dyoung */
466 1.1 matt rtcache_copy(&ipf->ipf_ro, ro);
467 1.1 matt ipf->ipf_dst = ip->ip_dst;
468 1.1 matt ipf->ipf_src = ip->ip_src;
469 1.5 thorpej ipf->ipf_tos = ip->ip_tos;
470 1.33 kardel PRT_SLOW_ARM(ipf->ipf_timer, IPFLOW_TIMER);
471 1.1 matt ipf->ipf_start = time_uptime;
472 1.1 matt /*
473 1.1 matt * Insert into the approriate bucket of the flow table.
474 1.45 liamjfoy */
475 1.17 thorpej hash = ipflow_hash(ip);
476 1.5 thorpej s = splnet();
477 1.27 scw IPFLOW_INSERT(&ipflowtable[hash], ipf);
478 1.27 scw splx(s);
479 1.27 scw }
480 1.43 liamjfoy
481 1.43 liamjfoy int
482 1.27 scw ipflow_invalidate_all(int new_size)
483 1.27 scw {
484 1.43 liamjfoy struct ipflow *ipf, *next_ipf;
485 1.27 scw int s, error;
486 1.43 liamjfoy
487 1.27 scw error = 0;
488 1.27 scw s = splnet();
489 1.27 scw for (ipf = LIST_FIRST(&ipflowlist); ipf != NULL; ipf = next_ipf) {
490 1.27 scw next_ipf = LIST_NEXT(ipf, ipf_list);
491 1.27 scw ipflow_free(ipf);
492 1.43 liamjfoy }
493 1.43 liamjfoy
494 1.43 liamjfoy if (new_size)
495 1.1 matt error = ipflow_init(new_size);
496 1.43 liamjfoy splx(s);
497 1.43 liamjfoy
498 1.1 matt return error;
499 }
500