blob: b73280f68fd7332bff990119b7fda50b9e3d03c4 (
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
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
|
/*
* Copyright (C) 2023 Johnny Richard
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <https://www.gnu.org/licenses/>.
*/
#include "list.h"
#include <errno.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
static list_t *
list_alloc(void)
{
list_t *list = (list_t *)malloc(sizeof(list_t));
if (list == NULL) {
fprintf(stderr, "list_alloc: Out of memory %s\n", strerror(errno));
exit(EXIT_FAILURE);
}
return list;
}
list_t *
list_new(void)
{
return NULL;
}
void
list_prepend(list_t **list, void *data)
{
list_t *new_list = list_alloc();
new_list->data = data;
new_list->next = *list;
*list = new_list;
}
size_t
list_get_size(list_t *list)
{
size_t size = 0;
while (list != NULL) {
list = list->next;
size++;
}
return size;
}
void
list_destroy(list_t *list)
{
while (list != NULL) {
list_t *previous = list;
list = list->next;
free(previous);
}
}
|
