swap.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568
  1. /*
  2. * linux/mm/swap.c
  3. *
  4. * Copyright (C) 1991, 1992, 1993, 1994 Linus Torvalds
  5. */
  6. /*
  7. * This file contains the default values for the operation of the
  8. * Linux VM subsystem. Fine-tuning documentation can be found in
  9. * Documentation/sysctl/vm.txt.
  10. * Started 18.12.91
  11. * Swap aging added 23.2.95, Stephen Tweedie.
  12. * Buffermem limits added 12.3.98, Rik van Riel.
  13. */
  14. #include <linux/mm.h>
  15. #include <linux/sched.h>
  16. #include <linux/kernel_stat.h>
  17. #include <linux/swap.h>
  18. #include <linux/mman.h>
  19. #include <linux/pagemap.h>
  20. #include <linux/pagevec.h>
  21. #include <linux/init.h>
  22. #include <linux/module.h>
  23. #include <linux/mm_inline.h>
  24. #include <linux/buffer_head.h> /* for try_to_release_page() */
  25. #include <linux/percpu_counter.h>
  26. #include <linux/percpu.h>
  27. #include <linux/cpu.h>
  28. #include <linux/notifier.h>
  29. #include <linux/backing-dev.h>
  30. #include <linux/memcontrol.h>
  31. /* How many pages do we try to swap or page in/out together? */
  32. int page_cluster;
  33. static DEFINE_PER_CPU(struct pagevec, lru_add_pvecs) = { 0, };
  34. static DEFINE_PER_CPU(struct pagevec, lru_add_active_pvecs) = { 0, };
  35. static DEFINE_PER_CPU(struct pagevec, lru_rotate_pvecs) = { 0, };
  36. /*
  37. * This path almost never happens for VM activity - pages are normally
  38. * freed via pagevecs. But it gets used by networking.
  39. */
  40. static void __page_cache_release(struct page *page)
  41. {
  42. if (PageLRU(page)) {
  43. unsigned long flags;
  44. struct zone *zone = page_zone(page);
  45. spin_lock_irqsave(&zone->lru_lock, flags);
  46. VM_BUG_ON(!PageLRU(page));
  47. __ClearPageLRU(page);
  48. del_page_from_lru(zone, page);
  49. spin_unlock_irqrestore(&zone->lru_lock, flags);
  50. }
  51. free_hot_page(page);
  52. }
  53. static void put_compound_page(struct page *page)
  54. {
  55. page = compound_head(page);
  56. if (put_page_testzero(page)) {
  57. compound_page_dtor *dtor;
  58. dtor = get_compound_page_dtor(page);
  59. (*dtor)(page);
  60. }
  61. }
  62. void put_page(struct page *page)
  63. {
  64. if (unlikely(PageCompound(page)))
  65. put_compound_page(page);
  66. else if (put_page_testzero(page))
  67. __page_cache_release(page);
  68. }
  69. EXPORT_SYMBOL(put_page);
  70. /**
  71. * put_pages_list() - release a list of pages
  72. * @pages: list of pages threaded on page->lru
  73. *
  74. * Release a list of pages which are strung together on page.lru. Currently
  75. * used by read_cache_pages() and related error recovery code.
  76. */
  77. void put_pages_list(struct list_head *pages)
  78. {
  79. while (!list_empty(pages)) {
  80. struct page *victim;
  81. victim = list_entry(pages->prev, struct page, lru);
  82. list_del(&victim->lru);
  83. page_cache_release(victim);
  84. }
  85. }
  86. EXPORT_SYMBOL(put_pages_list);
  87. /*
  88. * pagevec_move_tail() must be called with IRQ disabled.
  89. * Otherwise this may cause nasty races.
  90. */
  91. static void pagevec_move_tail(struct pagevec *pvec)
  92. {
  93. int i;
  94. int pgmoved = 0;
  95. struct zone *zone = NULL;
  96. for (i = 0; i < pagevec_count(pvec); i++) {
  97. struct page *page = pvec->pages[i];
  98. struct zone *pagezone = page_zone(page);
  99. if (pagezone != zone) {
  100. if (zone)
  101. spin_unlock(&zone->lru_lock);
  102. zone = pagezone;
  103. spin_lock(&zone->lru_lock);
  104. }
  105. if (PageLRU(page) && !PageActive(page)) {
  106. list_move_tail(&page->lru, &zone->inactive_list);
  107. pgmoved++;
  108. }
  109. }
  110. if (zone)
  111. spin_unlock(&zone->lru_lock);
  112. __count_vm_events(PGROTATED, pgmoved);
  113. release_pages(pvec->pages, pvec->nr, pvec->cold);
  114. pagevec_reinit(pvec);
  115. }
  116. /*
  117. * Writeback is about to end against a page which has been marked for immediate
  118. * reclaim. If it still appears to be reclaimable, move it to the tail of the
  119. * inactive list.
  120. *
  121. * Returns zero if it cleared PG_writeback.
  122. */
  123. int rotate_reclaimable_page(struct page *page)
  124. {
  125. struct pagevec *pvec;
  126. unsigned long flags;
  127. if (PageLocked(page))
  128. return 1;
  129. if (PageDirty(page))
  130. return 1;
  131. if (PageActive(page))
  132. return 1;
  133. if (!PageLRU(page))
  134. return 1;
  135. page_cache_get(page);
  136. local_irq_save(flags);
  137. pvec = &__get_cpu_var(lru_rotate_pvecs);
  138. if (!pagevec_add(pvec, page))
  139. pagevec_move_tail(pvec);
  140. local_irq_restore(flags);
  141. if (!test_clear_page_writeback(page))
  142. BUG();
  143. return 0;
  144. }
  145. /*
  146. * FIXME: speed this up?
  147. */
  148. void activate_page(struct page *page)
  149. {
  150. struct zone *zone = page_zone(page);
  151. spin_lock_irq(&zone->lru_lock);
  152. if (PageLRU(page) && !PageActive(page)) {
  153. del_page_from_inactive_list(zone, page);
  154. SetPageActive(page);
  155. add_page_to_active_list(zone, page);
  156. __count_vm_event(PGACTIVATE);
  157. mem_cgroup_move_lists(page, true);
  158. }
  159. spin_unlock_irq(&zone->lru_lock);
  160. }
  161. /*
  162. * Mark a page as having seen activity.
  163. *
  164. * inactive,unreferenced -> inactive,referenced
  165. * inactive,referenced -> active,unreferenced
  166. * active,unreferenced -> active,referenced
  167. */
  168. void mark_page_accessed(struct page *page)
  169. {
  170. if (!PageActive(page) && PageReferenced(page) && PageLRU(page)) {
  171. activate_page(page);
  172. ClearPageReferenced(page);
  173. } else if (!PageReferenced(page)) {
  174. SetPageReferenced(page);
  175. }
  176. }
  177. EXPORT_SYMBOL(mark_page_accessed);
  178. /**
  179. * lru_cache_add: add a page to the page lists
  180. * @page: the page to add
  181. */
  182. void lru_cache_add(struct page *page)
  183. {
  184. struct pagevec *pvec = &get_cpu_var(lru_add_pvecs);
  185. page_cache_get(page);
  186. if (!pagevec_add(pvec, page))
  187. __pagevec_lru_add(pvec);
  188. put_cpu_var(lru_add_pvecs);
  189. }
  190. void lru_cache_add_active(struct page *page)
  191. {
  192. struct pagevec *pvec = &get_cpu_var(lru_add_active_pvecs);
  193. page_cache_get(page);
  194. if (!pagevec_add(pvec, page))
  195. __pagevec_lru_add_active(pvec);
  196. put_cpu_var(lru_add_active_pvecs);
  197. }
  198. /*
  199. * Drain pages out of the cpu's pagevecs.
  200. * Either "cpu" is the current CPU, and preemption has already been
  201. * disabled; or "cpu" is being hot-unplugged, and is already dead.
  202. */
  203. static void drain_cpu_pagevecs(int cpu)
  204. {
  205. struct pagevec *pvec;
  206. pvec = &per_cpu(lru_add_pvecs, cpu);
  207. if (pagevec_count(pvec))
  208. __pagevec_lru_add(pvec);
  209. pvec = &per_cpu(lru_add_active_pvecs, cpu);
  210. if (pagevec_count(pvec))
  211. __pagevec_lru_add_active(pvec);
  212. pvec = &per_cpu(lru_rotate_pvecs, cpu);
  213. if (pagevec_count(pvec)) {
  214. unsigned long flags;
  215. /* No harm done if a racing interrupt already did this */
  216. local_irq_save(flags);
  217. pagevec_move_tail(pvec);
  218. local_irq_restore(flags);
  219. }
  220. }
  221. void lru_add_drain(void)
  222. {
  223. drain_cpu_pagevecs(get_cpu());
  224. put_cpu();
  225. }
  226. #ifdef CONFIG_NUMA
  227. static void lru_add_drain_per_cpu(struct work_struct *dummy)
  228. {
  229. lru_add_drain();
  230. }
  231. /*
  232. * Returns 0 for success
  233. */
  234. int lru_add_drain_all(void)
  235. {
  236. return schedule_on_each_cpu(lru_add_drain_per_cpu);
  237. }
  238. #else
  239. /*
  240. * Returns 0 for success
  241. */
  242. int lru_add_drain_all(void)
  243. {
  244. lru_add_drain();
  245. return 0;
  246. }
  247. #endif
  248. /*
  249. * Batched page_cache_release(). Decrement the reference count on all the
  250. * passed pages. If it fell to zero then remove the page from the LRU and
  251. * free it.
  252. *
  253. * Avoid taking zone->lru_lock if possible, but if it is taken, retain it
  254. * for the remainder of the operation.
  255. *
  256. * The locking in this function is against shrink_cache(): we recheck the
  257. * page count inside the lock to see whether shrink_cache grabbed the page
  258. * via the LRU. If it did, give up: shrink_cache will free it.
  259. */
  260. void release_pages(struct page **pages, int nr, int cold)
  261. {
  262. int i;
  263. struct pagevec pages_to_free;
  264. struct zone *zone = NULL;
  265. unsigned long uninitialized_var(flags);
  266. pagevec_init(&pages_to_free, cold);
  267. for (i = 0; i < nr; i++) {
  268. struct page *page = pages[i];
  269. if (unlikely(PageCompound(page))) {
  270. if (zone) {
  271. spin_unlock_irqrestore(&zone->lru_lock, flags);
  272. zone = NULL;
  273. }
  274. put_compound_page(page);
  275. continue;
  276. }
  277. if (!put_page_testzero(page))
  278. continue;
  279. if (PageLRU(page)) {
  280. struct zone *pagezone = page_zone(page);
  281. if (pagezone != zone) {
  282. if (zone)
  283. spin_unlock_irqrestore(&zone->lru_lock,
  284. flags);
  285. zone = pagezone;
  286. spin_lock_irqsave(&zone->lru_lock, flags);
  287. }
  288. VM_BUG_ON(!PageLRU(page));
  289. __ClearPageLRU(page);
  290. del_page_from_lru(zone, page);
  291. }
  292. if (!pagevec_add(&pages_to_free, page)) {
  293. if (zone) {
  294. spin_unlock_irqrestore(&zone->lru_lock, flags);
  295. zone = NULL;
  296. }
  297. __pagevec_free(&pages_to_free);
  298. pagevec_reinit(&pages_to_free);
  299. }
  300. }
  301. if (zone)
  302. spin_unlock_irqrestore(&zone->lru_lock, flags);
  303. pagevec_free(&pages_to_free);
  304. }
  305. /*
  306. * The pages which we're about to release may be in the deferred lru-addition
  307. * queues. That would prevent them from really being freed right now. That's
  308. * OK from a correctness point of view but is inefficient - those pages may be
  309. * cache-warm and we want to give them back to the page allocator ASAP.
  310. *
  311. * So __pagevec_release() will drain those queues here. __pagevec_lru_add()
  312. * and __pagevec_lru_add_active() call release_pages() directly to avoid
  313. * mutual recursion.
  314. */
  315. void __pagevec_release(struct pagevec *pvec)
  316. {
  317. lru_add_drain();
  318. release_pages(pvec->pages, pagevec_count(pvec), pvec->cold);
  319. pagevec_reinit(pvec);
  320. }
  321. EXPORT_SYMBOL(__pagevec_release);
  322. /*
  323. * pagevec_release() for pages which are known to not be on the LRU
  324. *
  325. * This function reinitialises the caller's pagevec.
  326. */
  327. void __pagevec_release_nonlru(struct pagevec *pvec)
  328. {
  329. int i;
  330. struct pagevec pages_to_free;
  331. pagevec_init(&pages_to_free, pvec->cold);
  332. for (i = 0; i < pagevec_count(pvec); i++) {
  333. struct page *page = pvec->pages[i];
  334. VM_BUG_ON(PageLRU(page));
  335. if (put_page_testzero(page))
  336. pagevec_add(&pages_to_free, page);
  337. }
  338. pagevec_free(&pages_to_free);
  339. pagevec_reinit(pvec);
  340. }
  341. /*
  342. * Add the passed pages to the LRU, then drop the caller's refcount
  343. * on them. Reinitialises the caller's pagevec.
  344. */
  345. void __pagevec_lru_add(struct pagevec *pvec)
  346. {
  347. int i;
  348. struct zone *zone = NULL;
  349. for (i = 0; i < pagevec_count(pvec); i++) {
  350. struct page *page = pvec->pages[i];
  351. struct zone *pagezone = page_zone(page);
  352. if (pagezone != zone) {
  353. if (zone)
  354. spin_unlock_irq(&zone->lru_lock);
  355. zone = pagezone;
  356. spin_lock_irq(&zone->lru_lock);
  357. }
  358. VM_BUG_ON(PageLRU(page));
  359. SetPageLRU(page);
  360. add_page_to_inactive_list(zone, page);
  361. }
  362. if (zone)
  363. spin_unlock_irq(&zone->lru_lock);
  364. release_pages(pvec->pages, pvec->nr, pvec->cold);
  365. pagevec_reinit(pvec);
  366. }
  367. EXPORT_SYMBOL(__pagevec_lru_add);
  368. void __pagevec_lru_add_active(struct pagevec *pvec)
  369. {
  370. int i;
  371. struct zone *zone = NULL;
  372. for (i = 0; i < pagevec_count(pvec); i++) {
  373. struct page *page = pvec->pages[i];
  374. struct zone *pagezone = page_zone(page);
  375. if (pagezone != zone) {
  376. if (zone)
  377. spin_unlock_irq(&zone->lru_lock);
  378. zone = pagezone;
  379. spin_lock_irq(&zone->lru_lock);
  380. }
  381. VM_BUG_ON(PageLRU(page));
  382. SetPageLRU(page);
  383. VM_BUG_ON(PageActive(page));
  384. SetPageActive(page);
  385. add_page_to_active_list(zone, page);
  386. }
  387. if (zone)
  388. spin_unlock_irq(&zone->lru_lock);
  389. release_pages(pvec->pages, pvec->nr, pvec->cold);
  390. pagevec_reinit(pvec);
  391. }
  392. /*
  393. * Try to drop buffers from the pages in a pagevec
  394. */
  395. void pagevec_strip(struct pagevec *pvec)
  396. {
  397. int i;
  398. for (i = 0; i < pagevec_count(pvec); i++) {
  399. struct page *page = pvec->pages[i];
  400. if (PagePrivate(page) && !TestSetPageLocked(page)) {
  401. if (PagePrivate(page))
  402. try_to_release_page(page, 0);
  403. unlock_page(page);
  404. }
  405. }
  406. }
  407. /**
  408. * pagevec_lookup - gang pagecache lookup
  409. * @pvec: Where the resulting pages are placed
  410. * @mapping: The address_space to search
  411. * @start: The starting page index
  412. * @nr_pages: The maximum number of pages
  413. *
  414. * pagevec_lookup() will search for and return a group of up to @nr_pages pages
  415. * in the mapping. The pages are placed in @pvec. pagevec_lookup() takes a
  416. * reference against the pages in @pvec.
  417. *
  418. * The search returns a group of mapping-contiguous pages with ascending
  419. * indexes. There may be holes in the indices due to not-present pages.
  420. *
  421. * pagevec_lookup() returns the number of pages which were found.
  422. */
  423. unsigned pagevec_lookup(struct pagevec *pvec, struct address_space *mapping,
  424. pgoff_t start, unsigned nr_pages)
  425. {
  426. pvec->nr = find_get_pages(mapping, start, nr_pages, pvec->pages);
  427. return pagevec_count(pvec);
  428. }
  429. EXPORT_SYMBOL(pagevec_lookup);
  430. unsigned pagevec_lookup_tag(struct pagevec *pvec, struct address_space *mapping,
  431. pgoff_t *index, int tag, unsigned nr_pages)
  432. {
  433. pvec->nr = find_get_pages_tag(mapping, index, tag,
  434. nr_pages, pvec->pages);
  435. return pagevec_count(pvec);
  436. }
  437. EXPORT_SYMBOL(pagevec_lookup_tag);
  438. #ifdef CONFIG_SMP
  439. /*
  440. * We tolerate a little inaccuracy to avoid ping-ponging the counter between
  441. * CPUs
  442. */
  443. #define ACCT_THRESHOLD max(16, NR_CPUS * 2)
  444. static DEFINE_PER_CPU(long, committed_space) = 0;
  445. void vm_acct_memory(long pages)
  446. {
  447. long *local;
  448. preempt_disable();
  449. local = &__get_cpu_var(committed_space);
  450. *local += pages;
  451. if (*local > ACCT_THRESHOLD || *local < -ACCT_THRESHOLD) {
  452. atomic_add(*local, &vm_committed_space);
  453. *local = 0;
  454. }
  455. preempt_enable();
  456. }
  457. #ifdef CONFIG_HOTPLUG_CPU
  458. /* Drop the CPU's cached committed space back into the central pool. */
  459. static int cpu_swap_callback(struct notifier_block *nfb,
  460. unsigned long action,
  461. void *hcpu)
  462. {
  463. long *committed;
  464. committed = &per_cpu(committed_space, (long)hcpu);
  465. if (action == CPU_DEAD || action == CPU_DEAD_FROZEN) {
  466. atomic_add(*committed, &vm_committed_space);
  467. *committed = 0;
  468. drain_cpu_pagevecs((long)hcpu);
  469. }
  470. return NOTIFY_OK;
  471. }
  472. #endif /* CONFIG_HOTPLUG_CPU */
  473. #endif /* CONFIG_SMP */
  474. /*
  475. * Perform any setup for the swap system
  476. */
  477. void __init swap_setup(void)
  478. {
  479. unsigned long megs = num_physpages >> (20 - PAGE_SHIFT);
  480. #ifdef CONFIG_SWAP
  481. bdi_init(swapper_space.backing_dev_info);
  482. #endif
  483. /* Use a smaller cluster for small-memory machines */
  484. if (megs < 16)
  485. page_cluster = 2;
  486. else
  487. page_cluster = 3;
  488. /*
  489. * Right now other parts of the system means that we
  490. * _really_ don't want to cluster much more
  491. */
  492. #ifdef CONFIG_HOTPLUG_CPU
  493. hotcpu_notifier(cpu_swap_callback, 0);
  494. #endif
  495. }