Thu, 23 Dec 2021 15:20:50 +0100
add several new linked list functions
* cx_linked_list_insert()
* cx_linked_list_insert_chain()
* cx_linked_list_link()
* cx_linked_list_unlink()
Also uses the most general function wherever possible.
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@401 | 30 | #include <stdint.h> |
universe@401 | 31 | #include <string.h> |
universe@453 | 32 | #include <assert.h> |
universe@398 | 33 | |
universe@398 | 34 | /* LOW LEVEL LINKED LIST FUNCTIONS */ |
universe@398 | 35 | |
universe@468 | 36 | #define CX_LL_PTR(cur, off) (*(void**)(((char*)cur)+off)) |
universe@480 | 37 | #define ll_prev(node) CX_LL_PTR(node, loc_prev) |
universe@480 | 38 | #define ll_next(node) CX_LL_PTR(node, loc_next) |
universe@480 | 39 | #define ll_advance(node) CX_LL_PTR(node, loc_advance) |
universe@480 | 40 | #define ll_data(node) (follow_ptr?CX_LL_PTR(node, loc_data):(((char*)node)+loc_data)) |
universe@398 | 41 | |
universe@481 | 42 | void *cx_linked_list_at( |
universe@481 | 43 | void *start, |
universe@481 | 44 | size_t start_index, |
universe@481 | 45 | ptrdiff_t loc_advance, |
universe@481 | 46 | size_t index |
universe@481 | 47 | ) { |
universe@473 | 48 | assert(start != NULL); |
universe@473 | 49 | assert(loc_advance >= 0); |
universe@438 | 50 | size_t i = start_index; |
universe@446 | 51 | void *cur = start; |
universe@438 | 52 | while (i != index && cur != NULL) { |
universe@480 | 53 | cur = ll_advance(cur); |
universe@438 | 54 | i < index ? i++ : i--; |
universe@438 | 55 | } |
universe@438 | 56 | return cur; |
universe@438 | 57 | } |
universe@438 | 58 | |
universe@481 | 59 | size_t cx_linked_list_find( |
universe@481 | 60 | void *start, |
universe@481 | 61 | ptrdiff_t loc_advance, |
universe@481 | 62 | ptrdiff_t loc_data, |
universe@481 | 63 | int follow_ptr, |
universe@481 | 64 | CxListComparator cmp_func, |
universe@481 | 65 | void *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@480 | 72 | void *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@481 | 86 | void *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@481 | 93 | void *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@475 | 99 | void *cur = node; |
universe@456 | 100 | void *last; |
universe@456 | 101 | do { |
universe@456 | 102 | last = cur; |
universe@480 | 103 | } while ((cur = ll_next(cur)) != NULL); |
universe@398 | 104 | |
universe@456 | 105 | return last; |
universe@398 | 106 | } |
universe@398 | 107 | |
universe@481 | 108 | void *cx_linked_list_prev( |
universe@481 | 109 | void *begin, |
universe@481 | 110 | ptrdiff_t loc_next, |
universe@481 | 111 | void *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@473 | 117 | void *cur = begin; |
universe@473 | 118 | void *next; |
universe@473 | 119 | while (1) { |
universe@480 | 120 | next = ll_next(cur); |
universe@473 | 121 | if (next == node) return 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@481 | 271 | void *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 | int follow_ptr, |
universe@481 | 288 | size_t length, |
universe@481 | 289 | void *ls, |
universe@481 | 290 | void *le, |
universe@481 | 291 | void *re, |
universe@481 | 292 | CxListComparator cmp_func |
universe@481 | 293 | ) { |
universe@468 | 294 | const size_t sbo_len = 1024; |
universe@468 | 295 | void *sbo[sbo_len]; |
universe@468 | 296 | void **sorted = (length >= sbo_len) ? malloc(sizeof(void *) * length) : sbo; |
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@468 | 325 | for (size_t i = 0; i < length - 1; i++) { |
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@476 | 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 | int follow_ptr, |
universe@481 | 344 | CxListComparator cmp_func |
universe@481 | 345 | ) { |
universe@468 | 346 | assert(begin != NULL); |
universe@473 | 347 | assert(loc_next >= 0); |
universe@473 | 348 | assert(loc_data >= 0); |
universe@473 | 349 | assert(cmp_func); |
universe@468 | 350 | |
universe@468 | 351 | void *lc, *ls, *le, *re; |
universe@468 | 352 | |
universe@468 | 353 | // set start node |
universe@468 | 354 | ls = *begin; |
universe@468 | 355 | |
universe@468 | 356 | // check how many elements are already sorted |
universe@468 | 357 | lc = ls; |
universe@468 | 358 | size_t ln = 1; |
universe@468 | 359 | while (ll_next(lc) != NULL && cmp_func(ll_data(ll_next(lc)), ll_data(lc)) > 0) { |
universe@468 | 360 | lc = ll_next(lc); |
universe@468 | 361 | ln++; |
universe@468 | 362 | } |
universe@468 | 363 | le = ll_next(lc); |
universe@468 | 364 | |
universe@468 | 365 | // if first unsorted node is NULL, the list is already completely sorted |
universe@468 | 366 | if (le != NULL) { |
universe@468 | 367 | void *rc; |
universe@468 | 368 | size_t rn = 1; |
universe@468 | 369 | rc = le; |
universe@468 | 370 | // skip already sorted elements |
universe@468 | 371 | while (ll_next(rc) != NULL && cmp_func(ll_data(ll_next(rc)), ll_data(rc)) > 0) { |
universe@468 | 372 | rc = ll_next(rc); |
universe@468 | 373 | rn++; |
universe@468 | 374 | } |
universe@468 | 375 | re = ll_next(rc); |
universe@468 | 376 | |
universe@468 | 377 | // {ls,...,le->prev} and {rs,...,re->prev} are sorted - merge them |
universe@468 | 378 | void *sorted = cx_linked_list_sort_merge(loc_prev, loc_next, loc_data, follow_ptr, |
universe@468 | 379 | ln + rn, ls, le, re, cmp_func); |
universe@468 | 380 | |
universe@468 | 381 | // Something left? Sort it! |
universe@468 | 382 | size_t remainder_length = cx_linked_list_size(re, loc_next); |
universe@468 | 383 | if (remainder_length > 0) { |
universe@468 | 384 | void *remainder = re; |
universe@468 | 385 | cx_linked_list_sort(&remainder, NULL, loc_prev, loc_next, loc_data, follow_ptr, cmp_func); |
universe@468 | 386 | |
universe@468 | 387 | // merge sorted list with (also sorted) remainder |
universe@468 | 388 | *begin = cx_linked_list_sort_merge(loc_prev, loc_next, loc_data, follow_ptr, |
universe@468 | 389 | ln + rn + remainder_length, |
universe@468 | 390 | sorted, remainder, NULL, cmp_func); |
universe@468 | 391 | } else { |
universe@468 | 392 | // no remainder - we've got our sorted list |
universe@468 | 393 | *begin = sorted; |
universe@468 | 394 | } |
universe@468 | 395 | if (end) *end = cx_linked_list_last(sorted, loc_next); |
universe@468 | 396 | } |
universe@468 | 397 | } |
universe@468 | 398 | |
universe@481 | 399 | void cx_linked_list_reverse( |
universe@481 | 400 | void **begin, |
universe@481 | 401 | void **end, |
universe@481 | 402 | ptrdiff_t loc_prev, |
universe@481 | 403 | ptrdiff_t loc_next |
universe@481 | 404 | ) { |
universe@473 | 405 | assert(begin != NULL); |
universe@473 | 406 | assert(loc_next >= 0); |
universe@473 | 407 | |
universe@473 | 408 | // swap all links |
universe@473 | 409 | void *prev = NULL; |
universe@473 | 410 | void *cur = *begin; |
universe@473 | 411 | while (cur != NULL) { |
universe@480 | 412 | void *next = ll_next(cur); |
universe@473 | 413 | |
universe@480 | 414 | ll_next(cur) = prev; |
universe@473 | 415 | if (loc_prev >= 0) { |
universe@480 | 416 | ll_prev(cur) = next; |
universe@473 | 417 | } |
universe@473 | 418 | |
universe@473 | 419 | prev = cur; |
universe@473 | 420 | cur = next; |
universe@473 | 421 | } |
universe@473 | 422 | |
universe@473 | 423 | // update begin and end |
universe@473 | 424 | if (end != NULL) { |
universe@473 | 425 | *end = *begin; |
universe@473 | 426 | } |
universe@473 | 427 | *begin = prev; |
universe@473 | 428 | } |
universe@473 | 429 | |
universe@398 | 430 | /* HIGH LEVEL LINKED LIST IMPLEMENTATION */ |
universe@398 | 431 | |
universe@447 | 432 | typedef struct cx_linked_list_node cx_linked_list_node; |
universe@447 | 433 | struct cx_linked_list_node { |
universe@447 | 434 | cx_linked_list_node *prev; |
universe@447 | 435 | cx_linked_list_node *next; |
universe@403 | 436 | char payload[]; |
universe@447 | 437 | }; |
universe@402 | 438 | |
universe@446 | 439 | #define CX_LL_LOC_PREV offsetof(cx_linked_list_node, prev) |
universe@446 | 440 | #define CX_LL_LOC_NEXT offsetof(cx_linked_list_node, next) |
universe@469 | 441 | #define CX_LL_LOC_DATA offsetof(cx_linked_list_node, payload) |
universe@439 | 442 | |
universe@398 | 443 | typedef struct { |
universe@435 | 444 | cx_list_s base; |
universe@446 | 445 | cx_linked_list_node *begin; |
universe@446 | 446 | cx_linked_list_node *end; |
universe@398 | 447 | } cx_linked_list; |
universe@398 | 448 | |
universe@481 | 449 | static cx_linked_list_node *cx_ll_node_at( |
universe@481 | 450 | cx_linked_list *list, |
universe@481 | 451 | size_t index |
universe@481 | 452 | ) { |
universe@447 | 453 | if (index >= list->base.size) { |
universe@447 | 454 | return NULL; |
universe@447 | 455 | } else if (index > list->base.size / 2) { |
universe@468 | 456 | return cx_linked_list_at(list->end, list->base.size - 1, CX_LL_LOC_PREV, index); |
universe@447 | 457 | } else { |
universe@447 | 458 | return cx_linked_list_at(list->begin, 0, CX_LL_LOC_NEXT, index); |
universe@447 | 459 | } |
universe@447 | 460 | } |
universe@447 | 461 | |
universe@481 | 462 | static int cx_ll_insert( |
universe@481 | 463 | cx_list_s *list, |
universe@481 | 464 | size_t index, |
universe@481 | 465 | void *elem |
universe@481 | 466 | ) { |
universe@448 | 467 | // out-of bounds check |
universe@448 | 468 | if (index > list->size) return 1; |
universe@448 | 469 | |
universe@448 | 470 | // cast a linked list pointer |
universe@437 | 471 | cx_linked_list *ll = (cx_linked_list *) list; |
universe@448 | 472 | |
universe@481 | 473 | // create the new new_node |
universe@481 | 474 | cx_linked_list_node *new_node = cxMalloc(list->allocator, |
universe@481 | 475 | sizeof(cx_linked_list_node) + list->itemsize); |
universe@448 | 476 | |
universe@448 | 477 | // sortir if failed |
universe@481 | 478 | if (new_node == NULL) return 1; |
universe@448 | 479 | |
universe@481 | 480 | // initialize new new_node |
universe@481 | 481 | new_node->prev = new_node->next = NULL; |
universe@481 | 482 | memcpy(new_node->payload, elem, list->itemsize); |
universe@448 | 483 | |
universe@481 | 484 | // find position efficiently |
universe@481 | 485 | cx_linked_list_node *node = index == 0 ? NULL : cx_ll_node_at(ll, index - 1); |
universe@448 | 486 | |
universe@481 | 487 | // insert |
universe@481 | 488 | cx_linked_list_insert_chain( |
universe@481 | 489 | (void **) &ll->begin, (void **) &ll->end, |
universe@481 | 490 | CX_LL_LOC_PREV, CX_LL_LOC_NEXT, |
universe@481 | 491 | node, new_node, new_node |
universe@481 | 492 | ); |
universe@448 | 493 | |
universe@448 | 494 | // increase the size and return |
universe@448 | 495 | list->size++; |
universe@448 | 496 | return 0; |
universe@448 | 497 | } |
universe@448 | 498 | |
universe@481 | 499 | static int cx_ll_add( |
universe@481 | 500 | cx_list_s *list, |
universe@481 | 501 | void *elem |
universe@481 | 502 | ) { |
universe@448 | 503 | return cx_ll_insert(list, list->size, elem); |
universe@398 | 504 | } |
universe@398 | 505 | |
universe@481 | 506 | static int cx_pll_insert( |
universe@481 | 507 | cx_list_s *list, |
universe@481 | 508 | size_t index, |
universe@481 | 509 | void *elem |
universe@481 | 510 | ) { |
universe@466 | 511 | return cx_ll_insert(list, index, &elem); |
universe@466 | 512 | } |
universe@466 | 513 | |
universe@481 | 514 | static int cx_pll_add( |
universe@481 | 515 | cx_list_s *list, |
universe@481 | 516 | void *elem |
universe@481 | 517 | ) { |
universe@466 | 518 | return cx_ll_insert(list, list->size, &elem); |
universe@466 | 519 | } |
universe@466 | 520 | |
universe@481 | 521 | static int cx_ll_remove( |
universe@481 | 522 | cx_list_s *list, |
universe@481 | 523 | size_t index |
universe@481 | 524 | ) { |
universe@447 | 525 | cx_linked_list *ll = (cx_linked_list *) list; |
universe@447 | 526 | cx_linked_list_node *node = cx_ll_node_at(ll, index); |
universe@447 | 527 | |
universe@447 | 528 | // out-of-bounds check |
universe@447 | 529 | if (node == NULL) return 1; |
universe@447 | 530 | |
universe@476 | 531 | // remove |
universe@476 | 532 | cx_linked_list_remove((void **) &ll->begin, (void **) &ll->end, |
universe@476 | 533 | CX_LL_LOC_PREV, CX_LL_LOC_NEXT, node); |
universe@447 | 534 | |
universe@447 | 535 | // adjust size |
universe@447 | 536 | list->size--; |
universe@447 | 537 | |
universe@447 | 538 | // free and return |
universe@447 | 539 | cxFree(list->allocator, node); |
universe@447 | 540 | |
universe@438 | 541 | return 0; |
universe@398 | 542 | } |
universe@398 | 543 | |
universe@481 | 544 | static void *cx_ll_at( |
universe@481 | 545 | cx_list_s *list, |
universe@481 | 546 | size_t index |
universe@481 | 547 | ) { |
universe@439 | 548 | cx_linked_list *ll = (cx_linked_list *) list; |
universe@447 | 549 | cx_linked_list_node *node = cx_ll_node_at(ll, index); |
universe@466 | 550 | return node == NULL ? NULL : node->payload; |
universe@466 | 551 | } |
universe@466 | 552 | |
universe@481 | 553 | static void *cx_pll_at( |
universe@481 | 554 | cx_list_s *list, |
universe@481 | 555 | size_t index |
universe@481 | 556 | ) { |
universe@466 | 557 | cx_linked_list *ll = (cx_linked_list *) list; |
universe@466 | 558 | cx_linked_list_node *node = cx_ll_node_at(ll, index); |
universe@468 | 559 | return node == NULL ? NULL : *(void **) node->payload; |
universe@439 | 560 | } |
universe@439 | 561 | |
universe@481 | 562 | static size_t cx_ll_find( |
universe@481 | 563 | cx_list_s *list, |
universe@481 | 564 | void *elem |
universe@481 | 565 | ) { |
universe@480 | 566 | return cx_linked_list_find(((cx_linked_list *) list)->begin, |
universe@480 | 567 | CX_LL_LOC_NEXT, CX_LL_LOC_DATA, |
universe@480 | 568 | 0, list->cmpfunc, elem); |
universe@398 | 569 | } |
universe@398 | 570 | |
universe@481 | 571 | static size_t cx_pll_find( |
universe@481 | 572 | cx_list_s *list, |
universe@481 | 573 | void *elem |
universe@481 | 574 | ) { |
universe@480 | 575 | return cx_linked_list_find(((cx_linked_list *) list)->begin, |
universe@480 | 576 | CX_LL_LOC_NEXT, CX_LL_LOC_DATA, |
universe@480 | 577 | 1, list->cmpfunc, elem); |
universe@466 | 578 | } |
universe@466 | 579 | |
universe@469 | 580 | static void cx_ll_sort(cx_list_s *list) { |
universe@469 | 581 | cx_linked_list *ll = (cx_linked_list *) list; |
universe@469 | 582 | cx_linked_list_sort((void **) &ll->begin, (void **) &ll->end, |
universe@469 | 583 | CX_LL_LOC_PREV, CX_LL_LOC_NEXT, CX_LL_LOC_DATA, |
universe@469 | 584 | 0, list->cmpfunc); |
universe@469 | 585 | } |
universe@469 | 586 | |
universe@469 | 587 | static void cx_pll_sort(cx_list_s *list) { |
universe@469 | 588 | cx_linked_list *ll = (cx_linked_list *) list; |
universe@469 | 589 | cx_linked_list_sort((void **) &ll->begin, (void **) &ll->end, |
universe@469 | 590 | CX_LL_LOC_PREV, CX_LL_LOC_NEXT, CX_LL_LOC_DATA, |
universe@469 | 591 | 1, list->cmpfunc); |
universe@469 | 592 | } |
universe@469 | 593 | |
universe@451 | 594 | static cx_list_class cx_linked_list_class = { |
universe@398 | 595 | cx_ll_add, |
universe@398 | 596 | cx_ll_insert, |
universe@398 | 597 | cx_ll_remove, |
universe@439 | 598 | cx_ll_at, |
universe@404 | 599 | cx_ll_find, |
universe@469 | 600 | cx_ll_sort |
universe@398 | 601 | }; |
universe@398 | 602 | |
universe@466 | 603 | static cx_list_class cx_pointer_linked_list_class = { |
universe@466 | 604 | cx_pll_add, |
universe@466 | 605 | cx_pll_insert, |
universe@466 | 606 | cx_ll_remove, |
universe@466 | 607 | cx_pll_at, |
universe@466 | 608 | cx_pll_find, |
universe@469 | 609 | cx_pll_sort |
universe@466 | 610 | }; |
universe@466 | 611 | |
universe@481 | 612 | CxList cxLinkedListCreate( |
universe@481 | 613 | CxAllocator allocator, |
universe@481 | 614 | CxListComparator comparator, |
universe@481 | 615 | size_t item_size |
universe@481 | 616 | ) { |
universe@446 | 617 | cx_linked_list *list = cxMalloc(allocator, sizeof(cx_linked_list)); |
universe@398 | 618 | if (list == NULL) |
universe@398 | 619 | return NULL; |
universe@398 | 620 | |
universe@435 | 621 | list->base.cl = &cx_linked_list_class; |
universe@435 | 622 | list->base.allocator = allocator; |
universe@435 | 623 | list->base.cmpfunc = comparator; |
universe@435 | 624 | list->base.itemsize = item_size; |
universe@435 | 625 | list->base.capacity = SIZE_MAX; |
universe@441 | 626 | list->base.size = 0; |
universe@406 | 627 | |
universe@435 | 628 | list->begin = NULL; |
universe@441 | 629 | list->end = NULL; |
universe@406 | 630 | |
universe@441 | 631 | return (CxList) list; |
universe@406 | 632 | } |
universe@406 | 633 | |
universe@481 | 634 | CxList cxPointerLinkedListCreate( |
universe@481 | 635 | CxAllocator allocator, |
universe@481 | 636 | CxListComparator comparator |
universe@481 | 637 | ) { |
universe@466 | 638 | cx_linked_list *list = cxMalloc(allocator, sizeof(cx_linked_list)); |
universe@466 | 639 | if (list == NULL) |
universe@466 | 640 | return NULL; |
universe@466 | 641 | |
universe@466 | 642 | list->base.cl = &cx_pointer_linked_list_class; |
universe@466 | 643 | list->base.allocator = allocator; |
universe@466 | 644 | list->base.cmpfunc = comparator; |
universe@468 | 645 | list->base.itemsize = sizeof(void *); |
universe@466 | 646 | list->base.capacity = SIZE_MAX; |
universe@466 | 647 | list->base.size = 0; |
universe@466 | 648 | |
universe@466 | 649 | list->begin = NULL; |
universe@466 | 650 | list->end = NULL; |
universe@466 | 651 | |
universe@466 | 652 | return (CxList) list; |
universe@466 | 653 | } |
universe@466 | 654 | |
universe@409 | 655 | void cxLinkedListDestroy(CxList list) { |
universe@446 | 656 | cx_linked_list *ll = (cx_linked_list *) list; |
universe@436 | 657 | |
universe@446 | 658 | cx_linked_list_node *node = ll->begin; |
universe@436 | 659 | while (node) { |
universe@446 | 660 | void *next = node->next; |
universe@436 | 661 | cxFree(list->allocator, node); |
universe@436 | 662 | node = next; |
universe@436 | 663 | } |
universe@436 | 664 | |
universe@435 | 665 | cxFree(list->allocator, list); |
universe@409 | 666 | } |