ble_ln_db.c 4.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151
  1. /**
  2. * Copyright (c) 2015 - 2020, Nordic Semiconductor ASA
  3. *
  4. * All rights reserved.
  5. *
  6. * Redistribution and use in source and binary forms, with or without modification,
  7. * are permitted provided that the following conditions are met:
  8. *
  9. * 1. Redistributions of source code must retain the above copyright notice, this
  10. * list of conditions and the following disclaimer.
  11. *
  12. * 2. Redistributions in binary form, except as embedded into a Nordic
  13. * Semiconductor ASA integrated circuit in a product or a software update for
  14. * such product, must reproduce the above copyright notice, this list of
  15. * conditions and the following disclaimer in the documentation and/or other
  16. * materials provided with the distribution.
  17. *
  18. * 3. Neither the name of Nordic Semiconductor ASA nor the names of its
  19. * contributors may be used to endorse or promote products derived from this
  20. * software without specific prior written permission.
  21. *
  22. * 4. This software, with or without modification, must only be used with a
  23. * Nordic Semiconductor ASA integrated circuit.
  24. *
  25. * 5. Any software provided in binary form under this license must not be reverse
  26. * engineered, decompiled, modified and/or disassembled.
  27. *
  28. * THIS SOFTWARE IS PROVIDED BY NORDIC SEMICONDUCTOR ASA "AS IS" AND ANY EXPRESS
  29. * OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
  30. * OF MERCHANTABILITY, NONINFRINGEMENT, AND FITNESS FOR A PARTICULAR PURPOSE ARE
  31. * DISCLAIMED. IN NO EVENT SHALL NORDIC SEMICONDUCTOR ASA OR CONTRIBUTORS BE
  32. * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
  33. * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
  34. * GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  35. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  36. * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
  37. * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  38. *
  39. */
  40. #include "ble_ln_db.h"
  41. #include "ble_ln_common.h"
  42. typedef struct
  43. {
  44. bool in_use_flag;
  45. ble_lns_route_t record;
  46. } database_entry_t;
  47. static database_entry_t m_database[BLE_LNS_MAX_NUM_ROUTES];
  48. static uint8_t m_database_crossref[BLE_LNS_MAX_NUM_ROUTES];
  49. static uint16_t m_num_records;
  50. void ble_ln_db_init(void)
  51. {
  52. int i;
  53. for (i = 0; i < BLE_LNS_MAX_NUM_ROUTES; i++)
  54. {
  55. m_database[i].in_use_flag = false;
  56. m_database_crossref[i] = 0xFF;
  57. }
  58. m_num_records = 0;
  59. }
  60. uint16_t ble_ln_db_num_records_get(void)
  61. {
  62. return m_num_records;
  63. }
  64. ret_code_t ble_ln_db_record_get(uint8_t rec_ndx, ble_lns_route_t * p_rec)
  65. {
  66. if (rec_ndx >= m_num_records)
  67. {
  68. return NRF_ERROR_INVALID_PARAM;
  69. }
  70. // copy record to the specified memory
  71. *p_rec = m_database[m_database_crossref[rec_ndx]].record;
  72. return NRF_SUCCESS;
  73. }
  74. ret_code_t ble_ln_db_record_name_get(uint8_t rec_ndx, uint8_t ** p_buf)
  75. {
  76. if (rec_ndx >= m_num_records)
  77. {
  78. return NRF_ERROR_INVALID_PARAM;
  79. }
  80. // copy record to the specified memory
  81. *p_buf = m_database[m_database_crossref[rec_ndx]].record.route_name;
  82. return NRF_SUCCESS;
  83. }
  84. ret_code_t ble_ln_db_record_add(ble_lns_route_t * p_rec)
  85. {
  86. int i;
  87. if (m_num_records == BLE_LNS_MAX_NUM_ROUTES)
  88. {
  89. return NRF_ERROR_NO_MEM;
  90. }
  91. // find next available database entry
  92. for (i = 0; i < BLE_LNS_MAX_NUM_ROUTES; i++)
  93. {
  94. if (!m_database[i].in_use_flag)
  95. {
  96. m_database[i].in_use_flag = true;
  97. m_database[i].record = *p_rec;
  98. m_database[i].record.route_id = i;
  99. m_database_crossref[m_num_records] = i;
  100. p_rec->route_id = i;
  101. m_num_records++;
  102. return NRF_SUCCESS;
  103. }
  104. }
  105. return NRF_ERROR_NO_MEM;
  106. }
  107. ret_code_t ble_ln_db_record_delete(uint8_t rec_ndx)
  108. {
  109. int i;
  110. if (rec_ndx >= m_num_records)
  111. {
  112. return NRF_ERROR_NOT_FOUND;
  113. }
  114. // free entry
  115. m_database[m_database_crossref[rec_ndx]].in_use_flag = false;
  116. // decrease number of records
  117. m_num_records--;
  118. // remove cross reference index
  119. for (i = rec_ndx; i < m_num_records; i++)
  120. {
  121. m_database_crossref[i] = m_database_crossref[i + 1];
  122. }
  123. return NRF_SUCCESS;
  124. }