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
|
/*
* nvlist.c - Minimal linked list library for name-value pairs
* Copyright (c) 2006-07 Red Hat Inc., Durham, North Carolina.
* All Rights Reserved.
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
* Authors:
* Steve Grubb <sgrubb@redhat.com>
*/
#include "config.h"
#include <stdlib.h>
#include <string.h>
#include "nvlist.h"
#include "interpret.h"
#include "auparse-idata.h"
void nvlist_create(nvlist *l)
{
l->head = NULL;
l->cur = NULL;
l->cnt = 0;
}
static void nvlist_last(nvlist *l)
{
register nvnode* window;
if (l->head == NULL)
return;
window = l->head;
while (window->next)
window = window->next;
l->cur = window;
}
nvnode *nvlist_next(nvlist *l)
{
if (l->cur)
l->cur = l->cur->next;
return l->cur;
}
void nvlist_append(nvlist *l, nvnode *node)
{
nvnode* newnode = malloc(sizeof(nvnode));
newnode->name = node->name;
newnode->val = node->val;
newnode->interp_val = 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
if (l->cnt == (l->cur->item+1)) {
l->cur->next = newnode;
}
else {
nvlist_last(l);
l->cur->next = newnode;
}
}
// make newnode current
l->cur = newnode;
l->cnt++;
}
/*
* This function will start at current index and scan for a name
*/
int nvlist_find_name(nvlist *l, const char *name)
{
register nvnode* window = l->cur;
while (window) {
if (strcmp(window->name, name) == 0) {
l->cur = window;
return 1;
}
else
window = window->next;
}
return 0;
}
extern int interp_adjust_type(int rtype, const char *name, const char *val);
int nvlist_get_cur_type(const rnode *r)
{
const nvlist *l = &r->nv;
return auparse_interp_adjust_type(r->type, l->cur->name, l->cur->val);
}
const char *nvlist_interp_cur_val(const rnode *r)
{
const nvlist *l = &r->nv;
if (l->cur->interp_val)
return l->cur->interp_val;
return interpret(r);
}
void nvlist_clear(nvlist* l)
{
nvnode* nextnode;
register nvnode* current;
current = l->head;
while (current) {
nextnode=current->next;
free(current->name);
free(current->val);
free(current->interp_val);
free(current);
current=nextnode;
}
l->head = NULL;
l->cur = NULL;
l->cnt = 0;
}
|
