191 	void **mq_items;	/* Array of items to process */  member
227 	if (mqp->mq_items != NULL)  in mergeq_fini()
228 		mergeq_free(mqp->mq_items, sizeof (void *) * mqp->mq_cap);  in mergeq_fini()
249 	mqp->mq_items = mergeq_alloc(sizeof (void *) * MERGEQ_DEFAULT_CAP);  in mergeq_init()
250 	if (mqp->mq_items == NULL) {  in mergeq_init()
254 	bzero(mqp->mq_items, sizeof (void *) * MERGEQ_DEFAULT_CAP);  in mergeq_init()
261 			mergeq_free(mqp->mq_items, sizeof (void *) *  in mergeq_init()
274 		mergeq_free(mqp->mq_items, sizeof (void *) *  in mergeq_init()
286 		mergeq_free(mqp->mq_items, sizeof (void *) *  in mergeq_init()
303 		bzero(mqp->mq_items, sizeof (void *) * mqp->mq_cap);  in mergeq_reset()
335 	bcopy(mqp->mq_items, items, mqp->mq_cap * sizeof (void *));  in mergeq_grow()
336 	mergeq_free(mqp->mq_items, sizeof (mqp->mq_cap) * sizeof (void *));  in mergeq_grow()
337 	mqp->mq_items = items;  in mergeq_grow()
359 	mqp->mq_items[mqp->mq_next] = item;  in mergeq_add()
411 	mqp->mq_items[slot] = item;  in mergeq_push()
433 	out = mqp->mq_items[mqp->mq_nproc];  in mergeq_pop_one()
435 	mqp->mq_items[mqp->mq_nproc] = NULL;  in mergeq_pop_one()