1 /* 2 * Copyright (c) 2004 Luigi Rizzo, Alessandro Cerri. All rights reserved. 3 * Copyright (c) 2004-2008 Qing Li. All rights reserved. 4 * Copyright (c) 2008 Kip Macy. All rights reserved. 5 * 6 * Redistribution and use in source and binary forms, with or without 7 * modification, are permitted provided that the following conditions 8 * are met: 9 * 1. Redistributions of source code must retain the above copyright 10 * notice, this list of conditions and the following disclaimer. 11 * 2. Redistributions in binary form must reproduce the above copyright 12 * notice, this list of conditions and the following disclaimer in the 13 * documentation and/or other materials provided with the distribution. 14 * 15 * THIS SOFTWARE IS PROVIDED BY AUTHOR AND CONTRIBUTORS ``AS IS'' AND 16 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 17 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 18 * ARE DISCLAIMED. IN NO EVENT SHALL AUTHOR OR CONTRIBUTORS BE LIABLE 19 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 20 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 21 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 22 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 23 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 24 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 25 * SUCH DAMAGE. 26 */ 27 #include <sys/cdefs.h> 28 __FBSDID("$FreeBSD$"); 29 30 #ifndef _NET_IF_LLATBL_H_ 31 #define _NET_IF_LLATBL_H_ 32 33 #include <sys/_rwlock.h> 34 #include <netinet/in.h> 35 36 struct ifnet; 37 struct sysctl_req; 38 struct rt_msghdr; 39 struct rt_addrinfo; 40 41 struct llentry; 42 LIST_HEAD(llentries, llentry); 43 44 extern struct rwlock lltable_rwlock; 45 #define LLTABLE_RLOCK() rw_rlock(&lltable_rwlock) 46 #define LLTABLE_RUNLOCK() rw_runlock(&lltable_rwlock) 47 #define LLTABLE_WLOCK() rw_wlock(&lltable_rwlock) 48 #define LLTABLE_WUNLOCK() rw_wunlock(&lltable_rwlock) 49 #define LLTABLE_LOCK_ASSERT() rw_assert(&lltable_rwlock, RA_LOCKED) 50 51 /* 52 * Code referencing llentry must at least hold 53 * a shared lock 54 */ 55 struct llentry { 56 LIST_ENTRY(llentry) lle_next; 57 union { 58 struct in_addr addr4; 59 struct in6_addr addr6; 60 } r_l3addr; 61 union { 62 uint64_t mac_aligned; 63 uint16_t mac16[3]; 64 uint8_t mac8[20]; /* IB needs 20 bytes. */ 65 } ll_addr; 66 uint16_t r_flags; /* LLE runtime flags */ 67 uint16_t r_skip_req; /* feedback from fast path */ 68 uint64_t spare1; 69 70 struct lltable *lle_tbl; 71 struct llentries *lle_head; 72 void (*lle_free)(struct llentry *); 73 struct mbuf *la_hold; 74 int la_numheld; /* # of packets currently held */ 75 time_t la_expire; 76 uint16_t la_flags; 77 uint16_t la_asked; 78 uint16_t la_preempt; 79 int16_t ln_state; /* IPv6 has ND6_LLINFO_NOSTATE == -2 */ 80 uint16_t ln_router; 81 time_t ln_ntick; 82 int lle_refcnt; 83 84 LIST_ENTRY(llentry) lle_chain; /* chain of deleted items */ 85 struct callout lle_timer; 86 struct rwlock lle_lock; 87 struct mtx req_mtx; 88 }; 89 90 #define LLE_WLOCK(lle) rw_wlock(&(lle)->lle_lock) 91 #define LLE_RLOCK(lle) rw_rlock(&(lle)->lle_lock) 92 #define LLE_WUNLOCK(lle) rw_wunlock(&(lle)->lle_lock) 93 #define LLE_RUNLOCK(lle) rw_runlock(&(lle)->lle_lock) 94 #define LLE_DOWNGRADE(lle) rw_downgrade(&(lle)->lle_lock) 95 #define LLE_TRY_UPGRADE(lle) rw_try_upgrade(&(lle)->lle_lock) 96 #define LLE_LOCK_INIT(lle) rw_init_flags(&(lle)->lle_lock, "lle", RW_DUPOK) 97 #define LLE_LOCK_DESTROY(lle) rw_destroy(&(lle)->lle_lock) 98 #define LLE_WLOCK_ASSERT(lle) rw_assert(&(lle)->lle_lock, RA_WLOCKED) 99 100 #define LLE_REQ_INIT(lle) mtx_init(&(lle)->req_mtx, "lle req", \ 101 NULL, MTX_DEF) 102 #define LLE_REQ_DESTROY(lle) mtx_destroy(&(lle)->req_mtx) 103 #define LLE_REQ_LOCK(lle) mtx_lock(&(lle)->req_mtx) 104 #define LLE_REQ_UNLOCK(lle) mtx_unlock(&(lle)->req_mtx) 105 106 #define LLE_IS_VALID(lle) (((lle) != NULL) && ((lle) != (void *)-1)) 107 108 #define LLE_ADDREF(lle) do { \ 109 LLE_WLOCK_ASSERT(lle); \ 110 KASSERT((lle)->lle_refcnt >= 0, \ 111 ("negative refcnt %d on lle %p", \ 112 (lle)->lle_refcnt, (lle))); \ 113 (lle)->lle_refcnt++; \ 114 } while (0) 115 116 #define LLE_REMREF(lle) do { \ 117 LLE_WLOCK_ASSERT(lle); \ 118 KASSERT((lle)->lle_refcnt > 0, \ 119 ("bogus refcnt %d on lle %p", \ 120 (lle)->lle_refcnt, (lle))); \ 121 (lle)->lle_refcnt--; \ 122 } while (0) 123 124 #define LLE_FREE_LOCKED(lle) do { \ 125 if ((lle)->lle_refcnt == 1) \ 126 (lle)->lle_free(lle); \ 127 else { \ 128 LLE_REMREF(lle); \ 129 LLE_WUNLOCK(lle); \ 130 } \ 131 /* guard against invalid refs */ \ 132 (lle) = NULL; \ 133 } while (0) 134 135 #define LLE_FREE(lle) do { \ 136 LLE_WLOCK(lle); \ 137 LLE_FREE_LOCKED(lle); \ 138 } while (0) 139 140 141 typedef struct llentry *(llt_lookup_t)(struct lltable *, u_int flags, 142 const struct sockaddr *l3addr); 143 typedef struct llentry *(llt_alloc_t)(struct lltable *, u_int flags, 144 const struct sockaddr *l3addr); 145 typedef void (llt_delete_t)(struct lltable *, struct llentry *); 146 typedef void (llt_prefix_free_t)(struct lltable *, 147 const struct sockaddr *addr, const struct sockaddr *mask, u_int flags); 148 typedef int (llt_dump_entry_t)(struct lltable *, struct llentry *, 149 struct sysctl_req *); 150 typedef uint32_t (llt_hash_t)(const struct llentry *, uint32_t); 151 typedef int (llt_match_prefix_t)(const struct sockaddr *, 152 const struct sockaddr *, u_int, struct llentry *); 153 typedef void (llt_free_entry_t)(struct lltable *, struct llentry *); 154 typedef void (llt_fill_sa_entry_t)(const struct llentry *, struct sockaddr *); 155 typedef void (llt_free_tbl_t)(struct lltable *); 156 typedef void (llt_link_entry_t)(struct lltable *, struct llentry *); 157 typedef void (llt_unlink_entry_t)(struct llentry *); 158 159 typedef int (llt_foreach_cb_t)(struct lltable *, struct llentry *, void *); 160 typedef int (llt_foreach_entry_t)(struct lltable *, llt_foreach_cb_t *, void *); 161 162 struct lltable { 163 SLIST_ENTRY(lltable) llt_link; 164 int llt_af; 165 int llt_hsize; 166 struct llentries *lle_head; 167 struct ifnet *llt_ifp; 168 169 llt_lookup_t *llt_lookup; 170 llt_alloc_t *llt_alloc_entry; 171 llt_delete_t *llt_delete_entry; 172 llt_prefix_free_t *llt_prefix_free; 173 llt_dump_entry_t *llt_dump_entry; 174 llt_hash_t *llt_hash; 175 llt_match_prefix_t *llt_match_prefix; 176 llt_free_entry_t *llt_free_entry; 177 llt_foreach_entry_t *llt_foreach_entry; 178 llt_link_entry_t *llt_link_entry; 179 llt_unlink_entry_t *llt_unlink_entry; 180 llt_fill_sa_entry_t *llt_fill_sa_entry; 181 llt_free_tbl_t *llt_free_tbl; 182 }; 183 184 MALLOC_DECLARE(M_LLTABLE); 185 186 /* 187 * LLentry flags 188 */ 189 #define LLE_DELETED 0x0001 /* entry must be deleted */ 190 #define LLE_STATIC 0x0002 /* entry is static */ 191 #define LLE_IFADDR 0x0004 /* entry is interface addr */ 192 #define LLE_VALID 0x0008 /* ll_addr is valid */ 193 #define LLE_REDIRECT 0x0010 /* installed by redirect; has host rtentry */ 194 #define LLE_PUB 0x0020 /* publish entry ??? */ 195 #define LLE_LINKED 0x0040 /* linked to lookup structure */ 196 /* LLE request flags */ 197 #define LLE_EXCLUSIVE 0x2000 /* return lle xlocked */ 198 #define LLE_UNLOCKED 0x4000 /* return lle unlocked */ 199 200 /* LLE flags used by fastpath code */ 201 #define RLLE_VALID 0x0001 /* entry is valid */ 202 #define RLLE_IFADDR LLE_IFADDR /* entry is ifaddr */ 203 204 #define LLATBL_HASH(key, mask) \ 205 (((((((key >> 8) ^ key) >> 8) ^ key) >> 8) ^ key) & mask) 206 207 struct lltable *lltable_allocate_htbl(uint32_t hsize); 208 void lltable_free(struct lltable *); 209 void lltable_link(struct lltable *llt); 210 void lltable_prefix_free(int, struct sockaddr *, 211 struct sockaddr *, u_int); 212 #if 0 213 void lltable_drain(int); 214 #endif 215 int lltable_sysctl_dumparp(int, struct sysctl_req *); 216 217 size_t llentry_free(struct llentry *); 218 struct llentry *llentry_alloc(struct ifnet *, struct lltable *, 219 struct sockaddr_storage *); 220 221 /* helper functions */ 222 size_t lltable_drop_entry_queue(struct llentry *); 223 void lltable_set_entry_addr(struct ifnet *ifp, struct llentry *lle, 224 const char *lladdr); 225 226 struct llentry *lltable_alloc_entry(struct lltable *llt, u_int flags, 227 const struct sockaddr *l4addr); 228 void lltable_free_entry(struct lltable *llt, struct llentry *lle); 229 int lltable_delete_addr(struct lltable *llt, u_int flags, 230 const struct sockaddr *l3addr); 231 void lltable_link_entry(struct lltable *llt, struct llentry *lle); 232 void lltable_unlink_entry(struct lltable *llt, struct llentry *lle); 233 void lltable_fill_sa_entry(const struct llentry *lle, struct sockaddr *sa); 234 struct ifnet *lltable_get_ifp(const struct lltable *llt); 235 int lltable_get_af(const struct lltable *llt); 236 237 int lltable_foreach_lle(struct lltable *llt, llt_foreach_cb_t *f, 238 void *farg); 239 /* 240 * Generic link layer address lookup function. 241 */ 242 static __inline struct llentry * 243 lla_lookup(struct lltable *llt, u_int flags, const struct sockaddr *l3addr) 244 { 245 246 return (llt->llt_lookup(llt, flags, l3addr)); 247 } 248 249 int lla_rt_output(struct rt_msghdr *, struct rt_addrinfo *); 250 251 #include <sys/eventhandler.h> 252 enum { 253 LLENTRY_RESOLVED, 254 LLENTRY_TIMEDOUT, 255 LLENTRY_DELETED, 256 LLENTRY_EXPIRED, 257 }; 258 typedef void (*lle_event_fn)(void *, struct llentry *, int); 259 EVENTHANDLER_DECLARE(lle_event, lle_event_fn); 260 #endif /* _NET_IF_LLATBL_H_ */ 261