hci_mem_pool.c 7.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235
  1. /* Copyright (c) 2013 Nordic Semiconductor. All Rights Reserved.
  2. *
  3. * The information contained herein is property of Nordic Semiconductor ASA.
  4. * Terms and conditions of usage are described in detail in NORDIC
  5. * SEMICONDUCTOR STANDARD SOFTWARE LICENSE AGREEMENT.
  6. *
  7. * Licensees are granted free, non-transferable use of the information. NO
  8. * WARRANTY of ANY KIND is provided. This heading must NOT be removed from
  9. * the file.
  10. *
  11. */
  12. #include "hci_mem_pool.h"
  13. #include "hci_mem_pool_internal.h"
  14. #include <stdbool.h>
  15. #include <stdio.h>
  16. /**@brief RX buffer element instance structure.
  17. */
  18. typedef struct
  19. {
  20. uint8_t rx_buffer[RX_BUF_SIZE]; /**< RX buffer memory array. */
  21. uint32_t length; /**< Length of the RX buffer memory array. */
  22. } rx_buffer_elem_t;
  23. /**@brief RX buffer queue element instance structure.
  24. */
  25. typedef struct
  26. {
  27. rx_buffer_elem_t * p_buffer; /**< Pointer to RX buffer element. */
  28. uint32_t free_window_count; /**< Free space element count. */
  29. uint32_t free_available_count; /**< Free area element count. */
  30. uint32_t read_available_count; /**< Read area element count. */
  31. uint32_t write_index; /**< Write position index. */
  32. uint32_t read_index; /**< Read position index. */
  33. uint32_t free_index; /**< Free position index. */
  34. } rx_buffer_queue_t;
  35. static bool m_is_tx_allocated; /**< Boolean value to determine if the TX buffer is allocated. */
  36. static rx_buffer_elem_t m_rx_buffer_elem_queue[RX_BUF_QUEUE_SIZE]; /**< RX buffer element instances. */
  37. static rx_buffer_queue_t m_rx_buffer_queue; /**< RX buffer queue element instance. */
  38. uint32_t hci_mem_pool_open(void)
  39. {
  40. m_is_tx_allocated = false;
  41. m_rx_buffer_queue.p_buffer = m_rx_buffer_elem_queue;
  42. m_rx_buffer_queue.free_window_count = RX_BUF_QUEUE_SIZE;
  43. m_rx_buffer_queue.free_available_count = 0;
  44. m_rx_buffer_queue.read_available_count = 0;
  45. m_rx_buffer_queue.write_index = 0;
  46. m_rx_buffer_queue.read_index = 0;
  47. m_rx_buffer_queue.free_index = 0;
  48. return NRF_SUCCESS;
  49. }
  50. uint32_t hci_mem_pool_close(void)
  51. {
  52. return NRF_SUCCESS;
  53. }
  54. uint32_t hci_mem_pool_tx_alloc(void ** pp_buffer)
  55. {
  56. static uint8_t tx_buffer[TX_BUF_SIZE];
  57. uint32_t err_code;
  58. if (pp_buffer == NULL)
  59. {
  60. return NRF_ERROR_NULL;
  61. }
  62. if (!m_is_tx_allocated)
  63. {
  64. m_is_tx_allocated = true;
  65. *pp_buffer = tx_buffer;
  66. err_code = NRF_SUCCESS;
  67. }
  68. else
  69. {
  70. err_code = NRF_ERROR_NO_MEM;
  71. }
  72. return err_code;
  73. }
  74. uint32_t hci_mem_pool_tx_free(void)
  75. {
  76. m_is_tx_allocated = false;
  77. return NRF_SUCCESS;
  78. }
  79. uint32_t hci_mem_pool_rx_produce(uint32_t length, void ** pp_buffer)
  80. {
  81. uint32_t err_code;
  82. if (pp_buffer == NULL)
  83. {
  84. return NRF_ERROR_NULL;
  85. }
  86. *pp_buffer = NULL;
  87. if (m_rx_buffer_queue.free_window_count != 0)
  88. {
  89. if (length <= RX_BUF_SIZE)
  90. {
  91. --(m_rx_buffer_queue.free_window_count);
  92. ++(m_rx_buffer_queue.read_available_count);
  93. *pp_buffer =
  94. m_rx_buffer_queue.p_buffer[m_rx_buffer_queue.write_index].rx_buffer;
  95. m_rx_buffer_queue.free_index |= (1u << m_rx_buffer_queue.write_index);
  96. // @note: Adjust the write_index making use of the fact that the buffer size is of
  97. // power of two and two's complement arithmetic. For details refer example to book
  98. // "Making embedded systems: Elicia White".
  99. m_rx_buffer_queue.write_index =
  100. (m_rx_buffer_queue.write_index + 1u) & (RX_BUF_QUEUE_SIZE - 1u);
  101. err_code = NRF_SUCCESS;
  102. }
  103. else
  104. {
  105. err_code = NRF_ERROR_DATA_SIZE;
  106. }
  107. }
  108. else
  109. {
  110. err_code = NRF_ERROR_NO_MEM;
  111. }
  112. return err_code;
  113. }
  114. uint32_t hci_mem_pool_rx_consume(uint8_t * p_buffer)
  115. {
  116. uint32_t err_code;
  117. uint32_t consume_index;
  118. uint32_t start_index;
  119. if (m_rx_buffer_queue.free_available_count != 0)
  120. {
  121. // Find the buffer that has been freed -
  122. // Start at read_index minus free_available_count and then increment until read index.
  123. err_code = NRF_ERROR_INVALID_ADDR;
  124. consume_index = (m_rx_buffer_queue.read_index - m_rx_buffer_queue.free_available_count) &
  125. (RX_BUF_QUEUE_SIZE - 1u);
  126. start_index = consume_index;
  127. do
  128. {
  129. if (m_rx_buffer_queue.p_buffer[consume_index].rx_buffer == p_buffer)
  130. {
  131. m_rx_buffer_queue.free_index ^= (1u << consume_index);
  132. err_code = NRF_SUCCESS;
  133. break;
  134. }
  135. else
  136. {
  137. consume_index = (consume_index + 1u) & (RX_BUF_QUEUE_SIZE - 1u);
  138. }
  139. }
  140. while (consume_index != m_rx_buffer_queue.read_index);
  141. while (!(m_rx_buffer_queue.free_index & (1 << start_index)) &&
  142. (m_rx_buffer_queue.free_available_count != 0))
  143. {
  144. --(m_rx_buffer_queue.free_available_count);
  145. ++(m_rx_buffer_queue.free_window_count);
  146. start_index = (consume_index + 1u) & (RX_BUF_QUEUE_SIZE - 1u);
  147. }
  148. }
  149. else
  150. {
  151. err_code = NRF_ERROR_NO_MEM;
  152. }
  153. return err_code;
  154. }
  155. uint32_t hci_mem_pool_rx_data_size_set(uint32_t length)
  156. {
  157. // @note: Adjust the write_index making use of the fact that the buffer size is of power
  158. // of two and two's complement arithmetic. For details refer example to book
  159. // "Making embedded systems: Elicia White".
  160. const uint32_t index = (m_rx_buffer_queue.write_index - 1u) & (RX_BUF_QUEUE_SIZE - 1u);
  161. m_rx_buffer_queue.p_buffer[index].length = length;
  162. return NRF_SUCCESS;
  163. }
  164. uint32_t hci_mem_pool_rx_extract(uint8_t ** pp_buffer, uint32_t * p_length)
  165. {
  166. uint32_t err_code;
  167. if ((pp_buffer == NULL) || (p_length == NULL))
  168. {
  169. return NRF_ERROR_NULL;
  170. }
  171. if (m_rx_buffer_queue.read_available_count != 0)
  172. {
  173. --(m_rx_buffer_queue.read_available_count);
  174. ++(m_rx_buffer_queue.free_available_count);
  175. *pp_buffer =
  176. m_rx_buffer_queue.p_buffer[m_rx_buffer_queue.read_index].rx_buffer;
  177. *p_length =
  178. m_rx_buffer_queue.p_buffer[m_rx_buffer_queue.read_index].length;
  179. // @note: Adjust the write_index making use of the fact that the buffer size is of power
  180. // of two and two's complement arithmetic. For details refer example to book
  181. // "Making embedded systems: Elicia White".
  182. m_rx_buffer_queue.read_index =
  183. (m_rx_buffer_queue.read_index + 1u) & (RX_BUF_QUEUE_SIZE - 1u);
  184. err_code = NRF_SUCCESS;
  185. }
  186. else
  187. {
  188. err_code = NRF_ERROR_NO_MEM;
  189. }
  190. return err_code;
  191. }