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