Hash :
41f97665
Author :
Thomas de Grivel
Date :
2021-02-20T20:46:26
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75
/*
* Copyright 2018-2021 Thomas de Grivel <thoxdg@gmail.com>
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#ifndef QUEUE_H
#define QUEUE_H
/* static queue */
#define QUEUE_TYPE(type, size) \
type ## _queue_ ## size
#define QUEUE(type, size) \
struct QUEUE_TYPE(type, size) { \
unsigned int length; \
unsigned int read_index; \
unsigned int write_index; \
type item[size]; \
}
#define S_QUEUE_TYPE(type, size) \
s_ ## QUEUE_TYPE(type, size)
#define QUEUE_METHOD(type, size, method) \
QUEUE_TYPE(type, size) ## _ ## method
#define DEFINE_QUEUE(type, size) \
typedef QUEUE(type, size) S_QUEUE_TYPE(type, size); \
static void QUEUE_METHOD(type, size, init) \
(S_QUEUE_TYPE(type, size) *q) \
{ \
bzero(q, sizeof(q)); \
} \
static void QUEUE_METHOD(type, size, free) \
(S_QUEUE_TYPE(type, size) *q) \
{ \
bzero(q, sizeof(q)); \
} \
static int QUEUE_METHOD(type, size, enqueue) \
(S_QUEUE_TYPE(type, size) *q, type item) \
{ \
if (q->length < size) { \
unsigned int write_index = q->write_index; \
q->write_index = (q->write_index + 1) % size; \
q->item[write_index] = item; \
q->length++; \
return 0; \
} \
return -1; \
} \
static int QUEUE_METHOD(type, size, dequeue) \
(S_QUEUE_TYPE(type, size) *q, type *ptr) \
{ \
if (q->length > 0) { \
unsigned int read_index = q->read_index; \
q->read_index = (read_index + 1) % size; \
*ptr = q->item[read_index]; \
q->length--; \
return 0; \
} \
return -1; \
}
#endif