-
Notifications
You must be signed in to change notification settings - Fork 0
/
list_node.c
66 lines (56 loc) · 1.27 KB
/
list_node.c
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
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
#include "list_node.h"
/* Node of a generic doubly linked list.
* data : pointer to the data
* next, prev : pointers to adjacent nodes
*/
struct list_node
{
void *data;
struct list_node *next;
struct list_node *prev;
};
/* Create and initialize node with payload 'data'*/
void list_node_create(list_node_t **node, void *data)
{
if (((*node) = (list_node_t*)malloc(sizeof(list_node_t))) == NULL)
{
fprintf(stderr, "Failed to allocate list node\n");
exit(EXIT_FAILURE);
};
(*node)->data = data;
(*node)->next = NULL;
(*node)->prev = NULL;
}
/* Remove node after freeing his element using 'free_fn' function */
void list_node_delete(list_node_t **node, free_func free_fn)
{
if (free_fn != NULL) free_fn((*node)->data);
(*node)->data = NULL;
free(*node);
*node = NULL;
}
/* Accessors and mutators */
void * list_node_get_data(list_node_t *node)
{
return node->data;
}
void list_node_set_data(list_node_t *node, void *data)
{
node->data = data;
}
list_node_t * list_node_get_next(list_node_t *node)
{
return node->next;
}
void list_node_set_next(list_node_t *node, list_node_t *next)
{
node->next = next;
}
list_node_t * list_node_get_prev(list_node_t *node)
{
return node->prev;
}
void list_node_set_prev(list_node_t *node, list_node_t *prev)
{
node->prev = prev;
}