366 lines
8.5 KiB
C
366 lines
8.5 KiB
C
/*
|
|
* drivers/gpu/ion/ion_heap.c
|
|
*
|
|
* Copyright (C) 2011 Google, Inc.
|
|
* Copyright (c) 2011-2016, The Linux Foundation. All rights reserved.
|
|
*
|
|
* This software is licensed under the terms of the GNU General Public
|
|
* License version 2, as published by the Free Software Foundation, and
|
|
* may be copied, distributed, and modified under those terms.
|
|
*
|
|
* This program is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
* GNU General Public License for more details.
|
|
*
|
|
*/
|
|
|
|
#include <linux/err.h>
|
|
#include <linux/freezer.h>
|
|
#include <linux/kthread.h>
|
|
#include <linux/mm.h>
|
|
#include <linux/rtmutex.h>
|
|
#include <linux/sched.h>
|
|
#include <linux/scatterlist.h>
|
|
#include <linux/vmalloc.h>
|
|
#include <linux/slab.h>
|
|
#include <linux/highmem.h>
|
|
#include <linux/dma-mapping.h>
|
|
#include "ion.h"
|
|
#include "ion_priv.h"
|
|
|
|
void *ion_heap_map_kernel(struct ion_heap *heap,
|
|
struct ion_buffer *buffer)
|
|
{
|
|
struct scatterlist *sg;
|
|
int i, j;
|
|
void *vaddr;
|
|
pgprot_t pgprot;
|
|
struct sg_table *table = buffer->sg_table;
|
|
int npages = PAGE_ALIGN(buffer->size) / PAGE_SIZE;
|
|
struct page **pages = vmalloc(sizeof(struct page *) * npages);
|
|
struct page **tmp = pages;
|
|
|
|
if (!pages)
|
|
return ERR_PTR(-ENOMEM);
|
|
|
|
if (buffer->flags & ION_FLAG_CACHED)
|
|
pgprot = PAGE_KERNEL;
|
|
else
|
|
pgprot = pgprot_writecombine(PAGE_KERNEL);
|
|
|
|
for_each_sg(table->sgl, sg, table->nents, i) {
|
|
int npages_this_entry = PAGE_ALIGN(sg->length) / PAGE_SIZE;
|
|
struct page *page = sg_page(sg);
|
|
|
|
BUG_ON(i >= npages);
|
|
for (j = 0; j < npages_this_entry; j++)
|
|
*(tmp++) = page++;
|
|
}
|
|
vaddr = vmap(pages, npages, VM_MAP, pgprot);
|
|
vfree(pages);
|
|
|
|
if (vaddr == NULL)
|
|
return ERR_PTR(-ENOMEM);
|
|
|
|
return vaddr;
|
|
}
|
|
|
|
void ion_heap_unmap_kernel(struct ion_heap *heap,
|
|
struct ion_buffer *buffer)
|
|
{
|
|
vunmap(buffer->vaddr);
|
|
}
|
|
|
|
int ion_heap_map_user(struct ion_heap *heap, struct ion_buffer *buffer,
|
|
struct vm_area_struct *vma)
|
|
{
|
|
struct sg_table *table = buffer->sg_table;
|
|
unsigned long addr = vma->vm_start;
|
|
unsigned long offset = vma->vm_pgoff * PAGE_SIZE;
|
|
struct scatterlist *sg;
|
|
int i;
|
|
int ret;
|
|
|
|
for_each_sg(table->sgl, sg, table->nents, i) {
|
|
struct page *page = sg_page(sg);
|
|
unsigned long remainder = vma->vm_end - addr;
|
|
unsigned long len = sg->length;
|
|
|
|
if (offset >= sg->length) {
|
|
offset -= sg->length;
|
|
continue;
|
|
} else if (offset) {
|
|
page += offset / PAGE_SIZE;
|
|
len = sg->length - offset;
|
|
offset = 0;
|
|
}
|
|
len = min(len, remainder);
|
|
ret = remap_pfn_range(vma, addr, page_to_pfn(page), len,
|
|
vma->vm_page_prot);
|
|
if (ret)
|
|
return ret;
|
|
addr += len;
|
|
if (addr >= vma->vm_end)
|
|
return 0;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
static int ion_heap_clear_pages(struct page **pages, int num, pgprot_t pgprot)
|
|
{
|
|
void *addr = vmap(pages, num, VM_MAP, pgprot);
|
|
|
|
if (!addr)
|
|
return -ENOMEM;
|
|
memset(addr, 0, PAGE_SIZE * num);
|
|
vunmap(addr);
|
|
|
|
return 0;
|
|
}
|
|
|
|
int ion_heap_buffer_zero(struct ion_buffer *buffer)
|
|
{
|
|
struct sg_table *table = buffer->sg_table;
|
|
pgprot_t pgprot;
|
|
struct scatterlist *sg;
|
|
int i, j, ret = 0;
|
|
struct page *pages[32];
|
|
int k = 0;
|
|
|
|
if (buffer->flags & ION_FLAG_CACHED)
|
|
pgprot = PAGE_KERNEL;
|
|
else
|
|
pgprot = pgprot_writecombine(PAGE_KERNEL);
|
|
|
|
for_each_sg(table->sgl, sg, table->nents, i) {
|
|
struct page *page = sg_page(sg);
|
|
unsigned long len = sg->length;
|
|
|
|
for (j = 0; j < len / PAGE_SIZE; j++) {
|
|
pages[k++] = page + j;
|
|
if (k == ARRAY_SIZE(pages)) {
|
|
ret = ion_heap_clear_pages(pages, k, pgprot);
|
|
if (ret)
|
|
goto end;
|
|
k = 0;
|
|
}
|
|
}
|
|
if (k)
|
|
ret = ion_heap_clear_pages(pages, k, pgprot);
|
|
}
|
|
end:
|
|
return ret;
|
|
}
|
|
|
|
void ion_heap_freelist_add(struct ion_heap *heap, struct ion_buffer *buffer)
|
|
{
|
|
spin_lock(&heap->free_lock);
|
|
list_add(&buffer->list, &heap->free_list);
|
|
heap->free_list_size += buffer->size;
|
|
spin_unlock(&heap->free_lock);
|
|
wake_up(&heap->waitqueue);
|
|
}
|
|
|
|
size_t ion_heap_freelist_size(struct ion_heap *heap)
|
|
{
|
|
size_t size;
|
|
|
|
spin_lock(&heap->free_lock);
|
|
size = heap->free_list_size;
|
|
spin_unlock(&heap->free_lock);
|
|
|
|
return size;
|
|
}
|
|
|
|
static size_t _ion_heap_freelist_drain(struct ion_heap *heap, size_t size,
|
|
bool skip_pools)
|
|
{
|
|
struct ion_buffer *buffer;
|
|
size_t total_drained = 0;
|
|
|
|
if (ion_heap_freelist_size(heap) == 0)
|
|
return 0;
|
|
|
|
spin_lock(&heap->free_lock);
|
|
if (size == 0)
|
|
size = heap->free_list_size;
|
|
|
|
while (!list_empty(&heap->free_list)) {
|
|
if (total_drained >= size)
|
|
break;
|
|
buffer = list_first_entry(&heap->free_list, struct ion_buffer,
|
|
list);
|
|
list_del(&buffer->list);
|
|
heap->free_list_size -= buffer->size;
|
|
if (skip_pools)
|
|
buffer->private_flags |= ION_PRIV_FLAG_SHRINKER_FREE;
|
|
total_drained += buffer->size;
|
|
spin_unlock(&heap->free_lock);
|
|
ion_buffer_destroy(buffer);
|
|
spin_lock(&heap->free_lock);
|
|
}
|
|
spin_unlock(&heap->free_lock);
|
|
|
|
return total_drained;
|
|
}
|
|
|
|
size_t ion_heap_freelist_drain(struct ion_heap *heap, size_t size)
|
|
{
|
|
return _ion_heap_freelist_drain(heap, size, false);
|
|
}
|
|
|
|
size_t ion_heap_freelist_drain_from_shrinker(struct ion_heap *heap, size_t size)
|
|
{
|
|
return _ion_heap_freelist_drain(heap, size, true);
|
|
}
|
|
|
|
static int ion_heap_deferred_free(void *data)
|
|
{
|
|
struct ion_heap *heap = data;
|
|
|
|
while (true) {
|
|
struct ion_buffer *buffer;
|
|
|
|
wait_event_freezable(heap->waitqueue,
|
|
ion_heap_freelist_size(heap) > 0);
|
|
|
|
spin_lock(&heap->free_lock);
|
|
if (list_empty(&heap->free_list)) {
|
|
spin_unlock(&heap->free_lock);
|
|
continue;
|
|
}
|
|
buffer = list_first_entry(&heap->free_list, struct ion_buffer,
|
|
list);
|
|
list_del(&buffer->list);
|
|
heap->free_list_size -= buffer->size;
|
|
spin_unlock(&heap->free_lock);
|
|
ion_buffer_destroy(buffer);
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
int ion_heap_init_deferred_free(struct ion_heap *heap)
|
|
{
|
|
struct sched_param param = { .sched_priority = 0 };
|
|
|
|
INIT_LIST_HEAD(&heap->free_list);
|
|
init_waitqueue_head(&heap->waitqueue);
|
|
heap->task = kthread_run(ion_heap_deferred_free, heap,
|
|
"%s", heap->name);
|
|
sched_setscheduler(heap->task, SCHED_IDLE, ¶m);
|
|
if (IS_ERR(heap->task)) {
|
|
pr_err("%s: creating thread for deferred free failed\n",
|
|
__func__);
|
|
return PTR_RET(heap->task);
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
static int ion_heap_shrink(struct shrinker *shrinker, struct shrink_control *sc)
|
|
{
|
|
struct ion_heap *heap = container_of(shrinker, struct ion_heap,
|
|
shrinker);
|
|
int total = 0;
|
|
int freed = 0;
|
|
int to_scan = sc->nr_to_scan;
|
|
|
|
if (to_scan == 0)
|
|
goto out;
|
|
|
|
/*
|
|
* shrink the free list first, no point in zeroing the memory if we're
|
|
* just going to reclaim it
|
|
*/
|
|
if (heap->flags & ION_HEAP_FLAG_DEFER_FREE)
|
|
freed = ion_heap_freelist_drain(heap, to_scan * PAGE_SIZE) /
|
|
PAGE_SIZE;
|
|
|
|
to_scan -= freed;
|
|
if (to_scan < 0)
|
|
to_scan = 0;
|
|
|
|
out:
|
|
total = ion_heap_freelist_size(heap) / PAGE_SIZE;
|
|
if (heap->ops->shrink)
|
|
total += heap->ops->shrink(heap, sc->gfp_mask, to_scan);
|
|
return total;
|
|
}
|
|
|
|
void ion_heap_init_shrinker(struct ion_heap *heap)
|
|
{
|
|
heap->shrinker.shrink = ion_heap_shrink;
|
|
heap->shrinker.seeks = DEFAULT_SEEKS;
|
|
heap->shrinker.batch = 0;
|
|
register_shrinker(&heap->shrinker);
|
|
}
|
|
|
|
struct ion_heap *ion_heap_create(struct ion_platform_heap *heap_data)
|
|
{
|
|
struct ion_heap *heap = NULL;
|
|
|
|
switch (heap_data->type) {
|
|
case ION_HEAP_TYPE_SYSTEM_CONTIG:
|
|
pr_err("%s: Heap type is disabled: %d\n", __func__,
|
|
heap_data->type);
|
|
return ERR_PTR(-EINVAL);
|
|
case ION_HEAP_TYPE_SYSTEM:
|
|
heap = ion_system_heap_create(heap_data);
|
|
break;
|
|
case ION_HEAP_TYPE_CARVEOUT:
|
|
heap = ion_carveout_heap_create(heap_data);
|
|
break;
|
|
case ION_HEAP_TYPE_CHUNK:
|
|
heap = ion_chunk_heap_create(heap_data);
|
|
break;
|
|
case ION_HEAP_TYPE_DMA:
|
|
heap = ion_cma_heap_create(heap_data);
|
|
break;
|
|
default:
|
|
pr_err("%s: Invalid heap type %d\n", __func__,
|
|
heap_data->type);
|
|
return ERR_PTR(-EINVAL);
|
|
}
|
|
|
|
if (IS_ERR_OR_NULL(heap)) {
|
|
pr_err("%s: error creating heap %s type %d base %pa size %zu\n",
|
|
__func__, heap_data->name, heap_data->type,
|
|
&heap_data->base, heap_data->size);
|
|
return ERR_PTR(-EINVAL);
|
|
}
|
|
|
|
heap->name = heap_data->name;
|
|
heap->id = heap_data->id;
|
|
heap->priv = heap_data->priv;
|
|
return heap;
|
|
}
|
|
|
|
void ion_heap_destroy(struct ion_heap *heap)
|
|
{
|
|
if (!heap)
|
|
return;
|
|
|
|
switch (heap->type) {
|
|
case ION_HEAP_TYPE_SYSTEM_CONTIG:
|
|
pr_err("%s: Heap type is disabled: %d\n", __func__,
|
|
heap->type);
|
|
break;
|
|
case ION_HEAP_TYPE_SYSTEM:
|
|
ion_system_heap_destroy(heap);
|
|
break;
|
|
case ION_HEAP_TYPE_CARVEOUT:
|
|
ion_carveout_heap_destroy(heap);
|
|
break;
|
|
case ION_HEAP_TYPE_CHUNK:
|
|
ion_chunk_heap_destroy(heap);
|
|
break;
|
|
case ION_HEAP_TYPE_DMA:
|
|
ion_cma_heap_destroy(heap);
|
|
break;
|
|
default:
|
|
pr_err("%s: Invalid heap type %d\n", __func__,
|
|
heap->type);
|
|
}
|
|
}
|