quicklist.c 2.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103
  1. /*
  2. * Quicklist support.
  3. *
  4. * Quicklists are light weight lists of pages that have a defined state
  5. * on alloc and free. Pages must be in the quicklist specific defined state
  6. * (zero by default) when the page is freed. It seems that the initial idea
  7. * for such lists first came from Dave Miller and then various other people
  8. * improved on it.
  9. *
  10. * Copyright (C) 2007 SGI,
  11. * Christoph Lameter <cl@linux.com>
  12. * Generalized, added support for multiple lists and
  13. * constructors / destructors.
  14. */
  15. #include <linux/kernel.h>
  16. #include <linux/gfp.h>
  17. #include <linux/mm.h>
  18. #include <linux/mmzone.h>
  19. #include <linux/quicklist.h>
  20. DEFINE_PER_CPU(struct quicklist [CONFIG_NR_QUICK], quicklist);
  21. #define FRACTION_OF_NODE_MEM 16
  22. static unsigned long max_pages(unsigned long min_pages)
  23. {
  24. unsigned long node_free_pages, max;
  25. int node = numa_node_id();
  26. struct zone *zones = NODE_DATA(node)->node_zones;
  27. int num_cpus_on_node;
  28. node_free_pages =
  29. #ifdef CONFIG_ZONE_DMA
  30. zone_page_state(&zones[ZONE_DMA], NR_FREE_PAGES) +
  31. #endif
  32. #ifdef CONFIG_ZONE_DMA32
  33. zone_page_state(&zones[ZONE_DMA32], NR_FREE_PAGES) +
  34. #endif
  35. zone_page_state(&zones[ZONE_NORMAL], NR_FREE_PAGES);
  36. max = node_free_pages / FRACTION_OF_NODE_MEM;
  37. num_cpus_on_node = cpumask_weight(cpumask_of_node(node));
  38. max /= num_cpus_on_node;
  39. return max(max, min_pages);
  40. }
  41. static long min_pages_to_free(struct quicklist *q,
  42. unsigned long min_pages, long max_free)
  43. {
  44. long pages_to_free;
  45. pages_to_free = q->nr_pages - max_pages(min_pages);
  46. return min(pages_to_free, max_free);
  47. }
  48. /*
  49. * Trim down the number of pages in the quicklist
  50. */
  51. void quicklist_trim(int nr, void (*dtor)(void *),
  52. unsigned long min_pages, unsigned long max_free)
  53. {
  54. long pages_to_free;
  55. struct quicklist *q;
  56. q = &get_cpu_var(quicklist)[nr];
  57. if (q->nr_pages > min_pages) {
  58. pages_to_free = min_pages_to_free(q, min_pages, max_free);
  59. while (pages_to_free > 0) {
  60. /*
  61. * We pass a gfp_t of 0 to quicklist_alloc here
  62. * because we will never call into the page allocator.
  63. */
  64. void *p = quicklist_alloc(nr, 0, NULL);
  65. if (dtor)
  66. dtor(p);
  67. free_page((unsigned long)p);
  68. pages_to_free--;
  69. }
  70. }
  71. put_cpu_var(quicklist);
  72. }
  73. unsigned long quicklist_total_size(void)
  74. {
  75. unsigned long count = 0;
  76. int cpu;
  77. struct quicklist *ql, *q;
  78. for_each_online_cpu(cpu) {
  79. ql = per_cpu(quicklist, cpu);
  80. for (q = ql; q < ql + CONFIG_NR_QUICK; q++)
  81. count += q->nr_pages;
  82. }
  83. return count;
  84. }