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
|
/*
* active port forwarder - software for secure forwarding
* Copyright (C) 2003,2004,2005 jeremian <jeremian [at] poczta.fm>
*
* 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., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*
*/
#include <config.h>
#include <stdlib.h>
#include <string.h>
#include "audit.h"
int
insertalnode(alnodeT** headRef, int uid, char* nbuf, char* pbuf, time_t ctime, time_t dur)
{
alnodeT* newnode, *lastnode;
lastnode = newnode = *headRef;
while (newnode) {
lastnode = newnode;
newnode = newnode->next;
}
newnode = calloc(1, sizeof(alnodeT));
newnode->userid = uid;
memcpy(newnode->namebuf, nbuf, 128);
memcpy(newnode->portbuf, pbuf, 7);
newnode->connecttime = ctime;
newnode->duration = dur;
newnode->next = NULL;
if (lastnode)
lastnode->next = newnode;
else
*headRef = newnode;
return 0;
}
int
deletealnode(alnodeT** headRef)
{
alnodeT* node = *headRef;
if (*headRef == NULL)
return 1;
*headRef = node->next;
free(node);
return 0;
}
int
freeauditlist(alnodeT** headRef)
{
while (*headRef) {
deletealnode(headRef);
}
return 0;
}
|