drivers/staging/android/ion/ion_system_heap.c

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