1 /*- 2 * SPDX-License-Identifier: BSD-3-Clause 3 * 4 * Copyright (c) 1983, 1988, 1993 5 * The Regents of the University of California. All rights reserved. 6 * 7 * Redistribution and use in source and binary forms, with or without 8 * modification, are permitted provided that the following conditions 9 * are met: 10 * 1. Redistributions of source code must retain the above copyright 11 * notice, this list of conditions and the following disclaimer. 12 * 2. Redistributions in binary form must reproduce the above copyright 13 * notice, this list of conditions and the following disclaimer in the 14 * documentation and/or other materials provided with the distribution. 15 * 3. Neither the name of the University nor the names of its contributors 16 * may be used to endorse or promote products derived from this software 17 * without specific prior written permission. 18 * 19 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 22 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 29 * SUCH DAMAGE. 30 * 31 * @(#)defs.h 8.1 (Berkeley) 6/5/93 32 */ 33 34 35 /* Definitions for RIPv2 routing process. 36 * 37 * This code is based on the 4.4BSD `routed` daemon, with extensions to 38 * support: 39 * RIPv2, including variable length subnet masks. 40 * Router Discovery 41 * aggregate routes in the kernel tables. 42 * aggregate advertised routes. 43 * maintain spare routes for faster selection of another gateway 44 * when the current gateway dies. 45 * timers on routes with second granularity so that selection 46 * of a new route does not wait 30-60 seconds. 47 * tolerance of static routes. 48 * tell the kernel hop counts 49 * do not advertise if ipforwarding=0 50 * 51 * The vestigial support for other protocols has been removed. There 52 * is no likelihood that IETF RIPv1 or RIPv2 will ever be used with 53 * other protocols. The result is far smaller, faster, cleaner, and 54 * perhaps understandable. 55 * 56 * The accumulation of special flags and kludges added over the many 57 * years have been simplified and integrated. 58 */ 59 60 #include <assert.h> 61 #include <stdio.h> 62 #include <netdb.h> 63 #include <stdlib.h> 64 #include <unistd.h> 65 #include <errno.h> 66 #include <string.h> 67 #include <stdarg.h> 68 #include <syslog.h> 69 #include <time.h> 70 #include <sys/cdefs.h> 71 #include <sys/time.h> 72 #include <sys/types.h> 73 #include <sys/param.h> 74 #include <sys/ioctl.h> 75 #include <sys/sysctl.h> 76 #include <sys/socket.h> 77 #include <sys/queue.h> 78 #include "radix.h" 79 #define UNUSED __attribute__((unused)) 80 #define PATTRIB(f,l) __attribute__((format (printf,f,l))) 81 #include <net/if.h> 82 #include <net/route.h> 83 #include <net/if_dl.h> 84 #include <netinet/in.h> 85 #include <arpa/inet.h> 86 #define RIPVERSION RIPv2 87 #include <protocols/routed.h> 88 89 #ifndef __RCSID 90 #define __RCSID(_s) static const char rcsid[] UNUSED = _s 91 #endif 92 #ifndef __COPYRIGHT 93 #define __COPYRIGHT(_s) static const char copyright[] UNUSED = _s 94 #endif 95 96 /* Type of an IP address. 97 * Some systems do not like to pass structures, so do not use in_addr. 98 * Some systems think a long has 64 bits, which would be a gross waste. 99 * So define it here so it can be changed for the target system. 100 * It should be defined somewhere netinet/in.h, but it is not. 101 */ 102 #define naddr u_long 103 #define _HAVE_SA_LEN 104 #define _HAVE_SIN_LEN 105 106 #define DAY (24*60*60) 107 #define NEVER DAY /* a long time */ 108 #define EPOCH NEVER /* bias time by this to avoid <0 */ 109 110 /* Scan the kernel regularly to see if any interfaces have appeared or been 111 * turned off. These must be less than STALE_TIME. 112 */ 113 #define CHECK_BAD_INTERVAL 5 /* when an interface is known bad */ 114 #define CHECK_ACT_INTERVAL 30 /* when advertising */ 115 #define CHECK_QUIET_INTERVAL 300 /* when not */ 116 117 #define LIM_SEC(s,l) ((s).tv_sec = MIN((s).tv_sec, (l))) 118 119 /* Metric used for fake default routes. It ought to be 15, but when 120 * processing advertised routes, previous versions of `routed` added 121 * to the received metric and discarded the route if the total was 16 122 * or larger. 123 */ 124 #define FAKE_METRIC (HOPCNT_INFINITY-2) 125 126 127 /* Router Discovery parameters */ 128 #define INADDR_ALLROUTERS_GROUP 0xe0000002 /* 224.0.0.2 */ 129 #define MaxMaxAdvertiseInterval 1800 130 #define MinMaxAdvertiseInterval 4 131 #define DefMaxAdvertiseInterval 600 132 #define MIN_PreferenceLevel 0x80000000 133 134 #define MAX_INITIAL_ADVERT_INTERVAL 16 135 #define MAX_INITIAL_ADVERTS 3 136 137 #define MAX_SOLICITATION_DELAY 1 138 #define SOLICITATION_INTERVAL 3 139 #define MAX_SOLICITATIONS 3 140 141 142 /* Bloated packet size for systems that simply add authentication to 143 * full-sized packets 144 */ 145 #define OVER_MAXPACKETSIZE (MAXPACKETSIZE+sizeof(struct netinfo)*2) 146 /* typical packet buffers */ 147 union pkt_buf { 148 char packet[OVER_MAXPACKETSIZE*2]; 149 struct rip rip; 150 }; 151 152 #define GNAME_LEN 64 /* assumed=64 in parms.c */ 153 /* bigger than IFNAMSIZ, with room for "external()" or "remote()" */ 154 #define IF_NAME_LEN (GNAME_LEN+15) 155 156 /* No more routes than this, to protect ourself in case something goes 157 * whacko and starts broadcasting zillions of bogus routes. 158 */ 159 #define MAX_ROUTES (128*1024) 160 extern int total_routes; 161 162 /* Main, daemon routing table structure 163 */ 164 struct rt_entry { 165 struct radix_node rt_nodes[2]; /* radix tree glue */ 166 u_int rt_state; 167 # define RS_IF 0x001 /* for network interface */ 168 # define RS_NET_INT 0x002 /* authority route */ 169 # define RS_NET_SYN 0x004 /* fake net route for subnet */ 170 # define RS_NO_NET_SYN (RS_LOCAL | RS_LOCAL | RS_IF) 171 # define RS_SUBNET 0x008 /* subnet route from any source */ 172 # define RS_LOCAL 0x010 /* loopback for pt-to-pt */ 173 # define RS_MHOME 0x020 /* from -m */ 174 # define RS_STATIC 0x040 /* from the kernel */ 175 # define RS_RDISC 0x080 /* from router discovery */ 176 struct sockaddr_in rt_dst_sock; 177 naddr rt_mask; 178 struct rt_spare { 179 struct interface *rts_ifp; 180 naddr rts_gate; /* forward packets here */ 181 naddr rts_router; /* on the authority of this router */ 182 char rts_metric; 183 u_short rts_tag; 184 time_t rts_time; /* timer to junk stale routes */ 185 u_int rts_de_ag; /* de-aggregation level */ 186 #define NUM_SPARES 4 187 } rt_spares[NUM_SPARES]; 188 u_int rt_seqno; /* when last changed */ 189 char rt_poison_metric; /* to notice maximum recently */ 190 time_t rt_poison_time; /* advertised metric */ 191 }; 192 #define rt_dst rt_dst_sock.sin_addr.s_addr 193 #define rt_ifp rt_spares[0].rts_ifp 194 #define rt_gate rt_spares[0].rts_gate 195 #define rt_router rt_spares[0].rts_router 196 #define rt_metric rt_spares[0].rts_metric 197 #define rt_tag rt_spares[0].rts_tag 198 #define rt_time rt_spares[0].rts_time 199 #define rt_de_ag rt_spares[0].rts_de_ag 200 201 #define HOST_MASK 0xffffffff 202 #define RT_ISHOST(rt) ((rt)->rt_mask == HOST_MASK) 203 204 /* age all routes that 205 * are not from -g, -m, or static routes from the kernel 206 * not unbroken interface routes 207 * but not broken interfaces 208 * nor non-passive, remote interfaces that are not aliases 209 * (i.e. remote & metric=0) 210 */ 211 #define AGE_RT(rt_state,ifp) (0 == ((rt_state) & (RS_MHOME | RS_STATIC \ 212 | RS_NET_SYN | RS_RDISC)) \ 213 && (!((rt_state) & RS_IF) \ 214 || (ifp) == 0 \ 215 || (((ifp)->int_state & IS_REMOTE) \ 216 && !((ifp)->int_state & IS_PASSIVE)))) 217 218 /* true if A is better than B 219 * Better if 220 * - A is not a poisoned route 221 * - and A is not stale 222 * - and A has a shorter path 223 * - or is the router speaking for itself 224 * - or the current route is equal but stale 225 * - or it is a host route advertised by a system for itself 226 */ 227 #define BETTER_LINK(rt,A,B) ((A)->rts_metric < HOPCNT_INFINITY \ 228 && now_stale <= (A)->rts_time \ 229 && ((A)->rts_metric < (B)->rts_metric \ 230 || ((A)->rts_gate == (A)->rts_router \ 231 && (B)->rts_gate != (B)->rts_router) \ 232 || ((A)->rts_metric == (B)->rts_metric \ 233 && now_stale > (B)->rts_time) \ 234 || (RT_ISHOST(rt) \ 235 && (rt)->rt_dst == (A)->rts_router \ 236 && (A)->rts_metric == (B)->rts_metric))) 237 238 239 /* An "interface" is similar to a kernel ifnet structure, except it also 240 * handles "logical" or "IS_REMOTE" interfaces (remote gateways). 241 */ 242 struct interface { 243 LIST_ENTRY(interface) int_list; 244 LIST_ENTRY(interface) remote_list; 245 struct interface *int_ahash, **int_ahash_prev; 246 struct interface *int_bhash, **int_bhash_prev; 247 struct interface *int_nhash, **int_nhash_prev; 248 char int_name[IF_NAME_LEN+1]; 249 u_short int_index; 250 naddr int_addr; /* address on this host (net order) */ 251 naddr int_brdaddr; /* broadcast address (n) */ 252 naddr int_dstaddr; /* other end of pt-to-pt link (n) */ 253 naddr int_net; /* working network # (host order)*/ 254 naddr int_mask; /* working net mask (host order) */ 255 naddr int_ripv1_mask; /* for inferring a mask (n) */ 256 naddr int_std_addr; /* class A/B/C address (n) */ 257 naddr int_std_net; /* class A/B/C network (h) */ 258 naddr int_std_mask; /* class A/B/C netmask (h) */ 259 int int_rip_sock; /* for queries */ 260 int int_if_flags; /* some bits copied from kernel */ 261 u_int int_state; 262 time_t int_act_time; /* last thought healthy */ 263 time_t int_query_time; 264 u_short int_transitions; /* times gone up-down */ 265 char int_metric; 266 u_char int_d_metric; /* for faked default route */ 267 u_char int_adj_inmetric; /* adjust advertised metrics */ 268 u_char int_adj_outmetric; /* instead of interface metric */ 269 struct int_data { 270 u_int ipackets; /* previous network stats */ 271 u_int ierrors; 272 u_int opackets; 273 u_int oerrors; 274 time_t ts; /* timestamp on network stats */ 275 } int_data; 276 # define MAX_AUTH_KEYS 5 277 struct auth { /* authentication info */ 278 u_int16_t type; 279 u_char key[RIP_AUTH_PW_LEN]; 280 u_char keyid; 281 time_t start, end; 282 } int_auth[MAX_AUTH_KEYS]; 283 /* router discovery parameters */ 284 int int_rdisc_pref; /* signed preference to advertise */ 285 int int_rdisc_int; /* MaxAdvertiseInterval */ 286 int int_rdisc_cnt; 287 struct timeval int_rdisc_timer; 288 }; 289 290 /* bits in int_state */ 291 #define IS_ALIAS 0x0000001 /* interface alias */ 292 #define IS_SUBNET 0x0000002 /* interface on subnetted network */ 293 #define IS_REMOTE 0x0000004 /* interface is not on this machine */ 294 #define IS_PASSIVE 0x0000008 /* remote and does not do RIP */ 295 #define IS_EXTERNAL 0x0000010 /* handled by EGP or something */ 296 #define IS_CHECKED 0x0000020 /* still exists */ 297 #define IS_ALL_HOSTS 0x0000040 /* in INADDR_ALLHOSTS_GROUP */ 298 #define IS_ALL_ROUTERS 0x0000080 /* in INADDR_ALLROUTERS_GROUP */ 299 #define IS_DISTRUST 0x0000100 /* ignore untrusted routers */ 300 #define IS_REDIRECT_OK 0x0000200 /* accept ICMP redirects */ 301 #define IS_BROKE 0x0000400 /* seems to be broken */ 302 #define IS_SICK 0x0000800 /* seems to be broken */ 303 #define IS_DUP 0x0001000 /* has a duplicate address */ 304 #define IS_NEED_NET_SYN 0x0002000 /* need RS_NET_SYN route */ 305 #define IS_NO_AG 0x0004000 /* do not aggregate subnets */ 306 #define IS_NO_SUPER_AG 0x0008000 /* do not aggregate networks */ 307 #define IS_NO_RIPV1_IN 0x0010000 /* no RIPv1 input at all */ 308 #define IS_NO_RIPV2_IN 0x0020000 /* no RIPv2 input at all */ 309 #define IS_NO_RIP_IN (IS_NO_RIPV1_IN | IS_NO_RIPV2_IN) 310 #define IS_RIP_IN_OFF(s) (((s) & IS_NO_RIP_IN) == IS_NO_RIP_IN) 311 #define IS_NO_RIPV1_OUT 0x0040000 /* no RIPv1 output at all */ 312 #define IS_NO_RIPV2_OUT 0x0080000 /* no RIPv2 output at all */ 313 #define IS_NO_RIP_OUT (IS_NO_RIPV1_OUT | IS_NO_RIPV2_OUT) 314 #define IS_NO_RIP (IS_NO_RIP_OUT | IS_NO_RIP_IN) 315 #define IS_RIP_OUT_OFF(s) (((s) & IS_NO_RIP_OUT) == IS_NO_RIP_OUT) 316 #define IS_RIP_OFF(s) (((s) & IS_NO_RIP) == IS_NO_RIP) 317 #define IS_NO_RIP_MCAST 0x0100000 /* broadcast RIPv2 */ 318 #define IS_NO_ADV_IN 0x0200000 /* do not listen to advertisements */ 319 #define IS_NO_SOL_OUT 0x0400000 /* send no solicitations */ 320 #define IS_SOL_OUT 0x0800000 /* send solicitations */ 321 #define GROUP_IS_SOL_OUT (IS_SOL_OUT | IS_NO_SOL_OUT) 322 #define IS_NO_ADV_OUT 0x1000000 /* do not advertise rdisc */ 323 #define IS_ADV_OUT 0x2000000 /* advertise rdisc */ 324 #define GROUP_IS_ADV_OUT (IS_NO_ADV_OUT | IS_ADV_OUT) 325 #define IS_BCAST_RDISC 0x4000000 /* broadcast instead of multicast */ 326 #define IS_NO_RDISC (IS_NO_ADV_IN | IS_NO_SOL_OUT | IS_NO_ADV_OUT) 327 #define IS_PM_RDISC 0x8000000 /* poor-man's router discovery */ 328 329 #define iff_up(f) ((f) & IFF_UP) 330 331 LIST_HEAD(ifhead, interface); 332 333 /* Information for aggregating routes */ 334 #define NUM_AG_SLOTS 32 335 struct ag_info { 336 struct ag_info *ag_fine; /* slot with finer netmask */ 337 struct ag_info *ag_cors; /* more coarse netmask */ 338 naddr ag_dst_h; /* destination in host byte order */ 339 naddr ag_mask; 340 naddr ag_gate; 341 naddr ag_nhop; 342 char ag_metric; /* metric to be advertised */ 343 char ag_pref; /* aggregate based on this */ 344 u_int ag_seqno; 345 u_short ag_tag; 346 u_short ag_state; 347 #define AGS_SUPPRESS 0x001 /* combine with coarser mask */ 348 #define AGS_AGGREGATE 0x002 /* synthesize combined routes */ 349 #define AGS_REDUN0 0x004 /* redundant, finer routes output */ 350 #define AGS_REDUN1 0x008 351 #define AG_IS_REDUN(state) (((state) & (AGS_REDUN0 | AGS_REDUN1)) \ 352 == (AGS_REDUN0 | AGS_REDUN1)) 353 #define AGS_GATEWAY 0x010 /* tell kernel RTF_GATEWAY */ 354 #define AGS_IF 0x020 /* for an interface */ 355 #define AGS_RIPV2 0x040 /* send only as RIPv2 */ 356 #define AGS_FINE_GATE 0x080 /* ignore differing ag_gate when this 357 * has the finer netmask */ 358 #define AGS_CORS_GATE 0x100 /* ignore differing gate when this 359 * has the coarser netmasks */ 360 #define AGS_SPLIT_HZ 0x200 /* suppress for split horizon */ 361 362 /* some bits are set if they are set on either route */ 363 #define AGS_AGGREGATE_EITHER (AGS_RIPV2 | AGS_GATEWAY | \ 364 AGS_SUPPRESS | AGS_CORS_GATE) 365 }; 366 367 368 /* parameters for interfaces */ 369 struct parm { 370 struct parm *parm_next; 371 char parm_name[IF_NAME_LEN+1]; 372 naddr parm_net; 373 naddr parm_mask; 374 375 u_char parm_d_metric; 376 u_char parm_adj_inmetric; 377 char parm_adj_outmetric; 378 u_int parm_int_state; 379 int parm_rdisc_pref; /* signed IRDP preference */ 380 int parm_rdisc_int; /* IRDP advertising interval */ 381 struct auth parm_auth[MAX_AUTH_KEYS]; 382 }; 383 384 /* authority for internal networks */ 385 extern struct intnet { 386 struct intnet *intnet_next; 387 naddr intnet_addr; /* network byte order */ 388 naddr intnet_mask; 389 char intnet_metric; 390 } *intnets; 391 392 /* defined RIPv1 netmasks */ 393 extern struct r1net { 394 struct r1net *r1net_next; 395 naddr r1net_net; /* host order */ 396 naddr r1net_match; 397 naddr r1net_mask; 398 } *r1nets; 399 400 /* trusted routers */ 401 extern struct tgate { 402 struct tgate *tgate_next; 403 naddr tgate_addr; 404 #define MAX_TGATE_NETS 32 405 struct tgate_net { 406 naddr net; /* host order */ 407 naddr mask; 408 } tgate_nets[MAX_TGATE_NETS]; 409 } *tgates; 410 411 enum output_type {OUT_QUERY, OUT_UNICAST, OUT_BROADCAST, OUT_MULTICAST, 412 NO_OUT_MULTICAST, NO_OUT_RIPV2}; 413 414 /* common output buffers */ 415 extern struct ws_buf { 416 struct rip *buf; 417 struct netinfo *n; 418 struct netinfo *base; 419 struct netinfo *lim; 420 enum output_type type; 421 } v12buf; 422 423 extern pid_t mypid; 424 extern naddr myaddr; /* main address of this system */ 425 426 extern int stopint; /* !=0 to stop */ 427 428 extern int rip_sock; /* RIP socket */ 429 extern const struct interface *rip_sock_mcast; /* current multicast interface */ 430 extern int rt_sock; /* routing socket */ 431 extern int rt_sock_seqno; 432 extern int rdisc_sock; /* router-discovery raw socket */ 433 434 extern int supplier; /* process should supply updates */ 435 extern int supplier_set; /* -s or -q requested */ 436 extern int ridhosts; /* 1=reduce host routes */ 437 extern int mhome; /* 1=want multi-homed host route */ 438 extern int advertise_mhome; /* 1=must continue advertising it */ 439 extern int auth_ok; /* 1=ignore auth if we do not care */ 440 extern int insecure; /* Reply to special queries or not */ 441 442 extern struct timeval clk; /* system clock's idea of time */ 443 extern struct timeval epoch; /* system clock when started */ 444 extern struct timeval now; /* current idea of time */ 445 extern time_t now_stale; 446 extern time_t now_expire; 447 extern time_t now_garbage; 448 449 extern struct timeval age_timer; /* next check of old routes */ 450 extern struct timeval no_flash; /* inhibit flash update until then */ 451 extern struct timeval rdisc_timer; /* next advert. or solicitation */ 452 extern int rdisc_ok; /* using solicited route */ 453 454 extern struct timeval ifinit_timer; /* time to check interfaces */ 455 456 extern naddr loopaddr; /* our address on loopback */ 457 extern int tot_interfaces; /* # of remote and local interfaces */ 458 extern int rip_interfaces; /* # of interfaces doing RIP */ 459 extern struct ifhead ifnet; /* all interfaces */ 460 extern struct ifhead remote_if; /* remote interfaces */ 461 extern int have_ripv1_out; /* have a RIPv1 interface */ 462 extern int need_flash; /* flash update needed */ 463 extern struct timeval need_kern; /* need to update kernel table */ 464 extern u_int update_seqno; /* a route has changed */ 465 466 extern int tracelevel, new_tracelevel; 467 #define MAX_TRACELEVEL 4 468 #define TRACEKERNEL (tracelevel >= 4) /* log kernel changes */ 469 #define TRACECONTENTS (tracelevel >= 3) /* display packet contents */ 470 #define TRACEPACKETS (tracelevel >= 2) /* note packets */ 471 #define TRACEACTIONS (tracelevel != 0) 472 extern FILE *ftrace; /* output trace file */ 473 extern char inittracename[PATH_MAX]; 474 475 extern struct radix_node_head *rhead; 476 477 478 479 void fix_sock(int, const char *); 480 void fix_select(void); 481 void rip_off(void); 482 void rip_on(struct interface *); 483 484 void bufinit(void); 485 int output(enum output_type, struct sockaddr_in *, 486 struct interface *, struct rip *, int); 487 void clr_ws_buf(struct ws_buf *, struct auth *); 488 void rip_query(void); 489 void rip_bcast(int); 490 void supply(struct sockaddr_in *, struct interface *, 491 enum output_type, int, int, int); 492 493 void msglog(const char *, ...) PATTRIB(1,2); 494 struct msg_limit { 495 time_t reuse; 496 struct msg_sub { 497 naddr addr; 498 time_t until; 499 # define MSG_SUBJECT_N 8 500 } subs[MSG_SUBJECT_N]; 501 }; 502 void msglim(struct msg_limit *, naddr, 503 const char *, ...) PATTRIB(3,4); 504 #define LOGERR(msg) msglog(msg ": %s", strerror(errno)) 505 void logbad(int, const char *, ...) PATTRIB(2,3); 506 #define BADERR(dump,msg) logbad(dump,msg ": %s", strerror(errno)) 507 #ifdef DEBUG 508 #define DBGERR(dump,msg) BADERR(dump,msg) 509 #else 510 #define DBGERR(dump,msg) LOGERR(msg) 511 #endif 512 char *naddr_ntoa(naddr); 513 const char *saddr_ntoa(struct sockaddr *); 514 515 void *rtmalloc(size_t, const char *); 516 void timevaladd(struct timeval *, struct timeval *); 517 void intvl_random(struct timeval *, u_long, u_long); 518 int getnet(char *, naddr *, naddr *); 519 int gethost(char *, naddr *); 520 void gwkludge(void); 521 const char *parse_parms(char *, int); 522 const char *check_parms(struct parm *); 523 void get_parms(struct interface *); 524 525 void lastlog(void); 526 void trace_close(int); 527 void set_tracefile(const char *, const char *, int); 528 void tracelevel_msg(const char *, int); 529 void trace_off(const char*, ...) PATTRIB(1,2); 530 void set_tracelevel(void); 531 void trace_flush(void); 532 void trace_misc(const char *, ...) PATTRIB(1,2); 533 void trace_act(const char *, ...) PATTRIB(1,2); 534 void trace_pkt(const char *, ...) PATTRIB(1,2); 535 void trace_add_del(const char *, struct rt_entry *); 536 void trace_change(struct rt_entry *, u_int, struct rt_spare *, 537 const char *); 538 void trace_if(const char *, struct interface *); 539 void trace_upslot(struct rt_entry *, struct rt_spare *, 540 struct rt_spare *); 541 void trace_rip(const char*, const char*, struct sockaddr_in *, 542 struct interface *, struct rip *, int); 543 char *addrname(naddr, naddr, int); 544 char *rtname(naddr, naddr, naddr); 545 546 void rdisc_age(naddr); 547 void set_rdisc_mg(struct interface *, int); 548 void set_supplier(void); 549 void if_bad_rdisc(struct interface *); 550 void if_ok_rdisc(struct interface *); 551 void read_rip(int, struct interface *); 552 void read_rt(void); 553 void read_d(void); 554 void rdisc_adv(void); 555 void rdisc_sol(void); 556 557 void sigtrace_on(int); 558 void sigtrace_off(int); 559 560 void flush_kern(void); 561 void age(naddr); 562 563 void ag_flush(naddr, naddr, void (*)(struct ag_info *)); 564 void ag_check(naddr, naddr, naddr, naddr, char, char, u_int, 565 u_short, u_short, void (*)(struct ag_info *)); 566 void del_static(naddr, naddr, naddr, int); 567 void del_redirects(naddr, time_t); 568 struct rt_entry *rtget(naddr, naddr); 569 struct rt_entry *rtfind(naddr); 570 void rtinit(void); 571 void rtadd(naddr, naddr, u_int, struct rt_spare *); 572 void rtchange(struct rt_entry *, u_int, struct rt_spare *, char *); 573 void rtdelete(struct rt_entry *); 574 void rts_delete(struct rt_entry *, struct rt_spare *); 575 void rtbad_sub(struct rt_entry *); 576 void rtswitch(struct rt_entry *, struct rt_spare *); 577 578 #define S_ADDR(x) (((struct sockaddr_in *)(x))->sin_addr.s_addr) 579 #define INFO_DST(I) ((I)->rti_info[RTAX_DST]) 580 #define INFO_GATE(I) ((I)->rti_info[RTAX_GATEWAY]) 581 #define INFO_MASK(I) ((I)->rti_info[RTAX_NETMASK]) 582 #define INFO_IFA(I) ((I)->rti_info[RTAX_IFA]) 583 #define INFO_AUTHOR(I) ((I)->rti_info[RTAX_AUTHOR]) 584 #define INFO_BRD(I) ((I)->rti_info[RTAX_BRD]) 585 void rt_xaddrs(struct rt_addrinfo *, struct sockaddr *, struct sockaddr *, 586 int); 587 588 naddr std_mask(naddr); 589 naddr ripv1_mask_net(naddr, struct interface *); 590 naddr ripv1_mask_host(naddr,struct interface *); 591 #define on_net(a,net,mask) (((ntohl(a) ^ (net)) & (mask)) == 0) 592 int check_dst(naddr); 593 struct interface *check_dup(naddr, naddr, naddr, int); 594 int check_remote(struct interface *); 595 void ifinit(void); 596 int walk_bad(struct radix_node *, struct walkarg *); 597 int if_ok(struct interface *, const char *); 598 void if_sick(struct interface *); 599 void if_link(struct interface *); 600 struct interface *ifwithaddr(naddr addr, int bcast, int remote); 601 struct interface *ifwithindex(u_short, int); 602 struct interface *iflookup(naddr); 603 604 struct auth *find_auth(struct interface *); 605 void end_md5_auth(struct ws_buf *, struct auth *); 606 607 #include <md5.h> 608