17 static inline struct io_u *io_u_qpop(struct io_u_queue *q)
20 const unsigned int next = --q->nr;
21 struct io_u *io_u = q->io_us[next];
23 q->io_us[next] = NULL;
30 static inline void io_u_qpush(struct io_u_queue *q, struct io_u *io_u)
33 q->io_us[q->nr++] = io_u;
40 static inline int io_u_qempty(const struct io_u_queue *q)
45 #define io_u_qiter(q, io_u, i) \
46 for (i = 0; i < (q)->nr && (io_u = (q)->io_us[i]); i++)
48 bool io_u_qinit(struct io_u_queue *q, unsigned int nr);
49 void io_u_qexit(struct io_u_queue *q);
58 bool io_u_rinit(struct io_u_ring *ring, unsigned int nr);
59 void io_u_rexit(struct io_u_ring *ring);
61 static inline void io_u_rpush(struct io_u_ring *r, struct io_u *io_u)
63 if (r->head + 1 != r->tail) {
64 r->ring[r->head] = io_u;
65 r->head = (r->head + 1) & (r->max - 1);
72 static inline struct io_u *io_u_rpop(struct io_u_ring *r)
74 if (r->head != r->tail) {
75 struct io_u *io_u = r->ring[r->tail];
77 r->tail = (r->tail + 1) & (r->max - 1);
84 static inline int io_u_rempty(struct io_u_ring *ring)
86 return ring->head == ring->tail;