| 3 |
* memory_pool |
* memory_pool |
| 4 |
* - memory pool |
* - memory pool |
| 5 |
* |
* |
| 6 |
* Copyright (C) 2004-2025 by Leaflet <leaflet@leafok.com> |
* Copyright (C) 2004-2026 Leaflet <leaflet@leafok.com> |
| 7 |
*/ |
*/ |
| 8 |
|
|
| 9 |
|
#ifdef HAVE_CONFIG_H |
| 10 |
|
#include "config.h" |
| 11 |
|
#endif |
| 12 |
|
|
| 13 |
#include "log.h" |
#include "log.h" |
| 14 |
#include "memory_pool.h" |
#include "memory_pool.h" |
| 15 |
#include <stdlib.h> |
#include <stdlib.h> |
| 21 |
|
|
| 22 |
if (node_size < sizeof(void *)) |
if (node_size < sizeof(void *)) |
| 23 |
{ |
{ |
| 24 |
log_error("Error: node_size < sizeof(void *)\n"); |
log_error("Error: node_size < sizeof(void *)"); |
| 25 |
return NULL; |
return NULL; |
| 26 |
} |
} |
| 27 |
|
|
| 28 |
p_pool = malloc(sizeof(MEMORY_POOL)); |
p_pool = malloc(sizeof(MEMORY_POOL)); |
| 29 |
if (p_pool == NULL) |
if (p_pool == NULL) |
| 30 |
{ |
{ |
| 31 |
log_error("malloc(MEMORY_POOL) error: OOM\n"); |
log_error("malloc(MEMORY_POOL) error: OOM"); |
| 32 |
return NULL; |
return NULL; |
| 33 |
} |
} |
| 34 |
|
|
| 41 |
p_pool->p_chunks = malloc(sizeof(void *) * (size_t)chunk_count_limit); |
p_pool->p_chunks = malloc(sizeof(void *) * (size_t)chunk_count_limit); |
| 42 |
if (p_pool->p_chunks == NULL) |
if (p_pool->p_chunks == NULL) |
| 43 |
{ |
{ |
| 44 |
log_error("malloc(sizeof(void *) * %d) error: OOM\n", chunk_count_limit); |
log_error("malloc(sizeof(void *) * %d) error: OOM", chunk_count_limit); |
| 45 |
free(p_pool); |
free(p_pool); |
| 46 |
return NULL; |
return NULL; |
| 47 |
} |
} |
| 62 |
|
|
| 63 |
if (p_pool->node_count_allocated > 0) |
if (p_pool->node_count_allocated > 0) |
| 64 |
{ |
{ |
| 65 |
log_error("Still have %d in-use nodes\n", p_pool->node_count_allocated); |
log_error("Still have %d in-use nodes", p_pool->node_count_allocated); |
| 66 |
} |
} |
| 67 |
|
|
| 68 |
while (p_pool->chunk_count > 0) |
while (p_pool->chunk_count > 0) |
| 83 |
|
|
| 84 |
if (p_pool->chunk_count >= p_pool->chunk_count_limit) |
if (p_pool->chunk_count >= p_pool->chunk_count_limit) |
| 85 |
{ |
{ |
| 86 |
log_error("Chunk count limit %d reached\n", p_pool->chunk_count); |
log_error("Chunk count limit %d reached", p_pool->chunk_count); |
| 87 |
return NULL; |
return NULL; |
| 88 |
} |
} |
| 89 |
p_chunk = malloc(p_pool->node_size * p_pool->node_count_per_chunk); |
p_chunk = malloc(p_pool->node_size * p_pool->node_count_per_chunk); |
| 90 |
if (p_chunk == NULL) |
if (p_chunk == NULL) |
| 91 |
{ |
{ |
| 92 |
log_error("malloc(%d * %d) error: OOM\n", p_pool->node_size, p_pool->node_count_per_chunk); |
log_error("malloc(%d * %d) error: OOM", p_pool->node_size, p_pool->node_count_per_chunk); |
| 93 |
return NULL; |
return NULL; |
| 94 |
} |
} |
| 95 |
|
|
| 117 |
|
|
| 118 |
if (p_pool == NULL) |
if (p_pool == NULL) |
| 119 |
{ |
{ |
| 120 |
log_error("NULL pointer error\n"); |
log_error("NULL pointer error"); |
| 121 |
return NULL; |
return NULL; |
| 122 |
} |
} |
| 123 |
|
|
| 124 |
if (p_pool->p_free == NULL && memory_pool_add_chunk(p_pool) == NULL) |
if (p_pool->p_free == NULL && memory_pool_add_chunk(p_pool) == NULL) |
| 125 |
{ |
{ |
| 126 |
log_error("Add chunk error\n"); |
log_error("Add chunk error"); |
| 127 |
return NULL; |
return NULL; |
| 128 |
} |
} |
| 129 |
|
|
| 140 |
{ |
{ |
| 141 |
if (p_pool == NULL) |
if (p_pool == NULL) |
| 142 |
{ |
{ |
| 143 |
log_error("NULL pointer error\n"); |
log_error("NULL pointer error"); |
| 144 |
return; |
return; |
| 145 |
} |
} |
| 146 |
|
|
| 163 |
|
|
| 164 |
if (p_pool == NULL || p_node == NULL) |
if (p_pool == NULL || p_node == NULL) |
| 165 |
{ |
{ |
| 166 |
log_error("NULL pointer error\n"); |
log_error("NULL pointer error"); |
| 167 |
return -1; |
return -1; |
| 168 |
} |
} |
| 169 |
|
|
| 179 |
} |
} |
| 180 |
else |
else |
| 181 |
{ |
{ |
| 182 |
log_error("Address of node (%p) is not aligned with border of chunk %d [%p, %p)\n", |
log_error("Address of node (%p) is not aligned with border of chunk %d [%p, %p)", |
| 183 |
i, p_node >= p_pool->p_chunks[i], (char *)(p_pool->p_chunks[i]) + chunk_size); |
i, p_node >= p_pool->p_chunks[i], (char *)(p_pool->p_chunks[i]) + chunk_size); |
| 184 |
return -3; |
return -3; |
| 185 |
} |
} |
| 186 |
} |
} |
| 187 |
} |
} |
| 188 |
|
|
| 189 |
log_error("Address of node is not in range of chunks\n"); |
log_error("Address of node is not in range of chunks"); |
| 190 |
return -2; |
return -2; |
| 191 |
} |
} |