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
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
|
/*
* normalize-llist.c - Minimal linked list library
* Copyright (c) 2016-17 Red Hat Inc.
* All Rights Reserved.
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
* Authors:
* Steve Grubb <sgrubb@redhat.com>
*/
#include <stdlib.h>
#include "normalize-llist.h"
void cllist_create(cllist *l, void (*cleanup)(void *))
{
l->head = NULL;
l->cur = NULL;
l->tail = NULL;
l->cleanup = cleanup;
l->cnt = 0;
}
void cllist_clear(cllist *l)
{
data_node *nextnode;
register data_node *current;
if (l == NULL)
return;
current = l->head;
while (current) {
nextnode = current->next;
if (l->cleanup)
l->cleanup(current->data);
free(current);
current=nextnode;
}
l->head = NULL;
l->cur = NULL;
l->tail = NULL;
l->cnt = 0;
}
data_node *cllist_next(cllist *l)
{
if (l->cur == NULL)
return NULL;
l->cur = l->cur->next;
return l->cur;
}
// Returns 0 on success and 1 on error
int cllist_append(cllist *l, uint32_t num, void *data)
{
data_node *newnode;
newnode = malloc(sizeof(data_node));
if (newnode == NULL)
return 1;
newnode->num = num;
newnode->data = data;
newnode->next = NULL;
// if we are at top, fix this up
if (l->head == NULL)
l->head = newnode;
else // Otherwise add pointer to newnode
l->tail->next = newnode;
// update tail and make newnode current
l->tail = newnode;
l->cur = newnode;
l->cnt++;
return 0;
}
|
