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