blob: 863702ae696311557673c0cfbd3405913044c876 (
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
|
/*-
* Copyright (C) 2025 Alessandro Iezzi <aiezzi AT alessandroiezzi PERIOD it>
*
* This file is part of Tris Game.
*
* Tris Game 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.
*
* Tris Game 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 Tris Game. If not, see <http://www.gnu.org/licenses/>.
*/
#include "list.h"
#include <stdlib.h>
static list_node_t *
list_create_node(void *data)
{
list_node_t *node = malloc(sizeof(list_node_t));
node->data = data;
node->next = NULL;
return node;
}
list_t *
list_create()
{
list_t *list = malloc(sizeof(list_t));
list->head = NULL;
list->tail = NULL;
list->size = 0;
return list;
}
void
list_add(list_t *l, void *data)
{
if (l == NULL) return;
list_node_t *node = list_create_node(data);
if (node == NULL) return;
l->size++;
/* It's the first element of the list */
if (l->head == NULL) {
l->head = node;
l->tail = node;
} else {
l->tail->next = node;
l->tail = node;
}
}
|
