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
|
/*
* ausearch-string.c - Minimal linked list library for strings
* Copyright (c) 2005,2008,2014 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 "ausearch-string.h"
#include <stdlib.h>
#include <string.h>
void slist_create(slist *l)
{
l->head = NULL;
l->cur = NULL;
l->cnt = 0;
}
void slist_last(slist *l)
{
register snode* cur;
if (l->head == NULL)
return;
// Try using cur so that we don't have to start at beginnning
if (l->cur)
cur = l->cur;
else
cur = l->head;
// Loop until no next value
while (cur->next)
cur = cur->next;
l->cur = cur;
}
snode *slist_next(slist *l)
{
if (l->cur == NULL)
return NULL;
l->cur = l->cur->next;
return l->cur;
}
void slist_append(slist *l, snode *node)
{
snode* newnode;
newnode = malloc(sizeof(snode));
if (node->str)
newnode->str = node->str;
else
newnode->str = NULL;
if (node->key)
newnode->key = node->key;
else
newnode->key = NULL;
newnode->hits = node->hits;
newnode->next = NULL;
// Make sure cursor is at the end
slist_last(l);
// 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 slist_clear(slist* l)
{
snode* nextnode;
register snode* current;
current = l->head;
while (current) {
nextnode=current->next;
free(current->str);
free(current->key);
free(current);
current=nextnode;
}
l->head = NULL;
l->cur = NULL;
l->cnt = 0;
}
/* This function dominates the timing of aureport. Needs to be more efficient */
int slist_add_if_uniq(slist *l, const char *str)
{
snode sn;
register snode *cur;
cur = l->head;
while (cur) {
if (strcmp(str, cur->str) == 0) {
cur->hits++;
l->cur = cur;
return 0;
} else
cur = cur->next;
}
/* No matches, append to the end */
sn.str = strdup(str);
sn.key = NULL;
sn.hits = 1;
slist_append(l, &sn);
return 1;
}
// If lprev would be NULL, use l->head
static void swap_nodes(snode *lprev, snode *left, snode *right)
{
snode *t = right->next;
if (lprev)
lprev->next = right;
right->next = left;
left->next = t;
}
// This will sort the list from most hits to least
void slist_sort_by_hits(slist *l)
{
register snode* cur, *prev;
if (l->cnt <= 1)
return;
prev = cur = l->head;
while (cur && cur->next) {
/* If the next node is bigger */
if (cur->hits < cur->next->hits) {
if (cur == l->head) {
// Update the actual list head
l->head = cur->next;
prev = NULL;
}
swap_nodes(prev, cur, cur->next);
// start over
prev = cur = l->head;
continue;
}
prev = cur;
cur = cur->next;
}
// End with cur pointing at first record
l->cur = l->head;
}
|
