1<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> 2<html><head><meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1"> 3<title>uIP 1.0: uip/uip-neighbor.c Source File</title> 4<link href="doxygen.css" rel="stylesheet" type="text/css"> 5<link href="tabs.css" rel="stylesheet" type="text/css"> 6</head><body> 7<!-- Generated by Doxygen 1.4.6 --> 8<div class="tabs"> 9 <ul> 10 <li><a href="main.html"><span>Main Page</span></a></li> 11 <li><a href="modules.html"><span>Modules</span></a></li> 12 <li><a href="classes.html"><span>Data Structures</span></a></li> 13 <li id="current"><a href="files.html"><span>Files</span></a></li> 14 <li><a href="examples.html"><span>Examples</span></a></li> 15 </ul></div> 16<div class="tabs"> 17 <ul> 18 <li><a href="files.html"><span>File List</span></a></li> 19 <li><a href="globals.html"><span>Globals</span></a></li> 20 </ul></div> 21<h1>uip/uip-neighbor.c</h1><a href="a00131.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/*</span> 22<a name="l00002"></a>00002 <span class="comment"> * Copyright (c) 2006, Swedish Institute of Computer Science.</span> 23<a name="l00003"></a>00003 <span class="comment"> * All rights reserved.</span> 24<a name="l00004"></a>00004 <span class="comment"> *</span> 25<a name="l00005"></a>00005 <span class="comment"> * Redistribution and use in source and binary forms, with or without</span> 26<a name="l00006"></a>00006 <span class="comment"> * modification, are permitted provided that the following conditions</span> 27<a name="l00007"></a>00007 <span class="comment"> * are met:</span> 28<a name="l00008"></a>00008 <span class="comment"> * 1. Redistributions of source code must retain the above copyright</span> 29<a name="l00009"></a>00009 <span class="comment"> * notice, this list of conditions and the following disclaimer.</span> 30<a name="l00010"></a>00010 <span class="comment"> * 2. Redistributions in binary form must reproduce the above copyright</span> 31<a name="l00011"></a>00011 <span class="comment"> * notice, this list of conditions and the following disclaimer in the</span> 32<a name="l00012"></a>00012 <span class="comment"> * documentation and/or other materials provided with the distribution.</span> 33<a name="l00013"></a>00013 <span class="comment"> * 3. Neither the name of the Institute nor the names of its contributors</span> 34<a name="l00014"></a>00014 <span class="comment"> * may be used to endorse or promote products derived from this software</span> 35<a name="l00015"></a>00015 <span class="comment"> * without specific prior written permission.</span> 36<a name="l00016"></a>00016 <span class="comment"> *</span> 37<a name="l00017"></a>00017 <span class="comment"> * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND</span> 38<a name="l00018"></a>00018 <span class="comment"> * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE</span> 39<a name="l00019"></a>00019 <span class="comment"> * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE</span> 40<a name="l00020"></a>00020 <span class="comment"> * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE</span> 41<a name="l00021"></a>00021 <span class="comment"> * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL</span> 42<a name="l00022"></a>00022 <span class="comment"> * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS</span> 43<a name="l00023"></a>00023 <span class="comment"> * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)</span> 44<a name="l00024"></a>00024 <span class="comment"> * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT</span> 45<a name="l00025"></a>00025 <span class="comment"> * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY</span> 46<a name="l00026"></a>00026 <span class="comment"> * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF</span> 47<a name="l00027"></a>00027 <span class="comment"> * SUCH DAMAGE.</span> 48<a name="l00028"></a>00028 <span class="comment"> *</span> 49<a name="l00029"></a>00029 <span class="comment"> * This file is part of the uIP TCP/IP stack</span> 50<a name="l00030"></a>00030 <span class="comment"> *</span> 51<a name="l00031"></a>00031 <span class="comment"> * $Id: uip-neighbor.c,v 1.2 2006/06/12 08:00:30 adam Exp $</span> 52<a name="l00032"></a>00032 <span class="comment"> */</span> 53<a name="l00033"></a>00033 <span class="comment"></span> 54<a name="l00034"></a>00034 <span class="comment">/**</span> 55<a name="l00035"></a>00035 <span class="comment"> * \file</span> 56<a name="l00036"></a>00036 <span class="comment"> * Database of link-local neighbors, used by IPv6 code and</span> 57<a name="l00037"></a>00037 <span class="comment"> * to be used by a future ARP code rewrite.</span> 58<a name="l00038"></a>00038 <span class="comment"> * \author</span> 59<a name="l00039"></a>00039 <span class="comment"> * Adam Dunkels <[email protected]></span> 60<a name="l00040"></a>00040 <span class="comment"> */</span> 61<a name="l00041"></a>00041 62<a name="l00042"></a>00042 <span class="preprocessor">#include "<a class="code" href="a00132.html">uip-neighbor.h</a>"</span> 63<a name="l00043"></a>00043 64<a name="l00044"></a>00044 <span class="preprocessor">#include <string.h></span> 65<a name="l00045"></a>00045 66<a name="l00046"></a><a class="code" href="a00131.html#5320d4457a472d8888ec1905bc0e0a1c">00046</a> <span class="preprocessor">#define MAX_TIME 128</span> 67<a name="l00047"></a>00047 <span class="preprocessor"></span> 68<a name="l00048"></a>00048 <span class="preprocessor">#ifdef UIP_NEIGHBOR_CONF_ENTRIES</span> 69<a name="l00049"></a>00049 <span class="preprocessor"></span><span class="preprocessor">#define ENTRIES UIP_NEIGHBOR_CONF_ENTRIES</span> 70<a name="l00050"></a>00050 <span class="preprocessor"></span><span class="preprocessor">#else </span><span class="comment">/* UIP_NEIGHBOR_CONF_ENTRIES */</span> 71<a name="l00051"></a><a class="code" href="a00131.html#5f2e1fcf0055d20ce17664b1027bb9eb">00051</a> <span class="preprocessor">#define ENTRIES 8</span> 72<a name="l00052"></a>00052 <span class="preprocessor"></span><span class="preprocessor">#endif </span><span class="comment">/* UIP_NEIGHBOR_CONF_ENTRIES */</span> 73<a name="l00053"></a>00053 74<a name="l00054"></a>00054 <span class="keyword">struct </span>neighbor_entry { 75<a name="l00055"></a>00055 <a class="code" href="a00150.html#g1ef35301f43a5bbb9f89f07b5a36b9a0">uip_ipaddr_t</a> ipaddr; 76<a name="l00056"></a>00056 <span class="keyword">struct </span><a class="code" href="a00092.html">uip_neighbor_addr</a> <a class="code" href="a00092.html#4dc3294d67d705f7248ef57e4259424f">addr</a>; 77<a name="l00057"></a>00057 <a class="code" href="a00153.html#g4caecabca98b43919dd11be1c0d4cd8e">u8_t</a> time; 78<a name="l00058"></a>00058 }; 79<a name="l00059"></a>00059 <span class="keyword">static</span> <span class="keyword">struct </span>neighbor_entry entries[<a class="code" href="a00131.html#5f2e1fcf0055d20ce17664b1027bb9eb">ENTRIES</a>]; 80<a name="l00060"></a>00060 81<a name="l00061"></a>00061 <span class="comment">/*---------------------------------------------------------------------------*/</span> 82<a name="l00062"></a>00062 <span class="keywordtype">void</span> 83<a name="l00063"></a><a class="code" href="a00131.html#1273664aba3e6a2a46e87dcb1a5f19ad">00063</a> <a class="code" href="a00132.html#1273664aba3e6a2a46e87dcb1a5f19ad">uip_neighbor_init</a>(<span class="keywordtype">void</span>) 84<a name="l00064"></a>00064 { 85<a name="l00065"></a>00065 <span class="keywordtype">int</span> i; 86<a name="l00066"></a>00066 87<a name="l00067"></a>00067 <span class="keywordflow">for</span>(i = 0; i < <a class="code" href="a00131.html#5f2e1fcf0055d20ce17664b1027bb9eb">ENTRIES</a>; ++i) { 88<a name="l00068"></a>00068 entries[i].time = <a class="code" href="a00131.html#5320d4457a472d8888ec1905bc0e0a1c">MAX_TIME</a>; 89<a name="l00069"></a>00069 } 90<a name="l00070"></a>00070 } 91<a name="l00071"></a>00071 <span class="comment">/*---------------------------------------------------------------------------*/</span> 92<a name="l00072"></a>00072 <span class="keywordtype">void</span> 93<a name="l00073"></a><a class="code" href="a00131.html#890e822616a6839dfbf51dcb591b8e99">00073</a> <a class="code" href="a00132.html#890e822616a6839dfbf51dcb591b8e99">uip_neighbor_periodic</a>(<span class="keywordtype">void</span>) 94<a name="l00074"></a>00074 { 95<a name="l00075"></a>00075 <span class="keywordtype">int</span> i; 96<a name="l00076"></a>00076 97<a name="l00077"></a>00077 <span class="keywordflow">for</span>(i = 0; i < <a class="code" href="a00131.html#5f2e1fcf0055d20ce17664b1027bb9eb">ENTRIES</a>; ++i) { 98<a name="l00078"></a>00078 <span class="keywordflow">if</span>(entries[i].time < <a class="code" href="a00131.html#5320d4457a472d8888ec1905bc0e0a1c">MAX_TIME</a>) { 99<a name="l00079"></a>00079 entries[i].time++; 100<a name="l00080"></a>00080 } 101<a name="l00081"></a>00081 } 102<a name="l00082"></a>00082 } 103<a name="l00083"></a>00083 <span class="comment">/*---------------------------------------------------------------------------*/</span> 104<a name="l00084"></a>00084 <span class="keywordtype">void</span> 105<a name="l00085"></a><a class="code" href="a00131.html#88460bea09a462d0e22511cb567eee14">00085</a> <a class="code" href="a00132.html#88460bea09a462d0e22511cb567eee14">uip_neighbor_add</a>(<a class="code" href="a00150.html#g1ef35301f43a5bbb9f89f07b5a36b9a0">uip_ipaddr_t</a> ipaddr, <span class="keyword">struct</span> <a class="code" href="a00092.html">uip_neighbor_addr</a> *addr) 106<a name="l00086"></a>00086 { 107<a name="l00087"></a>00087 <span class="keywordtype">int</span> i, oldest; 108<a name="l00088"></a>00088 <a class="code" href="a00153.html#g4caecabca98b43919dd11be1c0d4cd8e">u8_t</a> oldest_time; 109<a name="l00089"></a>00089 110<a name="l00090"></a>00090 printf(<span class="stringliteral">"Adding neighbor with link address %02x:%02x:%02x:%02x:%02x:%02x\n"</span>, 111<a name="l00091"></a>00091 addr-><a class="code" href="a00092.html#4dc3294d67d705f7248ef57e4259424f">addr</a>.<a class="code" href="a00089.html#aacd5fa1806e0f0dd0bc96dd36507ad8">addr</a>[0], addr-><a class="code" href="a00092.html#4dc3294d67d705f7248ef57e4259424f">addr</a>.<a class="code" href="a00089.html#aacd5fa1806e0f0dd0bc96dd36507ad8">addr</a>[1], addr-><a class="code" href="a00092.html#4dc3294d67d705f7248ef57e4259424f">addr</a>.<a class="code" href="a00089.html#aacd5fa1806e0f0dd0bc96dd36507ad8">addr</a>[2], addr-><a class="code" href="a00092.html#4dc3294d67d705f7248ef57e4259424f">addr</a>.<a class="code" href="a00089.html#aacd5fa1806e0f0dd0bc96dd36507ad8">addr</a>[3], 112<a name="l00092"></a>00092 addr-><a class="code" href="a00092.html#4dc3294d67d705f7248ef57e4259424f">addr</a>.<a class="code" href="a00089.html#aacd5fa1806e0f0dd0bc96dd36507ad8">addr</a>[4], addr-><a class="code" href="a00092.html#4dc3294d67d705f7248ef57e4259424f">addr</a>.<a class="code" href="a00089.html#aacd5fa1806e0f0dd0bc96dd36507ad8">addr</a>[5]); 113<a name="l00093"></a>00093 114<a name="l00094"></a>00094 <span class="comment">/* Find the first unused entry or the oldest used entry. */</span> 115<a name="l00095"></a>00095 oldest_time = 0; 116<a name="l00096"></a>00096 oldest = 0; 117<a name="l00097"></a>00097 <span class="keywordflow">for</span>(i = 0; i < <a class="code" href="a00131.html#5f2e1fcf0055d20ce17664b1027bb9eb">ENTRIES</a>; ++i) { 118<a name="l00098"></a>00098 <span class="keywordflow">if</span>(entries[i].time == <a class="code" href="a00131.html#5320d4457a472d8888ec1905bc0e0a1c">MAX_TIME</a>) { 119<a name="l00099"></a>00099 oldest = i; 120<a name="l00100"></a>00100 <span class="keywordflow">break</span>; 121<a name="l00101"></a>00101 } 122<a name="l00102"></a>00102 <span class="keywordflow">if</span>(<a class="code" href="a00148.html#g210e629f7252e4bc8458cbdf260b3318">uip_ipaddr_cmp</a>(entries[i].ipaddr, addr)) { 123<a name="l00103"></a>00103 oldest = i; 124<a name="l00104"></a>00104 <span class="keywordflow">break</span>; 125<a name="l00105"></a>00105 } 126<a name="l00106"></a>00106 <span class="keywordflow">if</span>(entries[i].time > oldest_time) { 127<a name="l00107"></a>00107 oldest = i; 128<a name="l00108"></a>00108 oldest_time = entries[i].time; 129<a name="l00109"></a>00109 } 130<a name="l00110"></a>00110 } 131<a name="l00111"></a>00111 132<a name="l00112"></a>00112 <span class="comment">/* Use the oldest or first free entry (either pointed to by the</span> 133<a name="l00113"></a>00113 <span class="comment"> "oldest" variable). */</span> 134<a name="l00114"></a>00114 entries[oldest].time = 0; 135<a name="l00115"></a>00115 <a class="code" href="a00148.html#g769512993b7b27271909d6daa4748b60">uip_ipaddr_copy</a>(entries[oldest].ipaddr, ipaddr); 136<a name="l00116"></a>00116 memcpy(&entries[oldest].addr, addr, <span class="keyword">sizeof</span>(<span class="keyword">struct</span> <a class="code" href="a00092.html">uip_neighbor_addr</a>)); 137<a name="l00117"></a>00117 } 138<a name="l00118"></a>00118 <span class="comment">/*---------------------------------------------------------------------------*/</span> 139<a name="l00119"></a>00119 <span class="keyword">static</span> <span class="keyword">struct </span>neighbor_entry * 140<a name="l00120"></a>00120 find_entry(<a class="code" href="a00150.html#g1ef35301f43a5bbb9f89f07b5a36b9a0">uip_ipaddr_t</a> ipaddr) 141<a name="l00121"></a>00121 { 142<a name="l00122"></a>00122 <span class="keywordtype">int</span> i; 143<a name="l00123"></a>00123 144<a name="l00124"></a>00124 <span class="keywordflow">for</span>(i = 0; i < <a class="code" href="a00131.html#5f2e1fcf0055d20ce17664b1027bb9eb">ENTRIES</a>; ++i) { 145<a name="l00125"></a>00125 <span class="keywordflow">if</span>(<a class="code" href="a00148.html#g210e629f7252e4bc8458cbdf260b3318">uip_ipaddr_cmp</a>(entries[i].ipaddr, ipaddr)) { 146<a name="l00126"></a>00126 <span class="keywordflow">return</span> &entries[i]; 147<a name="l00127"></a>00127 } 148<a name="l00128"></a>00128 } 149<a name="l00129"></a>00129 <span class="keywordflow">return</span> <a class="code" href="a00160.html#g070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>; 150<a name="l00130"></a>00130 } 151<a name="l00131"></a>00131 <span class="comment">/*---------------------------------------------------------------------------*/</span> 152<a name="l00132"></a>00132 <span class="keywordtype">void</span> 153<a name="l00133"></a><a class="code" href="a00131.html#1d5ce7047650f3ecee0814dbc8714099">00133</a> <a class="code" href="a00132.html#1d5ce7047650f3ecee0814dbc8714099">uip_neighbor_update</a>(<a class="code" href="a00150.html#g1ef35301f43a5bbb9f89f07b5a36b9a0">uip_ipaddr_t</a> ipaddr) 154<a name="l00134"></a>00134 { 155<a name="l00135"></a>00135 <span class="keyword">struct </span>neighbor_entry *e; 156<a name="l00136"></a>00136 157<a name="l00137"></a>00137 e = find_entry(ipaddr); 158<a name="l00138"></a>00138 <span class="keywordflow">if</span>(e != <a class="code" href="a00160.html#g070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>) { 159<a name="l00139"></a>00139 e->time = 0; 160<a name="l00140"></a>00140 } 161<a name="l00141"></a>00141 } 162<a name="l00142"></a>00142 <span class="comment">/*---------------------------------------------------------------------------*/</span> 163<a name="l00143"></a>00143 <span class="keyword">struct </span><a class="code" href="a00092.html">uip_neighbor_addr</a> * 164<a name="l00144"></a><a class="code" href="a00131.html#692d80636342d564422ccd9296ad568d">00144</a> <a class="code" href="a00132.html#692d80636342d564422ccd9296ad568d">uip_neighbor_lookup</a>(<a class="code" href="a00150.html#g1ef35301f43a5bbb9f89f07b5a36b9a0">uip_ipaddr_t</a> ipaddr) 165<a name="l00145"></a>00145 { 166<a name="l00146"></a>00146 <span class="keyword">struct </span>neighbor_entry *e; 167<a name="l00147"></a>00147 168<a name="l00148"></a>00148 e = find_entry(ipaddr); 169<a name="l00149"></a>00149 <span class="keywordflow">if</span>(e != <a class="code" href="a00160.html#g070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>) { 170<a name="l00150"></a>00150 <span class="comment">/* printf("Lookup neighbor with link address %02x:%02x:%02x:%02x:%02x:%02x\n",</span> 171<a name="l00151"></a>00151 <span class="comment"> e->addr.addr.addr[0], e->addr.addr.addr[1], e->addr.addr.addr[2], e->addr.addr.addr[3],</span> 172<a name="l00152"></a>00152 <span class="comment"> e->addr.addr.addr[4], e->addr.addr.addr[5]);*/</span> 173<a name="l00153"></a>00153 174<a name="l00154"></a>00154 <span class="keywordflow">return</span> &e->addr; 175<a name="l00155"></a>00155 } 176<a name="l00156"></a>00156 <span class="keywordflow">return</span> <a class="code" href="a00160.html#g070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>; 177<a name="l00157"></a>00157 } 178<a name="l00158"></a>00158 <span class="comment">/*---------------------------------------------------------------------------*/</span> 179</pre></div><hr size="1"><address style="align: right;"><small>Generated on Mon Jun 12 10:23:01 2006 for uIP 1.0 by 180<a href="http://www.doxygen.org/index.html"> 181<img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.4.6 </small></address> 182</body> 183</html> 184
