Home | History | Annotate | Line # | Download | only in atc
list.c revision 1.6
      1  1.6    agc /*	$NetBSD: list.c,v 1.6 2003/08/07 09:36:54 agc Exp $	*/
      2  1.3    cgd 
      3  1.1    cgd /*-
      4  1.3    cgd  * Copyright (c) 1990, 1993
      5  1.3    cgd  *	The Regents of the University of California.  All rights reserved.
      6  1.1    cgd  *
      7  1.1    cgd  * This code is derived from software contributed to Berkeley by
      8  1.1    cgd  * Ed James.
      9  1.1    cgd  *
     10  1.1    cgd  * Redistribution and use in source and binary forms, with or without
     11  1.1    cgd  * modification, are permitted provided that the following conditions
     12  1.1    cgd  * are met:
     13  1.1    cgd  * 1. Redistributions of source code must retain the above copyright
     14  1.1    cgd  *    notice, this list of conditions and the following disclaimer.
     15  1.1    cgd  * 2. Redistributions in binary form must reproduce the above copyright
     16  1.1    cgd  *    notice, this list of conditions and the following disclaimer in the
     17  1.1    cgd  *    documentation and/or other materials provided with the distribution.
     18  1.6    agc  * 3. Neither the name of the University nor the names of its contributors
     19  1.1    cgd  *    may be used to endorse or promote products derived from this software
     20  1.1    cgd  *    without specific prior written permission.
     21  1.1    cgd  *
     22  1.1    cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     23  1.1    cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     24  1.1    cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     25  1.1    cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     26  1.1    cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     27  1.1    cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     28  1.1    cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     29  1.1    cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     30  1.1    cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     31  1.1    cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     32  1.1    cgd  * SUCH DAMAGE.
     33  1.1    cgd  */
     34  1.1    cgd 
     35  1.1    cgd /*
     36  1.1    cgd  * Copyright (c) 1987 by Ed James, UC Berkeley.  All rights reserved.
     37  1.1    cgd  *
     38  1.1    cgd  * Copy permission is hereby granted provided that this notice is
     39  1.1    cgd  * retained on all partial or complete copies.
     40  1.1    cgd  *
     41  1.1    cgd  * For more info on this and all of my stuff, mail edjames (at) berkeley.edu.
     42  1.1    cgd  */
     43  1.1    cgd 
     44  1.4  lukem #include <sys/cdefs.h>
     45  1.1    cgd #ifndef lint
     46  1.3    cgd #if 0
     47  1.3    cgd static char sccsid[] = "@(#)list.c	8.1 (Berkeley) 5/31/93";
     48  1.3    cgd #else
     49  1.6    agc __RCSID("$NetBSD: list.c,v 1.6 2003/08/07 09:36:54 agc Exp $");
     50  1.3    cgd #endif
     51  1.1    cgd #endif /* not lint */
     52  1.1    cgd 
     53  1.1    cgd #include "include.h"
     54  1.1    cgd 
     55  1.1    cgd PLANE	*
     56  1.1    cgd newplane()
     57  1.1    cgd {
     58  1.1    cgd 	return ((PLANE *) calloc(1, sizeof (PLANE)));
     59  1.1    cgd }
     60  1.1    cgd 
     61  1.4  lukem void
     62  1.1    cgd append(l, p)
     63  1.1    cgd 	LIST	*l;
     64  1.1    cgd 	PLANE	*p;
     65  1.1    cgd {
     66  1.1    cgd 	PLANE 	*q = NULL, *r = NULL;
     67  1.1    cgd 
     68  1.1    cgd 	if (l->head == NULL) {
     69  1.1    cgd 		p->next = p->prev = NULL;
     70  1.1    cgd 		l->head = l->tail = p;
     71  1.1    cgd 	} else {
     72  1.1    cgd 		q = l -> head;
     73  1.1    cgd 
     74  1.1    cgd 		while (q != NULL && q->plane_no < p->plane_no) {
     75  1.1    cgd 			r = q;
     76  1.1    cgd 			q = q -> next;
     77  1.1    cgd 		}
     78  1.1    cgd 
     79  1.1    cgd 		if (q) {
     80  1.1    cgd 			if (r) {
     81  1.1    cgd 				p->prev = r;
     82  1.1    cgd 				r->next = p;
     83  1.1    cgd 				p->next = q;
     84  1.1    cgd 				q->prev = p;
     85  1.1    cgd 			} else {
     86  1.1    cgd 				p->next = q;
     87  1.1    cgd 				p->prev = NULL;
     88  1.1    cgd 				q->prev = p;
     89  1.1    cgd 				l->head = p;
     90  1.1    cgd 			}
     91  1.1    cgd 		} else {
     92  1.1    cgd 			l->tail->next = p;
     93  1.1    cgd 			p->next = NULL;
     94  1.1    cgd 			p->prev = l->tail;
     95  1.1    cgd 			l->tail = p;
     96  1.1    cgd 		}
     97  1.1    cgd 	}
     98  1.1    cgd }
     99  1.1    cgd 
    100  1.4  lukem void
    101  1.1    cgd delete(l, p)
    102  1.1    cgd 	LIST	*l;
    103  1.1    cgd 	PLANE	*p;
    104  1.1    cgd {
    105  1.1    cgd 	if (l->head == NULL)
    106  1.5    wiz 		loser(p, "deleted a non-existent plane! Get help!");
    107  1.1    cgd 
    108  1.1    cgd 	if (l->head == p && l->tail == p)
    109  1.1    cgd 		l->head = l->tail = NULL;
    110  1.1    cgd 	else if (l->head == p) {
    111  1.1    cgd 		l->head = p->next;
    112  1.1    cgd 		l->head->prev = NULL;
    113  1.1    cgd 	} else if (l->tail == p) {
    114  1.1    cgd 		l->tail = p->prev;
    115  1.1    cgd 		l->tail->next = NULL;
    116  1.1    cgd 	} else {
    117  1.1    cgd 		p->prev->next = p->next;
    118  1.1    cgd 		p->next->prev = p->prev;
    119  1.1    cgd 	}
    120  1.1    cgd }
    121