diff options
author | Daniel Baumann <daniel.baumann@progress-linux.org> | 2024-04-28 09:51:24 +0000 |
---|---|---|
committer | Daniel Baumann <daniel.baumann@progress-linux.org> | 2024-04-28 09:51:24 +0000 |
commit | f7548d6d28c313cf80e6f3ef89aed16a19815df1 (patch) | |
tree | a3f6f2a3f247293bee59ecd28e8cd8ceb6ca064a /src/lib/aqueue.h | |
parent | Initial commit. (diff) | |
download | dovecot-f7548d6d28c313cf80e6f3ef89aed16a19815df1.tar.xz dovecot-f7548d6d28c313cf80e6f3ef89aed16a19815df1.zip |
Adding upstream version 1:2.3.19.1+dfsg1.upstream/1%2.3.19.1+dfsg1upstream
Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>
Diffstat (limited to 'src/lib/aqueue.h')
-rw-r--r-- | src/lib/aqueue.h | 41 |
1 files changed, 41 insertions, 0 deletions
diff --git a/src/lib/aqueue.h b/src/lib/aqueue.h new file mode 100644 index 0000000..fffe310 --- /dev/null +++ b/src/lib/aqueue.h @@ -0,0 +1,41 @@ +#ifndef AQUEUE_H +#define AQUEUE_H + +/* Dynamically growing queue. Use the array directly to access the data, + for example: + + count = queue_count(queue); + for (i = 0; i < count; i++) { + data = array[queue_idx(i)]; + } +*/ + +struct aqueue { + struct array *arr; + unsigned int head, tail, area_size; + bool full; +}; + +struct aqueue *aqueue_init(struct array *array); +void aqueue_deinit(struct aqueue **aqueue); + +/* Append item to head */ +void aqueue_append(struct aqueue *aqueue, const void *data); +/* Delete last item from tail */ +void aqueue_delete_tail(struct aqueue *aqueue); +/* Remove item from n'th position */ +void aqueue_delete(struct aqueue *aqueue, unsigned int n); +/* Clear the entire aqueue */ +void aqueue_clear(struct aqueue *aqueue); + +/* Returns the number of items in aqueue. */ +unsigned int aqueue_count(const struct aqueue *aqueue) ATTR_PURE; + +/* Returns array index of n'th element in aqueue. */ +static inline unsigned int ATTR_PURE +aqueue_idx(const struct aqueue *aqueue, unsigned int n) +{ + return (aqueue->tail + n) % aqueue->area_size; +} + +#endif |