mm/ksm.c

1032

struct ksm_stable_node *stable_node;

mm/ksm.c

1090

struct ksm_stable_node *folio_stable_node(const struct folio *folio)

mm/ksm.c

1096

struct ksm_stable_node *stable_node)

mm/ksm.c

1106

static int remove_stable_node(struct ksm_stable_node *stable_node)

mm/ksm.c

1144

static int remove_stable_node_chain(struct ksm_stable_node *stable_node,

mm/ksm.c

1147

struct ksm_stable_node *dup;

mm/ksm.c

1171

struct ksm_stable_node *stable_node, *next;

mm/ksm.c

1178

struct ksm_stable_node, node);

mm/ksm.c

1643

bool __is_page_sharing_candidate(struct ksm_stable_node *stable_node, int offset)

mm/ksm.c

1657

bool is_page_sharing_candidate(struct ksm_stable_node *stable_node)

mm/ksm.c

1662

static struct folio *stable_node_dup(struct ksm_stable_node **_stable_node_dup,

mm/ksm.c

1663

struct ksm_stable_node **_stable_node,

mm/ksm.c

1667

struct ksm_stable_node *dup, *found = NULL, *stable_node = *_stable_node;

mm/ksm.c

1790

static struct folio *__stable_node_chain(struct ksm_stable_node **_stable_node_dup,

mm/ksm.c

1791

struct ksm_stable_node **_stable_node,

mm/ksm.c

1795

struct ksm_stable_node *stable_node = *_stable_node;

mm/ksm.c

1805

static __always_inline struct folio *chain_prune(struct ksm_stable_node **s_n_d,

mm/ksm.c

1806

struct ksm_stable_node **s_n,

mm/ksm.c

1812

static __always_inline struct folio *chain(struct ksm_stable_node **s_n_d,

mm/ksm.c

1813

struct ksm_stable_node **s_n,

mm/ksm.c

1834

struct ksm_stable_node *stable_node, *stable_node_dup;

mm/ksm.c

1835

struct ksm_stable_node *page_node;

mm/ksm.c

1857

stable_node = rb_entry(*new, struct ksm_stable_node, node);

mm/ksm.c

2042

static struct ksm_stable_node *stable_tree_insert(struct folio *kfolio)

mm/ksm.c

2049

struct ksm_stable_node *stable_node, *stable_node_dup;

mm/ksm.c

2064

stable_node = rb_entry(*new, struct ksm_stable_node, node);

mm/ksm.c

2106

struct ksm_stable_node *orig = stable_node;

mm/ksm.c

217

struct ksm_stable_node *head;

mm/ksm.c

2209

struct ksm_stable_node *stable_node,

mm/ksm.c

2256

struct ksm_stable_node *stable_node;

mm/ksm.c

2614

struct ksm_stable_node *stable_node, *next;

mm/ksm.c

3157

struct ksm_stable_node *stable_node;

mm/ksm.c

3231

struct ksm_stable_node *stable_node;

mm/ksm.c

3271

struct ksm_stable_node *stable_node;

mm/ksm.c

3304

static bool stable_node_dup_remove_range(struct ksm_stable_node *stable_node,

mm/ksm.c

3320

static bool stable_node_chain_remove_range(struct ksm_stable_node *stable_node,

mm/ksm.c

3325

struct ksm_stable_node *dup;

mm/ksm.c

3349

struct ksm_stable_node *stable_node, *next;

mm/ksm.c

3356

stable_node = rb_entry(node, struct ksm_stable_node, node);

mm/ksm.c

496

stable_node_cache = KMEM_CACHE(ksm_stable_node, 0);

mm/ksm.c

522

static __always_inline bool is_stable_node_chain(struct ksm_stable_node *chain)

mm/ksm.c

527

static __always_inline bool is_stable_node_dup(struct ksm_stable_node *dup)

mm/ksm.c

532

static inline void stable_node_chain_add_dup(struct ksm_stable_node *dup,

mm/ksm.c

533

struct ksm_stable_node *chain)

mm/ksm.c

542

static inline void __stable_node_dup_del(struct ksm_stable_node *dup)

mm/ksm.c

549

static inline void stable_node_dup_del(struct ksm_stable_node *dup)

mm/ksm.c

580

static inline struct ksm_stable_node *alloc_stable_node(void)

mm/ksm.c

590

static inline void free_stable_node(struct ksm_stable_node *stable_node)

mm/ksm.c

841

static struct ksm_stable_node *alloc_stable_node_chain(struct ksm_stable_node *dup,

mm/ksm.c

844

struct ksm_stable_node *chain = alloc_stable_node();

mm/ksm.c

874

static inline void free_stable_node_chain(struct ksm_stable_node *chain,

mm/ksm.c

882

static void remove_node_from_stable_tree(struct ksm_stable_node *stable_node)

mm/ksm.c

949

static struct folio *ksm_get_folio(struct ksm_stable_node *stable_node,