1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
|
/*
*
* (C) COPYRIGHT 2010-2013 ARM Limited. All rights reserved.
*
* This program is free software and is provided to you under the terms of the
* GNU General Public License version 2 as published by the Free Software
* Foundation, and any use by you of this program is subject to the terms
* of such GNU licence.
*
* A copy of the licence is included with the program, and can also be obtained
* from Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
* Boston, MA 02110-1301, USA.
*
*/
/**
* @file mali_kbase_mem.c
* Base kernel memory APIs
*/
#include <kbase/src/common/mali_kbase.h>
#include <linux/highmem.h>
#include <linux/mempool.h>
#include <linux/mm.h>
#include <linux/atomic.h>
STATIC int kbase_mem_allocator_shrink(struct shrinker *s, struct shrink_control *sc)
{
kbase_mem_allocator * allocator;
int i;
int freed;
allocator = container_of(s, kbase_mem_allocator, free_list_reclaimer);
if (sc->nr_to_scan == 0)
return atomic_read(&allocator->free_list_size);
might_sleep();
mutex_lock(&allocator->free_list_lock);
i = MIN(atomic_read(&allocator->free_list_size), sc->nr_to_scan);
freed = i;
atomic_sub(i, &allocator->free_list_size);
while (i--)
{
struct page * p;
BUG_ON(list_empty(&allocator->free_list_head));
p = list_first_entry(&allocator->free_list_head, struct page, lru);
list_del(&p->lru);
__free_page(p);
}
mutex_unlock(&allocator->free_list_lock);
return atomic_read(&allocator->free_list_size);
}
mali_error kbase_mem_allocator_init(kbase_mem_allocator * const allocator, unsigned int max_size)
{
KBASE_DEBUG_ASSERT(NULL != allocator);
INIT_LIST_HEAD(&allocator->free_list_head);
mutex_init(&allocator->free_list_lock);
atomic_set(&allocator->free_list_size, 0);
allocator->free_list_max_size = max_size;
allocator->free_list_reclaimer.shrink = kbase_mem_allocator_shrink;
allocator->free_list_reclaimer.seeks = DEFAULT_SEEKS;
#if LINUX_VERSION_CODE >= KERNEL_VERSION(3, 1, 0) /* Kernel versions prior to 3.1 : struct shrinker does not define batch */
allocator->free_list_reclaimer.batch = 0;
#endif
register_shrinker(&allocator->free_list_reclaimer);
return MALI_ERROR_NONE;
}
KBASE_EXPORT_TEST_API(kbase_mem_allocator_init)
void kbase_mem_allocator_term(kbase_mem_allocator *allocator)
{
KBASE_DEBUG_ASSERT(NULL != allocator);
unregister_shrinker(&allocator->free_list_reclaimer);
mutex_lock(&allocator->free_list_lock);
while (!list_empty(&allocator->free_list_head))
{
struct page * p;
p = list_first_entry(&allocator->free_list_head, struct page, lru);
list_del(&p->lru);
__free_page(p);
}
atomic_set(&allocator->free_list_size, 0);
mutex_unlock(&allocator->free_list_lock);
mutex_destroy(&allocator->free_list_lock);
}
KBASE_EXPORT_TEST_API(kbase_mem_allocator_term)
mali_error kbase_mem_allocator_alloc(kbase_mem_allocator *allocator, u32 nr_pages, phys_addr_t *pages, int flags)
{
struct page * p;
void * mp;
int i;
int num_from_free_list;
struct list_head from_free_list = LIST_HEAD_INIT(from_free_list);
might_sleep();
KBASE_DEBUG_ASSERT(NULL != allocator);
/* take from the free list first */
mutex_lock(&allocator->free_list_lock);
num_from_free_list = MIN(nr_pages, atomic_read(&allocator->free_list_size));
atomic_sub(num_from_free_list, &allocator->free_list_size);
for (i = 0; i < num_from_free_list; i++)
{
BUG_ON(list_empty(&allocator->free_list_head));
p = list_first_entry(&allocator->free_list_head, struct page, lru);
list_move(&p->lru, &from_free_list);
}
mutex_unlock(&allocator->free_list_lock);
i = 0;
/* Allocate as many pages from the pool of already allocated pages. */
list_for_each_entry(p, &from_free_list, lru)
{
pages[i] = PFN_PHYS(page_to_pfn(p));
i++;
}
if (i == nr_pages)
return MALI_ERROR_NONE;
/* If not all pages were sourced from the pool, request new ones. */
for (; i < nr_pages; i++)
{
p = alloc_page(GFP_HIGHUSER);
if (NULL == p)
{
goto err_out_roll_back;
}
mp = kmap(p);
if (NULL == mp)
{
__free_page(p);
goto err_out_roll_back;
}
memset(mp, 0x00, PAGE_SIZE); /* instead of __GFP_ZERO, so we can do cache maintenance */
kbase_sync_to_memory(PFN_PHYS(page_to_pfn(p)), mp, PAGE_SIZE);
kunmap(p);
pages[i] = PFN_PHYS(page_to_pfn(p));
}
return MALI_ERROR_NONE;
err_out_roll_back:
while (i--)
{
struct page * p;
p = pfn_to_page(PFN_DOWN(pages[i]));
pages[i] = (phys_addr_t)0;
__free_page(p);
}
return MALI_ERROR_OUT_OF_MEMORY;
}
KBASE_EXPORT_TEST_API(kbase_mem_allocator_alloc)
void kbase_mem_allocator_free(kbase_mem_allocator *allocator, u32 nr_pages, phys_addr_t *pages, mali_bool sync_back)
{
int i = 0;
int page_count = 0;
int tofree;
LIST_HEAD(new_free_list_items);
KBASE_DEBUG_ASSERT(NULL != allocator);
might_sleep();
/* Starting by just freeing the overspill.
* As we do this outside of the lock we might spill too many pages
* or get too many on the free list, but the max_size is just a ballpark so it is ok
* providing that tofree doesn't exceed nr_pages
*/
tofree = MAX((int)allocator->free_list_max_size - atomic_read(&allocator->free_list_size),0);
tofree = nr_pages - MIN(tofree, nr_pages);
for (; i < tofree; i++)
{
if (likely(0 != pages[i]))
{
struct page * p;
p = pfn_to_page(PFN_DOWN(pages[i]));
pages[i] = (phys_addr_t)0;
__free_page(p);
}
}
for (; i < nr_pages; i++)
{
if (likely(0 != pages[i]))
{
struct page * p;
p = pfn_to_page(PFN_DOWN(pages[i]));
pages[i] = (phys_addr_t)0;
/* Sync back the memory to ensure that future cache invalidations
* don't trample on memory.
*/
if( sync_back )
{
void* mp = kmap(p);
if( NULL != mp)
{
kbase_sync_to_cpu(PFN_PHYS(page_to_pfn(p)), mp, PAGE_SIZE);
kunmap(p);
}
}
list_add(&p->lru, &new_free_list_items);
page_count++;
}
}
mutex_lock(&allocator->free_list_lock);
list_splice(&new_free_list_items, &allocator->free_list_head);
atomic_add(page_count, &allocator->free_list_size);
mutex_unlock(&allocator->free_list_lock);
}
KBASE_EXPORT_TEST_API(kbase_mem_allocator_free)
|
