if_llatbl.h revision 1.14 1 1.14 ozaki /* $NetBSD: if_llatbl.h,v 1.14 2018/03/06 07:27:55 ozaki-r Exp $ */
2 1.1 ozaki /*
3 1.1 ozaki * Copyright (c) 2004 Luigi Rizzo, Alessandro Cerri. All rights reserved.
4 1.1 ozaki * Copyright (c) 2004-2008 Qing Li. All rights reserved.
5 1.1 ozaki * Copyright (c) 2008 Kip Macy. All rights reserved.
6 1.1 ozaki * Copyright (c) 2015 The NetBSD Foundation, Inc.
7 1.1 ozaki * All rights reserved.
8 1.1 ozaki *
9 1.1 ozaki * Redistribution and use in source and binary forms, with or without
10 1.1 ozaki * modification, are permitted provided that the following conditions
11 1.1 ozaki * are met:
12 1.1 ozaki * 1. Redistributions of source code must retain the above copyright
13 1.1 ozaki * notice, this list of conditions and the following disclaimer.
14 1.1 ozaki * 2. Redistributions in binary form must reproduce the above copyright
15 1.1 ozaki * notice, this list of conditions and the following disclaimer in the
16 1.1 ozaki * documentation and/or other materials provided with the distribution.
17 1.1 ozaki *
18 1.1 ozaki * THIS SOFTWARE IS PROVIDED BY AUTHOR AND CONTRIBUTORS ``AS IS'' AND
19 1.1 ozaki * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
20 1.1 ozaki * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
21 1.1 ozaki * ARE DISCLAIMED. IN NO EVENT SHALL AUTHOR OR CONTRIBUTORS BE LIABLE
22 1.1 ozaki * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
23 1.1 ozaki * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
24 1.1 ozaki * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
25 1.1 ozaki * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
26 1.1 ozaki * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
27 1.1 ozaki * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
28 1.1 ozaki * SUCH DAMAGE.
29 1.1 ozaki */
30 1.1 ozaki #include <sys/cdefs.h>
31 1.1 ozaki
32 1.1 ozaki #ifndef _NET_IF_LLATBL_H_
33 1.1 ozaki #define _NET_IF_LLATBL_H_
34 1.1 ozaki
35 1.3 ozaki #if defined(_KERNEL_OPT)
36 1.3 ozaki #include "opt_gateway.h"
37 1.3 ozaki #endif
38 1.3 ozaki
39 1.1 ozaki #include <sys/rwlock.h>
40 1.3 ozaki
41 1.1 ozaki #include <netinet/in.h>
42 1.1 ozaki
43 1.1 ozaki struct ifnet;
44 1.1 ozaki struct sysctl_req;
45 1.1 ozaki struct rt_msghdr;
46 1.1 ozaki struct rt_addrinfo;
47 1.9 ozaki struct rt_walkarg;
48 1.1 ozaki
49 1.1 ozaki struct llentry;
50 1.1 ozaki LIST_HEAD(llentries, llentry);
51 1.1 ozaki
52 1.1 ozaki extern krwlock_t lltable_rwlock;
53 1.1 ozaki #define LLTABLE_RLOCK() rw_enter(&lltable_rwlock, RW_READER)
54 1.1 ozaki #define LLTABLE_RUNLOCK() rw_exit(&lltable_rwlock)
55 1.1 ozaki #define LLTABLE_WLOCK() rw_enter(&lltable_rwlock, RW_WRITER)
56 1.1 ozaki #define LLTABLE_WUNLOCK() rw_exit(&lltable_rwlock)
57 1.1 ozaki #define LLTABLE_LOCK_ASSERT() KASSERT(rw_lock_held(&lltable_rwlock))
58 1.1 ozaki
59 1.1 ozaki /*
60 1.1 ozaki * Code referencing llentry must at least hold
61 1.1 ozaki * a shared lock
62 1.1 ozaki */
63 1.1 ozaki struct llentry {
64 1.1 ozaki LIST_ENTRY(llentry) lle_next;
65 1.1 ozaki union {
66 1.1 ozaki struct in_addr addr4;
67 1.1 ozaki struct in6_addr addr6;
68 1.1 ozaki } r_l3addr;
69 1.1 ozaki union {
70 1.1 ozaki uint64_t mac_aligned;
71 1.1 ozaki uint16_t mac16[3];
72 1.1 ozaki uint8_t mac8[20]; /* IB needs 20 bytes. */
73 1.1 ozaki } ll_addr;
74 1.1 ozaki uint32_t spare0;
75 1.1 ozaki uint64_t spare1;
76 1.1 ozaki
77 1.1 ozaki struct lltable *lle_tbl;
78 1.1 ozaki struct llentries *lle_head;
79 1.1 ozaki void (*lle_free)(struct llentry *);
80 1.7 ozaki void (*lle_ll_free)(struct llentry *);
81 1.1 ozaki struct mbuf *la_hold;
82 1.1 ozaki int la_numheld; /* # of packets currently held */
83 1.1 ozaki time_t la_expire;
84 1.1 ozaki uint16_t la_flags;
85 1.1 ozaki uint16_t la_asked;
86 1.1 ozaki uint16_t la_preempt;
87 1.1 ozaki uint16_t ln_byhint;
88 1.1 ozaki int16_t ln_state; /* IPv6 has ND6_LLINFO_NOSTATE == -2 */
89 1.1 ozaki uint16_t ln_router;
90 1.1 ozaki time_t ln_ntick;
91 1.1 ozaki int lle_refcnt;
92 1.1 ozaki
93 1.1 ozaki LIST_ENTRY(llentry) lle_chain; /* chain of deleted items */
94 1.1 ozaki struct callout lle_timer;
95 1.1 ozaki krwlock_t lle_lock;
96 1.1 ozaki
97 1.1 ozaki #ifdef __NetBSD__
98 1.1 ozaki #define la_timer lle_timer
99 1.6 ozaki #define ln_timer_ch lle_timer
100 1.6 ozaki #define ln_expire la_expire
101 1.6 ozaki #define ln_asked la_asked
102 1.6 ozaki #define ln_hold la_hold
103 1.1 ozaki void *la_opaque; /* For tokenring */
104 1.1 ozaki #endif
105 1.1 ozaki };
106 1.1 ozaki
107 1.2 ozaki
108 1.2 ozaki #if 0
109 1.5 ozaki #define LLE_LOCK_TRACE(t, lle) aprint_normal( \
110 1.5 ozaki "%s:%d: LOCK(" #t "): lle=%p\n", \
111 1.5 ozaki __func__, __LINE__, (lle))
112 1.2 ozaki #else
113 1.5 ozaki #define LLE_LOCK_TRACE(t, lle) do {} while (0)
114 1.2 ozaki #endif
115 1.2 ozaki
116 1.2 ozaki #define LLE_WLOCK(lle) do { \
117 1.5 ozaki LLE_LOCK_TRACE(WL, (lle)); \
118 1.2 ozaki rw_enter(&(lle)->lle_lock, RW_WRITER); \
119 1.2 ozaki } while (0)
120 1.2 ozaki #define LLE_RLOCK(lle) do { \
121 1.5 ozaki LLE_LOCK_TRACE(RL, (lle)); \
122 1.2 ozaki rw_enter(&(lle)->lle_lock, RW_READER); \
123 1.2 ozaki } while (0)
124 1.2 ozaki #define LLE_WUNLOCK(lle) do { \
125 1.5 ozaki LLE_LOCK_TRACE(WU, (lle)); \
126 1.2 ozaki rw_exit(&(lle)->lle_lock); \
127 1.2 ozaki } while (0)
128 1.2 ozaki #define LLE_RUNLOCK(lle) do { \
129 1.5 ozaki LLE_LOCK_TRACE(RU, (lle)); \
130 1.2 ozaki rw_exit(&(lle)->lle_lock); \
131 1.2 ozaki } while (0)
132 1.1 ozaki #define LLE_DOWNGRADE(lle) rw_downgrade(&(lle)->lle_lock)
133 1.1 ozaki #define LLE_TRY_UPGRADE(lle) rw_tryupgrade(&(lle)->lle_lock)
134 1.1 ozaki #ifdef __FreeBSD__
135 1.1 ozaki #define LLE_LOCK_INIT(lle) rw_init_flags(&(lle)->lle_lock, "lle", RW_DUPOK)
136 1.1 ozaki #else /* XXX */
137 1.1 ozaki #define LLE_LOCK_INIT(lle) rw_init(&(lle)->lle_lock)
138 1.1 ozaki #endif
139 1.1 ozaki #define LLE_LOCK_DESTROY(lle) rw_destroy(&(lle)->lle_lock)
140 1.2 ozaki #define LLE_WLOCK_ASSERT(lle) KASSERT(rw_write_held(&(lle)->lle_lock))
141 1.1 ozaki
142 1.1 ozaki #define LLE_IS_VALID(lle) (((lle) != NULL) && ((lle) != (void *)-1))
143 1.1 ozaki
144 1.5 ozaki #if 0
145 1.5 ozaki #define LLE_REF_TRACE(t, n) aprint_normal("%s:%d: REF(" #t "): refcnt=%d\n", \
146 1.5 ozaki __func__, __LINE__, (n))
147 1.5 ozaki #else
148 1.5 ozaki #define LLE_REF_TRACE(t, n) do {} while (0)
149 1.5 ozaki #endif
150 1.5 ozaki
151 1.1 ozaki #define LLE_ADDREF(lle) do { \
152 1.1 ozaki LLE_WLOCK_ASSERT(lle); \
153 1.5 ozaki LLE_REF_TRACE(ADD, (lle)->lle_refcnt); \
154 1.1 ozaki KASSERTMSG((lle)->lle_refcnt >= 0, \
155 1.1 ozaki "negative refcnt %d on lle %p", \
156 1.1 ozaki (lle)->lle_refcnt, (lle)); \
157 1.1 ozaki (lle)->lle_refcnt++; \
158 1.1 ozaki } while (0)
159 1.1 ozaki
160 1.1 ozaki #define LLE_REMREF(lle) do { \
161 1.1 ozaki LLE_WLOCK_ASSERT(lle); \
162 1.5 ozaki LLE_REF_TRACE(REM, (lle)->lle_refcnt); \
163 1.1 ozaki KASSERTMSG((lle)->lle_refcnt > 0, \
164 1.1 ozaki "bogus refcnt %d on lle %p", \
165 1.1 ozaki (lle)->lle_refcnt, (lle)); \
166 1.1 ozaki (lle)->lle_refcnt--; \
167 1.5 ozaki if ((lle)->lle_refcnt == 0) \
168 1.5 ozaki LLE_REF_TRACE(ZERO, (lle)->lle_refcnt); \
169 1.1 ozaki } while (0)
170 1.1 ozaki
171 1.1 ozaki #define LLE_FREE_LOCKED(lle) do { \
172 1.7 ozaki if ((lle)->lle_refcnt == 1) { \
173 1.7 ozaki if ((lle)->lle_ll_free != NULL) \
174 1.7 ozaki (lle)->lle_ll_free(lle); \
175 1.1 ozaki (lle)->lle_free(lle); \
176 1.7 ozaki } else { \
177 1.1 ozaki LLE_REMREF(lle); \
178 1.1 ozaki LLE_WUNLOCK(lle); \
179 1.1 ozaki } \
180 1.1 ozaki /* guard against invalid refs */ \
181 1.1 ozaki (lle) = NULL; \
182 1.1 ozaki } while (0)
183 1.1 ozaki
184 1.1 ozaki #define LLE_FREE(lle) do { \
185 1.1 ozaki LLE_WLOCK(lle); \
186 1.1 ozaki LLE_FREE_LOCKED(lle); \
187 1.1 ozaki } while (0)
188 1.1 ozaki
189 1.1 ozaki
190 1.1 ozaki typedef struct llentry *(llt_lookup_t)(struct lltable *, u_int flags,
191 1.1 ozaki const struct sockaddr *l3addr);
192 1.1 ozaki typedef struct llentry *(llt_create_t)(struct lltable *, u_int flags,
193 1.13 ozaki const struct sockaddr *l3addr, const struct rtentry *);
194 1.1 ozaki typedef int (llt_delete_t)(struct lltable *, u_int flags,
195 1.1 ozaki const struct sockaddr *l3addr);
196 1.1 ozaki typedef void (llt_prefix_free_t)(struct lltable *,
197 1.1 ozaki const struct sockaddr *prefix, const struct sockaddr *mask, u_int flags);
198 1.1 ozaki typedef int (llt_dump_entry_t)(struct lltable *, struct llentry *,
199 1.9 ozaki struct rt_walkarg *);
200 1.1 ozaki typedef uint32_t (llt_hash_t)(const struct llentry *, uint32_t);
201 1.1 ozaki typedef int (llt_match_prefix_t)(const struct sockaddr *,
202 1.1 ozaki const struct sockaddr *, u_int, struct llentry *);
203 1.1 ozaki typedef void (llt_free_entry_t)(struct lltable *, struct llentry *);
204 1.1 ozaki typedef void (llt_fill_sa_entry_t)(const struct llentry *, struct sockaddr *);
205 1.1 ozaki typedef void (llt_free_tbl_t)(struct lltable *);
206 1.1 ozaki typedef void (llt_link_entry_t)(struct lltable *, struct llentry *);
207 1.1 ozaki typedef void (llt_unlink_entry_t)(struct llentry *);
208 1.1 ozaki
209 1.1 ozaki typedef int (llt_foreach_cb_t)(struct lltable *, struct llentry *, void *);
210 1.1 ozaki typedef int (llt_foreach_entry_t)(struct lltable *, llt_foreach_cb_t *, void *);
211 1.1 ozaki
212 1.1 ozaki struct lltable {
213 1.1 ozaki SLIST_ENTRY(lltable) llt_link;
214 1.1 ozaki int llt_af;
215 1.1 ozaki int llt_hsize;
216 1.1 ozaki struct llentries *lle_head;
217 1.6 ozaki unsigned int llt_lle_count;
218 1.1 ozaki struct ifnet *llt_ifp;
219 1.1 ozaki
220 1.1 ozaki llt_lookup_t *llt_lookup;
221 1.1 ozaki llt_create_t *llt_create;
222 1.1 ozaki llt_delete_t *llt_delete;
223 1.1 ozaki llt_prefix_free_t *llt_prefix_free;
224 1.1 ozaki llt_dump_entry_t *llt_dump_entry;
225 1.1 ozaki llt_hash_t *llt_hash;
226 1.1 ozaki llt_match_prefix_t *llt_match_prefix;
227 1.1 ozaki llt_free_entry_t *llt_free_entry;
228 1.1 ozaki llt_foreach_entry_t *llt_foreach_entry;
229 1.1 ozaki llt_link_entry_t *llt_link_entry;
230 1.1 ozaki llt_unlink_entry_t *llt_unlink_entry;
231 1.1 ozaki llt_fill_sa_entry_t *llt_fill_sa_entry;
232 1.1 ozaki llt_free_tbl_t *llt_free_tbl;
233 1.1 ozaki };
234 1.1 ozaki
235 1.1 ozaki MALLOC_DECLARE(M_LLTABLE);
236 1.1 ozaki
237 1.1 ozaki /*
238 1.1 ozaki * LLentry flags
239 1.1 ozaki */
240 1.1 ozaki #define LLE_DELETED 0x0001 /* entry must be deleted */
241 1.1 ozaki #define LLE_STATIC 0x0002 /* entry is static */
242 1.1 ozaki #define LLE_IFADDR 0x0004 /* entry is interface addr */
243 1.1 ozaki #define LLE_VALID 0x0008 /* ll_addr is valid */
244 1.1 ozaki #define LLE_PUB 0x0020 /* publish entry ??? */
245 1.1 ozaki #define LLE_LINKED 0x0040 /* linked to lookup structure */
246 1.1 ozaki /* LLE request flags */
247 1.1 ozaki #define LLE_EXCLUSIVE 0x2000 /* return lle xlocked */
248 1.1 ozaki
249 1.1 ozaki #define LLATBL_HASH(key, mask) \
250 1.1 ozaki (((((((key >> 8) ^ key) >> 8) ^ key) >> 8) ^ key) & mask)
251 1.1 ozaki
252 1.1 ozaki void lltableinit(void);
253 1.1 ozaki
254 1.1 ozaki struct lltable *lltable_allocate_htbl(uint32_t hsize);
255 1.1 ozaki void lltable_free(struct lltable *);
256 1.1 ozaki void lltable_link(struct lltable *llt);
257 1.11 ozaki void lltable_prefix_free(const int, const struct sockaddr *,
258 1.11 ozaki const struct sockaddr *, const u_int);
259 1.1 ozaki void lltable_drain(int);
260 1.6 ozaki void lltable_purge_entries(struct lltable *);
261 1.12 ozaki int lltable_sysctl_dump(int, struct rt_walkarg *);
262 1.9 ozaki int lltable_dump_entry(struct lltable *, struct llentry *,
263 1.9 ozaki struct rt_walkarg *, struct sockaddr *);
264 1.1 ozaki
265 1.1 ozaki size_t llentry_free(struct llentry *);
266 1.1 ozaki struct llentry *llentry_alloc(struct ifnet *, struct lltable *,
267 1.1 ozaki struct sockaddr_storage *);
268 1.1 ozaki
269 1.14 ozaki struct llentry *llentry_pool_get(int);
270 1.14 ozaki void llentry_pool_put(struct llentry *);
271 1.14 ozaki
272 1.1 ozaki /* helper functions */
273 1.1 ozaki size_t lltable_drop_entry_queue(struct llentry *);
274 1.1 ozaki
275 1.1 ozaki struct llentry *lltable_create_lle(struct lltable *llt, u_int flags,
276 1.1 ozaki const void *paddr);
277 1.1 ozaki void lltable_link_entry(struct lltable *llt, struct llentry *lle);
278 1.1 ozaki void lltable_unlink_entry(struct lltable *llt, struct llentry *lle);
279 1.10 ozaki void lltable_free_entry(struct lltable *llt, struct llentry *lle);
280 1.1 ozaki void lltable_fill_sa_entry(const struct llentry *lle, struct sockaddr *sa);
281 1.1 ozaki struct ifnet *lltable_get_ifp(const struct lltable *llt);
282 1.1 ozaki int lltable_get_af(const struct lltable *llt);
283 1.1 ozaki
284 1.6 ozaki static inline unsigned int
285 1.6 ozaki lltable_get_entry_count(struct lltable *llt)
286 1.6 ozaki {
287 1.6 ozaki return llt->llt_lle_count;
288 1.6 ozaki }
289 1.6 ozaki
290 1.1 ozaki int lltable_foreach_lle(struct lltable *llt, llt_foreach_cb_t *f,
291 1.1 ozaki void *farg);
292 1.1 ozaki /*
293 1.1 ozaki * Generic link layer address lookup function.
294 1.1 ozaki */
295 1.1 ozaki static __inline struct llentry *
296 1.1 ozaki lla_lookup(struct lltable *llt, u_int flags, const struct sockaddr *l3addr)
297 1.1 ozaki {
298 1.1 ozaki
299 1.1 ozaki return (llt->llt_lookup(llt, flags, l3addr));
300 1.1 ozaki }
301 1.1 ozaki
302 1.1 ozaki static __inline struct llentry *
303 1.13 ozaki lla_create(struct lltable *llt, u_int flags, const struct sockaddr *l3addr,
304 1.13 ozaki const struct rtentry *rt)
305 1.1 ozaki {
306 1.1 ozaki
307 1.13 ozaki return (llt->llt_create(llt, flags, l3addr, rt));
308 1.1 ozaki }
309 1.1 ozaki
310 1.1 ozaki static __inline int
311 1.1 ozaki lla_delete(struct lltable *llt, u_int flags, const struct sockaddr *l3addr)
312 1.1 ozaki {
313 1.1 ozaki
314 1.1 ozaki return (llt->llt_delete(llt, flags, l3addr));
315 1.1 ozaki }
316 1.1 ozaki
317 1.1 ozaki
318 1.9 ozaki int lla_rt_output(const u_char, const int, const time_t,
319 1.9 ozaki struct rt_addrinfo *info, int);
320 1.1 ozaki
321 1.1 ozaki #endif /* _NET_IF_LLATBL_H_ */
322