Lines Matching full:entries

69 …049 <span class="preprocessor"></span><span class="preprocessor">#define ENTRIES UIP_NEIGHBOR_CONF…
71 …tml#5f2e1fcf0055d20ce17664b1027bb9eb">00051</a> <span class="preprocessor">#define ENTRIES 8</span>
79 …word">struct </span>neighbor_entry entries[<a class="code" href="a00131.html#5f2e1fcf0055d20ce1766…
87 …= 0; i &lt; <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#5320d4457a472d88…
97 …= 0; i &lt; <a class="code" href="a00131.html#5f2e1fcf0055d20ce17664b1027bb9eb">ENTRIES</a>; ++i) {
98 <a name="l00078"></a>00078     <span class="keywordflow">if</span>(entries[i].time &lt; <a class="c…
99 <a name="l00079"></a>00079       entries[i].time++;
117 …= 0; i &lt; <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="cod…
122 … href="a00148.html#g210e629f7252e4bc8458cbdf260b3318">uip_ipaddr_cmp</a>(entries[i].ipaddr, addr))…
126 <a name="l00106"></a>00106     <span class="keywordflow">if</span>(entries[i].time &gt; oldest_time…
128 <a name="l00108"></a>00108       oldest_time = entries[i].time;
134 <a name="l00114"></a>00114   entries[oldest].time = 0;
135 …href="a00148.html#g769512993b7b27271909d6daa4748b60">uip_ipaddr_copy</a>(entries[oldest].ipaddr, i…
136 <a name="l00116"></a>00116   memcpy(&amp;entries[oldest].addr, addr, <span class="keyword">sizeof</…
144 …= 0; i &lt; <a class="code" href="a00131.html#5f2e1fcf0055d20ce17664b1027bb9eb">ENTRIES</a>; ++i) {
145 … href="a00148.html#g210e629f7252e4bc8458cbdf260b3318">uip_ipaddr_cmp</a>(entries[i].ipaddr, ipaddr…
146 <a name="l00126"></a>00126       <span class="keywordflow">return</span> &amp;entries[i];