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
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
|
/*
Unix SMB/Netbios implementation.
Version 1.9.
Samba utility functions
Copyright (C) Andrew Tridgell 1992-1999
Copyright (C) Gerald Carter <jerry@samba.org> 2000
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 2 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, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*/
/****************************************************************
In order to make use of the GENERIC_LIST data structure, you
should create wrapper functions around:
BOOL generic_list_insert()
void* generic_list_remove()
void* generic_list_locate()
The reason this is necessary is that the GENERIC_LIST uses a
void pointer to store your data structure. This means that
you get no type checking and can create a heterogenous list.
However, you will need to have some way to determine the type
of your data. If you are using a homogenous list, then
wrapper functions are the easiest way. If you are creating
a heterogenous list, then you will need to use the type field
for your arbitrary identifiers.
TODO:
If necessary, you can add a few generic_list_*() to do things
like grab from the front (to implement a FIFO queue) or from
the tail (to implement a FILO stack)
****************************************************************/
#include "includes.h"
/*
* list variables
*/
static GENERIC_LIST hnds;
/****************************************************************
Initialize the list. This doesn't do much currently. Just make
sure that you call it so we can determine whether the list is
empty or not.
****************************************************************/
static void generic_list_init(GENERIC_LIST *l)
{
l->head = NULL;
l->tail = NULL;
l->length = 0;
l->initialized = True;
return;
}
/*****************************************************************
Insert some data into the list (appended to the end of the list)
*****************************************************************/
static BOOL generic_list_insert(GENERIC_LIST *l,
void *item, uint8 type)
{
/* check for an emtpy list first */
if (l->length == 0)
{
if ((l->head = malloc(sizeof(struct _list_node))) == NULL)
{
DEBUG(0, ("ERROR: out of memory! Cannot allocate a list node!\n"));
return False;
}
l->head->data = item;
l->head->type = type;
l->head->next = NULL;
l->length++;
l->tail = l->head;
}
/* we already have an existing list */
else
{
if ((l->tail->next = malloc(sizeof(struct _list_node))) == NULL)
{
DEBUG(0, ("ERROR: out of memory! Cannot allocate a list node!\n"));
return False;
}
l->tail = l->tail->next;
l->tail->next = NULL;
l->tail->data = item;
l->tail->type = type;
l->length++;
}
/* return the list pointer in case this was the first node */
return True;
}
/****************************************************************
In order to locate an item in the list, we need a pointer to
a compare function for the data items.
We will return the actual pointer to the item in the list. Not
a copy of the item.
****************************************************************/
static void* generic_list_locate (GENERIC_LIST *l, void *search,
BOOL(*cmp)(const void*,const void*))
{
struct _list_node *item;
/* loop through the list in linear order */
item = l->head;
while (item != NULL)
{
if (cmp(search, item->data))
return item->data;
else
{
item = item->next;
}
}
return NULL;
}
/***************************************************************
In order to remove a node from the list, we will need a pointer
to a compare function. The function will return a pointer to
data in the removed node.
**WARNING** It is the responsibility of the caller to save
the pointer and destroy the data.
***************************************************************/
static void* generic_list_remove(GENERIC_LIST *l, void *search,
BOOL(*cmp)(const void*,const void*))
{
struct _list_node *item, *tag;
void *data_ptr;
/* loop through the list in linear order */
tag = NULL;
item = l->head;
while (item != NULL)
{
/* did we find it? If so remove the node */
if (cmp(search, item->data))
{
/* found, so remove the node */
/* remove the first item in the list */
if (item == l->head)
l->head = item->next;
/* remove from the middle or the end */
else
tag->next = item->next;
/* check to see if we need to update the tail */
if (l->tail == item)
l->tail = tag;
l->length--;
data_ptr = item->data;
SAFE_FREE(item);
return data_ptr;
}
/* increment to the next node in the list */
else
{
tag = item;
item = item->next;
}
}
return NULL;
}
/**************************************************************
copy a POLICY_HND
*************************************************************/
BOOL copy_policy_hnd (POLICY_HND *dest, const POLICY_HND *src)
{
/* if we have no destination, return an error */
if (dest == NULL)
return False;
/* if the src handle is NULL, then copy 0x00 to
the dest handle */
if (src == NULL)
{
/* if POLICY_HND internals ever changes,
this will need to be fixed */
ZERO_STRUCTP(dest);
return True;
}
*dest = *src;
return True;
}
|
