Home
last modified time | relevance | path

Searched refs:private_list (Results 1 – 5 of 5) sorted by relevance

/linux/mm/
H A Dworkingset.c628 if (list_empty(&node->private_list)) { in workingset_update_node()
629 list_lru_add_obj(&shadow_nodes, &node->private_list); in workingset_update_node()
633 if (!list_empty(&node->private_list)) { in workingset_update_node()
634 list_lru_del_obj(&shadow_nodes, &node->private_list); in workingset_update_node()
702 struct xa_node *node = container_of(item, struct xa_node, private_list); in shadow_lru_isolate()
/linux/lib/
H A Dradix-tree.c302 INIT_LIST_HEAD(&node->private_list); in radix_tree_node_rcu_free()
535 WARN_ON_ONCE(!list_empty(&node->private_list)); in radix_tree_shrink()
572 WARN_ON_ONCE(!list_empty(&node->private_list)); in delete_node()
673 WARN_ON_ONCE(!list_empty(&old->private_list)); in radix_tree_free_nodes()
1575 INIT_LIST_HEAD(&node->private_list); in radix_tree_node_ctor()
H A Dxarray.c258 XA_NODE_BUG_ON(node, !list_empty(&node->private_list)); in xa_node_free()
275 XA_NODE_BUG_ON(node, !list_empty(&node->private_list)); in xas_destroy()
313 XA_NODE_BUG_ON(xas->xa_alloc, !list_empty(&xas->xa_alloc->private_list)); in xas_nomem()
349 XA_NODE_BUG_ON(xas->xa_alloc, !list_empty(&xas->xa_alloc->private_list)); in __xas_nomem()
359 XA_NODE_BUG_ON(node, !list_empty(&node->private_list)); in xas_update()
392 XA_NODE_BUG_ON(node, !list_empty(&node->private_list)); in xas_alloc()
2419 node->array, node->private_list.prev, node->private_list.next); in xa_dump_node()
H A Dtest_xarray.c2001 if (list_empty(&node->private_list)) in test_update_node()
2002 list_add(&shadow_nodes, &node->private_list); in test_update_node()
2004 if (!list_empty(&node->private_list)) in test_update_node()
2005 list_del_init(&node->private_list); in test_update_node()
2015 struct xa_node, private_list))) { in shadow_remove()
2017 list_del_init(&node->private_list); in shadow_remove()
/linux/include/linux/
H A Dxarray.h1176 struct list_head private_list; /* For tree user */ member