1*5113495bSYour Name /*
2*5113495bSYour Name * Copyright (c) 2018-2019 The Linux Foundation. All rights reserved.
3*5113495bSYour Name *
4*5113495bSYour Name * Permission to use, copy, modify, and/or distribute this software for
5*5113495bSYour Name * any purpose with or without fee is hereby granted, provided that the
6*5113495bSYour Name * above copyright notice and this permission notice appear in all
7*5113495bSYour Name * copies.
8*5113495bSYour Name *
9*5113495bSYour Name * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL
10*5113495bSYour Name * WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED
11*5113495bSYour Name * WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE
12*5113495bSYour Name * AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
13*5113495bSYour Name * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
14*5113495bSYour Name * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
15*5113495bSYour Name * TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
16*5113495bSYour Name * PERFORMANCE OF THIS SOFTWARE.
17*5113495bSYour Name */
18*5113495bSYour Name
19*5113495bSYour Name #include "qdf_flex_mem.h"
20*5113495bSYour Name #include "qdf_list.h"
21*5113495bSYour Name #include "qdf_lock.h"
22*5113495bSYour Name #include "qdf_mem.h"
23*5113495bSYour Name #include "qdf_module.h"
24*5113495bSYour Name #include "qdf_talloc.h"
25*5113495bSYour Name #include "qdf_trace.h"
26*5113495bSYour Name #include "qdf_util.h"
27*5113495bSYour Name
28*5113495bSYour Name static struct qdf_flex_mem_segment *
qdf_flex_mem_seg_alloc(struct qdf_flex_mem_pool * pool)29*5113495bSYour Name qdf_flex_mem_seg_alloc(struct qdf_flex_mem_pool *pool)
30*5113495bSYour Name {
31*5113495bSYour Name struct qdf_flex_mem_segment *seg;
32*5113495bSYour Name size_t total_size = sizeof(struct qdf_flex_mem_segment) +
33*5113495bSYour Name pool->item_size * QDF_FM_BITMAP_BITS;
34*5113495bSYour Name
35*5113495bSYour Name seg = qdf_talloc(pool, total_size);
36*5113495bSYour Name if (!seg)
37*5113495bSYour Name return NULL;
38*5113495bSYour Name
39*5113495bSYour Name seg->dynamic = true;
40*5113495bSYour Name seg->bytes = (uint8_t *)(seg + 1);
41*5113495bSYour Name seg->used_bitmap = 0;
42*5113495bSYour Name qdf_list_insert_back(&pool->seg_list, &seg->node);
43*5113495bSYour Name
44*5113495bSYour Name return seg;
45*5113495bSYour Name }
46*5113495bSYour Name
qdf_flex_mem_init(struct qdf_flex_mem_pool * pool)47*5113495bSYour Name void qdf_flex_mem_init(struct qdf_flex_mem_pool *pool)
48*5113495bSYour Name {
49*5113495bSYour Name int i;
50*5113495bSYour Name
51*5113495bSYour Name qdf_spinlock_create(&pool->lock);
52*5113495bSYour Name
53*5113495bSYour Name for (i = 0; i < pool->reduction_limit; i++)
54*5113495bSYour Name qdf_flex_mem_seg_alloc(pool);
55*5113495bSYour Name }
56*5113495bSYour Name qdf_export_symbol(qdf_flex_mem_init);
57*5113495bSYour Name
qdf_flex_mem_deinit(struct qdf_flex_mem_pool * pool)58*5113495bSYour Name void qdf_flex_mem_deinit(struct qdf_flex_mem_pool *pool)
59*5113495bSYour Name {
60*5113495bSYour Name struct qdf_flex_mem_segment *seg, *next;
61*5113495bSYour Name
62*5113495bSYour Name qdf_spinlock_destroy(&pool->lock);
63*5113495bSYour Name
64*5113495bSYour Name qdf_list_for_each_del(&pool->seg_list, seg, next, node) {
65*5113495bSYour Name QDF_BUG(!seg->used_bitmap);
66*5113495bSYour Name if (seg->used_bitmap)
67*5113495bSYour Name continue;
68*5113495bSYour Name
69*5113495bSYour Name qdf_list_remove_node(&pool->seg_list, &seg->node);
70*5113495bSYour Name if (seg->dynamic)
71*5113495bSYour Name qdf_tfree(seg);
72*5113495bSYour Name }
73*5113495bSYour Name }
74*5113495bSYour Name qdf_export_symbol(qdf_flex_mem_deinit);
75*5113495bSYour Name
__qdf_flex_mem_alloc(struct qdf_flex_mem_pool * pool)76*5113495bSYour Name static void *__qdf_flex_mem_alloc(struct qdf_flex_mem_pool *pool)
77*5113495bSYour Name {
78*5113495bSYour Name struct qdf_flex_mem_segment *seg;
79*5113495bSYour Name
80*5113495bSYour Name qdf_list_for_each(&pool->seg_list, seg, node) {
81*5113495bSYour Name int index;
82*5113495bSYour Name void *ptr;
83*5113495bSYour Name
84*5113495bSYour Name index = qdf_ffz(seg->used_bitmap);
85*5113495bSYour Name if (index < 0)
86*5113495bSYour Name continue;
87*5113495bSYour Name
88*5113495bSYour Name QDF_BUG(index < QDF_FM_BITMAP_BITS);
89*5113495bSYour Name
90*5113495bSYour Name seg->used_bitmap ^= (QDF_FM_BITMAP)1 << index;
91*5113495bSYour Name ptr = &seg->bytes[index * pool->item_size];
92*5113495bSYour Name qdf_mem_zero(ptr, pool->item_size);
93*5113495bSYour Name
94*5113495bSYour Name return ptr;
95*5113495bSYour Name }
96*5113495bSYour Name
97*5113495bSYour Name seg = qdf_flex_mem_seg_alloc(pool);
98*5113495bSYour Name if (!seg)
99*5113495bSYour Name return NULL;
100*5113495bSYour Name
101*5113495bSYour Name seg->used_bitmap = 1;
102*5113495bSYour Name
103*5113495bSYour Name return seg->bytes;
104*5113495bSYour Name }
105*5113495bSYour Name
qdf_flex_mem_alloc(struct qdf_flex_mem_pool * pool)106*5113495bSYour Name void *qdf_flex_mem_alloc(struct qdf_flex_mem_pool *pool)
107*5113495bSYour Name {
108*5113495bSYour Name void *ptr;
109*5113495bSYour Name
110*5113495bSYour Name QDF_BUG(pool);
111*5113495bSYour Name if (!pool)
112*5113495bSYour Name return NULL;
113*5113495bSYour Name
114*5113495bSYour Name qdf_spin_lock_bh(&pool->lock);
115*5113495bSYour Name ptr = __qdf_flex_mem_alloc(pool);
116*5113495bSYour Name qdf_spin_unlock_bh(&pool->lock);
117*5113495bSYour Name
118*5113495bSYour Name return ptr;
119*5113495bSYour Name }
120*5113495bSYour Name qdf_export_symbol(qdf_flex_mem_alloc);
121*5113495bSYour Name
qdf_flex_mem_seg_free(struct qdf_flex_mem_pool * pool,struct qdf_flex_mem_segment * seg)122*5113495bSYour Name static void qdf_flex_mem_seg_free(struct qdf_flex_mem_pool *pool,
123*5113495bSYour Name struct qdf_flex_mem_segment *seg)
124*5113495bSYour Name {
125*5113495bSYour Name if (!seg->dynamic)
126*5113495bSYour Name return;
127*5113495bSYour Name
128*5113495bSYour Name if (qdf_list_size(&pool->seg_list) <= pool->reduction_limit)
129*5113495bSYour Name return;
130*5113495bSYour Name
131*5113495bSYour Name qdf_list_remove_node(&pool->seg_list, &seg->node);
132*5113495bSYour Name qdf_tfree(seg);
133*5113495bSYour Name }
134*5113495bSYour Name
__qdf_flex_mem_free(struct qdf_flex_mem_pool * pool,void * ptr)135*5113495bSYour Name static void __qdf_flex_mem_free(struct qdf_flex_mem_pool *pool, void *ptr)
136*5113495bSYour Name {
137*5113495bSYour Name struct qdf_flex_mem_segment *seg;
138*5113495bSYour Name void *low_addr;
139*5113495bSYour Name void *high_addr;
140*5113495bSYour Name unsigned long index;
141*5113495bSYour Name
142*5113495bSYour Name qdf_list_for_each(&pool->seg_list, seg, node) {
143*5113495bSYour Name low_addr = seg->bytes;
144*5113495bSYour Name high_addr = low_addr + pool->item_size * QDF_FM_BITMAP_BITS;
145*5113495bSYour Name
146*5113495bSYour Name if (ptr < low_addr || ptr > high_addr)
147*5113495bSYour Name continue;
148*5113495bSYour Name
149*5113495bSYour Name index = (ptr - low_addr) / pool->item_size;
150*5113495bSYour Name QDF_BUG(index < QDF_FM_BITMAP_BITS);
151*5113495bSYour Name
152*5113495bSYour Name seg->used_bitmap ^= (QDF_FM_BITMAP)1 << index;
153*5113495bSYour Name if (!seg->used_bitmap)
154*5113495bSYour Name qdf_flex_mem_seg_free(pool, seg);
155*5113495bSYour Name
156*5113495bSYour Name return;
157*5113495bSYour Name }
158*5113495bSYour Name
159*5113495bSYour Name QDF_DEBUG_PANIC("Failed to find pointer in segment pool");
160*5113495bSYour Name }
161*5113495bSYour Name
qdf_flex_mem_free(struct qdf_flex_mem_pool * pool,void * ptr)162*5113495bSYour Name void qdf_flex_mem_free(struct qdf_flex_mem_pool *pool, void *ptr)
163*5113495bSYour Name {
164*5113495bSYour Name QDF_BUG(pool);
165*5113495bSYour Name if (!pool)
166*5113495bSYour Name return;
167*5113495bSYour Name
168*5113495bSYour Name QDF_BUG(ptr);
169*5113495bSYour Name if (!ptr)
170*5113495bSYour Name return;
171*5113495bSYour Name
172*5113495bSYour Name qdf_spin_lock_bh(&pool->lock);
173*5113495bSYour Name __qdf_flex_mem_free(pool, ptr);
174*5113495bSYour Name qdf_spin_unlock_bh(&pool->lock);
175*5113495bSYour Name }
176*5113495bSYour Name qdf_export_symbol(qdf_flex_mem_free);
177*5113495bSYour Name
178