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
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
|
/*
* ausearch-llist.c - Minimal linked list library
* Copyright (c) 2005-2008, 2011 Red Hat Inc., Durham, North Carolina.
* Copyright (c) 2011 IBM Corp.
* 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>
* Marcelo Henrique Cerri <mhcerri@br.ibm.com>
*/
#include <stdlib.h>
#include <string.h>
#include "ausearch-llist.h"
void list_create(llist *l)
{
l->head = NULL;
l->cur = NULL;
l->cnt = 0;
l->e.milli = 0L;
l->e.sec = 0L;
l->e.serial = 0L;
l->e.node = NULL;
l->e.type = 0;
l->s.gid = -1;
l->s.egid = -1;
l->s.ppid = -1;
l->s.pid = -1;
l->s.success = S_UNSET;
l->s.uid = -1;
l->s.euid = -1;
l->s.loginuid = -2;
l->s.hostname = NULL;
l->s.filename = NULL;
l->s.terminal = NULL;
l->s.cwd = NULL;
l->s.exe = NULL;
l->s.key = NULL;
l->s.comm = NULL;
l->s.avc = NULL;
l->s.acct = NULL;
l->s.arch = 0;
l->s.syscall = 0;
l->s.session_id = -2;
l->s.uuid = NULL;
l->s.vmname = NULL;
l->s.exit = 0;
l->s.exit_is_set = 0;
}
void list_last(llist *l)
{
register lnode* window;
if (l->head == NULL)
return;
window = l->head;
while (window->next)
window = window->next;
l->cur = window;
}
lnode *list_next(llist *l)
{
if (l->cur == NULL)
return NULL;
l->cur = l->cur->next;
return l->cur;
}
lnode *list_prev(llist *l)
{
if (l->cur == NULL)
return NULL;
if (l->cur->item == 0)
return NULL;
list_find_item(l, l->cur->item-1);
return l->cur;
}
void list_append(llist *l, lnode *node)
{
lnode* newnode;
newnode = malloc(sizeof(lnode));
if (node->message)
newnode->message = node->message;
else
newnode->message = NULL;
newnode->mlen = node->mlen;
newnode->type = node->type;
newnode->a0 = node->a0;
newnode->a1 = node->a1;
newnode->item = l->cnt;
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->cur->next = newnode;
// make newnode current
l->cur = newnode;
l->cnt++;
}
int list_find_item(llist *l, unsigned int i)
{
register lnode* window;
if (l->cur && (l->cur->item <= i))
window = l->cur; /* Try to use where we are */
else
window = l->head; /* Can't, start over */
while (window) {
if (window->item == i) {
l->cur = window;
return 1;
} else
window = window->next;
}
return 0;
}
void list_clear(llist* l)
{
lnode* nextnode;
register lnode* current;
current = l->head;
while (current) {
nextnode=current->next;
free(current->message);
free(current);
current=nextnode;
}
l->head = NULL;
l->cur = NULL;
l->cnt = 0;
l->e.milli = 0L;
l->e.sec = 0L;
l->e.serial = 0L;
free((char *)l->e.node);
l->e.node = NULL;
l->e.type = 0;
l->s.gid = -1;
l->s.egid = -1;
l->s.ppid = -1;
l->s.pid = -1;
l->s.success = S_UNSET;
l->s.uid = -1;
l->s.euid = -1;
l->s.loginuid = -2;
free(l->s.hostname);
l->s.hostname = NULL;
if (l->s.filename) {
slist_clear(l->s.filename);
free(l->s.filename);
l->s.filename = NULL;
}
free(l->s.terminal);
l->s.terminal = NULL;
free(l->s.cwd);
l->s.cwd = NULL;
free(l->s.exe);
l->s.exe = NULL;
if (l->s.key) {
slist_clear(l->s.key);
free(l->s.key);
l->s.key = NULL;
}
free(l->s.comm);
l->s.comm = NULL;
if (l->s.avc) {
alist_clear(l->s.avc);
free(l->s.avc);
l->s.avc = NULL;
}
free(l->s.acct);
l->s.acct = NULL;
l->s.arch = 0;
l->s.syscall = 0;
l->s.session_id = -2;
free(l->s.uuid);
l->s.uuid = NULL;
free(l->s.vmname);
l->s.vmname = NULL;
l->s.exit = 0;
l->s.exit_is_set = 0;
}
int list_get_event(llist* l, event *e)
{
if (l == NULL || e == NULL)
return 0;
e->sec = l->e.sec;
e->milli = l->e.milli;
e->serial = l->e.serial;
return 1;
}
lnode *list_find_msg(llist *l, int i)
{
register lnode* window;
window = l->head; /* start at the beginning */
while (window) {
if (window->type == i) {
l->cur = window;
return window;
} else
window = window->next;
}
return NULL;
}
lnode *list_find_msg_range(llist *l, int low, int high)
{
register lnode* window;
if (high <= low)
return NULL;
window = l->head; /* Start at the beginning */
while (window) {
if (window->type >= low && window->type <= high) {
l->cur = window;
return window;
} else
window = window->next;
}
return NULL;
}
|
