1 #ifndef BGLIBS__GENERIC_QUEUE__H__
2 #define BGLIBS__GENERIC_QUEUE__H__
4 #include "adt_common.h"
45 #define GQUEUE_DECL(PREFIX,TYPE) \
46 extern int PREFIX##_push(struct gqueue* q, TYPE const* data); \
47 extern TYPE* PREFIX##_top(struct gqueue* q); \
48 extern void PREFIX##_pop(struct gqueue* q);
51 #define GQUEUE_PUSH_DEFN(PREFIX,TYPE,COPY) \
52 int PREFIX##_push(struct gqueue* q, TYPE const* data) { \
53 return gqueue_push(q, sizeof *data, data, (adt_copy_fn*)COPY); \
57 #define GQUEUE_TOP_DEFN(PREFIX,TYPE) \
58 TYPE* PREFIX##_top(struct gqueue* q) { \
59 return (q->head == 0) ? 0 : (TYPE*)q->head->data; \
63 #define GQUEUE_POP_DEFN(PREFIX,FREE) \
64 void PREFIX##_pop(struct gqueue* q) { \
65 gqueue_pop(q, (adt_free_fn*)(FREE)); \
71 #define GQUEUE_DEFN(PREFIX,TYPE,COPY,FREE) \
72 GQUEUE_PUSH_DEFN(PREFIX,TYPE,COPY) \
73 GQUEUE_TOP_DEFN(PREFIX,TYPE) \
74 GQUEUE_POP_DEFN(PREFIX,FREE)
char * s
Definition: str.h:36
unsigned count
Definition: ghash.h:31
unsigned long adt_hash_t
Definition: adt_common.h:10
int adt_cmp_fn(const void *, const void *)
Definition: adt_common.h:20
int adt_copy_fn(void *, const void *)
Definition: adt_common.h:16
int ghash_rehash(struct ghash *d)
Definition: ghash_rehash.c:8
#define ghash_entry_hash(P)
Definition: ghash.h:55
void ghash_free(struct ghash *d)
Definition: ghash_free.c:7
unsigned size
Definition: ghash.h:33
unsigned index
Definition: ghash.h:222
unsigned long entrysize
Definition: ghash.h:38
int ghashiter_valid(const struct ghashiter *iter)
Definition: ghash_iter.c:21
void * entry
Definition: ghash.h:224
void gqueue_pop(struct gqueue *q, adt_free_fn *fn)
Definition: gqueue_pop.c:9
void ghash_foreach(struct ghash *d, void(*fn)(void *entry))
Definition: ghash_foreach.c:4
const struct ghash * ghashp
Definition: ghash.h:220
adt_copy_fn * keycopy
Definition: ghash.h:45
unsigned len
Definition: str.h:40
unsigned long keysize
Definition: ghash.h:36
#define ghash_entry_dataptr(P, L)
Definition: ghash.h:60
struct gqueue_node * head
Definition: gqueue.h:32
int ghash_remove(struct ghash *d, const void *key)
Definition: ghash_remove.c:12
struct gqueue_node * tail
Definition: gqueue.h:34
void ghash_insert(struct ghash *d, void *e)
Definition: ghash_insert.c:4
#define obuf_putstr(out, str)
Definition: obuf.h:89
void ** ghash_find(struct ghash *d, const void *key)
Definition: ghash_get.c:7
adt_free_fn * keyfree
Definition: ghash.h:49
adt_copy_fn * datacopy
Definition: ghash.h:47
int ghash_rebuild(struct ghash *d)
Definition: ghash_rebuild.c:9
void * ghash_get(struct ghash *d, const void *key)
Definition: ghash_get.c:37
struct gqueue_node * next
Definition: gqueue.h:23
adt_cmp_fn * keycmp
Definition: ghash.h:43
void * ghash_set(struct ghash *d, const void *key, const void *data)
Definition: ghash_set.c:5
void ghashiter_first(struct ghashiter *iter, const struct ghash *h)
Definition: ghash_iter.c:14
char data[0]
Definition: gqueue.h:25
void ghashiter_next(struct ghashiter *iter)
Definition: ghash_iter.c:29
adt_hash_t adt_hash_fn(const void *)
Definition: adt_common.h:22
obuf outbuf
Definition: obuf_stdout.c:7
void * gqueue_top(const struct gqueue *q)
Definition: gqueue_top.c:5
void * ghash_add(struct ghash *d, const void *key, const void *data)
Definition: ghash_add.c:74
void adt_free_fn(void *)
Definition: adt_common.h:12
void * ghash_search(struct ghash *d, int(*fn)(const void *entry))
Definition: ghash_search.c:5
void ghash_init(struct ghash *d, unsigned long keysize, unsigned long entrysize, adt_hash_fn *hashfn, adt_cmp_fn *keycmp, adt_copy_fn *keycopy, adt_copy_fn *datacopy, adt_free_fn *keyfree, adt_free_fn *datafree)
Definition: ghash_init.c:4
unsigned size
Definition: str.h:42
void ** table
Definition: ghash.h:29
adt_free_fn * datafree
Definition: ghash.h:51
int gqueue_push(struct gqueue *d, unsigned datasize, const void *data, adt_copy_fn *fn)
Definition: gqueue_push.c:8
unsigned count
Definition: gqueue.h:36
#define ghash_entry_keyptr(P)
Definition: ghash.h:57
adt_hash_fn * hashfn
Definition: ghash.h:41
int obuf_putc(obuf *out, char ch)
Definition: obuf_putc.c:4