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