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
|
/*
* audispd-llist.c - Minimal linked list library
* Copyright (c) 2007,2013 Red Hat Inc., Durham, North Carolina.
* All Rights Reserved.
*
* This software may be freely redistributed and/or modified under the
* terms of the GNU General Public License as published by the Free
* Software Foundation; either version 2, 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; see the file COPYING. If not, write to the
* Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*
* Authors:
* Steve Grubb <sgrubb@redhat.com>
*/
#include "config.h"
#include <stdlib.h>
#include <string.h>
#include "audispd-llist.h"
void plist_create(conf_llist *l)
{
l->head = NULL;
l->cur = NULL;
l->cnt = 0;
}
void plist_last(conf_llist *l)
{
register lnode* window;
if (l->head == NULL)
return;
window = l->head;
while (window->next)
window = window->next;
l->cur = window;
}
lnode *plist_next(conf_llist *l)
{
if (l->cur == NULL)
return NULL;
l->cur = l->cur->next;
return l->cur;
}
unsigned int plist_count_active(const conf_llist *l)
{
register lnode* current;
unsigned int cnt = 0;
current = l->head;
while (current) {
if (current->p && current->p->active == A_YES)
cnt++;
current=current->next;
}
return cnt;
}
void plist_append(conf_llist *l, plugin_conf_t *p)
{
lnode* newnode;
newnode = malloc(sizeof(lnode));
if (p) {
void *pp = malloc(sizeof(struct plugin_conf));
if (pp)
memcpy(pp, p, sizeof(struct plugin_conf));
newnode->p = pp;
} else
newnode->p = NULL;
newnode->next = 0;
// if we are at top, fix this up
if (l->head == NULL)
l->head = newnode;
else // Otherwise add pointer to newnode
l->cur->next = newnode;
// make newnode current
l->cur = newnode;
l->cnt++;
}
void plist_clear(conf_llist* l)
{
lnode* nextnode;
register lnode* current;
current = l->head;
while (current) {
nextnode=current->next;
free(current->p);
free(current);
current=nextnode;
}
l->head = NULL;
l->cur = NULL;
l->cnt = 0;
}
void plist_mark_all_unchecked(conf_llist* l)
{
register lnode* current;
current = l->head;
while (current) {
if (current->p)
current->p->checked = 0;
current=current->next;
}
}
lnode *plist_find_unchecked(conf_llist* l)
{
register lnode* current;
current = l->head;
while (current) {
if (current->p && current->p->checked == 0)
return current;
current=current->next;
}
return NULL;
}
lnode *plist_find_name(conf_llist* l, const char *name)
{
register lnode* current;
if (name == NULL)
return NULL;
current = l->head;
while (current) {
if (current->p && current->p->name) {
if (strcmp(current->p->name, name) == 0)
return current;
}
current=current->next;
}
return NULL;
}
|
