2 * drivers/staging/android/ion/ion_system_heap.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.
18 #include <linux/dma-mapping.h>
19 #include <linux/err.h>
20 #include <linux/highmem.h>
22 #include <linux/scatterlist.h>
23 #include <linux/seq_file.h>
24 #include <linux/slab.h>
25 #include <linux/vmalloc.h>
29 static gfp_t high_order_gfp_flags
= (GFP_HIGHUSER
| __GFP_ZERO
| __GFP_NOWARN
|
30 __GFP_NORETRY
) & ~__GFP_WAIT
;
31 static gfp_t low_order_gfp_flags
= (GFP_HIGHUSER
| __GFP_ZERO
| __GFP_NOWARN
);
32 static const unsigned int orders
[] = {8, 4, 0};
33 static const int num_orders
= ARRAY_SIZE(orders
);
34 static int order_to_index(unsigned int order
)
38 for (i
= 0; i
< num_orders
; i
++)
39 if (order
== orders
[i
])
45 static inline unsigned int order_to_size(int order
)
47 return PAGE_SIZE
<< order
;
50 struct ion_system_heap
{
52 struct ion_page_pool
**pools
;
58 struct list_head list
;
61 static struct page
*alloc_buffer_page(struct ion_system_heap
*heap
,
62 struct ion_buffer
*buffer
,
65 bool cached
= ion_buffer_cached(buffer
);
66 struct ion_page_pool
*pool
= heap
->pools
[order_to_index(order
)];
70 page
= ion_page_pool_alloc(pool
);
72 gfp_t gfp_flags
= low_order_gfp_flags
;
75 gfp_flags
= high_order_gfp_flags
;
76 page
= alloc_pages(gfp_flags
| __GFP_COMP
, order
);
79 ion_pages_sync_for_device(NULL
, page
, PAGE_SIZE
<< order
,
86 static void free_buffer_page(struct ion_system_heap
*heap
,
87 struct ion_buffer
*buffer
, struct page
*page
,
90 bool cached
= ion_buffer_cached(buffer
);
92 if (!cached
&& !(buffer
->private_flags
& ION_PRIV_FLAG_SHRINKER_FREE
)) {
93 struct ion_page_pool
*pool
= heap
->pools
[order_to_index(order
)];
95 ion_page_pool_free(pool
, page
);
97 __free_pages(page
, order
);
102 static struct page_info
*alloc_largest_available(struct ion_system_heap
*heap
,
103 struct ion_buffer
*buffer
,
105 unsigned int max_order
)
108 struct page_info
*info
;
111 info
= kmalloc(sizeof(struct page_info
), GFP_KERNEL
);
115 for (i
= 0; i
< num_orders
; i
++) {
116 if (size
< order_to_size(orders
[i
]))
118 if (max_order
< orders
[i
])
121 page
= alloc_buffer_page(heap
, buffer
, orders
[i
]);
126 info
->order
= orders
[i
];
134 static int ion_system_heap_allocate(struct ion_heap
*heap
,
135 struct ion_buffer
*buffer
,
136 unsigned long size
, unsigned long align
,
139 struct ion_system_heap
*sys_heap
= container_of(heap
,
140 struct ion_system_heap
,
142 struct sg_table
*table
;
143 struct scatterlist
*sg
;
144 struct list_head pages
;
145 struct page_info
*info
, *tmp_info
;
147 unsigned long size_remaining
= PAGE_ALIGN(size
);
148 unsigned int max_order
= orders
[0];
150 if (align
> PAGE_SIZE
)
153 if (size
/ PAGE_SIZE
> totalram_pages
/ 2)
156 INIT_LIST_HEAD(&pages
);
157 while (size_remaining
> 0) {
158 info
= alloc_largest_available(sys_heap
, buffer
, size_remaining
,
162 list_add_tail(&info
->list
, &pages
);
163 size_remaining
-= PAGE_SIZE
<< info
->order
;
164 max_order
= info
->order
;
167 table
= kmalloc(sizeof(struct sg_table
), GFP_KERNEL
);
171 if (sg_alloc_table(table
, i
, GFP_KERNEL
))
175 list_for_each_entry_safe(info
, tmp_info
, &pages
, list
) {
176 struct page
*page
= info
->page
;
177 sg_set_page(sg
, page
, PAGE_SIZE
<< info
->order
, 0);
179 list_del(&info
->list
);
183 buffer
->priv_virt
= table
;
189 list_for_each_entry_safe(info
, tmp_info
, &pages
, list
) {
190 free_buffer_page(sys_heap
, buffer
, info
->page
, info
->order
);
196 static void ion_system_heap_free(struct ion_buffer
*buffer
)
198 struct ion_system_heap
*sys_heap
= container_of(buffer
->heap
,
199 struct ion_system_heap
,
201 struct sg_table
*table
= buffer
->sg_table
;
202 bool cached
= ion_buffer_cached(buffer
);
203 struct scatterlist
*sg
;
206 /* uncached pages come from the page pools, zero them before returning
207 for security purposes (other allocations are zerod at alloc time */
208 if (!cached
&& !(buffer
->private_flags
& ION_PRIV_FLAG_SHRINKER_FREE
))
209 ion_heap_buffer_zero(buffer
);
211 for_each_sg(table
->sgl
, sg
, table
->nents
, i
)
212 free_buffer_page(sys_heap
, buffer
, sg_page(sg
),
213 get_order(sg
->length
));
214 sg_free_table(table
);
218 static struct sg_table
*ion_system_heap_map_dma(struct ion_heap
*heap
,
219 struct ion_buffer
*buffer
)
221 return buffer
->priv_virt
;
224 static void ion_system_heap_unmap_dma(struct ion_heap
*heap
,
225 struct ion_buffer
*buffer
)
230 static int ion_system_heap_shrink(struct ion_heap
*heap
, gfp_t gfp_mask
,
233 struct ion_system_heap
*sys_heap
;
237 sys_heap
= container_of(heap
, struct ion_system_heap
, heap
);
239 for (i
= 0; i
< num_orders
; i
++) {
240 struct ion_page_pool
*pool
= sys_heap
->pools
[i
];
242 nr_total
+= ion_page_pool_shrink(pool
, gfp_mask
, nr_to_scan
);
248 static struct ion_heap_ops system_heap_ops
= {
249 .allocate
= ion_system_heap_allocate
,
250 .free
= ion_system_heap_free
,
251 .map_dma
= ion_system_heap_map_dma
,
252 .unmap_dma
= ion_system_heap_unmap_dma
,
253 .map_kernel
= ion_heap_map_kernel
,
254 .unmap_kernel
= ion_heap_unmap_kernel
,
255 .map_user
= ion_heap_map_user
,
256 .shrink
= ion_system_heap_shrink
,
259 static int ion_system_heap_debug_show(struct ion_heap
*heap
, struct seq_file
*s
,
263 struct ion_system_heap
*sys_heap
= container_of(heap
,
264 struct ion_system_heap
,
268 for (i
= 0; i
< num_orders
; i
++) {
269 struct ion_page_pool
*pool
= sys_heap
->pools
[i
];
271 seq_printf(s
, "%d order %u highmem pages in pool = %lu total\n",
272 pool
->high_count
, pool
->order
,
273 (PAGE_SIZE
<< pool
->order
) * pool
->high_count
);
274 seq_printf(s
, "%d order %u lowmem pages in pool = %lu total\n",
275 pool
->low_count
, pool
->order
,
276 (PAGE_SIZE
<< pool
->order
) * pool
->low_count
);
281 struct ion_heap
*ion_system_heap_create(struct ion_platform_heap
*unused
)
283 struct ion_system_heap
*heap
;
286 heap
= kzalloc(sizeof(struct ion_system_heap
), GFP_KERNEL
);
288 return ERR_PTR(-ENOMEM
);
289 heap
->heap
.ops
= &system_heap_ops
;
290 heap
->heap
.type
= ION_HEAP_TYPE_SYSTEM
;
291 heap
->heap
.flags
= ION_HEAP_FLAG_DEFER_FREE
;
292 heap
->pools
= kzalloc(sizeof(struct ion_page_pool
*) * num_orders
,
296 for (i
= 0; i
< num_orders
; i
++) {
297 struct ion_page_pool
*pool
;
298 gfp_t gfp_flags
= low_order_gfp_flags
;
301 gfp_flags
= high_order_gfp_flags
;
302 pool
= ion_page_pool_create(gfp_flags
, orders
[i
]);
305 heap
->pools
[i
] = pool
;
308 heap
->heap
.debug_show
= ion_system_heap_debug_show
;
313 ion_page_pool_destroy(heap
->pools
[i
]);
317 return ERR_PTR(-ENOMEM
);
320 void ion_system_heap_destroy(struct ion_heap
*heap
)
322 struct ion_system_heap
*sys_heap
= container_of(heap
,
323 struct ion_system_heap
,
327 for (i
= 0; i
< num_orders
; i
++)
328 ion_page_pool_destroy(sys_heap
->pools
[i
]);
329 kfree(sys_heap
->pools
);
333 static int ion_system_contig_heap_allocate(struct ion_heap
*heap
,
334 struct ion_buffer
*buffer
,
339 int order
= get_order(len
);
341 struct sg_table
*table
;
345 if (align
> (PAGE_SIZE
<< order
))
348 page
= alloc_pages(low_order_gfp_flags
, order
);
352 split_page(page
, order
);
354 len
= PAGE_ALIGN(len
);
355 for (i
= len
>> PAGE_SHIFT
; i
< (1 << order
); i
++)
356 __free_page(page
+ i
);
358 table
= kmalloc(sizeof(struct sg_table
), GFP_KERNEL
);
364 ret
= sg_alloc_table(table
, 1, GFP_KERNEL
);
368 sg_set_page(table
->sgl
, page
, len
, 0);
370 buffer
->priv_virt
= table
;
372 ion_pages_sync_for_device(NULL
, page
, len
, DMA_BIDIRECTIONAL
);
379 for (i
= 0; i
< len
>> PAGE_SHIFT
; i
++)
380 __free_page(page
+ i
);
385 static void ion_system_contig_heap_free(struct ion_buffer
*buffer
)
387 struct sg_table
*table
= buffer
->priv_virt
;
388 struct page
*page
= sg_page(table
->sgl
);
389 unsigned long pages
= PAGE_ALIGN(buffer
->size
) >> PAGE_SHIFT
;
392 for (i
= 0; i
< pages
; i
++)
393 __free_page(page
+ i
);
394 sg_free_table(table
);
398 static int ion_system_contig_heap_phys(struct ion_heap
*heap
,
399 struct ion_buffer
*buffer
,
400 ion_phys_addr_t
*addr
, size_t *len
)
402 struct sg_table
*table
= buffer
->priv_virt
;
403 struct page
*page
= sg_page(table
->sgl
);
404 *addr
= page_to_phys(page
);
409 static struct sg_table
*ion_system_contig_heap_map_dma(struct ion_heap
*heap
,
410 struct ion_buffer
*buffer
)
412 return buffer
->priv_virt
;
415 static void ion_system_contig_heap_unmap_dma(struct ion_heap
*heap
,
416 struct ion_buffer
*buffer
)
420 static struct ion_heap_ops kmalloc_ops
= {
421 .allocate
= ion_system_contig_heap_allocate
,
422 .free
= ion_system_contig_heap_free
,
423 .phys
= ion_system_contig_heap_phys
,
424 .map_dma
= ion_system_contig_heap_map_dma
,
425 .unmap_dma
= ion_system_contig_heap_unmap_dma
,
426 .map_kernel
= ion_heap_map_kernel
,
427 .unmap_kernel
= ion_heap_unmap_kernel
,
428 .map_user
= ion_heap_map_user
,
431 struct ion_heap
*ion_system_contig_heap_create(struct ion_platform_heap
*unused
)
433 struct ion_heap
*heap
;
435 heap
= kzalloc(sizeof(struct ion_heap
), GFP_KERNEL
);
437 return ERR_PTR(-ENOMEM
);
438 heap
->ops
= &kmalloc_ops
;
439 heap
->type
= ION_HEAP_TYPE_SYSTEM_CONTIG
;
443 void ion_system_contig_heap_destroy(struct ion_heap
*heap
)