Wed, 25 Jan 2023 19:19:29 +0100
simplify list class - fixes #236
universe@398 | 1 | /* |
universe@398 | 2 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER. |
universe@398 | 3 | * |
universe@398 | 4 | * Copyright 2021 Mike Becker, Olaf Wintermann All rights reserved. |
universe@398 | 5 | * |
universe@398 | 6 | * Redistribution and use in source and binary forms, with or without |
universe@398 | 7 | * modification, are permitted provided that the following conditions are met: |
universe@398 | 8 | * |
universe@398 | 9 | * 1. Redistributions of source code must retain the above copyright |
universe@398 | 10 | * notice, this list of conditions and the following disclaimer. |
universe@398 | 11 | * |
universe@398 | 12 | * 2. Redistributions in binary form must reproduce the above copyright |
universe@398 | 13 | * notice, this list of conditions and the following disclaimer in the |
universe@398 | 14 | * documentation and/or other materials provided with the distribution. |
universe@398 | 15 | * |
universe@398 | 16 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
universe@398 | 17 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
universe@398 | 18 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
universe@398 | 19 | * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE |
universe@398 | 20 | * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
universe@398 | 21 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
universe@398 | 22 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
universe@398 | 23 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
universe@398 | 24 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
universe@398 | 25 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
universe@398 | 26 | * POSSIBILITY OF SUCH DAMAGE. |
universe@398 | 27 | */ |
universe@398 | 28 | |
universe@398 | 29 | #include "cx/linked_list.h" |
universe@509 | 30 | #include "cx/utils.h" |
universe@401 | 31 | #include <stdint.h> |
universe@401 | 32 | #include <string.h> |
universe@453 | 33 | #include <assert.h> |
universe@398 | 34 | |
universe@628 | 35 | // LOW LEVEL LINKED LIST FUNCTIONS |
universe@398 | 36 | |
universe@592 | 37 | #define CX_LL_PTR(cur, off) (*(void**)(((char*)(cur))+(off))) |
universe@480 | 38 | #define ll_prev(node) CX_LL_PTR(node, loc_prev) |
universe@480 | 39 | #define ll_next(node) CX_LL_PTR(node, loc_next) |
universe@480 | 40 | #define ll_advance(node) CX_LL_PTR(node, loc_advance) |
universe@639 | 41 | #define ll_data(node) (((char*)(node))+loc_data) |
universe@398 | 42 | |
universe@481 | 43 | void *cx_linked_list_at( |
universe@508 | 44 | void const *start, |
universe@481 | 45 | size_t start_index, |
universe@481 | 46 | ptrdiff_t loc_advance, |
universe@481 | 47 | size_t index |
universe@481 | 48 | ) { |
universe@473 | 49 | assert(start != NULL); |
universe@473 | 50 | assert(loc_advance >= 0); |
universe@438 | 51 | size_t i = start_index; |
universe@508 | 52 | void const *cur = start; |
universe@438 | 53 | while (i != index && cur != NULL) { |
universe@480 | 54 | cur = ll_advance(cur); |
universe@438 | 55 | i < index ? i++ : i--; |
universe@438 | 56 | } |
universe@508 | 57 | return (void *) cur; |
universe@438 | 58 | } |
universe@438 | 59 | |
universe@481 | 60 | size_t cx_linked_list_find( |
universe@489 | 61 | void const *start, |
universe@481 | 62 | ptrdiff_t loc_advance, |
universe@481 | 63 | ptrdiff_t loc_data, |
universe@481 | 64 | CxListComparator cmp_func, |
universe@489 | 65 | void const *elem |
universe@481 | 66 | ) { |
universe@480 | 67 | assert(start != NULL); |
universe@480 | 68 | assert(loc_advance >= 0); |
universe@480 | 69 | assert(loc_data >= 0); |
universe@480 | 70 | assert(cmp_func); |
universe@480 | 71 | |
universe@489 | 72 | void const *node = start; |
universe@480 | 73 | size_t index = 0; |
universe@480 | 74 | do { |
universe@480 | 75 | void *current = ll_data(node); |
universe@480 | 76 | if (cmp_func(current, elem) == 0) { |
universe@480 | 77 | return index; |
universe@480 | 78 | } |
universe@480 | 79 | node = ll_advance(node); |
universe@480 | 80 | index++; |
universe@480 | 81 | } while (node != NULL); |
universe@480 | 82 | return index; |
universe@480 | 83 | } |
universe@480 | 84 | |
universe@481 | 85 | void *cx_linked_list_first( |
universe@508 | 86 | void const *node, |
universe@481 | 87 | ptrdiff_t loc_prev |
universe@481 | 88 | ) { |
universe@475 | 89 | return cx_linked_list_last(node, loc_prev); |
universe@475 | 90 | } |
universe@475 | 91 | |
universe@481 | 92 | void *cx_linked_list_last( |
universe@508 | 93 | void const *node, |
universe@481 | 94 | ptrdiff_t loc_next |
universe@481 | 95 | ) { |
universe@478 | 96 | assert(node != NULL); |
universe@473 | 97 | assert(loc_next >= 0); |
universe@398 | 98 | |
universe@508 | 99 | void const *cur = node; |
universe@508 | 100 | void const *last; |
universe@456 | 101 | do { |
universe@456 | 102 | last = cur; |
universe@480 | 103 | } while ((cur = ll_next(cur)) != NULL); |
universe@398 | 104 | |
universe@508 | 105 | return (void *) last; |
universe@398 | 106 | } |
universe@398 | 107 | |
universe@481 | 108 | void *cx_linked_list_prev( |
universe@508 | 109 | void const *begin, |
universe@481 | 110 | ptrdiff_t loc_next, |
universe@508 | 111 | void const *node |
universe@481 | 112 | ) { |
universe@473 | 113 | assert(begin != NULL); |
universe@478 | 114 | assert(node != NULL); |
universe@473 | 115 | assert(loc_next >= 0); |
universe@473 | 116 | if (begin == node) return NULL; |
universe@508 | 117 | void const *cur = begin; |
universe@508 | 118 | void const *next; |
universe@473 | 119 | while (1) { |
universe@480 | 120 | next = ll_next(cur); |
universe@508 | 121 | if (next == node) return (void *) cur; |
universe@473 | 122 | cur = next; |
universe@473 | 123 | } |
universe@473 | 124 | } |
universe@473 | 125 | |
universe@481 | 126 | void cx_linked_list_link( |
universe@481 | 127 | void *left, |
universe@481 | 128 | void *right, |
universe@481 | 129 | ptrdiff_t loc_prev, |
universe@481 | 130 | ptrdiff_t loc_next |
universe@481 | 131 | ) { |
universe@473 | 132 | assert(loc_next >= 0); |
universe@481 | 133 | ll_next(left) = right; |
universe@481 | 134 | if (loc_prev >= 0) { |
universe@481 | 135 | ll_prev(right) = left; |
universe@481 | 136 | } |
universe@481 | 137 | } |
universe@481 | 138 | |
universe@481 | 139 | void cx_linked_list_unlink( |
universe@481 | 140 | void *left, |
universe@481 | 141 | void *right, |
universe@481 | 142 | ptrdiff_t loc_prev, |
universe@481 | 143 | ptrdiff_t loc_next |
universe@481 | 144 | ) { |
universe@481 | 145 | assert (loc_next >= 0); |
universe@481 | 146 | assert(ll_next(left) == right); |
universe@481 | 147 | ll_next(left) = NULL; |
universe@481 | 148 | if (loc_prev >= 0) { |
universe@481 | 149 | assert(ll_prev(right) == left); |
universe@481 | 150 | ll_prev(right) = NULL; |
universe@481 | 151 | } |
universe@481 | 152 | } |
universe@481 | 153 | |
universe@481 | 154 | void cx_linked_list_add( |
universe@481 | 155 | void **begin, |
universe@481 | 156 | void **end, |
universe@481 | 157 | ptrdiff_t loc_prev, |
universe@481 | 158 | ptrdiff_t loc_next, |
universe@481 | 159 | void *new_node |
universe@481 | 160 | ) { |
universe@456 | 161 | void *last; |
universe@456 | 162 | if (end == NULL) { |
universe@456 | 163 | assert(begin != NULL); |
universe@478 | 164 | last = *begin == NULL ? NULL : cx_linked_list_last(*begin, loc_next); |
universe@456 | 165 | } else { |
universe@456 | 166 | last = *end; |
universe@456 | 167 | } |
universe@481 | 168 | cx_linked_list_insert_chain(begin, end, loc_prev, loc_next, last, new_node, new_node); |
universe@481 | 169 | } |
universe@481 | 170 | |
universe@481 | 171 | void cx_linked_list_prepend( |
universe@481 | 172 | void **begin, |
universe@481 | 173 | void **end, |
universe@481 | 174 | ptrdiff_t loc_prev, |
universe@481 | 175 | ptrdiff_t loc_next, |
universe@481 | 176 | void *new_node |
universe@481 | 177 | ) { |
universe@481 | 178 | cx_linked_list_insert_chain(begin, end, loc_prev, loc_next, NULL, new_node, new_node); |
universe@481 | 179 | } |
universe@481 | 180 | |
universe@481 | 181 | void cx_linked_list_insert( |
universe@481 | 182 | void **begin, |
universe@481 | 183 | void **end, |
universe@481 | 184 | ptrdiff_t loc_prev, |
universe@481 | 185 | ptrdiff_t loc_next, |
universe@481 | 186 | void *node, |
universe@481 | 187 | void *new_node |
universe@481 | 188 | ) { |
universe@481 | 189 | cx_linked_list_insert_chain(begin, end, loc_prev, loc_next, node, new_node, new_node); |
universe@481 | 190 | } |
universe@481 | 191 | |
universe@481 | 192 | void cx_linked_list_insert_chain( |
universe@481 | 193 | void **begin, |
universe@481 | 194 | void **end, |
universe@481 | 195 | ptrdiff_t loc_prev, |
universe@481 | 196 | ptrdiff_t loc_next, |
universe@481 | 197 | void *node, |
universe@481 | 198 | void *insert_begin, |
universe@481 | 199 | void *insert_end |
universe@481 | 200 | ) { |
universe@481 | 201 | // find the end of the chain, if not specified |
universe@481 | 202 | if (insert_end == NULL) { |
universe@481 | 203 | insert_end = cx_linked_list_last(insert_begin, loc_next); |
universe@481 | 204 | } |
universe@481 | 205 | |
universe@481 | 206 | // determine the successor |
universe@481 | 207 | void *successor; |
universe@481 | 208 | if (node == NULL) { |
universe@481 | 209 | assert(begin != NULL || (end != NULL && loc_prev >= 0)); |
universe@475 | 210 | if (begin != NULL) { |
universe@481 | 211 | successor = *begin; |
universe@481 | 212 | *begin = insert_begin; |
universe@481 | 213 | } else { |
universe@481 | 214 | successor = *end == NULL ? NULL : cx_linked_list_first(*end, loc_prev); |
universe@475 | 215 | } |
universe@428 | 216 | } else { |
universe@481 | 217 | successor = ll_next(node); |
universe@481 | 218 | cx_linked_list_link(node, insert_begin, loc_prev, loc_next); |
universe@398 | 219 | } |
universe@398 | 220 | |
universe@481 | 221 | if (successor == NULL) { |
universe@481 | 222 | // the list ends with the new chain |
universe@481 | 223 | if (end != NULL) { |
universe@481 | 224 | *end = insert_end; |
universe@481 | 225 | } |
universe@481 | 226 | } else { |
universe@481 | 227 | cx_linked_list_link(insert_end, successor, loc_prev, loc_next); |
universe@398 | 228 | } |
universe@398 | 229 | } |
universe@398 | 230 | |
universe@481 | 231 | void cx_linked_list_remove( |
universe@481 | 232 | void **begin, |
universe@481 | 233 | void **end, |
universe@481 | 234 | ptrdiff_t loc_prev, |
universe@481 | 235 | ptrdiff_t loc_next, |
universe@481 | 236 | void *node |
universe@481 | 237 | ) { |
universe@477 | 238 | assert(node != NULL); |
universe@473 | 239 | assert(loc_next >= 0); |
universe@473 | 240 | assert(loc_prev >= 0 || begin != NULL); |
universe@473 | 241 | |
universe@473 | 242 | // find adjacent nodes |
universe@480 | 243 | void *next = ll_next(node); |
universe@473 | 244 | void *prev; |
universe@473 | 245 | if (loc_prev >= 0) { |
universe@480 | 246 | prev = ll_prev(node); |
universe@473 | 247 | } else { |
universe@473 | 248 | prev = cx_linked_list_prev(*begin, loc_next, node); |
universe@473 | 249 | } |
universe@473 | 250 | |
universe@476 | 251 | // update next pointer of prev node, or set begin |
universe@476 | 252 | if (prev == NULL) { |
universe@476 | 253 | if (begin != NULL) { |
universe@476 | 254 | *begin = next; |
universe@476 | 255 | } |
universe@476 | 256 | } else { |
universe@480 | 257 | ll_next(prev) = next; |
universe@473 | 258 | } |
universe@476 | 259 | |
universe@476 | 260 | // update prev pointer of next node, or set end |
universe@476 | 261 | if (next == NULL) { |
universe@476 | 262 | if (end != NULL) { |
universe@476 | 263 | *end = prev; |
universe@476 | 264 | } |
universe@476 | 265 | } else if (loc_prev >= 0) { |
universe@480 | 266 | ll_prev(next) = prev; |
universe@473 | 267 | } |
universe@473 | 268 | } |
universe@473 | 269 | |
universe@481 | 270 | size_t cx_linked_list_size( |
universe@489 | 271 | void const *node, |
universe@481 | 272 | ptrdiff_t loc_next |
universe@481 | 273 | ) { |
universe@473 | 274 | assert(loc_next >= 0); |
universe@468 | 275 | size_t size = 0; |
universe@468 | 276 | while (node != NULL) { |
universe@480 | 277 | node = ll_next(node); |
universe@468 | 278 | size++; |
universe@468 | 279 | } |
universe@468 | 280 | return size; |
universe@468 | 281 | } |
universe@468 | 282 | |
universe@481 | 283 | static void *cx_linked_list_sort_merge( |
universe@481 | 284 | ptrdiff_t loc_prev, |
universe@481 | 285 | ptrdiff_t loc_next, |
universe@481 | 286 | ptrdiff_t loc_data, |
universe@481 | 287 | size_t length, |
universe@481 | 288 | void *ls, |
universe@481 | 289 | void *le, |
universe@481 | 290 | void *re, |
universe@481 | 291 | CxListComparator cmp_func |
universe@481 | 292 | ) { |
universe@468 | 293 | const size_t sbo_len = 1024; |
universe@468 | 294 | void *sbo[sbo_len]; |
universe@468 | 295 | void **sorted = (length >= sbo_len) ? malloc(sizeof(void *) * length) : sbo; |
universe@508 | 296 | if (sorted == NULL) abort(); |
universe@468 | 297 | void *rc, *lc; |
universe@468 | 298 | |
universe@468 | 299 | lc = ls; |
universe@468 | 300 | rc = le; |
universe@468 | 301 | size_t n = 0; |
universe@468 | 302 | while (lc && lc != le && rc != re) { |
universe@468 | 303 | if (cmp_func(ll_data(lc), ll_data(rc)) <= 0) { |
universe@468 | 304 | sorted[n] = lc; |
universe@468 | 305 | lc = ll_next(lc); |
universe@468 | 306 | } else { |
universe@468 | 307 | sorted[n] = rc; |
universe@468 | 308 | rc = ll_next(rc); |
universe@468 | 309 | } |
universe@468 | 310 | n++; |
universe@468 | 311 | } |
universe@468 | 312 | while (lc && lc != le) { |
universe@468 | 313 | sorted[n] = lc; |
universe@468 | 314 | lc = ll_next(lc); |
universe@468 | 315 | n++; |
universe@468 | 316 | } |
universe@468 | 317 | while (rc && rc != re) { |
universe@468 | 318 | sorted[n] = rc; |
universe@468 | 319 | rc = ll_next(rc); |
universe@468 | 320 | n++; |
universe@468 | 321 | } |
universe@468 | 322 | |
universe@468 | 323 | // Update pointer |
universe@468 | 324 | if (loc_prev >= 0) ll_prev(sorted[0]) = NULL; |
universe@509 | 325 | cx_for_n (i, length - 1) { |
universe@481 | 326 | cx_linked_list_link(sorted[i], sorted[i + 1], loc_prev, loc_next); |
universe@468 | 327 | } |
universe@468 | 328 | ll_next(sorted[length - 1]) = NULL; |
universe@468 | 329 | |
universe@468 | 330 | void *ret = sorted[0]; |
universe@468 | 331 | if (sorted != sbo) { |
universe@468 | 332 | free(sorted); |
universe@468 | 333 | } |
universe@468 | 334 | return ret; |
universe@468 | 335 | } |
universe@468 | 336 | |
universe@628 | 337 | void cx_linked_list_sort( // NOLINT(misc-no-recursion) - purposely recursive function |
universe@481 | 338 | void **begin, |
universe@481 | 339 | void **end, |
universe@481 | 340 | ptrdiff_t loc_prev, |
universe@481 | 341 | ptrdiff_t loc_next, |
universe@481 | 342 | ptrdiff_t loc_data, |
universe@481 | 343 | CxListComparator cmp_func |
universe@481 | 344 | ) { |
universe@468 | 345 | assert(begin != NULL); |
universe@473 | 346 | assert(loc_next >= 0); |
universe@473 | 347 | assert(loc_data >= 0); |
universe@473 | 348 | assert(cmp_func); |
universe@468 | 349 | |
universe@468 | 350 | void *lc, *ls, *le, *re; |
universe@468 | 351 | |
universe@468 | 352 | // set start node |
universe@468 | 353 | ls = *begin; |
universe@468 | 354 | |
universe@468 | 355 | // check how many elements are already sorted |
universe@468 | 356 | lc = ls; |
universe@468 | 357 | size_t ln = 1; |
universe@468 | 358 | while (ll_next(lc) != NULL && cmp_func(ll_data(ll_next(lc)), ll_data(lc)) > 0) { |
universe@468 | 359 | lc = ll_next(lc); |
universe@468 | 360 | ln++; |
universe@468 | 361 | } |
universe@468 | 362 | le = ll_next(lc); |
universe@468 | 363 | |
universe@468 | 364 | // if first unsorted node is NULL, the list is already completely sorted |
universe@468 | 365 | if (le != NULL) { |
universe@468 | 366 | void *rc; |
universe@468 | 367 | size_t rn = 1; |
universe@468 | 368 | rc = le; |
universe@468 | 369 | // skip already sorted elements |
universe@468 | 370 | while (ll_next(rc) != NULL && cmp_func(ll_data(ll_next(rc)), ll_data(rc)) > 0) { |
universe@468 | 371 | rc = ll_next(rc); |
universe@468 | 372 | rn++; |
universe@468 | 373 | } |
universe@468 | 374 | re = ll_next(rc); |
universe@468 | 375 | |
universe@468 | 376 | // {ls,...,le->prev} and {rs,...,re->prev} are sorted - merge them |
universe@639 | 377 | void *sorted = cx_linked_list_sort_merge(loc_prev, loc_next, loc_data, |
universe@468 | 378 | ln + rn, ls, le, re, cmp_func); |
universe@468 | 379 | |
universe@468 | 380 | // Something left? Sort it! |
universe@468 | 381 | size_t remainder_length = cx_linked_list_size(re, loc_next); |
universe@468 | 382 | if (remainder_length > 0) { |
universe@468 | 383 | void *remainder = re; |
universe@639 | 384 | cx_linked_list_sort(&remainder, NULL, loc_prev, loc_next, loc_data, cmp_func); |
universe@468 | 385 | |
universe@468 | 386 | // merge sorted list with (also sorted) remainder |
universe@639 | 387 | *begin = cx_linked_list_sort_merge(loc_prev, loc_next, loc_data, |
universe@468 | 388 | ln + rn + remainder_length, |
universe@468 | 389 | sorted, remainder, NULL, cmp_func); |
universe@468 | 390 | } else { |
universe@468 | 391 | // no remainder - we've got our sorted list |
universe@468 | 392 | *begin = sorted; |
universe@468 | 393 | } |
universe@468 | 394 | if (end) *end = cx_linked_list_last(sorted, loc_next); |
universe@468 | 395 | } |
universe@468 | 396 | } |
universe@468 | 397 | |
universe@486 | 398 | int cx_linked_list_compare( |
universe@489 | 399 | void const *begin_left, |
universe@489 | 400 | void const *begin_right, |
universe@486 | 401 | ptrdiff_t loc_advance, |
universe@486 | 402 | ptrdiff_t loc_data, |
universe@486 | 403 | CxListComparator cmp_func |
universe@486 | 404 | ) { |
universe@489 | 405 | void const *left = begin_left, *right = begin_right; |
universe@486 | 406 | |
universe@486 | 407 | while (left != NULL && right != NULL) { |
universe@639 | 408 | void const *left_data = ll_data(left); |
universe@639 | 409 | void const *right_data = ll_data(right); |
universe@552 | 410 | int result = cmp_func(left_data, right_data); |
universe@486 | 411 | if (result != 0) return result; |
universe@486 | 412 | left = ll_advance(left); |
universe@486 | 413 | right = ll_advance(right); |
universe@486 | 414 | } |
universe@486 | 415 | |
universe@486 | 416 | if (left != NULL) { return 1; } |
universe@486 | 417 | else if (right != NULL) { return -1; } |
universe@486 | 418 | else { return 0; } |
universe@486 | 419 | } |
universe@486 | 420 | |
universe@481 | 421 | void cx_linked_list_reverse( |
universe@481 | 422 | void **begin, |
universe@481 | 423 | void **end, |
universe@481 | 424 | ptrdiff_t loc_prev, |
universe@481 | 425 | ptrdiff_t loc_next |
universe@481 | 426 | ) { |
universe@473 | 427 | assert(begin != NULL); |
universe@473 | 428 | assert(loc_next >= 0); |
universe@473 | 429 | |
universe@473 | 430 | // swap all links |
universe@473 | 431 | void *prev = NULL; |
universe@473 | 432 | void *cur = *begin; |
universe@473 | 433 | while (cur != NULL) { |
universe@480 | 434 | void *next = ll_next(cur); |
universe@473 | 435 | |
universe@480 | 436 | ll_next(cur) = prev; |
universe@473 | 437 | if (loc_prev >= 0) { |
universe@480 | 438 | ll_prev(cur) = next; |
universe@473 | 439 | } |
universe@473 | 440 | |
universe@473 | 441 | prev = cur; |
universe@473 | 442 | cur = next; |
universe@473 | 443 | } |
universe@473 | 444 | |
universe@473 | 445 | // update begin and end |
universe@473 | 446 | if (end != NULL) { |
universe@473 | 447 | *end = *begin; |
universe@473 | 448 | } |
universe@473 | 449 | *begin = prev; |
universe@473 | 450 | } |
universe@473 | 451 | |
universe@628 | 452 | // HIGH LEVEL LINKED LIST IMPLEMENTATION |
universe@398 | 453 | |
universe@447 | 454 | typedef struct cx_linked_list_node cx_linked_list_node; |
universe@447 | 455 | struct cx_linked_list_node { |
universe@447 | 456 | cx_linked_list_node *prev; |
universe@447 | 457 | cx_linked_list_node *next; |
universe@403 | 458 | char payload[]; |
universe@447 | 459 | }; |
universe@402 | 460 | |
universe@446 | 461 | #define CX_LL_LOC_PREV offsetof(cx_linked_list_node, prev) |
universe@446 | 462 | #define CX_LL_LOC_NEXT offsetof(cx_linked_list_node, next) |
universe@469 | 463 | #define CX_LL_LOC_DATA offsetof(cx_linked_list_node, payload) |
universe@439 | 464 | |
universe@398 | 465 | typedef struct { |
universe@500 | 466 | struct cx_list_s base; |
universe@446 | 467 | cx_linked_list_node *begin; |
universe@446 | 468 | cx_linked_list_node *end; |
universe@398 | 469 | } cx_linked_list; |
universe@398 | 470 | |
universe@481 | 471 | static cx_linked_list_node *cx_ll_node_at( |
universe@489 | 472 | cx_linked_list const *list, |
universe@481 | 473 | size_t index |
universe@481 | 474 | ) { |
universe@447 | 475 | if (index >= list->base.size) { |
universe@447 | 476 | return NULL; |
universe@447 | 477 | } else if (index > list->base.size / 2) { |
universe@468 | 478 | return cx_linked_list_at(list->end, list->base.size - 1, CX_LL_LOC_PREV, index); |
universe@447 | 479 | } else { |
universe@447 | 480 | return cx_linked_list_at(list->begin, 0, CX_LL_LOC_NEXT, index); |
universe@447 | 481 | } |
universe@447 | 482 | } |
universe@447 | 483 | |
universe@499 | 484 | static int cx_ll_insert_at( |
universe@500 | 485 | struct cx_list_s *list, |
universe@499 | 486 | cx_linked_list_node *node, |
universe@489 | 487 | void const *elem |
universe@481 | 488 | ) { |
universe@448 | 489 | |
universe@481 | 490 | // create the new new_node |
universe@481 | 491 | cx_linked_list_node *new_node = cxMalloc(list->allocator, |
universe@481 | 492 | sizeof(cx_linked_list_node) + list->itemsize); |
universe@448 | 493 | |
universe@448 | 494 | // sortir if failed |
universe@481 | 495 | if (new_node == NULL) return 1; |
universe@448 | 496 | |
universe@481 | 497 | // initialize new new_node |
universe@481 | 498 | new_node->prev = new_node->next = NULL; |
universe@481 | 499 | memcpy(new_node->payload, elem, list->itemsize); |
universe@448 | 500 | |
universe@481 | 501 | // insert |
universe@499 | 502 | cx_linked_list *ll = (cx_linked_list *) list; |
universe@481 | 503 | cx_linked_list_insert_chain( |
universe@481 | 504 | (void **) &ll->begin, (void **) &ll->end, |
universe@481 | 505 | CX_LL_LOC_PREV, CX_LL_LOC_NEXT, |
universe@481 | 506 | node, new_node, new_node |
universe@481 | 507 | ); |
universe@448 | 508 | |
universe@448 | 509 | // increase the size and return |
universe@448 | 510 | list->size++; |
universe@448 | 511 | return 0; |
universe@448 | 512 | } |
universe@448 | 513 | |
universe@638 | 514 | static size_t cx_ll_insert_array( |
universe@638 | 515 | struct cx_list_s *list, |
universe@638 | 516 | size_t index, |
universe@638 | 517 | void const *array, |
universe@638 | 518 | size_t n |
universe@638 | 519 | ) { |
universe@638 | 520 | // out-of bounds and corner case check |
universe@638 | 521 | if (index > list->size || n == 0) return 0; |
universe@638 | 522 | |
universe@638 | 523 | // find position efficiently |
universe@638 | 524 | cx_linked_list_node *node = index == 0 ? NULL : cx_ll_node_at((cx_linked_list *) list, index - 1); |
universe@638 | 525 | |
universe@638 | 526 | // perform first insert |
universe@638 | 527 | if (0 != cx_ll_insert_at(list, node, array)) { |
universe@638 | 528 | return 1; |
universe@638 | 529 | } |
universe@638 | 530 | |
universe@638 | 531 | // is there more? |
universe@638 | 532 | if (n == 1) return 1; |
universe@638 | 533 | |
universe@638 | 534 | // we now know exactly where we are |
universe@638 | 535 | node = node == NULL ? ((cx_linked_list *) list)->begin : node->next; |
universe@638 | 536 | |
universe@638 | 537 | // we can add the remaining nodes and immedately advance to the inserted node |
universe@638 | 538 | char const *source = array; |
universe@638 | 539 | for (size_t i = 1; i < n; i++) { |
universe@638 | 540 | source += list->itemsize; |
universe@638 | 541 | if (0 != cx_ll_insert_at(list, node, source)) { |
universe@638 | 542 | return i; |
universe@638 | 543 | } |
universe@638 | 544 | node = node->next; |
universe@638 | 545 | } |
universe@638 | 546 | return n; |
universe@638 | 547 | } |
universe@638 | 548 | |
universe@481 | 549 | static int cx_ll_remove( |
universe@500 | 550 | struct cx_list_s *list, |
universe@481 | 551 | size_t index |
universe@481 | 552 | ) { |
universe@447 | 553 | cx_linked_list *ll = (cx_linked_list *) list; |
universe@447 | 554 | cx_linked_list_node *node = cx_ll_node_at(ll, index); |
universe@447 | 555 | |
universe@447 | 556 | // out-of-bounds check |
universe@447 | 557 | if (node == NULL) return 1; |
universe@447 | 558 | |
universe@476 | 559 | // remove |
universe@476 | 560 | cx_linked_list_remove((void **) &ll->begin, (void **) &ll->end, |
universe@476 | 561 | CX_LL_LOC_PREV, CX_LL_LOC_NEXT, node); |
universe@447 | 562 | |
universe@447 | 563 | // adjust size |
universe@447 | 564 | list->size--; |
universe@447 | 565 | |
universe@447 | 566 | // free and return |
universe@447 | 567 | cxFree(list->allocator, node); |
universe@447 | 568 | |
universe@438 | 569 | return 0; |
universe@398 | 570 | } |
universe@398 | 571 | |
universe@481 | 572 | static void *cx_ll_at( |
universe@500 | 573 | struct cx_list_s const *list, |
universe@481 | 574 | size_t index |
universe@481 | 575 | ) { |
universe@439 | 576 | cx_linked_list *ll = (cx_linked_list *) list; |
universe@447 | 577 | cx_linked_list_node *node = cx_ll_node_at(ll, index); |
universe@466 | 578 | return node == NULL ? NULL : node->payload; |
universe@466 | 579 | } |
universe@466 | 580 | |
universe@481 | 581 | static size_t cx_ll_find( |
universe@500 | 582 | struct cx_list_s const *list, |
universe@489 | 583 | void const *elem |
universe@481 | 584 | ) { |
universe@480 | 585 | return cx_linked_list_find(((cx_linked_list *) list)->begin, |
universe@480 | 586 | CX_LL_LOC_NEXT, CX_LL_LOC_DATA, |
universe@639 | 587 | list->cmpfunc, elem); |
universe@466 | 588 | } |
universe@466 | 589 | |
universe@500 | 590 | static void cx_ll_sort(struct cx_list_s *list) { |
universe@469 | 591 | cx_linked_list *ll = (cx_linked_list *) list; |
universe@469 | 592 | cx_linked_list_sort((void **) &ll->begin, (void **) &ll->end, |
universe@469 | 593 | CX_LL_LOC_PREV, CX_LL_LOC_NEXT, CX_LL_LOC_DATA, |
universe@639 | 594 | list->cmpfunc); |
universe@469 | 595 | } |
universe@469 | 596 | |
universe@500 | 597 | static void cx_ll_reverse(struct cx_list_s *list) { |
universe@490 | 598 | cx_linked_list *ll = (cx_linked_list *) list; |
universe@521 | 599 | cx_linked_list_reverse((void **) &ll->begin, (void **) &ll->end, CX_LL_LOC_PREV, CX_LL_LOC_NEXT); |
universe@490 | 600 | } |
universe@490 | 601 | |
universe@488 | 602 | static int cx_ll_compare( |
universe@500 | 603 | struct cx_list_s const *list, |
universe@500 | 604 | struct cx_list_s const *other |
universe@488 | 605 | ) { |
universe@488 | 606 | cx_linked_list *left = (cx_linked_list *) list; |
universe@488 | 607 | cx_linked_list *right = (cx_linked_list *) other; |
universe@488 | 608 | return cx_linked_list_compare(left->begin, right->begin, |
universe@488 | 609 | CX_LL_LOC_NEXT, CX_LL_LOC_DATA, |
universe@639 | 610 | list->cmpfunc); |
universe@488 | 611 | } |
universe@488 | 612 | |
universe@630 | 613 | static bool cx_ll_iter_valid(void const *it) { |
universe@630 | 614 | struct cx_iterator_s const *iter = it; |
universe@495 | 615 | return iter->elem_handle != NULL; |
universe@494 | 616 | } |
universe@494 | 617 | |
universe@630 | 618 | static void cx_ll_iter_next(void *it) { |
universe@630 | 619 | struct cx_iterator_base_s *itbase = it; |
universe@630 | 620 | if (itbase->remove) { |
universe@630 | 621 | itbase->remove = false; |
universe@630 | 622 | struct cx_mut_iterator_s *iter = it; |
universe@495 | 623 | cx_linked_list *ll = iter->src_handle; |
universe@495 | 624 | cx_linked_list_node *node = iter->elem_handle; |
universe@495 | 625 | iter->elem_handle = node->next; |
universe@495 | 626 | cx_linked_list_remove((void **) &ll->begin, (void **) &ll->end, |
universe@495 | 627 | CX_LL_LOC_PREV, CX_LL_LOC_NEXT, node); |
universe@495 | 628 | ll->base.size--; |
universe@495 | 629 | cxFree(ll->base.allocator, node); |
universe@495 | 630 | } else { |
universe@630 | 631 | struct cx_iterator_s *iter = it; |
universe@495 | 632 | iter->index++; |
universe@495 | 633 | cx_linked_list_node *node = iter->elem_handle; |
universe@495 | 634 | iter->elem_handle = node->next; |
universe@495 | 635 | } |
universe@494 | 636 | } |
universe@494 | 637 | |
universe@630 | 638 | static void *cx_ll_iter_current(void const *it) { |
universe@630 | 639 | struct cx_iterator_s const *iter = it; |
universe@495 | 640 | cx_linked_list_node *node = iter->elem_handle; |
universe@494 | 641 | return node->payload; |
universe@494 | 642 | } |
universe@494 | 643 | |
universe@630 | 644 | static bool cx_ll_iter_flag_rm(void *it) { |
universe@630 | 645 | struct cx_iterator_base_s *iter = it; |
universe@630 | 646 | if (iter->mutating) { |
universe@630 | 647 | iter->remove = true; |
universe@630 | 648 | return true; |
universe@630 | 649 | } else { |
universe@630 | 650 | return false; |
universe@630 | 651 | } |
universe@630 | 652 | } |
universe@630 | 653 | |
universe@494 | 654 | static CxIterator cx_ll_iterator( |
universe@630 | 655 | struct cx_list_s const *list, |
universe@494 | 656 | size_t index |
universe@494 | 657 | ) { |
universe@494 | 658 | CxIterator iter; |
universe@494 | 659 | iter.index = index; |
universe@495 | 660 | iter.src_handle = list; |
universe@495 | 661 | iter.elem_handle = cx_ll_node_at((cx_linked_list const *) list, index); |
universe@630 | 662 | iter.base.valid = cx_ll_iter_valid; |
universe@630 | 663 | iter.base.current = cx_ll_iter_current; |
universe@630 | 664 | iter.base.next = cx_ll_iter_next; |
universe@630 | 665 | iter.base.flag_removal = cx_ll_iter_flag_rm; |
universe@630 | 666 | iter.base.mutating = false; |
universe@630 | 667 | iter.base.remove = false; |
universe@494 | 668 | return iter; |
universe@494 | 669 | } |
universe@494 | 670 | |
universe@499 | 671 | static int cx_ll_insert_iter( |
universe@630 | 672 | CxMutIterator *iter, |
universe@499 | 673 | void const *elem, |
universe@499 | 674 | int prepend |
universe@499 | 675 | ) { |
universe@500 | 676 | struct cx_list_s *list = iter->src_handle; |
universe@499 | 677 | cx_linked_list_node *node = iter->elem_handle; |
universe@499 | 678 | if (node != NULL) { |
universe@499 | 679 | assert(prepend >= 0 && prepend <= 1); |
universe@499 | 680 | cx_linked_list_node *choice[2] = {node, node->prev}; |
universe@499 | 681 | int result = cx_ll_insert_at(list, choice[prepend], elem); |
universe@499 | 682 | iter->index += prepend * (0 == result); |
universe@499 | 683 | return result; |
universe@499 | 684 | } else { |
universe@640 | 685 | int result = cx_ll_insert_array(list, list->size, elem, 1) != 1; |
universe@499 | 686 | iter->index = list->size; |
universe@499 | 687 | return result; |
universe@499 | 688 | } |
universe@499 | 689 | } |
universe@499 | 690 | |
universe@524 | 691 | static void cx_ll_destructor(CxList *list) { |
universe@524 | 692 | cx_linked_list *ll = (cx_linked_list *) list; |
universe@524 | 693 | |
universe@524 | 694 | cx_linked_list_node *node = ll->begin; |
universe@524 | 695 | while (node) { |
universe@524 | 696 | void *next = node->next; |
universe@524 | 697 | cxFree(list->allocator, node); |
universe@524 | 698 | node = next; |
universe@524 | 699 | } |
universe@524 | 700 | // do not free the list pointer, this is just a destructor! |
universe@524 | 701 | } |
universe@524 | 702 | |
universe@451 | 703 | static cx_list_class cx_linked_list_class = { |
universe@524 | 704 | cx_ll_destructor, |
universe@638 | 705 | cx_ll_insert_array, |
universe@499 | 706 | cx_ll_insert_iter, |
universe@398 | 707 | cx_ll_remove, |
universe@439 | 708 | cx_ll_at, |
universe@404 | 709 | cx_ll_find, |
universe@488 | 710 | cx_ll_sort, |
universe@490 | 711 | cx_ll_compare, |
universe@494 | 712 | cx_ll_reverse, |
universe@630 | 713 | cx_ll_iterator, |
universe@398 | 714 | }; |
universe@398 | 715 | |
universe@500 | 716 | CxList *cxLinkedListCreate( |
universe@508 | 717 | CxAllocator const *allocator, |
universe@481 | 718 | CxListComparator comparator, |
universe@481 | 719 | size_t item_size |
universe@481 | 720 | ) { |
universe@503 | 721 | cx_linked_list *list = cxCalloc(allocator, 1, sizeof(cx_linked_list)); |
universe@528 | 722 | if (list == NULL) return NULL; |
universe@398 | 723 | |
universe@435 | 724 | list->base.cl = &cx_linked_list_class; |
universe@435 | 725 | list->base.allocator = allocator; |
universe@435 | 726 | list->base.cmpfunc = comparator; |
universe@435 | 727 | list->base.itemsize = item_size; |
universe@435 | 728 | list->base.capacity = SIZE_MAX; |
universe@406 | 729 | |
universe@500 | 730 | return (CxList *) list; |
universe@406 | 731 | } |