peer_id.c 3.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159
  1. /* Copyright (c) 2015 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 "peer_id.h"
  13. #include <stdint.h>
  14. #include <string.h>
  15. #include "sdk_errors.h"
  16. #include "peer_manager_types.h"
  17. #include "pm_mutex.h"
  18. typedef struct
  19. {
  20. uint8_t active_peer_ids[MUTEX_STORAGE_SIZE(PM_PEER_ID_N_AVAILABLE_IDS)]; /**< Bitmap designating which peer IDs are in use. */
  21. uint8_t deleted_peer_ids[MUTEX_STORAGE_SIZE(PM_PEER_ID_N_AVAILABLE_IDS)]; /**< Bitmap designating which peer IDs are marked for deletion. */
  22. } pi_t;
  23. static pi_t m_pi = {{0}, {0}};
  24. static void internal_state_reset(pi_t * p_pi)
  25. {
  26. memset(p_pi, 0, sizeof(pi_t));
  27. }
  28. void peer_id_init(void)
  29. {
  30. internal_state_reset(&m_pi);
  31. pm_mutex_init(m_pi.active_peer_ids, PM_PEER_ID_N_AVAILABLE_IDS);
  32. pm_mutex_init(m_pi.deleted_peer_ids, PM_PEER_ID_N_AVAILABLE_IDS);
  33. }
  34. static pm_peer_id_t claim(pm_peer_id_t peer_id, uint8_t * mutex_group)
  35. {
  36. pm_peer_id_t allocated_peer_id = PM_PEER_ID_INVALID;
  37. if (peer_id == PM_PEER_ID_INVALID)
  38. {
  39. allocated_peer_id = pm_mutex_lock_first_available(mutex_group, PM_PEER_ID_N_AVAILABLE_IDS);
  40. if (allocated_peer_id == PM_PEER_ID_N_AVAILABLE_IDS)
  41. {
  42. allocated_peer_id = PM_PEER_ID_INVALID;
  43. }
  44. }
  45. else if (peer_id < PM_PEER_ID_N_AVAILABLE_IDS)
  46. {
  47. bool lock_success = pm_mutex_lock(mutex_group, peer_id);
  48. allocated_peer_id = lock_success ? peer_id : PM_PEER_ID_INVALID;
  49. }
  50. return allocated_peer_id;
  51. }
  52. static void release(pm_peer_id_t peer_id, uint8_t * mutex_group)
  53. {
  54. if (peer_id < PM_PEER_ID_N_AVAILABLE_IDS)
  55. {
  56. pm_mutex_unlock(mutex_group, peer_id);
  57. }
  58. }
  59. pm_peer_id_t peer_id_allocate(pm_peer_id_t peer_id)
  60. {
  61. return claim(peer_id, m_pi.active_peer_ids);
  62. }
  63. bool peer_id_delete(pm_peer_id_t peer_id)
  64. {
  65. if (peer_id == PM_PEER_ID_INVALID)
  66. {
  67. return false;
  68. }
  69. pm_peer_id_t deleted_id = claim(peer_id, m_pi.deleted_peer_ids);
  70. return (deleted_id == peer_id);
  71. }
  72. void peer_id_free(pm_peer_id_t peer_id)
  73. {
  74. release(peer_id, m_pi.active_peer_ids);
  75. release(peer_id, m_pi.deleted_peer_ids);
  76. }
  77. bool peer_id_is_allocated(pm_peer_id_t peer_id)
  78. {
  79. if (peer_id < PM_PEER_ID_N_AVAILABLE_IDS)
  80. {
  81. return pm_mutex_lock_status_get(m_pi.active_peer_ids, peer_id);
  82. }
  83. return false;
  84. }
  85. bool peer_id_is_deleted(pm_peer_id_t peer_id)
  86. {
  87. if (peer_id < PM_PEER_ID_N_AVAILABLE_IDS)
  88. {
  89. return pm_mutex_lock_status_get(m_pi.deleted_peer_ids, peer_id);
  90. }
  91. return false;
  92. }
  93. pm_peer_id_t next_id_get(pm_peer_id_t prev_peer_id, uint8_t * mutex_group)
  94. {
  95. pm_peer_id_t i = (prev_peer_id == PM_PEER_ID_INVALID) ? 0 : (prev_peer_id + 1);
  96. for (; i < PM_PEER_ID_N_AVAILABLE_IDS; i++)
  97. {
  98. if (pm_mutex_lock_status_get(mutex_group, i))
  99. {
  100. return i;
  101. }
  102. }
  103. return PM_PEER_ID_INVALID;
  104. }
  105. pm_peer_id_t peer_id_get_next_used(pm_peer_id_t prev_peer_id)
  106. {
  107. return next_id_get(prev_peer_id, m_pi.active_peer_ids);
  108. }
  109. pm_peer_id_t peer_id_get_next_deleted(pm_peer_id_t prev_peer_id)
  110. {
  111. return next_id_get(prev_peer_id, m_pi.deleted_peer_ids);
  112. }
  113. uint32_t peer_id_n_ids(void)
  114. {
  115. uint32_t n_ids = 0;
  116. for (pm_peer_id_t i = 0; i < PM_PEER_ID_N_AVAILABLE_IDS; i++)
  117. {
  118. n_ids += pm_mutex_lock_status_get(m_pi.active_peer_ids, i);
  119. }
  120. return n_ids;
  121. }