mirror of
https://github.com/msgpack/msgpack-c.git
synced 2025-03-20 13:33:51 +01:00
225 lines
4.8 KiB
C
225 lines
4.8 KiB
C
/*
|
||
* MessagePack for C memory pool implementation
|
||
*
|
||
* Copyright (C) 2008-2009 FURUHASHI Sadayuki
|
||
*
|
||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||
* you may not use this file except in compliance with the License.
|
||
* You may obtain a copy of the License at
|
||
*
|
||
* http://www.apache.org/licenses/LICENSE-2.0
|
||
*
|
||
* Unless required by applicable law or agreed to in writing, software
|
||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||
* See the License for the specific language governing permissions and
|
||
* limitations under the License.
|
||
*/
|
||
#include "msgpack/zone.h"
|
||
#include <stdlib.h>
|
||
#include <string.h>
|
||
|
||
struct msgpack_zone_chunk {
|
||
struct msgpack_zone_chunk* next;
|
||
/* data ... */
|
||
};
|
||
|
||
static inline bool init_chunk_list(msgpack_zone_chunk_list* cl, size_t chunk_size)
|
||
{
|
||
msgpack_zone_chunk* chunk = (msgpack_zone_chunk*)malloc(
|
||
sizeof(msgpack_zone_chunk) + chunk_size);
|
||
if(chunk == NULL) {
|
||
return false;
|
||
}
|
||
|
||
cl->head = chunk;
|
||
cl->free = chunk_size;
|
||
cl->ptr = ((char*)chunk) + sizeof(msgpack_zone_chunk);
|
||
chunk->next = NULL;
|
||
|
||
return true;
|
||
}
|
||
|
||
static inline void destroy_chunk_list(msgpack_zone_chunk_list* cl)
|
||
{
|
||
msgpack_zone_chunk* c = cl->head;
|
||
while(true) {
|
||
msgpack_zone_chunk* n = c->next;
|
||
free(c);
|
||
if(n != NULL) {
|
||
c = n;
|
||
} else {
|
||
break;
|
||
}
|
||
}
|
||
}
|
||
|
||
static inline void clear_chunk_list(msgpack_zone_chunk_list* cl, size_t chunk_size)
|
||
{
|
||
msgpack_zone_chunk* c = cl->head;
|
||
while(true) {
|
||
msgpack_zone_chunk* n = c->next;
|
||
if(n != NULL) {
|
||
free(c);
|
||
c = n;
|
||
} else {
|
||
break;
|
||
}
|
||
}
|
||
cl->head->next = NULL;
|
||
cl->free = chunk_size;
|
||
cl->ptr = ((char*)cl->head) + sizeof(msgpack_zone_chunk);
|
||
}
|
||
|
||
void* msgpack_zone_malloc_expand(msgpack_zone* zone, size_t size)
|
||
{
|
||
msgpack_zone_chunk_list* const cl = &zone->chunk_list;
|
||
|
||
size_t sz = zone->chunk_size;
|
||
|
||
while(sz < size) {
|
||
sz *= 2;
|
||
}
|
||
|
||
msgpack_zone_chunk* chunk = (msgpack_zone_chunk*)malloc(
|
||
sizeof(msgpack_zone_chunk) + sz);
|
||
|
||
char* ptr = ((char*)chunk) + sizeof(msgpack_zone_chunk);
|
||
|
||
chunk->next = cl->head;
|
||
cl->head = chunk;
|
||
cl->free = sz - size;
|
||
cl->ptr = ptr + size;
|
||
|
||
return ptr;
|
||
}
|
||
|
||
|
||
static inline void init_finalizer_array(msgpack_zone_finalizer_array* fa)
|
||
{
|
||
fa->tail = NULL;
|
||
fa->end = NULL;
|
||
fa->array = NULL;
|
||
}
|
||
|
||
static inline void call_finalizer_array(msgpack_zone_finalizer_array* fa)
|
||
{
|
||
// 逆順に呼び出し
|
||
msgpack_zone_finalizer* fin = fa->tail;
|
||
for(; fin != fa->array; --fin) {
|
||
(*(fin-1)->func)((fin-1)->data);
|
||
}
|
||
}
|
||
|
||
static inline void destroy_finalizer_array(msgpack_zone_finalizer_array* fa)
|
||
{
|
||
call_finalizer_array(fa);
|
||
free(fa->array);
|
||
}
|
||
|
||
static inline void clear_finalizer_array(msgpack_zone_finalizer_array* fa)
|
||
{
|
||
call_finalizer_array(fa);
|
||
fa->tail = fa->array;
|
||
}
|
||
|
||
bool msgpack_zone_push_finalizer_expand(msgpack_zone* zone,
|
||
void (*func)(void* data), void* data)
|
||
{
|
||
msgpack_zone_finalizer_array* const fa = &zone->finalizer_array;
|
||
|
||
const size_t nused = fa->end - fa->array;
|
||
|
||
size_t nnext;
|
||
if(nused == 0) {
|
||
// 初回の呼び出し:fa->tail == fa->end == fa->array == NULL
|
||
|
||
// glibcは72バイト以下のmallocが高速
|
||
nnext = (sizeof(msgpack_zone_finalizer) < 72/2) ?
|
||
72 / sizeof(msgpack_zone_finalizer) : 8;
|
||
|
||
} else {
|
||
nnext = nused * 2;
|
||
}
|
||
|
||
msgpack_zone_finalizer* tmp =
|
||
(msgpack_zone_finalizer*)realloc(fa->array,
|
||
sizeof(msgpack_zone_finalizer) * nnext);
|
||
if(tmp == NULL) {
|
||
return false;
|
||
}
|
||
|
||
fa->array = tmp;
|
||
fa->end = tmp + nnext;
|
||
fa->tail = tmp + nused;
|
||
|
||
fa->tail->func = func;
|
||
fa->tail->data = data;
|
||
|
||
++fa->tail;
|
||
|
||
return true;
|
||
}
|
||
|
||
|
||
bool msgpack_zone_is_empty(msgpack_zone* zone)
|
||
{
|
||
msgpack_zone_chunk_list* const cl = &zone->chunk_list;
|
||
msgpack_zone_finalizer_array* const fa = &zone->finalizer_array;
|
||
return cl->free == zone->chunk_size && cl->head->next == NULL &&
|
||
fa->tail == fa->array;
|
||
}
|
||
|
||
|
||
void msgpack_zone_destroy(msgpack_zone* zone)
|
||
{
|
||
destroy_finalizer_array(&zone->finalizer_array);
|
||
destroy_chunk_list(&zone->chunk_list);
|
||
}
|
||
|
||
void msgpack_zone_clear(msgpack_zone* zone)
|
||
{
|
||
clear_finalizer_array(&zone->finalizer_array);
|
||
clear_chunk_list(&zone->chunk_list, zone->chunk_size);
|
||
}
|
||
|
||
bool msgpack_zone_init(msgpack_zone* zone, size_t chunk_size)
|
||
{
|
||
zone->chunk_size = chunk_size;
|
||
|
||
if(!init_chunk_list(&zone->chunk_list, chunk_size)) {
|
||
return false;
|
||
}
|
||
|
||
init_finalizer_array(&zone->finalizer_array);
|
||
|
||
return true;
|
||
}
|
||
|
||
msgpack_zone* msgpack_zone_new(size_t chunk_size)
|
||
{
|
||
msgpack_zone* zone = (msgpack_zone*)malloc(
|
||
sizeof(msgpack_zone) + chunk_size);
|
||
if(zone == NULL) {
|
||
return NULL;
|
||
}
|
||
|
||
zone->chunk_size = chunk_size;
|
||
|
||
if(!init_chunk_list(&zone->chunk_list, chunk_size)) {
|
||
free(zone);
|
||
return false;
|
||
}
|
||
|
||
init_finalizer_array(&zone->finalizer_array);
|
||
|
||
return zone;
|
||
}
|
||
|
||
void msgpack_zone_free(msgpack_zone* zone)
|
||
{
|
||
msgpack_zone_destroy(zone);
|
||
free(zone);
|
||
}
|
||
|