pkt_queue.c 3.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144
  1. /*
  2. * SPDX-FileCopyrightText: 2022 Espressif Systems (Shanghai) CO LTD
  3. *
  4. * SPDX-License-Identifier: Apache-2.0
  5. */
  6. #include "osi/pkt_queue.h"
  7. #include "osi/allocator.h"
  8. #include "osi/mutex.h"
  9. STAILQ_HEAD(pkt_queue_header, pkt_linked_item);
  10. struct pkt_queue {
  11. osi_mutex_t lock;
  12. size_t length;
  13. struct pkt_queue_header header;
  14. } pkt_queue_t;
  15. struct pkt_queue *pkt_queue_create(void)
  16. {
  17. struct pkt_queue *queue = calloc(1, sizeof(struct pkt_queue));
  18. if (queue == NULL) {
  19. return NULL;
  20. }
  21. if (osi_mutex_new(&queue->lock) != 0) {
  22. osi_free(queue);
  23. }
  24. struct pkt_queue_header *p = &queue->header;
  25. STAILQ_INIT(p);
  26. return queue;
  27. }
  28. static void pkt_queue_cleanup(struct pkt_queue *queue, pkt_queue_free_cb free_cb)
  29. {
  30. if (queue == NULL) {
  31. return;
  32. }
  33. struct pkt_queue_header *header = &queue->header;
  34. pkt_linked_item_t *item = STAILQ_FIRST(header);
  35. pkt_linked_item_t *tmp;
  36. pkt_queue_free_cb free_func = (free_cb != NULL) ? free_cb : (pkt_queue_free_cb)osi_free_func;
  37. while (item != NULL) {
  38. tmp = STAILQ_NEXT(item, next);
  39. free_func(item);
  40. item = tmp;
  41. queue->length--;
  42. }
  43. STAILQ_INIT(header);
  44. queue->length = 0;
  45. }
  46. void pkt_queue_flush(struct pkt_queue *queue, pkt_queue_free_cb free_cb)
  47. {
  48. if (queue == NULL) {
  49. return;
  50. }
  51. osi_mutex_lock(&queue->lock, OSI_MUTEX_MAX_TIMEOUT);
  52. pkt_queue_cleanup(queue, free_cb);
  53. osi_mutex_unlock(&queue->lock);
  54. }
  55. void pkt_queue_destroy(struct pkt_queue *queue, pkt_queue_free_cb free_cb)
  56. {
  57. if (queue == NULL) {
  58. return;
  59. }
  60. osi_mutex_lock(&queue->lock, OSI_MUTEX_MAX_TIMEOUT);
  61. pkt_queue_cleanup(queue, free_cb);
  62. osi_mutex_unlock(&queue->lock);
  63. osi_mutex_free(&queue->lock);
  64. osi_free(queue);
  65. }
  66. pkt_linked_item_t *pkt_queue_dequeue(struct pkt_queue *queue)
  67. {
  68. if (queue == NULL || queue->length == 0) {
  69. return NULL;
  70. }
  71. struct pkt_linked_item *item;
  72. struct pkt_queue_header *header;
  73. osi_mutex_lock(&queue->lock, OSI_MUTEX_MAX_TIMEOUT);
  74. header = &queue->header;
  75. item = STAILQ_FIRST(header);
  76. if (item != NULL) {
  77. STAILQ_REMOVE_HEAD(header, next);
  78. if (queue->length > 0) {
  79. queue->length--;
  80. }
  81. }
  82. osi_mutex_unlock(&queue->lock);
  83. return item;
  84. }
  85. bool pkt_queue_enqueue(struct pkt_queue *queue, pkt_linked_item_t *item)
  86. {
  87. if (queue == NULL || item == NULL) {
  88. return false;
  89. }
  90. struct pkt_queue_header *header;
  91. osi_mutex_lock(&queue->lock, OSI_MUTEX_MAX_TIMEOUT);
  92. header = &queue->header;
  93. STAILQ_INSERT_TAIL(header, item, next);
  94. queue->length++;
  95. osi_mutex_unlock(&queue->lock);
  96. return true;
  97. }
  98. size_t pkt_queue_length(const struct pkt_queue *queue)
  99. {
  100. if (queue == NULL) {
  101. return 0;
  102. }
  103. return queue->length;
  104. }
  105. bool pkt_queue_is_empty(const struct pkt_queue *queue)
  106. {
  107. return pkt_queue_length(queue) == 0;
  108. }
  109. pkt_linked_item_t *pkt_queue_try_peek_first(struct pkt_queue *queue)
  110. {
  111. if (queue == NULL) {
  112. return NULL;
  113. }
  114. struct pkt_queue_header *header = &queue->header;
  115. pkt_linked_item_t *item;
  116. osi_mutex_lock(&queue->lock, OSI_MUTEX_MAX_TIMEOUT);
  117. item = STAILQ_FIRST(header);
  118. osi_mutex_unlock(&queue->lock);
  119. return item;
  120. }