Searched refs:oldest (Results 1 - 8 of 8) sorted by relevance

/barrelfish-master/lib/lwip/src/core/ipv4/
H A Dip_frag.c71 /** Set to 0 to prevent freeing the oldest datagram when the reassembly buffer is
210 * Free the oldest datagram to make room for enqueueing new fragments.
224 struct ip_reassdata *r, *oldest, *prev; local
231 oldest = NULL;
239 if (oldest == NULL) {
240 oldest = r;
241 } else if (r->timer <= oldest->timer) {
242 /* older than the previous oldest */
243 oldest = r;
251 if (oldest !
[all...]
/barrelfish-master/lib/lwip2/src/core/ipv4/
H A Dip4_frag.c72 /** Set to 0 to prevent freeing the oldest datagram when the reassembly buffer is
214 * Free the oldest datagram to make room for enqueueing new fragments.
228 struct ip_reassdata *r, *oldest, *prev, *oldest_prev; local
235 oldest = NULL;
244 if (oldest == NULL) {
245 oldest = r;
247 } else if (r->timer <= oldest->timer) {
248 /* older than the previous oldest */
249 oldest = r;
258 if (oldest !
[all...]
/barrelfish-master/lib/lwip2/src/core/ipv6/
H A Dip6_frag.c65 /** Set to 0 to prevent freeing the oldest datagram when the reassembly buffer is
215 * Free the oldest datagram to make room for enqueueing new fragments.
225 struct ip6_reassdata *r, *oldest; local
230 r = oldest = reassdatagrams;
233 if (r->timer <= oldest->timer) {
234 /* older than the previous oldest */
235 oldest = r;
240 if (oldest == ipr) {
244 if (oldest != NULL) {
245 ip6_reass_free_complete_datagram(oldest);
[all...]
/barrelfish-master/lib/libc/yp/
H A Dyplib.c184 time_t oldest = 0; local
186 oldest = ~oldest;
189 if (c->ypc_expire_t < oldest) {
190 oldest = c->ypc_expire_t;
/barrelfish-master/usr/eclipseclp/documents/userman/
H A Dumsporting.tex72 of the oldest and most influential Prolog implementations.
H A Dumsdebug.tex996 Prints all the current goal's ancestors from the oldest to the newest.
/barrelfish-master/usr/eclipseclp/Kernel/lib/
H A Dtracer_tcl.pl1836 % Anc are returned with oldest first; printing in GUI can then
/barrelfish-master/lib/tommath/
H A Dtommath.tex6530 The Fermat test is probably one the oldest tests to have a non-trivial probability of success. It is based on the fact that if $n$ is in

Completed in 144 milliseconds