rtsock.c revision 1.4.2.1
1 /* 2 * Copyright (c) 1988, 1991 Regents of the University of California. 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer. 10 * 2. Redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in the 12 * documentation and/or other materials provided with the distribution. 13 * 3. All advertising materials mentioning features or use of this software 14 * must display the following acknowledgement: 15 * This product includes software developed by the University of 16 * California, Berkeley and its contributors. 17 * 4. Neither the name of the University nor the names of its contributors 18 * may be used to endorse or promote products derived from this software 19 * without specific prior written permission. 20 * 21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31 * SUCH DAMAGE. 32 * 33 * from: @(#)rtsock.c 7.18 (Berkeley) 6/27/91 34 * $Id: rtsock.c,v 1.4.2.1 1993/09/24 08:54:10 mycroft Exp $ 35 */ 36 37 #include "param.h" 38 #include "systm.h" 39 #include "mbuf.h" 40 #include "proc.h" 41 #include "socket.h" 42 #include "socketvar.h" 43 #include "domain.h" 44 #include "protosw.h" 45 46 #include "machine/mtpr.h" 47 #include "machine/cpu.h" 48 49 #include "af.h" 50 #include "if.h" 51 #include "route.h" 52 #include "raw_cb.h" 53 54 struct sockaddr route_dst = { 2, PF_ROUTE, }; 55 struct sockaddr route_src = { 2, PF_ROUTE, }; 56 struct sockproto route_proto = { PF_ROUTE, }; 57 58 /*ARGSUSED*/ 59 route_usrreq(so, req, m, nam, control) 60 register struct socket *so; 61 int req; 62 struct mbuf *m, *nam, *control; 63 { 64 register int error = 0; 65 register struct rawcb *rp = sotorawcb(so); 66 int s; 67 if (req == PRU_ATTACH) { 68 MALLOC(rp, struct rawcb *, sizeof(*rp), M_PCB, M_WAITOK); 69 if (so->so_pcb = (caddr_t)rp) 70 bzero(so->so_pcb, sizeof(*rp)); 71 72 } 73 if (req == PRU_DETACH && rp) { 74 int af = rp->rcb_proto.sp_protocol; 75 if (af == AF_INET) 76 route_cb.ip_count--; 77 else if (af == AF_NS) 78 route_cb.ns_count--; 79 else if (af == AF_ISO) 80 route_cb.iso_count--; 81 route_cb.any_count--; 82 } 83 s = splnet(); 84 error = raw_usrreq(so, req, m, nam, control); 85 rp = sotorawcb(so); 86 if (req == PRU_ATTACH && rp) { 87 int af = rp->rcb_proto.sp_protocol; 88 if (error) { 89 free((caddr_t)rp, M_PCB); 90 splx(s); 91 return (error); 92 } 93 if (af == AF_INET) 94 route_cb.ip_count++; 95 else if (af == AF_NS) 96 route_cb.ns_count++; 97 else if (af == AF_ISO) 98 route_cb.iso_count++; 99 rp->rcb_faddr = &route_src; 100 route_cb.any_count++; 101 soisconnected(so); 102 so->so_options |= SO_USELOOPBACK; 103 } 104 splx(s); 105 return (error); 106 } 107 #define ROUNDUP(a) \ 108 ((a) > 0 ? (1 + (((a) - 1) | (sizeof(long) - 1))) : sizeof(long)) 109 #define ADVANCE(x, n) (x += ROUNDUP((n)->sa_len)) 110 111 /*ARGSUSED*/ 112 route_output(m, so) 113 register struct mbuf *m; 114 struct socket *so; 115 { 116 register struct rt_msghdr *rtm = 0; 117 register struct rtentry *rt = 0; 118 struct rtentry *saved_nrt = 0; 119 struct sockaddr *dst = 0, *gate = 0, *netmask = 0, *genmask = 0; 120 struct sockaddr *ifpaddr = 0, *ifaaddr = 0; 121 caddr_t cp, lim; 122 int len, error = 0; 123 struct ifnet *ifp = 0; 124 struct ifaddr *ifa = 0; 125 struct ifaddr *ifaof_ifpforaddr(), *ifa_ifwithroute(); 126 127 #define senderr(e) { error = e; goto flush;} 128 if (m == 0 || m->m_len < sizeof(long)) 129 return (ENOBUFS); 130 if ((m = m_pullup(m, sizeof(long))) == 0) 131 return (ENOBUFS); 132 if ((m->m_flags & M_PKTHDR) == 0) 133 panic("route_output"); 134 len = m->m_pkthdr.len; 135 if (len < sizeof(*rtm) || 136 len != mtod(m, struct rt_msghdr *)->rtm_msglen) 137 senderr(EINVAL); 138 R_Malloc(rtm, struct rt_msghdr *, len); 139 if (rtm == 0) 140 senderr(ENOBUFS); 141 m_copydata(m, 0, len, (caddr_t)rtm); 142 if (rtm->rtm_version != RTM_VERSION) 143 senderr(EPROTONOSUPPORT); 144 rtm->rtm_pid = curproc->p_pid; 145 lim = len + (caddr_t) rtm; 146 cp = (caddr_t) (rtm + 1); 147 if (rtm->rtm_addrs & RTA_DST) { 148 dst = (struct sockaddr *)cp; 149 ADVANCE(cp, dst); 150 } else 151 senderr(EINVAL); 152 if ((rtm->rtm_addrs & RTA_GATEWAY) && cp < lim) { 153 gate = (struct sockaddr *)cp; 154 ADVANCE(cp, gate); 155 } 156 if ((rtm->rtm_addrs & RTA_NETMASK) && cp < lim) { 157 netmask = (struct sockaddr *)cp; 158 ADVANCE(cp, netmask); 159 } 160 if ((rtm->rtm_addrs & RTA_GENMASK) && cp < lim) { 161 struct radix_node *t, *rn_addmask(); 162 genmask = (struct sockaddr *)cp; 163 ADVANCE(cp, genmask); 164 t = rn_addmask(genmask, 1, 2); 165 if (t && Bcmp(genmask, t->rn_key, *(u_char *)genmask) == 0) 166 genmask = (struct sockaddr *)(t->rn_key); 167 else 168 senderr(ENOBUFS); 169 } 170 if ((rtm->rtm_addrs & RTA_IFP) && cp < lim) { 171 ifpaddr = (struct sockaddr *)cp; 172 ADVANCE(cp, ifpaddr); 173 } 174 if ((rtm->rtm_addrs & RTA_IFA) && cp < lim) { 175 ifaaddr = (struct sockaddr *)cp; 176 } 177 switch (rtm->rtm_type) { 178 case RTM_ADD: 179 if (gate == 0) 180 senderr(EINVAL); 181 error = rtrequest(RTM_ADD, dst, gate, netmask, 182 rtm->rtm_flags, &saved_nrt); 183 if (error == 0 && saved_nrt) { 184 rt_setmetrics(rtm->rtm_inits, 185 &rtm->rtm_rmx, &saved_nrt->rt_rmx); 186 saved_nrt->rt_refcnt--; 187 saved_nrt->rt_genmask = genmask; 188 } 189 break; 190 191 case RTM_DELETE: 192 error = rtrequest(RTM_DELETE, dst, gate, netmask, 193 rtm->rtm_flags, (struct rtentry **)0); 194 break; 195 196 case RTM_GET: 197 case RTM_CHANGE: 198 case RTM_LOCK: 199 rt = rtalloc1(dst, 0); 200 if (rt == 0) 201 senderr(ESRCH); 202 if (rtm->rtm_type != RTM_GET) { 203 if (Bcmp(dst, rt_key(rt), dst->sa_len) != 0) 204 senderr(ESRCH); 205 if (rt->rt_nodes->rn_dupedkey && 206 (netmask == 0 || 207 Bcmp(netmask, rt_mask(rt), netmask->sa_len))) 208 senderr(ETOOMANYREFS); 209 } 210 switch(rtm->rtm_type) { 211 212 case RTM_GET: 213 dst = rt_key(rt); len = sizeof(*rtm); 214 ADVANCE(len, dst); 215 rtm->rtm_addrs |= RTA_DST; 216 if (gate = rt->rt_gateway) { 217 ADVANCE(len, gate); 218 rtm->rtm_addrs |= RTA_GATEWAY; 219 } else 220 rtm->rtm_addrs &= ~RTA_GATEWAY; 221 if (netmask = rt_mask(rt)) { 222 ADVANCE(len, netmask); 223 rtm->rtm_addrs |= RTA_NETMASK; 224 } else 225 rtm->rtm_addrs &= ~RTA_NETMASK; 226 if (genmask = rt->rt_genmask) { 227 ADVANCE(len, genmask); 228 rtm->rtm_addrs |= RTA_GENMASK; 229 } else 230 rtm->rtm_addrs &= ~RTA_GENMASK; 231 if (rtm->rtm_addrs & (RTA_IFP | RTA_IFA)) { 232 if (rt->rt_ifp == 0) 233 goto badif; 234 for (ifa = rt->rt_ifp->if_addrlist; 235 ifa && ifa->ifa_addr->sa_family != AF_LINK; 236 ifa = ifa->ifa_next){} 237 if (ifa && rt->rt_ifa) { 238 ifpaddr = ifa->ifa_addr; 239 ADVANCE(len, ifpaddr); 240 ifaaddr = rt->rt_ifa->ifa_addr; 241 ADVANCE(len, ifaaddr); 242 rtm->rtm_addrs |= RTA_IFP | RTA_IFA; 243 } else { 244 badif: ifpaddr = 0; 245 rtm->rtm_addrs &= ~(RTA_IFP | RTA_IFA); 246 } 247 } 248 if (len > rtm->rtm_msglen) { 249 struct rt_msghdr *new_rtm; 250 R_Malloc(new_rtm, struct rt_msghdr *, len); 251 if (new_rtm == 0) 252 senderr(ENOBUFS); 253 Bcopy(rtm, new_rtm, rtm->rtm_msglen); 254 Free(rtm); rtm = new_rtm; 255 } 256 rtm->rtm_msglen = len; 257 rtm->rtm_flags = rt->rt_flags; 258 rtm->rtm_rmx = rt->rt_rmx; 259 cp = (caddr_t) (1 + rtm); 260 len = ROUNDUP(dst->sa_len); 261 Bcopy(dst, cp, len); cp += len; 262 if (gate) { 263 len = ROUNDUP(gate->sa_len); 264 Bcopy(gate, cp, len); cp += len; 265 } 266 if (netmask) { 267 len = ROUNDUP(netmask->sa_len); 268 Bcopy(netmask, cp, len); cp += len; 269 } 270 if (genmask) { 271 len = ROUNDUP(genmask->sa_len); 272 Bcopy(genmask, cp, len); cp += len; 273 } 274 if (ifpaddr) { 275 len = ROUNDUP(ifpaddr->sa_len); 276 Bcopy(ifpaddr, cp, len); cp += len; 277 len = ROUNDUP(ifaaddr->sa_len); 278 Bcopy(ifaaddr, cp, len); cp += len; 279 } 280 break; 281 282 case RTM_CHANGE: 283 if (gate && 284 (gate->sa_len > (len = rt->rt_gateway->sa_len))) 285 senderr(EDQUOT); 286 /* new gateway could require new ifaddr, ifp; 287 flags may also be different; ifp may be specified 288 by ll sockaddr when protocol address is ambiguous */ 289 if (ifpaddr && (ifa = ifa_ifwithnet(ifpaddr)) && 290 (ifp = ifa->ifa_ifp)) 291 ifa = ifaof_ifpforaddr(ifaaddr ? ifaaddr : gate, 292 ifp); 293 else if ((ifaaddr && (ifa = ifa_ifwithaddr(ifaaddr))) || 294 (ifa = ifa_ifwithroute(rt->rt_flags, 295 rt_key(rt), gate))) 296 ifp = ifa->ifa_ifp; 297 if (ifa) { 298 register struct ifaddr *oifa = rt->rt_ifa; 299 if (oifa != ifa) { 300 if (oifa && oifa->ifa_rtrequest) 301 oifa->ifa_rtrequest(RTM_DELETE, 302 rt, gate); 303 rt->rt_ifa = ifa; 304 rt->rt_ifp = ifp; 305 } 306 } 307 if (gate) 308 Bcopy(gate, rt->rt_gateway, len); 309 rt_setmetrics(rtm->rtm_inits, &rtm->rtm_rmx, 310 &rt->rt_rmx); 311 if (rt->rt_ifa && rt->rt_ifa->ifa_rtrequest) 312 rt->rt_ifa->ifa_rtrequest(RTM_ADD, rt, gate); 313 if (genmask) 314 rt->rt_genmask = genmask; 315 /* 316 * Fall into 317 */ 318 case RTM_LOCK: 319 rt->rt_rmx.rmx_locks |= 320 (rtm->rtm_inits & rtm->rtm_rmx.rmx_locks); 321 rt->rt_rmx.rmx_locks &= ~(rtm->rtm_inits); 322 break; 323 } 324 goto cleanup; 325 326 default: 327 senderr(EOPNOTSUPP); 328 } 329 330 flush: 331 if (rtm) { 332 if (error) 333 rtm->rtm_errno = error; 334 else 335 rtm->rtm_flags |= RTF_DONE; 336 } 337 cleanup: 338 if (rt) 339 rtfree(rt); 340 { 341 register struct rawcb *rp = 0; 342 /* 343 * Check to see if we don't want our own messages. 344 */ 345 if ((so->so_options & SO_USELOOPBACK) == 0) { 346 if (route_cb.any_count <= 1) { 347 if (rtm) 348 Free(rtm); 349 m_freem(m); 350 return (error); 351 } 352 /* There is another listener, so construct message */ 353 rp = sotorawcb(so); 354 } 355 if (rtm) { 356 m_copyback(m, 0, rtm->rtm_msglen, (caddr_t)rtm); 357 Free(rtm); 358 } 359 if (rp) 360 rp->rcb_proto.sp_family = 0; /* Avoid us */ 361 if (dst) 362 route_proto.sp_protocol = dst->sa_family; 363 raw_input(m, &route_proto, &route_src, &route_dst); 364 if (rp) 365 rp->rcb_proto.sp_family = PF_ROUTE; 366 } 367 return (error); 368 } 369 370 rt_setmetrics(which, in, out) 371 u_long which; 372 register struct rt_metrics *in, *out; 373 { 374 #define metric(f, e) if (which & (f)) out->e = in->e; 375 metric(RTV_RPIPE, rmx_recvpipe); 376 metric(RTV_SPIPE, rmx_sendpipe); 377 metric(RTV_SSTHRESH, rmx_ssthresh); 378 metric(RTV_RTT, rmx_rtt); 379 metric(RTV_RTTVAR, rmx_rttvar); 380 metric(RTV_HOPCOUNT, rmx_hopcount); 381 metric(RTV_MTU, rmx_mtu); 382 metric(RTV_EXPIRE, rmx_expire); 383 #undef metric 384 } 385 386 /* 387 * Copy data from a buffer back into the indicated mbuf chain, 388 * starting "off" bytes from the beginning, extending the mbuf 389 * chain if necessary. 390 */ 391 m_copyback(m0, off, len, cp) 392 struct mbuf *m0; 393 register int off; 394 register int len; 395 caddr_t cp; 396 397 { 398 register int mlen; 399 register struct mbuf *m = m0, *n; 400 int totlen = 0; 401 402 if (m0 == 0) 403 return; 404 while (off > (mlen = m->m_len)) { 405 off -= mlen; 406 totlen += mlen; 407 if (m->m_next == 0) { 408 n = m_getclr(M_DONTWAIT, m->m_type); 409 if (n == 0) 410 goto out; 411 n->m_len = min(MLEN, len + off); 412 m->m_next = n; 413 } 414 m = m->m_next; 415 } 416 while (len > 0) { 417 mlen = min (m->m_len - off, len); 418 bcopy(cp, off + mtod(m, caddr_t), (unsigned)mlen); 419 cp += mlen; 420 len -= mlen; 421 mlen += off; 422 off = 0; 423 totlen += mlen; 424 if (len == 0) 425 break; 426 if (m->m_next == 0) { 427 n = m_get(M_DONTWAIT, m->m_type); 428 if (n == 0) 429 break; 430 n->m_len = min(MLEN, len); 431 m->m_next = n; 432 } 433 m = m->m_next; 434 } 435 out: if (((m = m0)->m_flags & M_PKTHDR) && (m->m_pkthdr.len < totlen)) 436 m->m_pkthdr.len = totlen; 437 } 438 439 /* 440 * The miss message and losing message are very similar. 441 */ 442 443 rt_missmsg(type, dst, gate, mask, src, flags, error) 444 register struct sockaddr *dst; 445 struct sockaddr *gate, *mask, *src; 446 { 447 register struct rt_msghdr *rtm; 448 register struct mbuf *m; 449 int dlen = ROUNDUP(dst->sa_len); 450 int len = dlen + sizeof(*rtm); 451 452 if (route_cb.any_count == 0) 453 return; 454 m = m_gethdr(M_DONTWAIT, MT_DATA); 455 if (m == 0) 456 return; 457 m->m_pkthdr.len = m->m_len = min(len, MHLEN); 458 m->m_pkthdr.rcvif = 0; 459 rtm = mtod(m, struct rt_msghdr *); 460 bzero((caddr_t)rtm, sizeof(*rtm)); /*XXX assumes sizeof(*rtm) < MHLEN*/ 461 rtm->rtm_flags = RTF_DONE | flags; 462 rtm->rtm_msglen = len; 463 rtm->rtm_version = RTM_VERSION; 464 rtm->rtm_type = type; 465 rtm->rtm_addrs = RTA_DST; 466 if (type == RTM_OLDADD || type == RTM_OLDDEL) { 467 rtm->rtm_pid = curproc->p_pid; 468 } 469 m_copyback(m, sizeof (*rtm), dlen, (caddr_t)dst); 470 if (gate) { 471 dlen = ROUNDUP(gate->sa_len); 472 m_copyback(m, len , dlen, (caddr_t)gate); 473 len += dlen; 474 rtm->rtm_addrs |= RTA_GATEWAY; 475 } 476 if (mask) { 477 dlen = ROUNDUP(mask->sa_len); 478 m_copyback(m, len , dlen, (caddr_t)mask); 479 len += dlen; 480 rtm->rtm_addrs |= RTA_NETMASK; 481 } 482 if (src) { 483 dlen = ROUNDUP(src->sa_len); 484 m_copyback(m, len , dlen, (caddr_t)src); 485 len += dlen; 486 rtm->rtm_addrs |= RTA_AUTHOR; 487 } 488 if (m->m_pkthdr.len != len) { 489 m_freem(m); 490 return; 491 } 492 rtm->rtm_errno = error; 493 rtm->rtm_msglen = len; 494 route_proto.sp_protocol = dst->sa_family; 495 raw_input(m, &route_proto, &route_src, &route_dst); 496 } 497 498 #include "kinfo.h" 499 struct walkarg { 500 int w_op, w_arg; 501 int w_given, w_needed; 502 caddr_t w_where; 503 struct { 504 struct rt_msghdr m_rtm; 505 char m_sabuf[128]; 506 } w_m; 507 #define w_rtm w_m.m_rtm 508 }; 509 /* 510 * This is used in dumping the kernel table via getkinfo(). 511 */ 512 rt_dumpentry(rn, w) 513 struct radix_node *rn; 514 register struct walkarg *w; 515 { 516 register struct sockaddr *sa; 517 int n, error; 518 519 for (; rn; rn = rn->rn_dupedkey) { 520 int count = 0, size = sizeof(w->w_rtm); 521 register struct rtentry *rt = (struct rtentry *)rn; 522 523 if (rn->rn_flags & RNF_ROOT) 524 continue; 525 if (w->w_op == KINFO_RT_FLAGS && !(rt->rt_flags & w->w_arg)) 526 continue; 527 #define next(a, l) {size += (l); w->w_rtm.rtm_addrs |= (a); } 528 w->w_rtm.rtm_addrs = 0; 529 if (sa = rt_key(rt)) 530 next(RTA_DST, ROUNDUP(sa->sa_len)); 531 if (sa = rt->rt_gateway) 532 next(RTA_GATEWAY, ROUNDUP(sa->sa_len)); 533 if (sa = rt_mask(rt)) 534 next(RTA_NETMASK, ROUNDUP(sa->sa_len)); 535 if (sa = rt->rt_genmask) 536 next(RTA_GENMASK, ROUNDUP(sa->sa_len)); 537 w->w_needed += size; 538 if (w->w_where == NULL || w->w_needed > 0) 539 continue; 540 w->w_rtm.rtm_msglen = size; 541 w->w_rtm.rtm_flags = rt->rt_flags; 542 w->w_rtm.rtm_use = rt->rt_use; 543 w->w_rtm.rtm_rmx = rt->rt_rmx; 544 w->w_rtm.rtm_index = rt->rt_ifp->if_index; 545 #undef next 546 #define next(l) {n = (l); Bcopy(sa, cp, n); cp += n;} 547 if (size <= sizeof(w->w_m)) { 548 register caddr_t cp = (caddr_t)(w->w_m.m_sabuf); 549 if (sa = rt_key(rt)) 550 next(ROUNDUP(sa->sa_len)); 551 if (sa = rt->rt_gateway) 552 next(ROUNDUP(sa->sa_len)); 553 if (sa = rt_mask(rt)) 554 next(ROUNDUP(sa->sa_len)); 555 if (sa = rt->rt_genmask) 556 next(ROUNDUP(sa->sa_len)); 557 #undef next 558 #define next(s, l) {n = (l); \ 559 if (error = copyout((caddr_t)(s), w->w_where, n)) return (error); \ 560 w->w_where += n;} 561 562 next(&w->w_m, size); /* Copy rtmsg and sockaddrs back */ 563 continue; 564 } 565 next(&w->w_rtm, sizeof(w->w_rtm)); 566 if (sa = rt_key(rt)) 567 next(sa, ROUNDUP(sa->sa_len)); 568 if (sa = rt->rt_gateway) 569 next(sa, ROUNDUP(sa->sa_len)); 570 if (sa = rt_mask(rt)) 571 next(sa, ROUNDUP(sa->sa_len)); 572 if (sa = rt->rt_genmask) 573 next(sa, ROUNDUP(sa->sa_len)); 574 } 575 return (0); 576 #undef next 577 } 578 579 kinfo_rtable(op, where, given, arg, needed) 580 int op, arg; 581 caddr_t where; 582 int *given, *needed; 583 { 584 register struct radix_node_head *rnh; 585 int s, error = 0; 586 u_char af = ki_af(op); 587 struct walkarg w; 588 589 op &= 0xffff; 590 if (op != KINFO_RT_DUMP && op != KINFO_RT_FLAGS) 591 return (EINVAL); 592 593 Bzero(&w, sizeof(w)); 594 if ((w.w_where = where) && given) 595 w.w_given = *given; 596 w.w_needed = 0 - w.w_given; 597 w.w_arg = arg; 598 w.w_op = op; 599 w.w_rtm.rtm_version = RTM_VERSION; 600 w.w_rtm.rtm_type = RTM_GET; 601 602 s = splnet(); 603 for (rnh = radix_node_head; rnh; rnh = rnh->rnh_next) { 604 if (rnh->rnh_af == 0) 605 continue; 606 if (af && af != rnh->rnh_af) 607 continue; 608 error = rt_walk(rnh->rnh_treetop, rt_dumpentry, &w); 609 if (error) 610 break; 611 } 612 w.w_needed += w.w_given; 613 if (where && given) 614 *given = w.w_where - where; 615 else 616 w.w_needed = (11 * w.w_needed) / 10; 617 *needed = w.w_needed; 618 splx(s); 619 return (error); 620 } 621 622 rt_walk(rn, f, w) 623 register struct radix_node *rn; 624 register int (*f)(); 625 struct walkarg *w; 626 { 627 int error; 628 for (;;) { 629 while (rn->rn_b >= 0) 630 rn = rn->rn_l; /* First time through node, go left */ 631 if (error = (*f)(rn, w)) 632 return (error); /* Process Leaf */ 633 while (rn->rn_p->rn_r == rn) { /* if coming back from right */ 634 rn = rn->rn_p; /* go back up */ 635 if (rn->rn_flags & RNF_ROOT) 636 return 0; 637 } 638 rn = rn->rn_p->rn_r; /* otherwise, go right*/ 639 } 640 } 641 642 /* 643 * Definitions of protocols supported in the ROUTE domain. 644 */ 645 646 int raw_init(),raw_usrreq(),raw_input(),raw_ctlinput(); 647 extern struct domain routedomain; /* or at least forward */ 648 649 struct protosw routesw[] = { 650 { SOCK_RAW, &routedomain, 0, PR_ATOMIC|PR_ADDR, 651 raw_input, route_output, raw_ctlinput, 0, 652 route_usrreq, 653 raw_init, 0, 0, 0, 654 } 655 }; 656 657 int unp_externalize(), unp_dispose(); 658 659 struct domain routedomain = 660 { PF_ROUTE, "route", 0, 0, 0, 661 routesw, &routesw[sizeof(routesw)/sizeof(routesw[0])] }; 662
Indexes created Fri Oct 03 02:09:57 GMT 2025