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
|
/* $Id: nodetree.c,v 1.11 2011/06/28 00:13:48 sbajic Exp $ */
/*
DSPAM
COPYRIGHT (C) 2002-2011 DSPAM PROJECT
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU Affero 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 Affero General Public License for more details.
You should have received a copy of the GNU Affero General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include <stdlib.h>
#include <sys/types.h>
#ifndef _WIN32
#include <pwd.h>
#endif
#include "nodetree.h"
#include "util.h"
#include "error.h"
#include "libdspam_objects.h"
#include "language.h"
/* nt_node_create (used internally) to allocate space for a new node */
struct nt_node * nt_node_create (void *data) {
struct nt_node *node;
if ((node = (struct nt_node *) malloc (sizeof (struct nt_node))) == 0)
{
LOG (LOG_CRIT, ERR_MEM_ALLOC);
exit (1);
}
node->ptr = data;
node->next = (struct nt_node *) NULL;
return (node);
}
/* nt_create allocates space for and initializes a nodetree */
struct nt *
nt_create (int nodetype)
{
struct nt *nt = (struct nt *) malloc (sizeof (struct nt));
if (nt == NULL)
{
LOG (LOG_CRIT, ERR_MEM_ALLOC);
return NULL;
}
nt->first = (struct nt_node *) NULL;
nt->insert = (struct nt_node *) NULL;
nt->items = 0;
nt->nodetype = nodetype;
return (nt);
}
/* nt_destroy methodically destroys a nodetree, freeing resources */
void
nt_destroy (struct nt *nt)
{
struct nt_node *cur, *next;
int i;
if (!nt)
return;
cur = nt->first;
for (i = 0; i < nt->items; i++)
{
next = cur->next;
if (nt->nodetype != NT_INDEX)
free (cur->ptr);
free (cur);
cur = next;
}
free (nt);
}
/* nt_add adds an item to the nodetree */
struct nt_node *
nt_add (struct nt *nt, void *data)
{
struct nt_node *prev;
struct nt_c c;
struct nt_node *node = c_nt_first (nt, &c);
void *vptr;
if (nt->insert) {
prev = nt->insert;
} else {
prev = 0;
while (node)
{
prev = node;
node = node->next;
}
}
nt->items++;
if (nt->nodetype == NT_CHAR)
{
long size = strlen ((char *) data) + 1;
vptr = malloc (size);
if (vptr == NULL)
{
LOG (LOG_CRIT, ERR_MEM_ALLOC);
return NULL;
}
strlcpy (vptr, data, size);
}
else
{
vptr = data;
}
if (prev)
{
node = nt_node_create (vptr);
prev->next = node;
nt->insert = node;
return (node);
}
else
{
node = nt_node_create (vptr);
nt->first = node;
nt->insert = node;
return (node);
}
}
/* c_nt_next returns the next item in a nodetree */
struct nt_node *
c_nt_next (struct nt *nt, struct nt_c *c)
{
struct nt_node *node = c->iter_index;
if (node)
{
c->iter_index = node->next;
return (node->next);
}
else
{
if (nt->items > 0)
{
c->iter_index = nt->first;
return nt->first;
}
}
return ((struct nt_node *) NULL);
}
/* nt_first returns the first item in a nodetree */
struct nt_node *
c_nt_first (struct nt *nt, struct nt_c *c)
{
c->iter_index = nt->first;
return (nt->first);
}
|
