| 197 | #define lqueue_enqueue(q_, e_) \ |
| 198 | lqueue_enqueue_(tcon_unwrap(q_), tcon_member_of((q_), canary, (e_))) |
| 199 | static inline void lqueue_enqueue_(struct lqueue_ *q, struct lqueue_link *e) |
| 200 | { |
| 201 | if (lqueue_empty_(q)) { |
| 202 | /* New entry will be both front and back of queue */ |
| 203 | e->next = e; |
| 204 | q->back = e; |
| 205 | } else { |
| 206 | e->next = lqueue_front_(q); |
| 207 | q->back->next = e; |
| 208 | q->back = e; |
| 209 | } |
| 210 | } |
| 211 | |
| 212 | /** |
| 213 | * lqueue_dequeue - remove and return the entry from the front of the queue |
nothing calls this directly
no test coverage detected