Searched refs:stable_node (Results 1 – 3 of 3) sorted by relevance
155 struct stable_node { struct209 struct stable_node *head;310 stable_node_cache = KSM_KMEM_CACHE(stable_node, 0); in ksm_slab_init()336 static __always_inline bool is_stable_node_chain(struct stable_node *chain) in is_stable_node_chain()341 static __always_inline bool is_stable_node_dup(struct stable_node *dup) in is_stable_node_dup()346 static inline void stable_node_chain_add_dup(struct stable_node *dup, in stable_node_chain_add_dup()347 struct stable_node *chain) in stable_node_chain_add_dup()356 static inline void __stable_node_dup_del(struct stable_node *dup) in __stable_node_dup_del()363 static inline void stable_node_dup_del(struct stable_node *dup) in stable_node_dup_del()393 static inline struct stable_node *alloc_stable_node(void) in alloc_stable_node()[all …]
53 KSM pages. The ksmd walk over the stable_node "chains" is also O(N),54 but N is the number of stable_node "dups", not the number of56 practice the best stable_node "dup" candidate will be kept and found60 (because there will be fewer stable_node dups queued into the61 stable_node chain->hlist to check for pruning) and higher68 in the stable_node dups, which could be solved by introducing70 one stable_node dup to another stable_node dup, in order to free up71 stable_node "dups" with few rmap_items in them, but that may increase75 The whole list of stable_node "dups" linked in the stable_node83 :functions: mm_slot ksm_scan stable_node rmap_item
18 struct stable_node;
