mars/lib_queue.h

247 lines
6.6 KiB
C
Raw Normal View History

2011-04-18 14:14:16 +00:00
// (c) 2011 Thomas Schoebel-Theuer / 1&1 Internet AG
#ifndef LIB_QUEUE_H
#define LIB_QUEUE_H
#define QUEUE_ANCHOR(PREFIX,KEYTYPE,HEAPTYPE) \
2011-04-20 14:26:44 +00:00
/* parameters */ \
2011-04-29 09:36:10 +00:00
wait_queue_head_t *q_event; \
2011-04-20 14:26:44 +00:00
atomic_t *q_contention; \
struct PREFIX##_queue *q_dep; \
2011-04-18 14:14:16 +00:00
/* readonly from outside */ \
atomic_t q_queued; \
atomic_t q_flying; \
atomic_t q_total; \
/* tunables */ \
int q_batchlen; \
int q_max_queued; \
int q_max_flying; \
int q_max_jiffies; \
int q_max_contention; \
int q_over_pressure; \
int q_io_prio; \
bool q_ordering; \
2011-06-30 13:15:52 +00:00
bool q_halted; \
bool q_unlimited; \
2011-04-29 09:36:10 +00:00
/* private */ \
spinlock_t q_lock; \
struct list_head q_anchor; \
struct pairing_heap_##HEAPTYPE *heap_high; \
struct pairing_heap_##HEAPTYPE *heap_low; \
long long q_last_insert; /* jiffies */ \
KEYTYPE heap_margin; \
KEYTYPE last_pos; \
2011-04-18 14:14:16 +00:00
#define QUEUE_FUNCTIONS(PREFIX,ELEM_TYPE,HEAD,KEYFN,KEYCMP,HEAPTYPE) \
\
static inline \
2011-04-29 09:36:10 +00:00
void q_##PREFIX##_trigger(struct PREFIX##_queue *q) \
{ \
if (q->q_event) { \
wake_up_interruptible(q->q_event); \
} \
} \
\
static inline \
2011-04-18 14:14:16 +00:00
void q_##PREFIX##_init(struct PREFIX##_queue *q) \
{ \
INIT_LIST_HEAD(&q->q_anchor); \
q->heap_low = NULL; \
q->heap_high = NULL; \
spin_lock_init(&q->q_lock); \
atomic_set(&q->q_queued, 0); \
atomic_set(&q->q_flying, 0); \
} \
\
static inline \
void q_##PREFIX##_insert(struct PREFIX##_queue *q, ELEM_TYPE *elem) \
{ \
unsigned long flags; \
\
traced_lock(&q->q_lock, flags); \
\
if (q->q_ordering) { \
struct pairing_heap_##HEAPTYPE **use = &q->heap_high; \
if (KEYCMP(KEYFN(elem), &q->heap_margin) <= 0) { \
use = &q->heap_low; \
} \
ph_insert_##HEAPTYPE(use, &elem->ph); \
} else { \
list_add_tail(&elem->HEAD, &q->q_anchor); \
} \
atomic_inc(&q->q_queued); \
atomic_inc(&q->q_total); \
q->q_last_insert = jiffies; \
\
traced_unlock(&q->q_lock, flags); \
2011-04-29 09:36:10 +00:00
\
q_##PREFIX##_trigger(q); \
2011-04-18 14:14:16 +00:00
} \
\
static inline \
void q_##PREFIX##_pushback(struct PREFIX##_queue *q, ELEM_TYPE *elem) \
{ \
unsigned long flags; \
\
if (q->q_ordering) { \
atomic_dec(&q->q_total); \
q_##PREFIX##_insert(q, elem); \
return; \
} \
\
traced_lock(&q->q_lock, flags); \
\
list_add(&elem->HEAD, &q->q_anchor); \
atomic_inc(&q->q_queued); \
\
traced_unlock(&q->q_lock, flags); \
} \
\
static inline \
ELEM_TYPE *q_##PREFIX##_fetch(struct PREFIX##_queue *q) \
{ \
ELEM_TYPE *elem = NULL; \
unsigned long flags; \
\
traced_lock(&q->q_lock, flags); \
\
if (q->q_ordering) { \
if (!q->heap_high) { \
q->heap_high = q->heap_low; \
q->heap_low = NULL; \
q->heap_margin = 0; \
q->last_pos = 0; \
} \
if (q->heap_high) { \
elem = container_of(q->heap_high, ELEM_TYPE, ph); \
\
if (unlikely(KEYCMP(KEYFN(elem), &q->last_pos) < 0)) { \
MARS_ERR("backskip pos %lld -> %lld\n", q->last_pos, KEYFN(elem)); \
} \
memcpy(&q->last_pos, KEYFN(elem), sizeof(q->last_pos)); \
\
if (KEYCMP(KEYFN(elem), &q->heap_margin) > 0) { \
memcpy(&q->heap_margin, KEYFN(elem), sizeof(q->heap_margin)); \
} \
ph_delete_min_##HEAPTYPE(&q->heap_high); \
atomic_dec(&q->q_queued); \
} \
} else if (!list_empty(&q->q_anchor)) { \
struct list_head *next = q->q_anchor.next; \
list_del_init(next); \
atomic_dec(&q->q_queued); \
elem = container_of(next, ELEM_TYPE, HEAD); \
} \
\
traced_unlock(&q->q_lock, flags); \
\
2011-04-29 09:36:10 +00:00
q_##PREFIX##_trigger(q); \
\
2011-04-18 14:14:16 +00:00
return elem; \
2011-04-20 14:26:44 +00:00
} \
\
static inline \
bool q_##PREFIX##_is_ready(struct logger_queue *q) \
{ \
struct PREFIX##_queue *dep; \
int queued = atomic_read(&q->q_queued); \
int contention; \
int max_contention; \
2011-06-30 13:15:52 +00:00
int max_flying; \
2011-04-20 14:26:44 +00:00
int over; \
int flying; \
bool res = false; \
\
/* 1) when empty, there is nothing to do. \
*/ \
if (queued <= 0) \
goto always_done; \
\
2011-06-30 13:15:52 +00:00
/* 2) check whether queue is halted or unlimited \
*/ \
if (q->q_halted) \
goto always_done; \
max_flying = q->q_max_flying; \
if (q->q_unlimited) { \
res = true; \
max_flying += 512; \
goto limit; \
} \
\
2011-04-20 14:26:44 +00:00
/* compute some characteristic measures \
*/ \
contention = 0; \
if (q->q_contention) { \
contention = atomic_read(q->q_contention); \
} \
dep = q->q_dep; \
while (dep) { \
contention += atomic_read(&dep->q_queued) + atomic_read(&dep->q_flying); \
dep = dep->q_dep; \
} \
max_contention = q->q_max_contention; \
over = queued - q->q_max_queued; \
if (over > 0 && q->q_over_pressure > 0) { \
max_contention += over / q->q_over_pressure; \
} \
\
/* 3) when other queues are too much contended, \
* refrain from contending the IO system even more. \
*/ \
if (contention > max_contention) { \
goto always_done; \
} \
\
/* 4) when the maximum queue length is reached, start IO. \
*/ \
res = true; \
if (over > 0) \
goto limit; \
\
/* 5) also start IO when queued requests are too old \
* (measured in realtime) \
*/ \
if (q->q_max_jiffies > 0 && \
2011-04-29 09:36:10 +00:00
(long long)jiffies - q->q_last_insert >= q->q_max_jiffies) { \
2011-04-20 14:26:44 +00:00
goto limit; \
2011-04-29 09:36:10 +00:00
} \
2011-04-20 14:26:44 +00:00
\
/* 6) when no contention, start draining the queue. \
*/ \
if (contention <= 0) \
goto limit; \
\
res = false; \
goto always_done; \
\
limit: \
/* Limit the number of flying requests (parallelism) \
*/ \
flying = atomic_read(&q->q_flying); \
2011-06-30 13:15:52 +00:00
if (max_flying > 0 && flying >= max_flying) { \
2011-04-20 14:26:44 +00:00
res = false; \
2011-04-29 09:36:10 +00:00
} \
2011-04-20 14:26:44 +00:00
\
always_done: \
return res; \
} \
2011-04-29 09:36:10 +00:00
\
static inline \
void q_##PREFIX##_inc_flying(struct PREFIX##_queue *q) \
{ \
atomic_inc(&q->q_flying); \
q_##PREFIX##_trigger(q); \
} \
\
static inline \
void q_##PREFIX##_dec_flying(struct PREFIX##_queue *q) \
{ \
atomic_dec(&q->q_flying); \
q_##PREFIX##_trigger(q); \
} \
\
2011-04-18 14:14:16 +00:00
#endif