1 // SPDX-License-Identifier: GPL-2.0 WITH Linux-syscall-note
2 /*
3 *
4 * (C) COPYRIGHT 2019-2022 ARM Limited. All rights reserved.
5 *
6 * This program is free software and is provided to you under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation, and any use by you of this program is subject to the terms
9 * of such GNU license.
10 *
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
15 *
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, you can access it online at
18 * http://www.gnu.org/licenses/gpl-2.0.html.
19 *
20 */
21
22 #include <mali_kbase.h>
23 #include <mali_kbase_mem.h>
24 #include <mali_kbase_mem_pool_group.h>
25
26 #include <linux/memory_group_manager.h>
27
kbase_mem_pool_group_config_set_max_size(struct kbase_mem_pool_group_config * const configs,size_t const max_size)28 void kbase_mem_pool_group_config_set_max_size(
29 struct kbase_mem_pool_group_config *const configs,
30 size_t const max_size)
31 {
32 size_t const large_max_size = max_size >>
33 (KBASE_MEM_POOL_2MB_PAGE_TABLE_ORDER -
34 KBASE_MEM_POOL_4KB_PAGE_TABLE_ORDER);
35 int gid;
36
37 for (gid = 0; gid < MEMORY_GROUP_MANAGER_NR_GROUPS; ++gid) {
38 kbase_mem_pool_config_set_max_size(&configs->small[gid],
39 max_size);
40
41 kbase_mem_pool_config_set_max_size(&configs->large[gid],
42 large_max_size);
43 }
44 }
45
kbase_mem_pool_group_init(struct kbase_mem_pool_group * const mem_pools,struct kbase_device * const kbdev,const struct kbase_mem_pool_group_config * const configs,struct kbase_mem_pool_group * next_pools)46 int kbase_mem_pool_group_init(struct kbase_mem_pool_group *const mem_pools,
47 struct kbase_device *const kbdev,
48 const struct kbase_mem_pool_group_config *const configs,
49 struct kbase_mem_pool_group *next_pools)
50 {
51 int gid, err = 0;
52
53 for (gid = 0; gid < MEMORY_GROUP_MANAGER_NR_GROUPS; ++gid) {
54 err = kbase_mem_pool_init(&mem_pools->small[gid], &configs->small[gid],
55 KBASE_MEM_POOL_4KB_PAGE_TABLE_ORDER, gid, kbdev,
56 next_pools ? &next_pools->small[gid] : NULL);
57
58 if (!err) {
59 err = kbase_mem_pool_init(&mem_pools->large[gid], &configs->large[gid],
60 KBASE_MEM_POOL_2MB_PAGE_TABLE_ORDER, gid, kbdev,
61 next_pools ? &next_pools->large[gid] : NULL);
62 if (err)
63 kbase_mem_pool_term(&mem_pools->small[gid]);
64 }
65
66 /* Break out of the loop early to avoid incrementing the count
67 * of memory pool pairs successfully initialized.
68 */
69 if (err)
70 break;
71 }
72
73 if (err) {
74 /* gid gives the number of memory pool pairs successfully
75 * initialized, which is one greater than the array index of the
76 * last group.
77 */
78 while (gid-- > 0) {
79 kbase_mem_pool_term(&mem_pools->small[gid]);
80 kbase_mem_pool_term(&mem_pools->large[gid]);
81 }
82 }
83
84 return err;
85 }
86
kbase_mem_pool_group_mark_dying(struct kbase_mem_pool_group * const mem_pools)87 void kbase_mem_pool_group_mark_dying(
88 struct kbase_mem_pool_group *const mem_pools)
89 {
90 int gid;
91
92 for (gid = 0; gid < MEMORY_GROUP_MANAGER_NR_GROUPS; ++gid) {
93 kbase_mem_pool_mark_dying(&mem_pools->small[gid]);
94 kbase_mem_pool_mark_dying(&mem_pools->large[gid]);
95 }
96 }
97
kbase_mem_pool_group_term(struct kbase_mem_pool_group * const mem_pools)98 void kbase_mem_pool_group_term(
99 struct kbase_mem_pool_group *const mem_pools)
100 {
101 int gid;
102
103 for (gid = 0; gid < MEMORY_GROUP_MANAGER_NR_GROUPS; ++gid) {
104 kbase_mem_pool_term(&mem_pools->small[gid]);
105 kbase_mem_pool_term(&mem_pools->large[gid]);
106 }
107 }
108