Lines Matching refs:reap
905 { "reap", KSTAT_DATA_UINT64 },
2189 * The number of bytes to reap before we call kpreempt(). The default (1MB)
2202 long reap;
2208 reap = MIN(cp->cache_full.ml_reaplimit, cp->cache_full.ml_min);
2209 while (reap-- &&
2219 reap = MIN(cp->cache_empty.ml_reaplimit, cp->cache_empty.ml_min);
2220 while (reap-- &&
3184 * if we have segkp under heap, reap segkp cache.
3195 * we won't reap again until the current reap completes *and*
3212 * It may not be kosher to do memory allocation when a reap is called
3214 * start the reap going with a TQ_NOALLOC dispatch. If the dispatch
3215 * fails, we reset the flag, and the next reap will try again.
3488 long reap;
3536 reap = MIN(cp->cache_full.ml_reaplimit, cp->cache_full.ml_min);
3537 reap = MIN(reap, cp->cache_full.ml_total);
3589 reclaimable += ((uint64_t)reap * cp->cache_magtype->mt_magsize);
5502 long reap;
5505 reap = MIN(cp->cache_full.ml_reaplimit, cp->cache_full.ml_min);
5506 reap = MIN(reap, cp->cache_full.ml_total);
5509 nfree += ((uint64_t)reap * cp->cache_magtype->mt_magsize);
5522 boolean_t reap = B_FALSE;
5537 if (kmem_cache_is_fragmented(cp, &reap)) {
5607 if (reap) {