Searched refs:proactive (Results 1 – 7 of 7) sorted by relevance
18 bool "DAMON sample module for access-aware proactive reclamation"21 This builds DAMON sample module for access-aware proactive
85 This is suggested to be used as a proactive and lightweight
122 unsigned int proactive:1; member246 if (sc->proactive && sc->proactive_swappiness) in sc_swappiness()476 if (sc->proactive) in reclaimer_offset()1600 if (!sc->proactive) { in shrink_folio_list()2558 WARN_ON_ONCE(!sc->proactive); in get_scan_count()4930 if (!sc->proactive) in shrink_one()5028 set_mm_walk(NULL, sc->proactive); in lru_gen_shrink_lruvec()5057 set_mm_walk(pgdat, sc->proactive); in lru_gen_shrink_node()5568 .proactive = true, in lru_gen_seq_write()6026 if (!sc->proactive) in shrink_node_memcgs()[all …]
2893 static int compact_node(pg_data_t *pgdat, bool proactive) in compact_node() argument2899 .mode = proactive ? MIGRATE_SYNC_LIGHT : MIGRATE_SYNC, in compact_node()2903 .proactive_compaction = proactive, in compact_node()2918 if (proactive) { in compact_node()
8 be used for proactive and lightweight reclamation under light memory pressure.27 memory utilization drop of the systems. Running the proactive reclamation in
127 trigger the proactive compaction. Setting it to 0 disables proactive compaction.133 proactive compaction is not being effective.
1947 allocation boundaries as a proactive defense