2 * Copyright (c) 2006, Swedish Institute of Computer Science.
\r
3 * All rights reserved.
\r
5 * Redistribution and use in source and binary forms, with or without
\r
6 * modification, are permitted provided that the following conditions
\r
8 * 1. Redistributions of source code must retain the above copyright
\r
9 * notice, this list of conditions and the following disclaimer.
\r
10 * 2. Redistributions in binary form must reproduce the above copyright
\r
11 * notice, this list of conditions and the following disclaimer in the
\r
12 * documentation and/or other materials provided with the distribution.
\r
13 * 3. Neither the name of the Institute nor the names of its contributors
\r
14 * may be used to endorse or promote products derived from this software
\r
15 * without specific prior written permission.
\r
17 * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
\r
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
\r
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
\r
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
\r
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
\r
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
\r
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
\r
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
\r
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
\r
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
\r
29 * This file is part of the uIP TCP/IP stack
\r
31 * $Id: uip-neighbor.c,v 1.2 2006/06/12 08:00:30 adam Exp $
\r
36 * Database of link-local neighbors, used by IPv6 code and
\r
37 * to be used by a future ARP code rewrite.
\r
39 * Adam Dunkels <adam@sics.se>
\r
42 #include "uip-neighbor.h"
\r
47 #define MAX_TIME 128
\r
49 #ifdef UIP_NEIGHBOR_CONF_ENTRIES
\r
50 #define ENTRIES UIP_NEIGHBOR_CONF_ENTRIES
\r
51 #else /* UIP_NEIGHBOR_CONF_ENTRIES */
\r
53 #endif /* UIP_NEIGHBOR_CONF_ENTRIES */
\r
55 struct neighbor_entry {
\r
56 uip_ipaddr_t ipaddr;
\r
57 struct uip_neighbor_addr addr;
\r
60 static struct neighbor_entry entries[ENTRIES];
\r
62 /*---------------------------------------------------------------------------*/
\r
64 uip_neighbor_init(void)
\r
68 for(i = 0; i < ENTRIES; ++i) {
\r
69 entries[i].time = MAX_TIME;
\r
72 /*---------------------------------------------------------------------------*/
\r
74 uip_neighbor_periodic(void)
\r
78 for(i = 0; i < ENTRIES; ++i) {
\r
79 if(entries[i].time < MAX_TIME) {
\r
84 /*---------------------------------------------------------------------------*/
\r
86 uip_neighbor_add(uip_ipaddr_t ipaddr, struct uip_neighbor_addr *addr)
\r
91 printf("Adding neighbor with link address %02x:%02x:%02x:%02x:%02x:%02x\n",
\r
92 addr->addr.addr[0], addr->addr.addr[1], addr->addr.addr[2], addr->addr.addr[3],
\r
93 addr->addr.addr[4], addr->addr.addr[5]);
\r
95 /* Find the first unused entry or the oldest used entry. */
\r
98 for(i = 0; i < ENTRIES; ++i) {
\r
99 if(entries[i].time == MAX_TIME) {
\r
103 if(uip_ipaddr_cmp(entries[i].ipaddr, addr)) {
\r
107 if(entries[i].time > oldest_time) {
\r
109 oldest_time = entries[i].time;
\r
113 /* Use the oldest or first free entry (either pointed to by the
\r
114 "oldest" variable). */
\r
115 entries[oldest].time = 0;
\r
116 uip_ipaddr_copy(entries[oldest].ipaddr, ipaddr);
\r
117 memcpy(&entries[oldest].addr, addr, sizeof(struct uip_neighbor_addr));
\r
119 /*---------------------------------------------------------------------------*/
\r
120 static struct neighbor_entry *
\r
121 find_entry(uip_ipaddr_t ipaddr)
\r
125 for(i = 0; i < ENTRIES; ++i) {
\r
126 if(uip_ipaddr_cmp(entries[i].ipaddr, ipaddr)) {
\r
127 return &entries[i];
\r
132 /*---------------------------------------------------------------------------*/
\r
134 uip_neighbor_update(uip_ipaddr_t ipaddr)
\r
136 struct neighbor_entry *e;
\r
138 e = find_entry(ipaddr);
\r
143 /*---------------------------------------------------------------------------*/
\r
144 struct uip_neighbor_addr *
\r
145 uip_neighbor_lookup(uip_ipaddr_t ipaddr)
\r
147 struct neighbor_entry *e;
\r
149 e = find_entry(ipaddr);
\r
151 /* printf("Lookup neighbor with link address %02x:%02x:%02x:%02x:%02x:%02x\n",
\r
152 e->addr.addr.addr[0], e->addr.addr.addr[1], e->addr.addr.addr[2], e->addr.addr.addr[3],
\r
153 e->addr.addr.addr[4], e->addr.addr.addr[5]);*/
\r
159 /*---------------------------------------------------------------------------*/
\r