ion_system_heap.c revision d10e4ffd64a19d88f085e92a4b0a2470aa336915
1/* 2 * drivers/staging/android/ion/ion_system_heap.c 3 * 4 * Copyright (C) 2011 Google, Inc. 5 * 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. 9 * 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. 14 * 15 */ 16 17#include <asm/page.h> 18#include <linux/dma-mapping.h> 19#include <linux/err.h> 20#include <linux/highmem.h> 21#include <linux/mm.h> 22#include <linux/scatterlist.h> 23#include <linux/seq_file.h> 24#include <linux/slab.h> 25#include <linux/vmalloc.h> 26#include "ion.h" 27#include "ion_priv.h" 28 29static gfp_t high_order_gfp_flags = (GFP_HIGHUSER | __GFP_ZERO | __GFP_NOWARN | 30 __GFP_NORETRY) & ~__GFP_WAIT; 31static gfp_t low_order_gfp_flags = (GFP_HIGHUSER | __GFP_ZERO | __GFP_NOWARN); 32static const unsigned int orders[] = {8, 4, 0}; 33static const int num_orders = ARRAY_SIZE(orders); 34static int order_to_index(unsigned int order) 35{ 36 int i; 37 38 for (i = 0; i < num_orders; i++) 39 if (order == orders[i]) 40 return i; 41 BUG(); 42 return -1; 43} 44 45static inline unsigned int order_to_size(int order) 46{ 47 return PAGE_SIZE << order; 48} 49 50struct ion_system_heap { 51 struct ion_heap heap; 52 struct ion_page_pool **pools; 53}; 54 55struct page_info { 56 struct page *page; 57 struct list_head list; 58}; 59 60static struct page *alloc_buffer_page(struct ion_system_heap *heap, 61 struct ion_buffer *buffer, 62 unsigned long order) 63{ 64 bool cached = ion_buffer_cached(buffer); 65 struct ion_page_pool *pool = heap->pools[order_to_index(order)]; 66 struct page *page; 67 68 if (!cached) { 69 page = ion_page_pool_alloc(pool); 70 } else { 71 gfp_t gfp_flags = low_order_gfp_flags; 72 73 if (order > 4) 74 gfp_flags = high_order_gfp_flags; 75 page = alloc_pages(gfp_flags | __GFP_COMP, order); 76 if (!page) 77 return NULL; 78 ion_pages_sync_for_device(NULL, page, PAGE_SIZE << order, 79 DMA_BIDIRECTIONAL); 80 } 81 82 return page; 83} 84 85static void free_buffer_page(struct ion_system_heap *heap, 86 struct ion_buffer *buffer, struct page *page, 87 unsigned int order) 88{ 89 bool cached = ion_buffer_cached(buffer); 90 91 if (!cached && !(buffer->private_flags & ION_PRIV_FLAG_SHRINKER_FREE)) { 92 struct ion_page_pool *pool = heap->pools[order_to_index(order)]; 93 94 ion_page_pool_free(pool, page); 95 } else { 96 __free_pages(page, order); 97 } 98} 99 100 101static struct page_info *alloc_largest_available(struct ion_system_heap *heap, 102 struct ion_buffer *buffer, 103 unsigned long size, 104 unsigned int max_order) 105{ 106 struct page *page; 107 struct page_info *info; 108 int i; 109 110 info = kmalloc(sizeof(struct page_info), GFP_KERNEL); 111 if (!info) 112 return NULL; 113 114 for (i = 0; i < num_orders; i++) { 115 if (size < order_to_size(orders[i])) 116 continue; 117 if (max_order < orders[i]) 118 continue; 119 120 page = alloc_buffer_page(heap, buffer, orders[i]); 121 if (!page) 122 continue; 123 124 info->page = page; 125 return info; 126 } 127 kfree(info); 128 129 return NULL; 130} 131 132static int ion_system_heap_allocate(struct ion_heap *heap, 133 struct ion_buffer *buffer, 134 unsigned long size, unsigned long align, 135 unsigned long flags) 136{ 137 struct ion_system_heap *sys_heap = container_of(heap, 138 struct ion_system_heap, 139 heap); 140 struct sg_table *table; 141 struct scatterlist *sg; 142 struct list_head pages; 143 struct page_info *info, *tmp_info; 144 int i = 0; 145 unsigned long size_remaining = PAGE_ALIGN(size); 146 unsigned int max_order = orders[0]; 147 148 if (align > PAGE_SIZE) 149 return -EINVAL; 150 151 if (size / PAGE_SIZE > totalram_pages / 2) 152 return -ENOMEM; 153 154 INIT_LIST_HEAD(&pages); 155 while (size_remaining > 0) { 156 info = alloc_largest_available(sys_heap, buffer, size_remaining, 157 max_order); 158 if (!info) 159 goto free_pages; 160 list_add_tail(&info->list, &pages); 161 size_remaining -= PAGE_SIZE << compound_order(info->page); 162 max_order = compound_order(info->page); 163 i++; 164 } 165 table = kmalloc(sizeof(struct sg_table), GFP_KERNEL); 166 if (!table) 167 goto free_pages; 168 169 if (sg_alloc_table(table, i, GFP_KERNEL)) 170 goto free_table; 171 172 sg = table->sgl; 173 list_for_each_entry_safe(info, tmp_info, &pages, list) { 174 struct page *page = info->page; 175 sg_set_page(sg, page, PAGE_SIZE << compound_order(page), 0); 176 sg = sg_next(sg); 177 list_del(&info->list); 178 kfree(info); 179 } 180 181 buffer->priv_virt = table; 182 return 0; 183 184free_table: 185 kfree(table); 186free_pages: 187 list_for_each_entry_safe(info, tmp_info, &pages, list) { 188 free_buffer_page(sys_heap, buffer, info->page, 189 compound_order(info->page)); 190 kfree(info); 191 } 192 return -ENOMEM; 193} 194 195static void ion_system_heap_free(struct ion_buffer *buffer) 196{ 197 struct ion_system_heap *sys_heap = container_of(buffer->heap, 198 struct ion_system_heap, 199 heap); 200 struct sg_table *table = buffer->sg_table; 201 bool cached = ion_buffer_cached(buffer); 202 struct scatterlist *sg; 203 int i; 204 205 /* uncached pages come from the page pools, zero them before returning 206 for security purposes (other allocations are zerod at alloc time */ 207 if (!cached && !(buffer->private_flags & ION_PRIV_FLAG_SHRINKER_FREE)) 208 ion_heap_buffer_zero(buffer); 209 210 for_each_sg(table->sgl, sg, table->nents, i) 211 free_buffer_page(sys_heap, buffer, sg_page(sg), 212 get_order(sg->length)); 213 sg_free_table(table); 214 kfree(table); 215} 216 217static struct sg_table *ion_system_heap_map_dma(struct ion_heap *heap, 218 struct ion_buffer *buffer) 219{ 220 return buffer->priv_virt; 221} 222 223static void ion_system_heap_unmap_dma(struct ion_heap *heap, 224 struct ion_buffer *buffer) 225{ 226 return; 227} 228 229static int ion_system_heap_shrink(struct ion_heap *heap, gfp_t gfp_mask, 230 int nr_to_scan) 231{ 232 struct ion_system_heap *sys_heap; 233 int nr_total = 0; 234 int i; 235 236 sys_heap = container_of(heap, struct ion_system_heap, heap); 237 238 for (i = 0; i < num_orders; i++) { 239 struct ion_page_pool *pool = sys_heap->pools[i]; 240 241 nr_total += ion_page_pool_shrink(pool, gfp_mask, nr_to_scan); 242 } 243 244 return nr_total; 245} 246 247static struct ion_heap_ops system_heap_ops = { 248 .allocate = ion_system_heap_allocate, 249 .free = ion_system_heap_free, 250 .map_dma = ion_system_heap_map_dma, 251 .unmap_dma = ion_system_heap_unmap_dma, 252 .map_kernel = ion_heap_map_kernel, 253 .unmap_kernel = ion_heap_unmap_kernel, 254 .map_user = ion_heap_map_user, 255 .shrink = ion_system_heap_shrink, 256}; 257 258static int ion_system_heap_debug_show(struct ion_heap *heap, struct seq_file *s, 259 void *unused) 260{ 261 262 struct ion_system_heap *sys_heap = container_of(heap, 263 struct ion_system_heap, 264 heap); 265 int i; 266 267 for (i = 0; i < num_orders; i++) { 268 struct ion_page_pool *pool = sys_heap->pools[i]; 269 270 seq_printf(s, "%d order %u highmem pages in pool = %lu total\n", 271 pool->high_count, pool->order, 272 (PAGE_SIZE << pool->order) * pool->high_count); 273 seq_printf(s, "%d order %u lowmem pages in pool = %lu total\n", 274 pool->low_count, pool->order, 275 (PAGE_SIZE << pool->order) * pool->low_count); 276 } 277 return 0; 278} 279 280struct ion_heap *ion_system_heap_create(struct ion_platform_heap *unused) 281{ 282 struct ion_system_heap *heap; 283 int i; 284 285 heap = kzalloc(sizeof(struct ion_system_heap), GFP_KERNEL); 286 if (!heap) 287 return ERR_PTR(-ENOMEM); 288 heap->heap.ops = &system_heap_ops; 289 heap->heap.type = ION_HEAP_TYPE_SYSTEM; 290 heap->heap.flags = ION_HEAP_FLAG_DEFER_FREE; 291 heap->pools = kzalloc(sizeof(struct ion_page_pool *) * num_orders, 292 GFP_KERNEL); 293 if (!heap->pools) 294 goto free_heap; 295 for (i = 0; i < num_orders; i++) { 296 struct ion_page_pool *pool; 297 gfp_t gfp_flags = low_order_gfp_flags; 298 299 if (orders[i] > 4) 300 gfp_flags = high_order_gfp_flags; 301 pool = ion_page_pool_create(gfp_flags, orders[i]); 302 if (!pool) 303 goto destroy_pools; 304 heap->pools[i] = pool; 305 } 306 307 heap->heap.debug_show = ion_system_heap_debug_show; 308 return &heap->heap; 309 310destroy_pools: 311 while (i--) 312 ion_page_pool_destroy(heap->pools[i]); 313 kfree(heap->pools); 314free_heap: 315 kfree(heap); 316 return ERR_PTR(-ENOMEM); 317} 318 319void ion_system_heap_destroy(struct ion_heap *heap) 320{ 321 struct ion_system_heap *sys_heap = container_of(heap, 322 struct ion_system_heap, 323 heap); 324 int i; 325 326 for (i = 0; i < num_orders; i++) 327 ion_page_pool_destroy(sys_heap->pools[i]); 328 kfree(sys_heap->pools); 329 kfree(sys_heap); 330} 331 332static int ion_system_contig_heap_allocate(struct ion_heap *heap, 333 struct ion_buffer *buffer, 334 unsigned long len, 335 unsigned long align, 336 unsigned long flags) 337{ 338 int order = get_order(len); 339 struct page *page; 340 struct sg_table *table; 341 unsigned long i; 342 int ret; 343 344 if (align > (PAGE_SIZE << order)) 345 return -EINVAL; 346 347 page = alloc_pages(low_order_gfp_flags, order); 348 if (!page) 349 return -ENOMEM; 350 351 split_page(page, order); 352 353 len = PAGE_ALIGN(len); 354 for (i = len >> PAGE_SHIFT; i < (1 << order); i++) 355 __free_page(page + i); 356 357 table = kmalloc(sizeof(struct sg_table), GFP_KERNEL); 358 if (!table) { 359 ret = -ENOMEM; 360 goto free_pages; 361 } 362 363 ret = sg_alloc_table(table, 1, GFP_KERNEL); 364 if (ret) 365 goto free_table; 366 367 sg_set_page(table->sgl, page, len, 0); 368 369 buffer->priv_virt = table; 370 371 ion_pages_sync_for_device(NULL, page, len, DMA_BIDIRECTIONAL); 372 373 return 0; 374 375free_table: 376 kfree(table); 377free_pages: 378 for (i = 0; i < len >> PAGE_SHIFT; i++) 379 __free_page(page + i); 380 381 return ret; 382} 383 384static void ion_system_contig_heap_free(struct ion_buffer *buffer) 385{ 386 struct sg_table *table = buffer->priv_virt; 387 struct page *page = sg_page(table->sgl); 388 unsigned long pages = PAGE_ALIGN(buffer->size) >> PAGE_SHIFT; 389 unsigned long i; 390 391 for (i = 0; i < pages; i++) 392 __free_page(page + i); 393 sg_free_table(table); 394 kfree(table); 395} 396 397static int ion_system_contig_heap_phys(struct ion_heap *heap, 398 struct ion_buffer *buffer, 399 ion_phys_addr_t *addr, size_t *len) 400{ 401 struct sg_table *table = buffer->priv_virt; 402 struct page *page = sg_page(table->sgl); 403 *addr = page_to_phys(page); 404 *len = buffer->size; 405 return 0; 406} 407 408static struct sg_table *ion_system_contig_heap_map_dma(struct ion_heap *heap, 409 struct ion_buffer *buffer) 410{ 411 return buffer->priv_virt; 412} 413 414static void ion_system_contig_heap_unmap_dma(struct ion_heap *heap, 415 struct ion_buffer *buffer) 416{ 417} 418 419static struct ion_heap_ops kmalloc_ops = { 420 .allocate = ion_system_contig_heap_allocate, 421 .free = ion_system_contig_heap_free, 422 .phys = ion_system_contig_heap_phys, 423 .map_dma = ion_system_contig_heap_map_dma, 424 .unmap_dma = ion_system_contig_heap_unmap_dma, 425 .map_kernel = ion_heap_map_kernel, 426 .unmap_kernel = ion_heap_unmap_kernel, 427 .map_user = ion_heap_map_user, 428}; 429 430struct ion_heap *ion_system_contig_heap_create(struct ion_platform_heap *unused) 431{ 432 struct ion_heap *heap; 433 434 heap = kzalloc(sizeof(struct ion_heap), GFP_KERNEL); 435 if (!heap) 436 return ERR_PTR(-ENOMEM); 437 heap->ops = &kmalloc_ops; 438 heap->type = ION_HEAP_TYPE_SYSTEM_CONTIG; 439 return heap; 440} 441 442void ion_system_contig_heap_destroy(struct ion_heap *heap) 443{ 444 kfree(heap); 445} 446