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