NCDPlaceholderDb.c 3.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124
  1. /**
  2. * @file NCDPlaceholderDb.c
  3. * @author Ambroz Bizjak <ambrop7@gmail.com>
  4. *
  5. * @section LICENSE
  6. *
  7. * Redistribution and use in source and binary forms, with or without
  8. * modification, are permitted provided that the following conditions are met:
  9. * 1. Redistributions of source code must retain the above copyright
  10. * notice, this list of conditions and the following disclaimer.
  11. * 2. Redistributions in binary form must reproduce the above copyright
  12. * notice, this list of conditions and the following disclaimer in the
  13. * documentation and/or other materials provided with the distribution.
  14. * 3. Neither the name of the author nor the
  15. * names of its contributors may be used to endorse or promote products
  16. * derived from this software without specific prior written permission.
  17. *
  18. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
  19. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
  20. * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
  21. * DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
  22. * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
  23. * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
  24. * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
  25. * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  26. * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
  27. * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  28. */
  29. #include <string.h>
  30. #include <limits.h>
  31. #include <misc/balloc.h>
  32. #include <misc/split_string.h>
  33. #include <misc/strdup.h>
  34. #include <base/BLog.h>
  35. #include "NCDPlaceholderDb.h"
  36. #include <generated/blog_channel_NCDPlaceholderDb.h>
  37. int NCDPlaceholderDb_Init (NCDPlaceholderDb *o)
  38. {
  39. o->count = 0;
  40. o->capacity = 1;
  41. if (!(o->arr = BAllocArray(o->capacity, sizeof(o->arr[0])))) {
  42. BLog(BLOG_ERROR, "NCDPlaceholderDb_Init failed");
  43. return 0;
  44. }
  45. return 1;
  46. }
  47. void NCDPlaceholderDb_Free (NCDPlaceholderDb *o)
  48. {
  49. for (size_t i = 0; i < o->count; i++) {
  50. free(o->arr[i].varnames);
  51. }
  52. BFree(o->arr);
  53. }
  54. int NCDPlaceholderDb_AddVariable (NCDPlaceholderDb *o, const char *varname, int *out_plid)
  55. {
  56. ASSERT(varname)
  57. ASSERT(out_plid)
  58. ASSERT(o->count <= o->capacity)
  59. ASSERT(o->capacity > 0)
  60. if (o->count == o->capacity) {
  61. if (o->capacity > SIZE_MAX / 2) {
  62. BLog(BLOG_ERROR, "too many placeholder entries (cannot resize)");
  63. return 0;
  64. }
  65. size_t newcap = 2 * o->capacity;
  66. struct NCDPlaceholderDb__entry *newarr = BAllocArray(newcap, sizeof(newarr[0]));
  67. if (!newarr) {
  68. BLog(BLOG_ERROR, "BAllocArray failed");
  69. return 0;
  70. }
  71. memcpy(newarr, o->arr, o->count * sizeof(newarr[0]));
  72. BFree(o->arr);
  73. o->arr = newarr;
  74. o->capacity = newcap;
  75. }
  76. ASSERT(o->count < o->capacity)
  77. if (o->count > INT_MAX) {
  78. BLog(BLOG_ERROR, "too many placeholder entries (cannot fit integer)");
  79. return 0;
  80. }
  81. char *varnames = b_strdup(varname);
  82. if (!varnames) {
  83. BLog(BLOG_ERROR, "b_strdup failed");
  84. return 0;
  85. }
  86. size_t num_names = split_string_inplace2(varnames, '.') + 1;
  87. *out_plid = o->count;
  88. o->arr[o->count].varnames = varnames;
  89. o->arr[o->count].num_names = num_names;
  90. o->count++;
  91. return 1;
  92. }
  93. void NCDPlaceholderDb_GetVariable (NCDPlaceholderDb *o, int plid, const char **out_varnames, size_t *out_num_names)
  94. {
  95. ASSERT(plid >= 0)
  96. ASSERT(plid < o->count)
  97. ASSERT(out_varnames)
  98. ASSERT(out_num_names)
  99. *out_varnames = o->arr[plid].varnames;
  100. *out_num_names = o->arr[plid].num_names;
  101. }