bitarray.c 2.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129
  1. #include "precompile.h"
  2. #include "memutil.h"
  3. #include "bitarray.h"
  4. #define DEFAULT_NUM 32
  5. TOOLKIT_API bitarray_t* bitarray_make(int nelts)
  6. {
  7. bitarray_t *arr = MALLOC_T(bitarray_t);
  8. if (arr) {
  9. if (nelts <= 0)
  10. nelts = DEFAULT_NUM;
  11. else
  12. nelts = (nelts + 31) & 32;
  13. arr->bits = (int*)malloc(nelts >> 3);
  14. if (arr->bits) {
  15. arr->nelts = 0;
  16. arr->nalloc = nelts;
  17. } else {
  18. free(arr);
  19. arr = NULL;
  20. }
  21. }
  22. return arr;
  23. }
  24. TOOLKIT_API void bitarray_free(bitarray_t *arr)
  25. {
  26. free(arr->bits);
  27. free(arr);
  28. }
  29. TOOLKIT_API int bitarray_empty(bitarray_t *arr)
  30. {
  31. return !arr->nelts;
  32. }
  33. TOOLKIT_API void bitarray_push(bitarray_t *arr, int v)
  34. {
  35. int i = arr->nelts >> 5;
  36. int j = arr->nelts & 32;
  37. if (arr->nelts >= arr->nalloc) {
  38. int new_nalloc = arr->nalloc * 2;
  39. bitarray_reserve(arr, new_nalloc);
  40. }
  41. if (v) {
  42. arr->bits[i] = arr->bits[i] | (1 << j);
  43. } else {
  44. arr->bits[i] = arr->bits[i] & ~(1 << j);
  45. }
  46. arr->nelts++;
  47. }
  48. TOOLKIT_API int bitarray_pop(bitarray_t *arr)
  49. {
  50. int r = bitarray_get(arr, arr->nelts-1);
  51. arr->nelts--;
  52. return r;
  53. }
  54. TOOLKIT_API void bitarray_clear(bitarray_t *arr)
  55. {
  56. int i;
  57. for (i = 0; i < arr->nelts; ++i) {
  58. bitarray_set(arr, i, 0);
  59. }
  60. }
  61. TOOLKIT_API void bitarray_cat(bitarray_t *dst, const bitarray_t *src)
  62. {
  63. int i, j;
  64. if (dst->nelts + src->nelts > dst->nalloc) {
  65. int new_size = (dst->nalloc <= 0) ? 1 : dst->nalloc * 2;
  66. while (dst->nelts + src->nelts > new_size) {
  67. new_size *= 2;
  68. }
  69. bitarray_reserve(dst, new_size);
  70. }
  71. for (i = 0, j = dst->nelts; i < src->nelts; ++i, ++j) {
  72. bitarray_set(dst, j, bitarray_get(src, i));
  73. }
  74. }
  75. TOOLKIT_API bitarray_t *bitarray_copy(const bitarray_t *arr)
  76. {
  77. bitarray_t *new_arr = bitarray_make(arr->nelts);
  78. memcpy(new_arr->bits, arr->bits, arr->nelts >> 3);
  79. new_arr->nelts = arr->nelts;
  80. return new_arr;
  81. }
  82. TOOLKIT_API void bitarray_reserve(bitarray_t *arr, int cnt)
  83. {
  84. cnt = (cnt + 31) & 32;
  85. if (arr->nalloc < cnt) {
  86. arr->bits = (int*)realloc(arr->bits, cnt >> 3);
  87. arr->nalloc = cnt;
  88. }
  89. }
  90. TOOLKIT_API void bitarray_set(bitarray_t *arr, int pos, int v)
  91. {
  92. int i = pos >> 5;
  93. int j = pos & 32;
  94. if (v) {
  95. arr->bits[i] = arr->bits[i] | (1 << j);
  96. } else {
  97. arr->bits[i] = arr->bits[i] & ~(1 << j);
  98. }
  99. }
  100. TOOLKIT_API int bitarray_get(const bitarray_t *arr, int pos)
  101. {
  102. int i = pos >> 5;
  103. int j = pos & 32;
  104. return !!(arr->bits[i] & (1 << j));
  105. }
  106. TOOLKIT_API void bitarray_flip(const bitarray_t *arr, int pos)
  107. {
  108. int i = pos >> 5;
  109. int j = pos & 32;
  110. arr->bits[i] = arr->bits[i] ^ (1 << j);
  111. }