Wed, 06 Nov 2019 16:27:54 +0100
adds testcase to uncover a bug in ucx_array_append()
olaf@9 | 1 | /* |
universe@103 | 2 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER. |
universe@103 | 3 | * |
universe@334 | 4 | * Copyright 2019 Mike Becker, Olaf Wintermann All rights reserved. |
universe@103 | 5 | * |
universe@103 | 6 | * Redistribution and use in source and binary forms, with or without |
universe@103 | 7 | * modification, are permitted provided that the following conditions are met: |
universe@103 | 8 | * |
universe@103 | 9 | * 1. Redistributions of source code must retain the above copyright |
universe@103 | 10 | * notice, this list of conditions and the following disclaimer. |
universe@103 | 11 | * |
universe@103 | 12 | * 2. Redistributions in binary form must reproduce the above copyright |
universe@103 | 13 | * notice, this list of conditions and the following disclaimer in the |
universe@103 | 14 | * documentation and/or other materials provided with the distribution. |
universe@103 | 15 | * |
universe@103 | 16 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
universe@103 | 17 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
universe@103 | 18 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
universe@103 | 19 | * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE |
universe@103 | 20 | * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
universe@103 | 21 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
universe@103 | 22 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
universe@103 | 23 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
universe@103 | 24 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
universe@103 | 25 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
universe@103 | 26 | * POSSIBILITY OF SUCH DAMAGE. |
olaf@9 | 27 | */ |
olaf@9 | 28 | |
universe@334 | 29 | #include "array_tests.h" |
universe@251 | 30 | #include <ucx/utils.h> |
olaf@9 | 31 | |
universe@356 | 32 | UCX_TEST(test_ucx_array_destroy) { |
universe@356 | 33 | UcxArray array; |
universe@356 | 34 | ucx_array_init(&array, 16, sizeof(int)); |
universe@334 | 35 | |
universe@334 | 36 | UCX_TEST_BEGIN |
universe@353 | 37 | ucx_array_destroy(&array); |
universe@356 | 38 | UCX_TEST_ASSERT(array.data == NULL, "data pointer not NULL after destroy"); |
universe@356 | 39 | UCX_TEST_ASSERT(array.size == 0, "size not zero after destroy"); |
universe@356 | 40 | UCX_TEST_ASSERT(array.capacity == 0, "capacity not zero after destroy"); |
universe@334 | 41 | UCX_TEST_ASSERT(array.allocator == ucx_default_allocator(), |
universe@356 | 42 | "allocator corrupted during destroy"); |
universe@334 | 43 | UCX_TEST_END |
universe@334 | 44 | } |
universe@334 | 45 | |
universe@334 | 46 | UCX_TEST(test_ucx_array_new) { |
universe@356 | 47 | UcxArray* array = ucx_array_new(16, 47); |
universe@334 | 48 | |
universe@334 | 49 | UCX_TEST_BEGIN |
universe@356 | 50 | UCX_TEST_ASSERT(array->data, "no memory allocated"); |
universe@356 | 51 | UCX_TEST_ASSERT(array->size == 0, "size not initially zero"); |
universe@356 | 52 | UCX_TEST_ASSERT(array->capacity == 16, "capacity not as requested"); |
universe@356 | 53 | UCX_TEST_ASSERT(array->elemsize == 47, "element size not as requested"); |
universe@356 | 54 | UCX_TEST_ASSERT(array->allocator == ucx_default_allocator(), |
universe@334 | 55 | "array not using the default allocator"); |
universe@334 | 56 | UCX_TEST_END |
universe@356 | 57 | ucx_array_free(array); |
universe@334 | 58 | } |
universe@334 | 59 | |
universe@354 | 60 | UCX_TEST(test_ucx_array_append_from) { |
universe@356 | 61 | UcxArray *array = ucx_array_new(16, sizeof(int)); |
universe@342 | 62 | int *elements; |
universe@334 | 63 | |
universe@334 | 64 | int x = 42; |
universe@356 | 65 | ucx_array_append_from(array, &x, 1); |
universe@33 | 66 | UCX_TEST_BEGIN |
universe@27 | 67 | |
universe@356 | 68 | elements = array->data; |
universe@342 | 69 | UCX_TEST_ASSERT(elements[0] == 42, "failed"); |
universe@27 | 70 | |
universe@354 | 71 | int y[2] = {13, 37}; |
universe@356 | 72 | ucx_array_append_from(array, y, 2); |
universe@27 | 73 | |
universe@356 | 74 | elements = array->data; |
universe@356 | 75 | UCX_TEST_ASSERT(array->size == 3, "incorrect size after append"); |
universe@342 | 76 | UCX_TEST_ASSERT(elements[1] == 13, "failed"); |
universe@354 | 77 | UCX_TEST_ASSERT(elements[2] == 37, "failed"); |
universe@342 | 78 | UCX_TEST_ASSERT(elements[0] == 42, |
universe@334 | 79 | "append corrupted previously inserted data"); |
universe@334 | 80 | |
universe@356 | 81 | ucx_array_append_from(array, NULL, 2); |
universe@334 | 82 | |
universe@356 | 83 | elements = array->data; |
universe@356 | 84 | UCX_TEST_ASSERT(array->size == 5, "incorrect size after NULL append"); |
universe@354 | 85 | UCX_TEST_ASSERT(elements[3] == 0, "element is not zeroed"); |
universe@354 | 86 | UCX_TEST_ASSERT(elements[4] == 0, "element is not zeroed"); |
universe@342 | 87 | UCX_TEST_ASSERT(elements[0] == 42, |
universe@334 | 88 | "NULL append corrupted previously inserted data"); |
universe@342 | 89 | UCX_TEST_ASSERT(elements[1] == 13, |
universe@334 | 90 | "NULL append corrupted previously inserted data"); |
universe@354 | 91 | UCX_TEST_ASSERT(elements[2] == 37, |
universe@354 | 92 | "NULL append corrupted previously inserted data"); |
universe@354 | 93 | |
universe@354 | 94 | UCX_TEST_END |
universe@354 | 95 | |
universe@356 | 96 | ucx_array_free(array); |
universe@354 | 97 | } |
universe@354 | 98 | |
universe@366 | 99 | UCX_TEST(test_ucx_array_append_from_struct) { |
universe@366 | 100 | struct teststruct { |
universe@366 | 101 | unsigned long long x; |
universe@366 | 102 | unsigned long long y; |
universe@366 | 103 | unsigned long long z; |
universe@366 | 104 | }; |
universe@366 | 105 | |
universe@366 | 106 | UcxArray *array = ucx_array_new(16, sizeof(struct teststruct)); |
universe@366 | 107 | struct teststruct *elements; |
universe@366 | 108 | |
universe@366 | 109 | struct teststruct data; |
universe@366 | 110 | data.x = 13; data.y = 37; data.z = 47; |
universe@366 | 111 | |
universe@366 | 112 | ucx_array_append_from(array, &data, 1); |
universe@366 | 113 | UCX_TEST_BEGIN |
universe@366 | 114 | |
universe@366 | 115 | elements = array->data; |
universe@366 | 116 | UCX_TEST_ASSERT(elements[0].x == 13, "failed"); |
universe@366 | 117 | UCX_TEST_ASSERT(elements[0].y == 37, "failed"); |
universe@366 | 118 | UCX_TEST_ASSERT(elements[0].z == 47, "failed"); |
universe@366 | 119 | |
universe@366 | 120 | data.x = 0; data.y = 8; data.z = 15; |
universe@366 | 121 | ucx_array_append_from(array, &data, 1); |
universe@366 | 122 | |
universe@366 | 123 | elements = array->data; |
universe@366 | 124 | UCX_TEST_ASSERT(array->size == 2, "incorrect size after append"); |
universe@366 | 125 | UCX_TEST_ASSERT(elements[1].x == 0, "failed"); |
universe@366 | 126 | UCX_TEST_ASSERT(elements[1].y == 8, "failed"); |
universe@366 | 127 | UCX_TEST_ASSERT(elements[1].z == 15, "failed"); |
universe@366 | 128 | |
universe@366 | 129 | UCX_TEST_ASSERT(elements[0].x == 13, |
universe@366 | 130 | "append corrupted previously inserted data"); |
universe@366 | 131 | UCX_TEST_ASSERT(elements[0].y == 37, |
universe@366 | 132 | "append corrupted previously inserted data"); |
universe@366 | 133 | UCX_TEST_ASSERT(elements[0].z == 47, |
universe@366 | 134 | "append corrupted previously inserted data"); |
universe@366 | 135 | |
universe@366 | 136 | UCX_TEST_END |
universe@366 | 137 | |
universe@366 | 138 | ucx_array_destroy(array); |
universe@366 | 139 | } |
universe@366 | 140 | |
universe@354 | 141 | UCX_TEST(test_ucx_array_prepend_from) { |
universe@354 | 142 | int *elems; |
universe@356 | 143 | UcxArray *array = ucx_array_new(16, sizeof(int)); |
universe@354 | 144 | |
universe@354 | 145 | int x = 42; |
universe@356 | 146 | ucx_array_prepend_from(array, &x, 1); |
universe@354 | 147 | UCX_TEST_BEGIN |
universe@354 | 148 | |
universe@356 | 149 | elems = array->data; |
universe@354 | 150 | UCX_TEST_ASSERT(elems[0] == 42, "failed"); |
universe@354 | 151 | |
universe@354 | 152 | int y[2] = {13, 37}; |
universe@356 | 153 | ucx_array_prepend_from(array, y, 2); |
universe@354 | 154 | |
universe@356 | 155 | elems = array->data; |
universe@356 | 156 | UCX_TEST_ASSERT(array->size == 3, "incorrect size after prepend"); |
universe@354 | 157 | UCX_TEST_ASSERT(elems[0] == 13, "failed"); |
universe@354 | 158 | UCX_TEST_ASSERT(elems[1] == 37, "failed"); |
universe@354 | 159 | UCX_TEST_ASSERT(elems[2] == 42, |
universe@354 | 160 | "prepend corrupted previously inserted data"); |
universe@354 | 161 | |
universe@356 | 162 | ucx_array_prepend_from(array, NULL, 2); |
universe@354 | 163 | |
universe@356 | 164 | elems = array->data; |
universe@356 | 165 | UCX_TEST_ASSERT(array->size == 5, "incorrect size after NULL prepend"); |
universe@354 | 166 | UCX_TEST_ASSERT(elems[0] == 0, "element is not zeroed"); |
universe@354 | 167 | UCX_TEST_ASSERT(elems[1] == 0, "element is not zeroed"); |
universe@354 | 168 | UCX_TEST_ASSERT(elems[2] == 13, |
universe@354 | 169 | "NULL prepend corrupted previously inserted data"); |
universe@354 | 170 | UCX_TEST_ASSERT(elems[3] == 37, |
universe@354 | 171 | "NULL prepend corrupted previously inserted data"); |
universe@354 | 172 | UCX_TEST_ASSERT(elems[4] == 42, |
universe@354 | 173 | "NULL prepend corrupted previously inserted data"); |
universe@354 | 174 | |
universe@354 | 175 | UCX_TEST_END |
universe@354 | 176 | |
universe@356 | 177 | ucx_array_free(array); |
universe@354 | 178 | } |
universe@354 | 179 | |
universe@354 | 180 | UCX_TEST(test_ucx_array_set_from) { |
universe@354 | 181 | int *elems; |
universe@356 | 182 | UcxArray *array = ucx_array_new(16, sizeof(int)); |
universe@354 | 183 | |
universe@354 | 184 | int x = 42; |
universe@354 | 185 | |
universe@354 | 186 | UCX_TEST_BEGIN |
universe@354 | 187 | |
universe@356 | 188 | ucx_array_set_from(array, 7, &x, 1); |
universe@354 | 189 | |
universe@356 | 190 | elems = array->data; |
universe@354 | 191 | UCX_TEST_ASSERT(elems[7] == 42, "failed"); |
universe@356 | 192 | UCX_TEST_ASSERT(array->size >= 8, "array not resized on set"); |
universe@356 | 193 | UCX_TEST_ASSERT(array->capacity == 16, "capacity changed unnecessarily"); |
universe@354 | 194 | |
universe@354 | 195 | int y[2] = {13, 37}; |
universe@356 | 196 | ucx_array_set_from(array, 27, y, 2); |
universe@354 | 197 | |
universe@356 | 198 | elems = array->data; |
universe@354 | 199 | UCX_TEST_ASSERT(elems[27] == 13, "failed"); |
universe@354 | 200 | UCX_TEST_ASSERT(elems[28] == 37, "failed"); |
universe@356 | 201 | UCX_TEST_ASSERT(array->size == 29, "array not resized on set"); |
universe@356 | 202 | UCX_TEST_ASSERT(array->capacity == 32, "capacity not grown"); |
universe@354 | 203 | |
universe@356 | 204 | ucx_array_set_from(array, 7, NULL, 2); |
universe@354 | 205 | |
universe@356 | 206 | elems = array->data; |
universe@354 | 207 | UCX_TEST_ASSERT(elems[7] == 0, "not zeroed on NULL set"); |
universe@354 | 208 | UCX_TEST_ASSERT(elems[8] == 0, "not zeroed on NULL set"); |
universe@354 | 209 | |
universe@354 | 210 | UCX_TEST_END |
universe@354 | 211 | |
universe@356 | 212 | ucx_array_free(array); |
universe@354 | 213 | } |
universe@354 | 214 | |
universe@354 | 215 | UCX_TEST(test_ucx_array_append) { |
universe@356 | 216 | UcxArray *array = ucx_array_new(16, sizeof(int)); |
universe@354 | 217 | int *elements; |
universe@354 | 218 | |
universe@356 | 219 | ucx_array_append(array, 42); |
universe@354 | 220 | UCX_TEST_BEGIN |
universe@354 | 221 | |
universe@356 | 222 | elements = array->data; |
universe@354 | 223 | UCX_TEST_ASSERT(elements[0] == 42, "failed"); |
universe@354 | 224 | |
universe@356 | 225 | ucx_array_append(array, 13); |
universe@356 | 226 | ucx_array_append(array, 37); |
universe@354 | 227 | |
universe@356 | 228 | elements = array->data; |
universe@356 | 229 | UCX_TEST_ASSERT(array->size == 3, "incorrect size after append"); |
universe@354 | 230 | UCX_TEST_ASSERT(elements[1] == 13, "failed"); |
universe@354 | 231 | UCX_TEST_ASSERT(elements[2] == 37, "failed"); |
universe@354 | 232 | UCX_TEST_ASSERT(elements[0] == 42, |
universe@354 | 233 | "append corrupted previously inserted data"); |
universe@334 | 234 | |
universe@33 | 235 | UCX_TEST_END |
universe@27 | 236 | |
universe@356 | 237 | ucx_array_destroy(array); |
universe@24 | 238 | } |
universe@24 | 239 | |
universe@366 | 240 | UCX_TEST(test_ucx_array_append_struct) { |
universe@366 | 241 | struct teststruct { |
universe@366 | 242 | unsigned long long x; |
universe@366 | 243 | unsigned long long y; |
universe@366 | 244 | unsigned long long z; |
universe@366 | 245 | }; |
universe@366 | 246 | |
universe@366 | 247 | UcxArray *array = ucx_array_new(16, sizeof(struct teststruct)); |
universe@366 | 248 | struct teststruct *elements; |
universe@366 | 249 | |
universe@366 | 250 | struct teststruct data; |
universe@366 | 251 | data.x = 13; data.y = 37; data.z = 47; |
universe@366 | 252 | |
universe@366 | 253 | ucx_array_append(array, data); |
universe@366 | 254 | UCX_TEST_BEGIN |
universe@366 | 255 | |
universe@366 | 256 | elements = array->data; |
universe@366 | 257 | UCX_TEST_ASSERT(elements[0].x == 13, "failed"); |
universe@366 | 258 | UCX_TEST_ASSERT(elements[0].y == 37, "failed"); |
universe@366 | 259 | UCX_TEST_ASSERT(elements[0].z == 47, "failed"); |
universe@366 | 260 | |
universe@366 | 261 | data.x = 0; data.y = 8; data.z = 15; |
universe@366 | 262 | ucx_array_append(array, data); |
universe@366 | 263 | |
universe@366 | 264 | elements = array->data; |
universe@366 | 265 | UCX_TEST_ASSERT(array->size == 2, "incorrect size after append"); |
universe@366 | 266 | UCX_TEST_ASSERT(elements[1].x == 0, "failed"); |
universe@366 | 267 | UCX_TEST_ASSERT(elements[1].y == 8, "failed"); |
universe@366 | 268 | UCX_TEST_ASSERT(elements[1].z == 15, "failed"); |
universe@366 | 269 | |
universe@366 | 270 | UCX_TEST_ASSERT(elements[0].x == 13, |
universe@366 | 271 | "append corrupted previously inserted data"); |
universe@366 | 272 | UCX_TEST_ASSERT(elements[0].y == 37, |
universe@366 | 273 | "append corrupted previously inserted data"); |
universe@366 | 274 | UCX_TEST_ASSERT(elements[0].z == 47, |
universe@366 | 275 | "append corrupted previously inserted data"); |
universe@366 | 276 | |
universe@366 | 277 | UCX_TEST_END |
universe@366 | 278 | |
universe@366 | 279 | ucx_array_destroy(array); |
universe@366 | 280 | } |
universe@366 | 281 | |
universe@334 | 282 | UCX_TEST(test_ucx_array_prepend) { |
universe@342 | 283 | int *elems; |
universe@356 | 284 | UcxArray *array = ucx_array_new(16, sizeof(int)); |
universe@334 | 285 | |
universe@356 | 286 | ucx_array_prepend(array, 42); |
universe@33 | 287 | UCX_TEST_BEGIN |
universe@27 | 288 | |
universe@356 | 289 | elems = array->data; |
universe@342 | 290 | UCX_TEST_ASSERT(elems[0] == 42, "failed"); |
universe@334 | 291 | |
universe@356 | 292 | ucx_array_prepend(array, 37); |
universe@356 | 293 | ucx_array_prepend(array, 13); |
universe@334 | 294 | |
universe@356 | 295 | elems = array->data; |
universe@356 | 296 | UCX_TEST_ASSERT(array->size == 3, "incorrect size after prepend"); |
universe@342 | 297 | UCX_TEST_ASSERT(elems[0] == 13, "failed"); |
universe@354 | 298 | UCX_TEST_ASSERT(elems[1] == 37, "failed"); |
universe@354 | 299 | UCX_TEST_ASSERT(elems[2] == 42, |
universe@334 | 300 | "prepend corrupted previously inserted data"); |
universe@334 | 301 | |
universe@33 | 302 | UCX_TEST_END |
universe@334 | 303 | |
universe@356 | 304 | ucx_array_free(array); |
universe@18 | 305 | } |
universe@18 | 306 | |
universe@337 | 307 | UCX_TEST(test_ucx_array_set) { |
universe@342 | 308 | int *elems; |
universe@356 | 309 | UcxArray *array = ucx_array_new(16, sizeof(int)); |
universe@337 | 310 | |
universe@337 | 311 | UCX_TEST_BEGIN |
universe@337 | 312 | |
universe@356 | 313 | ucx_array_set(array, 7, 42); |
universe@342 | 314 | |
universe@356 | 315 | elems = array->data; |
universe@342 | 316 | UCX_TEST_ASSERT(elems[7] == 42, "failed"); |
universe@356 | 317 | UCX_TEST_ASSERT(array->size == 8, "array not resized on set"); |
universe@356 | 318 | UCX_TEST_ASSERT(array->capacity == 16, "capacity changed unnecessarily"); |
universe@337 | 319 | |
universe@356 | 320 | ucx_array_set(array, 27, 13); |
universe@356 | 321 | ucx_array_set(array, 28, 37); |
universe@337 | 322 | |
universe@356 | 323 | elems = array->data; |
universe@342 | 324 | UCX_TEST_ASSERT(elems[27] == 13, "failed"); |
universe@354 | 325 | UCX_TEST_ASSERT(elems[28] == 37, "failed"); |
universe@356 | 326 | UCX_TEST_ASSERT(array->size == 29, "array not resized on set"); |
universe@356 | 327 | UCX_TEST_ASSERT(array->capacity == 32, "capacity not grown"); |
universe@354 | 328 | |
universe@337 | 329 | UCX_TEST_END |
universe@337 | 330 | |
universe@356 | 331 | ucx_array_free(array); |
universe@337 | 332 | } |
universe@337 | 333 | |
universe@334 | 334 | UCX_TEST(test_ucx_array_equals) { |
universe@356 | 335 | UcxArray *a1 = ucx_array_new(16, sizeof(int32_t)); |
universe@356 | 336 | UcxArray *a2 = ucx_array_new(16, sizeof(int32_t)); |
universe@356 | 337 | UcxArray *a3 = ucx_array_new(16, sizeof(int64_t)); |
universe@356 | 338 | UcxArray *a4 = ucx_array_new(16, sizeof(int32_t)); |
universe@27 | 339 | |
universe@350 | 340 | int32_t *intelems; |
universe@350 | 341 | int64_t *longintelems; |
universe@342 | 342 | |
universe@356 | 343 | a1->size = 5; |
universe@356 | 344 | intelems = a1->data; |
universe@342 | 345 | intelems[0] = 47; |
universe@342 | 346 | intelems[1] = 11; |
universe@342 | 347 | intelems[2] = 0; |
universe@342 | 348 | intelems[3] = 8; |
universe@342 | 349 | intelems[4] = 15; |
universe@356 | 350 | a2->size = 5; |
universe@356 | 351 | intelems = a2->data; |
universe@342 | 352 | intelems[0] = 47; |
universe@342 | 353 | intelems[1] = 11; |
universe@342 | 354 | intelems[2] = 0; |
universe@342 | 355 | intelems[3] = 8; |
universe@342 | 356 | intelems[4] = 15; |
universe@356 | 357 | a3->size = 5; |
universe@356 | 358 | longintelems = a3->data; |
universe@342 | 359 | longintelems[0] = 47; |
universe@342 | 360 | longintelems[1] = 11; |
universe@342 | 361 | longintelems[2] = 0; |
universe@342 | 362 | longintelems[3] = 8; |
universe@342 | 363 | longintelems[4] = 15; |
universe@356 | 364 | a4->size = 5; |
universe@356 | 365 | intelems = a4->data; |
universe@342 | 366 | intelems[0] = 47; |
universe@342 | 367 | intelems[1] = 11; |
universe@342 | 368 | intelems[2] = -6; |
universe@342 | 369 | intelems[3] = 8; |
universe@342 | 370 | intelems[4] = 15; |
universe@27 | 371 | |
universe@123 | 372 | UCX_TEST_BEGIN |
universe@123 | 373 | |
universe@350 | 374 | UCX_TEST_ASSERT(ucx_array_equals(a1, a2, ucx_cmp_int32, NULL), "failed"); |
universe@350 | 375 | UCX_TEST_ASSERT(!ucx_array_equals(a1, a4, ucx_cmp_int32, NULL), "failed"); |
universe@350 | 376 | UCX_TEST_ASSERT(!ucx_array_equals(a4, a1, ucx_cmp_int32, NULL), "failed"); |
universe@350 | 377 | UCX_TEST_ASSERT(!ucx_array_equals(a1, a3, ucx_cmp_int64, NULL), |
universe@336 | 378 | "comparing arrays of different element size shall fail"); |
universe@350 | 379 | UCX_TEST_ASSERT(!ucx_array_equals(a3, a1, ucx_cmp_int64, NULL), |
universe@336 | 380 | "comparing arrays of different element size shall fail"); |
universe@334 | 381 | |
universe@336 | 382 | UCX_TEST_ASSERT(ucx_array_equals(a1, a2, NULL, NULL), |
universe@334 | 383 | "compare using memcmp() failed"); |
universe@336 | 384 | UCX_TEST_ASSERT(!ucx_array_equals(a1, a4, NULL, NULL), |
universe@334 | 385 | "compare using memcmp() failed"); |
universe@27 | 386 | |
universe@33 | 387 | UCX_TEST_END |
universe@356 | 388 | ucx_array_free(a1); |
universe@356 | 389 | ucx_array_free(a2); |
universe@356 | 390 | ucx_array_free(a3); |
universe@356 | 391 | ucx_array_free(a4); |
olaf@9 | 392 | } |
olaf@11 | 393 | |
universe@334 | 394 | UCX_TEST(test_ucx_array_concat) { |
universe@356 | 395 | UcxArray *a1 = ucx_array_new(16, sizeof(int)); |
universe@356 | 396 | UcxArray *a2 = ucx_array_new(16, sizeof(int)); |
universe@342 | 397 | int *elems; |
universe@334 | 398 | |
universe@356 | 399 | a1->size = 2; |
universe@356 | 400 | elems = a1->data; |
universe@342 | 401 | elems[0] = 47; |
universe@342 | 402 | elems[1] = 11; |
universe@356 | 403 | a2->size = 3; |
universe@356 | 404 | elems = a2->data; |
universe@342 | 405 | elems[0] = 0; |
universe@342 | 406 | elems[1] = 8; |
universe@342 | 407 | elems[2] = 15; |
universe@27 | 408 | |
universe@123 | 409 | UCX_TEST_BEGIN |
universe@123 | 410 | |
universe@356 | 411 | UCX_TEST_ASSERT(!ucx_array_concat(a1, a2), "failed"); |
universe@356 | 412 | UCX_TEST_ASSERT(a1->size == 5, "failed"); |
universe@356 | 413 | elems = a1->data; |
universe@342 | 414 | UCX_TEST_ASSERT(elems[0] == 47, "failed"); |
universe@342 | 415 | UCX_TEST_ASSERT(elems[1] == 11, "failed"); |
universe@342 | 416 | UCX_TEST_ASSERT(elems[2] == 0, "failed"); |
universe@342 | 417 | UCX_TEST_ASSERT(elems[3] == 8, "failed"); |
universe@342 | 418 | UCX_TEST_ASSERT(elems[4] == 15, "failed"); |
universe@27 | 419 | |
universe@356 | 420 | a1->elemsize *= 2; |
universe@356 | 421 | UCX_TEST_ASSERT(ucx_array_concat(a1, a2), |
universe@334 | 422 | "arrays of different element size must not be concatenated"); |
universe@356 | 423 | UCX_TEST_ASSERT(a1->size == 5, |
universe@334 | 424 | "arrays of different element size must not be concatenated"); |
universe@27 | 425 | |
universe@33 | 426 | UCX_TEST_END |
universe@356 | 427 | ucx_array_free(a1); |
universe@356 | 428 | ucx_array_free(a2); |
universe@27 | 429 | } |
universe@27 | 430 | |
universe@344 | 431 | UCX_TEST(test_ucx_array_at) { |
universe@356 | 432 | UcxArray *array = ucx_array_new(16, sizeof(int)); |
universe@344 | 433 | |
universe@354 | 434 | int x[3] = {42, 13, 5}; |
universe@356 | 435 | ucx_array_append_from(array, x, 3); |
universe@344 | 436 | |
universe@344 | 437 | UCX_TEST_BEGIN |
universe@344 | 438 | |
universe@344 | 439 | UCX_TEST_ASSERT(*(int*)ucx_array_at(array, 1) == 13, "failed"); |
universe@344 | 440 | *(int*)ucx_array_at(array, 1) = 80; |
universe@344 | 441 | UCX_TEST_ASSERT(*(int*)ucx_array_at(array, 1) == 80, "assignment failed"); |
universe@344 | 442 | |
universe@344 | 443 | UCX_TEST_ASSERT(*(int*)ucx_array_at(array, 0) == 42, "corrupted data"); |
universe@344 | 444 | UCX_TEST_ASSERT(*(int*)ucx_array_at(array, 2) == 5, "corrupted data"); |
universe@344 | 445 | |
universe@344 | 446 | UCX_TEST_END |
universe@344 | 447 | |
universe@356 | 448 | ucx_array_free(array); |
universe@344 | 449 | } |
universe@344 | 450 | |
universe@334 | 451 | UCX_TEST(test_ucx_array_find) { |
universe@356 | 452 | UcxArray *array = ucx_array_new(16, sizeof(int)); |
universe@342 | 453 | int *elems; |
universe@334 | 454 | |
universe@356 | 455 | array->size = 5; |
universe@356 | 456 | elems = array->data; |
universe@342 | 457 | elems[0] = 47; |
universe@342 | 458 | elems[1] = 11; |
universe@342 | 459 | elems[2] = 0; |
universe@342 | 460 | elems[3] = 8; |
universe@342 | 461 | elems[4] = 15; |
universe@334 | 462 | |
universe@334 | 463 | int x = 8; |
universe@334 | 464 | int y = 90; |
universe@27 | 465 | |
universe@123 | 466 | UCX_TEST_BEGIN |
universe@123 | 467 | |
universe@334 | 468 | UCX_TEST_ASSERT(ucx_array_find(array,(void*)&x,ucx_cmp_int,NULL) == 3, |
universe@334 | 469 | "doesn't find element"); |
universe@334 | 470 | UCX_TEST_ASSERT(ucx_array_find(array,(void*)&y,ucx_cmp_int,NULL) == 5, |
universe@334 | 471 | "finds non-existing element"); |
universe@27 | 472 | |
universe@334 | 473 | UCX_TEST_ASSERT(ucx_array_find(array,(void*)&x,NULL,NULL) == 3, |
universe@334 | 474 | "failed using memcmp()"); |
universe@334 | 475 | UCX_TEST_ASSERT(ucx_array_find(array,(void*)&y,NULL,NULL) == 5, |
universe@334 | 476 | "failed using memcmp()"); |
universe@27 | 477 | |
universe@33 | 478 | UCX_TEST_END |
universe@356 | 479 | ucx_array_free(array); |
universe@27 | 480 | } |
universe@27 | 481 | |
universe@334 | 482 | UCX_TEST(test_ucx_array_contains) { |
universe@356 | 483 | UcxArray *array = ucx_array_new(16, sizeof(int)); |
universe@342 | 484 | int *elems; |
universe@334 | 485 | |
universe@356 | 486 | array->size = 5; |
universe@356 | 487 | elems = array->data; |
universe@342 | 488 | elems[0] = 47; |
universe@342 | 489 | elems[1] = 11; |
universe@342 | 490 | elems[2] = 0; |
universe@342 | 491 | elems[3] = 8; |
universe@342 | 492 | elems[4] = 15; |
universe@334 | 493 | |
universe@334 | 494 | int x = 8; |
universe@334 | 495 | int y = 90; |
universe@123 | 496 | |
universe@123 | 497 | UCX_TEST_BEGIN |
universe@123 | 498 | |
universe@334 | 499 | UCX_TEST_ASSERT(ucx_array_contains(array,(void*)&x,ucx_cmp_int,NULL), |
universe@334 | 500 | "false negative"); |
universe@334 | 501 | UCX_TEST_ASSERT(!ucx_array_contains(array,(void*)&y,ucx_cmp_int,NULL), |
universe@334 | 502 | "false positive"); |
universe@123 | 503 | |
universe@334 | 504 | UCX_TEST_ASSERT(ucx_array_contains(array,(void*)&x,NULL,NULL), |
universe@334 | 505 | "false negative using memcmp()"); |
universe@334 | 506 | UCX_TEST_ASSERT(!ucx_array_contains(array,(void*)&y,NULL,NULL), |
universe@334 | 507 | "false positive using memcmp()"); |
universe@123 | 508 | |
universe@123 | 509 | UCX_TEST_END |
universe@356 | 510 | ucx_array_free(array); |
universe@123 | 511 | } |
universe@123 | 512 | |
universe@334 | 513 | UCX_TEST(test_ucx_array_remove) { |
universe@356 | 514 | UcxArray *array = ucx_array_new(16, sizeof(int)); |
universe@342 | 515 | int *elems; |
universe@334 | 516 | |
universe@356 | 517 | array->size = 5; |
universe@356 | 518 | elems = array->data; |
universe@342 | 519 | elems[0] = 47; |
universe@342 | 520 | elems[1] = 11; |
universe@342 | 521 | elems[2] = 0; |
universe@342 | 522 | elems[3] = 8; |
universe@342 | 523 | elems[4] = 15; |
universe@334 | 524 | |
universe@334 | 525 | UCX_TEST_BEGIN |
universe@334 | 526 | |
universe@356 | 527 | ucx_array_remove(array, 2); |
universe@356 | 528 | elems = array->data; |
universe@334 | 529 | UCX_TEST_ASSERT( |
universe@342 | 530 | elems[0] == 47 && |
universe@342 | 531 | elems[1] == 11 && |
universe@342 | 532 | elems[2] == 8 && |
universe@342 | 533 | elems[3] == 15, |
universe@334 | 534 | "wrong contents after remove"); |
universe@356 | 535 | UCX_TEST_ASSERT(array->size == 4, "wrong size after remove"); |
universe@334 | 536 | |
universe@356 | 537 | ucx_array_remove_fast(array, 1); |
universe@356 | 538 | elems = array->data; |
universe@334 | 539 | UCX_TEST_ASSERT( |
universe@342 | 540 | elems[0] == 47 && |
universe@342 | 541 | elems[1] == 15 && |
universe@342 | 542 | elems[2] == 8, |
universe@334 | 543 | "wrong contents after fast remove"); |
universe@356 | 544 | UCX_TEST_ASSERT(array->size == 3, "wrong size after fast remove"); |
universe@334 | 545 | |
universe@334 | 546 | UCX_TEST_END |
universe@356 | 547 | ucx_array_free(array); |
universe@334 | 548 | } |
universe@334 | 549 | |
universe@334 | 550 | UCX_TEST(test_ucx_array_clone) { |
universe@356 | 551 | UcxArray array; |
universe@356 | 552 | UcxArray copy; |
universe@356 | 553 | ucx_array_init(&array, 16, sizeof(int)); |
universe@357 | 554 | ucx_array_init(©, 4, 2*sizeof(double)); |
universe@342 | 555 | int *elems; |
universe@334 | 556 | |
universe@334 | 557 | array.size = 5; |
universe@342 | 558 | elems = array.data; |
universe@342 | 559 | elems[0] = 47; |
universe@342 | 560 | elems[1] = 11; |
universe@342 | 561 | elems[2] = 0; |
universe@342 | 562 | elems[3] = 8; |
universe@342 | 563 | elems[4] = 15; |
universe@334 | 564 | |
universe@356 | 565 | ucx_array_clone(©, &array); |
universe@334 | 566 | UCX_TEST_BEGIN |
universe@334 | 567 | |
universe@334 | 568 | UCX_TEST_ASSERT(array.data != copy.data, "no true copy"); |
universe@334 | 569 | UCX_TEST_ASSERT(array.size == copy.size, "size mismatch"); |
universe@334 | 570 | UCX_TEST_ASSERT(array.capacity == copy.capacity, "capacity mismatch"); |
universe@334 | 571 | UCX_TEST_ASSERT(array.elemsize == copy.elemsize, "element size mismatch"); |
universe@334 | 572 | UCX_TEST_ASSERT(array.allocator == copy.allocator, "allocator mismatch"); |
universe@356 | 573 | UCX_TEST_ASSERT(ucx_array_equals(&array, ©, ucx_cmp_int, NULL), |
universe@356 | 574 | "contents do not match after clone"); |
universe@334 | 575 | |
universe@334 | 576 | UCX_TEST_END |
universe@334 | 577 | |
universe@353 | 578 | ucx_array_destroy(&array); |
universe@353 | 579 | ucx_array_destroy(©); |
universe@334 | 580 | } |
universe@334 | 581 | |
universe@342 | 582 | static int ucx_cmp_int_reverse(const void* x, const void* y, void* data) { |
universe@342 | 583 | return -ucx_cmp_int(x,y,data); |
universe@342 | 584 | } |
universe@342 | 585 | |
universe@334 | 586 | UCX_TEST(test_ucx_array_sort) { |
universe@342 | 587 | int *elems; |
universe@342 | 588 | |
universe@356 | 589 | UcxArray *array = ucx_array_new(16, sizeof(int)); |
universe@356 | 590 | array->size = 5; |
universe@356 | 591 | elems = array->data; |
universe@342 | 592 | elems[0] = 47; |
universe@342 | 593 | elems[1] = 11; |
universe@342 | 594 | elems[2] = 0; |
universe@342 | 595 | elems[3] = 8; |
universe@342 | 596 | elems[4] = 15; |
universe@334 | 597 | |
universe@356 | 598 | UcxArray *expected = ucx_array_new(16, sizeof(int)); |
universe@356 | 599 | expected->size = 5; |
universe@356 | 600 | elems = expected->data; |
universe@342 | 601 | elems[0] = 0; |
universe@342 | 602 | elems[1] = 8; |
universe@342 | 603 | elems[2] = 11; |
universe@342 | 604 | elems[3] = 15; |
universe@342 | 605 | elems[4] = 47; |
universe@342 | 606 | |
universe@356 | 607 | UcxArray *expectedrev = ucx_array_new(16, sizeof(int)); |
universe@356 | 608 | expectedrev->size = 5; |
universe@356 | 609 | elems = expectedrev->data; |
universe@342 | 610 | elems[0] = 47; |
universe@342 | 611 | elems[1] = 15; |
universe@342 | 612 | elems[2] = 11; |
universe@342 | 613 | elems[3] = 8; |
universe@342 | 614 | elems[4] = 0; |
universe@334 | 615 | |
universe@334 | 616 | |
universe@334 | 617 | UCX_TEST_BEGIN |
universe@356 | 618 | void* original_ptr = array->data; |
universe@336 | 619 | ucx_array_sort(array, ucx_cmp_int, NULL); |
universe@336 | 620 | UCX_TEST_ASSERT(ucx_array_equals(array, expected, NULL, NULL), "failed"); |
universe@356 | 621 | UCX_TEST_ASSERT(array->size == 5, "size corrupted"); |
universe@356 | 622 | UCX_TEST_ASSERT(array->data == original_ptr, "shall not reallocate"); |
universe@342 | 623 | |
universe@342 | 624 | ucx_array_sort(array, ucx_cmp_int_reverse, NULL); |
universe@342 | 625 | UCX_TEST_ASSERT(ucx_array_equals(array, expectedrev, NULL, NULL), "failed"); |
universe@342 | 626 | |
universe@356 | 627 | ucx_array_reserve(array, 32); |
universe@356 | 628 | ucx_array_reserve(expected, 32); |
universe@356 | 629 | array->size = expected->size = 32; |
universe@336 | 630 | for (size_t i = 0 ; i < 32 ; i++) { |
universe@356 | 631 | ((int*)array->data)[i]= ((i%2==0)?-1:1) * ((int) i); |
universe@356 | 632 | ((int*)expected->data)[i] = (-30+2*i) - (i > 15 ? 1 : 0); |
universe@336 | 633 | } |
universe@336 | 634 | |
universe@342 | 635 | /* dummy third argument to trigger a possible fallback for qsort_s */ |
universe@356 | 636 | ucx_array_sort(array, ucx_cmp_int, array->data); |
universe@336 | 637 | UCX_TEST_ASSERT(ucx_array_equals(array, expected, NULL, NULL), |
universe@336 | 638 | "failed for bigger arrays"); |
universe@334 | 639 | UCX_TEST_END |
universe@334 | 640 | |
universe@356 | 641 | ucx_array_free(expectedrev); |
universe@356 | 642 | ucx_array_free(expected); |
universe@356 | 643 | ucx_array_free(array); |
universe@334 | 644 | } |
universe@334 | 645 | |
universe@334 | 646 | UCX_TEST(test_ucx_array_autogrow) { |
universe@342 | 647 | int *elems; |
universe@356 | 648 | UcxArray *array = ucx_array_new(4, sizeof(int)); |
universe@356 | 649 | array->size = 3; |
universe@356 | 650 | elems = array->data; |
universe@342 | 651 | elems[0] = 47; |
universe@342 | 652 | elems[1] = 11; |
universe@334 | 653 | int x = 5; |
universe@123 | 654 | |
universe@123 | 655 | UCX_TEST_BEGIN |
universe@334 | 656 | |
universe@356 | 657 | void* oldptr = array->data; |
universe@123 | 658 | |
universe@356 | 659 | ucx_array_append(array, 5); |
universe@356 | 660 | UCX_TEST_ASSERT(array->capacity == 4 && array->data == oldptr, |
universe@334 | 661 | "array should not grow too early"); |
universe@356 | 662 | ucx_array_append(array, 5); |
universe@356 | 663 | elems = array->data; |
universe@356 | 664 | UCX_TEST_ASSERT(array->capacity == 8, "array did not grow"); |
universe@356 | 665 | UCX_TEST_ASSERT(array->size == 5, "incorrect size after grow"); |
universe@342 | 666 | UCX_TEST_ASSERT(elems[3] == 5 && elems[4] == 5, "corrupt data"); |
universe@172 | 667 | |
universe@123 | 668 | UCX_TEST_END |
universe@356 | 669 | ucx_array_free(array); |
universe@123 | 670 | } |
universe@123 | 671 | |
universe@334 | 672 | UCX_TEST(test_ucx_array_shrink) { |
universe@356 | 673 | UcxArray *array = ucx_array_new(16, sizeof(int)); |
universe@356 | 674 | array->size = 4; |
universe@90 | 675 | |
universe@123 | 676 | UCX_TEST_BEGIN |
universe@356 | 677 | UCX_TEST_ASSERT(!ucx_array_shrink(array), "failed"); |
universe@356 | 678 | UCX_TEST_ASSERT(array->capacity == 4, "incorrect capacity after shrink"); |
universe@334 | 679 | UCX_TEST_END |
universe@356 | 680 | ucx_array_free(array); |
universe@334 | 681 | } |
universe@334 | 682 | |
universe@334 | 683 | UCX_TEST(test_ucx_array_resize) { |
universe@356 | 684 | UcxArray *array = ucx_array_new(16, sizeof(int)); |
universe@356 | 685 | array->size = 8; |
universe@123 | 686 | |
universe@334 | 687 | UCX_TEST_BEGIN |
universe@334 | 688 | |
universe@356 | 689 | UCX_TEST_ASSERT(!ucx_array_resize(array, 32), "failed"); |
universe@356 | 690 | UCX_TEST_ASSERT(array->capacity == 32, "incorrect capacity after resize"); |
universe@356 | 691 | UCX_TEST_ASSERT(array->size == 8, "incorrect size after resize"); |
universe@334 | 692 | |
universe@356 | 693 | UCX_TEST_ASSERT(!ucx_array_resize(array, 4), "failed"); |
universe@356 | 694 | UCX_TEST_ASSERT(array->capacity == 4, "incorrect capacity after resize"); |
universe@356 | 695 | UCX_TEST_ASSERT(array->size == 4, "incorrect size after resize"); |
universe@90 | 696 | |
universe@90 | 697 | UCX_TEST_END |
universe@356 | 698 | ucx_array_free(array); |
universe@90 | 699 | } |
universe@90 | 700 | |
universe@334 | 701 | UCX_TEST(test_ucx_array_reserve) { |
universe@356 | 702 | UcxArray *array = ucx_array_new(16, sizeof(int)); |
universe@27 | 703 | |
universe@123 | 704 | UCX_TEST_BEGIN |
universe@334 | 705 | |
universe@356 | 706 | UCX_TEST_ASSERT(!ucx_array_reserve(array, 4), "failed"); |
universe@356 | 707 | UCX_TEST_ASSERT(array->capacity == 16, "reserve shall not shrink"); |
universe@334 | 708 | |
universe@356 | 709 | UCX_TEST_ASSERT(!ucx_array_resize(array, 32), "failed"); |
universe@356 | 710 | UCX_TEST_ASSERT(array->capacity == 32, "incorrect capacity after reserve"); |
olaf@162 | 711 | |
universe@33 | 712 | UCX_TEST_END |
universe@356 | 713 | ucx_array_free(array); |
universe@27 | 714 | } |
universe@355 | 715 | |
universe@355 | 716 | UCX_TEST(test_ucx_array_util_set) { |
universe@355 | 717 | size_t capacity = 16; |
universe@355 | 718 | int* array = malloc(sizeof(int)*capacity); |
universe@355 | 719 | |
universe@355 | 720 | UCX_TEST_BEGIN |
universe@355 | 721 | |
universe@355 | 722 | UCX_ARRAY_UTIL_SET(&array, &capacity, 7, 42); |
universe@355 | 723 | |
universe@355 | 724 | UCX_TEST_ASSERT(array[7] == 42, "failed"); |
universe@355 | 725 | UCX_TEST_ASSERT(capacity == 16, "capacity changed unnecessarily"); |
universe@355 | 726 | |
universe@355 | 727 | UCX_ARRAY_UTIL_SET(&array, &capacity, 37, 13); |
universe@355 | 728 | UCX_ARRAY_UTIL_SET(&array, &capacity, 38, 37); |
universe@355 | 729 | |
universe@355 | 730 | UCX_TEST_ASSERT(array[37] == 13, "failed"); |
universe@355 | 731 | UCX_TEST_ASSERT(array[38] == 37, "failed"); |
universe@355 | 732 | UCX_TEST_ASSERT(capacity == 64, "capacity not grown"); |
universe@355 | 733 | |
universe@355 | 734 | UCX_TEST_END |
universe@355 | 735 | |
universe@355 | 736 | free(array); |
universe@355 | 737 | } |