q_node
audit_q_t *q_node;
while (audit_dequeue(&(p->plg_queue), (void *)&q_node) != 0) {
if (q_node->aqq_sequence != p->plg_last_seq_out + 1)
p->plg_tid, q_node->aqq_sequence,
b_node = q_node->aqq_data;
b_node->abq_data_len, q_node->aqq_sequence, &error_string);
p->plg_last_seq_out = q_node->aqq_sequence;
qpool_return(p, q_node);
audit_q_t *q_node;
while (audit_dequeue(&(p->plg_pool), (void *)&q_node) == 0) {
free(q_node);
while (audit_dequeue(&(p->plg_queue), (void *)&q_node) == 0) {
b_node = audit_release(&b_refcnt_lock, q_node->aqq_data);
free(q_node);
struct q_node *qnp =
(struct q_node *)qp->nalloc(sizeof (struct q_node));
struct q_node *nodep;
struct q_node *nextnode;
qp->nfree(qp->nodep, sizeof (struct q_node));
struct q_node *next;
struct q_node *nodep;