⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 ip_output.c

📁 RTEMS (Real-Time Executive for Multiprocessor Systems) is a free open source real-time operating sys
💻 C
📖 第 1 页 / 共 3 页
字号:
/* * Copyright (c) 1982, 1986, 1988, 1990, 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 acknowledgement: *	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. * *	@(#)ip_output.c	8.3 (Berkeley) 1/21/94 *	$Id: ip_output.c,v 1.1 1998/08/19 21:32:20 joel Exp $ */#define _IP_VHL#include <sys/param.h>#include <sys/queue.h>#include <sys/systm.h>#include <sys/malloc.h>#include <sys/mbuf.h>#include <sys/errno.h>#include <sys/protosw.h>#include <sys/socket.h>#include <sys/socketvar.h>#include <net/if.h>#include <net/route.h>#include <netinet/in.h>#include <netinet/in_systm.h>#include <netinet/ip.h>#include <netinet/in_pcb.h>#include <netinet/in_var.h>#include <netinet/ip_var.h>#ifdef vax#include <machine/mtpr.h>#endif#include <machine/in_cksum.h>#if !defined(COMPAT_IPFW) || COMPAT_IPFW == 1#undef COMPAT_IPFW#define COMPAT_IPFW 1#else#undef COMPAT_IPFW#endifu_short ip_id;static struct mbuf *ip_insertoptions __P((struct mbuf *, struct mbuf *, int *));static void	ip_mloopback	__P((struct ifnet *, struct mbuf *, struct sockaddr_in *, int));static int	ip_getmoptions	__P((int, struct ip_moptions *, struct mbuf **));static int	ip_optcopy __P((struct ip *, struct ip *));static int	ip_pcbopts __P((struct mbuf **, struct mbuf *));static int	ip_setmoptions	__P((int, struct ip_moptions **, struct mbuf *));extern	struct protosw inetsw[];/* * IP output.  The packet in mbuf chain m contains a skeletal IP * header (with len, off, ttl, proto, tos, src, dst). * The mbuf chain containing the packet will be freed. * The mbuf opt, if present, will not be freed. */intip_output(m0, opt, ro, flags, imo)	struct mbuf *m0;	struct mbuf *opt;	struct route *ro;	int flags;	struct ip_moptions *imo;{	struct ip *ip, *mhip;	struct ifnet *ifp;	struct mbuf *m = m0;	int hlen = sizeof (struct ip);	int len, off, error = 0;	struct sockaddr_in *dst;	struct in_ifaddr *ia;	int isbroadcast;#ifdef	DIAGNOSTIC	if ((m->m_flags & M_PKTHDR) == 0)		panic("ip_output no HDR");	if (!ro)		panic("ip_output no route, proto = %d",		      mtod(m, struct ip *)->ip_p);#endif	if (opt) {		m = ip_insertoptions(m, opt, &len);		hlen = len;	}	ip = mtod(m, struct ip *);	/*	 * Fill in IP header.	 */	if ((flags & (IP_FORWARDING|IP_RAWOUTPUT)) == 0) {		ip->ip_vhl = IP_MAKE_VHL(IPVERSION, hlen >> 2);		ip->ip_off &= IP_DF;		ip->ip_id = htons(ip_id++);		ipstat.ips_localout++;	} else {		hlen = IP_VHL_HL(ip->ip_vhl) << 2;	}	dst = (struct sockaddr_in *)&ro->ro_dst;	/*	 * If there is a cached route,	 * check that it is to the same destination	 * and is still up.  If not, free it and try again.	 */	if (ro->ro_rt && ((ro->ro_rt->rt_flags & RTF_UP) == 0 ||	   dst->sin_addr.s_addr != ip->ip_dst.s_addr)) {		RTFREE(ro->ro_rt);		ro->ro_rt = (struct rtentry *)0;	}	if (ro->ro_rt == 0) {		dst->sin_family = AF_INET;		dst->sin_len = sizeof(*dst);		dst->sin_addr = ip->ip_dst;	}	/*	 * If routing to interface only,	 * short circuit routing lookup.	 */#define ifatoia(ifa)	((struct in_ifaddr *)(ifa))#define sintosa(sin)	((struct sockaddr *)(sin))	if (flags & IP_ROUTETOIF) {		if ((ia = ifatoia(ifa_ifwithdstaddr(sintosa(dst)))) == 0 &&		    (ia = ifatoia(ifa_ifwithnet(sintosa(dst)))) == 0) {			ipstat.ips_noroute++;			error = ENETUNREACH;			goto bad;		}		ifp = ia->ia_ifp;		ip->ip_ttl = 1;		isbroadcast = in_broadcast(dst->sin_addr, ifp);	} else {		/*		 * If this is the case, we probably don't want to allocate		 * a protocol-cloned route since we didn't get one from the		 * ULP.  This lets TCP do its thing, while not burdening		 * forwarding or ICMP with the overhead of cloning a route.		 * Of course, we still want to do any cloning requested by		 * the link layer, as this is probably required in all cases		 * for correct operation (as it is for ARP).		 */		if (ro->ro_rt == 0)			rtalloc_ign(ro, RTF_PRCLONING);		if (ro->ro_rt == 0) {			ipstat.ips_noroute++;			error = EHOSTUNREACH;			goto bad;		}		ia = ifatoia(ro->ro_rt->rt_ifa);		ifp = ro->ro_rt->rt_ifp;		ro->ro_rt->rt_use++;		if (ro->ro_rt->rt_flags & RTF_GATEWAY)			dst = (struct sockaddr_in *)ro->ro_rt->rt_gateway;		if (ro->ro_rt->rt_flags & RTF_HOST)			isbroadcast = (ro->ro_rt->rt_flags & RTF_BROADCAST);		else			isbroadcast = in_broadcast(dst->sin_addr, ifp);	}	if (IN_MULTICAST(ntohl(ip->ip_dst.s_addr))) {		struct in_multi *inm;		m->m_flags |= M_MCAST;		/*		 * IP destination address is multicast.  Make sure "dst"		 * still points to the address in "ro".  (It may have been		 * changed to point to a gateway address, above.)		 */		dst = (struct sockaddr_in *)&ro->ro_dst;		/*		 * See if the caller provided any multicast options		 */		if (imo != NULL) {			ip->ip_ttl = imo->imo_multicast_ttl;			if (imo->imo_multicast_ifp != NULL)				ifp = imo->imo_multicast_ifp;			if (imo->imo_multicast_vif != -1)				ip->ip_src.s_addr =				    ip_mcast_src(imo->imo_multicast_vif);		} else			ip->ip_ttl = IP_DEFAULT_MULTICAST_TTL;		/*		 * Confirm that the outgoing interface supports multicast.		 */		if ((imo == NULL) || (imo->imo_multicast_vif == -1)) {			if ((ifp->if_flags & IFF_MULTICAST) == 0) {				ipstat.ips_noroute++;				error = ENETUNREACH;				goto bad;			}		}		/*		 * If source address not specified yet, use address		 * of outgoing interface.		 */		if (ip->ip_src.s_addr == INADDR_ANY) {			register struct in_ifaddr *ia;			for (ia = in_ifaddr; ia; ia = ia->ia_next)				if (ia->ia_ifp == ifp) {					ip->ip_src = IA_SIN(ia)->sin_addr;					break;				}		}		IN_LOOKUP_MULTI(ip->ip_dst, ifp, inm);		if (inm != NULL &&		   (imo == NULL || imo->imo_multicast_loop)) {			/*			 * If we belong to the destination multicast group			 * on the outgoing interface, and the caller did not			 * forbid loopback, loop back a copy.			 */			ip_mloopback(ifp, m, dst, hlen);		}		else {			/*			 * If we are acting as a multicast router, perform			 * multicast forwarding as if the packet had just			 * arrived on the interface to which we are about			 * to send.  The multicast forwarding function			 * recursively calls this function, using the			 * IP_FORWARDING flag to prevent infinite recursion.			 *			 * Multicasts that are looped back by ip_mloopback(),			 * above, will be forwarded by the ip_input() routine,			 * if necessary.			 */			if (ip_mrouter && (flags & IP_FORWARDING) == 0) {				/*				 * Check if rsvp daemon is running. If not, don't				 * set ip_moptions. This ensures that the packet				 * is multicast and not just sent down one link				 * as prescribed by rsvpd.				 */				if (!rsvp_on)				  imo = NULL;				if (ip_mforward(ip, ifp, m, imo) != 0) {					m_freem(m);					goto done;				}			}		}		/*		 * Multicasts with a time-to-live of zero may be looped-		 * back, above, but must not be transmitted on a network.		 * Also, multicasts addressed to the loopback interface		 * are not sent -- the above call to ip_mloopback() will		 * loop back a copy if this host actually belongs to the		 * destination group on the loopback interface.		 */		if (ip->ip_ttl == 0 || ifp->if_flags & IFF_LOOPBACK) {			m_freem(m);			goto done;		}		goto sendit;	}#ifndef notdef	/*	 * If source address not specified yet, use address	 * of outgoing interface.	 */	if (ip->ip_src.s_addr == INADDR_ANY)		ip->ip_src = IA_SIN(ia)->sin_addr;#endif	/*	 * Verify that we have any chance at all of being able to queue	 *      the packet or packet fragments	 */	if ((ifp->if_snd.ifq_len + ip->ip_len / ifp->if_mtu + 1) >=		ifp->if_snd.ifq_maxlen) {			error = ENOBUFS;			goto bad;	}	/*	 * Look for broadcast address and	 * and verify user is allowed to send	 * such a packet.	 */	if (isbroadcast) {		if ((ifp->if_flags & IFF_BROADCAST) == 0) {			error = EADDRNOTAVAIL;			goto bad;		}		if ((flags & IP_ALLOWBROADCAST) == 0) {			error = EACCES;			goto bad;		}		/* don't allow broadcast messages to be fragmented */		if ((u_short)ip->ip_len > ifp->if_mtu) {			error = EMSGSIZE;			goto bad;		}		m->m_flags |= M_BCAST;	} else {		m->m_flags &= ~M_BCAST;	}sendit:        /*	 * IpHack's section.	 * - Xlate: translate packet's addr/port (NAT).	 * - Firewall: deny/allow/etc.	 * - Wrap: fake packet's addr/port <unimpl.>	 * - Encapsulate: put it in another IP and send out. <unimp.>	 */ #ifdef COMPAT_IPFW        if (ip_nat_ptr && !(*ip_nat_ptr)(&ip, &m, ifp, IP_NAT_OUT)) {		error = EACCES; 		goto done;	}	/*	 * Check with the firewall...	 */	if (ip_fw_chk_ptr) {#ifdef IPDIVERT		ip_divert_port = (*ip_fw_chk_ptr)(&ip,		    hlen, ifp, ip_divert_ignore, &m);		ip_divert_ignore = 0;		if (ip_divert_port) {		/* Divert packet */			(*inetsw[ip_protox[IPPROTO_DIVERT]].pr_input)(m, 0);			goto done;		}#else		/* If ipfw says divert, we have to just drop packet */		if ((*ip_fw_chk_ptr)(&ip, hlen, ifp, 0, &m)) {			m_freem(m);			goto done;		}#endif		if (!m) {			error = EACCES;			goto done;		}	}#endif /* COMPAT_IPFW */	/*	 * If small enough for interface, can just send directly.	 */	if ((u_short)ip->ip_len <= ifp->if_mtu) {		ip->ip_len = htons((u_short)ip->ip_len);		ip->ip_off = htons((u_short)ip->ip_off);		ip->ip_sum = 0;		if (ip->ip_vhl == IP_VHL_BORING) {			ip->ip_sum = in_cksum_hdr(ip);		} else {			ip->ip_sum = in_cksum(m, hlen);		}		error = (*ifp->if_output)(ifp, m,				(struct sockaddr *)dst, ro->ro_rt);		goto done;	}	/*	 * Too large for interface; fragment if possible.	 * Must be able to put at least 8 bytes per fragment.	 */	if (ip->ip_off & IP_DF) {		error = EMSGSIZE;		/*		 * This case can happen if the user changed the MTU		 * of an interface after enabling IP on it.  Because		 * most netifs don't keep track of routes pointing to		 * them, there is no way for one to update all its		 * routes when the MTU is changed.		 */		if ((ro->ro_rt->rt_flags & (RTF_UP | RTF_HOST))		    && !(ro->ro_rt->rt_rmx.rmx_locks & RTV_MTU)		    && (ro->ro_rt->rt_rmx.rmx_mtu > ifp->if_mtu)) {			ro->ro_rt->rt_rmx.rmx_mtu = ifp->if_mtu;		}		ipstat.ips_cantfrag++;		goto bad;	}	len = (ifp->if_mtu - hlen) &~ 7;	if (len < 8) {		error = EMSGSIZE;		goto bad;	}    {	int mhlen, firstlen = len;	struct mbuf **mnext = &m->m_nextpkt;	/*	 * Loop through length of segment after first fragment,	 * make new header and copy data of each part and link onto chain.	 */	m0 = m;	mhlen = sizeof (struct ip);	for (off = hlen + len; off < (u_short)ip->ip_len; off += len) {		MGETHDR(m, M_DONTWAIT, MT_HEADER);		if (m == 0) {			error = ENOBUFS;			ipstat.ips_odropped++;			goto sendorfree;		}		m->m_data += max_linkhdr;		mhip = mtod(m, struct ip *);		*mhip = *ip;

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -