3b74cfecc2
Support longest prefix match routing described as "Longest Match" in RFC 1812, Section 5.2.4.3, Page 75. Introduced `prefixlen` to indicate the prefix length of currently founded route, and only looks up for longer prefix in all later steps. Signed-off-by: Zhe Weng <wengzhe@xiaomi.com>
116 lines
3.7 KiB
C
116 lines
3.7 KiB
C
/****************************************************************************
|
|
* net/neighbor/neighbor_add.c
|
|
*
|
|
* Licensed to the Apache Software Foundation (ASF) under one or more
|
|
* contributor license agreements. See the NOTICE file distributed with
|
|
* this work for additional information regarding copyright ownership. The
|
|
* ASF licenses this file to you under the Apache License, Version 2.0 (the
|
|
* "License"); you may not use this file except in compliance with the
|
|
* License. You may obtain a copy of the License at
|
|
*
|
|
* http://www.apache.org/licenses/LICENSE-2.0
|
|
*
|
|
* Unless required by applicable law or agreed to in writing, software
|
|
* distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
|
|
* WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
|
|
* License for the specific language governing permissions and limitations
|
|
* under the License.
|
|
*
|
|
****************************************************************************/
|
|
|
|
/****************************************************************************
|
|
* Included Files
|
|
****************************************************************************/
|
|
|
|
#include <nuttx/config.h>
|
|
|
|
#include <stdint.h>
|
|
#include <string.h>
|
|
#include <assert.h>
|
|
#include <debug.h>
|
|
|
|
#include <net/if.h>
|
|
|
|
#include <nuttx/net/net.h>
|
|
#include <nuttx/net/ip.h>
|
|
#include <nuttx/net/neighbor.h>
|
|
|
|
#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:
|
|
* dev - Driver instance associated with the MAC
|
|
* ipaddr - The IPv6 address of the mapping.
|
|
* addr - The link layer address of the mapping
|
|
*
|
|
* Returned Value:
|
|
* None
|
|
*
|
|
****************************************************************************/
|
|
|
|
void neighbor_add(FAR struct net_driver_s *dev, FAR net_ipv6addr_t ipaddr,
|
|
FAR uint8_t *addr)
|
|
{
|
|
uint8_t lltype;
|
|
clock_t oldest_time;
|
|
int oldest_ndx;
|
|
int i;
|
|
|
|
DEBUGASSERT(dev != NULL && addr != NULL);
|
|
|
|
/* Find the matching entry, first unused entry, or the oldest used entry.
|
|
* The unused entry will have ne_time == 0 and should generate the oldest
|
|
* time. REVISIT: Could this fail on clock wraparound? A more explicit
|
|
* check might be to compare ne_ipaddr with the IPv6 unspecified address.
|
|
*/
|
|
|
|
oldest_time = g_neighbors[0].ne_time;
|
|
oldest_ndx = 0;
|
|
lltype = dev->d_lltype;
|
|
|
|
for (i = 0; i < CONFIG_NET_IPv6_NCONF_ENTRIES; ++i)
|
|
{
|
|
if (g_neighbors[i].ne_addr.na_lltype == lltype &&
|
|
net_ipv6addr_cmp(g_neighbors[i].ne_ipaddr, ipaddr))
|
|
{
|
|
oldest_ndx = i;
|
|
break;
|
|
}
|
|
|
|
if ((int)(g_neighbors[i].ne_time - oldest_time) < 0)
|
|
{
|
|
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_dev = dev;
|
|
g_neighbors[oldest_ndx].ne_time = clock_systime_ticks();
|
|
net_ipv6addr_copy(g_neighbors[oldest_ndx].ne_ipaddr, ipaddr);
|
|
|
|
g_neighbors[oldest_ndx].ne_addr.na_lltype = lltype;
|
|
g_neighbors[oldest_ndx].ne_addr.na_llsize = netdev_lladdrsize(dev);
|
|
|
|
memcpy(&g_neighbors[oldest_ndx].ne_addr.u, addr,
|
|
g_neighbors[oldest_ndx].ne_addr.na_llsize);
|
|
|
|
/* Dump the contents of the new entry */
|
|
|
|
neighbor_dumpentry("Added entry", &g_neighbors[oldest_ndx]);
|
|
}
|