1 /* vim:expandtab:shiftwidth=2:tabstop=2:smarttab:
5 * Copyright (C) 2011 Data Differential, http://datadifferential.com/
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions are
11 * * Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
14 * * Redistributions in binary form must reproduce the above
15 * copyright notice, this list of conditions and the following disclaimer
16 * in the documentation and/or other materials provided with the
19 * * The names of its contributors may not be used to endorse or
20 * promote products derived from this software without specific prior
23 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
24 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
25 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
26 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
27 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
28 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
29 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
30 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
31 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
32 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
33 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
37 /* -*- Mode: C; tab-width: 4; c-basic-offset: 4; indent-tabs-mode: nil -*- */
38 #include "mem_config.h"
48 #include <libmemcachedprotocol/common.h>
51 const uint64_t redzone_pattern
= 0xdeadbeefcafebabe;
55 const size_t initial_pool_size
= 64;
57 cache_t
* cache_create(const char *name
, size_t bufsize
, size_t align
,
58 cache_constructor_t
* constructor
,
59 cache_destructor_t
* destructor
) {
60 cache_t
* ret
= calloc(1, sizeof(cache_t
));
61 size_t name_length
= strlen(name
);
62 char* nm
= calloc(1, (sizeof(char) * name_length
) +1);
63 memcpy(nm
, name
, name_length
);
64 void** ptr
= calloc(initial_pool_size
, bufsize
);
65 if (ret
== NULL
|| nm
== NULL
|| ptr
== NULL
||
66 pthread_mutex_init(&ret
->mutex
, NULL
) == -1) {
75 ret
->freetotal
= initial_pool_size
;
76 ret
->constructor
= constructor
;
77 ret
->destructor
= destructor
;
80 ret
->bufsize
= bufsize
+ 2 * sizeof(redzone_pattern
);
82 ret
->bufsize
= bufsize
;
90 static inline void* get_object(void *ptr
) {
99 void cache_destroy(cache_t
*cache
) {
100 while (cache
->freecurr
> 0) {
101 void *ptr
= cache
->ptr
[--cache
->freecurr
];
102 if (cache
->destructor
) {
103 cache
->destructor(get_object(ptr
), NULL
);
109 pthread_mutex_destroy(&cache
->mutex
);
112 void* cache_alloc(cache_t
*cache
) {
115 pthread_mutex_lock(&cache
->mutex
);
116 if (cache
->freecurr
> 0) {
117 ret
= cache
->ptr
[--cache
->freecurr
];
118 object
= get_object(ret
);
120 object
= ret
= malloc(cache
->bufsize
);
122 object
= get_object(ret
);
124 if (cache
->constructor
!= NULL
&&
125 cache
->constructor(object
, NULL
, 0) != 0) {
131 pthread_mutex_unlock(&cache
->mutex
);
134 if (object
!= NULL
) {
135 /* add a simple form of buffer-check */
137 *pre
= redzone_pattern
;
139 memcpy(((char*)ret
) + cache
->bufsize
- (2 * sizeof(redzone_pattern
)),
140 &redzone_pattern
, sizeof(redzone_pattern
));
147 void cache_free(cache_t
*cache
, void *ptr
) {
148 pthread_mutex_lock(&cache
->mutex
);
151 /* validate redzone... */
152 if (memcmp(((char*)ptr
) + cache
->bufsize
- (2 * sizeof(redzone_pattern
)),
153 &redzone_pattern
, sizeof(redzone_pattern
)) != 0) {
156 pthread_mutex_unlock(&cache
->mutex
);
161 if (*pre
!= redzone_pattern
) {
164 pthread_mutex_unlock(&cache
->mutex
);
169 if (cache
->freecurr
< cache
->freetotal
) {
170 cache
->ptr
[cache
->freecurr
++] = ptr
;
172 /* try to enlarge free connections array */
173 size_t newtotal
= cache
->freetotal
* 2;
174 void **new_free
= realloc(cache
->ptr
, sizeof(char *) * newtotal
);
176 cache
->freetotal
= newtotal
;
177 cache
->ptr
= new_free
;
178 cache
->ptr
[cache
->freecurr
++] = ptr
;
180 if (cache
->destructor
) {
181 cache
->destructor(ptr
, NULL
);
187 pthread_mutex_unlock(&cache
->mutex
);