1 /******************************************************************************/
2 /* pfixtools: a collection of postfix related tools */
4 /* ________________________________________________________________________ */
6 /* Redistribution and use in source and binary forms, with or without */
7 /* modification, are permitted provided that the following conditions */
10 /* 1. Redistributions of source code must retain the above copyright */
11 /* notice, this list of conditions and the following disclaimer. */
12 /* 2. Redistributions in binary form must reproduce the above copyright */
13 /* notice, this list of conditions and the following disclaimer in the */
14 /* documentation and/or other materials provided with the distribution. */
15 /* 3. The names of its contributors may not be used to endorse or promote */
16 /* products derived from this software without specific prior written */
19 /* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND */
20 /* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE */
21 /* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR */
22 /* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS */
23 /* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR */
24 /* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF */
25 /* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS */
26 /* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN */
27 /* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) */
28 /* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF */
29 /* THE POSSIBILITY OF SUCH DAMAGE. */
30 /******************************************************************************/
33 * Copyright © 2006 Pierre Habouzit
36 #ifndef PFIXTOOLS_MEM_H
37 #define PFIXTOOLS_MEM_H
44 #define MIN(a, b) ((a) < (b) ? (a) : (b))
45 #define MAX(a, b) ((a) > (b) ? (a) : (b))
47 #define ssizeof(foo) (ssize_t)sizeof(foo)
48 #define countof(foo) (ssizeof(foo) / ssizeof(foo[0]))
50 #define p_new(type, count) ((type *)xmalloc(sizeof(type) * (count)))
51 #define p_clear(p, count) ((void)memset((p), 0, sizeof(*(p)) * (count)))
52 #define p_dup(p, count) xmemdup((p), sizeof(*(p)) * (count))
53 #define p_dupstr(p, len) xmemdupstr((p), (len))
54 #define p_realloc(pp, count) xrealloc((void*)(pp), sizeof(**(pp)) * (count))
56 # define p_shrink(pp, goalnb, allocnb) \
58 if (*(allocnb) > (goalnb)) { \
59 p_realloc(pp, (goalnb)); \
60 *(allocnb) = (goalnb); \
64 # define p_alloc_nr(x) (((x) + 16) * 3 / 2)
65 # define p_allocgrow(pp, goalnb, allocnb) \
67 if ((goalnb) > *(allocnb)) { \
68 if (p_alloc_nr(goalnb) > *(allocnb)) { \
69 *(allocnb) = (goalnb); \
71 *(allocnb) = p_alloc_nr(goalnb); \
73 p_realloc(pp, *(allocnb)); \
79 # define p_delete(mem_pp) \
81 typeof(**(mem_pp)) **__ptr = (mem_pp); \
88 # define p_delete(mem_p) \
90 void *__ptr = (mem_p); \
92 *(void **)__ptr = NULL; \
97 static inline void *xmalloc(ssize_t size) {
103 mem = calloc(size, 1);
109 static inline void xmemfree(void **ptr) {
113 static inline void xrealloc(void **ptr, ssize_t newsize) {
117 *ptr = realloc(*ptr, newsize);
123 static inline void *xmemdup(const void *src, ssize_t size) {
124 return memcpy(xmalloc(size), src, size);
127 static inline void *xmemdupstr(const void *src, ssize_t len) {
128 char *res = memcpy(xmalloc(len + 1), src, len);
134 #define DO_INIT(type, prefix) \
135 static inline type * prefix##_init(type *var) { \
139 #define DO_WIPE(type, prefix) \
140 static inline void prefix##_wipe(type *var __attribute__((unused))) { }
142 #define DO_NEW(type, prefix) \
143 static inline type * prefix##_new(void) { \
144 return prefix##_init(p_new(type, 1)); \
146 #define DO_DELETE(type, prefix) \
147 static inline void __attribute__((nonnull)) \
148 prefix##_delete(type **var) { \
150 prefix##_wipe(*var); \
155 #endif /* PFIXTOOLS_MEM_H */