/**************************************************************************** * net/neighbor/neighbor_add.c * * Copyright (C) 2007-2009, 2015, 2017 Gregory Nutt. All rights reserved. * Author: Gregory Nutt * * A leverage of logic from uIP which also has a BSD style license * * Copyright (c) 2006, Swedish Institute of Computer Science. All rights * reserved. * Author: Adam Dunkels * * 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. Neither the name of the Institute 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 INSTITUTE 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 INSTITUTE 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. * ****************************************************************************/ /**************************************************************************** * Included Files ****************************************************************************/ #include #include #include #include #include #include #include #include "netdev/netdev.h" #include "neighbor/neighbor.h" /**************************************************************************** * Public Functions ****************************************************************************/ /**************************************************************************** * Name: neighbor_add * * Description: * Add the new address association to the Neighbor Table (if it is not * already there). * * Input Parameters: * ipaddr - The IPv6 address of the mapping. * lltype - The link layer address type * addr - The link layer address of the mapping * * Returned Value: * None * ****************************************************************************/ void neighbor_add(FAR net_ipv6addr_t ipaddr, uint8_t lltype, FAR uint8_t *addr) { uint8_t oldest_time; int oldest_ndx; int i; /* Find the first unused entry or the oldest used entry. */ oldest_time = 0; oldest_ndx = 0; for (i = 0; i < CONFIG_NET_IPv6_NCONF_ENTRIES; ++i) { if (g_neighbors[i].ne_time == NEIGHBOR_MAXTIME) { oldest_ndx = i; break; } #ifdef CONFIG_NET_MULTILINK if (g_neighbors[i].ne_addr.u.na_lltype == lltype && net_ipv6addr_cmp(g_neighbors[i].ne_ipaddr, ipaddr)) #else if (net_ipv6addr_cmp(g_neighbors[i].ne_ipaddr, ipaddr)) #endif { oldest_ndx = i; break; } if (g_neighbors[i].ne_time > oldest_time) { oldest_ndx = i; oldest_time = g_neighbors[i].ne_time; } } /* Use the oldest or first free entry (either pointed to by the * "oldest_ndx" variable). */ g_neighbors[oldest_ndx].ne_time = 0; net_ipv6addr_copy(g_neighbors[oldest_ndx].ne_ipaddr, ipaddr); #ifdef CONFIG_NET_MULTILINK g_neighbors[oldest_ndx].ne_addr.u.na_lltype = lltype; #endif memcpy(&g_neighbors[oldest_ndx].ne_addr.u, addr, netdev_type_lladdrsize(lltype)); /* Dump the contents of the new entry */ neighbor_dumpentry("Added entry", &g_neighbors[oldest_ndx]); }