2 * drivers/staging/android/ion/ion_mem_pool.c
4 * Copyright (C) 2011 Google, Inc.
6 * This software is licensed under the terms of the GNU General Public
7 * License version 2, as published by the Free Software Foundation, and
8 * may be copied, distributed, and modified under those terms.
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
17 #include <linux/debugfs.h>
18 #include <linux/dma-mapping.h>
19 #include <linux/err.h>
21 #include <linux/list.h>
22 #include <linux/init.h>
23 #include <linux/slab.h>
24 #include <linux/swap.h>
27 static void *ion_page_pool_alloc_pages(struct ion_page_pool *pool)
29 struct page *page = alloc_pages(pool->gfp_mask, pool->order);
33 ion_pages_sync_for_device(NULL, page, PAGE_SIZE << pool->order,
38 static void ion_page_pool_free_pages(struct ion_page_pool *pool,
41 __free_pages(page, pool->order);
44 static int ion_page_pool_add(struct ion_page_pool *pool, struct page *page)
46 mutex_lock(&pool->mutex);
47 if (PageHighMem(page)) {
48 list_add_tail(&page->lru, &pool->high_items);
51 list_add_tail(&page->lru, &pool->low_items);
54 mutex_unlock(&pool->mutex);
58 static struct page *ion_page_pool_remove(struct ion_page_pool *pool, bool high)
63 BUG_ON(!pool->high_count);
64 page = list_first_entry(&pool->high_items, struct page, lru);
67 BUG_ON(!pool->low_count);
68 page = list_first_entry(&pool->low_items, struct page, lru);
76 struct page *ion_page_pool_alloc(struct ion_page_pool *pool)
78 struct page *page = NULL;
82 mutex_lock(&pool->mutex);
84 page = ion_page_pool_remove(pool, true);
85 else if (pool->low_count)
86 page = ion_page_pool_remove(pool, false);
87 mutex_unlock(&pool->mutex);
90 page = ion_page_pool_alloc_pages(pool);
95 void ion_page_pool_free(struct ion_page_pool *pool, struct page *page)
99 BUG_ON(pool->order != compound_order(page));
101 ret = ion_page_pool_add(pool, page);
103 ion_page_pool_free_pages(pool, page);
106 static int ion_page_pool_total(struct ion_page_pool *pool, bool high)
108 int count = pool->low_count;
111 count += pool->high_count;
113 return count << pool->order;
116 int ion_page_pool_shrink(struct ion_page_pool *pool, gfp_t gfp_mask,
122 if (current_is_kswapd())
125 high = !!(gfp_mask & __GFP_HIGHMEM);
128 return ion_page_pool_total(pool, high);
130 while (freed < nr_to_scan) {
133 mutex_lock(&pool->mutex);
134 if (pool->low_count) {
135 page = ion_page_pool_remove(pool, false);
136 } else if (high && pool->high_count) {
137 page = ion_page_pool_remove(pool, true);
139 mutex_unlock(&pool->mutex);
142 mutex_unlock(&pool->mutex);
143 ion_page_pool_free_pages(pool, page);
144 freed += (1 << pool->order);
150 struct ion_page_pool *ion_page_pool_create(gfp_t gfp_mask, unsigned int order)
152 struct ion_page_pool *pool = kmalloc(sizeof(struct ion_page_pool),
156 pool->high_count = 0;
158 INIT_LIST_HEAD(&pool->low_items);
159 INIT_LIST_HEAD(&pool->high_items);
160 pool->gfp_mask = gfp_mask | __GFP_COMP;
162 mutex_init(&pool->mutex);
163 plist_node_init(&pool->list, order);
168 void ion_page_pool_destroy(struct ion_page_pool *pool)
173 static int __init ion_page_pool_init(void)
177 device_initcall(ion_page_pool_init);