DArray_tests.c 8.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289
  1. #include <cmocka.h>
  2. #include <stdlib.h>
  3. #include <time.h>
  4. #include <stdio.h>
  5. #include "scufcont/DArray.h"
  6. #include "scufcont/scufcont.h"
  7. #define SCDARRAY_CHARP_ALLOC(arrptr) SCDArray_charp_alloc((arrptr), darray_charp_destroyer, darray_charp_copyer)
  8. SCDARRAY_HEADER(char *, charp);
  9. SCDARRAY_IMPL(char *, charp)
  10. void darray_charp_destroyer(char **elem) {
  11. if (elem != NULL && *elem != NULL) {
  12. free(*elem);
  13. *elem = NULL;
  14. }
  15. }
  16. int darray_charp_copyer(char **dst, char **src) {
  17. if (dst != NULL && src != NULL && *src != NULL) {
  18. *dst = (char *) malloc(sizeof(char) * (strlen(*src) + 1));
  19. if (dst == NULL) {
  20. return SCUFCONT_OUT_OF_MEMORY;
  21. }
  22. strncpy(*dst, *src, strlen(*src) + 1);
  23. }
  24. return 0;
  25. }
  26. void test_DArray_alloc(void **state) {
  27. (void) state;
  28. SCDArray_charp arr;
  29. assert_true(SCDARRAY_CHARP_ALLOC(&arr) == SCUFCONT_SUCCESS);
  30. assert_non_null(arr.data);
  31. assert_uint_equal(arr.len, 0u);
  32. assert_uint_equal(arr.capacity, 1u);
  33. SCDArray_charp_free(&arr);
  34. }
  35. void test_DArray_alloc_copy(void **state) {
  36. (void) state;
  37. srand(time(NULL));
  38. SCDArray_charp arr;
  39. assert_true(SCDARRAY_CHARP_ALLOC(&arr) == SCUFCONT_SUCCESS);
  40. const size_t elems_n = rand() % 100;
  41. for (size_t i = 0; i < elems_n; i++) {
  42. const int n = rand();
  43. char buf[100];
  44. snprintf(buf, 100, "%d", n);
  45. char *bufptr = buf;
  46. assert_true(SCDArray_charp_push_back(&arr, &bufptr, NULL) == SCUFCONT_SUCCESS);
  47. }
  48. SCDArray_charp copied;
  49. assert_true(SCDArray_charp_alloc_copy(&copied, &arr, NULL) == SCUFCONT_SUCCESS);
  50. assert_non_null(copied.data);
  51. assert_uint_equal(copied.capacity, arr.capacity);
  52. assert_uint_equal(copied.len, arr.len);
  53. for (size_t i = 0; i < arr.len; i++) {
  54. char **orig_elem = SCDArray_charp_at(&arr, i);
  55. assert_non_null(orig_elem);
  56. assert_non_null(*orig_elem);
  57. char **copied_elem = SCDArray_charp_at(&copied, i);
  58. assert_non_null(copied_elem);
  59. assert_non_null(*copied_elem);
  60. assert_string_equal(*orig_elem, *copied_elem);
  61. }
  62. const size_t arr_data_len = arr.len;
  63. char **arr_data = (char **) malloc(sizeof(char *) * arr.len);
  64. assert_non_null(arr_data);
  65. for (size_t i = 0; i < arr.len; i++) {
  66. char **src = SCDArray_charp_at(&arr, i);
  67. assert_non_null(src);
  68. assert_non_null(*src);
  69. arr.elem_copy(arr_data + i, src);
  70. }
  71. SCDArray_charp_free(&arr);
  72. // Freeing the first array shouldn't affect the data in the copied array.
  73. assert_uint_equal(arr_data_len, copied.len);
  74. for (size_t i = 0; i < arr_data_len; i++) {
  75. assert_string_equal(arr_data[i], *SCDArray_charp_at(&copied, i));
  76. }
  77. SCDArray_charp_free(&copied);
  78. for (size_t i = 0; i < arr_data_len; i++) {
  79. free(arr_data[i]);
  80. }
  81. free(arr_data);
  82. }
  83. void test_DArray_push_back(void **state) {
  84. (void) state;
  85. SCDArray_charp arr;
  86. SCDARRAY_CHARP_ALLOC(&arr);
  87. const char *str1_lit = "Hello";
  88. const size_t str1_len = strlen(str1_lit);
  89. char *str1 = malloc(sizeof(char) * (str1_len + 1));
  90. strncpy(str1, str1_lit, str1_len + 1);
  91. char *str2 = "World";
  92. assert_true(SCDArray_charp_push_back(&arr, &(char *) { str1 }, NULL) == SCUFCONT_SUCCESS);
  93. assert_string_equal(*SCDArray_charp_at(&arr, 0), str1);
  94. assert_true(SCDArray_charp_push_back(&arr, &(char *) { str2 }, NULL) == SCUFCONT_SUCCESS);
  95. assert_string_equal(*SCDArray_charp_at(&arr, 0), str1);
  96. assert_string_equal(*SCDArray_charp_at(&arr, 1), str2);
  97. // Freeing the original memory should not affect the array element.
  98. free(str1);
  99. assert_string_equal(*SCDArray_charp_at(&arr, 0), str1_lit);
  100. SCDArray_charp_free(&arr);
  101. }
  102. void test_DArray_at(void **state) {
  103. (void) state;
  104. SCDArray_charp arr;
  105. SCDARRAY_CHARP_ALLOC(&arr);
  106. assert_true(SCDArray_charp_push_back(&arr, &(char *) { "Hello" }, NULL) == SCUFCONT_SUCCESS);
  107. assert_string_equal(*SCDArray_charp_at(&arr, 0), "Hello");
  108. assert_true(SCDArray_charp_push_back(&arr, &(char *) { "World" }, NULL) == SCUFCONT_SUCCESS);
  109. assert_string_equal(*SCDArray_charp_at(&arr, 0), "Hello");
  110. assert_string_equal(*SCDArray_charp_at(&arr, 1), "World");
  111. SCDArray_charp_free(&arr);
  112. }
  113. void test_DArray_push_back_multiple(void **state) {
  114. (void) state;
  115. SCDArray_charp arr;
  116. SCDARRAY_CHARP_ALLOC(&arr);
  117. char *nums[] = { "1", "2", "3", "4", "5" };
  118. const size_t nums_len = sizeof(nums) / sizeof(nums[0]);
  119. assert_true(SCDArray_charp_push_back_multiple(&arr, nums, nums_len, NULL) == SCUFCONT_SUCCESS);
  120. for (size_t i = 0; i < arr.len; i++) {
  121. assert_string_equal(*SCDArray_charp_at(&arr, i), nums[i]);
  122. }
  123. const size_t nums2_len = 3;
  124. char **nums2 = (char **) malloc(sizeof(char *) * nums2_len);
  125. nums2[0] = "6";
  126. nums2[1] = "7";
  127. nums2[2] = "8";
  128. assert_true(SCDArray_charp_push_back_multiple(&arr, nums2, nums2_len, NULL) == SCUFCONT_SUCCESS);
  129. for (size_t i = 0; i < nums_len; i++) {
  130. assert_string_equal(*SCDArray_charp_at(&arr, i), nums[i]);
  131. }
  132. for (size_t i = 0; i < nums2_len; i++) {
  133. assert_string_equal(*SCDArray_charp_at(&arr, i + nums_len), nums2[i]);
  134. }
  135. SCDArray_charp_free(&arr);
  136. // Freeing the array should not affect the original memory.
  137. assert_string_equal(nums2[0], "6");
  138. assert_string_equal(nums2[1], "7");
  139. assert_string_equal(nums2[2], "8");
  140. free(nums2);
  141. }
  142. void test_DArray_remove(void **state) {
  143. (void) state;
  144. SCDArray_charp arr;
  145. SCDARRAY_CHARP_ALLOC(&arr);
  146. char *nums[5];
  147. nums[0] = (char *) malloc(2);
  148. strncpy(nums[0], "1", 2);
  149. nums[1] = (char *) malloc(2);
  150. strncpy(nums[1], "2", 2);
  151. nums[2] = (char *) malloc(2);
  152. strncpy(nums[2], "3", 2);
  153. nums[3] = (char *) malloc(2);
  154. strncpy(nums[3], "4", 2);
  155. nums[4] = (char *) malloc(2);
  156. strncpy(nums[4], "5", 2);
  157. const size_t nums_len = 5;
  158. SCDArray_charp_push_back_multiple(&arr, nums, nums_len, NULL);
  159. for (size_t i = 0; i < arr.len; i++) {
  160. assert_string_equal(*SCDArray_charp_at(&arr, i), nums[i]);
  161. }
  162. // Remove last
  163. {
  164. const size_t old_len = arr.len;
  165. SCDArray_charp_remove(&arr, arr.len - 1);
  166. assert_uint_equal(arr.len, old_len - 1);
  167. char *new_nums[] = { "1", "2", "3", "4" };
  168. assert_uint_equal(arr.len, sizeof(new_nums) / sizeof(new_nums[0]));
  169. for (size_t i = 0; i < arr.len; i++) {
  170. char **elem = SCDArray_charp_at(&arr, i);
  171. assert_string_equal(*elem, new_nums[i]);
  172. }
  173. assert_non_null(nums[nums_len - 1]);
  174. assert_string_equal(nums[nums_len - 1], "5");
  175. }
  176. // Remove from middle
  177. {
  178. const size_t old_len = arr.len;
  179. SCDArray_charp_remove(&arr, 1);
  180. assert_uint_equal(arr.len, old_len - 1);
  181. char *new_nums[] = { "1", "3", "4" };
  182. assert_uint_equal(arr.len, sizeof(new_nums) / sizeof(new_nums[0]));
  183. for (size_t i = 0; i < arr.len; i++) {
  184. assert_string_equal(*SCDArray_charp_at(&arr, i), new_nums[i]);
  185. }
  186. assert_non_null(nums[1]);
  187. assert_string_equal(nums[1], "2");
  188. }
  189. // Remove first
  190. {
  191. const size_t old_len = arr.len;
  192. SCDArray_charp_remove(&arr, 0);
  193. assert_uint_equal(arr.len, old_len - 1);
  194. char *new_nums[] = { "3", "4" };
  195. assert_uint_equal(arr.len, sizeof(new_nums) / sizeof(new_nums[0]));
  196. for (size_t i = 0; i < arr.len; i++) {
  197. assert_string_equal(*SCDArray_charp_at(&arr, i), new_nums[i]);
  198. }
  199. assert_non_null(nums[0]);
  200. assert_string_equal(nums[0], "1");
  201. }
  202. SCDArray_charp_free(&arr);
  203. for (size_t i = 0; i < nums_len; i++) {
  204. free(nums[i]);
  205. }
  206. }
  207. void test_DArray_clear(void **state) {
  208. (void) state;
  209. SCDArray_charp arr;
  210. SCDARRAY_CHARP_ALLOC(&arr);
  211. char *words[] = { "Hello", "World", "!", "Foo", "bar" };
  212. const size_t words_len = sizeof(words) / sizeof(words[0]);
  213. for (size_t i = 0; i < words_len; i++) {
  214. SCDArray_charp_push_back(&arr, words + i, NULL);
  215. }
  216. assert_uint_equal(arr.len, words_len);
  217. for (size_t i = 0; i < words_len; i++) {
  218. char **w = SCDArray_charp_at(&arr, i);
  219. assert_string_equal(*w, words[i]);
  220. }
  221. SCDArray_charp_clear(&arr);
  222. assert_uint_equal(arr.len, 0);
  223. }
  224. int DArray_tests_run(void) {
  225. const struct CMUnitTest tests[] = {
  226. cmocka_unit_test(test_DArray_alloc),
  227. cmocka_unit_test(test_DArray_alloc_copy),
  228. cmocka_unit_test(test_DArray_push_back),
  229. cmocka_unit_test(test_DArray_at),
  230. cmocka_unit_test(test_DArray_push_back_multiple),
  231. cmocka_unit_test(test_DArray_remove),
  232. cmocka_unit_test(test_DArray_clear)
  233. };
  234. return cmocka_run_group_tests_name("DArray", tests, NULL, NULL);
  235. }