#ifndef _LH3_KLIST_H
#define _LH3_KLIST_H

#include <stdlib.h>

#define KMEMPOOL_INIT(name, kmptype_t, kmpfree_f)						\
	typedef struct {													\
		size_t cnt, n, max;												\
		kmptype_t **buf;												\
	} kmp_##name##_t;													\
	static inline kmp_##name##_t *kmp_init_##name() {					\
		return calloc(1, sizeof(kmp_##name##_t));						\
	}																	\
	static inline void kmp_destroy_##name(kmp_##name##_t *mp) {			\
		size_t k;														\
		for (k = 0; k < mp->n; ++k) {									\
			kmpfree_f(mp->buf[k]); free(mp->buf[k]);					\
		}																\
		free(mp->buf); free(mp);										\
	}																	\
	static inline kmptype_t *kmp_alloc_##name(kmp_##name##_t *mp) {		\
		++mp->cnt;														\
		if (mp->n == 0) return calloc(1, sizeof(kmptype_t));			\
		return mp->buf[--mp->n];										\
	}																	\
	static inline void kmp_free_##name(kmp_##name##_t *mp, kmptype_t *p) { \
		--mp->cnt;														\
		if (mp->n == mp->max) {											\
			mp->max = mp->max? mp->max<<1 : 16;							\
			mp->buf = realloc(mp->buf, sizeof(void*) * mp->max);		\
		}																\
		mp->buf[mp->n++] = p;											\
	}

#define kmempool_t(name) kmp_##name##_t
#define kmp_init(name) kmp_init_##name()
#define kmp_destroy(name, mp) kmp_destroy_##name(mp)
#define kmp_alloc(name, mp) kmp_alloc_##name(mp)
#define kmp_free(name, mp, p) kmp_free_##name(mp, p)

#define KLIST_INIT(name, kltype_t, kmpfree_t)							\
	struct __kl1_##name {												\
		kltype_t data;													\
		struct __kl1_##name *next;										\
	};																	\
	typedef struct __kl1_##name kl1_##name;								\
	KMEMPOOL_INIT(name, kl1_##name, kmpfree_t)							\
	typedef struct {													\
		kl1_##name *head, *tail;										\
		kmp_##name##_t *mp;												\
		size_t size;													\
	} kl_##name##_t;													\
	static inline kl_##name##_t *kl_init_##name() {						\
		kl_##name##_t *kl = calloc(1, sizeof(kl_##name##_t));			\
		kl->mp = kmp_init(name);										\
		kl->head = kl->tail = kmp_alloc(name, kl->mp);					\
		kl->head->next = 0;												\
		return kl;														\
	}																	\
	static inline void kl_destroy_##name(kl_##name##_t *kl) {			\
		kl1_##name *p;													\
		for (p = kl->head; p != kl->tail; p = p->next)					\
			kmp_free(name, kl->mp, p);									\
		kmp_free(name, kl->mp, p);										\
		kmp_destroy(name, kl->mp);										\
		free(kl);														\
	}																	\
	static inline kltype_t *kl_pushp_##name(kl_##name##_t *kl) {		\
		kl1_##name *q, *p = kmp_alloc(name, kl->mp);					\
		q = kl->tail; p->next = 0; kl->tail->next = p; kl->tail = p;	\
		++kl->size;														\
		return &q->data;												\
	}																	\
	static inline int kl_shift_##name(kl_##name##_t *kl, kltype_t *d) { \
		kl1_##name *p;													\
		if (kl->head->next == 0) return -1;								\
		--kl->size;														\
		p = kl->head; kl->head = kl->head->next;						\
		if (d) *d = p->data;											\
		kmp_free(name, kl->mp, p);										\
		return 0;														\
	}

#define kliter_t(name) kl1_##name
#define klist_t(name) kl_##name##_t
#define kl_val(iter) ((iter)->data)
#define kl_next(iter) ((iter)->next)
#define kl_begin(kl) ((kl)->head)
#define kl_end(kl) ((kl)->tail)

#define kl_init(name) kl_init_##name()
#define kl_destroy(name, kl) kl_destroy_##name(kl)
#define kl_pushp(name, kl) kl_pushp_##name(kl)
#define kl_shift(name, kl, d) kl_shift_##name(kl, d)

#endif