Lines Matching refs:node
23 * Per node, two clock lists are maintained for file pages: the
160 * For each node's LRU lists, a counter for inactive evictions and
161 * activations is maintained (node->nonresident_age).
164 * identify the node) is stored in the now empty page cache
288 * evicted page in the context of the node and the memcg whose memory
495 void workingset_update_node(struct xa_node *node)
503 * as node->private_list is protected by the i_pages lock.
507 if (node->count && node->count == node->nr_values) {
508 if (list_empty(&node->private_list)) {
509 list_lru_add(&shadow_nodes, &node->private_list);
510 __inc_lruvec_slab_state(node, WORKINGSET_NODES);
513 if (!list_empty(&node->private_list)) {
514 list_lru_del(&shadow_nodes, &node->private_list);
515 __dec_lruvec_slab_state(node, WORKINGSET_NODES);
541 * node for every eligible shadow entry, so compromise on a
585 struct xa_node *node = container_of(item, struct xa_node, private_list);
591 * the shadow node LRU under the i_pages lock and the
597 * pin only the address_space of the particular node we want
598 * to reclaim, take the node off-LRU, and drop the lru_lock.
601 mapping = container_of(node->array, struct address_space, i_pages);
611 __dec_lruvec_slab_state(node, WORKINGSET_NODES);
618 * delete and free the empty node afterwards.
620 if (WARN_ON_ONCE(!node->nr_values))
622 if (WARN_ON_ONCE(node->count != node->nr_values))
624 mapping->nrexceptional -= node->nr_values;
625 xa_delete_node(node, workingset_update_node);
626 __inc_lruvec_slab_state(node, WORKINGSET_NODERECLAIM);