aboutsummaryrefslogtreecommitdiffstats
path: root/include/linux
diff options
context:
space:
mode:
Diffstat (limited to 'include/linux')
-rw-r--r--include/linux/list_lru.h13
1 files changed, 2 insertions, 11 deletions
diff --git a/include/linux/list_lru.h b/include/linux/list_lru.h
index 4d02ad3badab..3ce541753c88 100644
--- a/include/linux/list_lru.h
+++ b/include/linux/list_lru.h
@@ -27,20 +27,11 @@ struct list_lru_node {
27} ____cacheline_aligned_in_smp; 27} ____cacheline_aligned_in_smp;
28 28
29struct list_lru { 29struct list_lru {
30 /* 30 struct list_lru_node *node;
31 * Because we use a fixed-size array, this struct can be very big if
32 * MAX_NUMNODES is big. If this becomes a problem this is fixable by
33 * turning this into a pointer and dynamically allocating this to
34 * nr_node_ids. This quantity is firwmare-provided, and still would
35 * provide room for all nodes at the cost of a pointer lookup and an
36 * extra allocation. Because that allocation will most likely come from
37 * a different slab cache than the main structure holding this
38 * structure, we may very well fail.
39 */
40 struct list_lru_node node[MAX_NUMNODES];
41 nodemask_t active_nodes; 31 nodemask_t active_nodes;
42}; 32};
43 33
34void list_lru_destroy(struct list_lru *lru);
44int list_lru_init(struct list_lru *lru); 35int list_lru_init(struct list_lru *lru);
45 36
46/** 37/**