1*8dd5e09dSSadaf Ebrahimi /*
2*8dd5e09dSSadaf Ebrahimi * proc-llist.h
3*8dd5e09dSSadaf Ebrahimi * Copyright (c) 2009, 2020 Red Hat Inc.
4*8dd5e09dSSadaf Ebrahimi * All Rights Reserved.
5*8dd5e09dSSadaf Ebrahimi *
6*8dd5e09dSSadaf Ebrahimi * This software may be freely redistributed and/or modified under the
7*8dd5e09dSSadaf Ebrahimi * terms of the GNU General Public License as published by the Free
8*8dd5e09dSSadaf Ebrahimi * Software Foundation; either version 2, or (at your option) any
9*8dd5e09dSSadaf Ebrahimi * later version.
10*8dd5e09dSSadaf Ebrahimi *
11*8dd5e09dSSadaf Ebrahimi * This program is distributed in the hope that it will be useful,
12*8dd5e09dSSadaf Ebrahimi * but WITHOUT ANY WARRANTY; without even the implied warranty of
13*8dd5e09dSSadaf Ebrahimi * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14*8dd5e09dSSadaf Ebrahimi * GNU General Public License for more details.
15*8dd5e09dSSadaf Ebrahimi *
16*8dd5e09dSSadaf Ebrahimi * You should have received a copy of the GNU General Public License
17*8dd5e09dSSadaf Ebrahimi * along with this program; see the file COPYING. If not, write to the
18*8dd5e09dSSadaf Ebrahimi * Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor
19*8dd5e09dSSadaf Ebrahimi * Boston, MA 02110-1335, USA.
20*8dd5e09dSSadaf Ebrahimi *
21*8dd5e09dSSadaf Ebrahimi * Authors:
22*8dd5e09dSSadaf Ebrahimi * Steve Grubb <[email protected]>
23*8dd5e09dSSadaf Ebrahimi */
24*8dd5e09dSSadaf Ebrahimi
25*8dd5e09dSSadaf Ebrahimi #ifndef PROC_HEADER
26*8dd5e09dSSadaf Ebrahimi #define PROC_HEADER
27*8dd5e09dSSadaf Ebrahimi
28*8dd5e09dSSadaf Ebrahimi #include "config.h"
29*8dd5e09dSSadaf Ebrahimi #include <sys/types.h> /* Ensure types in _lnode are defined on all systems */
30*8dd5e09dSSadaf Ebrahimi
31*8dd5e09dSSadaf Ebrahimi
32*8dd5e09dSSadaf Ebrahimi /* This is the node of the linked list. Any data elements that are per
33*8dd5e09dSSadaf Ebrahimi * record goes here. */
34*8dd5e09dSSadaf Ebrahimi typedef struct _lnode{
35*8dd5e09dSSadaf Ebrahimi pid_t ppid; // parent process ID
36*8dd5e09dSSadaf Ebrahimi pid_t pid; // process ID
37*8dd5e09dSSadaf Ebrahimi uid_t uid; // user ID
38*8dd5e09dSSadaf Ebrahimi char *cmd; // command run by user
39*8dd5e09dSSadaf Ebrahimi unsigned long inode; // inode of socket
40*8dd5e09dSSadaf Ebrahimi char *capabilities; // Text of partial capabilities
41*8dd5e09dSSadaf Ebrahimi char *bounds; // Text for bounding set
42*8dd5e09dSSadaf Ebrahimi char *ambient; // Text for ambient set
43*8dd5e09dSSadaf Ebrahimi struct _lnode* next; // Next node pointer
44*8dd5e09dSSadaf Ebrahimi } lnode;
45*8dd5e09dSSadaf Ebrahimi
46*8dd5e09dSSadaf Ebrahimi /* This is the linked list head. Only data elements that are 1 per
47*8dd5e09dSSadaf Ebrahimi * event goes here. */
48*8dd5e09dSSadaf Ebrahimi typedef struct {
49*8dd5e09dSSadaf Ebrahimi lnode *head; // List head
50*8dd5e09dSSadaf Ebrahimi lnode *cur; // Pointer to current node
51*8dd5e09dSSadaf Ebrahimi unsigned int cnt; // How many items in this list
52*8dd5e09dSSadaf Ebrahimi } llist;
53*8dd5e09dSSadaf Ebrahimi
54*8dd5e09dSSadaf Ebrahimi void list_create(llist *l);
list_get_cur(llist * l)55*8dd5e09dSSadaf Ebrahimi static inline lnode *list_get_cur(llist *l) { return l->cur; }
56*8dd5e09dSSadaf Ebrahimi void list_append(llist *l, lnode *node);
57*8dd5e09dSSadaf Ebrahimi void list_clear(llist* l);
58*8dd5e09dSSadaf Ebrahimi
59*8dd5e09dSSadaf Ebrahimi /* Given a message type, find the matching node */
60*8dd5e09dSSadaf Ebrahimi lnode *list_find_inode(llist *l, unsigned long i);
61*8dd5e09dSSadaf Ebrahimi
62*8dd5e09dSSadaf Ebrahimi #endif
63*8dd5e09dSSadaf Ebrahimi
64