|
Packit |
345191 |
#ifndef JEMALLOC_INTERNAL_QR_H
|
|
Packit |
345191 |
#define JEMALLOC_INTERNAL_QR_H
|
|
Packit |
345191 |
|
|
Packit |
345191 |
/* Ring definitions. */
|
|
Packit |
345191 |
#define qr(a_type) \
|
|
Packit |
345191 |
struct { \
|
|
Packit |
345191 |
a_type *qre_next; \
|
|
Packit |
345191 |
a_type *qre_prev; \
|
|
Packit |
345191 |
}
|
|
Packit |
345191 |
|
|
Packit |
345191 |
/* Ring functions. */
|
|
Packit |
345191 |
#define qr_new(a_qr, a_field) do { \
|
|
Packit |
345191 |
(a_qr)->a_field.qre_next = (a_qr); \
|
|
Packit |
345191 |
(a_qr)->a_field.qre_prev = (a_qr); \
|
|
Packit |
345191 |
} while (0)
|
|
Packit |
345191 |
|
|
Packit |
345191 |
#define qr_next(a_qr, a_field) ((a_qr)->a_field.qre_next)
|
|
Packit |
345191 |
|
|
Packit |
345191 |
#define qr_prev(a_qr, a_field) ((a_qr)->a_field.qre_prev)
|
|
Packit |
345191 |
|
|
Packit |
345191 |
#define qr_before_insert(a_qrelm, a_qr, a_field) do { \
|
|
Packit |
345191 |
(a_qr)->a_field.qre_prev = (a_qrelm)->a_field.qre_prev; \
|
|
Packit |
345191 |
(a_qr)->a_field.qre_next = (a_qrelm); \
|
|
Packit |
345191 |
(a_qr)->a_field.qre_prev->a_field.qre_next = (a_qr); \
|
|
Packit |
345191 |
(a_qrelm)->a_field.qre_prev = (a_qr); \
|
|
Packit |
345191 |
} while (0)
|
|
Packit |
345191 |
|
|
Packit |
345191 |
#define qr_after_insert(a_qrelm, a_qr, a_field) do { \
|
|
Packit |
345191 |
(a_qr)->a_field.qre_next = (a_qrelm)->a_field.qre_next; \
|
|
Packit |
345191 |
(a_qr)->a_field.qre_prev = (a_qrelm); \
|
|
Packit |
345191 |
(a_qr)->a_field.qre_next->a_field.qre_prev = (a_qr); \
|
|
Packit |
345191 |
(a_qrelm)->a_field.qre_next = (a_qr); \
|
|
Packit |
345191 |
} while (0)
|
|
Packit |
345191 |
|
|
Packit |
345191 |
#define qr_meld(a_qr_a, a_qr_b, a_type, a_field) do { \
|
|
Packit |
345191 |
a_type *t; \
|
|
Packit |
345191 |
(a_qr_a)->a_field.qre_prev->a_field.qre_next = (a_qr_b); \
|
|
Packit |
345191 |
(a_qr_b)->a_field.qre_prev->a_field.qre_next = (a_qr_a); \
|
|
Packit |
345191 |
t = (a_qr_a)->a_field.qre_prev; \
|
|
Packit |
345191 |
(a_qr_a)->a_field.qre_prev = (a_qr_b)->a_field.qre_prev; \
|
|
Packit |
345191 |
(a_qr_b)->a_field.qre_prev = t; \
|
|
Packit |
345191 |
} while (0)
|
|
Packit |
345191 |
|
|
Packit |
345191 |
/*
|
|
Packit |
345191 |
* qr_meld() and qr_split() are functionally equivalent, so there's no need to
|
|
Packit |
345191 |
* have two copies of the code.
|
|
Packit |
345191 |
*/
|
|
Packit |
345191 |
#define qr_split(a_qr_a, a_qr_b, a_type, a_field) \
|
|
Packit |
345191 |
qr_meld((a_qr_a), (a_qr_b), a_type, a_field)
|
|
Packit |
345191 |
|
|
Packit |
345191 |
#define qr_remove(a_qr, a_field) do { \
|
|
Packit |
345191 |
(a_qr)->a_field.qre_prev->a_field.qre_next \
|
|
Packit |
345191 |
= (a_qr)->a_field.qre_next; \
|
|
Packit |
345191 |
(a_qr)->a_field.qre_next->a_field.qre_prev \
|
|
Packit |
345191 |
= (a_qr)->a_field.qre_prev; \
|
|
Packit |
345191 |
(a_qr)->a_field.qre_next = (a_qr); \
|
|
Packit |
345191 |
(a_qr)->a_field.qre_prev = (a_qr); \
|
|
Packit |
345191 |
} while (0)
|
|
Packit |
345191 |
|
|
Packit |
345191 |
#define qr_foreach(var, a_qr, a_field) \
|
|
Packit |
345191 |
for ((var) = (a_qr); \
|
|
Packit |
345191 |
(var) != NULL; \
|
|
Packit |
345191 |
(var) = (((var)->a_field.qre_next != (a_qr)) \
|
|
Packit |
345191 |
? (var)->a_field.qre_next : NULL))
|
|
Packit |
345191 |
|
|
Packit |
345191 |
#define qr_reverse_foreach(var, a_qr, a_field) \
|
|
Packit |
345191 |
for ((var) = ((a_qr) != NULL) ? qr_prev(a_qr, a_field) : NULL; \
|
|
Packit |
345191 |
(var) != NULL; \
|
|
Packit |
345191 |
(var) = (((var) != (a_qr)) \
|
|
Packit |
345191 |
? (var)->a_field.qre_prev : NULL))
|
|
Packit |
345191 |
|
|
Packit |
345191 |
#endif /* JEMALLOC_INTERNAL_QR_H */
|