ttm_tt.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585
  1. /**************************************************************************
  2. *
  3. * Copyright (c) 2006-2009 VMware, Inc., Palo Alto, CA., USA
  4. * All Rights Reserved.
  5. *
  6. * Permission is hereby granted, free of charge, to any person obtaining a
  7. * copy of this software and associated documentation files (the
  8. * "Software"), to deal in the Software without restriction, including
  9. * without limitation the rights to use, copy, modify, merge, publish,
  10. * distribute, sub license, and/or sell copies of the Software, and to
  11. * permit persons to whom the Software is furnished to do so, subject to
  12. * the following conditions:
  13. *
  14. * The above copyright notice and this permission notice (including the
  15. * next paragraph) shall be included in all copies or substantial portions
  16. * of the Software.
  17. *
  18. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  19. * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  20. * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL
  21. * THE COPYRIGHT HOLDERS, AUTHORS AND/OR ITS SUPPLIERS BE LIABLE FOR ANY CLAIM,
  22. * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
  23. * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
  24. * USE OR OTHER DEALINGS IN THE SOFTWARE.
  25. *
  26. **************************************************************************/
  27. /*
  28. * Authors: Thomas Hellstrom <thellstrom-at-vmware-dot-com>
  29. */
  30. #include <linux/vmalloc.h>
  31. #include <linux/sched.h>
  32. #include <linux/highmem.h>
  33. #include <linux/pagemap.h>
  34. #include <linux/file.h>
  35. #include <linux/swap.h>
  36. #include "drm_cache.h"
  37. #include "ttm/ttm_module.h"
  38. #include "ttm/ttm_bo_driver.h"
  39. #include "ttm/ttm_placement.h"
  40. static int ttm_tt_swapin(struct ttm_tt *ttm);
  41. /**
  42. * Allocates storage for pointers to the pages that back the ttm.
  43. *
  44. * Uses kmalloc if possible. Otherwise falls back to vmalloc.
  45. */
  46. static void ttm_tt_alloc_page_directory(struct ttm_tt *ttm)
  47. {
  48. unsigned long size = ttm->num_pages * sizeof(*ttm->pages);
  49. ttm->pages = NULL;
  50. if (size <= PAGE_SIZE)
  51. ttm->pages = kzalloc(size, GFP_KERNEL);
  52. if (!ttm->pages) {
  53. ttm->pages = vmalloc_user(size);
  54. if (ttm->pages)
  55. ttm->page_flags |= TTM_PAGE_FLAG_VMALLOC;
  56. }
  57. }
  58. static void ttm_tt_free_page_directory(struct ttm_tt *ttm)
  59. {
  60. if (ttm->page_flags & TTM_PAGE_FLAG_VMALLOC) {
  61. vfree(ttm->pages);
  62. ttm->page_flags &= ~TTM_PAGE_FLAG_VMALLOC;
  63. } else {
  64. kfree(ttm->pages);
  65. }
  66. ttm->pages = NULL;
  67. }
  68. static struct page *ttm_tt_alloc_page(unsigned page_flags)
  69. {
  70. gfp_t gfp_flags = GFP_USER;
  71. if (page_flags & TTM_PAGE_FLAG_ZERO_ALLOC)
  72. gfp_flags |= __GFP_ZERO;
  73. if (page_flags & TTM_PAGE_FLAG_DMA32)
  74. gfp_flags |= __GFP_DMA32;
  75. else
  76. gfp_flags |= __GFP_HIGHMEM;
  77. return alloc_page(gfp_flags);
  78. }
  79. static void ttm_tt_free_user_pages(struct ttm_tt *ttm)
  80. {
  81. int write;
  82. int dirty;
  83. struct page *page;
  84. int i;
  85. struct ttm_backend *be = ttm->be;
  86. BUG_ON(!(ttm->page_flags & TTM_PAGE_FLAG_USER));
  87. write = ((ttm->page_flags & TTM_PAGE_FLAG_WRITE) != 0);
  88. dirty = ((ttm->page_flags & TTM_PAGE_FLAG_USER_DIRTY) != 0);
  89. if (be)
  90. be->func->clear(be);
  91. for (i = 0; i < ttm->num_pages; ++i) {
  92. page = ttm->pages[i];
  93. if (page == NULL)
  94. continue;
  95. if (page == ttm->dummy_read_page) {
  96. BUG_ON(write);
  97. continue;
  98. }
  99. if (write && dirty && !PageReserved(page))
  100. set_page_dirty_lock(page);
  101. ttm->pages[i] = NULL;
  102. ttm_mem_global_free(ttm->glob->mem_glob, PAGE_SIZE);
  103. put_page(page);
  104. }
  105. ttm->state = tt_unpopulated;
  106. ttm->first_himem_page = ttm->num_pages;
  107. ttm->last_lomem_page = -1;
  108. }
  109. static struct page *__ttm_tt_get_page(struct ttm_tt *ttm, int index)
  110. {
  111. struct page *p;
  112. struct ttm_mem_global *mem_glob = ttm->glob->mem_glob;
  113. int ret;
  114. while (NULL == (p = ttm->pages[index])) {
  115. p = ttm_tt_alloc_page(ttm->page_flags);
  116. if (!p)
  117. return NULL;
  118. ret = ttm_mem_global_alloc_page(mem_glob, p, false, false);
  119. if (unlikely(ret != 0))
  120. goto out_err;
  121. if (PageHighMem(p))
  122. ttm->pages[--ttm->first_himem_page] = p;
  123. else
  124. ttm->pages[++ttm->last_lomem_page] = p;
  125. }
  126. return p;
  127. out_err:
  128. put_page(p);
  129. return NULL;
  130. }
  131. struct page *ttm_tt_get_page(struct ttm_tt *ttm, int index)
  132. {
  133. int ret;
  134. if (unlikely(ttm->page_flags & TTM_PAGE_FLAG_SWAPPED)) {
  135. ret = ttm_tt_swapin(ttm);
  136. if (unlikely(ret != 0))
  137. return NULL;
  138. }
  139. return __ttm_tt_get_page(ttm, index);
  140. }
  141. int ttm_tt_populate(struct ttm_tt *ttm)
  142. {
  143. struct page *page;
  144. unsigned long i;
  145. struct ttm_backend *be;
  146. int ret;
  147. if (ttm->state != tt_unpopulated)
  148. return 0;
  149. if (unlikely(ttm->page_flags & TTM_PAGE_FLAG_SWAPPED)) {
  150. ret = ttm_tt_swapin(ttm);
  151. if (unlikely(ret != 0))
  152. return ret;
  153. }
  154. be = ttm->be;
  155. for (i = 0; i < ttm->num_pages; ++i) {
  156. page = __ttm_tt_get_page(ttm, i);
  157. if (!page)
  158. return -ENOMEM;
  159. }
  160. be->func->populate(be, ttm->num_pages, ttm->pages,
  161. ttm->dummy_read_page);
  162. ttm->state = tt_unbound;
  163. return 0;
  164. }
  165. #ifdef CONFIG_X86
  166. static inline int ttm_tt_set_page_caching(struct page *p,
  167. enum ttm_caching_state c_state)
  168. {
  169. if (PageHighMem(p))
  170. return 0;
  171. switch (c_state) {
  172. case tt_cached:
  173. return set_pages_wb(p, 1);
  174. case tt_wc:
  175. return set_memory_wc((unsigned long) page_address(p), 1);
  176. default:
  177. return set_pages_uc(p, 1);
  178. }
  179. }
  180. #else /* CONFIG_X86 */
  181. static inline int ttm_tt_set_page_caching(struct page *p,
  182. enum ttm_caching_state c_state)
  183. {
  184. return 0;
  185. }
  186. #endif /* CONFIG_X86 */
  187. /*
  188. * Change caching policy for the linear kernel map
  189. * for range of pages in a ttm.
  190. */
  191. static int ttm_tt_set_caching(struct ttm_tt *ttm,
  192. enum ttm_caching_state c_state)
  193. {
  194. int i, j;
  195. struct page *cur_page;
  196. int ret;
  197. if (ttm->caching_state == c_state)
  198. return 0;
  199. if (c_state != tt_cached) {
  200. ret = ttm_tt_populate(ttm);
  201. if (unlikely(ret != 0))
  202. return ret;
  203. }
  204. if (ttm->caching_state == tt_cached)
  205. drm_clflush_pages(ttm->pages, ttm->num_pages);
  206. for (i = 0; i < ttm->num_pages; ++i) {
  207. cur_page = ttm->pages[i];
  208. if (likely(cur_page != NULL)) {
  209. ret = ttm_tt_set_page_caching(cur_page, c_state);
  210. if (unlikely(ret != 0))
  211. goto out_err;
  212. }
  213. }
  214. ttm->caching_state = c_state;
  215. return 0;
  216. out_err:
  217. for (j = 0; j < i; ++j) {
  218. cur_page = ttm->pages[j];
  219. if (likely(cur_page != NULL)) {
  220. (void)ttm_tt_set_page_caching(cur_page,
  221. ttm->caching_state);
  222. }
  223. }
  224. return ret;
  225. }
  226. int ttm_tt_set_placement_caching(struct ttm_tt *ttm, uint32_t placement)
  227. {
  228. enum ttm_caching_state state;
  229. if (placement & TTM_PL_FLAG_WC)
  230. state = tt_wc;
  231. else if (placement & TTM_PL_FLAG_UNCACHED)
  232. state = tt_uncached;
  233. else
  234. state = tt_cached;
  235. return ttm_tt_set_caching(ttm, state);
  236. }
  237. EXPORT_SYMBOL(ttm_tt_set_placement_caching);
  238. static void ttm_tt_free_alloced_pages(struct ttm_tt *ttm)
  239. {
  240. int i;
  241. struct page *cur_page;
  242. struct ttm_backend *be = ttm->be;
  243. if (be)
  244. be->func->clear(be);
  245. (void)ttm_tt_set_caching(ttm, tt_cached);
  246. for (i = 0; i < ttm->num_pages; ++i) {
  247. cur_page = ttm->pages[i];
  248. ttm->pages[i] = NULL;
  249. if (cur_page) {
  250. if (page_count(cur_page) != 1)
  251. printk(KERN_ERR TTM_PFX
  252. "Erroneous page count. "
  253. "Leaking pages.\n");
  254. ttm_mem_global_free_page(ttm->glob->mem_glob,
  255. cur_page);
  256. __free_page(cur_page);
  257. }
  258. }
  259. ttm->state = tt_unpopulated;
  260. ttm->first_himem_page = ttm->num_pages;
  261. ttm->last_lomem_page = -1;
  262. }
  263. void ttm_tt_destroy(struct ttm_tt *ttm)
  264. {
  265. struct ttm_backend *be;
  266. if (unlikely(ttm == NULL))
  267. return;
  268. be = ttm->be;
  269. if (likely(be != NULL)) {
  270. be->func->destroy(be);
  271. ttm->be = NULL;
  272. }
  273. if (likely(ttm->pages != NULL)) {
  274. if (ttm->page_flags & TTM_PAGE_FLAG_USER)
  275. ttm_tt_free_user_pages(ttm);
  276. else
  277. ttm_tt_free_alloced_pages(ttm);
  278. ttm_tt_free_page_directory(ttm);
  279. }
  280. if (!(ttm->page_flags & TTM_PAGE_FLAG_PERSISTANT_SWAP) &&
  281. ttm->swap_storage)
  282. fput(ttm->swap_storage);
  283. kfree(ttm);
  284. }
  285. int ttm_tt_set_user(struct ttm_tt *ttm,
  286. struct task_struct *tsk,
  287. unsigned long start, unsigned long num_pages)
  288. {
  289. struct mm_struct *mm = tsk->mm;
  290. int ret;
  291. int write = (ttm->page_flags & TTM_PAGE_FLAG_WRITE) != 0;
  292. struct ttm_mem_global *mem_glob = ttm->glob->mem_glob;
  293. BUG_ON(num_pages != ttm->num_pages);
  294. BUG_ON((ttm->page_flags & TTM_PAGE_FLAG_USER) == 0);
  295. /**
  296. * Account user pages as lowmem pages for now.
  297. */
  298. ret = ttm_mem_global_alloc(mem_glob, num_pages * PAGE_SIZE,
  299. false, false);
  300. if (unlikely(ret != 0))
  301. return ret;
  302. down_read(&mm->mmap_sem);
  303. ret = get_user_pages(tsk, mm, start, num_pages,
  304. write, 0, ttm->pages, NULL);
  305. up_read(&mm->mmap_sem);
  306. if (ret != num_pages && write) {
  307. ttm_tt_free_user_pages(ttm);
  308. ttm_mem_global_free(mem_glob, num_pages * PAGE_SIZE);
  309. return -ENOMEM;
  310. }
  311. ttm->tsk = tsk;
  312. ttm->start = start;
  313. ttm->state = tt_unbound;
  314. return 0;
  315. }
  316. struct ttm_tt *ttm_tt_create(struct ttm_bo_device *bdev, unsigned long size,
  317. uint32_t page_flags, struct page *dummy_read_page)
  318. {
  319. struct ttm_bo_driver *bo_driver = bdev->driver;
  320. struct ttm_tt *ttm;
  321. if (!bo_driver)
  322. return NULL;
  323. ttm = kzalloc(sizeof(*ttm), GFP_KERNEL);
  324. if (!ttm)
  325. return NULL;
  326. ttm->glob = bdev->glob;
  327. ttm->num_pages = (size + PAGE_SIZE - 1) >> PAGE_SHIFT;
  328. ttm->first_himem_page = ttm->num_pages;
  329. ttm->last_lomem_page = -1;
  330. ttm->caching_state = tt_cached;
  331. ttm->page_flags = page_flags;
  332. ttm->dummy_read_page = dummy_read_page;
  333. ttm_tt_alloc_page_directory(ttm);
  334. if (!ttm->pages) {
  335. ttm_tt_destroy(ttm);
  336. printk(KERN_ERR TTM_PFX "Failed allocating page table\n");
  337. return NULL;
  338. }
  339. ttm->be = bo_driver->create_ttm_backend_entry(bdev);
  340. if (!ttm->be) {
  341. ttm_tt_destroy(ttm);
  342. printk(KERN_ERR TTM_PFX "Failed creating ttm backend entry\n");
  343. return NULL;
  344. }
  345. ttm->state = tt_unpopulated;
  346. return ttm;
  347. }
  348. void ttm_tt_unbind(struct ttm_tt *ttm)
  349. {
  350. int ret;
  351. struct ttm_backend *be = ttm->be;
  352. if (ttm->state == tt_bound) {
  353. ret = be->func->unbind(be);
  354. BUG_ON(ret);
  355. ttm->state = tt_unbound;
  356. }
  357. }
  358. int ttm_tt_bind(struct ttm_tt *ttm, struct ttm_mem_reg *bo_mem)
  359. {
  360. int ret = 0;
  361. struct ttm_backend *be;
  362. if (!ttm)
  363. return -EINVAL;
  364. if (ttm->state == tt_bound)
  365. return 0;
  366. be = ttm->be;
  367. ret = ttm_tt_populate(ttm);
  368. if (ret)
  369. return ret;
  370. ret = be->func->bind(be, bo_mem);
  371. if (ret) {
  372. printk(KERN_ERR TTM_PFX "Couldn't bind backend.\n");
  373. return ret;
  374. }
  375. ttm->state = tt_bound;
  376. if (ttm->page_flags & TTM_PAGE_FLAG_USER)
  377. ttm->page_flags |= TTM_PAGE_FLAG_USER_DIRTY;
  378. return 0;
  379. }
  380. EXPORT_SYMBOL(ttm_tt_bind);
  381. static int ttm_tt_swapin(struct ttm_tt *ttm)
  382. {
  383. struct address_space *swap_space;
  384. struct file *swap_storage;
  385. struct page *from_page;
  386. struct page *to_page;
  387. void *from_virtual;
  388. void *to_virtual;
  389. int i;
  390. int ret;
  391. if (ttm->page_flags & TTM_PAGE_FLAG_USER) {
  392. ret = ttm_tt_set_user(ttm, ttm->tsk, ttm->start,
  393. ttm->num_pages);
  394. if (unlikely(ret != 0))
  395. return ret;
  396. ttm->page_flags &= ~TTM_PAGE_FLAG_SWAPPED;
  397. return 0;
  398. }
  399. swap_storage = ttm->swap_storage;
  400. BUG_ON(swap_storage == NULL);
  401. swap_space = swap_storage->f_path.dentry->d_inode->i_mapping;
  402. for (i = 0; i < ttm->num_pages; ++i) {
  403. from_page = read_mapping_page(swap_space, i, NULL);
  404. if (IS_ERR(from_page))
  405. goto out_err;
  406. to_page = __ttm_tt_get_page(ttm, i);
  407. if (unlikely(to_page == NULL))
  408. goto out_err;
  409. preempt_disable();
  410. from_virtual = kmap_atomic(from_page, KM_USER0);
  411. to_virtual = kmap_atomic(to_page, KM_USER1);
  412. memcpy(to_virtual, from_virtual, PAGE_SIZE);
  413. kunmap_atomic(to_virtual, KM_USER1);
  414. kunmap_atomic(from_virtual, KM_USER0);
  415. preempt_enable();
  416. page_cache_release(from_page);
  417. }
  418. if (!(ttm->page_flags & TTM_PAGE_FLAG_PERSISTANT_SWAP))
  419. fput(swap_storage);
  420. ttm->swap_storage = NULL;
  421. ttm->page_flags &= ~TTM_PAGE_FLAG_SWAPPED;
  422. return 0;
  423. out_err:
  424. ttm_tt_free_alloced_pages(ttm);
  425. return -ENOMEM;
  426. }
  427. int ttm_tt_swapout(struct ttm_tt *ttm, struct file *persistant_swap_storage)
  428. {
  429. struct address_space *swap_space;
  430. struct file *swap_storage;
  431. struct page *from_page;
  432. struct page *to_page;
  433. void *from_virtual;
  434. void *to_virtual;
  435. int i;
  436. BUG_ON(ttm->state != tt_unbound && ttm->state != tt_unpopulated);
  437. BUG_ON(ttm->caching_state != tt_cached);
  438. /*
  439. * For user buffers, just unpin the pages, as there should be
  440. * vma references.
  441. */
  442. if (ttm->page_flags & TTM_PAGE_FLAG_USER) {
  443. ttm_tt_free_user_pages(ttm);
  444. ttm->page_flags |= TTM_PAGE_FLAG_SWAPPED;
  445. ttm->swap_storage = NULL;
  446. return 0;
  447. }
  448. if (!persistant_swap_storage) {
  449. swap_storage = shmem_file_setup("ttm swap",
  450. ttm->num_pages << PAGE_SHIFT,
  451. 0);
  452. if (unlikely(IS_ERR(swap_storage))) {
  453. printk(KERN_ERR "Failed allocating swap storage.\n");
  454. return -ENOMEM;
  455. }
  456. } else
  457. swap_storage = persistant_swap_storage;
  458. swap_space = swap_storage->f_path.dentry->d_inode->i_mapping;
  459. for (i = 0; i < ttm->num_pages; ++i) {
  460. from_page = ttm->pages[i];
  461. if (unlikely(from_page == NULL))
  462. continue;
  463. to_page = read_mapping_page(swap_space, i, NULL);
  464. if (unlikely(to_page == NULL))
  465. goto out_err;
  466. preempt_disable();
  467. from_virtual = kmap_atomic(from_page, KM_USER0);
  468. to_virtual = kmap_atomic(to_page, KM_USER1);
  469. memcpy(to_virtual, from_virtual, PAGE_SIZE);
  470. kunmap_atomic(to_virtual, KM_USER1);
  471. kunmap_atomic(from_virtual, KM_USER0);
  472. preempt_enable();
  473. set_page_dirty(to_page);
  474. mark_page_accessed(to_page);
  475. page_cache_release(to_page);
  476. }
  477. ttm_tt_free_alloced_pages(ttm);
  478. ttm->swap_storage = swap_storage;
  479. ttm->page_flags |= TTM_PAGE_FLAG_SWAPPED;
  480. if (persistant_swap_storage)
  481. ttm->page_flags |= TTM_PAGE_FLAG_PERSISTANT_SWAP;
  482. return 0;
  483. out_err:
  484. if (!persistant_swap_storage)
  485. fput(swap_storage);
  486. return -ENOMEM;
  487. }