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
|
/*
* Copyright (c) 2016-2022 Bouffalolab.
*
* This file is part of
* *** Bouffalolab Software Dev Kit ***
* (see www.bouffalolab.com).
*
* Redistribution and use in source and binary forms, with or without modification,
* are permitted provided that the following conditions are met:
* 1. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
* 3. Neither the name of Bouffalo Lab nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include <stdint.h>
#include <FreeRTOS.h>
#include <utils_memp.h>
#define UTILS_MEMP_ALLOCED_NODE_PATTERN 0XA5
#define MEM_ALIGN(addr, align) (((addr) + (align) -1) & ~((align)-1))
int utils_memp_init(utils_memp_pool_t **pool, uint16_t node_size, uint16_t pool_cap, uint8_t align_req)
{
utils_memp_pool_t *npool;
struct utils_memp_node *node;
struct utils_memp_node *pool_mem;
size_t size;
uint16_t padded_node_size;
uint16_t i;
align_req = MEM_ALIGN(align_req, sizeof(void *));
padded_node_size = MEM_ALIGN(node_size + sizeof(struct utils_memp_node), align_req);
size = sizeof(utils_memp_pool_t);
size = MEM_ALIGN(size, align_req);
size += padded_node_size * pool_cap;
npool = pvPortMalloc(size);
if (!npool) {
return -1;
}
node = (struct utils_memp_node *)((uint8_t *)npool + (size - padded_node_size * pool_cap));
npool->first_node = node;
npool->node_size = node_size;
npool->pool_cap = pool_cap;
npool->pool_size = 0;
npool->align_req = align_req;
npool->padded_node_size = padded_node_size;
npool->mem = NULL;
pool_mem = npool->mem;
for(i = 0; i < pool_cap; ++i) {
node->next = pool_mem;
pool_mem = node;
node = (struct utils_memp_node *)((uint8_t *)node + padded_node_size);
}
npool->mem = pool_mem;
npool->last_node = npool->mem;
*pool = npool;
return 0;
}
int utils_memp_init_alloced(utils_memp_pool_t *pool, uint16_t node_size, uint16_t pool_cap, uint8_t align_req)
{
utils_memp_pool_t *npool = pool;
struct utils_memp_node *node;
struct utils_memp_node *pool_mem;
size_t size;
uint16_t padded_node_size;
uint16_t i;
align_req = MEM_ALIGN(align_req, sizeof(void *));
padded_node_size = MEM_ALIGN(node_size + sizeof(struct utils_memp_node), align_req);
size = sizeof(utils_memp_pool_t);
size = MEM_ALIGN(size, align_req);
size += padded_node_size * pool_cap;
node = (struct utils_memp_node *)((uint8_t *)npool + (size - padded_node_size * pool_cap));
npool->first_node = node;
npool->node_size = node_size;
npool->pool_cap = pool_cap;
npool->pool_size = 0;
npool->align_req = align_req;
npool->padded_node_size = padded_node_size;
npool->mem = NULL;
pool_mem = npool->mem;
for(i = 0; i < pool_cap; ++i) {
node->next = pool_mem;
pool_mem = node;
node = (struct utils_memp_node *)((uint8_t *)node + padded_node_size);
}
npool->mem = pool_mem;
npool->last_node = npool->mem;
return 0;
}
int utils_memp_deinit(utils_memp_pool_t *pool)
{
if (!pool) {
return -1;
}
vPortFree(pool);
return 0;
}
void *utils_memp_malloc(utils_memp_pool_t *pool)
{
struct utils_memp_node *node;
uint32_t *pat;
if (!pool) {
return NULL;
}
if (pool->pool_size == pool->pool_cap) {
return NULL;
}
node = pool->mem;
if (node != NULL) {
pool->mem = node->next;
pool->pool_size++;
pat = (uint32_t *)&node->next;
*pat = UTILS_MEMP_ALLOCED_NODE_PATTERN;
return (void *)node + sizeof(struct utils_memp_node);
} else {
return NULL;
}
}
int utils_memp_free(utils_memp_pool_t *pool, void *node)
{
struct utils_memp_node *utils_memp_node;
node = node - sizeof(struct utils_memp_node);
uint32_t *pat;
int diff;
if (!pool || !node) {
return -1;
}
if (pool->pool_size == 0) {
return -1;
}
if (!(node >= pool->first_node && node <= pool->last_node)) {
return -1;
}
diff = node - pool->first_node;
if (diff % pool->padded_node_size) {
return -1;
}
pat = (uint32_t *)(&((struct utils_memp_node *)node)->next);
if (*pat != UTILS_MEMP_ALLOCED_NODE_PATTERN) {
return -1;
}
utils_memp_node = (struct utils_memp_node*)node;
utils_memp_node->next = pool->mem;
pool->mem = utils_memp_node;
pool->pool_size--;
return 0;
}
|
