[apple/network_cmds.git] / routed.tproj / output.c

/*
 * Copyright (c) 1999 Apple Computer, Inc. All rights reserved.
 *
 * @APPLE_LICENSE_HEADER_START@
 * 
 * "Portions Copyright (c) 1999 Apple Computer, Inc.  All Rights
 * Reserved.  This file contains Original Code and/or Modifications of
 * Original Code as defined in and that are subject to the Apple Public
 * Source License Version 1.0 (the 'License').  You may not use this file
 * except in compliance with the License.  Please obtain a copy of the
 * License at http://www.apple.com/publicsource and read it before using
 * this file.
 * 
 * The Original Code and all software distributed under the License are
 * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT.  Please see the
 * License for the specific language governing rights and limitations
 * under the License."
 * 
 * @APPLE_LICENSE_HEADER_END@
 */
/*
 * Copyright (c) 1983, 1988, 1993
 *	The Regents of the University of California.  All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. All advertising materials mentioning features or use of this software
 *    must display the following acknowledgment:
 *	This product includes software developed by the University of
 *	California, Berkeley and its contributors.
 * 4. Neither the name of the University nor the names of its contributors
 *    may be used to endorse or promote products derived from this software
 *    without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 *
 *	@(#)defs.h	8.1 (Berkeley) 6/5/93
 */


/*
 * Routing Table Management Daemon
 */
#include "defs.h"

/*
 * Apply the function "f" to all non-passive
 * interfaces.  If the interface supports the
 * use of broadcasting use it, otherwise address
 * the output to the known router.
 */
toall(f, rtstate, skipif)
	int (*f)();
	int rtstate;
	struct interface *skipif;
{
	register struct interface *ifp;
	register struct sockaddr *dst;
	register int flags;
	extern struct interface *ifnet;

	for (ifp = ifnet; ifp; ifp = ifp->int_next) {
		if (ifp->int_flags & IFF_PASSIVE || ifp == skipif)
			continue;
		dst = ifp->int_flags & IFF_BROADCAST ? &ifp->int_broadaddr :
		      ifp->int_flags & IFF_POINTOPOINT ? &ifp->int_dstaddr :
		      &ifp->int_addr;
		flags = ifp->int_flags & IFF_INTERFACE ? MSG_DONTROUTE : 0;
		(*f)(dst, flags, ifp, rtstate);
	}
}

/*
 * Output a preformed packet.
 */
/*ARGSUSED*/
sndmsg(dst, flags, ifp, rtstate)
	struct sockaddr *dst;
	int flags;
	struct interface *ifp;
	int rtstate;
{

	(*afswitch[dst->sa_family].af_output)(s, flags,
		dst, sizeof (struct rip));
	TRACE_OUTPUT(ifp, dst, sizeof (struct rip));
}

/*
 * Supply dst with the contents of the routing tables.
 * If this won't fit in one packet, chop it up into several.
 */
supply(dst, flags, ifp, rtstate)
	struct sockaddr *dst;
	int flags;
	register struct interface *ifp;
	int rtstate;
{
	register struct rt_entry *rt;
	register struct netinfo *n = msg->rip_nets;
	register struct rthash *rh;
	struct rthash *base = hosthash;
	int doinghost = 1, size;
	int (*output)() = afswitch[dst->sa_family].af_output;
	int (*sendroute)() = afswitch[dst->sa_family].af_sendroute;
	int npackets = 0;

	msg->rip_cmd = RIPCMD_RESPONSE;
	msg->rip_vers = RIPVERSION;
	memset(msg->rip_res1, 0, sizeof(msg->rip_res1));
again:
	for (rh = base; rh < &base[ROUTEHASHSIZ]; rh++)
	for (rt = rh->rt_forw; rt != (struct rt_entry *)rh; rt = rt->rt_forw) {
		/*
		 * Don't resend the information on the network
		 * from which it was received (unless sending
		 * in response to a query).
		 */
		if (ifp && rt->rt_ifp == ifp &&
		    (rt->rt_state & RTS_INTERFACE) == 0)
			continue;
		if (rt->rt_state & RTS_EXTERNAL)
			continue;
		/*
		 * For dynamic updates, limit update to routes
		 * with the specified state.
		 */
		if (rtstate && (rt->rt_state & rtstate) == 0)
			continue;
		/*
		 * Limit the spread of subnet information
		 * to those who are interested.
		 */
		if (doinghost == 0 && rt->rt_state & RTS_SUBNET) {
			if (rt->rt_dst.sa_family != dst->sa_family)
				continue;
			if ((*sendroute)(rt, dst) == 0)
				continue;
		}
		size = (char *)n - packet;
		if (size > MAXPACKETSIZE - sizeof (struct netinfo)) {
			TRACE_OUTPUT(ifp, dst, size);
			(*output)(s, flags, dst, size);
			/*
			 * If only sending to ourselves,
			 * one packet is enough to monitor interface.
			 */
			if (ifp && (ifp->int_flags &
			   (IFF_BROADCAST | IFF_POINTOPOINT | IFF_REMOTE)) == 0)
				return;
			n = msg->rip_nets;
			npackets++;
		}
		n->rip_dst = rt->rt_dst;
#if BSD < 198810
		if (sizeof(n->rip_dst.sa_family) > 1)	/* XXX */
		n->rip_dst.sa_family = htons(n->rip_dst.sa_family);
#else
#define osa(x) ((struct osockaddr *)(&(x)))
		osa(n->rip_dst)->sa_family = htons(n->rip_dst.sa_family);
#endif
		n->rip_metric = htonl(rt->rt_metric);
		n++;
	}
	if (doinghost) {
		doinghost = 0;
		base = nethash;
		goto again;
	}
	if (n != msg->rip_nets || (npackets == 0 && rtstate == 0)) {
		size = (char *)n - packet;
		TRACE_OUTPUT(ifp, dst, size);
		(*output)(s, flags, dst, size);
	}
}
Commit	Line	Data
b7080c8e A	1	/*
	2	* Copyright (c) 1999 Apple Computer, Inc. All rights reserved.
	3	*
	4	* @APPLE_LICENSE_HEADER_START@
	5	*
2b484d24 A	6	* "Portions Copyright (c) 1999 Apple Computer, Inc. All Rights
	7	* Reserved. This file contains Original Code and/or Modifications of
	8	* Original Code as defined in and that are subject to the Apple Public
	9	* Source License Version 1.0 (the 'License'). You may not use this file
	10	* except in compliance with the License. Please obtain a copy of the
	11	* License at http://www.apple.com/publicsource and read it before using
	12	* this file.
b7080c8e A	13	*
	14	* The Original Code and all software distributed under the License are
	15	* distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
	16	* EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
	17	* INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
2b484d24 A	18	* FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT. Please see the
	19	* License for the specific language governing rights and limitations
	20	* under the License."
b7080c8e A	21	*
	22	* @APPLE_LICENSE_HEADER_END@
	23	*/
	24	/*
	25	* Copyright (c) 1983, 1988, 1993
	26	* The Regents of the University of California. All rights reserved.
	27	*
	28	* Redistribution and use in source and binary forms, with or without
	29	* modification, are permitted provided that the following conditions
	30	* are met:
	31	* 1. Redistributions of source code must retain the above copyright
	32	* notice, this list of conditions and the following disclaimer.
	33	* 2. Redistributions in binary form must reproduce the above copyright
	34	* notice, this list of conditions and the following disclaimer in the
	35	* documentation and/or other materials provided with the distribution.
	36	* 3. All advertising materials mentioning features or use of this software
	37	* must display the following acknowledgment:
	38	* This product includes software developed by the University of
	39	* California, Berkeley and its contributors.
	40	* 4. Neither the name of the University nor the names of its contributors
	41	* may be used to endorse or promote products derived from this software
	42	* without specific prior written permission.
	43	*
	44	* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
	45	* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
	46	* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
	47	* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
	48	* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
	49	* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
	50	* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
	51	* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
	52	* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
	53	* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
	54	* SUCH DAMAGE.
	55	*
	56	* @(#)defs.h 8.1 (Berkeley) 6/5/93
	57	*/
	58
	59
	60	/*
	61	* Routing Table Management Daemon
	62	*/
	63	#include "defs.h"
	64
	65	/*
	66	* Apply the function "f" to all non-passive
	67	* interfaces. If the interface supports the
	68	* use of broadcasting use it, otherwise address
	69	* the output to the known router.
	70	*/
	71	toall(f, rtstate, skipif)
	72	int (*f)();
	73	int rtstate;
	74	struct interface *skipif;
	75	{
	76	register struct interface *ifp;
	77	register struct sockaddr *dst;
	78	register int flags;
	79	extern struct interface *ifnet;
	80
	81	for (ifp = ifnet; ifp; ifp = ifp->int_next) {
	82	if (ifp->int_flags & IFF_PASSIVE \|\| ifp == skipif)
	83	continue;
	84	dst = ifp->int_flags & IFF_BROADCAST ? &ifp->int_broadaddr :
85	ifp->int_flags & IFF_POINTOPOINT ? &ifp->int_dstaddr :
86	&ifp->int_addr;
87	flags = ifp->int_flags & IFF_INTERFACE ? MSG_DONTROUTE : 0;
88	(*f)(dst, flags, ifp, rtstate);
89	}
90	}
91
92	/*
93	* Output a preformed packet.
94	*/
95	/ARGSUSED/
96	sndmsg(dst, flags, ifp, rtstate)
97	struct sockaddr *dst;
98	int flags;
99	struct interface *ifp;
100	int rtstate;
101	{
102
103	(*afswitch[dst->sa_family].af_output)(s, flags,
104	dst, sizeof (struct rip));
105	TRACE_OUTPUT(ifp, dst, sizeof (struct rip));
106	}
107
108	/*
109	* Supply dst with the contents of the routing tables.
110	* If this won't fit in one packet, chop it up into several.
111	*/
112	supply(dst, flags, ifp, rtstate)
113	struct sockaddr *dst;
114	int flags;
115	register struct interface *ifp;
116	int rtstate;
117	{
118	register struct rt_entry *rt;
119	register struct netinfo *n = msg->rip_nets;
120	register struct rthash *rh;
121	struct rthash *base = hosthash;
122	int doinghost = 1, size;
123	int (*output)() = afswitch[dst->sa_family].af_output;
124	int (*sendroute)() = afswitch[dst->sa_family].af_sendroute;
125	int npackets = 0;
126
127	msg->rip_cmd = RIPCMD_RESPONSE;
128	msg->rip_vers = RIPVERSION;
129	memset(msg->rip_res1, 0, sizeof(msg->rip_res1));
130	again:
131	for (rh = base; rh < &base[ROUTEHASHSIZ]; rh++)
132	for (rt = rh->rt_forw; rt != (struct rt_entry *)rh; rt = rt->rt_forw) {
133	/*
134	* Don't resend the information on the network
135	* from which it was received (unless sending
136	* in response to a query).
137	*/
138	if (ifp && rt->rt_ifp == ifp &&
139	(rt->rt_state & RTS_INTERFACE) == 0)
140	continue;
141	if (rt->rt_state & RTS_EXTERNAL)
142	continue;
143	/*
144	* For dynamic updates, limit update to routes
145	* with the specified state.
146	*/
147	if (rtstate && (rt->rt_state & rtstate) == 0)
148	continue;
149	/*
150	* Limit the spread of subnet information
151	* to those who are interested.
152	*/
153	if (doinghost == 0 && rt->rt_state & RTS_SUBNET) {
154	if (rt->rt_dst.sa_family != dst->sa_family)
155	continue;
156	if ((*sendroute)(rt, dst) == 0)
157	continue;
158	}
159	size = (char *)n - packet;
160	if (size > MAXPACKETSIZE - sizeof (struct netinfo)) {
161	TRACE_OUTPUT(ifp, dst, size);
162	(*output)(s, flags, dst, size);
163	/*
164	* If only sending to ourselves,
165	* one packet is enough to monitor interface.
166	*/
167	if (ifp && (ifp->int_flags &
168	(IFF_BROADCAST \| IFF_POINTOPOINT \| IFF_REMOTE)) == 0)
169	return;
170	n = msg->rip_nets;
171	npackets++;
172	}
173	n->rip_dst = rt->rt_dst;
174	#if BSD < 198810
175	if (sizeof(n->rip_dst.sa_family) > 1) /* XXX */
176	n->rip_dst.sa_family = htons(n->rip_dst.sa_family);
177	#else
178	#define osa(x) ((struct osockaddr *)(&(x)))
179	osa(n->rip_dst)->sa_family = htons(n->rip_dst.sa_family);
180	#endif
181	n->rip_metric = htonl(rt->rt_metric);
182	n++;
183	}
184	if (doinghost) {
185	doinghost = 0;
186	base = nethash;
187	goto again;
188	}
189	if (n != msg->rip_nets \|\| (npackets == 0 && rtstate == 0)) {
190	size = (char *)n - packet;
191	TRACE_OUTPUT(ifp, dst, size);
192	(*output)(s, flags, dst, size);
193	}
194	}