Searched refs:cost (Results 1 – 4 of 4) sorted by relevance
538 unsigned int cost; in atgc_lookup_victim() local573 cost = UINT_MAX - (age + u); in atgc_lookup_victim()576 if (cost < p->min_cost || in atgc_lookup_victim()577 (cost == p->min_cost && age > p->oldest_age)) { in atgc_lookup_victim()578 p->min_cost = cost; in atgc_lookup_victim()607 unsigned int cost, iter; in atssr_lookup_victim() local638 cost = UINT_MAX - vblocks; in atssr_lookup_victim()640 if (cost < p->min_cost || in atssr_lookup_victim()641 (cost == p->min_cost && age > p->oldest_age)) { in atssr_lookup_victim()642 p->min_cost = cost; in atssr_lookup_victim()[all …]
147 The cost of swabbing is changing the code to use the le32_to_cpu166 The cost of option 1 is that kernels with a larger PAGE_SIZE169 The cost of option 2 relative to option 1 is that the code uses181 cost is greater complexity. Probably not worth it, but I hope someone186 Another cost of 2 and 3 over 1 is making mkcramfs use a different
21 performance under extremely memory pressure without extra cost.
76 cost and disk space to dump all the text. However, versions of