Vector.h 4.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139
  1. /**
  2. * @file Vector.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. // VECTOR_NAME - prefix of functions and types to be defined
  31. // VECTOR_ELEM_TYPE - type of vector elements
  32. #include <limits.h>
  33. #include <string.h>
  34. #include <stddef.h>
  35. #include <misc/debug.h>
  36. #include <misc/balloc.h>
  37. #include <misc/merge.h>
  38. #define Vector VECTOR_NAME
  39. #define VectorElem VECTOR_ELEM_TYPE
  40. #define Vector_Init MERGE(VECTOR_NAME, _Init)
  41. #define Vector_Free MERGE(VECTOR_NAME, _Free)
  42. #define Vector_Get MERGE(VECTOR_NAME, _Get)
  43. #define Vector_AllocAppend MERGE(VECTOR_NAME, _AllocAppend)
  44. #define Vector_DoAppend MERGE(VECTOR_NAME, _DoAppend)
  45. typedef struct {
  46. VectorElem *elems;
  47. size_t capacity;
  48. size_t count;
  49. } Vector;
  50. static int Vector_Init (Vector *o, size_t capacity) WARN_UNUSED;
  51. static void Vector_Free (Vector *o);
  52. static VectorElem * Vector_Get (Vector *o, size_t index);
  53. static int Vector_AllocAppend (Vector *o, size_t count, VectorElem **out_ptr) WARN_UNUSED;
  54. static void Vector_DoAppend (Vector *o, size_t count);
  55. static int Vector_Init (Vector *o, size_t capacity)
  56. {
  57. if (capacity == 0) {
  58. o->elems = NULL;
  59. } else {
  60. o->elems = BAllocArray(capacity, sizeof(VectorElem));
  61. if (!o->elems) {
  62. return 0;
  63. }
  64. }
  65. o->capacity = capacity;
  66. o->count = 0;
  67. return 1;
  68. }
  69. static void Vector_Free (Vector *o)
  70. {
  71. BFree(o->elems);
  72. }
  73. static VectorElem * Vector_Get (Vector *o, size_t index)
  74. {
  75. ASSERT(index < o->count)
  76. return &o->elems[index];
  77. }
  78. static int Vector_AllocAppend (Vector *o, size_t count, VectorElem **out_ptr)
  79. {
  80. ASSERT(count > 0)
  81. if (count > o->capacity - o->count) {
  82. size_t new_capacity = o->capacity;
  83. do {
  84. if (new_capacity > SIZE_MAX / 2) {
  85. return 0;
  86. }
  87. new_capacity = (new_capacity == 0) ? 1 : (2 * new_capacity);
  88. } while (count > new_capacity - o->count);
  89. VectorElem *new_elems = BAllocArray(new_capacity, sizeof(VectorElem));
  90. if (!new_elems) {
  91. return 0;
  92. }
  93. if (o->count > 0) {
  94. memcpy(new_elems, o->elems, o->count * sizeof(VectorElem));
  95. }
  96. BFree(o->elems);
  97. o->elems = new_elems;
  98. o->capacity = new_capacity;
  99. }
  100. if (out_ptr) {
  101. *out_ptr = &o->elems[o->count];
  102. }
  103. return 1;
  104. }
  105. static void Vector_DoAppend (Vector *o, size_t count)
  106. {
  107. ASSERT(count <= o->capacity - o->count)
  108. o->count += count;
  109. }
  110. #undef VECTOR_NAME
  111. #undef VECTOR_ELEM_TYPE
  112. #undef Vector
  113. #undef VectorElem
  114. #undef Vector_Init
  115. #undef Vector_Free
  116. #undef Vector_Get
  117. #undef Vector_AllocAppend
  118. #undef Vector_DoAppend