1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
|
#include "prism/util/pm_list.h"
/**
* Returns true if the given list is empty.
*/
PRISM_EXPORTED_FUNCTION bool
pm_list_empty_p(pm_list_t *list) {
return list->head == NULL;
}
/**
* Returns the size of the list.
*/
PRISM_EXPORTED_FUNCTION size_t
pm_list_size(pm_list_t *list) {
return list->size;
}
/**
* Append a node to the given list.
*/
void
pm_list_append(pm_list_t *list, pm_list_node_t *node) {
if (list->head == NULL) {
list->head = node;
} else {
list->tail->next = node;
}
list->tail = node;
list->size++;
}
/**
* Deallocate the internal state of the given list.
*/
PRISM_EXPORTED_FUNCTION void
pm_list_free(pm_list_t *list) {
pm_list_node_t *node = list->head;
pm_list_node_t *next;
while (node != NULL) {
next = node->next;
free(node);
node = next;
}
list->size = 0;
}
|
