Searched refs:aging (Results 1 – 8 of 8) 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 …]
445 unsigned long aging; in scmi_xfer_raw_worker() local465 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()
306 struct mlx5_fc *mlx5_fc_create(struct mlx5_core_dev *dev, bool aging);
290 fdb->aging = (reg[2] >> AGE_TIMER) & AGE_TIMER_MASK; in mt7530_fdb_read()304 u8 aging, u8 type) in mt7530_fdb_write() argument312 reg[2] |= (aging & AGE_TIMER_MASK) << AGE_TIMER; in mt7530_fdb_write()
742 dll_aging_clk_div: clock-dll-aging-clk-div@4250 {
652 is needed for unavoidable corrections of aging batteries.
575 in between aging and valid blocks, the value should be in range of
794 to maximize the performance of an aging display, or if you just