2 * Copyright (c) Red Hat Inc.
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:
11 * The above copyright notice and this permission notice (including the
12 * next paragraph) shall be included in all copies or substantial portions
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.
23 * Authors: Dave Airlie <airlied@redhat.com>
24 * Jerome Glisse <jglisse@redhat.com>
25 * Pauli Nieminen <suokkos@gmail.com>
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
34 #define pr_fmt(fmt) "[TTM] " fmt
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>
42 #include <linux/seq_file.h> /* for seq_printf */
43 #include <linux/slab.h>
44 #include <linux/dma-mapping.h>
46 #include <linux/atomic.h>
48 #include <drm/ttm/ttm_bo_driver.h>
49 #include <drm/ttm/ttm_page_alloc.h>
51 #if IS_ENABLED(CONFIG_AGP)
55 #include <asm/set_memory.h>
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
65 * struct ttm_page_pool - Pool to reuse recently allocated uc/wc pages.
67 * @lock: Protects the shared pool from concurrnet access. Must be used with
68 * irqsave/irqrestore variants because pool allocator maybe called from
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.
75 struct ttm_page_pool
{
78 struct list_head list
;
83 unsigned long nrefills
;
87 * Limits for the pool. They are handled without locks because only place where
88 * they may change is in sysfs store. They won't have immediate effect anyway
89 * so forcing serialization to access them is pointless.
92 struct ttm_pool_opts
{
101 * struct ttm_pool_manager - Holds memory pools for fst allocation
103 * Manager is read only object for pool code so it doesn't need locking.
105 * @free_interval: minimum number of jiffies between freeing pages from pool.
106 * @page_alloc_inited: reference counting for pool allocation.
107 * @work: Work that is used to shrink the pool. Work is only run when there is
108 * some pages to free.
109 * @small_allocation: Limit in number of pages what is small allocation.
111 * @pools: All pool objects in use.
113 struct ttm_pool_manager
{
115 struct shrinker mm_shrink
;
116 struct ttm_pool_opts options
;
119 struct ttm_page_pool pools
[NUM_POOLS
];
121 struct ttm_page_pool wc_pool
;
122 struct ttm_page_pool uc_pool
;
123 struct ttm_page_pool wc_pool_dma32
;
124 struct ttm_page_pool uc_pool_dma32
;
125 struct ttm_page_pool wc_pool_huge
;
126 struct ttm_page_pool uc_pool_huge
;
131 static struct attribute ttm_page_pool_max
= {
132 .name
= "pool_max_size",
133 .mode
= S_IRUGO
| S_IWUSR
135 static struct attribute ttm_page_pool_small
= {
136 .name
= "pool_small_allocation",
137 .mode
= S_IRUGO
| S_IWUSR
139 static struct attribute ttm_page_pool_alloc_size
= {
140 .name
= "pool_allocation_size",
141 .mode
= S_IRUGO
| S_IWUSR
144 static struct attribute
*ttm_pool_attrs
[] = {
146 &ttm_page_pool_small
,
147 &ttm_page_pool_alloc_size
,
151 static void ttm_pool_kobj_release(struct kobject
*kobj
)
153 struct ttm_pool_manager
*m
=
154 container_of(kobj
, struct ttm_pool_manager
, kobj
);
158 static ssize_t
ttm_pool_store(struct kobject
*kobj
,
159 struct attribute
*attr
, const char *buffer
, size_t size
)
161 struct ttm_pool_manager
*m
=
162 container_of(kobj
, struct ttm_pool_manager
, kobj
);
165 chars
= sscanf(buffer
, "%u", &val
);
169 /* Convert kb to number of pages */
170 val
= val
/ (PAGE_SIZE
>> 10);
172 if (attr
== &ttm_page_pool_max
)
173 m
->options
.max_size
= val
;
174 else if (attr
== &ttm_page_pool_small
)
175 m
->options
.small
= val
;
176 else if (attr
== &ttm_page_pool_alloc_size
) {
177 if (val
> NUM_PAGES_TO_ALLOC
*8) {
178 pr_err("Setting allocation size to %lu is not allowed. Recommended size is %lu\n",
179 NUM_PAGES_TO_ALLOC
*(PAGE_SIZE
>> 7),
180 NUM_PAGES_TO_ALLOC
*(PAGE_SIZE
>> 10));
182 } else if (val
> NUM_PAGES_TO_ALLOC
) {
183 pr_warn("Setting allocation size to larger than %lu is not recommended\n",
184 NUM_PAGES_TO_ALLOC
*(PAGE_SIZE
>> 10));
186 m
->options
.alloc_size
= val
;
192 static ssize_t
ttm_pool_show(struct kobject
*kobj
,
193 struct attribute
*attr
, char *buffer
)
195 struct ttm_pool_manager
*m
=
196 container_of(kobj
, struct ttm_pool_manager
, kobj
);
199 if (attr
== &ttm_page_pool_max
)
200 val
= m
->options
.max_size
;
201 else if (attr
== &ttm_page_pool_small
)
202 val
= m
->options
.small
;
203 else if (attr
== &ttm_page_pool_alloc_size
)
204 val
= m
->options
.alloc_size
;
206 val
= val
* (PAGE_SIZE
>> 10);
208 return snprintf(buffer
, PAGE_SIZE
, "%u\n", val
);
211 static const struct sysfs_ops ttm_pool_sysfs_ops
= {
212 .show
= &ttm_pool_show
,
213 .store
= &ttm_pool_store
,
216 static struct kobj_type ttm_pool_kobj_type
= {
217 .release
= &ttm_pool_kobj_release
,
218 .sysfs_ops
= &ttm_pool_sysfs_ops
,
219 .default_attrs
= ttm_pool_attrs
,
222 static struct ttm_pool_manager
*_manager
;
225 static int set_pages_array_wb(struct page
**pages
, int addrinarray
)
227 #if IS_ENABLED(CONFIG_AGP)
230 for (i
= 0; i
< addrinarray
; i
++)
231 unmap_page_from_agp(pages
[i
]);
236 static int set_pages_array_wc(struct page
**pages
, int addrinarray
)
238 #if IS_ENABLED(CONFIG_AGP)
241 for (i
= 0; i
< addrinarray
; i
++)
242 map_page_into_agp(pages
[i
]);
247 static int set_pages_array_uc(struct page
**pages
, int addrinarray
)
249 #if IS_ENABLED(CONFIG_AGP)
252 for (i
= 0; i
< addrinarray
; i
++)
253 map_page_into_agp(pages
[i
]);
260 * Select the right pool or requested caching state and ttm flags. */
261 static struct ttm_page_pool
*ttm_get_pool(int flags
, bool huge
,
262 enum ttm_caching_state cstate
)
266 if (cstate
== tt_cached
)
274 if (flags
& TTM_PAGE_FLAG_DMA32
) {
283 return &_manager
->pools
[pool_index
];
286 /* set memory back to wb and free the pages. */
287 static void ttm_pages_put(struct page
*pages
[], unsigned npages
)
290 if (set_pages_array_wb(pages
, npages
))
291 pr_err("Failed to set %d pages to wb!\n", npages
);
292 for (i
= 0; i
< npages
; ++i
)
293 __free_page(pages
[i
]);
296 static void ttm_pool_update_free_locked(struct ttm_page_pool
*pool
,
297 unsigned freed_pages
)
299 pool
->npages
-= freed_pages
;
300 pool
->nfrees
+= freed_pages
;
304 * Free pages from pool.
306 * To prevent hogging the ttm_swap process we only free NUM_PAGES_TO_ALLOC
307 * number of pages in one go.
309 * @pool: to free the pages from
310 * @free_all: If set to true will free all pages in pool
311 * @use_static: Safe to use static buffer
313 static int ttm_page_pool_free(struct ttm_page_pool
*pool
, unsigned nr_free
,
316 static struct page
*static_buf
[NUM_PAGES_TO_ALLOC
];
317 unsigned long irq_flags
;
319 struct page
**pages_to_free
;
320 unsigned freed_pages
= 0,
321 npages_to_free
= nr_free
;
323 if (NUM_PAGES_TO_ALLOC
< nr_free
)
324 npages_to_free
= NUM_PAGES_TO_ALLOC
;
327 pages_to_free
= static_buf
;
329 pages_to_free
= kmalloc(npages_to_free
* sizeof(struct page
*),
331 if (!pages_to_free
) {
332 pr_debug("Failed to allocate memory for pool free operation\n");
337 spin_lock_irqsave(&pool
->lock
, irq_flags
);
339 list_for_each_entry_reverse(p
, &pool
->list
, lru
) {
340 if (freed_pages
>= npages_to_free
)
343 pages_to_free
[freed_pages
++] = p
;
344 /* We can only remove NUM_PAGES_TO_ALLOC at a time. */
345 if (freed_pages
>= NUM_PAGES_TO_ALLOC
) {
346 /* remove range of pages from the pool */
347 __list_del(p
->lru
.prev
, &pool
->list
);
349 ttm_pool_update_free_locked(pool
, freed_pages
);
351 * Because changing page caching is costly
352 * we unlock the pool to prevent stalling.
354 spin_unlock_irqrestore(&pool
->lock
, irq_flags
);
356 ttm_pages_put(pages_to_free
, freed_pages
);
357 if (likely(nr_free
!= FREE_ALL_PAGES
))
358 nr_free
-= freed_pages
;
360 if (NUM_PAGES_TO_ALLOC
>= nr_free
)
361 npages_to_free
= nr_free
;
363 npages_to_free
= NUM_PAGES_TO_ALLOC
;
367 /* free all so restart the processing */
371 /* Not allowed to fall through or break because
372 * following context is inside spinlock while we are
380 /* remove range of pages from the pool */
382 __list_del(&p
->lru
, &pool
->list
);
384 ttm_pool_update_free_locked(pool
, freed_pages
);
385 nr_free
-= freed_pages
;
388 spin_unlock_irqrestore(&pool
->lock
, irq_flags
);
391 ttm_pages_put(pages_to_free
, freed_pages
);
393 if (pages_to_free
!= static_buf
)
394 kfree(pages_to_free
);
399 * Callback for mm to request pool to reduce number of page held.
401 * XXX: (dchinner) Deadlock warning!
403 * This code is crying out for a shrinker per pool....
406 ttm_pool_shrink_scan(struct shrinker
*shrink
, struct shrink_control
*sc
)
408 static DEFINE_MUTEX(lock
);
409 static unsigned start_pool
;
411 unsigned pool_offset
;
412 struct ttm_page_pool
*pool
;
413 int shrink_pages
= sc
->nr_to_scan
;
414 unsigned long freed
= 0;
416 if (!mutex_trylock(&lock
))
418 pool_offset
= ++start_pool
% NUM_POOLS
;
419 /* select start pool in round robin fashion */
420 for (i
= 0; i
< NUM_POOLS
; ++i
) {
421 unsigned nr_free
= shrink_pages
;
422 if (shrink_pages
== 0)
424 pool
= &_manager
->pools
[(i
+ pool_offset
)%NUM_POOLS
];
425 /* OK to use static buffer since global mutex is held. */
426 shrink_pages
= ttm_page_pool_free(pool
, nr_free
, true);
427 freed
+= nr_free
- shrink_pages
;
435 ttm_pool_shrink_count(struct shrinker
*shrink
, struct shrink_control
*sc
)
438 unsigned long count
= 0;
440 for (i
= 0; i
< NUM_POOLS
; ++i
)
441 count
+= _manager
->pools
[i
].npages
;
446 static void ttm_pool_mm_shrink_init(struct ttm_pool_manager
*manager
)
448 manager
->mm_shrink
.count_objects
= ttm_pool_shrink_count
;
449 manager
->mm_shrink
.scan_objects
= ttm_pool_shrink_scan
;
450 manager
->mm_shrink
.seeks
= 1;
451 register_shrinker(&manager
->mm_shrink
);
454 static void ttm_pool_mm_shrink_fini(struct ttm_pool_manager
*manager
)
456 unregister_shrinker(&manager
->mm_shrink
);
459 static int ttm_set_pages_caching(struct page
**pages
,
460 enum ttm_caching_state cstate
, unsigned cpages
)
463 /* Set page caching */
466 r
= set_pages_array_uc(pages
, cpages
);
468 pr_err("Failed to set %d pages to uc!\n", cpages
);
471 r
= set_pages_array_wc(pages
, cpages
);
473 pr_err("Failed to set %d pages to wc!\n", cpages
);
482 * Free pages the pages that failed to change the caching state. If there is
483 * any pages that have changed their caching state already put them to the
486 static void ttm_handle_caching_state_failure(struct list_head
*pages
,
487 int ttm_flags
, enum ttm_caching_state cstate
,
488 struct page
**failed_pages
, unsigned cpages
)
491 /* Failed pages have to be freed */
492 for (i
= 0; i
< cpages
; ++i
) {
493 list_del(&failed_pages
[i
]->lru
);
494 __free_page(failed_pages
[i
]);
499 * Allocate new pages with correct caching.
501 * This function is reentrant if caller updates count depending on number of
502 * pages returned in pages array.
504 static int ttm_alloc_new_pages(struct list_head
*pages
, gfp_t gfp_flags
,
505 int ttm_flags
, enum ttm_caching_state cstate
,
506 unsigned count
, unsigned order
)
508 struct page
**caching_array
;
511 unsigned i
, j
, cpages
;
512 unsigned npages
= 1 << order
;
513 unsigned max_cpages
= min(count
,
514 (unsigned)(PAGE_SIZE
/sizeof(struct page
*)));
516 /* allocate array for page caching change */
517 caching_array
= kmalloc(max_cpages
*sizeof(struct page
*), GFP_KERNEL
);
519 if (!caching_array
) {
520 pr_debug("Unable to allocate table for new pages\n");
524 for (i
= 0, cpages
= 0; i
< count
; ++i
) {
525 p
= alloc_pages(gfp_flags
, order
);
528 pr_debug("Unable to get page %u\n", i
);
530 /* store already allocated pages in the pool after
531 * setting the caching state */
533 r
= ttm_set_pages_caching(caching_array
,
536 ttm_handle_caching_state_failure(pages
,
538 caching_array
, cpages
);
544 list_add(&p
->lru
, pages
);
546 #ifdef CONFIG_HIGHMEM
547 /* gfp flags of highmem page should never be dma32 so we
548 * we should be fine in such case
554 for (j
= 0; j
< npages
; ++j
) {
555 caching_array
[cpages
++] = p
++;
556 if (cpages
== max_cpages
) {
558 r
= ttm_set_pages_caching(caching_array
,
561 ttm_handle_caching_state_failure(pages
,
563 caching_array
, cpages
);
572 r
= ttm_set_pages_caching(caching_array
, cstate
, cpages
);
574 ttm_handle_caching_state_failure(pages
,
576 caching_array
, cpages
);
579 kfree(caching_array
);
585 * Fill the given pool if there aren't enough pages and the requested number of
588 static void ttm_page_pool_fill_locked(struct ttm_page_pool
*pool
, int ttm_flags
,
589 enum ttm_caching_state cstate
,
590 unsigned count
, unsigned long *irq_flags
)
596 * Only allow one pool fill operation at a time.
597 * If pool doesn't have enough pages for the allocation new pages are
598 * allocated from outside of pool.
603 pool
->fill_lock
= true;
605 /* If allocation request is small and there are not enough
606 * pages in a pool we fill the pool up first. */
607 if (count
< _manager
->options
.small
608 && count
> pool
->npages
) {
609 struct list_head new_pages
;
610 unsigned alloc_size
= _manager
->options
.alloc_size
;
613 * Can't change page caching if in irqsave context. We have to
614 * drop the pool->lock.
616 spin_unlock_irqrestore(&pool
->lock
, *irq_flags
);
618 INIT_LIST_HEAD(&new_pages
);
619 r
= ttm_alloc_new_pages(&new_pages
, pool
->gfp_flags
, ttm_flags
,
620 cstate
, alloc_size
, 0);
621 spin_lock_irqsave(&pool
->lock
, *irq_flags
);
624 list_splice(&new_pages
, &pool
->list
);
626 pool
->npages
+= alloc_size
;
628 pr_debug("Failed to fill pool (%p)\n", pool
);
629 /* If we have any pages left put them to the pool. */
630 list_for_each_entry(p
, &new_pages
, lru
) {
633 list_splice(&new_pages
, &pool
->list
);
634 pool
->npages
+= cpages
;
638 pool
->fill_lock
= false;
642 * Allocate pages from the pool and put them on the return list.
644 * @return zero for success or negative error code.
646 static int ttm_page_pool_get_pages(struct ttm_page_pool
*pool
,
647 struct list_head
*pages
,
649 enum ttm_caching_state cstate
,
650 unsigned count
, unsigned order
)
652 unsigned long irq_flags
;
657 spin_lock_irqsave(&pool
->lock
, irq_flags
);
659 ttm_page_pool_fill_locked(pool
, ttm_flags
, cstate
, count
,
662 if (count
>= pool
->npages
) {
663 /* take all pages from the pool */
664 list_splice_init(&pool
->list
, pages
);
665 count
-= pool
->npages
;
669 /* find the last pages to include for requested number of pages. Split
670 * pool to begin and halve it to reduce search space. */
671 if (count
<= pool
->npages
/2) {
673 list_for_each(p
, &pool
->list
) {
678 i
= pool
->npages
+ 1;
679 list_for_each_prev(p
, &pool
->list
) {
684 /* Cut 'count' number of pages from the pool */
685 list_cut_position(pages
, &pool
->list
, p
);
686 pool
->npages
-= count
;
689 spin_unlock_irqrestore(&pool
->lock
, irq_flags
);
691 /* clear the pages coming from the pool if requested */
692 if (ttm_flags
& TTM_PAGE_FLAG_ZERO_ALLOC
) {
695 list_for_each_entry(page
, pages
, lru
) {
696 if (PageHighMem(page
))
697 clear_highpage(page
);
699 clear_page(page_address(page
));
703 /* If pool didn't have enough pages allocate new one. */
705 gfp_t gfp_flags
= pool
->gfp_flags
;
707 /* set zero flag for page allocation if required */
708 if (ttm_flags
& TTM_PAGE_FLAG_ZERO_ALLOC
)
709 gfp_flags
|= __GFP_ZERO
;
711 /* ttm_alloc_new_pages doesn't reference pool so we can run
712 * multiple requests in parallel.
714 r
= ttm_alloc_new_pages(pages
, gfp_flags
, ttm_flags
, cstate
,
721 /* Put all pages in pages list to correct pool to wait for reuse */
722 static void ttm_put_pages(struct page
**pages
, unsigned npages
, int flags
,
723 enum ttm_caching_state cstate
)
725 struct ttm_page_pool
*pool
= ttm_get_pool(flags
, false, cstate
);
726 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
727 struct ttm_page_pool
*huge
= ttm_get_pool(flags
, true, cstate
);
729 unsigned long irq_flags
;
733 /* No pool for this memory type so free the pages */
736 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
737 struct page
*p
= pages
[i
];
739 unsigned order
= 0, j
;
746 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
747 if (!(flags
& TTM_PAGE_FLAG_DMA32
)) {
748 for (j
= 0; j
< HPAGE_PMD_NR
; ++j
)
749 if (p
++ != pages
[i
+ j
])
752 if (j
== HPAGE_PMD_NR
)
753 order
= HPAGE_PMD_ORDER
;
757 if (page_count(pages
[i
]) != 1)
758 pr_err("Erroneous page count. Leaking pages.\n");
759 __free_pages(pages
[i
], order
);
771 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
773 unsigned max_size
, n2free
;
775 spin_lock_irqsave(&huge
->lock
, irq_flags
);
777 struct page
*p
= pages
[i
];
783 for (j
= 0; j
< HPAGE_PMD_NR
; ++j
)
784 if (p
++ != pages
[i
+ j
])
787 if (j
!= HPAGE_PMD_NR
)
790 list_add_tail(&pages
[i
]->lru
, &huge
->list
);
792 for (j
= 0; j
< HPAGE_PMD_NR
; ++j
)
797 /* Check that we don't go over the pool limit */
798 max_size
= _manager
->options
.max_size
;
799 max_size
/= HPAGE_PMD_NR
;
800 if (huge
->npages
> max_size
)
801 n2free
= huge
->npages
- max_size
;
804 spin_unlock_irqrestore(&huge
->lock
, irq_flags
);
806 ttm_page_pool_free(huge
, n2free
, false);
810 spin_lock_irqsave(&pool
->lock
, irq_flags
);
813 if (page_count(pages
[i
]) != 1)
814 pr_err("Erroneous page count. Leaking pages.\n");
815 list_add_tail(&pages
[i
]->lru
, &pool
->list
);
821 /* Check that we don't go over the pool limit */
823 if (pool
->npages
> _manager
->options
.max_size
) {
824 npages
= pool
->npages
- _manager
->options
.max_size
;
825 /* free at least NUM_PAGES_TO_ALLOC number of pages
826 * to reduce calls to set_memory_wb */
827 if (npages
< NUM_PAGES_TO_ALLOC
)
828 npages
= NUM_PAGES_TO_ALLOC
;
830 spin_unlock_irqrestore(&pool
->lock
, irq_flags
);
832 ttm_page_pool_free(pool
, npages
, false);
836 * On success pages list will hold count number of correctly
839 static int ttm_get_pages(struct page
**pages
, unsigned npages
, int flags
,
840 enum ttm_caching_state cstate
)
842 struct ttm_page_pool
*pool
= ttm_get_pool(flags
, false, cstate
);
843 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
844 struct ttm_page_pool
*huge
= ttm_get_pool(flags
, true, cstate
);
846 struct list_head plist
;
847 struct page
*p
= NULL
;
851 /* No pool for cached pages */
853 gfp_t gfp_flags
= GFP_USER
;
855 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
859 /* set zero flag for page allocation if required */
860 if (flags
& TTM_PAGE_FLAG_ZERO_ALLOC
)
861 gfp_flags
|= __GFP_ZERO
;
863 if (flags
& TTM_PAGE_FLAG_DMA32
)
864 gfp_flags
|= GFP_DMA32
;
866 gfp_flags
|= GFP_HIGHUSER
;
869 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
870 if (!(gfp_flags
& GFP_DMA32
)) {
871 while (npages
>= HPAGE_PMD_NR
) {
872 gfp_t huge_flags
= gfp_flags
;
874 huge_flags
|= GFP_TRANSHUGE
;
875 huge_flags
&= ~__GFP_MOVABLE
;
876 huge_flags
&= ~__GFP_COMP
;
877 p
= alloc_pages(huge_flags
, HPAGE_PMD_ORDER
);
881 for (j
= 0; j
< HPAGE_PMD_NR
; ++j
)
884 npages
-= HPAGE_PMD_NR
;
890 p
= alloc_page(gfp_flags
);
892 pr_debug("Unable to allocate page\n");
904 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
905 if (huge
&& npages
>= HPAGE_PMD_NR
) {
906 INIT_LIST_HEAD(&plist
);
907 ttm_page_pool_get_pages(huge
, &plist
, flags
, cstate
,
908 npages
/ HPAGE_PMD_NR
,
911 list_for_each_entry(p
, &plist
, lru
) {
914 for (j
= 0; j
< HPAGE_PMD_NR
; ++j
)
915 pages
[count
++] = &p
[j
];
920 INIT_LIST_HEAD(&plist
);
921 r
= ttm_page_pool_get_pages(pool
, &plist
, flags
, cstate
,
924 list_for_each_entry(p
, &plist
, lru
)
928 /* If there is any pages in the list put them back to
931 pr_debug("Failed to allocate extra pages for large request\n");
932 ttm_put_pages(pages
, count
, flags
, cstate
);
939 static void ttm_page_pool_init_locked(struct ttm_page_pool
*pool
, gfp_t flags
,
942 spin_lock_init(&pool
->lock
);
943 pool
->fill_lock
= false;
944 INIT_LIST_HEAD(&pool
->list
);
945 pool
->npages
= pool
->nfrees
= 0;
946 pool
->gfp_flags
= flags
;
950 int ttm_page_alloc_init(struct ttm_mem_global
*glob
, unsigned max_pages
)
956 pr_info("Initializing pool allocator\n");
958 _manager
= kzalloc(sizeof(*_manager
), GFP_KERNEL
);
960 ttm_page_pool_init_locked(&_manager
->wc_pool
, GFP_HIGHUSER
, "wc");
962 ttm_page_pool_init_locked(&_manager
->uc_pool
, GFP_HIGHUSER
, "uc");
964 ttm_page_pool_init_locked(&_manager
->wc_pool_dma32
,
965 GFP_USER
| GFP_DMA32
, "wc dma");
967 ttm_page_pool_init_locked(&_manager
->uc_pool_dma32
,
968 GFP_USER
| GFP_DMA32
, "uc dma");
970 ttm_page_pool_init_locked(&_manager
->wc_pool_huge
,
971 GFP_TRANSHUGE
& ~(__GFP_MOVABLE
| __GFP_COMP
),
974 ttm_page_pool_init_locked(&_manager
->uc_pool_huge
,
975 GFP_TRANSHUGE
& ~(__GFP_MOVABLE
| __GFP_COMP
)
978 _manager
->options
.max_size
= max_pages
;
979 _manager
->options
.small
= SMALL_ALLOCATION
;
980 _manager
->options
.alloc_size
= NUM_PAGES_TO_ALLOC
;
982 ret
= kobject_init_and_add(&_manager
->kobj
, &ttm_pool_kobj_type
,
983 &glob
->kobj
, "pool");
984 if (unlikely(ret
!= 0)) {
985 kobject_put(&_manager
->kobj
);
990 ttm_pool_mm_shrink_init(_manager
);
995 void ttm_page_alloc_fini(void)
999 pr_info("Finalizing pool allocator\n");
1000 ttm_pool_mm_shrink_fini(_manager
);
1002 /* OK to use static buffer since global mutex is no longer used. */
1003 for (i
= 0; i
< NUM_POOLS
; ++i
)
1004 ttm_page_pool_free(&_manager
->pools
[i
], FREE_ALL_PAGES
, true);
1006 kobject_put(&_manager
->kobj
);
1010 int ttm_pool_populate(struct ttm_tt
*ttm
)
1012 struct ttm_mem_global
*mem_glob
= ttm
->glob
->mem_glob
;
1016 if (ttm
->state
!= tt_unpopulated
)
1019 ret
= ttm_get_pages(ttm
->pages
, ttm
->num_pages
, ttm
->page_flags
,
1020 ttm
->caching_state
);
1021 if (unlikely(ret
!= 0)) {
1022 ttm_pool_unpopulate(ttm
);
1026 for (i
= 0; i
< ttm
->num_pages
; ++i
) {
1027 ret
= ttm_mem_global_alloc_page(mem_glob
, ttm
->pages
[i
],
1029 if (unlikely(ret
!= 0)) {
1030 ttm_pool_unpopulate(ttm
);
1035 if (unlikely(ttm
->page_flags
& TTM_PAGE_FLAG_SWAPPED
)) {
1036 ret
= ttm_tt_swapin(ttm
);
1037 if (unlikely(ret
!= 0)) {
1038 ttm_pool_unpopulate(ttm
);
1043 ttm
->state
= tt_unbound
;
1046 EXPORT_SYMBOL(ttm_pool_populate
);
1048 void ttm_pool_unpopulate(struct ttm_tt
*ttm
)
1052 for (i
= 0; i
< ttm
->num_pages
; ++i
) {
1056 ttm_mem_global_free_page(ttm
->glob
->mem_glob
, ttm
->pages
[i
],
1059 ttm_put_pages(ttm
->pages
, ttm
->num_pages
, ttm
->page_flags
,
1060 ttm
->caching_state
);
1061 ttm
->state
= tt_unpopulated
;
1063 EXPORT_SYMBOL(ttm_pool_unpopulate
);
1065 int ttm_populate_and_map_pages(struct device
*dev
, struct ttm_dma_tt
*tt
)
1070 r
= ttm_pool_populate(&tt
->ttm
);
1074 for (i
= 0; i
< tt
->ttm
.num_pages
; ++i
) {
1075 struct page
*p
= tt
->ttm
.pages
[i
];
1076 size_t num_pages
= 1;
1078 for (j
= i
+ 1; j
< tt
->ttm
.num_pages
; ++j
) {
1079 if (++p
!= tt
->ttm
.pages
[j
])
1085 tt
->dma_address
[i
] = dma_map_page(dev
, tt
->ttm
.pages
[i
],
1086 0, num_pages
* PAGE_SIZE
,
1088 if (dma_mapping_error(dev
, tt
->dma_address
[i
])) {
1090 dma_unmap_page(dev
, tt
->dma_address
[i
],
1091 PAGE_SIZE
, DMA_BIDIRECTIONAL
);
1092 tt
->dma_address
[i
] = 0;
1094 ttm_pool_unpopulate(&tt
->ttm
);
1098 for (j
= 1; j
< num_pages
; ++j
) {
1099 tt
->dma_address
[i
+ 1] = tt
->dma_address
[i
] + PAGE_SIZE
;
1105 EXPORT_SYMBOL(ttm_populate_and_map_pages
);
1107 void ttm_unmap_and_unpopulate_pages(struct device
*dev
, struct ttm_dma_tt
*tt
)
1111 for (i
= 0; i
< tt
->ttm
.num_pages
;) {
1112 struct page
*p
= tt
->ttm
.pages
[i
];
1113 size_t num_pages
= 1;
1115 if (!tt
->dma_address
[i
] || !tt
->ttm
.pages
[i
]) {
1120 for (j
= i
+ 1; j
< tt
->ttm
.num_pages
; ++j
) {
1121 if (++p
!= tt
->ttm
.pages
[j
])
1127 dma_unmap_page(dev
, tt
->dma_address
[i
], num_pages
* PAGE_SIZE
,
1132 ttm_pool_unpopulate(&tt
->ttm
);
1134 EXPORT_SYMBOL(ttm_unmap_and_unpopulate_pages
);
1136 int ttm_page_alloc_debugfs(struct seq_file
*m
, void *data
)
1138 struct ttm_page_pool
*p
;
1140 char *h
[] = {"pool", "refills", "pages freed", "size"};
1142 seq_printf(m
, "No pool allocator running.\n");
1145 seq_printf(m
, "%7s %12s %13s %8s\n",
1146 h
[0], h
[1], h
[2], h
[3]);
1147 for (i
= 0; i
< NUM_POOLS
; ++i
) {
1148 p
= &_manager
->pools
[i
];
1150 seq_printf(m
, "%7s %12ld %13ld %8d\n",
1151 p
->name
, p
->nrefills
,
1152 p
->nfrees
, p
->npages
);
1156 EXPORT_SYMBOL(ttm_page_alloc_debugfs
);