Searched refs:aging (Results 1 – 7 of 7) sorted by relevance
109 There are two conceptually independent procedures: the aging and the114 The aging produces young generations. Given an ``lruvec``, it116 ``MIN_NR_GENS``. The aging promotes hot pages to the youngest119 ``max_seq``. The aging uses page table walks and rmap walks to find124 the aging scans the adjacent PTEs. For both, on finding a young PTE,125 the aging clears the accessed bit and updates the gen counter of the137 page according to its gen counter if the aging has found this page193 forms a feedback loop between the eviction and the aging.203 filter. In the aging path, set membership means that the PTE range264 The aging and the eviction form a producer-consumer model;[all …]
428 * consumption by this worker: queue aging is accounted for while choosing a445 unsigned long aging; in scmi_xfer_raw_worker() local 465 aging = jiffies - rw->start_jiffies; in scmi_xfer_raw_worker() 466 timeout_ms = max_tmo > aging ? in scmi_xfer_raw_worker() 467 jiffies_to_msecs(max_tmo - aging) : 1; in scmi_xfer_raw_worker()
731 u8 aging; member
322 fdb->aging = (reg[2] >> AGE_TIMER) & AGE_TIMER_MASK; in mt7530_fdb_read()336 u8 aging, u8 type) in mt7530_fdb_write() argument344 reg[2] |= (aging & AGE_TIMER_MASK) << AGE_TIMER; in mt7530_fdb_write()
742 dll_aging_clk_div: clock-dll-aging-clk-div@4250 {
651 is needed for unavoidable corrections of aging batteries.
794 to maximize the performance of an aging display, or if you just