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
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
|
/* $Id: list.c,v 1.2 2009-01-27 17:06:41 potyra Exp $
*
* Copyright (C) 2002-2009 FAUmachine Team <info@faumachine.org>.
* This program is free software. You can redistribute it and/or modify it
* under the terms of the GNU General Public License, either version 2 of
* the License, or (at your option) any later version. See COPYING.
*/
#include "config.h"
#include <assert.h>
#include <stdio.h>
#include "list.h"
#include "memory.h"
void list_init(struct list_header *list)
{
list->first = (void*)0;
list->last = (void*)0;
list->num = 0;
}
struct list_header *list_new(void)
{
struct list_header *list;
list = MEM_NEW(struct list_header);
list_init(list);
return list;
}
void list_free(struct list_header *list)
{
assert(list->num==0);
free(list);
}
void *list_shift(struct list_header *list)
{
struct list_node *node;
node=list->first;
if(node) {
list->first=node->succeder;
if(node->succeder) {
node->succeder->preceder=(void*)0;
} else {
list->last=(void*)0;
}
list->num--;
}
return node;
}
void *list_pop(struct list_header *list)
{
struct list_node *node;
node=list->last;
if(node) {
if(node->preceder) {
node->preceder->succeder=(void*)0;
} else {
list->first=(void*)0;
}
list->last=node->preceder;
list->num--;
}
return node;
}
int list_push(struct list_header *list, void *data_node)
{
struct list_node *node = data_node;
node->preceder = list->last;
node->succeder = (void*)0;
if(list->last) {
list->last->succeder = node;
} else {
list->first = node;
}
list->num++;
list->last=node;
return list->num;
}
int list_unshift(struct list_header *list, void *data_node)
{
struct list_node *node=data_node;
node->preceder = (void*)0;
node->succeder = list->first;
if(list->first) {
list->first->preceder = node;
} else {
list->last = node;
}
list->num++;
list->first = node;
return list->num;
}
struct list_dnode *list_new_dnode(struct list_header *list, void *data)
{
struct list_dnode *dnode;
dnode=MEM_NEW(struct list_dnode);
dnode->data=data;
if(list) {
list_push(list, dnode);
}
return dnode;
}
struct list_dnode *
list_find_dnode(struct list_header *list, void *ref)
{
struct list_dnode *dnode;
list_Foreach(list, dnode) {
if (dnode->data == ref) return dnode;
}
return NULL;
}
void
list_remove_dnode(struct list_header *list, void *ref)
{
struct list_dnode *dnode;
dnode = list_find_dnode(list, ref);
assert(dnode);
list_Remove(list, dnode);
free(dnode);
}
|
