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
;
129 static struct attribute ttm_page_pool_max
= {
130 .name
= "pool_max_size",
131 .mode
= S_IRUGO
| S_IWUSR
133 static struct attribute ttm_page_pool_small
= {
134 .name
= "pool_small_allocation",
135 .mode
= S_IRUGO
| S_IWUSR
137 static struct attribute ttm_page_pool_alloc_size
= {
138 .name
= "pool_allocation_size",
139 .mode
= S_IRUGO
| S_IWUSR
142 static struct attribute
*ttm_pool_attrs
[] = {
144 &ttm_page_pool_small
,
145 &ttm_page_pool_alloc_size
,
149 static void ttm_pool_kobj_release(struct kobject
*kobj
)
151 struct ttm_pool_manager
*m
=
152 container_of(kobj
, struct ttm_pool_manager
, kobj
);
156 static ssize_t
ttm_pool_store(struct kobject
*kobj
,
157 struct attribute
*attr
, const char *buffer
, size_t size
)
159 struct ttm_pool_manager
*m
=
160 container_of(kobj
, struct ttm_pool_manager
, kobj
);
163 chars
= sscanf(buffer
, "%u", &val
);
167 /* Convert kb to number of pages */
168 val
= val
/ (PAGE_SIZE
>> 10);
170 if (attr
== &ttm_page_pool_max
)
171 m
->options
.max_size
= val
;
172 else if (attr
== &ttm_page_pool_small
)
173 m
->options
.small
= val
;
174 else if (attr
== &ttm_page_pool_alloc_size
) {
175 if (val
> NUM_PAGES_TO_ALLOC
*8) {
176 pr_err("Setting allocation size to %lu is not allowed. Recommended size is %lu\n",
177 NUM_PAGES_TO_ALLOC
*(PAGE_SIZE
>> 7),
178 NUM_PAGES_TO_ALLOC
*(PAGE_SIZE
>> 10));
180 } else if (val
> NUM_PAGES_TO_ALLOC
) {
181 pr_warn("Setting allocation size to larger than %lu is not recommended\n",
182 NUM_PAGES_TO_ALLOC
*(PAGE_SIZE
>> 10));
184 m
->options
.alloc_size
= val
;
190 static ssize_t
ttm_pool_show(struct kobject
*kobj
,
191 struct attribute
*attr
, char *buffer
)
193 struct ttm_pool_manager
*m
=
194 container_of(kobj
, struct ttm_pool_manager
, kobj
);
197 if (attr
== &ttm_page_pool_max
)
198 val
= m
->options
.max_size
;
199 else if (attr
== &ttm_page_pool_small
)
200 val
= m
->options
.small
;
201 else if (attr
== &ttm_page_pool_alloc_size
)
202 val
= m
->options
.alloc_size
;
204 val
= val
* (PAGE_SIZE
>> 10);
206 return snprintf(buffer
, PAGE_SIZE
, "%u\n", val
);
209 static const struct sysfs_ops ttm_pool_sysfs_ops
= {
210 .show
= &ttm_pool_show
,
211 .store
= &ttm_pool_store
,
214 static struct kobj_type ttm_pool_kobj_type
= {
215 .release
= &ttm_pool_kobj_release
,
216 .sysfs_ops
= &ttm_pool_sysfs_ops
,
217 .default_attrs
= ttm_pool_attrs
,
220 static struct ttm_pool_manager
*_manager
;
223 static int set_pages_array_wb(struct page
**pages
, int addrinarray
)
225 #if IS_ENABLED(CONFIG_AGP)
228 for (i
= 0; i
< addrinarray
; i
++)
229 unmap_page_from_agp(pages
[i
]);
234 static int set_pages_array_wc(struct page
**pages
, int addrinarray
)
236 #if IS_ENABLED(CONFIG_AGP)
239 for (i
= 0; i
< addrinarray
; i
++)
240 map_page_into_agp(pages
[i
]);
245 static int set_pages_array_uc(struct page
**pages
, int addrinarray
)
247 #if IS_ENABLED(CONFIG_AGP)
250 for (i
= 0; i
< addrinarray
; i
++)
251 map_page_into_agp(pages
[i
]);
258 * Select the right pool or requested caching state and ttm flags. */
259 static struct ttm_page_pool
*ttm_get_pool(int flags
,
260 enum ttm_caching_state cstate
)
264 if (cstate
== tt_cached
)
272 if (flags
& TTM_PAGE_FLAG_DMA32
)
275 return &_manager
->pools
[pool_index
];
278 /* set memory back to wb and free the pages. */
279 static void ttm_pages_put(struct page
*pages
[], unsigned npages
)
282 if (set_pages_array_wb(pages
, npages
))
283 pr_err("Failed to set %d pages to wb!\n", npages
);
284 for (i
= 0; i
< npages
; ++i
)
285 __free_page(pages
[i
]);
288 static void ttm_pool_update_free_locked(struct ttm_page_pool
*pool
,
289 unsigned freed_pages
)
291 pool
->npages
-= freed_pages
;
292 pool
->nfrees
+= freed_pages
;
296 * Free pages from pool.
298 * To prevent hogging the ttm_swap process we only free NUM_PAGES_TO_ALLOC
299 * number of pages in one go.
301 * @pool: to free the pages from
302 * @free_all: If set to true will free all pages in pool
303 * @use_static: Safe to use static buffer
305 static int ttm_page_pool_free(struct ttm_page_pool
*pool
, unsigned nr_free
,
308 static struct page
*static_buf
[NUM_PAGES_TO_ALLOC
];
309 unsigned long irq_flags
;
311 struct page
**pages_to_free
;
312 unsigned freed_pages
= 0,
313 npages_to_free
= nr_free
;
315 if (NUM_PAGES_TO_ALLOC
< nr_free
)
316 npages_to_free
= NUM_PAGES_TO_ALLOC
;
319 pages_to_free
= static_buf
;
321 pages_to_free
= kmalloc(npages_to_free
* sizeof(struct page
*),
323 if (!pages_to_free
) {
324 pr_err("Failed to allocate memory for pool free operation\n");
329 spin_lock_irqsave(&pool
->lock
, irq_flags
);
331 list_for_each_entry_reverse(p
, &pool
->list
, lru
) {
332 if (freed_pages
>= npages_to_free
)
335 pages_to_free
[freed_pages
++] = p
;
336 /* We can only remove NUM_PAGES_TO_ALLOC at a time. */
337 if (freed_pages
>= NUM_PAGES_TO_ALLOC
) {
338 /* remove range of pages from the pool */
339 __list_del(p
->lru
.prev
, &pool
->list
);
341 ttm_pool_update_free_locked(pool
, freed_pages
);
343 * Because changing page caching is costly
344 * we unlock the pool to prevent stalling.
346 spin_unlock_irqrestore(&pool
->lock
, irq_flags
);
348 ttm_pages_put(pages_to_free
, freed_pages
);
349 if (likely(nr_free
!= FREE_ALL_PAGES
))
350 nr_free
-= freed_pages
;
352 if (NUM_PAGES_TO_ALLOC
>= nr_free
)
353 npages_to_free
= nr_free
;
355 npages_to_free
= NUM_PAGES_TO_ALLOC
;
359 /* free all so restart the processing */
363 /* Not allowed to fall through or break because
364 * following context is inside spinlock while we are
372 /* remove range of pages from the pool */
374 __list_del(&p
->lru
, &pool
->list
);
376 ttm_pool_update_free_locked(pool
, freed_pages
);
377 nr_free
-= freed_pages
;
380 spin_unlock_irqrestore(&pool
->lock
, irq_flags
);
383 ttm_pages_put(pages_to_free
, freed_pages
);
385 if (pages_to_free
!= static_buf
)
386 kfree(pages_to_free
);
391 * Callback for mm to request pool to reduce number of page held.
393 * XXX: (dchinner) Deadlock warning!
395 * This code is crying out for a shrinker per pool....
398 ttm_pool_shrink_scan(struct shrinker
*shrink
, struct shrink_control
*sc
)
400 static DEFINE_MUTEX(lock
);
401 static unsigned start_pool
;
403 unsigned pool_offset
;
404 struct ttm_page_pool
*pool
;
405 int shrink_pages
= sc
->nr_to_scan
;
406 unsigned long freed
= 0;
408 if (!mutex_trylock(&lock
))
410 pool_offset
= ++start_pool
% NUM_POOLS
;
411 /* select start pool in round robin fashion */
412 for (i
= 0; i
< NUM_POOLS
; ++i
) {
413 unsigned nr_free
= shrink_pages
;
414 if (shrink_pages
== 0)
416 pool
= &_manager
->pools
[(i
+ pool_offset
)%NUM_POOLS
];
417 /* OK to use static buffer since global mutex is held. */
418 shrink_pages
= ttm_page_pool_free(pool
, nr_free
, true);
419 freed
+= nr_free
- shrink_pages
;
427 ttm_pool_shrink_count(struct shrinker
*shrink
, struct shrink_control
*sc
)
430 unsigned long count
= 0;
432 for (i
= 0; i
< NUM_POOLS
; ++i
)
433 count
+= _manager
->pools
[i
].npages
;
438 static void ttm_pool_mm_shrink_init(struct ttm_pool_manager
*manager
)
440 manager
->mm_shrink
.count_objects
= ttm_pool_shrink_count
;
441 manager
->mm_shrink
.scan_objects
= ttm_pool_shrink_scan
;
442 manager
->mm_shrink
.seeks
= 1;
443 register_shrinker(&manager
->mm_shrink
);
446 static void ttm_pool_mm_shrink_fini(struct ttm_pool_manager
*manager
)
448 unregister_shrinker(&manager
->mm_shrink
);
451 static int ttm_set_pages_caching(struct page
**pages
,
452 enum ttm_caching_state cstate
, unsigned cpages
)
455 /* Set page caching */
458 r
= set_pages_array_uc(pages
, cpages
);
460 pr_err("Failed to set %d pages to uc!\n", cpages
);
463 r
= set_pages_array_wc(pages
, cpages
);
465 pr_err("Failed to set %d pages to wc!\n", cpages
);
474 * Free pages the pages that failed to change the caching state. If there is
475 * any pages that have changed their caching state already put them to the
478 static void ttm_handle_caching_state_failure(struct list_head
*pages
,
479 int ttm_flags
, enum ttm_caching_state cstate
,
480 struct page
**failed_pages
, unsigned cpages
)
483 /* Failed pages have to be freed */
484 for (i
= 0; i
< cpages
; ++i
) {
485 list_del(&failed_pages
[i
]->lru
);
486 __free_page(failed_pages
[i
]);
491 * Allocate new pages with correct caching.
493 * This function is reentrant if caller updates count depending on number of
494 * pages returned in pages array.
496 static int ttm_alloc_new_pages(struct list_head
*pages
, gfp_t gfp_flags
,
497 int ttm_flags
, enum ttm_caching_state cstate
, unsigned count
)
499 struct page
**caching_array
;
503 unsigned max_cpages
= min(count
,
504 (unsigned)(PAGE_SIZE
/sizeof(struct page
*)));
506 /* allocate array for page caching change */
507 caching_array
= kmalloc(max_cpages
*sizeof(struct page
*), GFP_KERNEL
);
509 if (!caching_array
) {
510 pr_err("Unable to allocate table for new pages\n");
514 for (i
= 0, cpages
= 0; i
< count
; ++i
) {
515 p
= alloc_page(gfp_flags
);
518 pr_err("Unable to get page %u\n", i
);
520 /* store already allocated pages in the pool after
521 * setting the caching state */
523 r
= ttm_set_pages_caching(caching_array
,
526 ttm_handle_caching_state_failure(pages
,
528 caching_array
, cpages
);
534 #ifdef CONFIG_HIGHMEM
535 /* gfp flags of highmem page should never be dma32 so we
536 * we should be fine in such case
541 caching_array
[cpages
++] = p
;
542 if (cpages
== max_cpages
) {
544 r
= ttm_set_pages_caching(caching_array
,
547 ttm_handle_caching_state_failure(pages
,
549 caching_array
, cpages
);
556 list_add(&p
->lru
, pages
);
560 r
= ttm_set_pages_caching(caching_array
, cstate
, cpages
);
562 ttm_handle_caching_state_failure(pages
,
564 caching_array
, cpages
);
567 kfree(caching_array
);
573 * Fill the given pool if there aren't enough pages and the requested number of
576 static void ttm_page_pool_fill_locked(struct ttm_page_pool
*pool
,
577 int ttm_flags
, enum ttm_caching_state cstate
, unsigned count
,
578 unsigned long *irq_flags
)
584 * Only allow one pool fill operation at a time.
585 * If pool doesn't have enough pages for the allocation new pages are
586 * allocated from outside of pool.
591 pool
->fill_lock
= true;
593 /* If allocation request is small and there are not enough
594 * pages in a pool we fill the pool up first. */
595 if (count
< _manager
->options
.small
596 && count
> pool
->npages
) {
597 struct list_head new_pages
;
598 unsigned alloc_size
= _manager
->options
.alloc_size
;
601 * Can't change page caching if in irqsave context. We have to
602 * drop the pool->lock.
604 spin_unlock_irqrestore(&pool
->lock
, *irq_flags
);
606 INIT_LIST_HEAD(&new_pages
);
607 r
= ttm_alloc_new_pages(&new_pages
, pool
->gfp_flags
, ttm_flags
,
609 spin_lock_irqsave(&pool
->lock
, *irq_flags
);
612 list_splice(&new_pages
, &pool
->list
);
614 pool
->npages
+= alloc_size
;
616 pr_err("Failed to fill pool (%p)\n", pool
);
617 /* If we have any pages left put them to the pool. */
618 list_for_each_entry(p
, &new_pages
, lru
) {
621 list_splice(&new_pages
, &pool
->list
);
622 pool
->npages
+= cpages
;
626 pool
->fill_lock
= false;
630 * Cut 'count' number of pages from the pool and put them on the return list.
632 * @return count of pages still required to fulfill the request.
634 static unsigned ttm_page_pool_get_pages(struct ttm_page_pool
*pool
,
635 struct list_head
*pages
,
637 enum ttm_caching_state cstate
,
640 unsigned long irq_flags
;
644 spin_lock_irqsave(&pool
->lock
, irq_flags
);
645 ttm_page_pool_fill_locked(pool
, ttm_flags
, cstate
, count
, &irq_flags
);
647 if (count
>= pool
->npages
) {
648 /* take all pages from the pool */
649 list_splice_init(&pool
->list
, pages
);
650 count
-= pool
->npages
;
654 /* find the last pages to include for requested number of pages. Split
655 * pool to begin and halve it to reduce search space. */
656 if (count
<= pool
->npages
/2) {
658 list_for_each(p
, &pool
->list
) {
663 i
= pool
->npages
+ 1;
664 list_for_each_prev(p
, &pool
->list
) {
669 /* Cut 'count' number of pages from the pool */
670 list_cut_position(pages
, &pool
->list
, p
);
671 pool
->npages
-= count
;
674 spin_unlock_irqrestore(&pool
->lock
, irq_flags
);
678 /* Put all pages in pages list to correct pool to wait for reuse */
679 static void ttm_put_pages(struct page
**pages
, unsigned npages
, int flags
,
680 enum ttm_caching_state cstate
)
682 unsigned long irq_flags
;
683 struct ttm_page_pool
*pool
= ttm_get_pool(flags
, cstate
);
687 /* No pool for this memory type so free the pages */
688 for (i
= 0; i
< npages
; i
++) {
690 if (page_count(pages
[i
]) != 1)
691 pr_err("Erroneous page count. Leaking pages.\n");
692 __free_page(pages
[i
]);
699 spin_lock_irqsave(&pool
->lock
, irq_flags
);
700 for (i
= 0; i
< npages
; i
++) {
702 if (page_count(pages
[i
]) != 1)
703 pr_err("Erroneous page count. Leaking pages.\n");
704 list_add_tail(&pages
[i
]->lru
, &pool
->list
);
709 /* Check that we don't go over the pool limit */
711 if (pool
->npages
> _manager
->options
.max_size
) {
712 npages
= pool
->npages
- _manager
->options
.max_size
;
713 /* free at least NUM_PAGES_TO_ALLOC number of pages
714 * to reduce calls to set_memory_wb */
715 if (npages
< NUM_PAGES_TO_ALLOC
)
716 npages
= NUM_PAGES_TO_ALLOC
;
718 spin_unlock_irqrestore(&pool
->lock
, irq_flags
);
720 ttm_page_pool_free(pool
, npages
, false);
724 * On success pages list will hold count number of correctly
727 static int ttm_get_pages(struct page
**pages
, unsigned npages
, int flags
,
728 enum ttm_caching_state cstate
)
730 struct ttm_page_pool
*pool
= ttm_get_pool(flags
, cstate
);
731 struct list_head plist
;
732 struct page
*p
= NULL
;
733 gfp_t gfp_flags
= GFP_USER
;
737 /* set zero flag for page allocation if required */
738 if (flags
& TTM_PAGE_FLAG_ZERO_ALLOC
)
739 gfp_flags
|= __GFP_ZERO
;
741 /* No pool for cached pages */
743 if (flags
& TTM_PAGE_FLAG_DMA32
)
744 gfp_flags
|= GFP_DMA32
;
746 gfp_flags
|= GFP_HIGHUSER
;
748 for (r
= 0; r
< npages
; ++r
) {
749 p
= alloc_page(gfp_flags
);
752 pr_err("Unable to allocate page\n");
761 /* combine zero flag to pool flags */
762 gfp_flags
|= pool
->gfp_flags
;
764 /* First we take pages from the pool */
765 INIT_LIST_HEAD(&plist
);
766 npages
= ttm_page_pool_get_pages(pool
, &plist
, flags
, cstate
, npages
);
768 list_for_each_entry(p
, &plist
, lru
) {
772 /* clear the pages coming from the pool if requested */
773 if (flags
& TTM_PAGE_FLAG_ZERO_ALLOC
) {
774 list_for_each_entry(p
, &plist
, lru
) {
778 clear_page(page_address(p
));
782 /* If pool didn't have enough pages allocate new one. */
784 /* ttm_alloc_new_pages doesn't reference pool so we can run
785 * multiple requests in parallel.
787 INIT_LIST_HEAD(&plist
);
788 r
= ttm_alloc_new_pages(&plist
, gfp_flags
, flags
, cstate
, npages
);
789 list_for_each_entry(p
, &plist
, lru
) {
793 /* If there is any pages in the list put them back to
795 pr_err("Failed to allocate extra pages for large request\n");
796 ttm_put_pages(pages
, count
, flags
, cstate
);
804 static void ttm_page_pool_init_locked(struct ttm_page_pool
*pool
, gfp_t flags
,
807 spin_lock_init(&pool
->lock
);
808 pool
->fill_lock
= false;
809 INIT_LIST_HEAD(&pool
->list
);
810 pool
->npages
= pool
->nfrees
= 0;
811 pool
->gfp_flags
= flags
;
815 int ttm_page_alloc_init(struct ttm_mem_global
*glob
, unsigned max_pages
)
821 pr_info("Initializing pool allocator\n");
823 _manager
= kzalloc(sizeof(*_manager
), GFP_KERNEL
);
825 ttm_page_pool_init_locked(&_manager
->wc_pool
, GFP_HIGHUSER
, "wc");
827 ttm_page_pool_init_locked(&_manager
->uc_pool
, GFP_HIGHUSER
, "uc");
829 ttm_page_pool_init_locked(&_manager
->wc_pool_dma32
,
830 GFP_USER
| GFP_DMA32
, "wc dma");
832 ttm_page_pool_init_locked(&_manager
->uc_pool_dma32
,
833 GFP_USER
| GFP_DMA32
, "uc dma");
835 _manager
->options
.max_size
= max_pages
;
836 _manager
->options
.small
= SMALL_ALLOCATION
;
837 _manager
->options
.alloc_size
= NUM_PAGES_TO_ALLOC
;
839 ret
= kobject_init_and_add(&_manager
->kobj
, &ttm_pool_kobj_type
,
840 &glob
->kobj
, "pool");
841 if (unlikely(ret
!= 0)) {
842 kobject_put(&_manager
->kobj
);
847 ttm_pool_mm_shrink_init(_manager
);
852 void ttm_page_alloc_fini(void)
856 pr_info("Finalizing pool allocator\n");
857 ttm_pool_mm_shrink_fini(_manager
);
859 /* OK to use static buffer since global mutex is no longer used. */
860 for (i
= 0; i
< NUM_POOLS
; ++i
)
861 ttm_page_pool_free(&_manager
->pools
[i
], FREE_ALL_PAGES
, true);
863 kobject_put(&_manager
->kobj
);
867 int ttm_pool_populate(struct ttm_tt
*ttm
)
869 struct ttm_mem_global
*mem_glob
= ttm
->glob
->mem_glob
;
873 if (ttm
->state
!= tt_unpopulated
)
876 for (i
= 0; i
< ttm
->num_pages
; ++i
) {
877 ret
= ttm_get_pages(&ttm
->pages
[i
], 1,
881 ttm_pool_unpopulate(ttm
);
885 ret
= ttm_mem_global_alloc_page(mem_glob
, ttm
->pages
[i
],
887 if (unlikely(ret
!= 0)) {
888 ttm_pool_unpopulate(ttm
);
893 if (unlikely(ttm
->page_flags
& TTM_PAGE_FLAG_SWAPPED
)) {
894 ret
= ttm_tt_swapin(ttm
);
895 if (unlikely(ret
!= 0)) {
896 ttm_pool_unpopulate(ttm
);
901 ttm
->state
= tt_unbound
;
904 EXPORT_SYMBOL(ttm_pool_populate
);
906 void ttm_pool_unpopulate(struct ttm_tt
*ttm
)
910 for (i
= 0; i
< ttm
->num_pages
; ++i
) {
912 ttm_mem_global_free_page(ttm
->glob
->mem_glob
,
914 ttm_put_pages(&ttm
->pages
[i
], 1,
919 ttm
->state
= tt_unpopulated
;
921 EXPORT_SYMBOL(ttm_pool_unpopulate
);
923 int ttm_page_alloc_debugfs(struct seq_file
*m
, void *data
)
925 struct ttm_page_pool
*p
;
927 char *h
[] = {"pool", "refills", "pages freed", "size"};
929 seq_printf(m
, "No pool allocator running.\n");
932 seq_printf(m
, "%6s %12s %13s %8s\n",
933 h
[0], h
[1], h
[2], h
[3]);
934 for (i
= 0; i
< NUM_POOLS
; ++i
) {
935 p
= &_manager
->pools
[i
];
937 seq_printf(m
, "%6s %12ld %13ld %8d\n",
938 p
->name
, p
->nrefills
,
939 p
->nfrees
, p
->npages
);
943 EXPORT_SYMBOL(ttm_page_alloc_debugfs
);