165  * slot of the evicted page.  This is called a shadow entry.
167  * On cache misses for which there are shadow entries, an eligible
199 static void unpack_shadow(void *shadow, int *memcgidp, pg_data_t **pgdat,  in unpack_shadow()  argument
202 	unsigned long entry = xa_to_value(shadow);  in unpack_shadow()
252  * Return: a shadow entry to be stored in @page->mapping->i_pages in place
278  * @shadow: shadow entry of the evicted page
284 void workingset_refault(struct page *page, void *shadow)  in workingset_refault()  argument
299 	unpack_shadow(shadow, &memcgid, &pgdat, &eviction, &workingset);  in workingset_refault()
329 	 * special case: usually, shadow entries have a short lifetime  in workingset_refault()
332 	 * nonresident_age to lap a shadow entry in the field, which  in workingset_refault()
421  * Shadow entries reflect the share of the working set that does not
427  * create excessive amounts of shadow nodes.  To keep a lid on this,
428  * track shadow nodes and reclaim them when they grow way past the
437 	 * Track non-empty nodes that contain only shadow entries;  in workingset_update_node()
472 	 * containing shadow entries. We don't need to keep more  in count_shadow_nodes()
473 	 * shadow entries than possible pages on the active list,  in count_shadow_nodes()
480 	 * Nodes might be sparsely populated, with only one shadow  in count_shadow_nodes()
482 	 * node for every eligible shadow entry, so compromise on a  in count_shadow_nodes()
487 	 * each, this will reclaim shadow entries when they consume  in count_shadow_nodes()
527 	 * the shadow node LRU under the i_pages lock and the  in shadow_lru_isolate()
552 	 * The nodes should only contain one or more shadow entries,  in shadow_lru_isolate()