13 static inline struct io_u *io_u_qpop(struct io_u_queue *q)
16 return q->io_us[--q->nr];
21 static inline void io_u_qpush(struct io_u_queue *q, struct io_u *io_u)
23 q->io_us[q->nr++] = io_u;
26 static inline int io_u_qempty(struct io_u_queue *q)
31 #define io_u_qiter(q, io_u, i) \
32 for (i = 0; i < (q)->nr && (io_u = (q)->io_us[i]); i++)
34 int io_u_qinit(struct io_u_queue *q, unsigned int nr);
35 void io_u_qexit(struct io_u_queue *q);
44 int io_u_rinit(struct io_u_ring *ring, unsigned int nr);
45 void io_u_rexit(struct io_u_ring *ring);
47 static inline void io_u_rpush(struct io_u_ring *r, struct io_u *io_u)
49 if (r->head + 1 != r->tail) {
50 r->ring[r->head] = io_u;
51 r->head = (r->head + 1) & (r->max - 1);
58 static inline struct io_u *io_u_rpop(struct io_u_ring *r)
60 if (r->head != r->tail) {
61 struct io_u *io_u = r->ring[r->tail];
63 r->tail = (r->tail + 1) & (r->max - 1);
70 static inline int io_u_rempty(struct io_u_ring *ring)
72 return ring->head == ring->tail;