Lines Matching defs:node
579 audit_q_t *node;
592 node = malloc(sizeof (audit_q_t));
593 if (node == NULL)
597 audit_enqueue(&p->plg_pool, node);
609 audit_rec_t *node;
616 node = malloc(AUDIT_REC_HEADER + DEFAULT_BUF_SZ);
617 if (node == NULL)
621 node->abq_buf_len = DEFAULT_BUF_SZ;
623 node->abq_data_len = 0;
624 audit_enqueue(&b_pool, node);
665 audit_q_t *node;
669 rc = audit_dequeue(&(p->plg_pool), (void *)&node);
671 return (node);
676 node = malloc(sizeof (audit_q_t));
678 if (node == NULL)
682 return (node);
692 audit_rec_t *node;
700 rc = audit_dequeue(&b_pool, (void *)&node);
707 DPRINT((dbfp, "bpool_withdraw node=%p (pool=%d)\n",
708 (void *)node, audit_queue_size(&b_pool)));
710 if (new_length > node->abq_buf_len) {
711 node = realloc(node, AUDIT_REC_HEADER + new_length);
712 if (node == NULL)
729 node = malloc(AUDIT_REC_HEADER + new_length);
731 if (node == NULL)
738 DPRINT((dbfp, "bpool_withdraw node=%p (alloc=%d, pool=%d)\n",
739 (void *)node, b_allocated, audit_queue_size(&b_pool)));
743 (void) memcpy(node->abq_buffer, buffer, buff_size);
744 node->abq_data_len = buff_size;
745 node->abq_buf_len = new_length;
746 node->abq_ref_count = 0;
748 return (node);
754 * if the pool is over max, the node is discarded instead.
757 qpool_return(plugin_t *p, audit_q_t *node)
763 uint64_t sequence = node->aqq_sequence;
769 free(node);
771 audit_enqueue(&(p->plg_pool), node);
784 bpool_return(audit_rec_t *node)
787 audit_rec_t *copy = node;
789 node = audit_release(&b_refcnt_lock, node); /* decrement ref cnt */
791 if (node != NULL) { /* NULL if ref cnt is not zero */
792 audit_enqueue(&b_pool, node);
795 " pool size=%d)\n", (void *)node, b_allocated,