ban4jp -
/
uIP-1-0_webserver
uIP 1.0 based webserver for LPC1114 + ENC28J60
uip/uip-neighbor.c@0:685224d2f66d, 2014-06-14 (annotated)
- Committer:
- ban4jp
- Date:
- Sat Jun 14 16:02:21 2014 +0000
- Revision:
- 0:685224d2f66d
- Child:
- 3:a2715e9c7737
initial commit.
Who changed what in which revision?
User | Revision | Line number | New contents of line |
---|---|---|---|
ban4jp | 0:685224d2f66d | 1 | /* |
ban4jp | 0:685224d2f66d | 2 | * Copyright (c) 2006, Swedish Institute of Computer Science. |
ban4jp | 0:685224d2f66d | 3 | * All rights reserved. |
ban4jp | 0:685224d2f66d | 4 | * |
ban4jp | 0:685224d2f66d | 5 | * Redistribution and use in source and binary forms, with or without |
ban4jp | 0:685224d2f66d | 6 | * modification, are permitted provided that the following conditions |
ban4jp | 0:685224d2f66d | 7 | * are met: |
ban4jp | 0:685224d2f66d | 8 | * 1. Redistributions of source code must retain the above copyright |
ban4jp | 0:685224d2f66d | 9 | * notice, this list of conditions and the following disclaimer. |
ban4jp | 0:685224d2f66d | 10 | * 2. Redistributions in binary form must reproduce the above copyright |
ban4jp | 0:685224d2f66d | 11 | * notice, this list of conditions and the following disclaimer in the |
ban4jp | 0:685224d2f66d | 12 | * documentation and/or other materials provided with the distribution. |
ban4jp | 0:685224d2f66d | 13 | * 3. Neither the name of the Institute nor the names of its contributors |
ban4jp | 0:685224d2f66d | 14 | * may be used to endorse or promote products derived from this software |
ban4jp | 0:685224d2f66d | 15 | * without specific prior written permission. |
ban4jp | 0:685224d2f66d | 16 | * |
ban4jp | 0:685224d2f66d | 17 | * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND |
ban4jp | 0:685224d2f66d | 18 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
ban4jp | 0:685224d2f66d | 19 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
ban4jp | 0:685224d2f66d | 20 | * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE |
ban4jp | 0:685224d2f66d | 21 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
ban4jp | 0:685224d2f66d | 22 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
ban4jp | 0:685224d2f66d | 23 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
ban4jp | 0:685224d2f66d | 24 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
ban4jp | 0:685224d2f66d | 25 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
ban4jp | 0:685224d2f66d | 26 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
ban4jp | 0:685224d2f66d | 27 | * SUCH DAMAGE. |
ban4jp | 0:685224d2f66d | 28 | * |
ban4jp | 0:685224d2f66d | 29 | * This file is part of the uIP TCP/IP stack |
ban4jp | 0:685224d2f66d | 30 | * |
ban4jp | 0:685224d2f66d | 31 | * $Id: uip-neighbor.c,v 1.2 2006/06/12 08:00:30 adam Exp $ |
ban4jp | 0:685224d2f66d | 32 | */ |
ban4jp | 0:685224d2f66d | 33 | |
ban4jp | 0:685224d2f66d | 34 | /** |
ban4jp | 0:685224d2f66d | 35 | * \file |
ban4jp | 0:685224d2f66d | 36 | * Database of link-local neighbors, used by IPv6 code and |
ban4jp | 0:685224d2f66d | 37 | * to be used by a future ARP code rewrite. |
ban4jp | 0:685224d2f66d | 38 | * \author |
ban4jp | 0:685224d2f66d | 39 | * Adam Dunkels <adam@sics.se> |
ban4jp | 0:685224d2f66d | 40 | */ |
ban4jp | 0:685224d2f66d | 41 | |
ban4jp | 0:685224d2f66d | 42 | #include "uip-neighbor.h" |
ban4jp | 0:685224d2f66d | 43 | |
ban4jp | 0:685224d2f66d | 44 | #include <string.h> |
ban4jp | 0:685224d2f66d | 45 | |
ban4jp | 0:685224d2f66d | 46 | #define MAX_TIME 128 |
ban4jp | 0:685224d2f66d | 47 | |
ban4jp | 0:685224d2f66d | 48 | #ifdef UIP_NEIGHBOR_CONF_ENTRIES |
ban4jp | 0:685224d2f66d | 49 | #define ENTRIES UIP_NEIGHBOR_CONF_ENTRIES |
ban4jp | 0:685224d2f66d | 50 | #else /* UIP_NEIGHBOR_CONF_ENTRIES */ |
ban4jp | 0:685224d2f66d | 51 | #define ENTRIES 8 |
ban4jp | 0:685224d2f66d | 52 | #endif /* UIP_NEIGHBOR_CONF_ENTRIES */ |
ban4jp | 0:685224d2f66d | 53 | |
ban4jp | 0:685224d2f66d | 54 | struct neighbor_entry { |
ban4jp | 0:685224d2f66d | 55 | uip_ipaddr_t ipaddr; |
ban4jp | 0:685224d2f66d | 56 | struct uip_neighbor_addr addr; |
ban4jp | 0:685224d2f66d | 57 | u8_t time; |
ban4jp | 0:685224d2f66d | 58 | }; |
ban4jp | 0:685224d2f66d | 59 | static struct neighbor_entry entries[ENTRIES]; |
ban4jp | 0:685224d2f66d | 60 | |
ban4jp | 0:685224d2f66d | 61 | /*---------------------------------------------------------------------------*/ |
ban4jp | 0:685224d2f66d | 62 | void |
ban4jp | 0:685224d2f66d | 63 | uip_neighbor_init(void) |
ban4jp | 0:685224d2f66d | 64 | { |
ban4jp | 0:685224d2f66d | 65 | int i; |
ban4jp | 0:685224d2f66d | 66 | |
ban4jp | 0:685224d2f66d | 67 | for(i = 0; i < ENTRIES; ++i) { |
ban4jp | 0:685224d2f66d | 68 | entries[i].time = MAX_TIME; |
ban4jp | 0:685224d2f66d | 69 | } |
ban4jp | 0:685224d2f66d | 70 | } |
ban4jp | 0:685224d2f66d | 71 | /*---------------------------------------------------------------------------*/ |
ban4jp | 0:685224d2f66d | 72 | void |
ban4jp | 0:685224d2f66d | 73 | uip_neighbor_periodic(void) |
ban4jp | 0:685224d2f66d | 74 | { |
ban4jp | 0:685224d2f66d | 75 | int i; |
ban4jp | 0:685224d2f66d | 76 | |
ban4jp | 0:685224d2f66d | 77 | for(i = 0; i < ENTRIES; ++i) { |
ban4jp | 0:685224d2f66d | 78 | if(entries[i].time < MAX_TIME) { |
ban4jp | 0:685224d2f66d | 79 | entries[i].time++; |
ban4jp | 0:685224d2f66d | 80 | } |
ban4jp | 0:685224d2f66d | 81 | } |
ban4jp | 0:685224d2f66d | 82 | } |
ban4jp | 0:685224d2f66d | 83 | /*---------------------------------------------------------------------------*/ |
ban4jp | 0:685224d2f66d | 84 | void |
ban4jp | 0:685224d2f66d | 85 | uip_neighbor_add(uip_ipaddr_t ipaddr, struct uip_neighbor_addr *addr) |
ban4jp | 0:685224d2f66d | 86 | { |
ban4jp | 0:685224d2f66d | 87 | int i, oldest; |
ban4jp | 0:685224d2f66d | 88 | u8_t oldest_time; |
ban4jp | 0:685224d2f66d | 89 | |
ban4jp | 0:685224d2f66d | 90 | printf("Adding neighbor with link address %02x:%02x:%02x:%02x:%02x:%02x\n", |
ban4jp | 0:685224d2f66d | 91 | addr->addr.addr[0], addr->addr.addr[1], addr->addr.addr[2], addr->addr.addr[3], |
ban4jp | 0:685224d2f66d | 92 | addr->addr.addr[4], addr->addr.addr[5]); |
ban4jp | 0:685224d2f66d | 93 | |
ban4jp | 0:685224d2f66d | 94 | /* Find the first unused entry or the oldest used entry. */ |
ban4jp | 0:685224d2f66d | 95 | oldest_time = 0; |
ban4jp | 0:685224d2f66d | 96 | oldest = 0; |
ban4jp | 0:685224d2f66d | 97 | for(i = 0; i < ENTRIES; ++i) { |
ban4jp | 0:685224d2f66d | 98 | if(entries[i].time == MAX_TIME) { |
ban4jp | 0:685224d2f66d | 99 | oldest = i; |
ban4jp | 0:685224d2f66d | 100 | break; |
ban4jp | 0:685224d2f66d | 101 | } |
ban4jp | 0:685224d2f66d | 102 | if(uip_ipaddr_cmp(entries[i].ipaddr, addr)) { |
ban4jp | 0:685224d2f66d | 103 | oldest = i; |
ban4jp | 0:685224d2f66d | 104 | break; |
ban4jp | 0:685224d2f66d | 105 | } |
ban4jp | 0:685224d2f66d | 106 | if(entries[i].time > oldest_time) { |
ban4jp | 0:685224d2f66d | 107 | oldest = i; |
ban4jp | 0:685224d2f66d | 108 | oldest_time = entries[i].time; |
ban4jp | 0:685224d2f66d | 109 | } |
ban4jp | 0:685224d2f66d | 110 | } |
ban4jp | 0:685224d2f66d | 111 | |
ban4jp | 0:685224d2f66d | 112 | /* Use the oldest or first free entry (either pointed to by the |
ban4jp | 0:685224d2f66d | 113 | "oldest" variable). */ |
ban4jp | 0:685224d2f66d | 114 | entries[oldest].time = 0; |
ban4jp | 0:685224d2f66d | 115 | uip_ipaddr_copy(entries[oldest].ipaddr, ipaddr); |
ban4jp | 0:685224d2f66d | 116 | memcpy(&entries[oldest].addr, addr, sizeof(struct uip_neighbor_addr)); |
ban4jp | 0:685224d2f66d | 117 | } |
ban4jp | 0:685224d2f66d | 118 | /*---------------------------------------------------------------------------*/ |
ban4jp | 0:685224d2f66d | 119 | static struct neighbor_entry * |
ban4jp | 0:685224d2f66d | 120 | find_entry(uip_ipaddr_t ipaddr) |
ban4jp | 0:685224d2f66d | 121 | { |
ban4jp | 0:685224d2f66d | 122 | int i; |
ban4jp | 0:685224d2f66d | 123 | |
ban4jp | 0:685224d2f66d | 124 | for(i = 0; i < ENTRIES; ++i) { |
ban4jp | 0:685224d2f66d | 125 | if(uip_ipaddr_cmp(entries[i].ipaddr, ipaddr)) { |
ban4jp | 0:685224d2f66d | 126 | return &entries[i]; |
ban4jp | 0:685224d2f66d | 127 | } |
ban4jp | 0:685224d2f66d | 128 | } |
ban4jp | 0:685224d2f66d | 129 | return NULL; |
ban4jp | 0:685224d2f66d | 130 | } |
ban4jp | 0:685224d2f66d | 131 | /*---------------------------------------------------------------------------*/ |
ban4jp | 0:685224d2f66d | 132 | void |
ban4jp | 0:685224d2f66d | 133 | uip_neighbor_update(uip_ipaddr_t ipaddr) |
ban4jp | 0:685224d2f66d | 134 | { |
ban4jp | 0:685224d2f66d | 135 | struct neighbor_entry *e; |
ban4jp | 0:685224d2f66d | 136 | |
ban4jp | 0:685224d2f66d | 137 | e = find_entry(ipaddr); |
ban4jp | 0:685224d2f66d | 138 | if(e != NULL) { |
ban4jp | 0:685224d2f66d | 139 | e->time = 0; |
ban4jp | 0:685224d2f66d | 140 | } |
ban4jp | 0:685224d2f66d | 141 | } |
ban4jp | 0:685224d2f66d | 142 | /*---------------------------------------------------------------------------*/ |
ban4jp | 0:685224d2f66d | 143 | struct uip_neighbor_addr * |
ban4jp | 0:685224d2f66d | 144 | uip_neighbor_lookup(uip_ipaddr_t ipaddr) |
ban4jp | 0:685224d2f66d | 145 | { |
ban4jp | 0:685224d2f66d | 146 | struct neighbor_entry *e; |
ban4jp | 0:685224d2f66d | 147 | |
ban4jp | 0:685224d2f66d | 148 | e = find_entry(ipaddr); |
ban4jp | 0:685224d2f66d | 149 | if(e != NULL) { |
ban4jp | 0:685224d2f66d | 150 | /* printf("Lookup neighbor with link address %02x:%02x:%02x:%02x:%02x:%02x\n", |
ban4jp | 0:685224d2f66d | 151 | e->addr.addr.addr[0], e->addr.addr.addr[1], e->addr.addr.addr[2], e->addr.addr.addr[3], |
ban4jp | 0:685224d2f66d | 152 | e->addr.addr.addr[4], e->addr.addr.addr[5]);*/ |
ban4jp | 0:685224d2f66d | 153 | |
ban4jp | 0:685224d2f66d | 154 | return &e->addr; |
ban4jp | 0:685224d2f66d | 155 | } |
ban4jp | 0:685224d2f66d | 156 | return NULL; |
ban4jp | 0:685224d2f66d | 157 | } |
ban4jp | 0:685224d2f66d | 158 | /*---------------------------------------------------------------------------*/ |