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