From 19d701ddf07d855128ded0cf2b573ce468e3bdd6 Mon Sep 17 00:00:00 2001 From: Ashlee Young Date: Wed, 20 Jan 2016 01:10:01 +0000 Subject: Removing Suricata and Audit from source repo, and updated build.sh to avoid building suricata. Will re-address this in C release via tar balls. Change-Id: I3710076f8b7f3313cb3cb5260c4eb0a6834d4f6e Signed-off-by: Ashlee Young --- framework/src/audit/src/ausearch-nvpair.c | 97 ------------------------------- 1 file changed, 97 deletions(-) delete mode 100644 framework/src/audit/src/ausearch-nvpair.c (limited to 'framework/src/audit/src/ausearch-nvpair.c') diff --git a/framework/src/audit/src/ausearch-nvpair.c b/framework/src/audit/src/ausearch-nvpair.c deleted file mode 100644 index 3dfadb60..00000000 --- a/framework/src/audit/src/ausearch-nvpair.c +++ /dev/null @@ -1,97 +0,0 @@ -/* -* ausearch-nvpair.c - Minimal linked list library for name-value pairs -* Copyright (c) 2006-08 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 -*/ - -#include "config.h" -#include -#include "ausearch-nvpair.h" - - -void nvlist_create(nvlist *l) -{ - l->head = NULL; - l->cur = NULL; - l->cnt = 0; -} - -nvnode *nvlist_next(nvlist *l) -{ - if (l->cur == NULL) - return NULL; - 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->next = NULL; - - // if we are at top, fix this up - if (l->head == NULL) - l->head = newnode; - else { // Add pointer to newnode and make sure we are at the end - while (l->cur->next) - l->cur = l->cur->next; - l->cur->next = newnode; - } - - // make newnode current - l->cur = newnode; - l->cnt++; -} - -int nvlist_find_val(nvlist *l, long val) -{ - register nvnode* window = l->head; - - while (window) { - if (window->val == val) { - l->cur = window; - return 1; - } - else - window = window->next; - } - return 0; -} - -void nvlist_clear(nvlist* l) -{ - nvnode* nextnode; - register nvnode* current; - - current = l->head; - while (current) { - nextnode=current->next; - free(current->name); - free(current); - current=nextnode; - } - l->head = NULL; - l->cur = NULL; - l->cnt = 0; -} - -- cgit 1.2.3-korg