1*0Sstevel@tonic-gate /*
2*0Sstevel@tonic-gate  * CDDL HEADER START
3*0Sstevel@tonic-gate  *
4*0Sstevel@tonic-gate  * The contents of this file are subject to the terms of the
5*0Sstevel@tonic-gate  * Common Development and Distribution License, Version 1.0 only
6*0Sstevel@tonic-gate  * (the "License").  You may not use this file except in compliance
7*0Sstevel@tonic-gate  * with the License.
8*0Sstevel@tonic-gate  *
9*0Sstevel@tonic-gate  * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
10*0Sstevel@tonic-gate  * or http://www.opensolaris.org/os/licensing.
11*0Sstevel@tonic-gate  * See the License for the specific language governing permissions
12*0Sstevel@tonic-gate  * and limitations under the License.
13*0Sstevel@tonic-gate  *
14*0Sstevel@tonic-gate  * When distributing Covered Code, include this CDDL HEADER in each
15*0Sstevel@tonic-gate  * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
16*0Sstevel@tonic-gate  * If applicable, add the following below this CDDL HEADER, with the
17*0Sstevel@tonic-gate  * fields enclosed by brackets "[]" replaced with your own identifying
18*0Sstevel@tonic-gate  * information: Portions Copyright [yyyy] [name of copyright owner]
19*0Sstevel@tonic-gate  *
20*0Sstevel@tonic-gate  * CDDL HEADER END
21*0Sstevel@tonic-gate  */
22*0Sstevel@tonic-gate /*
23*0Sstevel@tonic-gate  * Copyright 2003 Sun Microsystems, Inc.  All rights reserved.
24*0Sstevel@tonic-gate  * Use is subject to license terms.
25*0Sstevel@tonic-gate  */
26*0Sstevel@tonic-gate #pragma ident	"%Z%%M%	%I%	%E% SMI"
27*0Sstevel@tonic-gate 
28*0Sstevel@tonic-gate #include <pthread.h>
29*0Sstevel@tonic-gate #include <memory.h>
30*0Sstevel@tonic-gate #include "queue.h"
31*0Sstevel@tonic-gate #include <stdio.h>
32*0Sstevel@tonic-gate #include <assert.h>
33*0Sstevel@tonic-gate #include "plugin.h"
34*0Sstevel@tonic-gate 
35*0Sstevel@tonic-gate #define	DEBUG	0
36*0Sstevel@tonic-gate 
37*0Sstevel@tonic-gate #if DEBUG
38*0Sstevel@tonic-gate static FILE *dbfp;
39*0Sstevel@tonic-gate extern FILE *__auditd_debug_file_open();
40*0Sstevel@tonic-gate #define	DPRINT(x) {(void) fprintf x; }
41*0Sstevel@tonic-gate #else
42*0Sstevel@tonic-gate #define	DPRINT(x)
43*0Sstevel@tonic-gate #endif
44*0Sstevel@tonic-gate 
45*0Sstevel@tonic-gate void
46*0Sstevel@tonic-gate audit_queue_init(au_queue_t *q)
47*0Sstevel@tonic-gate {
48*0Sstevel@tonic-gate 	q->auq_head = NULL;
49*0Sstevel@tonic-gate 	q->auq_tail = NULL;
50*0Sstevel@tonic-gate 	(void) pthread_mutex_init(&q->auq_lock, NULL);
51*0Sstevel@tonic-gate 	q->auq_count = 0;
52*0Sstevel@tonic-gate #if DEBUG
53*0Sstevel@tonic-gate 	dbfp = __auditd_debug_file_open();
54*0Sstevel@tonic-gate #endif
55*0Sstevel@tonic-gate }
56*0Sstevel@tonic-gate 
57*0Sstevel@tonic-gate /*
58*0Sstevel@tonic-gate  * enqueue()	caller creates queue entry
59*0Sstevel@tonic-gate  */
60*0Sstevel@tonic-gate 
61*0Sstevel@tonic-gate void
62*0Sstevel@tonic-gate audit_enqueue(au_queue_t *q,  void *p)
63*0Sstevel@tonic-gate {
64*0Sstevel@tonic-gate 	(void) pthread_mutex_lock(&q->auq_lock);
65*0Sstevel@tonic-gate 
66*0Sstevel@tonic-gate 	DPRINT((dbfp, "enqueue0(%X): p=%X, head=%X, tail=%X, count=%d\n",
67*0Sstevel@tonic-gate 	    q, p, q->auq_head, q->auq_tail, q->auq_count));
68*0Sstevel@tonic-gate 
69*0Sstevel@tonic-gate 	if (q->auq_head == NULL)
70*0Sstevel@tonic-gate 		q->auq_head = p;
71*0Sstevel@tonic-gate 	else {
72*0Sstevel@tonic-gate 		DPRINT((dbfp, "\tindirect tail=%X\n",
73*0Sstevel@tonic-gate 		    &(((audit_link_t *)(q->auq_tail))->aln_next)));
74*0Sstevel@tonic-gate 
75*0Sstevel@tonic-gate 		((audit_link_t *)(q->auq_tail))->aln_next = p;
76*0Sstevel@tonic-gate 	}
77*0Sstevel@tonic-gate 	q->auq_tail = p;
78*0Sstevel@tonic-gate 	((audit_link_t *)p)->aln_next = NULL;
79*0Sstevel@tonic-gate 	q->auq_count++;
80*0Sstevel@tonic-gate 
81*0Sstevel@tonic-gate 	DPRINT((dbfp, "enqueue1(%X): p=%X, head=%X, tail=%X, "
82*0Sstevel@tonic-gate 	    "count=%d, pnext=%X\n",
83*0Sstevel@tonic-gate 	    q, p, q->auq_head, q->auq_tail, q->auq_count,
84*0Sstevel@tonic-gate 	    ((audit_link_t *)p)->aln_next));
85*0Sstevel@tonic-gate 
86*0Sstevel@tonic-gate 	(void) pthread_mutex_unlock(&q->auq_lock);
87*0Sstevel@tonic-gate }
88*0Sstevel@tonic-gate 
89*0Sstevel@tonic-gate /*
90*0Sstevel@tonic-gate  * audit_dequeue() returns entry; caller is responsible for free
91*0Sstevel@tonic-gate  */
92*0Sstevel@tonic-gate 
93*0Sstevel@tonic-gate int
94*0Sstevel@tonic-gate audit_dequeue(au_queue_t *q, void **p)
95*0Sstevel@tonic-gate {
96*0Sstevel@tonic-gate 	(void) pthread_mutex_lock(&q->auq_lock);
97*0Sstevel@tonic-gate 
98*0Sstevel@tonic-gate 	if ((*p = q->auq_head) == NULL) {
99*0Sstevel@tonic-gate 		DPRINT((dbfp, "dequeue1(%X): p=%X, head=%X, "
100*0Sstevel@tonic-gate 		    "tail=%X, count=%d\n",
101*0Sstevel@tonic-gate 		    q, *p, q->auq_head, q->auq_tail, q->auq_count));
102*0Sstevel@tonic-gate 
103*0Sstevel@tonic-gate 		(void) pthread_mutex_unlock(&q->auq_lock);
104*0Sstevel@tonic-gate 		return (1);
105*0Sstevel@tonic-gate 	}
106*0Sstevel@tonic-gate 	q->auq_count--;
107*0Sstevel@tonic-gate 
108*0Sstevel@tonic-gate 	/* if *p is the last, next is NULL */
109*0Sstevel@tonic-gate 	q->auq_head = ((audit_link_t *)*p)->aln_next;
110*0Sstevel@tonic-gate 
111*0Sstevel@tonic-gate 	DPRINT((dbfp, "dequeue0(%X): p=%X, head=%X, tail=%X, "
112*0Sstevel@tonic-gate 	    "count=%d, pnext=%X\n",
113*0Sstevel@tonic-gate 	    q, *p, q->auq_head, q->auq_tail, q->auq_count,
114*0Sstevel@tonic-gate 	    ((audit_link_t *)*p)->aln_next));
115*0Sstevel@tonic-gate 
116*0Sstevel@tonic-gate 	(void) pthread_mutex_unlock(&q->auq_lock);
117*0Sstevel@tonic-gate 	return (0);
118*0Sstevel@tonic-gate }
119*0Sstevel@tonic-gate 
120*0Sstevel@tonic-gate /*
121*0Sstevel@tonic-gate  * increment ref count
122*0Sstevel@tonic-gate  */
123*0Sstevel@tonic-gate void
124*0Sstevel@tonic-gate audit_incr_ref(pthread_mutex_t *l, audit_rec_t *p)
125*0Sstevel@tonic-gate {
126*0Sstevel@tonic-gate 	(void) pthread_mutex_lock(l);
127*0Sstevel@tonic-gate 	p->abq_ref_count++;
128*0Sstevel@tonic-gate 	DPRINT((dbfp, "incr_ref: p=%X, count=%d\n",
129*0Sstevel@tonic-gate 	    p, p->abq_ref_count));
130*0Sstevel@tonic-gate 	(void) pthread_mutex_unlock(l);
131*0Sstevel@tonic-gate }
132*0Sstevel@tonic-gate /*
133*0Sstevel@tonic-gate  * decrement reference count; if it reaches zero,
134*0Sstevel@tonic-gate  * return a pointer to it.  Otherwise, return NULL.
135*0Sstevel@tonic-gate  */
136*0Sstevel@tonic-gate audit_rec_t *
137*0Sstevel@tonic-gate audit_release(pthread_mutex_t *l, audit_rec_t *p)
138*0Sstevel@tonic-gate {
139*0Sstevel@tonic-gate 	assert(p != NULL);
140*0Sstevel@tonic-gate 
141*0Sstevel@tonic-gate 	(void) pthread_mutex_lock(l);
142*0Sstevel@tonic-gate 
143*0Sstevel@tonic-gate 	DPRINT((dbfp, "release: p=%X, count=%d\n",
144*0Sstevel@tonic-gate 	    p, p->abq_ref_count));
145*0Sstevel@tonic-gate 
146*0Sstevel@tonic-gate 	if (--(p->abq_ref_count) > 0) {
147*0Sstevel@tonic-gate 		(void) pthread_mutex_unlock(l);
148*0Sstevel@tonic-gate 		return (NULL);
149*0Sstevel@tonic-gate 	}
150*0Sstevel@tonic-gate 	(void) pthread_mutex_unlock(l);
151*0Sstevel@tonic-gate 
152*0Sstevel@tonic-gate 	return (p);
153*0Sstevel@tonic-gate }
154*0Sstevel@tonic-gate 
155*0Sstevel@tonic-gate int
156*0Sstevel@tonic-gate audit_queue_size(au_queue_t *q)
157*0Sstevel@tonic-gate {
158*0Sstevel@tonic-gate 	int	size;
159*0Sstevel@tonic-gate 
160*0Sstevel@tonic-gate 	(void) pthread_mutex_lock(&q->auq_lock);
161*0Sstevel@tonic-gate 	size = q->auq_count;
162*0Sstevel@tonic-gate 	(void) pthread_mutex_unlock(&q->auq_lock);
163*0Sstevel@tonic-gate 
164*0Sstevel@tonic-gate 	return (size);
165*0Sstevel@tonic-gate }
166*0Sstevel@tonic-gate 
167*0Sstevel@tonic-gate 
168*0Sstevel@tonic-gate void
169*0Sstevel@tonic-gate audit_queue_destroy(au_queue_t *q)
170*0Sstevel@tonic-gate {
171*0Sstevel@tonic-gate 	(void) pthread_mutex_destroy(&q->auq_lock);
172*0Sstevel@tonic-gate }
173