diff options
Diffstat (limited to 'libcap-ng-0.7/utils/proc-llist.h')
-rw-r--r-- | libcap-ng-0.7/utils/proc-llist.h | 60 |
1 files changed, 60 insertions, 0 deletions
diff --git a/libcap-ng-0.7/utils/proc-llist.h b/libcap-ng-0.7/utils/proc-llist.h new file mode 100644 index 0000000..4e21430 --- /dev/null +++ b/libcap-ng-0.7/utils/proc-llist.h @@ -0,0 +1,60 @@ +/* +* proc-llist.h +* Copyright (c) 2009 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 PROC_HEADER +#define PROC_HEADER + +#include "config.h" + + +/* This is the node of the linked list. Any data elements that are per + * record goes here. */ +typedef struct _lnode{ + pid_t ppid; // parent process ID + pid_t pid; // process ID + uid_t uid; // user ID + char *cmd; // command run by user + unsigned long inode; // inode of socket + char *capabilities; // Text of partial capabilities + char *bounds; // Text for bounding set + struct _lnode* next; // Next node pointer +} lnode; + +/* This is the linked list head. Only data elements that are 1 per + * event goes here. */ +typedef struct { + lnode *head; // List head + lnode *cur; // Pointer to current node + unsigned int cnt; // How many items in this list +} llist; + +void list_create(llist *l); +static inline lnode *list_get_cur(llist *l) { return l->cur; } +void list_append(llist *l, lnode *node); +void list_clear(llist* l); + +/* Given a message type, find the matching node */ +lnode *list_find_inode(llist *l, unsigned long i); + +#endif + |