blob: 6a0085f1b2c7c79ce8016c89d0571e777ac58190 (
plain)
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
|
/*
* src/list.c
* (c) 2021 Jonas Gunz <himself@jonasgunz.de>
* License: MIT
*/
#include "list.h"
int list_add( list_element_t** _root, void* _data ) {
list_element_t** iter = _root;
list_element_t* new_element = malloc( sizeof(list_element_t) );
new_element->data = _data;
new_element->next = NULL;
if( !new_element )
return 1;
while(*iter)
iter = & (*iter)->next;
*iter = new_element;
return 0;
}
int list_sort ( list_element_t** _root ) {
return -1;
}
int list_length ( list_element_t* _root ) {
return -1;
}
void* list_pop_front ( list_element_t** _root ) {
list_element_t* old = NULL;
void* old_data = NULL;
if( !*_root )
return NULL;
old = *_root;
old_data = old->data;
*_root = (*_root)->next;
free ( old );
return old_data;
}
|