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 * Copyright (c) 2013 The FreeBSD Foundation
29 * All rights reserved.
31 * Portions of this software were developed by Konstantin Belousov
32 * <kib@FreeBSD.org> under sponsorship from the FreeBSD Foundation.
34 * $FreeBSD: head/sys/dev/drm2/ttm/ttm_page_alloc.c 247849 2013-03-05 16:15:34Z kib $
37 /* simple list based uncached page pool
38 * - Pool collects resently freed pages for reuse
39 * - Use page->lru to keep a free list
40 * - doesn't track currently in use pages
43 #include <sys/eventhandler.h>
46 #include <dev/drm/ttm/ttm_bo_driver.h>
47 #include <dev/drm/ttm/ttm_page_alloc.h>
53 #define NUM_PAGES_TO_ALLOC (PAGE_SIZE/sizeof(vm_page_t))
54 #define SMALL_ALLOCATION 16
55 #define FREE_ALL_PAGES (~0U)
56 /* times are in msecs */
57 #define PAGE_FREE_INTERVAL 1000
60 * struct ttm_page_pool - Pool to reuse recently allocated uc/wc pages.
62 * @lock: Protects the shared pool from concurrnet access. Must be used with
63 * irqsave/irqrestore variants because pool allocator maybe called from
65 * @fill_lock: Prevent concurrent calls to fill.
66 * @list: Pool of free uc/wc pages for fast reuse.
67 * @gfp_flags: Flags to pass for alloc_page.
68 * @npages: Number of pages in pool.
70 struct ttm_page_pool {
75 int ttm_page_alloc_flags;
79 unsigned long nrefills;
83 * Limits for the pool. They are handled without locks because only place where
84 * they may change is in sysfs store. They won't have immediate effect anyway
85 * so forcing serialization to access them is pointless.
88 struct ttm_pool_opts {
97 * struct ttm_pool_manager - Holds memory pools for fst allocation
99 * Manager is read only object for pool code so it doesn't need locking.
101 * @free_interval: minimum number of jiffies between freeing pages from pool.
102 * @page_alloc_inited: reference counting for pool allocation.
103 * @work: Work that is used to shrink the pool. Work is only run when there is
104 * some pages to free.
105 * @small_allocation: Limit in number of pages what is small allocation.
107 * @pools: All pool objects in use.
109 struct ttm_pool_manager {
110 unsigned int kobj_ref;
111 eventhandler_tag lowmem_handler;
112 struct ttm_pool_opts options;
115 struct ttm_page_pool u_pools[NUM_POOLS];
117 struct ttm_page_pool u_wc_pool;
118 struct ttm_page_pool u_uc_pool;
119 struct ttm_page_pool u_wc_pool_dma32;
120 struct ttm_page_pool u_uc_pool_dma32;
125 #define pools _u.u_pools
126 #define wc_pool _u._ut.u_wc_pool
127 #define uc_pool _u._ut.u_uc_pool
128 #define wc_pool_dma32 _u._ut.u_wc_pool_dma32
129 #define uc_pool_dma32 _u._ut.u_uc_pool_dma32
131 MALLOC_DEFINE(M_TTM_POOLMGR, "ttm_poolmgr", "TTM Pool Manager");
134 ttm_vm_page_free(vm_page_t m)
137 KASSERT(m->object == NULL, ("ttm page %p is owned", m));
138 KASSERT(m->wire_count == 1, ("ttm lost wire %p", m));
139 KASSERT((m->flags & PG_FICTITIOUS) != 0, ("ttm lost fictitious %p", m));
141 KASSERT((m->oflags & VPO_UNMANAGED) == 0, ("ttm got unmanaged %p", m));
142 m->oflags |= VPO_UNMANAGED;
144 m->flags &= ~PG_FICTITIOUS;
145 vm_page_busy_wait(m, FALSE, "ttmvpf");
146 vm_page_unwire(m, 0);
151 ttm_caching_state_to_vm(enum ttm_caching_state cstate)
156 return (VM_MEMATTR_UNCACHEABLE);
158 return (VM_MEMATTR_WRITE_COMBINING);
160 return (VM_MEMATTR_WRITE_BACK);
162 panic("caching state %d\n", cstate);
165 static void ttm_pool_kobj_release(struct ttm_pool_manager *m)
168 drm_free(m, M_TTM_POOLMGR);
173 static ssize_t ttm_pool_store(struct ttm_pool_manager *m,
174 struct attribute *attr, const char *buffer, size_t size)
178 chars = sscanf(buffer, "%u", &val);
182 /* Convert kb to number of pages */
183 val = val / (PAGE_SIZE >> 10);
185 if (attr == &ttm_page_pool_max)
186 m->options.max_size = val;
187 else if (attr == &ttm_page_pool_small)
188 m->options.small = val;
189 else if (attr == &ttm_page_pool_alloc_size) {
190 if (val > NUM_PAGES_TO_ALLOC*8) {
191 pr_err("Setting allocation size to %lu is not allowed. Recommended size is %lu\n",
192 NUM_PAGES_TO_ALLOC*(PAGE_SIZE >> 7),
193 NUM_PAGES_TO_ALLOC*(PAGE_SIZE >> 10));
195 } else if (val > NUM_PAGES_TO_ALLOC) {
196 pr_warn("Setting allocation size to larger than %lu is not recommended\n",
197 NUM_PAGES_TO_ALLOC*(PAGE_SIZE >> 10));
199 m->options.alloc_size = val;
205 static ssize_t ttm_pool_show(struct ttm_pool_manager *m,
206 struct attribute *attr, char *buffer)
210 if (attr == &ttm_page_pool_max)
211 val = m->options.max_size;
212 else if (attr == &ttm_page_pool_small)
213 val = m->options.small;
214 else if (attr == &ttm_page_pool_alloc_size)
215 val = m->options.alloc_size;
217 val = val * (PAGE_SIZE >> 10);
219 return snprintf(buffer, PAGE_SIZE, "%u\n", val);
223 static struct ttm_pool_manager *_manager;
225 static int set_pages_array_wb(vm_page_t *pages, int addrinarray)
230 for (i = 0; i < addrinarray; i++) {
233 unmap_page_from_agp(m);
235 pmap_page_set_memattr(m, VM_MEMATTR_WRITE_BACK);
240 static int set_pages_array_wc(vm_page_t *pages, int addrinarray)
245 for (i = 0; i < addrinarray; i++) {
248 map_page_into_agp(pages[i]);
250 pmap_page_set_memattr(m, VM_MEMATTR_WRITE_COMBINING);
255 static int set_pages_array_uc(vm_page_t *pages, int addrinarray)
260 for (i = 0; i < addrinarray; i++) {
263 map_page_into_agp(pages[i]);
265 pmap_page_set_memattr(m, VM_MEMATTR_UNCACHEABLE);
271 * Select the right pool or requested caching state and ttm flags. */
272 static struct ttm_page_pool *ttm_get_pool(int flags,
273 enum ttm_caching_state cstate)
277 if (cstate == tt_cached)
285 if (flags & TTM_PAGE_FLAG_DMA32)
288 return &_manager->pools[pool_index];
291 /* set memory back to wb and free the pages. */
292 static void ttm_pages_put(vm_page_t *pages, unsigned npages)
296 /* Our VM handles vm memattr automatically on the page free. */
297 if (set_pages_array_wb(pages, npages))
298 kprintf("[TTM] Failed to set %d pages to wb!\n", npages);
299 for (i = 0; i < npages; ++i)
300 ttm_vm_page_free(pages[i]);
303 static void ttm_pool_update_free_locked(struct ttm_page_pool *pool,
304 unsigned freed_pages)
306 pool->npages -= freed_pages;
307 pool->nfrees += freed_pages;
311 * Free pages from pool.
313 * To prevent hogging the ttm_swap process we only free NUM_PAGES_TO_ALLOC
314 * number of pages in one go.
316 * @pool: to free the pages from
317 * @free_all: If set to true will free all pages in pool
319 static int ttm_page_pool_free(struct ttm_page_pool *pool, unsigned nr_free)
322 vm_page_t *pages_to_free;
323 unsigned freed_pages = 0,
324 npages_to_free = nr_free;
327 if (NUM_PAGES_TO_ALLOC < nr_free)
328 npages_to_free = NUM_PAGES_TO_ALLOC;
330 pages_to_free = kmalloc(npages_to_free * sizeof(vm_page_t),
331 M_TEMP, M_WAITOK | M_ZERO);
334 lockmgr(&pool->lock, LK_EXCLUSIVE);
336 TAILQ_FOREACH_REVERSE_MUTABLE(p, &pool->list, pglist, pageq, p1) {
337 if (freed_pages >= npages_to_free)
340 pages_to_free[freed_pages++] = p;
341 /* We can only remove NUM_PAGES_TO_ALLOC at a time. */
342 if (freed_pages >= NUM_PAGES_TO_ALLOC) {
343 /* remove range of pages from the pool */
344 for (i = 0; i < freed_pages; i++)
345 TAILQ_REMOVE(&pool->list, pages_to_free[i], pageq);
347 ttm_pool_update_free_locked(pool, freed_pages);
349 * Because changing page caching is costly
350 * we unlock the pool to prevent stalling.
352 lockmgr(&pool->lock, LK_RELEASE);
354 ttm_pages_put(pages_to_free, freed_pages);
355 if (likely(nr_free != FREE_ALL_PAGES))
356 nr_free -= freed_pages;
358 if (NUM_PAGES_TO_ALLOC >= nr_free)
359 npages_to_free = nr_free;
361 npages_to_free = NUM_PAGES_TO_ALLOC;
365 /* free all so restart the processing */
369 /* Not allowed to fall through or break because
370 * following context is inside spinlock while we are
378 /* remove range of pages from the pool */
380 for (i = 0; i < freed_pages; i++)
381 TAILQ_REMOVE(&pool->list, pages_to_free[i], pageq);
383 ttm_pool_update_free_locked(pool, freed_pages);
384 nr_free -= freed_pages;
387 lockmgr(&pool->lock, LK_RELEASE);
390 ttm_pages_put(pages_to_free, freed_pages);
392 drm_free(pages_to_free, M_TEMP);
396 /* Get good estimation how many pages are free in pools */
397 static int ttm_pool_get_num_unused_pages(void)
401 for (i = 0; i < NUM_POOLS; ++i)
402 total += _manager->pools[i].npages;
408 * Callback for mm to request pool to reduce number of page held.
410 static int ttm_pool_mm_shrink(void *arg)
412 static unsigned int start_pool = 0;
414 unsigned pool_offset = atomic_fetchadd_int(&start_pool, 1);
415 struct ttm_page_pool *pool;
416 int shrink_pages = 100; /* XXXKIB */
418 pool_offset = pool_offset % 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 shrink_pages = ttm_page_pool_free(pool, nr_free);
427 /* return estimated number of unused pages in pool */
428 return ttm_pool_get_num_unused_pages();
431 static void ttm_pool_mm_shrink_init(struct ttm_pool_manager *manager)
434 manager->lowmem_handler = EVENTHANDLER_REGISTER(vm_lowmem,
435 ttm_pool_mm_shrink, manager, EVENTHANDLER_PRI_ANY);
438 static void ttm_pool_mm_shrink_fini(struct ttm_pool_manager *manager)
441 EVENTHANDLER_DEREGISTER(vm_lowmem, manager->lowmem_handler);
444 static int ttm_set_pages_caching(vm_page_t *pages,
445 enum ttm_caching_state cstate, unsigned cpages)
448 /* Set page caching */
451 r = set_pages_array_uc(pages, cpages);
453 kprintf("[TTM] Failed to set %d pages to uc!\n", cpages);
456 r = set_pages_array_wc(pages, cpages);
458 kprintf("[TTM] Failed to set %d pages to wc!\n", cpages);
467 * Free pages the pages that failed to change the caching state. If there is
468 * any pages that have changed their caching state already put them to the
471 static void ttm_handle_caching_state_failure(struct pglist *pages,
472 int ttm_flags, enum ttm_caching_state cstate,
473 vm_page_t *failed_pages, unsigned cpages)
476 /* Failed pages have to be freed */
477 for (i = 0; i < cpages; ++i) {
478 TAILQ_REMOVE(pages, failed_pages[i], pageq);
479 ttm_vm_page_free(failed_pages[i]);
484 * Allocate new pages with correct caching.
486 * This function is reentrant if caller updates count depending on number of
487 * pages returned in pages array.
489 static int ttm_alloc_new_pages(struct pglist *pages, int ttm_alloc_flags,
490 int ttm_flags, enum ttm_caching_state cstate, unsigned count)
492 vm_page_t *caching_array;
495 unsigned i, cpages, aflags;
496 unsigned max_cpages = min(count,
497 (unsigned)(PAGE_SIZE/sizeof(vm_page_t)));
499 aflags = VM_ALLOC_NORMAL |
500 ((ttm_alloc_flags & TTM_PAGE_FLAG_ZERO_ALLOC) != 0 ?
503 /* allocate array for page caching change */
504 caching_array = kmalloc(max_cpages * sizeof(vm_page_t), M_TEMP,
507 for (i = 0, cpages = 0; i < count; ++i) {
508 p = vm_page_alloc_contig(0,
509 (ttm_alloc_flags & TTM_PAGE_FLAG_DMA32) ? 0xffffffff :
510 VM_MAX_ADDRESS, PAGE_SIZE, 0,
511 1*PAGE_SIZE, ttm_caching_state_to_vm(cstate));
513 kprintf("[TTM] Unable to get page %u\n", i);
515 /* store already allocated pages in the pool after
516 * setting the caching state */
518 r = ttm_set_pages_caching(caching_array,
521 ttm_handle_caching_state_failure(pages,
523 caching_array, cpages);
529 p->oflags &= ~VPO_UNMANAGED;
531 p->flags |= PG_FICTITIOUS;
533 #ifdef CONFIG_HIGHMEM /* KIB: nop */
534 /* gfp flags of highmem page should never be dma32 so we
535 * we should be fine in such case
540 caching_array[cpages++] = p;
541 if (cpages == max_cpages) {
543 r = ttm_set_pages_caching(caching_array,
546 ttm_handle_caching_state_failure(pages,
548 caching_array, cpages);
555 TAILQ_INSERT_HEAD(pages, p, pageq);
559 r = ttm_set_pages_caching(caching_array, cstate, cpages);
561 ttm_handle_caching_state_failure(pages,
563 caching_array, cpages);
566 drm_free(caching_array, M_TEMP);
572 * Fill the given pool if there aren't enough pages and the requested number of
575 static void ttm_page_pool_fill_locked(struct ttm_page_pool *pool,
576 int ttm_flags, enum ttm_caching_state cstate, unsigned count)
582 * Only allow one pool fill operation at a time.
583 * If pool doesn't have enough pages for the allocation new pages are
584 * allocated from outside of pool.
589 pool->fill_lock = true;
591 /* If allocation request is small and there are not enough
592 * pages in a pool we fill the pool up first. */
593 if (count < _manager->options.small
594 && count > pool->npages) {
595 struct pglist new_pages;
596 unsigned alloc_size = _manager->options.alloc_size;
599 * Can't change page caching if in irqsave context. We have to
600 * drop the pool->lock.
602 lockmgr(&pool->lock, LK_RELEASE);
604 TAILQ_INIT(&new_pages);
605 r = ttm_alloc_new_pages(&new_pages, pool->ttm_page_alloc_flags,
606 ttm_flags, cstate, alloc_size);
607 lockmgr(&pool->lock, LK_EXCLUSIVE);
610 TAILQ_CONCAT(&pool->list, &new_pages, pageq);
612 pool->npages += alloc_size;
614 kprintf("[TTM] Failed to fill pool (%p)\n", pool);
615 /* If we have any pages left put them to the pool. */
616 TAILQ_FOREACH(p, &pool->list, pageq) {
619 TAILQ_CONCAT(&pool->list, &new_pages, pageq);
620 pool->npages += cpages;
624 pool->fill_lock = false;
628 * Cut 'count' number of pages from the pool and put them on the return list.
630 * @return count of pages still required to fulfill the request.
632 static unsigned ttm_page_pool_get_pages(struct ttm_page_pool *pool,
633 struct pglist *pages,
635 enum ttm_caching_state cstate,
641 lockmgr(&pool->lock, LK_EXCLUSIVE);
642 ttm_page_pool_fill_locked(pool, ttm_flags, cstate, count);
644 if (count >= pool->npages) {
645 /* take all pages from the pool */
646 TAILQ_CONCAT(pages, &pool->list, pageq);
647 count -= pool->npages;
651 for (i = 0; i < count; i++) {
652 p = TAILQ_FIRST(&pool->list);
653 TAILQ_REMOVE(&pool->list, p, pageq);
654 TAILQ_INSERT_TAIL(pages, p, pageq);
656 pool->npages -= count;
659 lockmgr(&pool->lock, LK_RELEASE);
663 /* Put all pages in pages list to correct pool to wait for reuse */
664 static void ttm_put_pages(vm_page_t *pages, unsigned npages, int flags,
665 enum ttm_caching_state cstate)
667 struct ttm_page_pool *pool = ttm_get_pool(flags, cstate);
671 /* No pool for this memory type so free the pages */
672 for (i = 0; i < npages; i++) {
674 ttm_vm_page_free(pages[i]);
681 lockmgr(&pool->lock, LK_EXCLUSIVE);
682 for (i = 0; i < npages; i++) {
684 TAILQ_INSERT_TAIL(&pool->list, pages[i], pageq);
689 /* Check that we don't go over the pool limit */
691 if (pool->npages > _manager->options.max_size) {
692 npages = pool->npages - _manager->options.max_size;
693 /* free at least NUM_PAGES_TO_ALLOC number of pages
694 * to reduce calls to set_memory_wb */
695 if (npages < NUM_PAGES_TO_ALLOC)
696 npages = NUM_PAGES_TO_ALLOC;
698 lockmgr(&pool->lock, LK_RELEASE);
700 ttm_page_pool_free(pool, npages);
704 * On success pages list will hold count number of correctly
707 static int ttm_get_pages(vm_page_t *pages, unsigned npages, int flags,
708 enum ttm_caching_state cstate)
710 struct ttm_page_pool *pool = ttm_get_pool(flags, cstate);
713 int gfp_flags, aflags;
717 aflags = VM_ALLOC_NORMAL |
718 ((flags & TTM_PAGE_FLAG_ZERO_ALLOC) != 0 ? VM_ALLOC_ZERO : 0);
720 /* No pool for cached pages */
722 for (r = 0; r < npages; ++r) {
723 p = vm_page_alloc_contig(0,
724 (flags & TTM_PAGE_FLAG_DMA32) ? 0xffffffff :
725 VM_MAX_ADDRESS, PAGE_SIZE,
726 0, 1*PAGE_SIZE, ttm_caching_state_to_vm(cstate));
728 kprintf("[TTM] Unable to allocate page\n");
732 p->oflags &= ~VPO_UNMANAGED;
734 p->flags |= PG_FICTITIOUS;
740 /* combine zero flag to pool flags */
741 gfp_flags = flags | pool->ttm_page_alloc_flags;
743 /* First we take pages from the pool */
745 npages = ttm_page_pool_get_pages(pool, &plist, flags, cstate, npages);
747 TAILQ_FOREACH(p, &plist, pageq) {
751 /* clear the pages coming from the pool if requested */
752 if (flags & TTM_PAGE_FLAG_ZERO_ALLOC) {
753 TAILQ_FOREACH(p, &plist, pageq) {
754 pmap_zero_page(VM_PAGE_TO_PHYS(p));
758 /* If pool didn't have enough pages allocate new one. */
760 /* ttm_alloc_new_pages doesn't reference pool so we can run
761 * multiple requests in parallel.
764 r = ttm_alloc_new_pages(&plist, gfp_flags, flags, cstate,
766 TAILQ_FOREACH(p, &plist, pageq) {
770 /* If there is any pages in the list put them back to
772 kprintf("[TTM] Failed to allocate extra pages for large request\n");
773 ttm_put_pages(pages, count, flags, cstate);
781 static void ttm_page_pool_init_locked(struct ttm_page_pool *pool, int flags,
784 lockinit(&pool->lock, "ttmpool", 0, LK_CANRECURSE);
785 pool->fill_lock = false;
786 TAILQ_INIT(&pool->list);
787 pool->npages = pool->nfrees = 0;
788 pool->ttm_page_alloc_flags = flags;
792 int ttm_page_alloc_init(struct ttm_mem_global *glob, unsigned max_pages)
795 if (_manager != NULL)
796 kprintf("[TTM] manager != NULL\n");
797 kprintf("[TTM] Initializing pool allocator\n");
799 _manager = kmalloc(sizeof(*_manager), M_TTM_POOLMGR, M_WAITOK | M_ZERO);
801 ttm_page_pool_init_locked(&_manager->wc_pool, 0, "wc");
802 ttm_page_pool_init_locked(&_manager->uc_pool, 0, "uc");
803 ttm_page_pool_init_locked(&_manager->wc_pool_dma32,
804 TTM_PAGE_FLAG_DMA32, "wc dma");
805 ttm_page_pool_init_locked(&_manager->uc_pool_dma32,
806 TTM_PAGE_FLAG_DMA32, "uc dma");
808 _manager->options.max_size = max_pages;
809 _manager->options.small = SMALL_ALLOCATION;
810 _manager->options.alloc_size = NUM_PAGES_TO_ALLOC;
812 refcount_init(&_manager->kobj_ref, 1);
813 ttm_pool_mm_shrink_init(_manager);
818 void ttm_page_alloc_fini(void)
822 kprintf("[TTM] Finalizing pool allocator\n");
823 ttm_pool_mm_shrink_fini(_manager);
825 for (i = 0; i < NUM_POOLS; ++i)
826 ttm_page_pool_free(&_manager->pools[i], FREE_ALL_PAGES);
828 if (refcount_release(&_manager->kobj_ref))
829 ttm_pool_kobj_release(_manager);
833 int ttm_pool_populate(struct ttm_tt *ttm)
835 struct ttm_mem_global *mem_glob = ttm->glob->mem_glob;
839 if (ttm->state != tt_unpopulated)
842 for (i = 0; i < ttm->num_pages; ++i) {
843 ret = ttm_get_pages(&ttm->pages[i], 1,
847 ttm_pool_unpopulate(ttm);
851 ret = ttm_mem_global_alloc_page(mem_glob, ttm->pages[i],
853 if (unlikely(ret != 0)) {
854 ttm_pool_unpopulate(ttm);
859 if (unlikely(ttm->page_flags & TTM_PAGE_FLAG_SWAPPED)) {
860 ret = ttm_tt_swapin(ttm);
861 if (unlikely(ret != 0)) {
862 ttm_pool_unpopulate(ttm);
867 ttm->state = tt_unbound;
871 void ttm_pool_unpopulate(struct ttm_tt *ttm)
875 for (i = 0; i < ttm->num_pages; ++i) {
877 ttm_mem_global_free_page(ttm->glob->mem_glob,
879 ttm_put_pages(&ttm->pages[i], 1,
884 ttm->state = tt_unpopulated;
889 int ttm_page_alloc_debugfs(struct seq_file *m, void *data)
891 struct ttm_page_pool *p;
893 char *h[] = {"pool", "refills", "pages freed", "size"};
895 seq_printf(m, "No pool allocator running.\n");
898 seq_printf(m, "%6s %12s %13s %8s\n",
899 h[0], h[1], h[2], h[3]);
900 for (i = 0; i < NUM_POOLS; ++i) {
901 p = &_manager->pools[i];
903 seq_printf(m, "%6s %12ld %13ld %8d\n",
904 p->name, p->nrefills,
905 p->nfrees, p->npages);