Loading...
1/*
2 * Copyright (c) Red Hat Inc.
3
4 * Permission is hereby granted, free of charge, to any person obtaining a
5 * copy of this software and associated documentation files (the "Software"),
6 * to deal in the Software without restriction, including without limitation
7 * the rights to use, copy, modify, merge, publish, distribute, sub license,
8 * and/or sell copies of the Software, and to permit persons to whom the
9 * Software is furnished to do so, subject to the following conditions:
10 *
11 * The above copyright notice and this permission notice (including the
12 * next paragraph) shall be included in all copies or substantial portions
13 * of the Software.
14 *
15 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17 * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL
18 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
19 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
20 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
21 * DEALINGS IN THE SOFTWARE.
22 *
23 * Authors: Dave Airlie <airlied@redhat.com>
24 * Jerome Glisse <jglisse@redhat.com>
25 * Pauli Nieminen <suokkos@gmail.com>
26 */
27
28/* simple list based uncached page pool
29 * - Pool collects resently freed pages for reuse
30 * - Use page->lru to keep a free list
31 * - doesn't track currently in use pages
32 */
33
34#define pr_fmt(fmt) "[TTM] " fmt
35
36#include <linux/list.h>
37#include <linux/spinlock.h>
38#include <linux/highmem.h>
39#include <linux/mm_types.h>
40#include <linux/module.h>
41#include <linux/mm.h>
42#include <linux/seq_file.h> /* for seq_printf */
43#include <linux/slab.h>
44#include <linux/dma-mapping.h>
45
46#include <linux/atomic.h>
47
48#include <drm/ttm/ttm_bo_driver.h>
49#include <drm/ttm/ttm_page_alloc.h>
50#include <drm/ttm/ttm_set_memory.h>
51
52#define NUM_PAGES_TO_ALLOC (PAGE_SIZE/sizeof(struct page *))
53#define SMALL_ALLOCATION 16
54#define FREE_ALL_PAGES (~0U)
55/* times are in msecs */
56#define PAGE_FREE_INTERVAL 1000
57
58/**
59 * struct ttm_page_pool - Pool to reuse recently allocated uc/wc pages.
60 *
61 * @lock: Protects the shared pool from concurrnet access. Must be used with
62 * irqsave/irqrestore variants because pool allocator maybe called from
63 * delayed work.
64 * @fill_lock: Prevent concurrent calls to fill.
65 * @list: Pool of free uc/wc pages for fast reuse.
66 * @gfp_flags: Flags to pass for alloc_page.
67 * @npages: Number of pages in pool.
68 */
69struct ttm_page_pool {
70 spinlock_t lock;
71 bool fill_lock;
72 struct list_head list;
73 gfp_t gfp_flags;
74 unsigned npages;
75 char *name;
76 unsigned long nfrees;
77 unsigned long nrefills;
78 unsigned int order;
79};
80
81/**
82 * Limits for the pool. They are handled without locks because only place where
83 * they may change is in sysfs store. They won't have immediate effect anyway
84 * so forcing serialization to access them is pointless.
85 */
86
87struct ttm_pool_opts {
88 unsigned alloc_size;
89 unsigned max_size;
90 unsigned small;
91};
92
93#define NUM_POOLS 6
94
95/**
96 * struct ttm_pool_manager - Holds memory pools for fst allocation
97 *
98 * Manager is read only object for pool code so it doesn't need locking.
99 *
100 * @free_interval: minimum number of jiffies between freeing pages from pool.
101 * @page_alloc_inited: reference counting for pool allocation.
102 * @work: Work that is used to shrink the pool. Work is only run when there is
103 * some pages to free.
104 * @small_allocation: Limit in number of pages what is small allocation.
105 *
106 * @pools: All pool objects in use.
107 **/
108struct ttm_pool_manager {
109 struct kobject kobj;
110 struct shrinker mm_shrink;
111 struct ttm_pool_opts options;
112
113 union {
114 struct ttm_page_pool pools[NUM_POOLS];
115 struct {
116 struct ttm_page_pool wc_pool;
117 struct ttm_page_pool uc_pool;
118 struct ttm_page_pool wc_pool_dma32;
119 struct ttm_page_pool uc_pool_dma32;
120 struct ttm_page_pool wc_pool_huge;
121 struct ttm_page_pool uc_pool_huge;
122 } ;
123 };
124};
125
126static struct attribute ttm_page_pool_max = {
127 .name = "pool_max_size",
128 .mode = S_IRUGO | S_IWUSR
129};
130static struct attribute ttm_page_pool_small = {
131 .name = "pool_small_allocation",
132 .mode = S_IRUGO | S_IWUSR
133};
134static struct attribute ttm_page_pool_alloc_size = {
135 .name = "pool_allocation_size",
136 .mode = S_IRUGO | S_IWUSR
137};
138
139static struct attribute *ttm_pool_attrs[] = {
140 &ttm_page_pool_max,
141 &ttm_page_pool_small,
142 &ttm_page_pool_alloc_size,
143 NULL
144};
145
146static void ttm_pool_kobj_release(struct kobject *kobj)
147{
148 struct ttm_pool_manager *m =
149 container_of(kobj, struct ttm_pool_manager, kobj);
150 kfree(m);
151}
152
153static ssize_t ttm_pool_store(struct kobject *kobj,
154 struct attribute *attr, const char *buffer, size_t size)
155{
156 struct ttm_pool_manager *m =
157 container_of(kobj, struct ttm_pool_manager, kobj);
158 int chars;
159 unsigned val;
160 chars = sscanf(buffer, "%u", &val);
161 if (chars == 0)
162 return size;
163
164 /* Convert kb to number of pages */
165 val = val / (PAGE_SIZE >> 10);
166
167 if (attr == &ttm_page_pool_max)
168 m->options.max_size = val;
169 else if (attr == &ttm_page_pool_small)
170 m->options.small = val;
171 else if (attr == &ttm_page_pool_alloc_size) {
172 if (val > NUM_PAGES_TO_ALLOC*8) {
173 pr_err("Setting allocation size to %lu is not allowed. Recommended size is %lu\n",
174 NUM_PAGES_TO_ALLOC*(PAGE_SIZE >> 7),
175 NUM_PAGES_TO_ALLOC*(PAGE_SIZE >> 10));
176 return size;
177 } else if (val > NUM_PAGES_TO_ALLOC) {
178 pr_warn("Setting allocation size to larger than %lu is not recommended\n",
179 NUM_PAGES_TO_ALLOC*(PAGE_SIZE >> 10));
180 }
181 m->options.alloc_size = val;
182 }
183
184 return size;
185}
186
187static ssize_t ttm_pool_show(struct kobject *kobj,
188 struct attribute *attr, char *buffer)
189{
190 struct ttm_pool_manager *m =
191 container_of(kobj, struct ttm_pool_manager, kobj);
192 unsigned val = 0;
193
194 if (attr == &ttm_page_pool_max)
195 val = m->options.max_size;
196 else if (attr == &ttm_page_pool_small)
197 val = m->options.small;
198 else if (attr == &ttm_page_pool_alloc_size)
199 val = m->options.alloc_size;
200
201 val = val * (PAGE_SIZE >> 10);
202
203 return snprintf(buffer, PAGE_SIZE, "%u\n", val);
204}
205
206static const struct sysfs_ops ttm_pool_sysfs_ops = {
207 .show = &ttm_pool_show,
208 .store = &ttm_pool_store,
209};
210
211static struct kobj_type ttm_pool_kobj_type = {
212 .release = &ttm_pool_kobj_release,
213 .sysfs_ops = &ttm_pool_sysfs_ops,
214 .default_attrs = ttm_pool_attrs,
215};
216
217static struct ttm_pool_manager *_manager;
218
219/**
220 * Select the right pool or requested caching state and ttm flags. */
221static struct ttm_page_pool *ttm_get_pool(int flags, bool huge,
222 enum ttm_caching_state cstate)
223{
224 int pool_index;
225
226 if (cstate == tt_cached)
227 return NULL;
228
229 if (cstate == tt_wc)
230 pool_index = 0x0;
231 else
232 pool_index = 0x1;
233
234 if (flags & TTM_PAGE_FLAG_DMA32) {
235 if (huge)
236 return NULL;
237 pool_index |= 0x2;
238
239 } else if (huge) {
240 pool_index |= 0x4;
241 }
242
243 return &_manager->pools[pool_index];
244}
245
246/* set memory back to wb and free the pages. */
247static void ttm_pages_put(struct page *pages[], unsigned npages,
248 unsigned int order)
249{
250 unsigned int i, pages_nr = (1 << order);
251
252 if (order == 0) {
253 if (ttm_set_pages_array_wb(pages, npages))
254 pr_err("Failed to set %d pages to wb!\n", npages);
255 }
256
257 for (i = 0; i < npages; ++i) {
258 if (order > 0) {
259 if (ttm_set_pages_wb(pages[i], pages_nr))
260 pr_err("Failed to set %d pages to wb!\n", pages_nr);
261 }
262 __free_pages(pages[i], order);
263 }
264}
265
266static void ttm_pool_update_free_locked(struct ttm_page_pool *pool,
267 unsigned freed_pages)
268{
269 pool->npages -= freed_pages;
270 pool->nfrees += freed_pages;
271}
272
273/**
274 * Free pages from pool.
275 *
276 * To prevent hogging the ttm_swap process we only free NUM_PAGES_TO_ALLOC
277 * number of pages in one go.
278 *
279 * @pool: to free the pages from
280 * @free_all: If set to true will free all pages in pool
281 * @use_static: Safe to use static buffer
282 **/
283static int ttm_page_pool_free(struct ttm_page_pool *pool, unsigned nr_free,
284 bool use_static)
285{
286 static struct page *static_buf[NUM_PAGES_TO_ALLOC];
287 unsigned long irq_flags;
288 struct page *p;
289 struct page **pages_to_free;
290 unsigned freed_pages = 0,
291 npages_to_free = nr_free;
292
293 if (NUM_PAGES_TO_ALLOC < nr_free)
294 npages_to_free = NUM_PAGES_TO_ALLOC;
295
296 if (use_static)
297 pages_to_free = static_buf;
298 else
299 pages_to_free = kmalloc_array(npages_to_free,
300 sizeof(struct page *),
301 GFP_KERNEL);
302 if (!pages_to_free) {
303 pr_debug("Failed to allocate memory for pool free operation\n");
304 return 0;
305 }
306
307restart:
308 spin_lock_irqsave(&pool->lock, irq_flags);
309
310 list_for_each_entry_reverse(p, &pool->list, lru) {
311 if (freed_pages >= npages_to_free)
312 break;
313
314 pages_to_free[freed_pages++] = p;
315 /* We can only remove NUM_PAGES_TO_ALLOC at a time. */
316 if (freed_pages >= NUM_PAGES_TO_ALLOC) {
317 /* remove range of pages from the pool */
318 __list_del(p->lru.prev, &pool->list);
319
320 ttm_pool_update_free_locked(pool, freed_pages);
321 /**
322 * Because changing page caching is costly
323 * we unlock the pool to prevent stalling.
324 */
325 spin_unlock_irqrestore(&pool->lock, irq_flags);
326
327 ttm_pages_put(pages_to_free, freed_pages, pool->order);
328 if (likely(nr_free != FREE_ALL_PAGES))
329 nr_free -= freed_pages;
330
331 if (NUM_PAGES_TO_ALLOC >= nr_free)
332 npages_to_free = nr_free;
333 else
334 npages_to_free = NUM_PAGES_TO_ALLOC;
335
336 freed_pages = 0;
337
338 /* free all so restart the processing */
339 if (nr_free)
340 goto restart;
341
342 /* Not allowed to fall through or break because
343 * following context is inside spinlock while we are
344 * outside here.
345 */
346 goto out;
347
348 }
349 }
350
351 /* remove range of pages from the pool */
352 if (freed_pages) {
353 __list_del(&p->lru, &pool->list);
354
355 ttm_pool_update_free_locked(pool, freed_pages);
356 nr_free -= freed_pages;
357 }
358
359 spin_unlock_irqrestore(&pool->lock, irq_flags);
360
361 if (freed_pages)
362 ttm_pages_put(pages_to_free, freed_pages, pool->order);
363out:
364 if (pages_to_free != static_buf)
365 kfree(pages_to_free);
366 return nr_free;
367}
368
369/**
370 * Callback for mm to request pool to reduce number of page held.
371 *
372 * XXX: (dchinner) Deadlock warning!
373 *
374 * This code is crying out for a shrinker per pool....
375 */
376static unsigned long
377ttm_pool_shrink_scan(struct shrinker *shrink, struct shrink_control *sc)
378{
379 static DEFINE_MUTEX(lock);
380 static unsigned start_pool;
381 unsigned i;
382 unsigned pool_offset;
383 struct ttm_page_pool *pool;
384 int shrink_pages = sc->nr_to_scan;
385 unsigned long freed = 0;
386 unsigned int nr_free_pool;
387
388 if (!mutex_trylock(&lock))
389 return SHRINK_STOP;
390 pool_offset = ++start_pool % NUM_POOLS;
391 /* select start pool in round robin fashion */
392 for (i = 0; i < NUM_POOLS; ++i) {
393 unsigned nr_free = shrink_pages;
394 unsigned page_nr;
395
396 if (shrink_pages == 0)
397 break;
398
399 pool = &_manager->pools[(i + pool_offset)%NUM_POOLS];
400 page_nr = (1 << pool->order);
401 /* OK to use static buffer since global mutex is held. */
402 nr_free_pool = roundup(nr_free, page_nr) >> pool->order;
403 shrink_pages = ttm_page_pool_free(pool, nr_free_pool, true);
404 freed += (nr_free_pool - shrink_pages) << pool->order;
405 if (freed >= sc->nr_to_scan)
406 break;
407 shrink_pages <<= pool->order;
408 }
409 mutex_unlock(&lock);
410 return freed;
411}
412
413
414static unsigned long
415ttm_pool_shrink_count(struct shrinker *shrink, struct shrink_control *sc)
416{
417 unsigned i;
418 unsigned long count = 0;
419 struct ttm_page_pool *pool;
420
421 for (i = 0; i < NUM_POOLS; ++i) {
422 pool = &_manager->pools[i];
423 count += (pool->npages << pool->order);
424 }
425
426 return count;
427}
428
429static int ttm_pool_mm_shrink_init(struct ttm_pool_manager *manager)
430{
431 manager->mm_shrink.count_objects = ttm_pool_shrink_count;
432 manager->mm_shrink.scan_objects = ttm_pool_shrink_scan;
433 manager->mm_shrink.seeks = 1;
434 return register_shrinker(&manager->mm_shrink);
435}
436
437static void ttm_pool_mm_shrink_fini(struct ttm_pool_manager *manager)
438{
439 unregister_shrinker(&manager->mm_shrink);
440}
441
442static int ttm_set_pages_caching(struct page **pages,
443 enum ttm_caching_state cstate, unsigned cpages)
444{
445 int r = 0;
446 /* Set page caching */
447 switch (cstate) {
448 case tt_uncached:
449 r = ttm_set_pages_array_uc(pages, cpages);
450 if (r)
451 pr_err("Failed to set %d pages to uc!\n", cpages);
452 break;
453 case tt_wc:
454 r = ttm_set_pages_array_wc(pages, cpages);
455 if (r)
456 pr_err("Failed to set %d pages to wc!\n", cpages);
457 break;
458 default:
459 break;
460 }
461 return r;
462}
463
464/**
465 * Free pages the pages that failed to change the caching state. If there is
466 * any pages that have changed their caching state already put them to the
467 * pool.
468 */
469static void ttm_handle_caching_state_failure(struct list_head *pages,
470 int ttm_flags, enum ttm_caching_state cstate,
471 struct page **failed_pages, unsigned cpages)
472{
473 unsigned i;
474 /* Failed pages have to be freed */
475 for (i = 0; i < cpages; ++i) {
476 list_del(&failed_pages[i]->lru);
477 __free_page(failed_pages[i]);
478 }
479}
480
481/**
482 * Allocate new pages with correct caching.
483 *
484 * This function is reentrant if caller updates count depending on number of
485 * pages returned in pages array.
486 */
487static int ttm_alloc_new_pages(struct list_head *pages, gfp_t gfp_flags,
488 int ttm_flags, enum ttm_caching_state cstate,
489 unsigned count, unsigned order)
490{
491 struct page **caching_array;
492 struct page *p;
493 int r = 0;
494 unsigned i, j, cpages;
495 unsigned npages = 1 << order;
496 unsigned max_cpages = min(count << order, (unsigned)NUM_PAGES_TO_ALLOC);
497
498 /* allocate array for page caching change */
499 caching_array = kmalloc_array(max_cpages, sizeof(struct page *),
500 GFP_KERNEL);
501
502 if (!caching_array) {
503 pr_debug("Unable to allocate table for new pages\n");
504 return -ENOMEM;
505 }
506
507 for (i = 0, cpages = 0; i < count; ++i) {
508 p = alloc_pages(gfp_flags, order);
509
510 if (!p) {
511 pr_debug("Unable to get page %u\n", i);
512
513 /* store already allocated pages in the pool after
514 * setting the caching state */
515 if (cpages) {
516 r = ttm_set_pages_caching(caching_array,
517 cstate, cpages);
518 if (r)
519 ttm_handle_caching_state_failure(pages,
520 ttm_flags, cstate,
521 caching_array, cpages);
522 }
523 r = -ENOMEM;
524 goto out;
525 }
526
527 list_add(&p->lru, pages);
528
529#ifdef CONFIG_HIGHMEM
530 /* gfp flags of highmem page should never be dma32 so we
531 * we should be fine in such case
532 */
533 if (PageHighMem(p))
534 continue;
535
536#endif
537 for (j = 0; j < npages; ++j) {
538 caching_array[cpages++] = p++;
539 if (cpages == max_cpages) {
540
541 r = ttm_set_pages_caching(caching_array,
542 cstate, cpages);
543 if (r) {
544 ttm_handle_caching_state_failure(pages,
545 ttm_flags, cstate,
546 caching_array, cpages);
547 goto out;
548 }
549 cpages = 0;
550 }
551 }
552 }
553
554 if (cpages) {
555 r = ttm_set_pages_caching(caching_array, cstate, cpages);
556 if (r)
557 ttm_handle_caching_state_failure(pages,
558 ttm_flags, cstate,
559 caching_array, cpages);
560 }
561out:
562 kfree(caching_array);
563
564 return r;
565}
566
567/**
568 * Fill the given pool if there aren't enough pages and the requested number of
569 * pages is small.
570 */
571static void ttm_page_pool_fill_locked(struct ttm_page_pool *pool, int ttm_flags,
572 enum ttm_caching_state cstate,
573 unsigned count, unsigned long *irq_flags)
574{
575 struct page *p;
576 int r;
577 unsigned cpages = 0;
578 /**
579 * Only allow one pool fill operation at a time.
580 * If pool doesn't have enough pages for the allocation new pages are
581 * allocated from outside of pool.
582 */
583 if (pool->fill_lock)
584 return;
585
586 pool->fill_lock = true;
587
588 /* If allocation request is small and there are not enough
589 * pages in a pool we fill the pool up first. */
590 if (count < _manager->options.small
591 && count > pool->npages) {
592 struct list_head new_pages;
593 unsigned alloc_size = _manager->options.alloc_size;
594
595 /**
596 * Can't change page caching if in irqsave context. We have to
597 * drop the pool->lock.
598 */
599 spin_unlock_irqrestore(&pool->lock, *irq_flags);
600
601 INIT_LIST_HEAD(&new_pages);
602 r = ttm_alloc_new_pages(&new_pages, pool->gfp_flags, ttm_flags,
603 cstate, alloc_size, 0);
604 spin_lock_irqsave(&pool->lock, *irq_flags);
605
606 if (!r) {
607 list_splice(&new_pages, &pool->list);
608 ++pool->nrefills;
609 pool->npages += alloc_size;
610 } else {
611 pr_debug("Failed to fill pool (%p)\n", pool);
612 /* If we have any pages left put them to the pool. */
613 list_for_each_entry(p, &new_pages, lru) {
614 ++cpages;
615 }
616 list_splice(&new_pages, &pool->list);
617 pool->npages += cpages;
618 }
619
620 }
621 pool->fill_lock = false;
622}
623
624/**
625 * Allocate pages from the pool and put them on the return list.
626 *
627 * @return zero for success or negative error code.
628 */
629static int ttm_page_pool_get_pages(struct ttm_page_pool *pool,
630 struct list_head *pages,
631 int ttm_flags,
632 enum ttm_caching_state cstate,
633 unsigned count, unsigned order)
634{
635 unsigned long irq_flags;
636 struct list_head *p;
637 unsigned i;
638 int r = 0;
639
640 spin_lock_irqsave(&pool->lock, irq_flags);
641 if (!order)
642 ttm_page_pool_fill_locked(pool, ttm_flags, cstate, count,
643 &irq_flags);
644
645 if (count >= pool->npages) {
646 /* take all pages from the pool */
647 list_splice_init(&pool->list, pages);
648 count -= pool->npages;
649 pool->npages = 0;
650 goto out;
651 }
652 /* find the last pages to include for requested number of pages. Split
653 * pool to begin and halve it to reduce search space. */
654 if (count <= pool->npages/2) {
655 i = 0;
656 list_for_each(p, &pool->list) {
657 if (++i == count)
658 break;
659 }
660 } else {
661 i = pool->npages + 1;
662 list_for_each_prev(p, &pool->list) {
663 if (--i == count)
664 break;
665 }
666 }
667 /* Cut 'count' number of pages from the pool */
668 list_cut_position(pages, &pool->list, p);
669 pool->npages -= count;
670 count = 0;
671out:
672 spin_unlock_irqrestore(&pool->lock, irq_flags);
673
674 /* clear the pages coming from the pool if requested */
675 if (ttm_flags & TTM_PAGE_FLAG_ZERO_ALLOC) {
676 struct page *page;
677
678 list_for_each_entry(page, pages, lru) {
679 if (PageHighMem(page))
680 clear_highpage(page);
681 else
682 clear_page(page_address(page));
683 }
684 }
685
686 /* If pool didn't have enough pages allocate new one. */
687 if (count) {
688 gfp_t gfp_flags = pool->gfp_flags;
689
690 /* set zero flag for page allocation if required */
691 if (ttm_flags & TTM_PAGE_FLAG_ZERO_ALLOC)
692 gfp_flags |= __GFP_ZERO;
693
694 if (ttm_flags & TTM_PAGE_FLAG_NO_RETRY)
695 gfp_flags |= __GFP_RETRY_MAYFAIL;
696
697 /* ttm_alloc_new_pages doesn't reference pool so we can run
698 * multiple requests in parallel.
699 **/
700 r = ttm_alloc_new_pages(pages, gfp_flags, ttm_flags, cstate,
701 count, order);
702 }
703
704 return r;
705}
706
707/* Put all pages in pages list to correct pool to wait for reuse */
708static void ttm_put_pages(struct page **pages, unsigned npages, int flags,
709 enum ttm_caching_state cstate)
710{
711 struct ttm_page_pool *pool = ttm_get_pool(flags, false, cstate);
712#ifdef CONFIG_TRANSPARENT_HUGEPAGE
713 struct ttm_page_pool *huge = ttm_get_pool(flags, true, cstate);
714#endif
715 unsigned long irq_flags;
716 unsigned i;
717
718 if (pool == NULL) {
719 /* No pool for this memory type so free the pages */
720 i = 0;
721 while (i < npages) {
722#ifdef CONFIG_TRANSPARENT_HUGEPAGE
723 struct page *p = pages[i];
724#endif
725 unsigned order = 0, j;
726
727 if (!pages[i]) {
728 ++i;
729 continue;
730 }
731
732#ifdef CONFIG_TRANSPARENT_HUGEPAGE
733 if (!(flags & TTM_PAGE_FLAG_DMA32) &&
734 (npages - i) >= HPAGE_PMD_NR) {
735 for (j = 1; j < HPAGE_PMD_NR; ++j)
736 if (++p != pages[i + j])
737 break;
738
739 if (j == HPAGE_PMD_NR)
740 order = HPAGE_PMD_ORDER;
741 }
742#endif
743
744 if (page_count(pages[i]) != 1)
745 pr_err("Erroneous page count. Leaking pages.\n");
746 __free_pages(pages[i], order);
747
748 j = 1 << order;
749 while (j) {
750 pages[i++] = NULL;
751 --j;
752 }
753 }
754 return;
755 }
756
757 i = 0;
758#ifdef CONFIG_TRANSPARENT_HUGEPAGE
759 if (huge) {
760 unsigned max_size, n2free;
761
762 spin_lock_irqsave(&huge->lock, irq_flags);
763 while ((npages - i) >= HPAGE_PMD_NR) {
764 struct page *p = pages[i];
765 unsigned j;
766
767 if (!p)
768 break;
769
770 for (j = 1; j < HPAGE_PMD_NR; ++j)
771 if (++p != pages[i + j])
772 break;
773
774 if (j != HPAGE_PMD_NR)
775 break;
776
777 list_add_tail(&pages[i]->lru, &huge->list);
778
779 for (j = 0; j < HPAGE_PMD_NR; ++j)
780 pages[i++] = NULL;
781 huge->npages++;
782 }
783
784 /* Check that we don't go over the pool limit */
785 max_size = _manager->options.max_size;
786 max_size /= HPAGE_PMD_NR;
787 if (huge->npages > max_size)
788 n2free = huge->npages - max_size;
789 else
790 n2free = 0;
791 spin_unlock_irqrestore(&huge->lock, irq_flags);
792 if (n2free)
793 ttm_page_pool_free(huge, n2free, false);
794 }
795#endif
796
797 spin_lock_irqsave(&pool->lock, irq_flags);
798 while (i < npages) {
799 if (pages[i]) {
800 if (page_count(pages[i]) != 1)
801 pr_err("Erroneous page count. Leaking pages.\n");
802 list_add_tail(&pages[i]->lru, &pool->list);
803 pages[i] = NULL;
804 pool->npages++;
805 }
806 ++i;
807 }
808 /* Check that we don't go over the pool limit */
809 npages = 0;
810 if (pool->npages > _manager->options.max_size) {
811 npages = pool->npages - _manager->options.max_size;
812 /* free at least NUM_PAGES_TO_ALLOC number of pages
813 * to reduce calls to set_memory_wb */
814 if (npages < NUM_PAGES_TO_ALLOC)
815 npages = NUM_PAGES_TO_ALLOC;
816 }
817 spin_unlock_irqrestore(&pool->lock, irq_flags);
818 if (npages)
819 ttm_page_pool_free(pool, npages, false);
820}
821
822/*
823 * On success pages list will hold count number of correctly
824 * cached pages.
825 */
826static int ttm_get_pages(struct page **pages, unsigned npages, int flags,
827 enum ttm_caching_state cstate)
828{
829 struct ttm_page_pool *pool = ttm_get_pool(flags, false, cstate);
830#ifdef CONFIG_TRANSPARENT_HUGEPAGE
831 struct ttm_page_pool *huge = ttm_get_pool(flags, true, cstate);
832#endif
833 struct list_head plist;
834 struct page *p = NULL;
835 unsigned count, first;
836 int r;
837
838 /* No pool for cached pages */
839 if (pool == NULL) {
840 gfp_t gfp_flags = GFP_USER;
841 unsigned i;
842#ifdef CONFIG_TRANSPARENT_HUGEPAGE
843 unsigned j;
844#endif
845
846 /* set zero flag for page allocation if required */
847 if (flags & TTM_PAGE_FLAG_ZERO_ALLOC)
848 gfp_flags |= __GFP_ZERO;
849
850 if (flags & TTM_PAGE_FLAG_NO_RETRY)
851 gfp_flags |= __GFP_RETRY_MAYFAIL;
852
853 if (flags & TTM_PAGE_FLAG_DMA32)
854 gfp_flags |= GFP_DMA32;
855 else
856 gfp_flags |= GFP_HIGHUSER;
857
858 i = 0;
859#ifdef CONFIG_TRANSPARENT_HUGEPAGE
860 if (!(gfp_flags & GFP_DMA32)) {
861 while (npages >= HPAGE_PMD_NR) {
862 gfp_t huge_flags = gfp_flags;
863
864 huge_flags |= GFP_TRANSHUGE_LIGHT | __GFP_NORETRY |
865 __GFP_KSWAPD_RECLAIM;
866 huge_flags &= ~__GFP_MOVABLE;
867 huge_flags &= ~__GFP_COMP;
868 p = alloc_pages(huge_flags, HPAGE_PMD_ORDER);
869 if (!p)
870 break;
871
872 for (j = 0; j < HPAGE_PMD_NR; ++j)
873 pages[i++] = p++;
874
875 npages -= HPAGE_PMD_NR;
876 }
877 }
878#endif
879
880 first = i;
881 while (npages) {
882 p = alloc_page(gfp_flags);
883 if (!p) {
884 pr_debug("Unable to allocate page\n");
885 return -ENOMEM;
886 }
887
888 /* Swap the pages if we detect consecutive order */
889 if (i > first && pages[i - 1] == p - 1)
890 swap(p, pages[i - 1]);
891
892 pages[i++] = p;
893 --npages;
894 }
895 return 0;
896 }
897
898 count = 0;
899
900#ifdef CONFIG_TRANSPARENT_HUGEPAGE
901 if (huge && npages >= HPAGE_PMD_NR) {
902 INIT_LIST_HEAD(&plist);
903 ttm_page_pool_get_pages(huge, &plist, flags, cstate,
904 npages / HPAGE_PMD_NR,
905 HPAGE_PMD_ORDER);
906
907 list_for_each_entry(p, &plist, lru) {
908 unsigned j;
909
910 for (j = 0; j < HPAGE_PMD_NR; ++j)
911 pages[count++] = &p[j];
912 }
913 }
914#endif
915
916 INIT_LIST_HEAD(&plist);
917 r = ttm_page_pool_get_pages(pool, &plist, flags, cstate,
918 npages - count, 0);
919
920 first = count;
921 list_for_each_entry(p, &plist, lru) {
922 struct page *tmp = p;
923
924 /* Swap the pages if we detect consecutive order */
925 if (count > first && pages[count - 1] == tmp - 1)
926 swap(tmp, pages[count - 1]);
927 pages[count++] = tmp;
928 }
929
930 if (r) {
931 /* If there is any pages in the list put them back to
932 * the pool.
933 */
934 pr_debug("Failed to allocate extra pages for large request\n");
935 ttm_put_pages(pages, count, flags, cstate);
936 return r;
937 }
938
939 return 0;
940}
941
942static void ttm_page_pool_init_locked(struct ttm_page_pool *pool, gfp_t flags,
943 char *name, unsigned int order)
944{
945 spin_lock_init(&pool->lock);
946 pool->fill_lock = false;
947 INIT_LIST_HEAD(&pool->list);
948 pool->npages = pool->nfrees = 0;
949 pool->gfp_flags = flags;
950 pool->name = name;
951 pool->order = order;
952}
953
954int ttm_page_alloc_init(struct ttm_mem_global *glob, unsigned max_pages)
955{
956 int ret;
957#ifdef CONFIG_TRANSPARENT_HUGEPAGE
958 unsigned order = HPAGE_PMD_ORDER;
959#else
960 unsigned order = 0;
961#endif
962
963 WARN_ON(_manager);
964
965 pr_info("Initializing pool allocator\n");
966
967 _manager = kzalloc(sizeof(*_manager), GFP_KERNEL);
968 if (!_manager)
969 return -ENOMEM;
970
971 ttm_page_pool_init_locked(&_manager->wc_pool, GFP_HIGHUSER, "wc", 0);
972
973 ttm_page_pool_init_locked(&_manager->uc_pool, GFP_HIGHUSER, "uc", 0);
974
975 ttm_page_pool_init_locked(&_manager->wc_pool_dma32,
976 GFP_USER | GFP_DMA32, "wc dma", 0);
977
978 ttm_page_pool_init_locked(&_manager->uc_pool_dma32,
979 GFP_USER | GFP_DMA32, "uc dma", 0);
980
981 ttm_page_pool_init_locked(&_manager->wc_pool_huge,
982 (GFP_TRANSHUGE_LIGHT | __GFP_NORETRY |
983 __GFP_KSWAPD_RECLAIM) &
984 ~(__GFP_MOVABLE | __GFP_COMP),
985 "wc huge", order);
986
987 ttm_page_pool_init_locked(&_manager->uc_pool_huge,
988 (GFP_TRANSHUGE_LIGHT | __GFP_NORETRY |
989 __GFP_KSWAPD_RECLAIM) &
990 ~(__GFP_MOVABLE | __GFP_COMP)
991 , "uc huge", order);
992
993 _manager->options.max_size = max_pages;
994 _manager->options.small = SMALL_ALLOCATION;
995 _manager->options.alloc_size = NUM_PAGES_TO_ALLOC;
996
997 ret = kobject_init_and_add(&_manager->kobj, &ttm_pool_kobj_type,
998 &glob->kobj, "pool");
999 if (unlikely(ret != 0))
1000 goto error;
1001
1002 ret = ttm_pool_mm_shrink_init(_manager);
1003 if (unlikely(ret != 0))
1004 goto error;
1005 return 0;
1006
1007error:
1008 kobject_put(&_manager->kobj);
1009 _manager = NULL;
1010 return ret;
1011}
1012
1013void ttm_page_alloc_fini(void)
1014{
1015 int i;
1016
1017 pr_info("Finalizing pool allocator\n");
1018 ttm_pool_mm_shrink_fini(_manager);
1019
1020 /* OK to use static buffer since global mutex is no longer used. */
1021 for (i = 0; i < NUM_POOLS; ++i)
1022 ttm_page_pool_free(&_manager->pools[i], FREE_ALL_PAGES, true);
1023
1024 kobject_put(&_manager->kobj);
1025 _manager = NULL;
1026}
1027
1028static void
1029ttm_pool_unpopulate_helper(struct ttm_tt *ttm, unsigned mem_count_update)
1030{
1031 struct ttm_mem_global *mem_glob = ttm->bdev->glob->mem_glob;
1032 unsigned i;
1033
1034 if (mem_count_update == 0)
1035 goto put_pages;
1036
1037 for (i = 0; i < mem_count_update; ++i) {
1038 if (!ttm->pages[i])
1039 continue;
1040
1041 ttm_mem_global_free_page(mem_glob, ttm->pages[i], PAGE_SIZE);
1042 }
1043
1044put_pages:
1045 ttm_put_pages(ttm->pages, ttm->num_pages, ttm->page_flags,
1046 ttm->caching_state);
1047 ttm->state = tt_unpopulated;
1048}
1049
1050int ttm_pool_populate(struct ttm_tt *ttm, struct ttm_operation_ctx *ctx)
1051{
1052 struct ttm_mem_global *mem_glob = ttm->bdev->glob->mem_glob;
1053 unsigned i;
1054 int ret;
1055
1056 if (ttm->state != tt_unpopulated)
1057 return 0;
1058
1059 if (ttm_check_under_lowerlimit(mem_glob, ttm->num_pages, ctx))
1060 return -ENOMEM;
1061
1062 ret = ttm_get_pages(ttm->pages, ttm->num_pages, ttm->page_flags,
1063 ttm->caching_state);
1064 if (unlikely(ret != 0)) {
1065 ttm_pool_unpopulate_helper(ttm, 0);
1066 return ret;
1067 }
1068
1069 for (i = 0; i < ttm->num_pages; ++i) {
1070 ret = ttm_mem_global_alloc_page(mem_glob, ttm->pages[i],
1071 PAGE_SIZE, ctx);
1072 if (unlikely(ret != 0)) {
1073 ttm_pool_unpopulate_helper(ttm, i);
1074 return -ENOMEM;
1075 }
1076 }
1077
1078 if (unlikely(ttm->page_flags & TTM_PAGE_FLAG_SWAPPED)) {
1079 ret = ttm_tt_swapin(ttm);
1080 if (unlikely(ret != 0)) {
1081 ttm_pool_unpopulate(ttm);
1082 return ret;
1083 }
1084 }
1085
1086 ttm->state = tt_unbound;
1087 return 0;
1088}
1089EXPORT_SYMBOL(ttm_pool_populate);
1090
1091void ttm_pool_unpopulate(struct ttm_tt *ttm)
1092{
1093 ttm_pool_unpopulate_helper(ttm, ttm->num_pages);
1094}
1095EXPORT_SYMBOL(ttm_pool_unpopulate);
1096
1097int ttm_populate_and_map_pages(struct device *dev, struct ttm_dma_tt *tt,
1098 struct ttm_operation_ctx *ctx)
1099{
1100 unsigned i, j;
1101 int r;
1102
1103 r = ttm_pool_populate(&tt->ttm, ctx);
1104 if (r)
1105 return r;
1106
1107 for (i = 0; i < tt->ttm.num_pages; ++i) {
1108 struct page *p = tt->ttm.pages[i];
1109 size_t num_pages = 1;
1110
1111 for (j = i + 1; j < tt->ttm.num_pages; ++j) {
1112 if (++p != tt->ttm.pages[j])
1113 break;
1114
1115 ++num_pages;
1116 }
1117
1118 tt->dma_address[i] = dma_map_page(dev, tt->ttm.pages[i],
1119 0, num_pages * PAGE_SIZE,
1120 DMA_BIDIRECTIONAL);
1121 if (dma_mapping_error(dev, tt->dma_address[i])) {
1122 while (i--) {
1123 dma_unmap_page(dev, tt->dma_address[i],
1124 PAGE_SIZE, DMA_BIDIRECTIONAL);
1125 tt->dma_address[i] = 0;
1126 }
1127 ttm_pool_unpopulate(&tt->ttm);
1128 return -EFAULT;
1129 }
1130
1131 for (j = 1; j < num_pages; ++j) {
1132 tt->dma_address[i + 1] = tt->dma_address[i] + PAGE_SIZE;
1133 ++i;
1134 }
1135 }
1136 return 0;
1137}
1138EXPORT_SYMBOL(ttm_populate_and_map_pages);
1139
1140void ttm_unmap_and_unpopulate_pages(struct device *dev, struct ttm_dma_tt *tt)
1141{
1142 unsigned i, j;
1143
1144 for (i = 0; i < tt->ttm.num_pages;) {
1145 struct page *p = tt->ttm.pages[i];
1146 size_t num_pages = 1;
1147
1148 if (!tt->dma_address[i] || !tt->ttm.pages[i]) {
1149 ++i;
1150 continue;
1151 }
1152
1153 for (j = i + 1; j < tt->ttm.num_pages; ++j) {
1154 if (++p != tt->ttm.pages[j])
1155 break;
1156
1157 ++num_pages;
1158 }
1159
1160 dma_unmap_page(dev, tt->dma_address[i], num_pages * PAGE_SIZE,
1161 DMA_BIDIRECTIONAL);
1162
1163 i += num_pages;
1164 }
1165 ttm_pool_unpopulate(&tt->ttm);
1166}
1167EXPORT_SYMBOL(ttm_unmap_and_unpopulate_pages);
1168
1169int ttm_page_alloc_debugfs(struct seq_file *m, void *data)
1170{
1171 struct ttm_page_pool *p;
1172 unsigned i;
1173 char *h[] = {"pool", "refills", "pages freed", "size"};
1174 if (!_manager) {
1175 seq_printf(m, "No pool allocator running.\n");
1176 return 0;
1177 }
1178 seq_printf(m, "%7s %12s %13s %8s\n",
1179 h[0], h[1], h[2], h[3]);
1180 for (i = 0; i < NUM_POOLS; ++i) {
1181 p = &_manager->pools[i];
1182
1183 seq_printf(m, "%7s %12ld %13ld %8d\n",
1184 p->name, p->nrefills,
1185 p->nfrees, p->npages);
1186 }
1187 return 0;
1188}
1189EXPORT_SYMBOL(ttm_page_alloc_debugfs);
1/*
2 * Copyright (c) Red Hat Inc.
3
4 * Permission is hereby granted, free of charge, to any person obtaining a
5 * copy of this software and associated documentation files (the "Software"),
6 * to deal in the Software without restriction, including without limitation
7 * the rights to use, copy, modify, merge, publish, distribute, sub license,
8 * and/or sell copies of the Software, and to permit persons to whom the
9 * Software is furnished to do so, subject to the following conditions:
10 *
11 * The above copyright notice and this permission notice (including the
12 * next paragraph) shall be included in all copies or substantial portions
13 * of the Software.
14 *
15 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17 * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL
18 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
19 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
20 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
21 * DEALINGS IN THE SOFTWARE.
22 *
23 * Authors: Dave Airlie <airlied@redhat.com>
24 * Jerome Glisse <jglisse@redhat.com>
25 * Pauli Nieminen <suokkos@gmail.com>
26 */
27
28/* simple list based uncached page pool
29 * - Pool collects resently freed pages for reuse
30 * - Use page->lru to keep a free list
31 * - doesn't track currently in use pages
32 */
33
34#define pr_fmt(fmt) "[TTM] " fmt
35
36#include <linux/list.h>
37#include <linux/spinlock.h>
38#include <linux/highmem.h>
39#include <linux/mm_types.h>
40#include <linux/module.h>
41#include <linux/mm.h>
42#include <linux/seq_file.h> /* for seq_printf */
43#include <linux/slab.h>
44#include <linux/dma-mapping.h>
45
46#include <linux/atomic.h>
47
48#include <drm/ttm/ttm_bo_driver.h>
49#include <drm/ttm/ttm_page_alloc.h>
50
51#if IS_ENABLED(CONFIG_AGP)
52#include <asm/agp.h>
53#endif
54#ifdef CONFIG_X86
55#include <asm/set_memory.h>
56#endif
57
58#define NUM_PAGES_TO_ALLOC (PAGE_SIZE/sizeof(struct page *))
59#define SMALL_ALLOCATION 16
60#define FREE_ALL_PAGES (~0U)
61/* times are in msecs */
62#define PAGE_FREE_INTERVAL 1000
63
64/**
65 * struct ttm_page_pool - Pool to reuse recently allocated uc/wc pages.
66 *
67 * @lock: Protects the shared pool from concurrnet access. Must be used with
68 * irqsave/irqrestore variants because pool allocator maybe called from
69 * delayed work.
70 * @fill_lock: Prevent concurrent calls to fill.
71 * @list: Pool of free uc/wc pages for fast reuse.
72 * @gfp_flags: Flags to pass for alloc_page.
73 * @npages: Number of pages in pool.
74 */
75struct ttm_page_pool {
76 spinlock_t lock;
77 bool fill_lock;
78 struct list_head list;
79 gfp_t gfp_flags;
80 unsigned npages;
81 char *name;
82 unsigned long nfrees;
83 unsigned long nrefills;
84 unsigned int order;
85};
86
87/**
88 * Limits for the pool. They are handled without locks because only place where
89 * they may change is in sysfs store. They won't have immediate effect anyway
90 * so forcing serialization to access them is pointless.
91 */
92
93struct ttm_pool_opts {
94 unsigned alloc_size;
95 unsigned max_size;
96 unsigned small;
97};
98
99#define NUM_POOLS 6
100
101/**
102 * struct ttm_pool_manager - Holds memory pools for fst allocation
103 *
104 * Manager is read only object for pool code so it doesn't need locking.
105 *
106 * @free_interval: minimum number of jiffies between freeing pages from pool.
107 * @page_alloc_inited: reference counting for pool allocation.
108 * @work: Work that is used to shrink the pool. Work is only run when there is
109 * some pages to free.
110 * @small_allocation: Limit in number of pages what is small allocation.
111 *
112 * @pools: All pool objects in use.
113 **/
114struct ttm_pool_manager {
115 struct kobject kobj;
116 struct shrinker mm_shrink;
117 struct ttm_pool_opts options;
118
119 union {
120 struct ttm_page_pool pools[NUM_POOLS];
121 struct {
122 struct ttm_page_pool wc_pool;
123 struct ttm_page_pool uc_pool;
124 struct ttm_page_pool wc_pool_dma32;
125 struct ttm_page_pool uc_pool_dma32;
126 struct ttm_page_pool wc_pool_huge;
127 struct ttm_page_pool uc_pool_huge;
128 } ;
129 };
130};
131
132static struct attribute ttm_page_pool_max = {
133 .name = "pool_max_size",
134 .mode = S_IRUGO | S_IWUSR
135};
136static struct attribute ttm_page_pool_small = {
137 .name = "pool_small_allocation",
138 .mode = S_IRUGO | S_IWUSR
139};
140static struct attribute ttm_page_pool_alloc_size = {
141 .name = "pool_allocation_size",
142 .mode = S_IRUGO | S_IWUSR
143};
144
145static struct attribute *ttm_pool_attrs[] = {
146 &ttm_page_pool_max,
147 &ttm_page_pool_small,
148 &ttm_page_pool_alloc_size,
149 NULL
150};
151
152static void ttm_pool_kobj_release(struct kobject *kobj)
153{
154 struct ttm_pool_manager *m =
155 container_of(kobj, struct ttm_pool_manager, kobj);
156 kfree(m);
157}
158
159static ssize_t ttm_pool_store(struct kobject *kobj,
160 struct attribute *attr, const char *buffer, size_t size)
161{
162 struct ttm_pool_manager *m =
163 container_of(kobj, struct ttm_pool_manager, kobj);
164 int chars;
165 unsigned val;
166 chars = sscanf(buffer, "%u", &val);
167 if (chars == 0)
168 return size;
169
170 /* Convert kb to number of pages */
171 val = val / (PAGE_SIZE >> 10);
172
173 if (attr == &ttm_page_pool_max)
174 m->options.max_size = val;
175 else if (attr == &ttm_page_pool_small)
176 m->options.small = val;
177 else if (attr == &ttm_page_pool_alloc_size) {
178 if (val > NUM_PAGES_TO_ALLOC*8) {
179 pr_err("Setting allocation size to %lu is not allowed. Recommended size is %lu\n",
180 NUM_PAGES_TO_ALLOC*(PAGE_SIZE >> 7),
181 NUM_PAGES_TO_ALLOC*(PAGE_SIZE >> 10));
182 return size;
183 } else if (val > NUM_PAGES_TO_ALLOC) {
184 pr_warn("Setting allocation size to larger than %lu is not recommended\n",
185 NUM_PAGES_TO_ALLOC*(PAGE_SIZE >> 10));
186 }
187 m->options.alloc_size = val;
188 }
189
190 return size;
191}
192
193static ssize_t ttm_pool_show(struct kobject *kobj,
194 struct attribute *attr, char *buffer)
195{
196 struct ttm_pool_manager *m =
197 container_of(kobj, struct ttm_pool_manager, kobj);
198 unsigned val = 0;
199
200 if (attr == &ttm_page_pool_max)
201 val = m->options.max_size;
202 else if (attr == &ttm_page_pool_small)
203 val = m->options.small;
204 else if (attr == &ttm_page_pool_alloc_size)
205 val = m->options.alloc_size;
206
207 val = val * (PAGE_SIZE >> 10);
208
209 return snprintf(buffer, PAGE_SIZE, "%u\n", val);
210}
211
212static const struct sysfs_ops ttm_pool_sysfs_ops = {
213 .show = &ttm_pool_show,
214 .store = &ttm_pool_store,
215};
216
217static struct kobj_type ttm_pool_kobj_type = {
218 .release = &ttm_pool_kobj_release,
219 .sysfs_ops = &ttm_pool_sysfs_ops,
220 .default_attrs = ttm_pool_attrs,
221};
222
223static struct ttm_pool_manager *_manager;
224
225#ifndef CONFIG_X86
226static int set_pages_wb(struct page *page, int numpages)
227{
228#if IS_ENABLED(CONFIG_AGP)
229 int i;
230
231 for (i = 0; i < numpages; i++)
232 unmap_page_from_agp(page++);
233#endif
234 return 0;
235}
236
237static int set_pages_array_wb(struct page **pages, int addrinarray)
238{
239#if IS_ENABLED(CONFIG_AGP)
240 int i;
241
242 for (i = 0; i < addrinarray; i++)
243 unmap_page_from_agp(pages[i]);
244#endif
245 return 0;
246}
247
248static int set_pages_array_wc(struct page **pages, int addrinarray)
249{
250#if IS_ENABLED(CONFIG_AGP)
251 int i;
252
253 for (i = 0; i < addrinarray; i++)
254 map_page_into_agp(pages[i]);
255#endif
256 return 0;
257}
258
259static int set_pages_array_uc(struct page **pages, int addrinarray)
260{
261#if IS_ENABLED(CONFIG_AGP)
262 int i;
263
264 for (i = 0; i < addrinarray; i++)
265 map_page_into_agp(pages[i]);
266#endif
267 return 0;
268}
269#endif
270
271/**
272 * Select the right pool or requested caching state and ttm flags. */
273static struct ttm_page_pool *ttm_get_pool(int flags, bool huge,
274 enum ttm_caching_state cstate)
275{
276 int pool_index;
277
278 if (cstate == tt_cached)
279 return NULL;
280
281 if (cstate == tt_wc)
282 pool_index = 0x0;
283 else
284 pool_index = 0x1;
285
286 if (flags & TTM_PAGE_FLAG_DMA32) {
287 if (huge)
288 return NULL;
289 pool_index |= 0x2;
290
291 } else if (huge) {
292 pool_index |= 0x4;
293 }
294
295 return &_manager->pools[pool_index];
296}
297
298/* set memory back to wb and free the pages. */
299static void ttm_pages_put(struct page *pages[], unsigned npages,
300 unsigned int order)
301{
302 unsigned int i, pages_nr = (1 << order);
303
304 if (order == 0) {
305 if (set_pages_array_wb(pages, npages))
306 pr_err("Failed to set %d pages to wb!\n", npages);
307 }
308
309 for (i = 0; i < npages; ++i) {
310 if (order > 0) {
311 if (set_pages_wb(pages[i], pages_nr))
312 pr_err("Failed to set %d pages to wb!\n", pages_nr);
313 }
314 __free_pages(pages[i], order);
315 }
316}
317
318static void ttm_pool_update_free_locked(struct ttm_page_pool *pool,
319 unsigned freed_pages)
320{
321 pool->npages -= freed_pages;
322 pool->nfrees += freed_pages;
323}
324
325/**
326 * Free pages from pool.
327 *
328 * To prevent hogging the ttm_swap process we only free NUM_PAGES_TO_ALLOC
329 * number of pages in one go.
330 *
331 * @pool: to free the pages from
332 * @free_all: If set to true will free all pages in pool
333 * @use_static: Safe to use static buffer
334 **/
335static int ttm_page_pool_free(struct ttm_page_pool *pool, unsigned nr_free,
336 bool use_static)
337{
338 static struct page *static_buf[NUM_PAGES_TO_ALLOC];
339 unsigned long irq_flags;
340 struct page *p;
341 struct page **pages_to_free;
342 unsigned freed_pages = 0,
343 npages_to_free = nr_free;
344
345 if (NUM_PAGES_TO_ALLOC < nr_free)
346 npages_to_free = NUM_PAGES_TO_ALLOC;
347
348 if (use_static)
349 pages_to_free = static_buf;
350 else
351 pages_to_free = kmalloc(npages_to_free * sizeof(struct page *),
352 GFP_KERNEL);
353 if (!pages_to_free) {
354 pr_debug("Failed to allocate memory for pool free operation\n");
355 return 0;
356 }
357
358restart:
359 spin_lock_irqsave(&pool->lock, irq_flags);
360
361 list_for_each_entry_reverse(p, &pool->list, lru) {
362 if (freed_pages >= npages_to_free)
363 break;
364
365 pages_to_free[freed_pages++] = p;
366 /* We can only remove NUM_PAGES_TO_ALLOC at a time. */
367 if (freed_pages >= NUM_PAGES_TO_ALLOC) {
368 /* remove range of pages from the pool */
369 __list_del(p->lru.prev, &pool->list);
370
371 ttm_pool_update_free_locked(pool, freed_pages);
372 /**
373 * Because changing page caching is costly
374 * we unlock the pool to prevent stalling.
375 */
376 spin_unlock_irqrestore(&pool->lock, irq_flags);
377
378 ttm_pages_put(pages_to_free, freed_pages, pool->order);
379 if (likely(nr_free != FREE_ALL_PAGES))
380 nr_free -= freed_pages;
381
382 if (NUM_PAGES_TO_ALLOC >= nr_free)
383 npages_to_free = nr_free;
384 else
385 npages_to_free = NUM_PAGES_TO_ALLOC;
386
387 freed_pages = 0;
388
389 /* free all so restart the processing */
390 if (nr_free)
391 goto restart;
392
393 /* Not allowed to fall through or break because
394 * following context is inside spinlock while we are
395 * outside here.
396 */
397 goto out;
398
399 }
400 }
401
402 /* remove range of pages from the pool */
403 if (freed_pages) {
404 __list_del(&p->lru, &pool->list);
405
406 ttm_pool_update_free_locked(pool, freed_pages);
407 nr_free -= freed_pages;
408 }
409
410 spin_unlock_irqrestore(&pool->lock, irq_flags);
411
412 if (freed_pages)
413 ttm_pages_put(pages_to_free, freed_pages, pool->order);
414out:
415 if (pages_to_free != static_buf)
416 kfree(pages_to_free);
417 return nr_free;
418}
419
420/**
421 * Callback for mm to request pool to reduce number of page held.
422 *
423 * XXX: (dchinner) Deadlock warning!
424 *
425 * This code is crying out for a shrinker per pool....
426 */
427static unsigned long
428ttm_pool_shrink_scan(struct shrinker *shrink, struct shrink_control *sc)
429{
430 static DEFINE_MUTEX(lock);
431 static unsigned start_pool;
432 unsigned i;
433 unsigned pool_offset;
434 struct ttm_page_pool *pool;
435 int shrink_pages = sc->nr_to_scan;
436 unsigned long freed = 0;
437 unsigned int nr_free_pool;
438
439 if (!mutex_trylock(&lock))
440 return SHRINK_STOP;
441 pool_offset = ++start_pool % NUM_POOLS;
442 /* select start pool in round robin fashion */
443 for (i = 0; i < NUM_POOLS; ++i) {
444 unsigned nr_free = shrink_pages;
445 unsigned page_nr;
446
447 if (shrink_pages == 0)
448 break;
449
450 pool = &_manager->pools[(i + pool_offset)%NUM_POOLS];
451 page_nr = (1 << pool->order);
452 /* OK to use static buffer since global mutex is held. */
453 nr_free_pool = roundup(nr_free, page_nr) >> pool->order;
454 shrink_pages = ttm_page_pool_free(pool, nr_free_pool, true);
455 freed += (nr_free_pool - shrink_pages) << pool->order;
456 if (freed >= sc->nr_to_scan)
457 break;
458 shrink_pages <<= pool->order;
459 }
460 mutex_unlock(&lock);
461 return freed;
462}
463
464
465static unsigned long
466ttm_pool_shrink_count(struct shrinker *shrink, struct shrink_control *sc)
467{
468 unsigned i;
469 unsigned long count = 0;
470 struct ttm_page_pool *pool;
471
472 for (i = 0; i < NUM_POOLS; ++i) {
473 pool = &_manager->pools[i];
474 count += (pool->npages << pool->order);
475 }
476
477 return count;
478}
479
480static int ttm_pool_mm_shrink_init(struct ttm_pool_manager *manager)
481{
482 manager->mm_shrink.count_objects = ttm_pool_shrink_count;
483 manager->mm_shrink.scan_objects = ttm_pool_shrink_scan;
484 manager->mm_shrink.seeks = 1;
485 return register_shrinker(&manager->mm_shrink);
486}
487
488static void ttm_pool_mm_shrink_fini(struct ttm_pool_manager *manager)
489{
490 unregister_shrinker(&manager->mm_shrink);
491}
492
493static int ttm_set_pages_caching(struct page **pages,
494 enum ttm_caching_state cstate, unsigned cpages)
495{
496 int r = 0;
497 /* Set page caching */
498 switch (cstate) {
499 case tt_uncached:
500 r = set_pages_array_uc(pages, cpages);
501 if (r)
502 pr_err("Failed to set %d pages to uc!\n", cpages);
503 break;
504 case tt_wc:
505 r = set_pages_array_wc(pages, cpages);
506 if (r)
507 pr_err("Failed to set %d pages to wc!\n", cpages);
508 break;
509 default:
510 break;
511 }
512 return r;
513}
514
515/**
516 * Free pages the pages that failed to change the caching state. If there is
517 * any pages that have changed their caching state already put them to the
518 * pool.
519 */
520static void ttm_handle_caching_state_failure(struct list_head *pages,
521 int ttm_flags, enum ttm_caching_state cstate,
522 struct page **failed_pages, unsigned cpages)
523{
524 unsigned i;
525 /* Failed pages have to be freed */
526 for (i = 0; i < cpages; ++i) {
527 list_del(&failed_pages[i]->lru);
528 __free_page(failed_pages[i]);
529 }
530}
531
532/**
533 * Allocate new pages with correct caching.
534 *
535 * This function is reentrant if caller updates count depending on number of
536 * pages returned in pages array.
537 */
538static int ttm_alloc_new_pages(struct list_head *pages, gfp_t gfp_flags,
539 int ttm_flags, enum ttm_caching_state cstate,
540 unsigned count, unsigned order)
541{
542 struct page **caching_array;
543 struct page *p;
544 int r = 0;
545 unsigned i, j, cpages;
546 unsigned npages = 1 << order;
547 unsigned max_cpages = min(count << order, (unsigned)NUM_PAGES_TO_ALLOC);
548
549 /* allocate array for page caching change */
550 caching_array = kmalloc(max_cpages*sizeof(struct page *), GFP_KERNEL);
551
552 if (!caching_array) {
553 pr_debug("Unable to allocate table for new pages\n");
554 return -ENOMEM;
555 }
556
557 for (i = 0, cpages = 0; i < count; ++i) {
558 p = alloc_pages(gfp_flags, order);
559
560 if (!p) {
561 pr_debug("Unable to get page %u\n", i);
562
563 /* store already allocated pages in the pool after
564 * setting the caching state */
565 if (cpages) {
566 r = ttm_set_pages_caching(caching_array,
567 cstate, cpages);
568 if (r)
569 ttm_handle_caching_state_failure(pages,
570 ttm_flags, cstate,
571 caching_array, cpages);
572 }
573 r = -ENOMEM;
574 goto out;
575 }
576
577 list_add(&p->lru, pages);
578
579#ifdef CONFIG_HIGHMEM
580 /* gfp flags of highmem page should never be dma32 so we
581 * we should be fine in such case
582 */
583 if (PageHighMem(p))
584 continue;
585
586#endif
587 for (j = 0; j < npages; ++j) {
588 caching_array[cpages++] = p++;
589 if (cpages == max_cpages) {
590
591 r = ttm_set_pages_caching(caching_array,
592 cstate, cpages);
593 if (r) {
594 ttm_handle_caching_state_failure(pages,
595 ttm_flags, cstate,
596 caching_array, cpages);
597 goto out;
598 }
599 cpages = 0;
600 }
601 }
602 }
603
604 if (cpages) {
605 r = ttm_set_pages_caching(caching_array, cstate, cpages);
606 if (r)
607 ttm_handle_caching_state_failure(pages,
608 ttm_flags, cstate,
609 caching_array, cpages);
610 }
611out:
612 kfree(caching_array);
613
614 return r;
615}
616
617/**
618 * Fill the given pool if there aren't enough pages and the requested number of
619 * pages is small.
620 */
621static void ttm_page_pool_fill_locked(struct ttm_page_pool *pool, int ttm_flags,
622 enum ttm_caching_state cstate,
623 unsigned count, unsigned long *irq_flags)
624{
625 struct page *p;
626 int r;
627 unsigned cpages = 0;
628 /**
629 * Only allow one pool fill operation at a time.
630 * If pool doesn't have enough pages for the allocation new pages are
631 * allocated from outside of pool.
632 */
633 if (pool->fill_lock)
634 return;
635
636 pool->fill_lock = true;
637
638 /* If allocation request is small and there are not enough
639 * pages in a pool we fill the pool up first. */
640 if (count < _manager->options.small
641 && count > pool->npages) {
642 struct list_head new_pages;
643 unsigned alloc_size = _manager->options.alloc_size;
644
645 /**
646 * Can't change page caching if in irqsave context. We have to
647 * drop the pool->lock.
648 */
649 spin_unlock_irqrestore(&pool->lock, *irq_flags);
650
651 INIT_LIST_HEAD(&new_pages);
652 r = ttm_alloc_new_pages(&new_pages, pool->gfp_flags, ttm_flags,
653 cstate, alloc_size, 0);
654 spin_lock_irqsave(&pool->lock, *irq_flags);
655
656 if (!r) {
657 list_splice(&new_pages, &pool->list);
658 ++pool->nrefills;
659 pool->npages += alloc_size;
660 } else {
661 pr_debug("Failed to fill pool (%p)\n", pool);
662 /* If we have any pages left put them to the pool. */
663 list_for_each_entry(p, &new_pages, lru) {
664 ++cpages;
665 }
666 list_splice(&new_pages, &pool->list);
667 pool->npages += cpages;
668 }
669
670 }
671 pool->fill_lock = false;
672}
673
674/**
675 * Allocate pages from the pool and put them on the return list.
676 *
677 * @return zero for success or negative error code.
678 */
679static int ttm_page_pool_get_pages(struct ttm_page_pool *pool,
680 struct list_head *pages,
681 int ttm_flags,
682 enum ttm_caching_state cstate,
683 unsigned count, unsigned order)
684{
685 unsigned long irq_flags;
686 struct list_head *p;
687 unsigned i;
688 int r = 0;
689
690 spin_lock_irqsave(&pool->lock, irq_flags);
691 if (!order)
692 ttm_page_pool_fill_locked(pool, ttm_flags, cstate, count,
693 &irq_flags);
694
695 if (count >= pool->npages) {
696 /* take all pages from the pool */
697 list_splice_init(&pool->list, pages);
698 count -= pool->npages;
699 pool->npages = 0;
700 goto out;
701 }
702 /* find the last pages to include for requested number of pages. Split
703 * pool to begin and halve it to reduce search space. */
704 if (count <= pool->npages/2) {
705 i = 0;
706 list_for_each(p, &pool->list) {
707 if (++i == count)
708 break;
709 }
710 } else {
711 i = pool->npages + 1;
712 list_for_each_prev(p, &pool->list) {
713 if (--i == count)
714 break;
715 }
716 }
717 /* Cut 'count' number of pages from the pool */
718 list_cut_position(pages, &pool->list, p);
719 pool->npages -= count;
720 count = 0;
721out:
722 spin_unlock_irqrestore(&pool->lock, irq_flags);
723
724 /* clear the pages coming from the pool if requested */
725 if (ttm_flags & TTM_PAGE_FLAG_ZERO_ALLOC) {
726 struct page *page;
727
728 list_for_each_entry(page, pages, lru) {
729 if (PageHighMem(page))
730 clear_highpage(page);
731 else
732 clear_page(page_address(page));
733 }
734 }
735
736 /* If pool didn't have enough pages allocate new one. */
737 if (count) {
738 gfp_t gfp_flags = pool->gfp_flags;
739
740 /* set zero flag for page allocation if required */
741 if (ttm_flags & TTM_PAGE_FLAG_ZERO_ALLOC)
742 gfp_flags |= __GFP_ZERO;
743
744 if (ttm_flags & TTM_PAGE_FLAG_NO_RETRY)
745 gfp_flags |= __GFP_RETRY_MAYFAIL;
746
747 /* ttm_alloc_new_pages doesn't reference pool so we can run
748 * multiple requests in parallel.
749 **/
750 r = ttm_alloc_new_pages(pages, gfp_flags, ttm_flags, cstate,
751 count, order);
752 }
753
754 return r;
755}
756
757/* Put all pages in pages list to correct pool to wait for reuse */
758static void ttm_put_pages(struct page **pages, unsigned npages, int flags,
759 enum ttm_caching_state cstate)
760{
761 struct ttm_page_pool *pool = ttm_get_pool(flags, false, cstate);
762#ifdef CONFIG_TRANSPARENT_HUGEPAGE
763 struct ttm_page_pool *huge = ttm_get_pool(flags, true, cstate);
764#endif
765 unsigned long irq_flags;
766 unsigned i;
767
768 if (pool == NULL) {
769 /* No pool for this memory type so free the pages */
770 i = 0;
771 while (i < npages) {
772#ifdef CONFIG_TRANSPARENT_HUGEPAGE
773 struct page *p = pages[i];
774#endif
775 unsigned order = 0, j;
776
777 if (!pages[i]) {
778 ++i;
779 continue;
780 }
781
782#ifdef CONFIG_TRANSPARENT_HUGEPAGE
783 if (!(flags & TTM_PAGE_FLAG_DMA32)) {
784 for (j = 0; j < HPAGE_PMD_NR; ++j)
785 if (p++ != pages[i + j])
786 break;
787
788 if (j == HPAGE_PMD_NR)
789 order = HPAGE_PMD_ORDER;
790 }
791#endif
792
793 if (page_count(pages[i]) != 1)
794 pr_err("Erroneous page count. Leaking pages.\n");
795 __free_pages(pages[i], order);
796
797 j = 1 << order;
798 while (j) {
799 pages[i++] = NULL;
800 --j;
801 }
802 }
803 return;
804 }
805
806 i = 0;
807#ifdef CONFIG_TRANSPARENT_HUGEPAGE
808 if (huge) {
809 unsigned max_size, n2free;
810
811 spin_lock_irqsave(&huge->lock, irq_flags);
812 while (i < npages) {
813 struct page *p = pages[i];
814 unsigned j;
815
816 if (!p)
817 break;
818
819 for (j = 0; j < HPAGE_PMD_NR; ++j)
820 if (p++ != pages[i + j])
821 break;
822
823 if (j != HPAGE_PMD_NR)
824 break;
825
826 list_add_tail(&pages[i]->lru, &huge->list);
827
828 for (j = 0; j < HPAGE_PMD_NR; ++j)
829 pages[i++] = NULL;
830 huge->npages++;
831 }
832
833 /* Check that we don't go over the pool limit */
834 max_size = _manager->options.max_size;
835 max_size /= HPAGE_PMD_NR;
836 if (huge->npages > max_size)
837 n2free = huge->npages - max_size;
838 else
839 n2free = 0;
840 spin_unlock_irqrestore(&huge->lock, irq_flags);
841 if (n2free)
842 ttm_page_pool_free(huge, n2free, false);
843 }
844#endif
845
846 spin_lock_irqsave(&pool->lock, irq_flags);
847 while (i < npages) {
848 if (pages[i]) {
849 if (page_count(pages[i]) != 1)
850 pr_err("Erroneous page count. Leaking pages.\n");
851 list_add_tail(&pages[i]->lru, &pool->list);
852 pages[i] = NULL;
853 pool->npages++;
854 }
855 ++i;
856 }
857 /* Check that we don't go over the pool limit */
858 npages = 0;
859 if (pool->npages > _manager->options.max_size) {
860 npages = pool->npages - _manager->options.max_size;
861 /* free at least NUM_PAGES_TO_ALLOC number of pages
862 * to reduce calls to set_memory_wb */
863 if (npages < NUM_PAGES_TO_ALLOC)
864 npages = NUM_PAGES_TO_ALLOC;
865 }
866 spin_unlock_irqrestore(&pool->lock, irq_flags);
867 if (npages)
868 ttm_page_pool_free(pool, npages, false);
869}
870
871/*
872 * On success pages list will hold count number of correctly
873 * cached pages.
874 */
875static int ttm_get_pages(struct page **pages, unsigned npages, int flags,
876 enum ttm_caching_state cstate)
877{
878 struct ttm_page_pool *pool = ttm_get_pool(flags, false, cstate);
879#ifdef CONFIG_TRANSPARENT_HUGEPAGE
880 struct ttm_page_pool *huge = ttm_get_pool(flags, true, cstate);
881#endif
882 struct list_head plist;
883 struct page *p = NULL;
884 unsigned count, first;
885 int r;
886
887 /* No pool for cached pages */
888 if (pool == NULL) {
889 gfp_t gfp_flags = GFP_USER;
890 unsigned i;
891#ifdef CONFIG_TRANSPARENT_HUGEPAGE
892 unsigned j;
893#endif
894
895 /* set zero flag for page allocation if required */
896 if (flags & TTM_PAGE_FLAG_ZERO_ALLOC)
897 gfp_flags |= __GFP_ZERO;
898
899 if (flags & TTM_PAGE_FLAG_NO_RETRY)
900 gfp_flags |= __GFP_RETRY_MAYFAIL;
901
902 if (flags & TTM_PAGE_FLAG_DMA32)
903 gfp_flags |= GFP_DMA32;
904 else
905 gfp_flags |= GFP_HIGHUSER;
906
907 i = 0;
908#ifdef CONFIG_TRANSPARENT_HUGEPAGE
909 if (!(gfp_flags & GFP_DMA32)) {
910 while (npages >= HPAGE_PMD_NR) {
911 gfp_t huge_flags = gfp_flags;
912
913 huge_flags |= GFP_TRANSHUGE_LIGHT | __GFP_NORETRY |
914 __GFP_KSWAPD_RECLAIM;
915 huge_flags &= ~__GFP_MOVABLE;
916 huge_flags &= ~__GFP_COMP;
917 p = alloc_pages(huge_flags, HPAGE_PMD_ORDER);
918 if (!p)
919 break;
920
921 for (j = 0; j < HPAGE_PMD_NR; ++j)
922 pages[i++] = p++;
923
924 npages -= HPAGE_PMD_NR;
925 }
926 }
927#endif
928
929 first = i;
930 while (npages) {
931 p = alloc_page(gfp_flags);
932 if (!p) {
933 pr_debug("Unable to allocate page\n");
934 return -ENOMEM;
935 }
936
937 /* Swap the pages if we detect consecutive order */
938 if (i > first && pages[i - 1] == p - 1)
939 swap(p, pages[i - 1]);
940
941 pages[i++] = p;
942 --npages;
943 }
944 return 0;
945 }
946
947 count = 0;
948
949#ifdef CONFIG_TRANSPARENT_HUGEPAGE
950 if (huge && npages >= HPAGE_PMD_NR) {
951 INIT_LIST_HEAD(&plist);
952 ttm_page_pool_get_pages(huge, &plist, flags, cstate,
953 npages / HPAGE_PMD_NR,
954 HPAGE_PMD_ORDER);
955
956 list_for_each_entry(p, &plist, lru) {
957 unsigned j;
958
959 for (j = 0; j < HPAGE_PMD_NR; ++j)
960 pages[count++] = &p[j];
961 }
962 }
963#endif
964
965 INIT_LIST_HEAD(&plist);
966 r = ttm_page_pool_get_pages(pool, &plist, flags, cstate,
967 npages - count, 0);
968
969 first = count;
970 list_for_each_entry(p, &plist, lru) {
971 struct page *tmp = p;
972
973 /* Swap the pages if we detect consecutive order */
974 if (count > first && pages[count - 1] == tmp - 1)
975 swap(tmp, pages[count - 1]);
976 pages[count++] = tmp;
977 }
978
979 if (r) {
980 /* If there is any pages in the list put them back to
981 * the pool.
982 */
983 pr_debug("Failed to allocate extra pages for large request\n");
984 ttm_put_pages(pages, count, flags, cstate);
985 return r;
986 }
987
988 return 0;
989}
990
991static void ttm_page_pool_init_locked(struct ttm_page_pool *pool, gfp_t flags,
992 char *name, unsigned int order)
993{
994 spin_lock_init(&pool->lock);
995 pool->fill_lock = false;
996 INIT_LIST_HEAD(&pool->list);
997 pool->npages = pool->nfrees = 0;
998 pool->gfp_flags = flags;
999 pool->name = name;
1000 pool->order = order;
1001}
1002
1003int ttm_page_alloc_init(struct ttm_mem_global *glob, unsigned max_pages)
1004{
1005 int ret;
1006#ifdef CONFIG_TRANSPARENT_HUGEPAGE
1007 unsigned order = HPAGE_PMD_ORDER;
1008#else
1009 unsigned order = 0;
1010#endif
1011
1012 WARN_ON(_manager);
1013
1014 pr_info("Initializing pool allocator\n");
1015
1016 _manager = kzalloc(sizeof(*_manager), GFP_KERNEL);
1017 if (!_manager)
1018 return -ENOMEM;
1019
1020 ttm_page_pool_init_locked(&_manager->wc_pool, GFP_HIGHUSER, "wc", 0);
1021
1022 ttm_page_pool_init_locked(&_manager->uc_pool, GFP_HIGHUSER, "uc", 0);
1023
1024 ttm_page_pool_init_locked(&_manager->wc_pool_dma32,
1025 GFP_USER | GFP_DMA32, "wc dma", 0);
1026
1027 ttm_page_pool_init_locked(&_manager->uc_pool_dma32,
1028 GFP_USER | GFP_DMA32, "uc dma", 0);
1029
1030 ttm_page_pool_init_locked(&_manager->wc_pool_huge,
1031 (GFP_TRANSHUGE_LIGHT | __GFP_NORETRY |
1032 __GFP_KSWAPD_RECLAIM) &
1033 ~(__GFP_MOVABLE | __GFP_COMP),
1034 "wc huge", order);
1035
1036 ttm_page_pool_init_locked(&_manager->uc_pool_huge,
1037 (GFP_TRANSHUGE_LIGHT | __GFP_NORETRY |
1038 __GFP_KSWAPD_RECLAIM) &
1039 ~(__GFP_MOVABLE | __GFP_COMP)
1040 , "uc huge", order);
1041
1042 _manager->options.max_size = max_pages;
1043 _manager->options.small = SMALL_ALLOCATION;
1044 _manager->options.alloc_size = NUM_PAGES_TO_ALLOC;
1045
1046 ret = kobject_init_and_add(&_manager->kobj, &ttm_pool_kobj_type,
1047 &glob->kobj, "pool");
1048 if (unlikely(ret != 0))
1049 goto error;
1050
1051 ret = ttm_pool_mm_shrink_init(_manager);
1052 if (unlikely(ret != 0))
1053 goto error;
1054 return 0;
1055
1056error:
1057 kobject_put(&_manager->kobj);
1058 _manager = NULL;
1059 return ret;
1060}
1061
1062void ttm_page_alloc_fini(void)
1063{
1064 int i;
1065
1066 pr_info("Finalizing pool allocator\n");
1067 ttm_pool_mm_shrink_fini(_manager);
1068
1069 /* OK to use static buffer since global mutex is no longer used. */
1070 for (i = 0; i < NUM_POOLS; ++i)
1071 ttm_page_pool_free(&_manager->pools[i], FREE_ALL_PAGES, true);
1072
1073 kobject_put(&_manager->kobj);
1074 _manager = NULL;
1075}
1076
1077static void
1078ttm_pool_unpopulate_helper(struct ttm_tt *ttm, unsigned mem_count_update)
1079{
1080 struct ttm_mem_global *mem_glob = ttm->bdev->glob->mem_glob;
1081 unsigned i;
1082
1083 if (mem_count_update == 0)
1084 goto put_pages;
1085
1086 for (i = 0; i < mem_count_update; ++i) {
1087 if (!ttm->pages[i])
1088 continue;
1089
1090 ttm_mem_global_free_page(mem_glob, ttm->pages[i], PAGE_SIZE);
1091 }
1092
1093put_pages:
1094 ttm_put_pages(ttm->pages, ttm->num_pages, ttm->page_flags,
1095 ttm->caching_state);
1096 ttm->state = tt_unpopulated;
1097}
1098
1099int ttm_pool_populate(struct ttm_tt *ttm, struct ttm_operation_ctx *ctx)
1100{
1101 struct ttm_mem_global *mem_glob = ttm->bdev->glob->mem_glob;
1102 unsigned i;
1103 int ret;
1104
1105 if (ttm->state != tt_unpopulated)
1106 return 0;
1107
1108 if (ttm_check_under_lowerlimit(mem_glob, ttm->num_pages, ctx))
1109 return -ENOMEM;
1110
1111 ret = ttm_get_pages(ttm->pages, ttm->num_pages, ttm->page_flags,
1112 ttm->caching_state);
1113 if (unlikely(ret != 0)) {
1114 ttm_pool_unpopulate_helper(ttm, 0);
1115 return ret;
1116 }
1117
1118 for (i = 0; i < ttm->num_pages; ++i) {
1119 ret = ttm_mem_global_alloc_page(mem_glob, ttm->pages[i],
1120 PAGE_SIZE, ctx);
1121 if (unlikely(ret != 0)) {
1122 ttm_pool_unpopulate_helper(ttm, i);
1123 return -ENOMEM;
1124 }
1125 }
1126
1127 if (unlikely(ttm->page_flags & TTM_PAGE_FLAG_SWAPPED)) {
1128 ret = ttm_tt_swapin(ttm);
1129 if (unlikely(ret != 0)) {
1130 ttm_pool_unpopulate(ttm);
1131 return ret;
1132 }
1133 }
1134
1135 ttm->state = tt_unbound;
1136 return 0;
1137}
1138EXPORT_SYMBOL(ttm_pool_populate);
1139
1140void ttm_pool_unpopulate(struct ttm_tt *ttm)
1141{
1142 ttm_pool_unpopulate_helper(ttm, ttm->num_pages);
1143}
1144EXPORT_SYMBOL(ttm_pool_unpopulate);
1145
1146int ttm_populate_and_map_pages(struct device *dev, struct ttm_dma_tt *tt,
1147 struct ttm_operation_ctx *ctx)
1148{
1149 unsigned i, j;
1150 int r;
1151
1152 r = ttm_pool_populate(&tt->ttm, ctx);
1153 if (r)
1154 return r;
1155
1156 for (i = 0; i < tt->ttm.num_pages; ++i) {
1157 struct page *p = tt->ttm.pages[i];
1158 size_t num_pages = 1;
1159
1160 for (j = i + 1; j < tt->ttm.num_pages; ++j) {
1161 if (++p != tt->ttm.pages[j])
1162 break;
1163
1164 ++num_pages;
1165 }
1166
1167 tt->dma_address[i] = dma_map_page(dev, tt->ttm.pages[i],
1168 0, num_pages * PAGE_SIZE,
1169 DMA_BIDIRECTIONAL);
1170 if (dma_mapping_error(dev, tt->dma_address[i])) {
1171 while (i--) {
1172 dma_unmap_page(dev, tt->dma_address[i],
1173 PAGE_SIZE, DMA_BIDIRECTIONAL);
1174 tt->dma_address[i] = 0;
1175 }
1176 ttm_pool_unpopulate(&tt->ttm);
1177 return -EFAULT;
1178 }
1179
1180 for (j = 1; j < num_pages; ++j) {
1181 tt->dma_address[i + 1] = tt->dma_address[i] + PAGE_SIZE;
1182 ++i;
1183 }
1184 }
1185 return 0;
1186}
1187EXPORT_SYMBOL(ttm_populate_and_map_pages);
1188
1189void ttm_unmap_and_unpopulate_pages(struct device *dev, struct ttm_dma_tt *tt)
1190{
1191 unsigned i, j;
1192
1193 for (i = 0; i < tt->ttm.num_pages;) {
1194 struct page *p = tt->ttm.pages[i];
1195 size_t num_pages = 1;
1196
1197 if (!tt->dma_address[i] || !tt->ttm.pages[i]) {
1198 ++i;
1199 continue;
1200 }
1201
1202 for (j = i + 1; j < tt->ttm.num_pages; ++j) {
1203 if (++p != tt->ttm.pages[j])
1204 break;
1205
1206 ++num_pages;
1207 }
1208
1209 dma_unmap_page(dev, tt->dma_address[i], num_pages * PAGE_SIZE,
1210 DMA_BIDIRECTIONAL);
1211
1212 i += num_pages;
1213 }
1214 ttm_pool_unpopulate(&tt->ttm);
1215}
1216EXPORT_SYMBOL(ttm_unmap_and_unpopulate_pages);
1217
1218int ttm_page_alloc_debugfs(struct seq_file *m, void *data)
1219{
1220 struct ttm_page_pool *p;
1221 unsigned i;
1222 char *h[] = {"pool", "refills", "pages freed", "size"};
1223 if (!_manager) {
1224 seq_printf(m, "No pool allocator running.\n");
1225 return 0;
1226 }
1227 seq_printf(m, "%7s %12s %13s %8s\n",
1228 h[0], h[1], h[2], h[3]);
1229 for (i = 0; i < NUM_POOLS; ++i) {
1230 p = &_manager->pools[i];
1231
1232 seq_printf(m, "%7s %12ld %13ld %8d\n",
1233 p->name, p->nrefills,
1234 p->nfrees, p->npages);
1235 }
1236 return 0;
1237}
1238EXPORT_SYMBOL(ttm_page_alloc_debugfs);