diff options
author | Ashlee Young <ashlee@wildernessvoice.com> | 2015-11-29 08:22:13 -0800 |
---|---|---|
committer | Ashlee Young <ashlee@wildernessvoice.com> | 2015-11-29 08:22:13 -0800 |
commit | df5afa4fcd9725380f94ca6476248d4cc24f889a (patch) | |
tree | 65456f62397305febf7f40778c5a413a35d094ef /framework/src/audit/auparse/nvlist.c | |
parent | 76f6bf922552c00546e6e85ca471eab28f56986c (diff) |
v2.4.4 audit sources
Change-Id: I9315a7408817db51edf084fb4d27fbb492785084
Signed-off-by: Ashlee Young <ashlee@wildernessvoice.com>
Diffstat (limited to 'framework/src/audit/auparse/nvlist.c')
-rw-r--r-- | framework/src/audit/auparse/nvlist.c | 137 |
1 files changed, 137 insertions, 0 deletions
diff --git a/framework/src/audit/auparse/nvlist.c b/framework/src/audit/auparse/nvlist.c new file mode 100644 index 00000000..66e7ff8c --- /dev/null +++ b/framework/src/audit/auparse/nvlist.c @@ -0,0 +1,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; +} |