output.c

OLSR Implementation for XORP

/*
 * Copyright (c) 2004 Ying Ge, Communication Research Center Canada.
 *
 * Copyright (c) 2002, 2003 Maoyu Wang, Communication Research Center Canada.
 *
 * By Ying Ge:
 * 1. Change the OLSR packet format and message processing procedure based 
 *    on the OLSR RFC.
 * 2. Add support of multiple interfaces to OLSR, including MID message 
 *    creating and processing procedure as specified in the OLSR RFC.
 * 3. Add QoS Support to OLSR
 *
 * By Maoyu Wang:
 * 1. Ported OLSR from IPv4 to IPv6.
 * 2. Added the Host and Network Association (HNA) functionality into OLSR.
 * 3. Added the default gateway functionality into OLSR by extending the HNA 
 *    message usage. The default gateway functionality supported the mobility
 *	  by cooperating with Mobile IPv6 for a mobile node as well as supported 
 * 	  Internet access for MANET nodes. 
 *
 * DISTRIBUTED WITH NO WARRANTY, EXPRESS OR IMPLIED.
 * See the GNU Library General Public License (file COPYING in the distribution)
 * for conditions of use and redistribution
 */
/*
 * This Copyright notice is in French. An English summary is given
 * but the referee text is the French one.
 *
 * Copyright (c) 2000, 2001 [e-mail], INRIA Rocquencourt,
 *                          [e-mail], INRIA Rocquencourt.
 *
 * Ce logiciel informatique est disponible aux conditions
 * usuelles dans la recherche, c'est-à-dire qu'il peut
 * être utilisé, copié, modifié, distribué à l'unique
 * condition que ce texte soit conservé afin que
 * l'origine de ce logiciel soit reconnue.
 * Le nom de l'Institut National de Recherche en Informatique
 * et en Automatique (INRIA), ou d'une personne morale
 * ou physique ayant participé à l'élaboration de ce logiciel ne peut
 * être utilisé sans son accord préalable explicite.
 * 
 * Ce logiciel est fourni tel quel sans aucune garantie,
 * support ou responsabilité d'aucune sorte.
 * Certaines parties de ce logiciel sont dérivées de sources developpees par
 * University of California, Berkeley et ses contributeurs couvertes 
 * par des copyrights.
 * This software is available with usual "research" terms
 * with the aim of retain credits of the software. 
 * Permission to use, copy, modify and distribute this software for any
 * purpose and without fee is hereby granted, provided that the above
 * copyright notice and this permission notice appear in all copies,
 * and the name of INRIA, or any contributor not be used in advertising
 * or publicity pertaining to this material without the prior explicit
 * permission. The software is provided "as is" without any
 * warranties, support or liabilities of any kind.
 * This product includes software developed by the University of
 * California, Berkeley and its contributors protected by copyrights.
 */

/*
 * 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 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.
 */

/*
 * From: @(#)output.c	5.15 (Berkeley) 2/28/91
 * From: @(#)output.c	8.1 (Berkeley) 6/5/93
 * From: @(#)output.c	1.6 (dholland Exp)  1996/11/25
 */

char output_rcsid[] = 
  "$Id: output.c,v 1.2 2000/12/06 10:36:12 prima Exp $";



 

/*
 * Routing Table Management Daemon
 */


#include "defs.h"

/*
 * added by Y.Ge
 * calculate size of common olsr message head
 */
 
int comm_head_size = sizeof (msg->olsr_packlen) + sizeof (msg->olsr_seqnum);

/*
 * Apply the function "f" to all non-passive
 * interfaces.Use broadcast address.
 */

void toall(void (*f)(struct sockaddr *, struct hello_message *, struct tc_message *,struct mid_message *, struct hna_message *,int, struct interface *), struct hello_message *hmsg, struct tc_message *tmsg, struct mid_message *mmsg, struct hna_message *nmsg,struct interface *skipif)
{
	struct interface *ifp;
	/* CRC v4->v6 del
	struct sockaddr *dst;*/
	
	//CRC v4->v6 add	
	struct sockaddr *dstptr;
	struct sockaddr_in6 dst;
	
	int flags;

	/*CRC v4->v6 del
	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_addr;
		flags = ifp->int_flags & IFF_INTERFACE ? MSG_DONTROUTE : 0;

		(*f)(dst, hmsg, tmsg, flags, ifp);
	}*/
	//		printf ("...now look at inteface: %s\n",ifp->int_name);
	//	printf ("   this interface address is: %s\n", convert_address_to_string(&ifp->int6_site_addr));
	//CRC v4->v6 add
	for (ifp = ifnet; ifp; ifp = ifp->int_next) 
	{
		printf ("...now look at inteface: %s\n",ifp->int_name);
		printf ("   this interface address is: %s\n", convert_address_to_string(&ifp->int6_site_addr));
		
		if (ifp->int_flags & IFF_PASSIVE || ifp == skipif)
		{
			continue;
		}
					
		flags=0;
		/*
		flags = ifp->int_flags & IFF_INTERFACE ? MSG_DONTROUTE : 0;
		if(ifp->int_flags & IFF_MULTICAST )
			memcpy (&dst.sin6_addr, &ifp->int6_multi_addr,
			sizeof(struct in6_addr));		
		else
			memcpy (&dst.sin6_addr, &ifp->int6_site_addr,
			sizeof(struct in6_addr));*/		      
		
		memcpy (&dst.sin6_addr, &ifp->int6_multi_addr, sizeof(struct in6_addr));      
		dst.sin6_family = AF_INET6;
		dst.sin6_port = htons(OLSRPORT);
		dstptr = (struct sockaddr*)&dst;
		
		(*f)(dstptr, hmsg, tmsg, mmsg, nmsg, flags, ifp);

		//dumppacket_toscreen(dstptr, packet, outputsize, &now);
	}
	
}

/********************************* added by Y.Ge ****************/
void tointerface(void (*f)(struct sockaddr *, struct hello_message *, struct tc_message *, struct mid_message *, struct hna_message *,int, struct interface *), struct hello_message *hmsg, struct tc_message *tmsg, struct mid_message *mmsg, struct hna_message *nmsg,struct interface *skipif, int send_if_index)
{
	struct interface *ifp;
	/* CRC v4->v6 del
	struct sockaddr *dst;*/
	
	//CRC v4->v6 add	
	struct sockaddr *dstptr;
	struct sockaddr_in6 dst;
	
	int flags;
	
	//CRC v4->v6 add
	for (ifp = ifnet; ifp; ifp = ifp->int_next) 
	{
		if (ifp->my_index == send_if_index)
		{
			// printf ("...now look at inteface: %s\n",ifp->int_name);
		//	printf ("   this interface address is: %s\n", 
		//	convert_address_to_string(&ifp->int6_site_addr));//
			
			if (ifp->int_flags & IFF_PASSIVE || ifp == skipif)
			{
				continue;
			}
					
			flags=0;

			memcpy (&dst.sin6_addr, &ifp->int6_multi_addr, sizeof(struct in6_addr));      
			dst.sin6_family = AF_INET6;
			dst.sin6_port = htons(OLSRPORT);
			dstptr = (struct sockaddr*)&dst;
			
			msg->olsr_seqnum = htons(pkt_seqnum[ifp->my_index]++); 	//added by Y.Ge
		
			(*f)(dstptr, hmsg, tmsg, mmsg, nmsg, flags, ifp);

			//dumppacket_toscreen(dstptr, packet, outputsize, &now);
		}
	}
	
}
/************************ end of revision *********************/

/*
 * Output a preformed packet.
 * The two parameters message and messag are not used.
 */

void sndmsg(struct sockaddr *dst, struct hello_message *message, 
            struct tc_message *messag, struct mid_message *mmsg, struct hna_message *messg, int flags, struct interface *ifp)
{
	/*TRACE_OUTPUT(ifp, dst, outputsize);*/
	/*(*afswitch[dst->sa_family].af_output)(s6, flags,
		dst, outputsize);*/

	//inet6_output(s6, flags,	dst, outputsize);  //commented by Y.Ge
	inet6_output(s6[ifp->my_index], flags, dst, outputsize); //added by Y.Ge
}


/*
 * Supply dst with the contents of the routing tables or neighbor table.
 * If this won't fit in one packet, chop it up into several.
 */
 
void supply(struct sockaddr *dst, struct hello_message *h_packet, struct rt_message *r_packet, int type, int if_index) //"if_index" is added by Y.Ge
{
	struct interface *ifp = 0;
	
	if ( outputsize )
		toall(sndmsg, (struct hello_message *)NULL, (struct tc_message *)NULL, (struct mid_message *)NULL,(struct hna_message *)NULL, (struct interface *)NULL );

	if (type == HELLO_REQUEST)
		hello_build(dst, h_packet, (struct tc_message *)NULL, (struct mid_message *)NULL, (struct hna_message*)NULL, 0,(struct interface *)NULL);

	else
	{
		if (type == ROUTE_REQUEST)
			rt_build(dst, r_packet, 0, (struct interface *)NULL);
	}
	if ( outputsize )
	{
		TRACE_OUTPUT(ifp, dst, outputsize);
		(*afswitch[dst->sa_family].af_output)(s6[if_index], 0, dst, outputsize); //add "if_index" by Y.Ge
	}

}


/*
 * Generate HELLO packet with the contents of the parameter "message".
 * If this won't fit in one packet, chop it up into several.
 * Send the packet if the size of the data contained in the output buffer
 * reach MAXPACKETSIZE. Can generate an empty HELLO packet if the 
 * neighbor table is empty. The parameter messag is not used.
 */
 
void hello_build(struct sockaddr *dst, struct hello_message *message, struct tc_message *messag,struct mid_message *mmessage, struct hna_message *messg, int flags, struct interface *ifp)
{

	/*void (*output)(int,int,struct sockaddr *,int) = afswitch[dst->sa_family].af_output;*/
	/*int remainsize = outputsize - (sizeof(msg->olsr_packlen) + sizeof(msg->olsr_res));*/ /* commented by Y.Ge */
	int remainsize = outputsize - comm_head_size;
	struct hello_neighbor *nb, *prev_nb;

	struct olsrmsg *m = outputsize ? (struct olsrmsg *)((char *)msg->olsr_msg + remainsize) : msg->olsr_msg;
	struct hellomsg *h = m->olsr_hello;
	struct hellinfo *hinfo = h->hell_info;

	//CRC v4->v6 ok
	struct olsr_ip_addr *haddr = hinfo->neigh_addr;
	int    size, i, sametype, npackets = 0, found =0;
	int lastpacket = 0; /* number of neighbors with the same greater link status in the last packet */

	if (!message)
		return;

	if (debug_level >3)
	{
		printf ("\n\n-------------- in hello build -----------------\n");
		fprintf (y_file,"\n\n-------------- in hello build -----------------\n");
		printf ("originator address: %s\n", convert_address_to_string(&message->originator_addr));
		fprintf (y_file, "originator address: %s\n", convert_address_to_string(&message->originator_addr));
		printf ("sending address: %s\n", convert_address_to_string(&addr_manet[ifp->my_index]));
		fprintf (y_file,"sending address: %s\n", convert_address_to_string(&addr_manet[ifp->my_index]));
	}

	if (outputsize > MAXPACKETSIZE - (int)sizeof (struct olsrmsg)) 
	{
		msg->olsr_packlen = htons(outputsize);
		//memset(msg->olsr_res, 0, sizeof(msg->olsr_res));  //commented by Y.Ge