aboutsummaryrefslogtreecommitdiffstats
path: root/framework/src/audit/audisp/audispd-llist.c
diff options
context:
space:
mode:
authorAshlee Young <ashlee@wildernessvoice.com>2016-01-20 01:10:01 +0000
committerAshlee Young <ashlee@wildernessvoice.com>2016-01-20 01:10:11 +0000
commit19d701ddf07d855128ded0cf2b573ce468e3bdd6 (patch)
tree0edcd3461ca903c76e431bb7c6348c42a0f12488 /framework/src/audit/audisp/audispd-llist.c
parentfac6fbefbfad1cf837ddd88bc0d330559c8eb6f9 (diff)
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 <ashlee@wildernessvoice.com>
Diffstat (limited to 'framework/src/audit/audisp/audispd-llist.c')
-rw-r--r--framework/src/audit/audisp/audispd-llist.c157
1 files changed, 0 insertions, 157 deletions
diff --git a/framework/src/audit/audisp/audispd-llist.c b/framework/src/audit/audisp/audispd-llist.c
deleted file mode 100644
index c30d87b5..00000000
--- a/framework/src/audit/audisp/audispd-llist.c
+++ /dev/null
@@ -1,157 +0,0 @@
-/*
-* audispd-llist.c - Minimal linked list library
-* Copyright (c) 2007,2013 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 "config.h"
-#include <stdlib.h>
-#include <string.h>
-#include "audispd-llist.h"
-
-void plist_create(conf_llist *l)
-{
- l->head = NULL;
- l->cur = NULL;
- l->cnt = 0;
-}
-
-void plist_last(conf_llist *l)
-{
- register lnode* window;
-
- if (l->head == NULL)
- return;
-
- window = l->head;
- while (window->next)
- window = window->next;
- l->cur = window;
-}
-
-lnode *plist_next(conf_llist *l)
-{
- if (l->cur == NULL)
- return NULL;
- l->cur = l->cur->next;
- return l->cur;
-}
-
-unsigned int plist_count_active(const conf_llist *l)
-{
- register lnode* current;
- unsigned int cnt = 0;
-
- current = l->head;
- while (current) {
- if (current->p && current->p->active == A_YES)
- cnt++;
- current=current->next;
- }
- return cnt;
-}
-
-void plist_append(conf_llist *l, plugin_conf_t *p)
-{
- lnode* newnode;
-
- newnode = malloc(sizeof(lnode));
-
- if (p) {
- void *pp = malloc(sizeof(struct plugin_conf));
- if (pp)
- memcpy(pp, p, sizeof(struct plugin_conf));
- newnode->p = pp;
- } else
- newnode->p = NULL;
-
- newnode->next = 0;
-
- // 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 plist_clear(conf_llist* l)
-{
- lnode* nextnode;
- register lnode* current;
-
- current = l->head;
- while (current) {
- nextnode=current->next;
- free(current->p);
- free(current);
- current=nextnode;
- }
- l->head = NULL;
- l->cur = NULL;
- l->cnt = 0;
-}
-
-void plist_mark_all_unchecked(conf_llist* l)
-{
- register lnode* current;
-
- current = l->head;
- while (current) {
- if (current->p)
- current->p->checked = 0;
- current=current->next;
- }
-}
-
-lnode *plist_find_unchecked(conf_llist* l)
-{
- register lnode* current;
-
- current = l->head;
- while (current) {
- if (current->p && current->p->checked == 0)
- return current;
- current=current->next;
- }
- return NULL;
-}
-
-lnode *plist_find_name(conf_llist* l, const char *name)
-{
- register lnode* current;
-
- if (name == NULL)
- return NULL;
-
- current = l->head;
- while (current) {
- if (current->p && current->p->name) {
- if (strcmp(current->p->name, name) == 0)
- return current;
- }
- current=current->next;
- }
- return NULL;
-}
-