diff options
Diffstat (limited to 'framework/src/audit/audisp/plugins/prelude/audisp-int.h')
-rw-r--r-- | framework/src/audit/audisp/plugins/prelude/audisp-int.h | 57 |
1 files changed, 57 insertions, 0 deletions
diff --git a/framework/src/audit/audisp/plugins/prelude/audisp-int.h b/framework/src/audit/audisp/plugins/prelude/audisp-int.h new file mode 100644 index 00000000..b0204753 --- /dev/null +++ b/framework/src/audit/audisp/plugins/prelude/audisp-int.h @@ -0,0 +1,57 @@ +/* +* audisp-int.h - Header file for audisp-int.c +* Copyright (c) 2008 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> +*/ + +#ifndef AUINT_HEADER +#define AUINT_HEADER + +#include "config.h" +#include <sys/types.h> + +/* This is the node of the linked list. Number & item are the only elements + * at this time. Any data elements that are per item goes here. */ +typedef struct _int_node{ + int num; // The number + struct _int_node* next; // Next string node pointer +} int_node; + +/* This is the linked list head. Only data elements that are 1 per + * event goes here. */ +typedef struct { + int_node *head; // List head + int_node *cur; // Pointer to current node + unsigned int cnt; // How many items in this list +} ilist; + +void ilist_create(ilist *l); +static inline void ilist_first(ilist *l) { l->cur = l->head; } +int_node *ilist_next(ilist *l); +static inline int_node *ilist_get_cur(ilist *l) { return l->cur; } +void ilist_append(ilist *l, int num); +void ilist_clear(ilist* l); +int ilist_find_num(ilist *l, unsigned int num); + +/* append a number if its not already on the list */ +int ilist_add_if_uniq(ilist *l, int num); + +#endif + |