17c478bd9Sstevel@tonic-gate /*
27c478bd9Sstevel@tonic-gate * CDDL HEADER START
37c478bd9Sstevel@tonic-gate *
47c478bd9Sstevel@tonic-gate * The contents of this file are subject to the terms of the
50ea5e3a5Sjjj * Common Development and Distribution License (the "License").
60ea5e3a5Sjjj * You may not use this file except in compliance with the License.
77c478bd9Sstevel@tonic-gate *
87c478bd9Sstevel@tonic-gate * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
97c478bd9Sstevel@tonic-gate * or http://www.opensolaris.org/os/licensing.
107c478bd9Sstevel@tonic-gate * See the License for the specific language governing permissions
117c478bd9Sstevel@tonic-gate * and limitations under the License.
127c478bd9Sstevel@tonic-gate *
137c478bd9Sstevel@tonic-gate * When distributing Covered Code, include this CDDL HEADER in each
147c478bd9Sstevel@tonic-gate * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
157c478bd9Sstevel@tonic-gate * If applicable, add the following below this CDDL HEADER, with the
167c478bd9Sstevel@tonic-gate * fields enclosed by brackets "[]" replaced with your own identifying
177c478bd9Sstevel@tonic-gate * information: Portions Copyright [yyyy] [name of copyright owner]
187c478bd9Sstevel@tonic-gate *
197c478bd9Sstevel@tonic-gate * CDDL HEADER END
207c478bd9Sstevel@tonic-gate */
217c478bd9Sstevel@tonic-gate /*
220ea5e3a5Sjjj * Copyright 2006 Sun Microsystems, Inc. All rights reserved.
230ea5e3a5Sjjj * Use is subject to license terms.
247c478bd9Sstevel@tonic-gate */
257c478bd9Sstevel@tonic-gate
267c478bd9Sstevel@tonic-gate #include <pthread.h>
277c478bd9Sstevel@tonic-gate #include <malloc.h>
287c478bd9Sstevel@tonic-gate #include <memory.h>
297c478bd9Sstevel@tonic-gate #include <assert.h>
307c478bd9Sstevel@tonic-gate #include <poll.h>
317c478bd9Sstevel@tonic-gate #include <stdio.h>
327c478bd9Sstevel@tonic-gate #include "llt.h"
33*61d32c33SToomas Soome
347c478bd9Sstevel@tonic-gate void
ll_init(llh_t * head)357c478bd9Sstevel@tonic-gate ll_init(llh_t *head)
367c478bd9Sstevel@tonic-gate {
377c478bd9Sstevel@tonic-gate head->back = &head->front;
387c478bd9Sstevel@tonic-gate head->front = NULL;
397c478bd9Sstevel@tonic-gate }
40*61d32c33SToomas Soome
417c478bd9Sstevel@tonic-gate void
ll_enqueue(llh_t * head,ll_t * data)427c478bd9Sstevel@tonic-gate ll_enqueue(llh_t *head, ll_t *data)
437c478bd9Sstevel@tonic-gate {
447c478bd9Sstevel@tonic-gate data->n = NULL;
457c478bd9Sstevel@tonic-gate *head->back = data;
467c478bd9Sstevel@tonic-gate head->back = &data->n;
477c478bd9Sstevel@tonic-gate }
48*61d32c33SToomas Soome
497c478bd9Sstevel@tonic-gate /*
507c478bd9Sstevel@tonic-gate * apply the function func to every element of the ll in sequence. Can
517c478bd9Sstevel@tonic-gate * be used to free up the element, so "n" is computed before func is
527c478bd9Sstevel@tonic-gate * called on it.
537c478bd9Sstevel@tonic-gate */
547c478bd9Sstevel@tonic-gate void
ll_mapf(llh_t * head,void (* func)(void *))557c478bd9Sstevel@tonic-gate ll_mapf(llh_t *head, void (*func)(void *))
567c478bd9Sstevel@tonic-gate {
577c478bd9Sstevel@tonic-gate ll_t *t = head->front;
587c478bd9Sstevel@tonic-gate ll_t *n;
597c478bd9Sstevel@tonic-gate
607c478bd9Sstevel@tonic-gate while (t) {
617c478bd9Sstevel@tonic-gate n = t->n;
627c478bd9Sstevel@tonic-gate func(t);
637c478bd9Sstevel@tonic-gate t = n;
647c478bd9Sstevel@tonic-gate }
657c478bd9Sstevel@tonic-gate }
66*61d32c33SToomas Soome
677c478bd9Sstevel@tonic-gate ll_t *
ll_peek(llh_t * head)687c478bd9Sstevel@tonic-gate ll_peek(llh_t *head)
697c478bd9Sstevel@tonic-gate {
707c478bd9Sstevel@tonic-gate return (head->front);
717c478bd9Sstevel@tonic-gate }
72*61d32c33SToomas Soome
737c478bd9Sstevel@tonic-gate ll_t *
ll_dequeue(llh_t * head)747c478bd9Sstevel@tonic-gate ll_dequeue(llh_t *head)
757c478bd9Sstevel@tonic-gate {
767c478bd9Sstevel@tonic-gate ll_t *ptr;
777c478bd9Sstevel@tonic-gate ptr = head->front;
787c478bd9Sstevel@tonic-gate if (ptr && ((head->front = ptr->n) == NULL))
797c478bd9Sstevel@tonic-gate head->back = &head->front;
807c478bd9Sstevel@tonic-gate return (ptr);
817c478bd9Sstevel@tonic-gate }
82*61d32c33SToomas Soome
837c478bd9Sstevel@tonic-gate ll_t *
ll_traverse(llh_t * ptr,int (* func)(void *,void *),void * user)847c478bd9Sstevel@tonic-gate ll_traverse(llh_t *ptr, int (*func)(void *, void *), void *user)
857c478bd9Sstevel@tonic-gate {
867c478bd9Sstevel@tonic-gate ll_t *t;
877c478bd9Sstevel@tonic-gate ll_t **prev = &ptr->front;
887c478bd9Sstevel@tonic-gate
897c478bd9Sstevel@tonic-gate t = ptr->front;
907c478bd9Sstevel@tonic-gate while (t) {
917c478bd9Sstevel@tonic-gate switch (func(t, user)) {
927c478bd9Sstevel@tonic-gate case 1:
937c478bd9Sstevel@tonic-gate return (NULL);
947c478bd9Sstevel@tonic-gate case 0:
957c478bd9Sstevel@tonic-gate prev = &(t->n);
967c478bd9Sstevel@tonic-gate t = t->n;
977c478bd9Sstevel@tonic-gate break;
987c478bd9Sstevel@tonic-gate case -1:
997c478bd9Sstevel@tonic-gate if ((*prev = t->n) == NULL)
1007c478bd9Sstevel@tonic-gate ptr->back = prev;
1017c478bd9Sstevel@tonic-gate return (t);
1027c478bd9Sstevel@tonic-gate }
1037c478bd9Sstevel@tonic-gate }
1047c478bd9Sstevel@tonic-gate return (NULL);
1057c478bd9Sstevel@tonic-gate }
106*61d32c33SToomas Soome
1077c478bd9Sstevel@tonic-gate /* Make sure the list isn't corrupt and returns number of list items */
1087c478bd9Sstevel@tonic-gate int
ll_check(llh_t * head)1097c478bd9Sstevel@tonic-gate ll_check(llh_t *head)
1107c478bd9Sstevel@tonic-gate {
1117c478bd9Sstevel@tonic-gate int i = 0;
1127c478bd9Sstevel@tonic-gate ll_t *ptr = head->front;
113*61d32c33SToomas Soome #ifndef NDEBUG
1147c478bd9Sstevel@tonic-gate ll_t **prev = &head->front;
115*61d32c33SToomas Soome #endif
1167c478bd9Sstevel@tonic-gate
1177c478bd9Sstevel@tonic-gate while (ptr) {
1187c478bd9Sstevel@tonic-gate i++;
119*61d32c33SToomas Soome #ifndef NDEBUG
1207c478bd9Sstevel@tonic-gate prev = &ptr->n;
121*61d32c33SToomas Soome #endif
1227c478bd9Sstevel@tonic-gate ptr = ptr->n;
1237c478bd9Sstevel@tonic-gate }
1247c478bd9Sstevel@tonic-gate assert(head->back == prev);
1257c478bd9Sstevel@tonic-gate return (i);
1267c478bd9Sstevel@tonic-gate }
127