grow_array.h 4.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139
  1. /**
  2. * @file grow_array.h
  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. // Preprocessor inputs:
  30. // GROWARRAY_NAME - prefix of of functions to define
  31. // GROWARRAY_OBJECT_TYPE - type of structure where array and capacity sizes are
  32. // GROWARRAY_ARRAY_MEMBER - array member
  33. // GROWARRAY_CAPACITY_MEMBER - capacity member
  34. // GROWARRAY_MAX_CAPACITY - max value of capacity member
  35. #include <limits.h>
  36. #include <string.h>
  37. #include <stddef.h>
  38. #include <misc/debug.h>
  39. #include <misc/balloc.h>
  40. #include <misc/merge.h>
  41. #define GrowArrayObject GROWARRAY_OBJECT_TYPE
  42. #define GrowArray_Init MERGE(GROWARRAY_NAME, _Init)
  43. #define GrowArray_InitEmpty MERGE(GROWARRAY_NAME, _InitEmpty)
  44. #define GrowArray_Free MERGE(GROWARRAY_NAME, _Free)
  45. #define GrowArray_DoubleUp MERGE(GROWARRAY_NAME, _DoubleUp)
  46. #define GrowArray_DoubleUpLimit MERGE(GROWARRAY_NAME, _DoubleUpLimit)
  47. static int GrowArray_Init (GrowArrayObject *o, size_t capacity) WARN_UNUSED;
  48. static void GrowArray_InitEmpty (GrowArrayObject *o);
  49. static void GrowArray_Free (GrowArrayObject *o);
  50. static int GrowArray_DoubleUp (GrowArrayObject *o) WARN_UNUSED;
  51. static int GrowArray_DoubleUpLimit (GrowArrayObject *o, size_t limit) WARN_UNUSED;
  52. static int GrowArray_Init (GrowArrayObject *o, size_t capacity)
  53. {
  54. if (capacity > GROWARRAY_MAX_CAPACITY) {
  55. return 0;
  56. }
  57. if (capacity == 0) {
  58. o->GROWARRAY_ARRAY_MEMBER = NULL;
  59. } else {
  60. if (!(o->GROWARRAY_ARRAY_MEMBER = BAllocArray(capacity, sizeof(o->GROWARRAY_ARRAY_MEMBER[0])))) {
  61. return 0;
  62. }
  63. }
  64. o->GROWARRAY_CAPACITY_MEMBER = capacity;
  65. return 1;
  66. }
  67. static void GrowArray_InitEmpty (GrowArrayObject *o)
  68. {
  69. o->GROWARRAY_ARRAY_MEMBER = NULL;
  70. o->GROWARRAY_CAPACITY_MEMBER = 0;
  71. }
  72. static void GrowArray_Free (GrowArrayObject *o)
  73. {
  74. if (o->GROWARRAY_ARRAY_MEMBER) {
  75. BFree(o->GROWARRAY_ARRAY_MEMBER);
  76. }
  77. }
  78. static int GrowArray_DoubleUp (GrowArrayObject *o)
  79. {
  80. return GrowArray_DoubleUpLimit(o, SIZE_MAX);
  81. }
  82. static int GrowArray_DoubleUpLimit (GrowArrayObject *o, size_t limit)
  83. {
  84. if (o->GROWARRAY_CAPACITY_MEMBER > SIZE_MAX / 2 || o->GROWARRAY_CAPACITY_MEMBER > GROWARRAY_MAX_CAPACITY / 2) {
  85. return 0;
  86. }
  87. size_t newcap = 2 * o->GROWARRAY_CAPACITY_MEMBER;
  88. if (newcap == 0) {
  89. newcap = 1;
  90. }
  91. if (newcap > limit) {
  92. newcap = limit;
  93. if (newcap == o->GROWARRAY_CAPACITY_MEMBER) {
  94. return 0;
  95. }
  96. }
  97. void *newarr = BAllocArray(newcap, sizeof(o->GROWARRAY_ARRAY_MEMBER[0]));
  98. if (!newarr) {
  99. return 0;
  100. }
  101. memcpy(newarr, o->GROWARRAY_ARRAY_MEMBER, o->GROWARRAY_CAPACITY_MEMBER * sizeof(o->GROWARRAY_ARRAY_MEMBER[0]));
  102. BFree(o->GROWARRAY_ARRAY_MEMBER);
  103. o->GROWARRAY_ARRAY_MEMBER = newarr;
  104. o->GROWARRAY_CAPACITY_MEMBER = newcap;
  105. return 1;
  106. }
  107. #undef GROWARRAY_NAME
  108. #undef GROWARRAY_OBJECT_TYPE
  109. #undef GROWARRAY_ARRAY_MEMBER
  110. #undef GROWARRAY_CAPACITY_MEMBER
  111. #undef GROWARRAY_MAX_CAPACITY
  112. #undef GrowArrayObject
  113. #undef GrowArray_Init
  114. #undef GrowArray_InitEmpty
  115. #undef GrowArray_Free
  116. #undef GrowArray_DoubleUp
  117. #undef GrowArray_DoubleUpLimit