2 * SPDX-License-Identifier: BSD-3-Clause
4 * Copyright (c) 1983, 1988, 1993
5 * The Regents of the University of California. All rights reserved.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
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.
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
31 * @(#)defs.h 8.1 (Berkeley) 6/5/93
40 /* Definitions for RIPv2 routing process.
42 * This code is based on the 4.4BSD `routed` daemon, with extensions to
44 * RIPv2, including variable length subnet masks.
46 * aggregate routes in the kernel tables.
47 * aggregate advertised routes.
48 * maintain spare routes for faster selection of another gateway
49 * when the current gateway dies.
50 * timers on routes with second granularity so that selection
51 * of a new route does not wait 30-60 seconds.
52 * tolerance of static routes.
53 * tell the kernel hop counts
54 * do not advertise if ipforwarding=0
56 * The vestigial support for other protocols has been removed. There
57 * is no likelihood that IETF RIPv1 or RIPv2 will ever be used with
58 * other protocols. The result is far smaller, faster, cleaner, and
59 * perhaps understandable.
61 * The accumulation of special flags and kludges added over the many
62 * years have been simplified and integrated.
79 #include <sys/cdefs.h>
81 #include <sys/types.h>
82 #include <sys/param.h>
83 #include <sys/ioctl.h>
84 #include <sys/sysctl.h>
85 #include <sys/socket.h>
86 #include <sys/queue.h>
88 #define _USER_ROUTE_TREE
89 #include <net/radix.h>
92 #define UNUSED __attribute__((unused))
93 #define PATTRIB(f,l) __attribute__((format (printf,f,l)))
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>
104 #define __RCSID(_s) static const char rcsid[] UNUSED = _s
107 #define __COPYRIGHT(_s) static const char copyright[] UNUSED = _s
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.
117 #define naddr u_int32_t
118 #elif defined (__NetBSD__)
119 #define naddr u_int32_t
121 #define _HAVE_SIN_LEN
125 #define _HAVE_SIN_LEN
128 #define DAY (24*60*60)
129 #define NEVER DAY /* a long time */
130 #define EPOCH NEVER /* bias time by this to avoid <0 */
132 /* Scan the kernel regularly to see if any interfaces have appeared or been
133 * turned off. These must be less than STALE_TIME.
135 #define CHECK_BAD_INTERVAL 5 /* when an interface is known bad */
136 #define CHECK_ACT_INTERVAL 30 /* when advertising */
137 #define CHECK_QUIET_INTERVAL 300 /* when not */
139 #define LIM_SEC(s,l) ((s).tv_sec = MIN((s).tv_sec, (l)))
141 /* Metric used for fake default routes. It ought to be 15, but when
142 * processing advertised routes, previous versions of `routed` added
143 * to the received metric and discarded the route if the total was 16
146 #define FAKE_METRIC (HOPCNT_INFINITY-2)
149 /* Router Discovery parameters */
151 #define INADDR_ALLROUTERS_GROUP 0xe0000002 /* 224.0.0.2 */
153 #define MaxMaxAdvertiseInterval 1800
154 #define MinMaxAdvertiseInterval 4
155 #define DefMaxAdvertiseInterval 600
156 #define MIN_PreferenceLevel 0x80000000
158 #define MAX_INITIAL_ADVERT_INTERVAL 16
159 #define MAX_INITIAL_ADVERTS 3
161 #define MAX_SOLICITATION_DELAY 1
162 #define SOLICITATION_INTERVAL 3
163 #define MAX_SOLICITATIONS 3
166 /* Bloated packet size for systems that simply add authentication to
169 #define OVER_MAXPACKETSIZE (MAXPACKETSIZE+sizeof(struct netinfo)*2)
170 /* typical packet buffers */
172 char packet[OVER_MAXPACKETSIZE*2];
176 #define GNAME_LEN 64 /* assumed=64 in parms.c */
177 /* bigger than IFNAMSIZ, with room for "external()" or "remote()" */
178 #define IF_NAME_LEN (GNAME_LEN+15)
180 /* No more routes than this, to protect ourself in case something goes
181 * whacko and starts broadcasting zillions of bogus routes.
183 #define MAX_ROUTES (128*1024)
184 extern int total_routes;
186 /* Main, daemon routing table structure
189 struct radix_node rt_nodes[2]; /* radix tree glue */
191 # define RS_IF 0x001 /* for network interface */
192 # define RS_NET_INT 0x002 /* authority route */
193 # define RS_NET_SYN 0x004 /* fake net route for subnet */
194 # define RS_NO_NET_SYN (RS_LOCAL | RS_LOCAL | RS_IF)
195 # define RS_SUBNET 0x008 /* subnet route from any source */
196 # define RS_LOCAL 0x010 /* loopback for pt-to-pt */
197 # define RS_MHOME 0x020 /* from -m */
198 # define RS_STATIC 0x040 /* from the kernel */
199 # define RS_RDISC 0x080 /* from router discovery */
200 struct sockaddr_in rt_dst_sock;
203 struct interface *rts_ifp;
204 naddr rts_gate; /* forward packets here */
205 naddr rts_router; /* on the authority of this router */
208 time_t rts_time; /* timer to junk stale routes */
209 u_int rts_de_ag; /* de-aggregation level */
211 } rt_spares[NUM_SPARES];
212 u_int rt_seqno; /* when last changed */
213 char rt_poison_metric; /* to notice maximum recently */
214 time_t rt_poison_time; /* advertised metric */
216 #define rt_dst rt_dst_sock.sin_addr.s_addr
217 #define rt_ifp rt_spares[0].rts_ifp
218 #define rt_gate rt_spares[0].rts_gate
219 #define rt_router rt_spares[0].rts_router
220 #define rt_metric rt_spares[0].rts_metric
221 #define rt_tag rt_spares[0].rts_tag
222 #define rt_time rt_spares[0].rts_time
223 #define rt_de_ag rt_spares[0].rts_de_ag
225 #define HOST_MASK 0xffffffff
226 #define RT_ISHOST(rt) ((rt)->rt_mask == HOST_MASK)
228 /* age all routes that
229 * are not from -g, -m, or static routes from the kernel
230 * not unbroken interface routes
231 * but not broken interfaces
232 * nor non-passive, remote interfaces that are not aliases
233 * (i.e. remote & metric=0)
235 #define AGE_RT(rt_state,ifp) (0 == ((rt_state) & (RS_MHOME | RS_STATIC \
236 | RS_NET_SYN | RS_RDISC)) \
237 && (!((rt_state) & RS_IF) \
239 || (((ifp)->int_state & IS_REMOTE) \
240 && !((ifp)->int_state & IS_PASSIVE))))
242 /* true if A is better than B
244 * - A is not a poisoned route
245 * - and A is not stale
246 * - and A has a shorter path
247 * - or is the router speaking for itself
248 * - or the current route is equal but stale
249 * - or it is a host route advertised by a system for itself
251 #define BETTER_LINK(rt,A,B) ((A)->rts_metric < HOPCNT_INFINITY \
252 && now_stale <= (A)->rts_time \
253 && ((A)->rts_metric < (B)->rts_metric \
254 || ((A)->rts_gate == (A)->rts_router \
255 && (B)->rts_gate != (B)->rts_router) \
256 || ((A)->rts_metric == (B)->rts_metric \
257 && now_stale > (B)->rts_time) \
259 && (rt)->rt_dst == (A)->rts_router \
260 && (A)->rts_metric == (B)->rts_metric)))
263 /* An "interface" is similar to a kernel ifnet structure, except it also
264 * handles "logical" or "IS_REMOTE" interfaces (remote gateways).
267 LIST_ENTRY(interface) int_list;
268 LIST_ENTRY(interface) remote_list;
269 struct interface *int_ahash, **int_ahash_prev;
270 struct interface *int_bhash, **int_bhash_prev;
271 struct interface *int_nhash, **int_nhash_prev;
272 char int_name[IF_NAME_LEN+1];
274 naddr int_addr; /* address on this host (net order) */
275 naddr int_brdaddr; /* broadcast address (n) */
276 naddr int_dstaddr; /* other end of pt-to-pt link (n) */
277 naddr int_net; /* working network # (host order)*/
278 naddr int_mask; /* working net mask (host order) */
279 naddr int_ripv1_mask; /* for inferring a mask (n) */
280 naddr int_std_addr; /* class A/B/C address (n) */
281 naddr int_std_net; /* class A/B/C network (h) */
282 naddr int_std_mask; /* class A/B/C netmask (h) */
283 int int_rip_sock; /* for queries */
284 int int_if_flags; /* some bits copied from kernel */
286 time_t int_act_time; /* last thought healthy */
287 time_t int_query_time;
288 u_short int_transitions; /* times gone up-down */
290 u_char int_d_metric; /* for faked default route */
291 u_char int_adj_inmetric; /* adjust advertised metrics */
292 u_char int_adj_outmetric; /* instead of interface metric */
294 u_int ipackets; /* previous network stats */
301 time_t ts; /* timestamp on network stats */
303 # define MAX_AUTH_KEYS 5
304 struct auth { /* authentication info */
306 u_char key[RIP_AUTH_PW_LEN];
309 } int_auth[MAX_AUTH_KEYS];
310 /* router discovery parameters */
311 int int_rdisc_pref; /* signed preference to advertise */
312 int int_rdisc_int; /* MaxAdvertiseInterval */
314 struct timeval int_rdisc_timer;
317 /* bits in int_state */
318 #define IS_ALIAS 0x0000001 /* interface alias */
319 #define IS_SUBNET 0x0000002 /* interface on subnetted network */
320 #define IS_REMOTE 0x0000004 /* interface is not on this machine */
321 #define IS_PASSIVE 0x0000008 /* remote and does not do RIP */
322 #define IS_EXTERNAL 0x0000010 /* handled by EGP or something */
323 #define IS_CHECKED 0x0000020 /* still exists */
324 #define IS_ALL_HOSTS 0x0000040 /* in INADDR_ALLHOSTS_GROUP */
325 #define IS_ALL_ROUTERS 0x0000080 /* in INADDR_ALLROUTERS_GROUP */
326 #define IS_DISTRUST 0x0000100 /* ignore untrusted routers */
327 #define IS_REDIRECT_OK 0x0000200 /* accept ICMP redirects */
328 #define IS_BROKE 0x0000400 /* seems to be broken */
329 #define IS_SICK 0x0000800 /* seems to be broken */
330 #define IS_DUP 0x0001000 /* has a duplicate address */
331 #define IS_NEED_NET_SYN 0x0002000 /* need RS_NET_SYN route */
332 #define IS_NO_AG 0x0004000 /* do not aggregate subnets */
333 #define IS_NO_SUPER_AG 0x0008000 /* do not aggregate networks */
334 #define IS_NO_RIPV1_IN 0x0010000 /* no RIPv1 input at all */
335 #define IS_NO_RIPV2_IN 0x0020000 /* no RIPv2 input at all */
336 #define IS_NO_RIP_IN (IS_NO_RIPV1_IN | IS_NO_RIPV2_IN)
337 #define IS_RIP_IN_OFF(s) (((s) & IS_NO_RIP_IN) == IS_NO_RIP_IN)
338 #define IS_NO_RIPV1_OUT 0x0040000 /* no RIPv1 output at all */
339 #define IS_NO_RIPV2_OUT 0x0080000 /* no RIPv2 output at all */
340 #define IS_NO_RIP_OUT (IS_NO_RIPV1_OUT | IS_NO_RIPV2_OUT)
341 #define IS_NO_RIP (IS_NO_RIP_OUT | IS_NO_RIP_IN)
342 #define IS_RIP_OUT_OFF(s) (((s) & IS_NO_RIP_OUT) == IS_NO_RIP_OUT)
343 #define IS_RIP_OFF(s) (((s) & IS_NO_RIP) == IS_NO_RIP)
344 #define IS_NO_RIP_MCAST 0x0100000 /* broadcast RIPv2 */
345 #define IS_NO_ADV_IN 0x0200000 /* do not listen to advertisements */
346 #define IS_NO_SOL_OUT 0x0400000 /* send no solicitations */
347 #define IS_SOL_OUT 0x0800000 /* send solicitations */
348 #define GROUP_IS_SOL_OUT (IS_SOL_OUT | IS_NO_SOL_OUT)
349 #define IS_NO_ADV_OUT 0x1000000 /* do not advertise rdisc */
350 #define IS_ADV_OUT 0x2000000 /* advertise rdisc */
351 #define GROUP_IS_ADV_OUT (IS_NO_ADV_OUT | IS_ADV_OUT)
352 #define IS_BCAST_RDISC 0x4000000 /* broadcast instead of multicast */
353 #define IS_NO_RDISC (IS_NO_ADV_IN | IS_NO_SOL_OUT | IS_NO_ADV_OUT)
354 #define IS_PM_RDISC 0x8000000 /* poor-man's router discovery */
356 #define iff_up(f) ((f) & IFF_UP)
358 LIST_HEAD(ifhead, interface);
360 /* Information for aggregating routes */
361 #define NUM_AG_SLOTS 32
363 struct ag_info *ag_fine; /* slot with finer netmask */
364 struct ag_info *ag_cors; /* more coarse netmask */
365 naddr ag_dst_h; /* destination in host byte order */
369 char ag_metric; /* metric to be advertised */
370 char ag_pref; /* aggregate based on this */
374 #define AGS_SUPPRESS 0x001 /* combine with coarser mask */
375 #define AGS_AGGREGATE 0x002 /* synthesize combined routes */
376 #define AGS_REDUN0 0x004 /* redundant, finer routes output */
377 #define AGS_REDUN1 0x008
378 #define AG_IS_REDUN(state) (((state) & (AGS_REDUN0 | AGS_REDUN1)) \
379 == (AGS_REDUN0 | AGS_REDUN1))
380 #define AGS_GATEWAY 0x010 /* tell kernel RTF_GATEWAY */
381 #define AGS_IF 0x020 /* for an interface */
382 #define AGS_RIPV2 0x040 /* send only as RIPv2 */
383 #define AGS_FINE_GATE 0x080 /* ignore differing ag_gate when this
384 * has the finer netmask */
385 #define AGS_CORS_GATE 0x100 /* ignore differing gate when this
386 * has the coarser netmasks */
387 #define AGS_SPLIT_HZ 0x200 /* suppress for split horizon */
389 /* some bits are set if they are set on either route */
390 #define AGS_AGGREGATE_EITHER (AGS_RIPV2 | AGS_GATEWAY | \
391 AGS_SUPPRESS | AGS_CORS_GATE)
395 /* parameters for interfaces */
397 struct parm *parm_next;
398 char parm_name[IF_NAME_LEN+1];
402 u_char parm_d_metric;
403 u_char parm_adj_inmetric;
404 char parm_adj_outmetric;
405 u_int parm_int_state;
406 int parm_rdisc_pref; /* signed IRDP preference */
407 int parm_rdisc_int; /* IRDP advertising interval */
408 struct auth parm_auth[MAX_AUTH_KEYS];
411 /* authority for internal networks */
412 extern struct intnet {
413 struct intnet *intnet_next;
414 naddr intnet_addr; /* network byte order */
419 /* defined RIPv1 netmasks */
420 extern struct r1net {
421 struct r1net *r1net_next;
422 naddr r1net_net; /* host order */
427 /* trusted routers */
428 extern struct tgate {
429 struct tgate *tgate_next;
431 #define MAX_TGATE_NETS 32
433 naddr net; /* host order */
435 } tgate_nets[MAX_TGATE_NETS];
438 enum output_type {OUT_QUERY, OUT_UNICAST, OUT_BROADCAST, OUT_MULTICAST,
439 NO_OUT_MULTICAST, NO_OUT_RIPV2};
441 /* common output buffers */
442 extern struct ws_buf {
445 struct netinfo *base;
447 enum output_type type;
451 extern naddr myaddr; /* main address of this system */
453 extern int stopint; /* !=0 to stop */
455 extern int rip_sock; /* RIP socket */
456 extern const struct interface *rip_sock_mcast; /* current multicast interface */
457 extern int rt_sock; /* routing socket */
458 extern int rt_sock_seqno;
459 extern int rdisc_sock; /* router-discovery raw socket */
461 extern int supplier; /* process should supply updates */
462 extern int supplier_set; /* -s or -q requested */
463 extern int ridhosts; /* 1=reduce host routes */
464 extern int mhome; /* 1=want multi-homed host route */
465 extern int advertise_mhome; /* 1=must continue advertising it */
466 extern int auth_ok; /* 1=ignore auth if we do not care */
467 extern int insecure; /* Reply to special queries or not */
469 extern struct timeval clk; /* system clock's idea of time */
470 extern struct timeval epoch; /* system clock when started */
471 extern struct timeval now; /* current idea of time */
472 extern time_t now_stale;
473 extern time_t now_expire;
474 extern time_t now_garbage;
476 extern struct timeval age_timer; /* next check of old routes */
477 extern struct timeval no_flash; /* inhibit flash update until then */
478 extern struct timeval rdisc_timer; /* next advert. or solicitation */
479 extern int rdisc_ok; /* using solicited route */
481 extern struct timeval ifinit_timer; /* time to check interfaces */
483 extern naddr loopaddr; /* our address on loopback */
484 extern int tot_interfaces; /* # of remote and local interfaces */
485 extern int rip_interfaces; /* # of interfaces doing RIP */
486 extern struct ifhead ifnet; /* all interfaces */
487 extern struct ifhead remote_if; /* remote interfaces */
488 extern int have_ripv1_out; /* have a RIPv1 interface */
489 extern int need_flash; /* flash update needed */
490 extern struct timeval need_kern; /* need to update kernel table */
491 extern u_int update_seqno; /* a route has changed */
493 extern int tracelevel, new_tracelevel;
494 #define MAX_TRACELEVEL 4
495 #define TRACEKERNEL (tracelevel >= 4) /* log kernel changes */
496 #define TRACECONTENTS (tracelevel >= 3) /* display packet contents */
497 #define TRACEPACKETS (tracelevel >= 2) /* note packets */
498 #define TRACEACTIONS (tracelevel != 0)
499 extern FILE *ftrace; /* output trace file */
500 extern char inittracename[PATH_MAX];
502 extern struct radix_node_head *rhead;
507 #define dup2(x,y) BSDdup2(x,y)
510 void fix_sock(int, const char *);
511 void fix_select(void);
513 void rip_on(struct interface *);
516 int output(enum output_type, struct sockaddr_in *,
517 struct interface *, struct rip *, int);
518 void clr_ws_buf(struct ws_buf *, struct auth *);
519 void rip_query(void);
521 void supply(struct sockaddr_in *, struct interface *,
522 enum output_type, int, int, int);
524 void msglog(const char *, ...) PATTRIB(1,2);
530 # define MSG_SUBJECT_N 8
531 } subs[MSG_SUBJECT_N];
533 void msglim(struct msg_limit *, naddr,
534 const char *, ...) PATTRIB(3,4);
535 #define LOGERR(msg) msglog(msg ": %s", strerror(errno))
536 void logbad(int, const char *, ...) PATTRIB(2,3);
537 #define BADERR(dump,msg) logbad(dump,msg ": %s", strerror(errno))
539 #define DBGERR(dump,msg) BADERR(dump,msg)
541 #define DBGERR(dump,msg) LOGERR(msg)
543 char *naddr_ntoa(naddr);
544 const char *saddr_ntoa(struct sockaddr *);
546 void *rtmalloc(size_t, const char *);
547 void timevaladd(struct timeval *, struct timeval *);
548 void intvl_random(struct timeval *, u_long, u_long);
549 int getnet(char *, naddr *, naddr *);
550 int gethost(char *, naddr *);
552 const char *parse_parms(char *, int);
553 const char *check_parms(struct parm *);
554 void get_parms(struct interface *);
557 void trace_close(int);
558 void set_tracefile(const char *, const char *, int);
559 void tracelevel_msg(const char *, int);
560 void trace_off(const char*, ...) PATTRIB(1,2);
561 void set_tracelevel(void);
562 void trace_flush(void);
563 void trace_misc(const char *, ...) PATTRIB(1,2);
564 void trace_act(const char *, ...) PATTRIB(1,2);
565 void trace_pkt(const char *, ...) PATTRIB(1,2);
566 void trace_add_del(const char *, struct rt_entry *);
567 void trace_change(struct rt_entry *, u_int, struct rt_spare *,
569 void trace_if(const char *, struct interface *);
570 void trace_upslot(struct rt_entry *, struct rt_spare *,
572 void trace_rip(const char*, const char*, struct sockaddr_in *,
573 struct interface *, struct rip *, int);
574 char *addrname(naddr, naddr, int);
575 char *rtname(naddr, naddr, naddr);
577 void rdisc_age(naddr);
578 void set_rdisc_mg(struct interface *, int);
579 void set_supplier(void);
580 void if_bad_rdisc(struct interface *);
581 void if_ok_rdisc(struct interface *);
582 void read_rip(int, struct interface *);
585 void rdisc_adv(void);
586 void rdisc_sol(void);
588 void sigtrace_on(int);
589 void sigtrace_off(int);
591 void flush_kern(void);
594 void ag_flush(naddr, naddr, void (*)(struct ag_info *));
595 void ag_check(naddr, naddr, naddr, naddr, char, char, u_int,
596 u_short, u_short, void (*)(struct ag_info *));
597 void del_static(naddr, naddr, naddr, int);
598 void del_redirects(naddr, time_t);
599 struct rt_entry *rtget(naddr, naddr);
600 struct rt_entry *rtfind(naddr);
602 void rtadd(naddr, naddr, u_int, struct rt_spare *);
603 void rtchange(struct rt_entry *, u_int, struct rt_spare *, char *);
604 void rtdelete(struct rt_entry *);
605 void rts_delete(struct rt_entry *, struct rt_spare *);
606 void rtbad_sub(struct rt_entry *);
607 void rtswitch(struct rt_entry *, struct rt_spare *);
609 #define S_ADDR(x) (((struct sockaddr_in *)(x))->sin_addr.s_addr)
610 #define INFO_DST(I) ((I)->rti_info[RTAX_DST])
611 #define INFO_GATE(I) ((I)->rti_info[RTAX_GATEWAY])
612 #define INFO_MASK(I) ((I)->rti_info[RTAX_NETMASK])
613 #define INFO_IFA(I) ((I)->rti_info[RTAX_IFA])
614 #define INFO_AUTHOR(I) ((I)->rti_info[RTAX_AUTHOR])
615 #define INFO_BRD(I) ((I)->rti_info[RTAX_BRD])
616 void rt_xaddrs(struct rt_addrinfo *, struct sockaddr *, struct sockaddr *,
619 naddr std_mask(naddr);
620 naddr ripv1_mask_net(naddr, struct interface *);
621 naddr ripv1_mask_host(naddr,struct interface *);
622 #define on_net(a,net,mask) (((ntohl(a) ^ (net)) & (mask)) == 0)
623 int check_dst(naddr);
624 struct interface *check_dup(naddr, naddr, naddr, int);
625 int check_remote(struct interface *);
627 int walk_bad(struct radix_node *, struct walkarg *);
628 int if_ok(struct interface *, const char *);
629 void if_sick(struct interface *);
630 void if_link(struct interface *);
631 struct interface *ifwithaddr(naddr addr, int bcast, int remote);
632 struct interface *ifwithindex(u_short, int);
633 struct interface *iflookup(naddr);
635 struct auth *find_auth(struct interface *);
636 void end_md5_auth(struct ws_buf *, struct auth *);
638 #if defined(__FreeBSD__) || defined(__NetBSD__)
641 #define MD5_DIGEST_LEN 16
643 u_int32_t state[4]; /* state (ABCD) */
644 u_int32_t count[2]; /* # of bits, modulo 2^64 (LSB 1st) */
645 unsigned char buffer[64]; /* input buffer */
647 void MD5Init(MD5_CTX*);
648 void MD5Update(MD5_CTX*, u_char*, u_int);
649 void MD5Final(u_char[MD5_DIGEST_LEN], MD5_CTX*);