|
| 1 | +#include "PR/ultratypes.h" |
| 2 | +#include "sys/linked_list.h" |
| 3 | + |
| 4 | +LinkedList *linked_list_init(LinkedList *list, s16 nextFieldOffset) { |
| 5 | + list->head = NULL; |
| 6 | + list->nextFieldOffset = nextFieldOffset; |
| 7 | + |
| 8 | + return list; |
| 9 | +} |
| 10 | + |
| 11 | +void linked_list_prepend(LinkedList *list, void *node) { |
| 12 | + void *prevHead; |
| 13 | + |
| 14 | + prevHead = list->head; |
| 15 | + list->head = node; |
| 16 | + |
| 17 | + *LINKED_LIST_NEXT_FIELD(list, node) = prevHead; |
| 18 | + |
| 19 | + list->count += 1; |
| 20 | +} |
| 21 | + |
| 22 | +void linked_list_append(LinkedList *list, void *node) { |
| 23 | + void *next; |
| 24 | + void *last; |
| 25 | + |
| 26 | + if (list->head == NULL) { |
| 27 | + list->head = node; |
| 28 | + } else { |
| 29 | + next = list->head; |
| 30 | + last = next; |
| 31 | + |
| 32 | + while (next != NULL) { |
| 33 | + last = next; |
| 34 | + next = *LINKED_LIST_NEXT_FIELD2(list, last); |
| 35 | + } |
| 36 | + |
| 37 | + *LINKED_LIST_NEXT_FIELD(list, last) = node; |
| 38 | + } |
| 39 | + |
| 40 | + *LINKED_LIST_NEXT_FIELD(list, node) = NULL; |
| 41 | + |
| 42 | + list->count += 1; |
| 43 | +} |
| 44 | + |
| 45 | +void linked_list_insert(LinkedList *list, void *after, void *node) { |
| 46 | + void *next; |
| 47 | + |
| 48 | + if (list->head == NULL) { |
| 49 | + list->head = node; |
| 50 | + } else { |
| 51 | + if (after == NULL) { |
| 52 | + // Prepend if after is null |
| 53 | + next = list->head; |
| 54 | + list->head = node; |
| 55 | + } else { |
| 56 | + // Insert between after and its next node |
| 57 | + next = *LINKED_LIST_NEXT_FIELD2(list, after); |
| 58 | + *LINKED_LIST_NEXT_FIELD(list, after) = node; |
| 59 | + } |
| 60 | + |
| 61 | + *LINKED_LIST_NEXT_FIELD(list, node) = next; |
| 62 | + } |
| 63 | + |
| 64 | + list->count += 1; |
| 65 | +} |
| 66 | + |
| 67 | +void linked_list_remove(LinkedList *list, void *node) { |
| 68 | + void *before; |
| 69 | + void *curr; |
| 70 | + |
| 71 | + if (node == list->head) { |
| 72 | + list->head = *LINKED_LIST_NEXT_FIELD(list, list->head); |
| 73 | + list->count -= 1; |
| 74 | + return; |
| 75 | + } |
| 76 | + |
| 77 | + // Find the node before the one we want to remove |
| 78 | + curr = list->head; |
| 79 | + before = curr; |
| 80 | + |
| 81 | + while (curr != NULL && curr != node) { |
| 82 | + before = curr; |
| 83 | + curr = *LINKED_LIST_NEXT_FIELD2(list, curr); |
| 84 | + } |
| 85 | + |
| 86 | + if (curr != NULL) { |
| 87 | + void *next = *LINKED_LIST_NEXT_FIELD2(list, curr); |
| 88 | + |
| 89 | + if (curr == list->head) { |
| 90 | + list->head = next; |
| 91 | + } else { |
| 92 | + *LINKED_LIST_NEXT_FIELD(list, before) = next; |
| 93 | + } |
| 94 | + |
| 95 | + list->count -= 1; |
| 96 | + } |
| 97 | +} |
| 98 | + |
| 99 | +void linked_list_remove_fast(LinkedList *list, void *before, void *node) { |
| 100 | + if (node != NULL) { |
| 101 | + void *next = *LINKED_LIST_NEXT_FIELD2(list, node); |
| 102 | + |
| 103 | + if (node == list->head) { |
| 104 | + list->head = next; |
| 105 | + } else { |
| 106 | + *LINKED_LIST_NEXT_FIELD(list, before) = next; |
| 107 | + } |
| 108 | + |
| 109 | + list->count -= 1; |
| 110 | + } |
| 111 | +} |
0 commit comments