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
|
/*
* aulastlog-llist.c - Minimal linked list library
* Copyright (c) 2008 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 <stdlib.h>
#include <string.h>
#include "aulastlog-llist.h"
void list_create(llist *l)
{
l->head = NULL;
l->cur = NULL;
l->cnt = 0;
}
lnode *list_next(llist *l)
{
if (l->cur == NULL)
return NULL;
l->cur = l->cur->next;
return l->cur;
}
void list_append(llist *l, lnode *node)
{
lnode* newnode;
newnode = malloc(sizeof(lnode));
newnode->sec = node->sec;
newnode->uid = node->uid;
newnode->name = strdup(node->name);
if (node->host)
newnode->host = strdup(node->host);
else
newnode->host = NULL;
if (node->term)
newnode->term = strdup(node->term);
else
newnode->term = NULL;
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++;
}
void list_clear(llist* l)
{
lnode* nextnode;
register lnode* current;
current = l->head;
while (current) {
nextnode=current->next;
free(current->name);
free(current->host);
free(current->term);
free(current);
current=nextnode;
}
l->head = NULL;
l->cur = NULL;
l->cnt = 0;
}
int list_update_login(llist* l, time_t t)
{
register lnode* cur;
if (l == NULL)
return 0;
cur=list_get_cur(l);
cur->sec = t;
return 1;
}
int list_update_host(llist* l, const char *h)
{
register lnode* cur;
if (l == NULL)
return 0;
cur=list_get_cur(l);
if (h) {
free(cur->host);
cur->host = strdup(h);
} else
cur->host = NULL;
return 1;
}
int list_update_term(llist* l, const char *t)
{
register lnode* cur;
if (l == NULL)
return 0;
cur=list_get_cur(l);
if (t) {
free(cur->term);
cur->term = strdup(t);
} else
cur->term = NULL;
return 1;
}
lnode *list_find_uid(llist *l, uid_t uid)
{
register lnode* window;
window = l->head; /* start at the beginning */
while (window) {
if (window->uid == uid) {
l->cur = window;
return window;
} else
window = window->next;
}
return NULL;
}
|
