if_llatbl.c revision 1.4.2.2
1 1.4.2.2 skrll /* $NetBSD: if_llatbl.c,v 1.4.2.2 2015/09/22 12:06:10 skrll Exp $ */ 2 1.4.2.2 skrll /* 3 1.4.2.2 skrll * Copyright (c) 2004 Luigi Rizzo, Alessandro Cerri. All rights reserved. 4 1.4.2.2 skrll * Copyright (c) 2004-2008 Qing Li. All rights reserved. 5 1.4.2.2 skrll * Copyright (c) 2008 Kip Macy. All rights reserved. 6 1.4.2.2 skrll * Copyright (c) 2015 The NetBSD Foundation, Inc. 7 1.4.2.2 skrll * All rights reserved. 8 1.4.2.2 skrll * 9 1.4.2.2 skrll * Redistribution and use in source and binary forms, with or without 10 1.4.2.2 skrll * modification, are permitted provided that the following conditions 11 1.4.2.2 skrll * are met: 12 1.4.2.2 skrll * 1. Redistributions of source code must retain the above copyright 13 1.4.2.2 skrll * notice, this list of conditions and the following disclaimer. 14 1.4.2.2 skrll * 2. Redistributions in binary form must reproduce the above copyright 15 1.4.2.2 skrll * notice, this list of conditions and the following disclaimer in the 16 1.4.2.2 skrll * documentation and/or other materials provided with the distribution. 17 1.4.2.2 skrll * 18 1.4.2.2 skrll * THIS SOFTWARE IS PROVIDED BY AUTHOR AND CONTRIBUTORS ``AS IS'' AND 19 1.4.2.2 skrll * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 20 1.4.2.2 skrll * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 21 1.4.2.2 skrll * ARE DISCLAIMED. IN NO EVENT SHALL AUTHOR OR CONTRIBUTORS BE LIABLE 22 1.4.2.2 skrll * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 23 1.4.2.2 skrll * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 24 1.4.2.2 skrll * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 25 1.4.2.2 skrll * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 26 1.4.2.2 skrll * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 27 1.4.2.2 skrll * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 28 1.4.2.2 skrll * SUCH DAMAGE. 29 1.4.2.2 skrll */ 30 1.4.2.2 skrll #include <sys/cdefs.h> 31 1.4.2.2 skrll 32 1.4.2.2 skrll #ifdef _KERNEL_OPT 33 1.4.2.2 skrll #include "opt_ddb.h" 34 1.4.2.2 skrll #include "opt_inet.h" 35 1.4.2.2 skrll #include "opt_inet6.h" 36 1.4.2.2 skrll #endif 37 1.4.2.2 skrll 38 1.4.2.2 skrll #include <sys/param.h> 39 1.4.2.2 skrll #include <sys/systm.h> 40 1.4.2.2 skrll #include <sys/malloc.h> 41 1.4.2.2 skrll #include <sys/mbuf.h> 42 1.4.2.2 skrll #include <sys/syslog.h> 43 1.4.2.2 skrll #include <sys/sysctl.h> 44 1.4.2.2 skrll #include <sys/socket.h> 45 1.4.2.2 skrll #include <sys/socketvar.h> 46 1.4.2.2 skrll #include <sys/kernel.h> 47 1.4.2.2 skrll #include <sys/lock.h> 48 1.4.2.2 skrll #include <sys/mutex.h> 49 1.4.2.2 skrll #include <sys/rwlock.h> 50 1.4.2.2 skrll 51 1.4.2.2 skrll #ifdef DDB 52 1.4.2.2 skrll #include <ddb/ddb.h> 53 1.4.2.2 skrll #endif 54 1.4.2.2 skrll 55 1.4.2.2 skrll #include <netinet/in.h> 56 1.4.2.2 skrll #include <net/if_llatbl.h> 57 1.4.2.2 skrll #include <net/if.h> 58 1.4.2.2 skrll #include <net/if_dl.h> 59 1.4.2.2 skrll #include <net/route.h> 60 1.4.2.2 skrll #include <netinet/if_inarp.h> 61 1.4.2.2 skrll #include <netinet6/in6_var.h> 62 1.4.2.2 skrll #include <netinet6/nd6.h> 63 1.4.2.2 skrll 64 1.4.2.2 skrll static SLIST_HEAD(, lltable) lltables; 65 1.4.2.2 skrll krwlock_t lltable_rwlock; 66 1.4.2.2 skrll 67 1.4.2.2 skrll static void lltable_unlink(struct lltable *llt); 68 1.4.2.2 skrll static void llentries_unlink(struct lltable *llt, struct llentries *head); 69 1.4.2.2 skrll 70 1.4.2.2 skrll static void htable_unlink_entry(struct llentry *lle); 71 1.4.2.2 skrll static void htable_link_entry(struct lltable *llt, struct llentry *lle); 72 1.4.2.2 skrll static int htable_foreach_lle(struct lltable *llt, llt_foreach_cb_t *f, 73 1.4.2.2 skrll void *farg); 74 1.4.2.2 skrll 75 1.4.2.2 skrll /* 76 1.4.2.2 skrll * Dump lle state for a specific address family. 77 1.4.2.2 skrll */ 78 1.4.2.2 skrll static int 79 1.4.2.2 skrll lltable_dump_af(struct lltable *llt, struct sysctl_req *wr) 80 1.4.2.2 skrll { 81 1.4.2.2 skrll int error; 82 1.4.2.2 skrll 83 1.4.2.2 skrll LLTABLE_LOCK_ASSERT(); 84 1.4.2.2 skrll 85 1.4.2.2 skrll if (llt->llt_ifp->if_flags & IFF_LOOPBACK) 86 1.4.2.2 skrll return (0); 87 1.4.2.2 skrll error = 0; 88 1.4.2.2 skrll 89 1.4.2.2 skrll IF_AFDATA_RLOCK(llt->llt_ifp); 90 1.4.2.2 skrll error = lltable_foreach_lle(llt, 91 1.4.2.2 skrll (llt_foreach_cb_t *)llt->llt_dump_entry, wr); 92 1.4.2.2 skrll IF_AFDATA_RUNLOCK(llt->llt_ifp); 93 1.4.2.2 skrll 94 1.4.2.2 skrll return (error); 95 1.4.2.2 skrll } 96 1.4.2.2 skrll 97 1.4.2.2 skrll /* 98 1.4.2.2 skrll * Dump arp state for a specific address family. 99 1.4.2.2 skrll */ 100 1.4.2.2 skrll int 101 1.4.2.2 skrll lltable_sysctl_dumparp(int af, struct sysctl_req *wr) 102 1.4.2.2 skrll { 103 1.4.2.2 skrll struct lltable *llt; 104 1.4.2.2 skrll int error = 0; 105 1.4.2.2 skrll 106 1.4.2.2 skrll LLTABLE_RLOCK(); 107 1.4.2.2 skrll SLIST_FOREACH(llt, &lltables, llt_link) { 108 1.4.2.2 skrll if (llt->llt_af == af) { 109 1.4.2.2 skrll error = lltable_dump_af(llt, wr); 110 1.4.2.2 skrll if (error != 0) 111 1.4.2.2 skrll goto done; 112 1.4.2.2 skrll } 113 1.4.2.2 skrll } 114 1.4.2.2 skrll done: 115 1.4.2.2 skrll LLTABLE_RUNLOCK(); 116 1.4.2.2 skrll return (error); 117 1.4.2.2 skrll } 118 1.4.2.2 skrll 119 1.4.2.2 skrll /* 120 1.4.2.2 skrll * Common function helpers for chained hash table. 121 1.4.2.2 skrll */ 122 1.4.2.2 skrll 123 1.4.2.2 skrll /* 124 1.4.2.2 skrll * Runs specified callback for each entry in @llt. 125 1.4.2.2 skrll * Caller does the locking. 126 1.4.2.2 skrll * 127 1.4.2.2 skrll */ 128 1.4.2.2 skrll static int 129 1.4.2.2 skrll htable_foreach_lle(struct lltable *llt, llt_foreach_cb_t *f, void *farg) 130 1.4.2.2 skrll { 131 1.4.2.2 skrll struct llentry *lle, *next; 132 1.4.2.2 skrll int i, error; 133 1.4.2.2 skrll 134 1.4.2.2 skrll error = 0; 135 1.4.2.2 skrll 136 1.4.2.2 skrll for (i = 0; i < llt->llt_hsize; i++) { 137 1.4.2.2 skrll LIST_FOREACH_SAFE(lle, &llt->lle_head[i], lle_next, next) { 138 1.4.2.2 skrll error = f(llt, lle, farg); 139 1.4.2.2 skrll if (error != 0) 140 1.4.2.2 skrll break; 141 1.4.2.2 skrll } 142 1.4.2.2 skrll } 143 1.4.2.2 skrll 144 1.4.2.2 skrll return (error); 145 1.4.2.2 skrll } 146 1.4.2.2 skrll 147 1.4.2.2 skrll static void 148 1.4.2.2 skrll htable_link_entry(struct lltable *llt, struct llentry *lle) 149 1.4.2.2 skrll { 150 1.4.2.2 skrll struct llentries *lleh; 151 1.4.2.2 skrll uint32_t hashidx; 152 1.4.2.2 skrll 153 1.4.2.2 skrll if ((lle->la_flags & LLE_LINKED) != 0) 154 1.4.2.2 skrll return; 155 1.4.2.2 skrll 156 1.4.2.2 skrll IF_AFDATA_WLOCK_ASSERT(llt->llt_ifp); 157 1.4.2.2 skrll 158 1.4.2.2 skrll hashidx = llt->llt_hash(lle, llt->llt_hsize); 159 1.4.2.2 skrll lleh = &llt->lle_head[hashidx]; 160 1.4.2.2 skrll 161 1.4.2.2 skrll lle->lle_tbl = llt; 162 1.4.2.2 skrll lle->lle_head = lleh; 163 1.4.2.2 skrll lle->la_flags |= LLE_LINKED; 164 1.4.2.2 skrll LIST_INSERT_HEAD(lleh, lle, lle_next); 165 1.4.2.2 skrll } 166 1.4.2.2 skrll 167 1.4.2.2 skrll static void 168 1.4.2.2 skrll htable_unlink_entry(struct llentry *lle) 169 1.4.2.2 skrll { 170 1.4.2.2 skrll 171 1.4.2.2 skrll if ((lle->la_flags & LLE_LINKED) != 0) { 172 1.4.2.2 skrll IF_AFDATA_WLOCK_ASSERT(lle->lle_tbl->llt_ifp); 173 1.4.2.2 skrll LIST_REMOVE(lle, lle_next); 174 1.4.2.2 skrll lle->la_flags &= ~(LLE_VALID | LLE_LINKED); 175 1.4.2.2 skrll #if 0 176 1.4.2.2 skrll lle->lle_tbl = NULL; 177 1.4.2.2 skrll lle->lle_head = NULL; 178 1.4.2.2 skrll #endif 179 1.4.2.2 skrll } 180 1.4.2.2 skrll } 181 1.4.2.2 skrll 182 1.4.2.2 skrll struct prefix_match_data { 183 1.4.2.2 skrll const struct sockaddr *prefix; 184 1.4.2.2 skrll const struct sockaddr *mask; 185 1.4.2.2 skrll struct llentries dchain; 186 1.4.2.2 skrll u_int flags; 187 1.4.2.2 skrll }; 188 1.4.2.2 skrll 189 1.4.2.2 skrll static int 190 1.4.2.2 skrll htable_prefix_free_cb(struct lltable *llt, struct llentry *lle, void *farg) 191 1.4.2.2 skrll { 192 1.4.2.2 skrll struct prefix_match_data *pmd; 193 1.4.2.2 skrll 194 1.4.2.2 skrll pmd = (struct prefix_match_data *)farg; 195 1.4.2.2 skrll 196 1.4.2.2 skrll if (llt->llt_match_prefix(pmd->prefix, pmd->mask, pmd->flags, lle)) { 197 1.4.2.2 skrll LLE_WLOCK(lle); 198 1.4.2.2 skrll LIST_INSERT_HEAD(&pmd->dchain, lle, lle_chain); 199 1.4.2.2 skrll } 200 1.4.2.2 skrll 201 1.4.2.2 skrll return (0); 202 1.4.2.2 skrll } 203 1.4.2.2 skrll 204 1.4.2.2 skrll static void 205 1.4.2.2 skrll htable_prefix_free(struct lltable *llt, const struct sockaddr *prefix, 206 1.4.2.2 skrll const struct sockaddr *mask, u_int flags) 207 1.4.2.2 skrll { 208 1.4.2.2 skrll struct llentry *lle, *next; 209 1.4.2.2 skrll struct prefix_match_data pmd; 210 1.4.2.2 skrll 211 1.4.2.2 skrll memset(&pmd, 0, sizeof(pmd)); 212 1.4.2.2 skrll pmd.prefix = prefix; 213 1.4.2.2 skrll pmd.mask = mask; 214 1.4.2.2 skrll pmd.flags = flags; 215 1.4.2.2 skrll LIST_INIT(&pmd.dchain); 216 1.4.2.2 skrll 217 1.4.2.2 skrll IF_AFDATA_WLOCK(llt->llt_ifp); 218 1.4.2.2 skrll /* Push matching lles to chain */ 219 1.4.2.2 skrll lltable_foreach_lle(llt, htable_prefix_free_cb, &pmd); 220 1.4.2.2 skrll 221 1.4.2.2 skrll llentries_unlink(llt, &pmd.dchain); 222 1.4.2.2 skrll IF_AFDATA_WUNLOCK(llt->llt_ifp); 223 1.4.2.2 skrll 224 1.4.2.2 skrll LIST_FOREACH_SAFE(lle, &pmd.dchain, lle_chain, next) 225 1.4.2.2 skrll llt->llt_free_entry(llt, lle); 226 1.4.2.2 skrll } 227 1.4.2.2 skrll 228 1.4.2.2 skrll static void 229 1.4.2.2 skrll htable_free_tbl(struct lltable *llt) 230 1.4.2.2 skrll { 231 1.4.2.2 skrll 232 1.4.2.2 skrll free(llt->lle_head, M_LLTABLE); 233 1.4.2.2 skrll free(llt, M_LLTABLE); 234 1.4.2.2 skrll } 235 1.4.2.2 skrll 236 1.4.2.2 skrll static void 237 1.4.2.2 skrll llentries_unlink(struct lltable *llt, struct llentries *head) 238 1.4.2.2 skrll { 239 1.4.2.2 skrll struct llentry *lle, *next; 240 1.4.2.2 skrll 241 1.4.2.2 skrll LIST_FOREACH_SAFE(lle, head, lle_chain, next) 242 1.4.2.2 skrll llt->llt_unlink_entry(lle); 243 1.4.2.2 skrll } 244 1.4.2.2 skrll 245 1.4.2.2 skrll /* 246 1.4.2.2 skrll * Helper function used to drop all mbufs in hold queue. 247 1.4.2.2 skrll * 248 1.4.2.2 skrll * Returns the number of held packets, if any, that were dropped. 249 1.4.2.2 skrll */ 250 1.4.2.2 skrll size_t 251 1.4.2.2 skrll lltable_drop_entry_queue(struct llentry *lle) 252 1.4.2.2 skrll { 253 1.4.2.2 skrll size_t pkts_dropped; 254 1.4.2.2 skrll struct mbuf *next; 255 1.4.2.2 skrll 256 1.4.2.2 skrll LLE_WLOCK_ASSERT(lle); 257 1.4.2.2 skrll 258 1.4.2.2 skrll pkts_dropped = 0; 259 1.4.2.2 skrll while ((lle->la_numheld > 0) && (lle->la_hold != NULL)) { 260 1.4.2.2 skrll next = lle->la_hold->m_nextpkt; 261 1.4.2.2 skrll m_freem(lle->la_hold); 262 1.4.2.2 skrll lle->la_hold = next; 263 1.4.2.2 skrll lle->la_numheld--; 264 1.4.2.2 skrll pkts_dropped++; 265 1.4.2.2 skrll } 266 1.4.2.2 skrll 267 1.4.2.2 skrll KASSERTMSG(lle->la_numheld == 0, 268 1.4.2.2 skrll "la_numheld %d > 0, pkts_droped %zd", 269 1.4.2.2 skrll lle->la_numheld, pkts_dropped); 270 1.4.2.2 skrll 271 1.4.2.2 skrll return (pkts_dropped); 272 1.4.2.2 skrll } 273 1.4.2.2 skrll 274 1.4.2.2 skrll /* 275 1.4.2.2 skrll * Deletes an address from the address table. 276 1.4.2.2 skrll * This function is called by the timer functions 277 1.4.2.2 skrll * such as arptimer() and nd6_llinfo_timer(), and 278 1.4.2.2 skrll * the caller does the locking. 279 1.4.2.2 skrll * 280 1.4.2.2 skrll * Returns the number of held packets, if any, that were dropped. 281 1.4.2.2 skrll */ 282 1.4.2.2 skrll size_t 283 1.4.2.2 skrll llentry_free(struct llentry *lle) 284 1.4.2.2 skrll { 285 1.4.2.2 skrll struct lltable *llt; 286 1.4.2.2 skrll size_t pkts_dropped; 287 1.4.2.2 skrll 288 1.4.2.2 skrll LLE_WLOCK_ASSERT(lle); 289 1.4.2.2 skrll 290 1.4.2.2 skrll if ((lle->la_flags & LLE_LINKED) != 0) { 291 1.4.2.2 skrll llt = lle->lle_tbl; 292 1.4.2.2 skrll 293 1.4.2.2 skrll IF_AFDATA_WLOCK_ASSERT(llt->llt_ifp); 294 1.4.2.2 skrll llt->llt_unlink_entry(lle); 295 1.4.2.2 skrll } 296 1.4.2.2 skrll 297 1.4.2.2 skrll pkts_dropped = lltable_drop_entry_queue(lle); 298 1.4.2.2 skrll 299 1.4.2.2 skrll LLE_FREE_LOCKED(lle); 300 1.4.2.2 skrll 301 1.4.2.2 skrll return (pkts_dropped); 302 1.4.2.2 skrll } 303 1.4.2.2 skrll 304 1.4.2.2 skrll /* 305 1.4.2.2 skrll * (al)locate an llentry for address dst (equivalent to rtalloc for new-arp). 306 1.4.2.2 skrll * 307 1.4.2.2 skrll * If found the llentry * is returned referenced and unlocked. 308 1.4.2.2 skrll */ 309 1.4.2.2 skrll struct llentry * 310 1.4.2.2 skrll llentry_alloc(struct ifnet *ifp, struct lltable *lt, 311 1.4.2.2 skrll struct sockaddr_storage *dst) 312 1.4.2.2 skrll { 313 1.4.2.2 skrll struct llentry *la; 314 1.4.2.2 skrll 315 1.4.2.2 skrll IF_AFDATA_RLOCK(ifp); 316 1.4.2.2 skrll la = lla_lookup(lt, LLE_EXCLUSIVE, (struct sockaddr *)dst); 317 1.4.2.2 skrll IF_AFDATA_RUNLOCK(ifp); 318 1.4.2.2 skrll if ((la == NULL) && 319 1.4.2.2 skrll #ifdef __FreeBSD__ 320 1.4.2.2 skrll (ifp->if_flags & (IFF_NOARP | IFF_STATICARP)) == 0) { 321 1.4.2.2 skrll #else /* XXX */ 322 1.4.2.2 skrll (ifp->if_flags & IFF_NOARP) == 0) { 323 1.4.2.2 skrll #endif 324 1.4.2.2 skrll IF_AFDATA_WLOCK(ifp); 325 1.4.2.2 skrll la = lla_create(lt, 0, (struct sockaddr *)dst); 326 1.4.2.2 skrll IF_AFDATA_WUNLOCK(ifp); 327 1.4.2.2 skrll } 328 1.4.2.2 skrll 329 1.4.2.2 skrll if (la != NULL) { 330 1.4.2.2 skrll LLE_ADDREF(la); 331 1.4.2.2 skrll LLE_WUNLOCK(la); 332 1.4.2.2 skrll } 333 1.4.2.2 skrll 334 1.4.2.2 skrll return (la); 335 1.4.2.2 skrll } 336 1.4.2.2 skrll 337 1.4.2.2 skrll /* 338 1.4.2.2 skrll * Free all entries from given table and free itself. 339 1.4.2.2 skrll */ 340 1.4.2.2 skrll 341 1.4.2.2 skrll static int 342 1.4.2.2 skrll lltable_free_cb(struct lltable *llt, struct llentry *lle, void *farg) 343 1.4.2.2 skrll { 344 1.4.2.2 skrll struct llentries *dchain; 345 1.4.2.2 skrll 346 1.4.2.2 skrll dchain = (struct llentries *)farg; 347 1.4.2.2 skrll 348 1.4.2.2 skrll LLE_WLOCK(lle); 349 1.4.2.2 skrll LIST_INSERT_HEAD(dchain, lle, lle_chain); 350 1.4.2.2 skrll 351 1.4.2.2 skrll return (0); 352 1.4.2.2 skrll } 353 1.4.2.2 skrll 354 1.4.2.2 skrll /* 355 1.4.2.2 skrll * Free all entries from given table and free itself. 356 1.4.2.2 skrll */ 357 1.4.2.2 skrll void 358 1.4.2.2 skrll lltable_free(struct lltable *llt) 359 1.4.2.2 skrll { 360 1.4.2.2 skrll struct llentry *lle, *next; 361 1.4.2.2 skrll struct llentries dchain; 362 1.4.2.2 skrll 363 1.4.2.2 skrll KASSERTMSG(llt != NULL, "llt is NULL"); 364 1.4.2.2 skrll 365 1.4.2.2 skrll lltable_unlink(llt); 366 1.4.2.2 skrll 367 1.4.2.2 skrll LIST_INIT(&dchain); 368 1.4.2.2 skrll IF_AFDATA_WLOCK(llt->llt_ifp); 369 1.4.2.2 skrll /* Push all lles to @dchain */ 370 1.4.2.2 skrll lltable_foreach_lle(llt, lltable_free_cb, &dchain); 371 1.4.2.2 skrll llentries_unlink(llt, &dchain); 372 1.4.2.2 skrll IF_AFDATA_WUNLOCK(llt->llt_ifp); 373 1.4.2.2 skrll 374 1.4.2.2 skrll mutex_enter(softnet_lock); 375 1.4.2.2 skrll LIST_FOREACH_SAFE(lle, &dchain, lle_chain, next) { 376 1.4.2.2 skrll if (callout_halt(&lle->la_timer, softnet_lock)) 377 1.4.2.2 skrll LLE_REMREF(lle); 378 1.4.2.2 skrll #if defined(__NetBSD__) 379 1.4.2.2 skrll /* XXX should have callback? */ 380 1.4.2.2 skrll if (lle->la_rt != NULL) 381 1.4.2.2 skrll rtfree(lle->la_rt); 382 1.4.2.2 skrll #endif 383 1.4.2.2 skrll llentry_free(lle); 384 1.4.2.2 skrll } 385 1.4.2.2 skrll mutex_exit(softnet_lock); 386 1.4.2.2 skrll 387 1.4.2.2 skrll llt->llt_free_tbl(llt); 388 1.4.2.2 skrll } 389 1.4.2.2 skrll 390 1.4.2.2 skrll void 391 1.4.2.2 skrll lltable_drain(int af) 392 1.4.2.2 skrll { 393 1.4.2.2 skrll struct lltable *llt; 394 1.4.2.2 skrll struct llentry *lle; 395 1.4.2.2 skrll register int i; 396 1.4.2.2 skrll 397 1.4.2.2 skrll LLTABLE_RLOCK(); 398 1.4.2.2 skrll SLIST_FOREACH(llt, &lltables, llt_link) { 399 1.4.2.2 skrll if (llt->llt_af != af) 400 1.4.2.2 skrll continue; 401 1.4.2.2 skrll 402 1.4.2.2 skrll for (i=0; i < llt->llt_hsize; i++) { 403 1.4.2.2 skrll LIST_FOREACH(lle, &llt->lle_head[i], lle_next) { 404 1.4.2.2 skrll LLE_WLOCK(lle); 405 1.4.2.2 skrll lltable_drop_entry_queue(lle); 406 1.4.2.2 skrll LLE_WUNLOCK(lle); 407 1.4.2.2 skrll } 408 1.4.2.2 skrll } 409 1.4.2.2 skrll } 410 1.4.2.2 skrll LLTABLE_RUNLOCK(); 411 1.4.2.2 skrll } 412 1.4.2.2 skrll 413 1.4.2.2 skrll void 414 1.4.2.2 skrll lltable_prefix_free(int af, struct sockaddr *prefix, struct sockaddr *mask, 415 1.4.2.2 skrll u_int flags) 416 1.4.2.2 skrll { 417 1.4.2.2 skrll struct lltable *llt; 418 1.4.2.2 skrll 419 1.4.2.2 skrll LLTABLE_RLOCK(); 420 1.4.2.2 skrll SLIST_FOREACH(llt, &lltables, llt_link) { 421 1.4.2.2 skrll if (llt->llt_af != af) 422 1.4.2.2 skrll continue; 423 1.4.2.2 skrll 424 1.4.2.2 skrll llt->llt_prefix_free(llt, prefix, mask, flags); 425 1.4.2.2 skrll } 426 1.4.2.2 skrll LLTABLE_RUNLOCK(); 427 1.4.2.2 skrll } 428 1.4.2.2 skrll 429 1.4.2.2 skrll struct lltable * 430 1.4.2.2 skrll lltable_allocate_htbl(uint32_t hsize) 431 1.4.2.2 skrll { 432 1.4.2.2 skrll struct lltable *llt; 433 1.4.2.2 skrll int i; 434 1.4.2.2 skrll 435 1.4.2.2 skrll llt = malloc(sizeof(struct lltable), M_LLTABLE, M_WAITOK | M_ZERO); 436 1.4.2.2 skrll llt->llt_hsize = hsize; 437 1.4.2.2 skrll llt->lle_head = malloc(sizeof(struct llentries) * hsize, 438 1.4.2.2 skrll M_LLTABLE, M_WAITOK | M_ZERO); 439 1.4.2.2 skrll 440 1.4.2.2 skrll for (i = 0; i < llt->llt_hsize; i++) 441 1.4.2.2 skrll LIST_INIT(&llt->lle_head[i]); 442 1.4.2.2 skrll 443 1.4.2.2 skrll /* Set some default callbacks */ 444 1.4.2.2 skrll llt->llt_link_entry = htable_link_entry; 445 1.4.2.2 skrll llt->llt_unlink_entry = htable_unlink_entry; 446 1.4.2.2 skrll llt->llt_prefix_free = htable_prefix_free; 447 1.4.2.2 skrll llt->llt_foreach_entry = htable_foreach_lle; 448 1.4.2.2 skrll 449 1.4.2.2 skrll llt->llt_free_tbl = htable_free_tbl; 450 1.4.2.2 skrll 451 1.4.2.2 skrll return (llt); 452 1.4.2.2 skrll } 453 1.4.2.2 skrll 454 1.4.2.2 skrll /* 455 1.4.2.2 skrll * Links lltable to global llt list. 456 1.4.2.2 skrll */ 457 1.4.2.2 skrll void 458 1.4.2.2 skrll lltable_link(struct lltable *llt) 459 1.4.2.2 skrll { 460 1.4.2.2 skrll 461 1.4.2.2 skrll LLTABLE_WLOCK(); 462 1.4.2.2 skrll SLIST_INSERT_HEAD(&lltables, llt, llt_link); 463 1.4.2.2 skrll LLTABLE_WUNLOCK(); 464 1.4.2.2 skrll } 465 1.4.2.2 skrll 466 1.4.2.2 skrll static void 467 1.4.2.2 skrll lltable_unlink(struct lltable *llt) 468 1.4.2.2 skrll { 469 1.4.2.2 skrll 470 1.4.2.2 skrll LLTABLE_WLOCK(); 471 1.4.2.2 skrll SLIST_REMOVE(&lltables, llt, lltable, llt_link); 472 1.4.2.2 skrll LLTABLE_WUNLOCK(); 473 1.4.2.2 skrll 474 1.4.2.2 skrll } 475 1.4.2.2 skrll 476 1.4.2.2 skrll /* 477 1.4.2.2 skrll * External methods used by lltable consumers 478 1.4.2.2 skrll */ 479 1.4.2.2 skrll 480 1.4.2.2 skrll int 481 1.4.2.2 skrll lltable_foreach_lle(struct lltable *llt, llt_foreach_cb_t *f, void *farg) 482 1.4.2.2 skrll { 483 1.4.2.2 skrll 484 1.4.2.2 skrll return (llt->llt_foreach_entry(llt, f, farg)); 485 1.4.2.2 skrll } 486 1.4.2.2 skrll 487 1.4.2.2 skrll void 488 1.4.2.2 skrll lltable_link_entry(struct lltable *llt, struct llentry *lle) 489 1.4.2.2 skrll { 490 1.4.2.2 skrll 491 1.4.2.2 skrll llt->llt_link_entry(llt, lle); 492 1.4.2.2 skrll } 493 1.4.2.2 skrll 494 1.4.2.2 skrll void 495 1.4.2.2 skrll lltable_unlink_entry(struct lltable *llt, struct llentry *lle) 496 1.4.2.2 skrll { 497 1.4.2.2 skrll 498 1.4.2.2 skrll llt->llt_unlink_entry(lle); 499 1.4.2.2 skrll } 500 1.4.2.2 skrll 501 1.4.2.2 skrll void 502 1.4.2.2 skrll lltable_fill_sa_entry(const struct llentry *lle, struct sockaddr *sa) 503 1.4.2.2 skrll { 504 1.4.2.2 skrll struct lltable *llt; 505 1.4.2.2 skrll 506 1.4.2.2 skrll llt = lle->lle_tbl; 507 1.4.2.2 skrll llt->llt_fill_sa_entry(lle, sa); 508 1.4.2.2 skrll } 509 1.4.2.2 skrll 510 1.4.2.2 skrll struct ifnet * 511 1.4.2.2 skrll lltable_get_ifp(const struct lltable *llt) 512 1.4.2.2 skrll { 513 1.4.2.2 skrll 514 1.4.2.2 skrll return (llt->llt_ifp); 515 1.4.2.2 skrll } 516 1.4.2.2 skrll 517 1.4.2.2 skrll int 518 1.4.2.2 skrll lltable_get_af(const struct lltable *llt) 519 1.4.2.2 skrll { 520 1.4.2.2 skrll 521 1.4.2.2 skrll return (llt->llt_af); 522 1.4.2.2 skrll } 523 1.4.2.2 skrll 524 1.4.2.2 skrll /* 525 1.4.2.2 skrll * Called in route_output when rtm_flags contains RTF_LLDATA. 526 1.4.2.2 skrll */ 527 1.4.2.2 skrll int 528 1.4.2.2 skrll lla_rt_output(struct rt_msghdr *rtm, struct rt_addrinfo *info) 529 1.4.2.2 skrll { 530 1.4.2.2 skrll const struct sockaddr_dl *dl = satocsdl(info->rti_info[RTAX_GATEWAY]); 531 1.4.2.2 skrll const struct sockaddr *dst = info->rti_info[RTAX_DST]; 532 1.4.2.2 skrll struct ifnet *ifp; 533 1.4.2.2 skrll struct lltable *llt; 534 1.4.2.2 skrll struct llentry *lle; 535 1.4.2.2 skrll u_int laflags; 536 1.4.2.2 skrll int error; 537 1.4.2.2 skrll 538 1.4.2.2 skrll KASSERTMSG(dl != NULL && dl->sdl_family == AF_LINK, "invalid dl"); 539 1.4.2.2 skrll 540 1.4.2.2 skrll ifp = if_byindex(dl->sdl_index); 541 1.4.2.2 skrll if (ifp == NULL) { 542 1.4.2.2 skrll log(LOG_INFO, "%s: invalid ifp (sdl_index %d)\n", 543 1.4.2.2 skrll __func__, dl->sdl_index); 544 1.4.2.2 skrll return EINVAL; 545 1.4.2.2 skrll } 546 1.4.2.2 skrll 547 1.4.2.2 skrll /* XXX linked list may be too expensive */ 548 1.4.2.2 skrll LLTABLE_RLOCK(); 549 1.4.2.2 skrll SLIST_FOREACH(llt, &lltables, llt_link) { 550 1.4.2.2 skrll if (llt->llt_af == dst->sa_family && 551 1.4.2.2 skrll llt->llt_ifp == ifp) 552 1.4.2.2 skrll break; 553 1.4.2.2 skrll } 554 1.4.2.2 skrll LLTABLE_RUNLOCK(); 555 1.4.2.2 skrll KASSERTMSG(llt != NULL, "Yep, ugly hacks are bad"); 556 1.4.2.2 skrll 557 1.4.2.2 skrll error = 0; 558 1.4.2.2 skrll 559 1.4.2.2 skrll switch (rtm->rtm_type) { 560 1.4.2.2 skrll case RTM_ADD: 561 1.4.2.2 skrll /* Add static LLE */ 562 1.4.2.2 skrll IF_AFDATA_WLOCK(ifp); 563 1.4.2.2 skrll lle = lla_create(llt, 0, dst); 564 1.4.2.2 skrll if (lle == NULL) { 565 1.4.2.2 skrll IF_AFDATA_WUNLOCK(ifp); 566 1.4.2.2 skrll return (ENOMEM); 567 1.4.2.2 skrll } 568 1.4.2.2 skrll 569 1.4.2.2 skrll 570 1.4.2.2 skrll memcpy(&lle->ll_addr, CLLADDR(dl), ifp->if_addrlen); 571 1.4.2.2 skrll if ((rtm->rtm_flags & RTF_ANNOUNCE)) 572 1.4.2.2 skrll lle->la_flags |= LLE_PUB; 573 1.4.2.2 skrll lle->la_flags |= LLE_VALID; 574 1.4.2.2 skrll #ifdef INET6 575 1.4.2.2 skrll /* 576 1.4.2.2 skrll * ND6 577 1.4.2.2 skrll */ 578 1.4.2.2 skrll if (dst->sa_family == AF_INET6) 579 1.4.2.2 skrll lle->ln_state = ND6_LLINFO_REACHABLE; 580 1.4.2.2 skrll #endif 581 1.4.2.2 skrll /* 582 1.4.2.2 skrll * NB: arp and ndp always set (RTF_STATIC | RTF_HOST) 583 1.4.2.2 skrll */ 584 1.4.2.2 skrll 585 1.4.2.2 skrll if (rtm->rtm_rmx.rmx_expire == 0) { 586 1.4.2.2 skrll lle->la_flags |= LLE_STATIC; 587 1.4.2.2 skrll lle->la_expire = 0; 588 1.4.2.2 skrll } else 589 1.4.2.2 skrll lle->la_expire = rtm->rtm_rmx.rmx_expire; 590 1.4.2.2 skrll laflags = lle->la_flags; 591 1.4.2.2 skrll LLE_WUNLOCK(lle); 592 1.4.2.2 skrll IF_AFDATA_WUNLOCK(ifp); 593 1.4.2.2 skrll #ifdef INET 594 1.4.2.2 skrll /* gratuitous ARP */ 595 1.4.2.2 skrll if ((laflags & LLE_PUB) && dst->sa_family == AF_INET) 596 1.4.2.2 skrll arprequest(ifp, 597 1.4.2.2 skrll &((const struct sockaddr_in *)dst)->sin_addr, 598 1.4.2.2 skrll &((const struct sockaddr_in *)dst)->sin_addr, 599 1.4.2.2 skrll CLLADDR(dl)); 600 1.4.2.2 skrll #endif 601 1.4.2.2 skrll 602 1.4.2.2 skrll break; 603 1.4.2.2 skrll 604 1.4.2.2 skrll case RTM_DELETE: 605 1.4.2.2 skrll IF_AFDATA_WLOCK(ifp); 606 1.4.2.2 skrll error = lla_delete(llt, 0, dst); 607 1.4.2.2 skrll IF_AFDATA_WUNLOCK(ifp); 608 1.4.2.2 skrll return (error == 0 ? 0 : ENOENT); 609 1.4.2.2 skrll 610 1.4.2.2 skrll default: 611 1.4.2.2 skrll error = EINVAL; 612 1.4.2.2 skrll } 613 1.4.2.2 skrll 614 1.4.2.2 skrll return (error); 615 1.4.2.2 skrll } 616 1.4.2.2 skrll 617 1.4.2.2 skrll void 618 1.4.2.2 skrll lltableinit(void) 619 1.4.2.2 skrll { 620 1.4.2.2 skrll 621 1.4.2.2 skrll SLIST_INIT(&lltables); 622 1.4.2.2 skrll rw_init(&lltable_rwlock); 623 1.4.2.2 skrll } 624 1.4.2.2 skrll 625 1.4.2.2 skrll #ifdef __FreeBSD__ 626 1.4.2.2 skrll #ifdef DDB 627 1.4.2.2 skrll struct llentry_sa { 628 1.4.2.2 skrll struct llentry base; 629 1.4.2.2 skrll struct sockaddr l3_addr; 630 1.4.2.2 skrll }; 631 1.4.2.2 skrll 632 1.4.2.2 skrll static void 633 1.4.2.2 skrll llatbl_lle_show(struct llentry_sa *la) 634 1.4.2.2 skrll { 635 1.4.2.2 skrll struct llentry *lle; 636 1.4.2.2 skrll uint8_t octet[6]; 637 1.4.2.2 skrll 638 1.4.2.2 skrll lle = &la->base; 639 1.4.2.2 skrll db_printf("lle=%p\n", lle); 640 1.4.2.2 skrll db_printf(" lle_next=%p\n", lle->lle_next.le_next); 641 1.4.2.2 skrll db_printf(" lle_lock=%p\n", &lle->lle_lock); 642 1.4.2.2 skrll db_printf(" lle_tbl=%p\n", lle->lle_tbl); 643 1.4.2.2 skrll db_printf(" lle_head=%p\n", lle->lle_head); 644 1.4.2.2 skrll db_printf(" la_hold=%p\n", lle->la_hold); 645 1.4.2.2 skrll db_printf(" la_numheld=%d\n", lle->la_numheld); 646 1.4.2.2 skrll db_printf(" la_expire=%ju\n", (uintmax_t)lle->la_expire); 647 1.4.2.2 skrll db_printf(" la_flags=0x%04x\n", lle->la_flags); 648 1.4.2.2 skrll db_printf(" la_asked=%u\n", lle->la_asked); 649 1.4.2.2 skrll db_printf(" la_preempt=%u\n", lle->la_preempt); 650 1.4.2.2 skrll db_printf(" ln_byhint=%u\n", lle->ln_byhint); 651 1.4.2.2 skrll db_printf(" ln_state=%d\n", lle->ln_state); 652 1.4.2.2 skrll db_printf(" ln_router=%u\n", lle->ln_router); 653 1.4.2.2 skrll db_printf(" ln_ntick=%ju\n", (uintmax_t)lle->ln_ntick); 654 1.4.2.2 skrll db_printf(" lle_refcnt=%d\n", lle->lle_refcnt); 655 1.4.2.2 skrll memcopy(octet, &lle->ll_addr.mac16, sizeof(octet)); 656 1.4.2.2 skrll db_printf(" ll_addr=%02x:%02x:%02x:%02x:%02x:%02x\n", 657 1.4.2.2 skrll octet[0], octet[1], octet[2], octet[3], octet[4], octet[5]); 658 1.4.2.2 skrll db_printf(" lle_timer=%p\n", &lle->lle_timer); 659 1.4.2.2 skrll 660 1.4.2.2 skrll switch (la->l3_addr.sa_family) { 661 1.4.2.2 skrll #ifdef INET 662 1.4.2.2 skrll case AF_INET: 663 1.4.2.2 skrll { 664 1.4.2.2 skrll struct sockaddr_in *sin; 665 1.4.2.2 skrll char l3s[INET_ADDRSTRLEN]; 666 1.4.2.2 skrll 667 1.4.2.2 skrll sin = (struct sockaddr_in *)&la->l3_addr; 668 1.4.2.2 skrll inet_ntoa_r(sin->sin_addr, l3s); 669 1.4.2.2 skrll db_printf(" l3_addr=%s\n", l3s); 670 1.4.2.2 skrll break; 671 1.4.2.2 skrll } 672 1.4.2.2 skrll #endif 673 1.4.2.2 skrll #ifdef INET6 674 1.4.2.2 skrll case AF_INET6: 675 1.4.2.2 skrll { 676 1.4.2.2 skrll struct sockaddr_in6 *sin6; 677 1.4.2.2 skrll char l3s[INET6_ADDRSTRLEN]; 678 1.4.2.2 skrll 679 1.4.2.2 skrll sin6 = (struct sockaddr_in6 *)&la->l3_addr; 680 1.4.2.2 skrll ip6_sprintf(l3s, &sin6->sin6_addr); 681 1.4.2.2 skrll db_printf(" l3_addr=%s\n", l3s); 682 1.4.2.2 skrll break; 683 1.4.2.2 skrll } 684 1.4.2.2 skrll #endif 685 1.4.2.2 skrll default: 686 1.4.2.2 skrll db_printf(" l3_addr=N/A (af=%d)\n", la->l3_addr.sa_family); 687 1.4.2.2 skrll break; 688 1.4.2.2 skrll } 689 1.4.2.2 skrll } 690 1.4.2.2 skrll 691 1.4.2.2 skrll DB_SHOW_COMMAND(llentry, db_show_llentry) 692 1.4.2.2 skrll { 693 1.4.2.2 skrll 694 1.4.2.2 skrll if (!have_addr) { 695 1.4.2.2 skrll db_printf("usage: show llentry <struct llentry *>\n"); 696 1.4.2.2 skrll return; 697 1.4.2.2 skrll } 698 1.4.2.2 skrll 699 1.4.2.2 skrll llatbl_lle_show((struct llentry_sa *)addr); 700 1.4.2.2 skrll } 701 1.4.2.2 skrll 702 1.4.2.2 skrll static void 703 1.4.2.2 skrll llatbl_llt_show(struct lltable *llt) 704 1.4.2.2 skrll { 705 1.4.2.2 skrll int i; 706 1.4.2.2 skrll struct llentry *lle; 707 1.4.2.2 skrll 708 1.4.2.2 skrll db_printf("llt=%p llt_af=%d llt_ifp=%p\n", 709 1.4.2.2 skrll llt, llt->llt_af, llt->llt_ifp); 710 1.4.2.2 skrll 711 1.4.2.2 skrll for (i = 0; i < llt->llt_hsize; i++) { 712 1.4.2.2 skrll LIST_FOREACH(lle, &llt->lle_head[i], lle_next) { 713 1.4.2.2 skrll 714 1.4.2.2 skrll llatbl_lle_show((struct llentry_sa *)lle); 715 1.4.2.2 skrll if (db_pager_quit) 716 1.4.2.2 skrll return; 717 1.4.2.2 skrll } 718 1.4.2.2 skrll } 719 1.4.2.2 skrll } 720 1.4.2.2 skrll 721 1.4.2.2 skrll DB_SHOW_COMMAND(lltable, db_show_lltable) 722 1.4.2.2 skrll { 723 1.4.2.2 skrll 724 1.4.2.2 skrll if (!have_addr) { 725 1.4.2.2 skrll db_printf("usage: show lltable <struct lltable *>\n"); 726 1.4.2.2 skrll return; 727 1.4.2.2 skrll } 728 1.4.2.2 skrll 729 1.4.2.2 skrll llatbl_llt_show((struct lltable *)addr); 730 1.4.2.2 skrll } 731 1.4.2.2 skrll 732 1.4.2.2 skrll DB_SHOW_ALL_COMMAND(lltables, db_show_all_lltables) 733 1.4.2.2 skrll { 734 1.4.2.2 skrll VNET_ITERATOR_DECL(vnet_iter); 735 1.4.2.2 skrll struct lltable *llt; 736 1.4.2.2 skrll 737 1.4.2.2 skrll VNET_FOREACH(vnet_iter) { 738 1.4.2.2 skrll CURVNET_SET_QUIET(vnet_iter); 739 1.4.2.2 skrll #ifdef VIMAGE 740 1.4.2.2 skrll db_printf("vnet=%p\n", curvnet); 741 1.4.2.2 skrll #endif 742 1.4.2.2 skrll SLIST_FOREACH(llt, &lltables, llt_link) { 743 1.4.2.2 skrll db_printf("llt=%p llt_af=%d llt_ifp=%p(%s)\n", 744 1.4.2.2 skrll llt, llt->llt_af, llt->llt_ifp, 745 1.4.2.2 skrll (llt->llt_ifp != NULL) ? 746 1.4.2.2 skrll llt->llt_ifp->if_xname : "?"); 747 1.4.2.2 skrll if (have_addr && addr != 0) /* verbose */ 748 1.4.2.2 skrll llatbl_llt_show(llt); 749 1.4.2.2 skrll if (db_pager_quit) { 750 1.4.2.2 skrll CURVNET_RESTORE(); 751 1.4.2.2 skrll return; 752 1.4.2.2 skrll } 753 1.4.2.2 skrll } 754 1.4.2.2 skrll CURVNET_RESTORE(); 755 1.4.2.2 skrll } 756 1.4.2.2 skrll } 757 1.4.2.2 skrll #endif /* DDB */ 758 1.4.2.2 skrll #endif /* __FreeBSD__ */ 759
Indexes created Thu Oct 23 22:10:10 GMT 2025