| /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;
|
| 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/sys/netatalk/ |
| aarp.c | 542 int oldest = -1; local 557 if ((int) aat->aat_timer > oldest) { 558 oldest = aat->aat_timer;
|
| aarp.c | 542 int oldest = -1; local 557 if ((int) aat->aat_timer > oldest) { 558 oldest = aat->aat_timer;
|
| /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;
|
| 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/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;
|
| 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...] |
| 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...] |
| 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/netinet/ |
| tcp_vtw.h | 258 /**/ oldest; /* ^ to oldest */ member in struct:vtw_ctl
|
| tcp_vtw.h | 258 /**/ oldest; /* ^ to oldest */ member in struct:vtw_ctl
|
| /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...] |
| 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/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");
|
| 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/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;
|
| genfb.c | 1151 int oldest = 1; local 1155 oldest = i; 1161 b = &scp->sc_buckets[oldest]; 1165 scp->sc_attrmap[idx] = oldest;
|
| /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) {
|
| 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/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)
|