mirror of
				https://git.proxmox.com/git/mirror_frr
				synced 2025-11-04 11:38:49 +00:00 
			
		
		
		
	We should probably prevent any type of namespace collision with something else. Signed-off-by: Donald Sharp <sharpd@nvidia.com>
		
			
				
	
	
		
			256 lines
		
	
	
		
			6.2 KiB
		
	
	
	
		
			C
		
	
	
	
	
	
			
		
		
	
	
			256 lines
		
	
	
		
			6.2 KiB
		
	
	
	
		
			C
		
	
	
	
	
	
// SPDX-License-Identifier: GPL-2.0-or-later
 | 
						|
/*
 | 
						|
 * EIGRP Sending and Receiving EIGRP Query Packets.
 | 
						|
 * Copyright (C) 2013-2014
 | 
						|
 * Authors:
 | 
						|
 *   Donnie Savage
 | 
						|
 *   Jan Janovic
 | 
						|
 *   Matej Perina
 | 
						|
 *   Peter Orsag
 | 
						|
 *   Peter Paluch
 | 
						|
 */
 | 
						|
 | 
						|
#include <zebra.h>
 | 
						|
 | 
						|
#include "frrevent.h"
 | 
						|
#include "memory.h"
 | 
						|
#include "linklist.h"
 | 
						|
#include "prefix.h"
 | 
						|
#include "if.h"
 | 
						|
#include "table.h"
 | 
						|
#include "sockunion.h"
 | 
						|
#include "stream.h"
 | 
						|
#include "log.h"
 | 
						|
#include "sockopt.h"
 | 
						|
#include "checksum.h"
 | 
						|
#include "md5.h"
 | 
						|
#include "vty.h"
 | 
						|
 | 
						|
#include "eigrpd/eigrp_structs.h"
 | 
						|
#include "eigrpd/eigrpd.h"
 | 
						|
#include "eigrpd/eigrp_interface.h"
 | 
						|
#include "eigrpd/eigrp_neighbor.h"
 | 
						|
#include "eigrpd/eigrp_packet.h"
 | 
						|
#include "eigrpd/eigrp_zebra.h"
 | 
						|
#include "eigrpd/eigrp_vty.h"
 | 
						|
#include "eigrpd/eigrp_dump.h"
 | 
						|
#include "eigrpd/eigrp_macros.h"
 | 
						|
#include "eigrpd/eigrp_topology.h"
 | 
						|
#include "eigrpd/eigrp_fsm.h"
 | 
						|
 | 
						|
uint32_t eigrp_query_send_all(struct eigrp *eigrp)
 | 
						|
{
 | 
						|
	struct eigrp_interface *iface;
 | 
						|
	struct listnode *node, *node2, *nnode2;
 | 
						|
	struct eigrp_prefix_descriptor *pe;
 | 
						|
	uint32_t counter;
 | 
						|
 | 
						|
	if (eigrp == NULL) {
 | 
						|
		zlog_debug("EIGRP Routing Process not enabled");
 | 
						|
		return 0;
 | 
						|
	}
 | 
						|
 | 
						|
	counter = 0;
 | 
						|
	for (ALL_LIST_ELEMENTS_RO(eigrp->eiflist, node, iface)) {
 | 
						|
		eigrp_send_query(iface);
 | 
						|
		counter++;
 | 
						|
	}
 | 
						|
 | 
						|
	for (ALL_LIST_ELEMENTS(eigrp->topology_changes_internalIPV4, node2,
 | 
						|
			       nnode2, pe)) {
 | 
						|
		if (pe->req_action & EIGRP_FSM_NEED_QUERY) {
 | 
						|
			pe->req_action &= ~EIGRP_FSM_NEED_QUERY;
 | 
						|
			listnode_delete(eigrp->topology_changes_internalIPV4,
 | 
						|
					pe);
 | 
						|
		}
 | 
						|
	}
 | 
						|
 | 
						|
	return counter;
 | 
						|
}
 | 
						|
 | 
						|
/*EIGRP QUERY read function*/
 | 
						|
void eigrp_query_receive(struct eigrp *eigrp, struct ip *iph,
 | 
						|
			 struct eigrp_header *eigrph, struct stream *s,
 | 
						|
			 struct eigrp_interface *ei, int size)
 | 
						|
{
 | 
						|
	struct eigrp_neighbor *nbr;
 | 
						|
	struct TLV_IPv4_Internal_type *tlv;
 | 
						|
	struct prefix dest_addr;
 | 
						|
 | 
						|
	uint16_t type;
 | 
						|
	uint16_t length;
 | 
						|
 | 
						|
	/* increment statistics. */
 | 
						|
	ei->query_in++;
 | 
						|
 | 
						|
	/* get neighbor struct */
 | 
						|
	nbr = eigrp_nbr_get(ei, eigrph, iph);
 | 
						|
 | 
						|
	/* neighbor must be valid, eigrp_nbr_get creates if none existed */
 | 
						|
	assert(nbr);
 | 
						|
 | 
						|
	nbr->recv_sequence_number = ntohl(eigrph->sequence);
 | 
						|
 | 
						|
	while (s->endp > s->getp) {
 | 
						|
		type = stream_getw(s);
 | 
						|
		switch (type) {
 | 
						|
		case EIGRP_TLV_IPv4_INT:
 | 
						|
			stream_set_getp(s, s->getp - sizeof(uint16_t));
 | 
						|
 | 
						|
			tlv = eigrp_read_ipv4_tlv(s);
 | 
						|
 | 
						|
			dest_addr.family = AF_INET;
 | 
						|
			dest_addr.u.prefix4 = tlv->destination;
 | 
						|
			dest_addr.prefixlen = tlv->prefix_length;
 | 
						|
			struct eigrp_prefix_descriptor *dest =
 | 
						|
				eigrp_topology_table_lookup_ipv4(
 | 
						|
					eigrp->topology_table, &dest_addr);
 | 
						|
 | 
						|
			/* If the destination exists (it should, but one never
 | 
						|
			 * know)*/
 | 
						|
			if (dest != NULL) {
 | 
						|
				struct eigrp_fsm_action_message msg;
 | 
						|
				struct eigrp_route_descriptor *entry =
 | 
						|
					eigrp_route_descriptor_lookup(
 | 
						|
						dest->entries, nbr);
 | 
						|
				msg.packet_type = EIGRP_OPC_QUERY;
 | 
						|
				msg.eigrp = eigrp;
 | 
						|
				msg.data_type = EIGRP_INT;
 | 
						|
				msg.adv_router = nbr;
 | 
						|
				msg.metrics = tlv->metric;
 | 
						|
				msg.entry = entry;
 | 
						|
				msg.prefix = dest;
 | 
						|
				eigrp_fsm_event(&msg);
 | 
						|
			}
 | 
						|
			eigrp_IPv4_InternalTLV_free(tlv);
 | 
						|
			break;
 | 
						|
 | 
						|
		case EIGRP_TLV_IPv4_EXT:
 | 
						|
		/* DVS: processing of external routes needs packet and fsm work.
 | 
						|
		 *      for now, lets just not creash the box
 | 
						|
		 */
 | 
						|
		default:
 | 
						|
			length = stream_getw(s);
 | 
						|
			// -2 for type, -2 for len
 | 
						|
			for (length -= 4; length; length--) {
 | 
						|
				(void)stream_getc(s);
 | 
						|
			}
 | 
						|
		}
 | 
						|
	}
 | 
						|
	eigrp_hello_send_ack(nbr);
 | 
						|
	eigrp_query_send_all(eigrp);
 | 
						|
	eigrp_update_send_all(eigrp, nbr->ei);
 | 
						|
}
 | 
						|
 | 
						|
void eigrp_send_query(struct eigrp_interface *ei)
 | 
						|
{
 | 
						|
	struct eigrp_packet *ep = NULL;
 | 
						|
	uint16_t length = EIGRP_HEADER_LEN;
 | 
						|
	struct listnode *node, *nnode, *node2, *nnode2;
 | 
						|
	struct eigrp_neighbor *nbr;
 | 
						|
	struct eigrp_prefix_descriptor *pe;
 | 
						|
	bool has_tlv = false;
 | 
						|
	bool new_packet = true;
 | 
						|
	uint16_t eigrp_mtu = EIGRP_PACKET_MTU(ei->ifp->mtu);
 | 
						|
 | 
						|
	for (ALL_LIST_ELEMENTS(ei->eigrp->topology_changes_internalIPV4, node,
 | 
						|
			       nnode, pe)) {
 | 
						|
		if (!(pe->req_action & EIGRP_FSM_NEED_QUERY))
 | 
						|
			continue;
 | 
						|
 | 
						|
		if (new_packet) {
 | 
						|
			ep = eigrp_packet_new(eigrp_mtu, NULL);
 | 
						|
 | 
						|
			/* Prepare EIGRP INIT UPDATE header */
 | 
						|
			eigrp_packet_header_init(EIGRP_OPC_QUERY, ei->eigrp,
 | 
						|
						 ep->s, 0,
 | 
						|
						 ei->eigrp->sequence_number, 0);
 | 
						|
 | 
						|
			// encode Authentication TLV, if needed
 | 
						|
			if ((ei->params.auth_type == EIGRP_AUTH_TYPE_MD5)
 | 
						|
			    && (ei->params.auth_keychain != NULL)) {
 | 
						|
				length += eigrp_add_authTLV_MD5_to_stream(ep->s,
 | 
						|
									  ei);
 | 
						|
			}
 | 
						|
			new_packet = false;
 | 
						|
		}
 | 
						|
 | 
						|
		length += eigrp_add_internalTLV_to_stream(ep->s, pe);
 | 
						|
		has_tlv = true;
 | 
						|
		for (ALL_LIST_ELEMENTS(ei->nbrs, node2, nnode2, nbr)) {
 | 
						|
			if (nbr->state == EIGRP_NEIGHBOR_UP)
 | 
						|
				listnode_add(pe->rij, nbr);
 | 
						|
		}
 | 
						|
 | 
						|
		if (length + EIGRP_TLV_MAX_IPV4_BYTE > eigrp_mtu) {
 | 
						|
			if ((ei->params.auth_type == EIGRP_AUTH_TYPE_MD5)
 | 
						|
			    && ei->params.auth_keychain != NULL) {
 | 
						|
				eigrp_make_md5_digest(ei, ep->s,
 | 
						|
						      EIGRP_AUTH_UPDATE_FLAG);
 | 
						|
			}
 | 
						|
 | 
						|
			eigrp_packet_checksum(ei, ep->s, length);
 | 
						|
			ep->length = length;
 | 
						|
 | 
						|
			ep->dst.s_addr = htonl(EIGRP_MULTICAST_ADDRESS);
 | 
						|
 | 
						|
			ep->sequence_number = ei->eigrp->sequence_number;
 | 
						|
			ei->eigrp->sequence_number++;
 | 
						|
 | 
						|
			for (ALL_LIST_ELEMENTS(ei->nbrs, node2, nnode2, nbr)) {
 | 
						|
				struct eigrp_packet *dup;
 | 
						|
 | 
						|
				if (nbr->state != EIGRP_NEIGHBOR_UP)
 | 
						|
					continue;
 | 
						|
 | 
						|
				dup = eigrp_packet_duplicate(ep, nbr);
 | 
						|
				/*Put packet to retransmission queue*/
 | 
						|
				eigrp_fifo_push(nbr->retrans_queue, dup);
 | 
						|
 | 
						|
				if (nbr->retrans_queue->count == 1)
 | 
						|
					eigrp_send_packet_reliably(nbr);
 | 
						|
			}
 | 
						|
 | 
						|
			has_tlv = false;
 | 
						|
			length = 0;
 | 
						|
			eigrp_packet_free(ep);
 | 
						|
			ep = NULL;
 | 
						|
			new_packet = true;
 | 
						|
		}
 | 
						|
	}
 | 
						|
 | 
						|
	if (!has_tlv)
 | 
						|
		return;
 | 
						|
 | 
						|
	if ((ei->params.auth_type == EIGRP_AUTH_TYPE_MD5)
 | 
						|
	    && ei->params.auth_keychain != NULL)
 | 
						|
		eigrp_make_md5_digest(ei, ep->s, EIGRP_AUTH_UPDATE_FLAG);
 | 
						|
 | 
						|
 | 
						|
	/* EIGRP Checksum */
 | 
						|
	eigrp_packet_checksum(ei, ep->s, length);
 | 
						|
 | 
						|
	ep->length = length;
 | 
						|
	ep->dst.s_addr = htonl(EIGRP_MULTICAST_ADDRESS);
 | 
						|
 | 
						|
	/*This ack number we await from neighbor*/
 | 
						|
	ep->sequence_number = ei->eigrp->sequence_number;
 | 
						|
	ei->eigrp->sequence_number++;
 | 
						|
 | 
						|
	for (ALL_LIST_ELEMENTS(ei->nbrs, node2, nnode2, nbr)) {
 | 
						|
		struct eigrp_packet *dup;
 | 
						|
 | 
						|
		if (nbr->state != EIGRP_NEIGHBOR_UP)
 | 
						|
			continue;
 | 
						|
 | 
						|
		dup = eigrp_packet_duplicate(ep, nbr);
 | 
						|
		/*Put packet to retransmission queue*/
 | 
						|
		eigrp_fifo_push(nbr->retrans_queue, dup);
 | 
						|
 | 
						|
		if (nbr->retrans_queue->count == 1)
 | 
						|
			eigrp_send_packet_reliably(nbr);
 | 
						|
	}
 | 
						|
 | 
						|
	eigrp_packet_free(ep);
 | 
						|
}
 |