Loading...
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
31#include <linux/sched.h>
32#include <linux/highmem.h>
33#include <linux/pagemap.h>
34#include <linux/shmem_fs.h>
35#include <linux/file.h>
36#include <linux/swap.h>
37#include <linux/slab.h>
38#include "drm_cache.h"
39#include "drm_mem_util.h"
40#include "ttm/ttm_module.h"
41#include "ttm/ttm_bo_driver.h"
42#include "ttm/ttm_placement.h"
43#include "ttm/ttm_page_alloc.h"
44
45static int ttm_tt_swapin(struct ttm_tt *ttm);
46
47/**
48 * Allocates storage for pointers to the pages that back the ttm.
49 */
50static void ttm_tt_alloc_page_directory(struct ttm_tt *ttm)
51{
52 ttm->pages = drm_calloc_large(ttm->num_pages, sizeof(*ttm->pages));
53 ttm->dma_address = drm_calloc_large(ttm->num_pages,
54 sizeof(*ttm->dma_address));
55}
56
57static void ttm_tt_free_page_directory(struct ttm_tt *ttm)
58{
59 drm_free_large(ttm->pages);
60 ttm->pages = NULL;
61 drm_free_large(ttm->dma_address);
62 ttm->dma_address = NULL;
63}
64
65static void ttm_tt_free_user_pages(struct ttm_tt *ttm)
66{
67 int write;
68 int dirty;
69 struct page *page;
70 int i;
71 struct ttm_backend *be = ttm->be;
72
73 BUG_ON(!(ttm->page_flags & TTM_PAGE_FLAG_USER));
74 write = ((ttm->page_flags & TTM_PAGE_FLAG_WRITE) != 0);
75 dirty = ((ttm->page_flags & TTM_PAGE_FLAG_USER_DIRTY) != 0);
76
77 if (be)
78 be->func->clear(be);
79
80 for (i = 0; i < ttm->num_pages; ++i) {
81 page = ttm->pages[i];
82 if (page == NULL)
83 continue;
84
85 if (page == ttm->dummy_read_page) {
86 BUG_ON(write);
87 continue;
88 }
89
90 if (write && dirty && !PageReserved(page))
91 set_page_dirty_lock(page);
92
93 ttm->pages[i] = NULL;
94 ttm_mem_global_free(ttm->glob->mem_glob, PAGE_SIZE);
95 put_page(page);
96 }
97 ttm->state = tt_unpopulated;
98 ttm->first_himem_page = ttm->num_pages;
99 ttm->last_lomem_page = -1;
100}
101
102static struct page *__ttm_tt_get_page(struct ttm_tt *ttm, int index)
103{
104 struct page *p;
105 struct list_head h;
106 struct ttm_mem_global *mem_glob = ttm->glob->mem_glob;
107 int ret;
108
109 while (NULL == (p = ttm->pages[index])) {
110
111 INIT_LIST_HEAD(&h);
112
113 ret = ttm_get_pages(&h, ttm->page_flags, ttm->caching_state, 1,
114 &ttm->dma_address[index]);
115
116 if (ret != 0)
117 return NULL;
118
119 p = list_first_entry(&h, struct page, lru);
120
121 ret = ttm_mem_global_alloc_page(mem_glob, p, false, false);
122 if (unlikely(ret != 0))
123 goto out_err;
124
125 if (PageHighMem(p))
126 ttm->pages[--ttm->first_himem_page] = p;
127 else
128 ttm->pages[++ttm->last_lomem_page] = p;
129 }
130 return p;
131out_err:
132 put_page(p);
133 return NULL;
134}
135
136struct page *ttm_tt_get_page(struct ttm_tt *ttm, int index)
137{
138 int ret;
139
140 if (unlikely(ttm->page_flags & TTM_PAGE_FLAG_SWAPPED)) {
141 ret = ttm_tt_swapin(ttm);
142 if (unlikely(ret != 0))
143 return NULL;
144 }
145 return __ttm_tt_get_page(ttm, index);
146}
147
148int ttm_tt_populate(struct ttm_tt *ttm)
149{
150 struct page *page;
151 unsigned long i;
152 struct ttm_backend *be;
153 int ret;
154
155 if (ttm->state != tt_unpopulated)
156 return 0;
157
158 if (unlikely(ttm->page_flags & TTM_PAGE_FLAG_SWAPPED)) {
159 ret = ttm_tt_swapin(ttm);
160 if (unlikely(ret != 0))
161 return ret;
162 }
163
164 be = ttm->be;
165
166 for (i = 0; i < ttm->num_pages; ++i) {
167 page = __ttm_tt_get_page(ttm, i);
168 if (!page)
169 return -ENOMEM;
170 }
171
172 be->func->populate(be, ttm->num_pages, ttm->pages,
173 ttm->dummy_read_page, ttm->dma_address);
174 ttm->state = tt_unbound;
175 return 0;
176}
177EXPORT_SYMBOL(ttm_tt_populate);
178
179#ifdef CONFIG_X86
180static inline int ttm_tt_set_page_caching(struct page *p,
181 enum ttm_caching_state c_old,
182 enum ttm_caching_state c_new)
183{
184 int ret = 0;
185
186 if (PageHighMem(p))
187 return 0;
188
189 if (c_old != tt_cached) {
190 /* p isn't in the default caching state, set it to
191 * writeback first to free its current memtype. */
192
193 ret = set_pages_wb(p, 1);
194 if (ret)
195 return ret;
196 }
197
198 if (c_new == tt_wc)
199 ret = set_memory_wc((unsigned long) page_address(p), 1);
200 else if (c_new == tt_uncached)
201 ret = set_pages_uc(p, 1);
202
203 return ret;
204}
205#else /* CONFIG_X86 */
206static inline int ttm_tt_set_page_caching(struct page *p,
207 enum ttm_caching_state c_old,
208 enum ttm_caching_state c_new)
209{
210 return 0;
211}
212#endif /* CONFIG_X86 */
213
214/*
215 * Change caching policy for the linear kernel map
216 * for range of pages in a ttm.
217 */
218
219static int ttm_tt_set_caching(struct ttm_tt *ttm,
220 enum ttm_caching_state c_state)
221{
222 int i, j;
223 struct page *cur_page;
224 int ret;
225
226 if (ttm->caching_state == c_state)
227 return 0;
228
229 if (ttm->state == tt_unpopulated) {
230 /* Change caching but don't populate */
231 ttm->caching_state = c_state;
232 return 0;
233 }
234
235 if (ttm->caching_state == tt_cached)
236 drm_clflush_pages(ttm->pages, ttm->num_pages);
237
238 for (i = 0; i < ttm->num_pages; ++i) {
239 cur_page = ttm->pages[i];
240 if (likely(cur_page != NULL)) {
241 ret = ttm_tt_set_page_caching(cur_page,
242 ttm->caching_state,
243 c_state);
244 if (unlikely(ret != 0))
245 goto out_err;
246 }
247 }
248
249 ttm->caching_state = c_state;
250
251 return 0;
252
253out_err:
254 for (j = 0; j < i; ++j) {
255 cur_page = ttm->pages[j];
256 if (likely(cur_page != NULL)) {
257 (void)ttm_tt_set_page_caching(cur_page, c_state,
258 ttm->caching_state);
259 }
260 }
261
262 return ret;
263}
264
265int ttm_tt_set_placement_caching(struct ttm_tt *ttm, uint32_t placement)
266{
267 enum ttm_caching_state state;
268
269 if (placement & TTM_PL_FLAG_WC)
270 state = tt_wc;
271 else if (placement & TTM_PL_FLAG_UNCACHED)
272 state = tt_uncached;
273 else
274 state = tt_cached;
275
276 return ttm_tt_set_caching(ttm, state);
277}
278EXPORT_SYMBOL(ttm_tt_set_placement_caching);
279
280static void ttm_tt_free_alloced_pages(struct ttm_tt *ttm)
281{
282 int i;
283 unsigned count = 0;
284 struct list_head h;
285 struct page *cur_page;
286 struct ttm_backend *be = ttm->be;
287
288 INIT_LIST_HEAD(&h);
289
290 if (be)
291 be->func->clear(be);
292 for (i = 0; i < ttm->num_pages; ++i) {
293
294 cur_page = ttm->pages[i];
295 ttm->pages[i] = NULL;
296 if (cur_page) {
297 if (page_count(cur_page) != 1)
298 printk(KERN_ERR TTM_PFX
299 "Erroneous page count. "
300 "Leaking pages.\n");
301 ttm_mem_global_free_page(ttm->glob->mem_glob,
302 cur_page);
303 list_add(&cur_page->lru, &h);
304 count++;
305 }
306 }
307 ttm_put_pages(&h, count, ttm->page_flags, ttm->caching_state,
308 ttm->dma_address);
309 ttm->state = tt_unpopulated;
310 ttm->first_himem_page = ttm->num_pages;
311 ttm->last_lomem_page = -1;
312}
313
314void ttm_tt_destroy(struct ttm_tt *ttm)
315{
316 struct ttm_backend *be;
317
318 if (unlikely(ttm == NULL))
319 return;
320
321 be = ttm->be;
322 if (likely(be != NULL)) {
323 be->func->destroy(be);
324 ttm->be = NULL;
325 }
326
327 if (likely(ttm->pages != NULL)) {
328 if (ttm->page_flags & TTM_PAGE_FLAG_USER)
329 ttm_tt_free_user_pages(ttm);
330 else
331 ttm_tt_free_alloced_pages(ttm);
332
333 ttm_tt_free_page_directory(ttm);
334 }
335
336 if (!(ttm->page_flags & TTM_PAGE_FLAG_PERSISTENT_SWAP) &&
337 ttm->swap_storage)
338 fput(ttm->swap_storage);
339
340 kfree(ttm);
341}
342
343int ttm_tt_set_user(struct ttm_tt *ttm,
344 struct task_struct *tsk,
345 unsigned long start, unsigned long num_pages)
346{
347 struct mm_struct *mm = tsk->mm;
348 int ret;
349 int write = (ttm->page_flags & TTM_PAGE_FLAG_WRITE) != 0;
350 struct ttm_mem_global *mem_glob = ttm->glob->mem_glob;
351
352 BUG_ON(num_pages != ttm->num_pages);
353 BUG_ON((ttm->page_flags & TTM_PAGE_FLAG_USER) == 0);
354
355 /**
356 * Account user pages as lowmem pages for now.
357 */
358
359 ret = ttm_mem_global_alloc(mem_glob, num_pages * PAGE_SIZE,
360 false, false);
361 if (unlikely(ret != 0))
362 return ret;
363
364 down_read(&mm->mmap_sem);
365 ret = get_user_pages(tsk, mm, start, num_pages,
366 write, 0, ttm->pages, NULL);
367 up_read(&mm->mmap_sem);
368
369 if (ret != num_pages && write) {
370 ttm_tt_free_user_pages(ttm);
371 ttm_mem_global_free(mem_glob, num_pages * PAGE_SIZE);
372 return -ENOMEM;
373 }
374
375 ttm->tsk = tsk;
376 ttm->start = start;
377 ttm->state = tt_unbound;
378
379 return 0;
380}
381
382struct ttm_tt *ttm_tt_create(struct ttm_bo_device *bdev, unsigned long size,
383 uint32_t page_flags, struct page *dummy_read_page)
384{
385 struct ttm_bo_driver *bo_driver = bdev->driver;
386 struct ttm_tt *ttm;
387
388 if (!bo_driver)
389 return NULL;
390
391 ttm = kzalloc(sizeof(*ttm), GFP_KERNEL);
392 if (!ttm)
393 return NULL;
394
395 ttm->glob = bdev->glob;
396 ttm->num_pages = (size + PAGE_SIZE - 1) >> PAGE_SHIFT;
397 ttm->first_himem_page = ttm->num_pages;
398 ttm->last_lomem_page = -1;
399 ttm->caching_state = tt_cached;
400 ttm->page_flags = page_flags;
401
402 ttm->dummy_read_page = dummy_read_page;
403
404 ttm_tt_alloc_page_directory(ttm);
405 if (!ttm->pages) {
406 ttm_tt_destroy(ttm);
407 printk(KERN_ERR TTM_PFX "Failed allocating page table\n");
408 return NULL;
409 }
410 ttm->be = bo_driver->create_ttm_backend_entry(bdev);
411 if (!ttm->be) {
412 ttm_tt_destroy(ttm);
413 printk(KERN_ERR TTM_PFX "Failed creating ttm backend entry\n");
414 return NULL;
415 }
416 ttm->state = tt_unpopulated;
417 return ttm;
418}
419
420void ttm_tt_unbind(struct ttm_tt *ttm)
421{
422 int ret;
423 struct ttm_backend *be = ttm->be;
424
425 if (ttm->state == tt_bound) {
426 ret = be->func->unbind(be);
427 BUG_ON(ret);
428 ttm->state = tt_unbound;
429 }
430}
431
432int ttm_tt_bind(struct ttm_tt *ttm, struct ttm_mem_reg *bo_mem)
433{
434 int ret = 0;
435 struct ttm_backend *be;
436
437 if (!ttm)
438 return -EINVAL;
439
440 if (ttm->state == tt_bound)
441 return 0;
442
443 be = ttm->be;
444
445 ret = ttm_tt_populate(ttm);
446 if (ret)
447 return ret;
448
449 ret = be->func->bind(be, bo_mem);
450 if (unlikely(ret != 0))
451 return ret;
452
453 ttm->state = tt_bound;
454
455 if (ttm->page_flags & TTM_PAGE_FLAG_USER)
456 ttm->page_flags |= TTM_PAGE_FLAG_USER_DIRTY;
457 return 0;
458}
459EXPORT_SYMBOL(ttm_tt_bind);
460
461static int ttm_tt_swapin(struct ttm_tt *ttm)
462{
463 struct address_space *swap_space;
464 struct file *swap_storage;
465 struct page *from_page;
466 struct page *to_page;
467 void *from_virtual;
468 void *to_virtual;
469 int i;
470 int ret = -ENOMEM;
471
472 if (ttm->page_flags & TTM_PAGE_FLAG_USER) {
473 ret = ttm_tt_set_user(ttm, ttm->tsk, ttm->start,
474 ttm->num_pages);
475 if (unlikely(ret != 0))
476 return ret;
477
478 ttm->page_flags &= ~TTM_PAGE_FLAG_SWAPPED;
479 return 0;
480 }
481
482 swap_storage = ttm->swap_storage;
483 BUG_ON(swap_storage == NULL);
484
485 swap_space = swap_storage->f_path.dentry->d_inode->i_mapping;
486
487 for (i = 0; i < ttm->num_pages; ++i) {
488 from_page = shmem_read_mapping_page(swap_space, i);
489 if (IS_ERR(from_page)) {
490 ret = PTR_ERR(from_page);
491 goto out_err;
492 }
493 to_page = __ttm_tt_get_page(ttm, i);
494 if (unlikely(to_page == NULL))
495 goto out_err;
496
497 preempt_disable();
498 from_virtual = kmap_atomic(from_page, KM_USER0);
499 to_virtual = kmap_atomic(to_page, KM_USER1);
500 memcpy(to_virtual, from_virtual, PAGE_SIZE);
501 kunmap_atomic(to_virtual, KM_USER1);
502 kunmap_atomic(from_virtual, KM_USER0);
503 preempt_enable();
504 page_cache_release(from_page);
505 }
506
507 if (!(ttm->page_flags & TTM_PAGE_FLAG_PERSISTENT_SWAP))
508 fput(swap_storage);
509 ttm->swap_storage = NULL;
510 ttm->page_flags &= ~TTM_PAGE_FLAG_SWAPPED;
511
512 return 0;
513out_err:
514 ttm_tt_free_alloced_pages(ttm);
515 return ret;
516}
517
518int ttm_tt_swapout(struct ttm_tt *ttm, struct file *persistent_swap_storage)
519{
520 struct address_space *swap_space;
521 struct file *swap_storage;
522 struct page *from_page;
523 struct page *to_page;
524 void *from_virtual;
525 void *to_virtual;
526 int i;
527 int ret = -ENOMEM;
528
529 BUG_ON(ttm->state != tt_unbound && ttm->state != tt_unpopulated);
530 BUG_ON(ttm->caching_state != tt_cached);
531
532 /*
533 * For user buffers, just unpin the pages, as there should be
534 * vma references.
535 */
536
537 if (ttm->page_flags & TTM_PAGE_FLAG_USER) {
538 ttm_tt_free_user_pages(ttm);
539 ttm->page_flags |= TTM_PAGE_FLAG_SWAPPED;
540 ttm->swap_storage = NULL;
541 return 0;
542 }
543
544 if (!persistent_swap_storage) {
545 swap_storage = shmem_file_setup("ttm swap",
546 ttm->num_pages << PAGE_SHIFT,
547 0);
548 if (unlikely(IS_ERR(swap_storage))) {
549 printk(KERN_ERR "Failed allocating swap storage.\n");
550 return PTR_ERR(swap_storage);
551 }
552 } else
553 swap_storage = persistent_swap_storage;
554
555 swap_space = swap_storage->f_path.dentry->d_inode->i_mapping;
556
557 for (i = 0; i < ttm->num_pages; ++i) {
558 from_page = ttm->pages[i];
559 if (unlikely(from_page == NULL))
560 continue;
561 to_page = shmem_read_mapping_page(swap_space, i);
562 if (unlikely(IS_ERR(to_page))) {
563 ret = PTR_ERR(to_page);
564 goto out_err;
565 }
566 preempt_disable();
567 from_virtual = kmap_atomic(from_page, KM_USER0);
568 to_virtual = kmap_atomic(to_page, KM_USER1);
569 memcpy(to_virtual, from_virtual, PAGE_SIZE);
570 kunmap_atomic(to_virtual, KM_USER1);
571 kunmap_atomic(from_virtual, KM_USER0);
572 preempt_enable();
573 set_page_dirty(to_page);
574 mark_page_accessed(to_page);
575 page_cache_release(to_page);
576 }
577
578 ttm_tt_free_alloced_pages(ttm);
579 ttm->swap_storage = swap_storage;
580 ttm->page_flags |= TTM_PAGE_FLAG_SWAPPED;
581 if (persistent_swap_storage)
582 ttm->page_flags |= TTM_PAGE_FLAG_PERSISTENT_SWAP;
583
584 return 0;
585out_err:
586 if (!persistent_swap_storage)
587 fput(swap_storage);
588
589 return ret;
590}
1/* SPDX-License-Identifier: GPL-2.0 OR MIT */
2/**************************************************************************
3 *
4 * Copyright (c) 2006-2009 VMware, Inc., Palo Alto, CA., USA
5 * All Rights Reserved.
6 *
7 * Permission is hereby granted, free of charge, to any person obtaining a
8 * copy of this software and associated documentation files (the
9 * "Software"), to deal in the Software without restriction, including
10 * without limitation the rights to use, copy, modify, merge, publish,
11 * distribute, sub license, and/or sell copies of the Software, and to
12 * permit persons to whom the Software is furnished to do so, subject to
13 * the following conditions:
14 *
15 * The above copyright notice and this permission notice (including the
16 * next paragraph) shall be included in all copies or substantial portions
17 * of the Software.
18 *
19 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
20 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
21 * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL
22 * THE COPYRIGHT HOLDERS, AUTHORS AND/OR ITS SUPPLIERS BE LIABLE FOR ANY CLAIM,
23 * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
24 * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
25 * USE OR OTHER DEALINGS IN THE SOFTWARE.
26 *
27 **************************************************************************/
28/*
29 * Authors: Thomas Hellstrom <thellstrom-at-vmware-dot-com>
30 */
31
32#define pr_fmt(fmt) "[TTM] " fmt
33
34#include <linux/sched.h>
35#include <linux/pagemap.h>
36#include <linux/shmem_fs.h>
37#include <linux/file.h>
38#include <drm/drm_cache.h>
39#include <drm/ttm/ttm_bo_driver.h>
40
41#include "ttm_module.h"
42
43static unsigned long ttm_pages_limit;
44
45MODULE_PARM_DESC(pages_limit, "Limit for the allocated pages");
46module_param_named(pages_limit, ttm_pages_limit, ulong, 0644);
47
48static unsigned long ttm_dma32_pages_limit;
49
50MODULE_PARM_DESC(dma32_pages_limit, "Limit for the allocated DMA32 pages");
51module_param_named(dma32_pages_limit, ttm_dma32_pages_limit, ulong, 0644);
52
53static atomic_long_t ttm_pages_allocated;
54static atomic_long_t ttm_dma32_pages_allocated;
55
56/*
57 * Allocates a ttm structure for the given BO.
58 */
59int ttm_tt_create(struct ttm_buffer_object *bo, bool zero_alloc)
60{
61 struct ttm_device *bdev = bo->bdev;
62 uint32_t page_flags = 0;
63
64 dma_resv_assert_held(bo->base.resv);
65
66 if (bo->ttm)
67 return 0;
68
69 switch (bo->type) {
70 case ttm_bo_type_device:
71 if (zero_alloc)
72 page_flags |= TTM_PAGE_FLAG_ZERO_ALLOC;
73 break;
74 case ttm_bo_type_kernel:
75 break;
76 case ttm_bo_type_sg:
77 page_flags |= TTM_PAGE_FLAG_SG;
78 break;
79 default:
80 pr_err("Illegal buffer object type\n");
81 return -EINVAL;
82 }
83
84 bo->ttm = bdev->funcs->ttm_tt_create(bo, page_flags);
85 if (unlikely(bo->ttm == NULL))
86 return -ENOMEM;
87
88 return 0;
89}
90
91/*
92 * Allocates storage for pointers to the pages that back the ttm.
93 */
94static int ttm_tt_alloc_page_directory(struct ttm_tt *ttm)
95{
96 ttm->pages = kvmalloc_array(ttm->num_pages, sizeof(void*),
97 GFP_KERNEL | __GFP_ZERO);
98 if (!ttm->pages)
99 return -ENOMEM;
100 return 0;
101}
102
103static int ttm_dma_tt_alloc_page_directory(struct ttm_tt *ttm)
104{
105 ttm->pages = kvmalloc_array(ttm->num_pages,
106 sizeof(*ttm->pages) +
107 sizeof(*ttm->dma_address),
108 GFP_KERNEL | __GFP_ZERO);
109 if (!ttm->pages)
110 return -ENOMEM;
111
112 ttm->dma_address = (void *)(ttm->pages + ttm->num_pages);
113 return 0;
114}
115
116static int ttm_sg_tt_alloc_page_directory(struct ttm_tt *ttm)
117{
118 ttm->dma_address = kvmalloc_array(ttm->num_pages,
119 sizeof(*ttm->dma_address),
120 GFP_KERNEL | __GFP_ZERO);
121 if (!ttm->dma_address)
122 return -ENOMEM;
123 return 0;
124}
125
126void ttm_tt_destroy_common(struct ttm_device *bdev, struct ttm_tt *ttm)
127{
128 ttm_tt_unpopulate(bdev, ttm);
129
130 if (ttm->swap_storage)
131 fput(ttm->swap_storage);
132
133 ttm->swap_storage = NULL;
134}
135EXPORT_SYMBOL(ttm_tt_destroy_common);
136
137void ttm_tt_destroy(struct ttm_device *bdev, struct ttm_tt *ttm)
138{
139 bdev->funcs->ttm_tt_destroy(bdev, ttm);
140}
141
142static void ttm_tt_init_fields(struct ttm_tt *ttm,
143 struct ttm_buffer_object *bo,
144 uint32_t page_flags,
145 enum ttm_caching caching)
146{
147 ttm->num_pages = PAGE_ALIGN(bo->base.size) >> PAGE_SHIFT;
148 ttm->caching = ttm_cached;
149 ttm->page_flags = page_flags;
150 ttm->dma_address = NULL;
151 ttm->swap_storage = NULL;
152 ttm->sg = bo->sg;
153 ttm->caching = caching;
154}
155
156int ttm_tt_init(struct ttm_tt *ttm, struct ttm_buffer_object *bo,
157 uint32_t page_flags, enum ttm_caching caching)
158{
159 ttm_tt_init_fields(ttm, bo, page_flags, caching);
160
161 if (ttm_tt_alloc_page_directory(ttm)) {
162 pr_err("Failed allocating page table\n");
163 return -ENOMEM;
164 }
165 return 0;
166}
167EXPORT_SYMBOL(ttm_tt_init);
168
169void ttm_tt_fini(struct ttm_tt *ttm)
170{
171 if (ttm->pages)
172 kvfree(ttm->pages);
173 else
174 kvfree(ttm->dma_address);
175 ttm->pages = NULL;
176 ttm->dma_address = NULL;
177}
178EXPORT_SYMBOL(ttm_tt_fini);
179
180int ttm_sg_tt_init(struct ttm_tt *ttm, struct ttm_buffer_object *bo,
181 uint32_t page_flags, enum ttm_caching caching)
182{
183 int ret;
184
185 ttm_tt_init_fields(ttm, bo, page_flags, caching);
186
187 if (page_flags & TTM_PAGE_FLAG_SG)
188 ret = ttm_sg_tt_alloc_page_directory(ttm);
189 else
190 ret = ttm_dma_tt_alloc_page_directory(ttm);
191 if (ret) {
192 pr_err("Failed allocating page table\n");
193 return -ENOMEM;
194 }
195 return 0;
196}
197EXPORT_SYMBOL(ttm_sg_tt_init);
198
199int ttm_tt_swapin(struct ttm_tt *ttm)
200{
201 struct address_space *swap_space;
202 struct file *swap_storage;
203 struct page *from_page;
204 struct page *to_page;
205 gfp_t gfp_mask;
206 int i, ret;
207
208 swap_storage = ttm->swap_storage;
209 BUG_ON(swap_storage == NULL);
210
211 swap_space = swap_storage->f_mapping;
212 gfp_mask = mapping_gfp_mask(swap_space);
213
214 for (i = 0; i < ttm->num_pages; ++i) {
215 from_page = shmem_read_mapping_page_gfp(swap_space, i,
216 gfp_mask);
217 if (IS_ERR(from_page)) {
218 ret = PTR_ERR(from_page);
219 goto out_err;
220 }
221 to_page = ttm->pages[i];
222 if (unlikely(to_page == NULL)) {
223 ret = -ENOMEM;
224 goto out_err;
225 }
226
227 copy_highpage(to_page, from_page);
228 put_page(from_page);
229 }
230
231 fput(swap_storage);
232 ttm->swap_storage = NULL;
233 ttm->page_flags &= ~TTM_PAGE_FLAG_SWAPPED;
234
235 return 0;
236
237out_err:
238 return ret;
239}
240
241/**
242 * ttm_tt_swapout - swap out tt object
243 *
244 * @bdev: TTM device structure.
245 * @ttm: The struct ttm_tt.
246 * @gfp_flags: Flags to use for memory allocation.
247 *
248 * Swapout a TT object to a shmem_file, return number of pages swapped out or
249 * negative error code.
250 */
251int ttm_tt_swapout(struct ttm_device *bdev, struct ttm_tt *ttm,
252 gfp_t gfp_flags)
253{
254 loff_t size = (loff_t)ttm->num_pages << PAGE_SHIFT;
255 struct address_space *swap_space;
256 struct file *swap_storage;
257 struct page *from_page;
258 struct page *to_page;
259 int i, ret;
260
261 swap_storage = shmem_file_setup("ttm swap", size, 0);
262 if (IS_ERR(swap_storage)) {
263 pr_err("Failed allocating swap storage\n");
264 return PTR_ERR(swap_storage);
265 }
266
267 swap_space = swap_storage->f_mapping;
268 gfp_flags &= mapping_gfp_mask(swap_space);
269
270 for (i = 0; i < ttm->num_pages; ++i) {
271 from_page = ttm->pages[i];
272 if (unlikely(from_page == NULL))
273 continue;
274
275 to_page = shmem_read_mapping_page_gfp(swap_space, i, gfp_flags);
276 if (IS_ERR(to_page)) {
277 ret = PTR_ERR(to_page);
278 goto out_err;
279 }
280 copy_highpage(to_page, from_page);
281 set_page_dirty(to_page);
282 mark_page_accessed(to_page);
283 put_page(to_page);
284 }
285
286 ttm_tt_unpopulate(bdev, ttm);
287 ttm->swap_storage = swap_storage;
288 ttm->page_flags |= TTM_PAGE_FLAG_SWAPPED;
289
290 return ttm->num_pages;
291
292out_err:
293 fput(swap_storage);
294
295 return ret;
296}
297
298static void ttm_tt_add_mapping(struct ttm_device *bdev, struct ttm_tt *ttm)
299{
300 pgoff_t i;
301
302 if (ttm->page_flags & TTM_PAGE_FLAG_SG)
303 return;
304
305 for (i = 0; i < ttm->num_pages; ++i)
306 ttm->pages[i]->mapping = bdev->dev_mapping;
307}
308
309int ttm_tt_populate(struct ttm_device *bdev,
310 struct ttm_tt *ttm, struct ttm_operation_ctx *ctx)
311{
312 int ret;
313
314 if (!ttm)
315 return -EINVAL;
316
317 if (ttm_tt_is_populated(ttm))
318 return 0;
319
320 if (!(ttm->page_flags & TTM_PAGE_FLAG_SG)) {
321 atomic_long_add(ttm->num_pages, &ttm_pages_allocated);
322 if (bdev->pool.use_dma32)
323 atomic_long_add(ttm->num_pages,
324 &ttm_dma32_pages_allocated);
325 }
326
327 while (atomic_long_read(&ttm_pages_allocated) > ttm_pages_limit ||
328 atomic_long_read(&ttm_dma32_pages_allocated) >
329 ttm_dma32_pages_limit) {
330
331 ret = ttm_global_swapout(ctx, GFP_KERNEL);
332 if (ret == 0)
333 break;
334 if (ret < 0)
335 goto error;
336 }
337
338 if (bdev->funcs->ttm_tt_populate)
339 ret = bdev->funcs->ttm_tt_populate(bdev, ttm, ctx);
340 else
341 ret = ttm_pool_alloc(&bdev->pool, ttm, ctx);
342 if (ret)
343 goto error;
344
345 ttm_tt_add_mapping(bdev, ttm);
346 ttm->page_flags |= TTM_PAGE_FLAG_PRIV_POPULATED;
347 if (unlikely(ttm->page_flags & TTM_PAGE_FLAG_SWAPPED)) {
348 ret = ttm_tt_swapin(ttm);
349 if (unlikely(ret != 0)) {
350 ttm_tt_unpopulate(bdev, ttm);
351 return ret;
352 }
353 }
354
355 return 0;
356
357error:
358 if (!(ttm->page_flags & TTM_PAGE_FLAG_SG)) {
359 atomic_long_sub(ttm->num_pages, &ttm_pages_allocated);
360 if (bdev->pool.use_dma32)
361 atomic_long_sub(ttm->num_pages,
362 &ttm_dma32_pages_allocated);
363 }
364 return ret;
365}
366EXPORT_SYMBOL(ttm_tt_populate);
367
368static void ttm_tt_clear_mapping(struct ttm_tt *ttm)
369{
370 pgoff_t i;
371 struct page **page = ttm->pages;
372
373 if (ttm->page_flags & TTM_PAGE_FLAG_SG)
374 return;
375
376 for (i = 0; i < ttm->num_pages; ++i) {
377 (*page)->mapping = NULL;
378 (*page++)->index = 0;
379 }
380}
381
382void ttm_tt_unpopulate(struct ttm_device *bdev, struct ttm_tt *ttm)
383{
384 if (!ttm_tt_is_populated(ttm))
385 return;
386
387 ttm_tt_clear_mapping(ttm);
388 if (bdev->funcs->ttm_tt_unpopulate)
389 bdev->funcs->ttm_tt_unpopulate(bdev, ttm);
390 else
391 ttm_pool_free(&bdev->pool, ttm);
392
393 if (!(ttm->page_flags & TTM_PAGE_FLAG_SG)) {
394 atomic_long_sub(ttm->num_pages, &ttm_pages_allocated);
395 if (bdev->pool.use_dma32)
396 atomic_long_sub(ttm->num_pages,
397 &ttm_dma32_pages_allocated);
398 }
399
400 ttm->page_flags &= ~TTM_PAGE_FLAG_PRIV_POPULATED;
401}
402
403#ifdef CONFIG_DEBUG_FS
404
405/* Test the shrinker functions and dump the result */
406static int ttm_tt_debugfs_shrink_show(struct seq_file *m, void *data)
407{
408 struct ttm_operation_ctx ctx = { false, false };
409
410 seq_printf(m, "%d\n", ttm_global_swapout(&ctx, GFP_KERNEL));
411 return 0;
412}
413DEFINE_SHOW_ATTRIBUTE(ttm_tt_debugfs_shrink);
414
415#endif
416
417
418/*
419 * ttm_tt_mgr_init - register with the MM shrinker
420 *
421 * Register with the MM shrinker for swapping out BOs.
422 */
423void ttm_tt_mgr_init(unsigned long num_pages, unsigned long num_dma32_pages)
424{
425#ifdef CONFIG_DEBUG_FS
426 debugfs_create_file("tt_shrink", 0400, ttm_debugfs_root, NULL,
427 &ttm_tt_debugfs_shrink_fops);
428#endif
429
430 if (!ttm_pages_limit)
431 ttm_pages_limit = num_pages;
432
433 if (!ttm_dma32_pages_limit)
434 ttm_dma32_pages_limit = num_dma32_pages;
435}
436
437static void ttm_kmap_iter_tt_map_local(struct ttm_kmap_iter *iter,
438 struct dma_buf_map *dmap,
439 pgoff_t i)
440{
441 struct ttm_kmap_iter_tt *iter_tt =
442 container_of(iter, typeof(*iter_tt), base);
443
444 dma_buf_map_set_vaddr(dmap, kmap_local_page_prot(iter_tt->tt->pages[i],
445 iter_tt->prot));
446}
447
448static void ttm_kmap_iter_tt_unmap_local(struct ttm_kmap_iter *iter,
449 struct dma_buf_map *map)
450{
451 kunmap_local(map->vaddr);
452}
453
454static const struct ttm_kmap_iter_ops ttm_kmap_iter_tt_ops = {
455 .map_local = ttm_kmap_iter_tt_map_local,
456 .unmap_local = ttm_kmap_iter_tt_unmap_local,
457 .maps_tt = true,
458};
459
460/**
461 * ttm_kmap_iter_tt_init - Initialize a struct ttm_kmap_iter_tt
462 * @iter_tt: The struct ttm_kmap_iter_tt to initialize.
463 * @tt: Struct ttm_tt holding page pointers of the struct ttm_resource.
464 *
465 * Return: Pointer to the embedded struct ttm_kmap_iter.
466 */
467struct ttm_kmap_iter *
468ttm_kmap_iter_tt_init(struct ttm_kmap_iter_tt *iter_tt,
469 struct ttm_tt *tt)
470{
471 iter_tt->base.ops = &ttm_kmap_iter_tt_ops;
472 iter_tt->tt = tt;
473 if (tt)
474 iter_tt->prot = ttm_prot_from_caching(tt->caching, PAGE_KERNEL);
475 else
476 iter_tt->prot = PAGE_KERNEL;
477
478 return &iter_tt->base;
479}
480EXPORT_SYMBOL(ttm_kmap_iter_tt_init);