1 /* The MIT License 2 3 Copyright (c) 2008-2009, by Attractive Chaos <attractor@live.co.uk> 4 5 Permission is hereby granted, free of charge, to any person obtaining 6 a copy of this software and associated documentation files (the 7 "Software"), to deal in the Software without restriction, including 8 without limitation the rights to use, copy, modify, merge, publish, 9 distribute, sublicense, and/or sell copies of the Software, and to 10 permit persons to whom the Software is furnished to do so, subject to 11 the following conditions: 12 13 The above copyright notice and this permission notice shall be 14 included in all copies or substantial portions of the Software. 15 16 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 17 EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF 18 MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 19 NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS 20 BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN 21 ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN 22 CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE 23 SOFTWARE. 24 */ 25 26 #ifndef _AC_KLIST_H 27 #define _AC_KLIST_H 28 29 #include <stdlib.h> 30 31 #ifndef klib_unused 32 #if (defined __clang__ && __clang_major__ >= 3) || (defined __GNUC__ && __GNUC__ >= 3) 33 #define klib_unused __attribute__ ((__unused__)) 34 #else 35 #define klib_unused 36 #endif 37 #endif /* klib_unused */ 38 39 #define KMEMPOOL_INIT2(SCOPE, name, kmptype_t, kmpfree_f) \ 40 typedef struct { \ 41 size_t cnt, n, max; \ 42 kmptype_t **buf; \ 43 } kmp_##name##_t; \ 44 SCOPE kmp_##name##_t *kmp_init_##name(void) { \ 45 return calloc(1, sizeof(kmp_##name##_t)); \ 46 } \ 47 SCOPE void kmp_destroy_##name(kmp_##name##_t *mp) { \ 48 size_t k; \ 49 for (k = 0; k < mp->n; ++k) { \ 50 kmpfree_f(mp->buf[k]); free(mp->buf[k]); \ 51 } \ 52 free(mp->buf); free(mp); \ 53 } \ 54 SCOPE kmptype_t *kmp_alloc_##name(kmp_##name##_t *mp) { \ 55 ++mp->cnt; \ 56 if (mp->n == 0) return calloc(1, sizeof(kmptype_t)); \ 57 return mp->buf[--mp->n]; \ 58 } \ 59 SCOPE void kmp_free_##name(kmp_##name##_t *mp, kmptype_t *p) { \ 60 --mp->cnt; \ 61 if (mp->n == mp->max) { \ 62 mp->max = mp->max? mp->max<<1 : 16; \ 63 mp->buf = realloc(mp->buf, sizeof(kmptype_t *) * mp->max); \ 64 } \ 65 mp->buf[mp->n++] = p; \ 66 } 67 68 #define KMEMPOOL_INIT(name, kmptype_t, kmpfree_f) \ 69 KMEMPOOL_INIT2(static inline klib_unused, name, kmptype_t, kmpfree_f) 70 71 #define kmempool_t(name) kmp_##name##_t 72 #define kmp_init(name) kmp_init_##name() 73 #define kmp_destroy(name, mp) kmp_destroy_##name(mp) 74 #define kmp_alloc(name, mp) kmp_alloc_##name(mp) 75 #define kmp_free(name, mp, p) kmp_free_##name(mp, p) 76 77 #define KLIST_INIT2(SCOPE, name, kltype_t, kmpfree_t) \ 78 struct __kl1_##name { \ 79 kltype_t data; \ 80 struct __kl1_##name *next; \ 81 }; \ 82 typedef struct __kl1_##name kl1_##name; \ 83 KMEMPOOL_INIT2(SCOPE, name, kl1_##name, kmpfree_t) \ 84 typedef struct { \ 85 kl1_##name *head, *tail; \ 86 kmp_##name##_t *mp; \ 87 size_t size; \ 88 } kl_##name##_t; \ 89 SCOPE kl_##name##_t *kl_init_##name(void) { \ 90 kl_##name##_t *kl = calloc(1, sizeof(kl_##name##_t)); \ 91 kl->mp = kmp_init(name); \ 92 kl->head = kl->tail = kmp_alloc(name, kl->mp); \ 93 kl->head->next = 0; \ 94 return kl; \ 95 } \ 96 SCOPE void kl_destroy_##name(kl_##name##_t *kl) { \ 97 kl1_##name *p; \ 98 for (p = kl->head; p != kl->tail; p = p->next) \ 99 kmp_free(name, kl->mp, p); \ 100 kmp_free(name, kl->mp, p); \ 101 kmp_destroy(name, kl->mp); \ 102 free(kl); \ 103 } \ 104 SCOPE kltype_t *kl_pushp_##name(kl_##name##_t *kl) { \ 105 kl1_##name *q, *p = kmp_alloc(name, kl->mp); \ 106 q = kl->tail; p->next = 0; kl->tail->next = p; kl->tail = p; \ 107 ++kl->size; \ 108 return &q->data; \ 109 } \ 110 SCOPE int kl_shift_##name(kl_##name##_t *kl, kltype_t *d) { \ 111 kl1_##name *p; \ 112 if (kl->head->next == 0) return -1; \ 113 --kl->size; \ 114 p = kl->head; kl->head = kl->head->next; \ 115 if (d) *d = p->data; \ 116 kmp_free(name, kl->mp, p); \ 117 return 0; \ 118 } 119 120 #define KLIST_INIT(name, kltype_t, kmpfree_t) \ 121 KLIST_INIT2(static inline klib_unused, name, kltype_t, kmpfree_t) 122 123 #define kliter_t(name) kl1_##name 124 #define klist_t(name) kl_##name##_t 125 #define kl_val(iter) ((iter)->data) 126 #define kl_next(iter) ((iter)->next) 127 #define kl_begin(kl) ((kl)->head) 128 #define kl_end(kl) ((kl)->tail) 129 130 #define kl_init(name) kl_init_##name() 131 #define kl_destroy(name, kl) kl_destroy_##name(kl) 132 #define kl_pushp(name, kl) kl_pushp_##name(kl) 133 #define kl_shift(name, kl, d) kl_shift_##name(kl, d) 134 135 #endif 136