| /src/external/bsd/ntp/dist/ntpd/ |
| ntp_monitor.c | 321 mon_entry * oldest; local
448 oldest = TAIL_DLIST(mon_mru_list, mru);
450 if (oldest != NULL) {
452 L_SUB(&interval_fp, &oldest->last);
458 if (oldest != NULL && mru_maxage < oldest_age) {
459 mon_reclaim_entry(oldest);
460 mon = oldest;
471 mon_reclaim_entry(oldest);
472 mon = oldest;
|
| /src/external/gpl3/gdb.old/dist/gdb/ |
| dcache.c | 106 struct dcache_block *oldest; /* least-recently-allocated list. */ member in struct:dcache_struct
108 /* The free list is maintained identically to OLDEST to simplify
144 BLIST points to the oldest block.
158 least-recently-allocated list *BLIST points to the oldest block. */
183 *BLIST points to the oldest block. */
226 for_each_block (&dcache->oldest, free_block, NULL);
233 This doesn't remove the block from the oldest list on purpose.
250 for_each_block (&dcache->oldest, invalidate_block, dcache);
252 dcache->oldest = NULL;
278 remove_block (&dcache->oldest, db)
[all...] |
| /src/external/gpl3/gdb/dist/gdb/ |
| dcache.c | 106 struct dcache_block *oldest; /* least-recently-allocated list. */ member in struct:dcache_struct
108 /* The free list is maintained identically to OLDEST to simplify
144 BLIST points to the oldest block.
158 least-recently-allocated list *BLIST points to the oldest block. */
183 *BLIST points to the oldest block. */
226 for_each_block (&dcache->oldest, free_block, NULL);
233 This doesn't remove the block from the oldest list on purpose.
250 for_each_block (&dcache->oldest, invalidate_block, dcache);
252 dcache->oldest = NULL;
278 remove_block (&dcache->oldest, db)
[all...] |
| /src/sys/arch/vax/include/ |
| qduser.h | 302 int oldest; /* index to oldest queue'd request */ member in struct:DMAreq_header
335 * or oldest (GET) request */
338 #define DMA_GETBEGIN(header) (&(header)->DMAreq[(header)->oldest])
342 #define DMA_GETEND(header) (++(header)->oldest >= (header)->size \
343 ? (header)->oldest = 0 : 0); \
|
| /src/sys/dev/qbus/ |
| qduser.h | 295 int oldest; /* index to oldest queue'd request */ member in struct:DMAreq_header
328 * or oldest (GET) request */
331 #define DMA_GETBEGIN(header) (&(header)->DMAreq[(header)->oldest])
335 #define DMA_GETEND(header) (++(header)->oldest >= (header)->size \
336 ? (header)->oldest = 0 : 0); \
|
| qd.c | 1104 * extract the oldest event from the event queue
2087 header->DMAreq[header->oldest].DMAdone |= HARD_ERROR;
2088 header->newest = header->oldest;
2109 header->DMAreq[header->oldest].DMAdone |= REQUEST_DONE;
2110 QDlast_DMAtype = header->DMAreq[header->oldest].DMAtype;
3327 DMAheader[unit]->oldest = 0;
|
| /src/sys/dev/wscons/ |
| wsdisplay_glyphcache.c | 311 int i, oldest = 1; local
315 oldest = i;
321 b = &gc->gc_buckets[oldest];
325 gc->gc_attrmap[idx] = oldest;
|
| /src/usr.bin/systat/ |
| bufcache.c | 380 size_t i, oldest; local
383 oldest = 0;
388 if (vcache[i].vc_age < vcache[oldest].vc_age)
389 oldest = i;
402 i = oldest;
|
| /src/usr.bin/netstat/ |
| vtw.c | 321 if (vtw_tcpv4[i].oldest.v4)
322 vtw_tcpv4[i].oldest.v4 += delta;
428 if (vtw_tcpv6[i].oldest.v6)
429 vtw_tcpv6[i].oldest.v6 += delta;
|
| /src/bin/ksh/ |
| jobs.c | 1049 Job *jl, *oldest; local
1060 oldest = (Job *) 0;
1063 && (!oldest || jl->age < oldest->age))
1064 oldest = jl;
1065 if (!oldest) {
1073 remove_job(oldest, "zombie");
|
| /src/external/bsd/unbound/dist/services/cache/ |
| infra.c | 1044 * oldest to accommodate. Else return none. */
1048 int i, oldest; local
1054 /* remove oldest timestamp, and insert it at t with 0 qps */
1055 oldest = 0;
1057 if(d->timestamp[i] < d->timestamp[oldest])
1058 oldest = i;
1060 d->timestamp[oldest] = t;
1061 d->qps[oldest] = 0;
1062 return &(d->qps[oldest]);
1065 /** find the second and return its rate counter, if none, remove oldest t
[all...] |
| /src/sys/netatalk/ |
| aarp.c | 542 int oldest = -1; local
557 if ((int) aat->aat_timer > oldest) {
558 oldest = aat->aat_timer;
|
| /src/sys/netinet/ |
| tcp_vtw.h | 258 /**/ oldest; /* ^ to oldest */ member in struct:vtw_ctl
|
| tcp_vtw.c | 64 * runs out, VTW makes room by discarding old vestigial PCBs, oldest first.
685 /* We only delete the oldest entry.
687 if (vtw != ctl->oldest.v)
697 ctl->oldest.v = 0;
699 ctl->oldest.v = vtw_next(ctl, vtw);
1476 if (!ctl->oldest.v)
1477 ctl->oldest.v = vtw;
1491 if (!ctl->oldest.v) {
1496 for (vtw = ctl->oldest.v; vtw && ctl->nalloc; ) {
1508 ctl->oldest.v = vtw = vtw_next(ctl, vtw)
[all...] |
| /src/external/bsd/ntp/dist/libntp/lib/isc/ |
| log.c | 1237 * though the file names are 0 based, so an oldest log of log.1
1553 isc_time_t oldest; local
1560 * 'oldest' is the age of the oldest messages
1564 TIME_NOW(&oldest);
1565 if (isc_time_subtract(&oldest, &interval, &oldest)
1577 &oldest) < 0) {
|
| /src/external/mpl/bind/dist/lib/isc/ |
| log.c | 1316 * First find all the logfiles and remove the oldest ones
1632 isc_time_t oldest; local
1640 * 'oldest' is the age of the oldest
1644 oldest = isc_time_now();
1645 if (isc_time_subtract(&oldest, &interval,
1646 &oldest) != ISC_R_SUCCESS)
1660 &oldest) < 0)
|
| tls.c | 1410 /* Cache entries within the bucket (from the oldest to the newest). */
1444 * LRU-manner, so that the oldest entry might be efficiently
1641 * Cache overrun. We need to remove the oldest entry from the
1644 client_session_cache_entry_t *restrict oldest; local
1647 oldest = ISC_LIST_HEAD(cache->lru_entries);
1648 client_cache_entry_delete(cache, oldest);
|
| /src/sys/dev/wsfb/ |
| genfb.c | 1151 int oldest = 1; local
1155 oldest = i;
1161 b = &scp->sc_buckets[oldest];
1165 scp->sc_attrmap[idx] = oldest;
|
| /src/external/mpl/dhcp/bind/dist/lib/isc/ |
| log.c | 1350 * First find all the logfiles and remove the oldest ones
1656 isc_time_t oldest; local
1664 * 'oldest' is the age of the oldest
1668 TIME_NOW(&oldest);
1669 if (isc_time_subtract(&oldest, &interval,
1670 &oldest) != ISC_R_SUCCESS)
1684 &oldest) < 0)
|
| /src/external/gpl3/gcc.old/dist/gcc/config/gcn/ |
| gcn.cc | 4893 int oldest = 0; local
4919 for (int i = oldest; i < oldest + max_waits; i++)
4997 for (int i = oldest + max_waits - 1; i > oldest; i--)
5012 back[oldest].insn = insn;
5013 back[oldest].unit = iunit;
5014 back[oldest].delayeduse = idelayeduse;
5015 back[oldest].writes = iwrites;
5016 back[oldest].reads = ireads
[all...] |
| /src/external/bsd/nsd/dist/ |
| ixfr.c | 506 /* iterator over ixfr data. find first element, eg. oldest zone version
1522 /* remove the oldest data entry from the ixfr versions */
1526 struct ixfr_data* oldest = ixfr_data_first(ixfr); local
1527 if(ixfr->oldest_serial == oldest->oldserial) {
1529 struct ixfr_data* next = ixfr_data_next(ixfr, oldest);
1533 else ixfr->oldest_serial = oldest->newserial;
1538 if(ixfr->newest_serial == oldest->oldserial) {
1541 zone_ixfr_remove(ixfr, oldest);
1569 * this zone, and if so, delete the oldest IXFR to make space */
1576 /* if deleting the oldest elements does not work, then thi
[all...] |
| /src/external/mpl/bind/dist/lib/ns/ |
| client.c | 214 ns_client_t *oldest; local
218 oldest = ISC_LIST_HEAD(client->manager->recursing);
219 if (oldest != NULL) {
220 ISC_LIST_UNLINK(client->manager->recursing, oldest, rlink);
221 ns_query_cancel(oldest);
|
| /src/external/gpl3/gcc/dist/gcc/config/gcn/ |
| gcn.cc | 6208 int oldest = 0; local
6235 for (int i = oldest; i < oldest + max_waits; i++)
6345 for (int i = oldest + max_waits - 1; i > oldest; i--)
6360 back[oldest].insn = insn;
6361 back[oldest].unit = iunit;
6362 back[oldest].delayeduse = idelayeduse;
6363 back[oldest].writes = iwrites;
6364 back[oldest].reads = ireads
[all...] |
| /src/external/bsd/wpa/dist/src/p2p/ |
| p2p.c | 420 struct p2p_device *dev, *oldest = NULL; local
429 if (oldest == NULL ||
430 os_reltime_before(&dev->last_seen, &oldest->last_seen))
431 oldest = dev;
433 if (count + 1 > p2p->cfg->max_peers && oldest) {
435 "Remove oldest peer entry to make room for a new peer "
436 MACSTR, MAC2STR(oldest->info.p2p_device_addr));
437 dl_list_del(&oldest->list);
438 p2p_device_free(p2p, oldest);
|
| /src/external/bsd/openldap/dist/libraries/liblmdb/ |
| mdb.c | 666 * A writer thread will scan every slot in the table to determine the oldest
671 * operation - all we need is to know the upper bound on the oldest reader,
1331 txnid_t me_pgoldest; /**< ID of oldest reader last time we looked */
2153 /** Find oldest txnid still referenced. Expects txn->mt_txnid > 0. */
2158 txnid_t mr, oldest = txn->mt_txnid - 1; local
2164 if (oldest > mr)
2165 oldest = mr;
2169 return oldest;
2226 txnid_t oldest = 0, last; local
2272 oldest = env->me_pgoldest
[all...] |
