dllist.h 1.2 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455
  1. #ifndef DLLIST_H
  2. #define DLLIST_H
  3. struct dl_node
  4. {
  5. struct dl_node *next;
  6. struct dl_node *prev;
  7. };
  8. struct dl_head
  9. {
  10. struct dl_node *first;
  11. struct dl_node *null;
  12. struct dl_node *last;
  13. };
  14. static inline struct dl_head * dl_init(struct dl_head *h)
  15. {
  16. h->first = (struct dl_node *)&h->null;
  17. h->null = 0;
  18. h->last = (struct dl_node *)&h->first;
  19. return h;
  20. }
  21. static inline struct dl_node * dl_remove(struct dl_node *n)
  22. {
  23. n->prev->next = n->next;
  24. n->next->prev = n->prev;
  25. return n;
  26. }
  27. static inline struct dl_node *
  28. dl_insert_after(struct dl_node *p, struct dl_node *n)
  29. {
  30. n->next = p->next;
  31. n->prev = p;
  32. p->next = n;
  33. n->next->prev = n;
  34. return n;
  35. }
  36. #define dl_empty(h) ((h)->first->next == 0)
  37. #define dl_insert_before(p, n) dl_insert_after((p)->prev, (n))
  38. #define dl_insert_first(h, n) ({ struct dl_node *_n = (n); \
  39. dl_insert_before((h)->first, _n); })
  40. #define dl_insert_last(h, n) ({ struct dl_node *_n = (n); \
  41. dl_insert_after((h)->last, _n); })
  42. #define dl_remove_first(h) dl_remove((h)->first) // mustn't be empty!
  43. #define dl_remove_last(h) dl_remove((h)->last) // mustn't be empty!
  44. #endif