list.c revision 1.7 1 1.7 jmc /* $NetBSD: list.c,v 1.7 2005/07/01 00:48:34 jmc 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.7 jmc __RCSID("$NetBSD: list.c,v 1.7 2005/07/01 00:48:34 jmc 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.7 jmc PLANE *
56 1.7 jmc newplane(void)
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.7 jmc append(LIST *l, PLANE *p)
63 1.1 cgd {
64 1.1 cgd PLANE *q = NULL, *r = NULL;
65 1.1 cgd
66 1.1 cgd if (l->head == NULL) {
67 1.1 cgd p->next = p->prev = NULL;
68 1.1 cgd l->head = l->tail = p;
69 1.1 cgd } else {
70 1.1 cgd q = l -> head;
71 1.1 cgd
72 1.1 cgd while (q != NULL && q->plane_no < p->plane_no) {
73 1.1 cgd r = q;
74 1.1 cgd q = q -> next;
75 1.1 cgd }
76 1.1 cgd
77 1.1 cgd if (q) {
78 1.1 cgd if (r) {
79 1.1 cgd p->prev = r;
80 1.1 cgd r->next = p;
81 1.1 cgd p->next = q;
82 1.1 cgd q->prev = p;
83 1.1 cgd } else {
84 1.1 cgd p->next = q;
85 1.1 cgd p->prev = NULL;
86 1.1 cgd q->prev = p;
87 1.1 cgd l->head = p;
88 1.1 cgd }
89 1.1 cgd } else {
90 1.1 cgd l->tail->next = p;
91 1.1 cgd p->next = NULL;
92 1.1 cgd p->prev = l->tail;
93 1.1 cgd l->tail = p;
94 1.1 cgd }
95 1.1 cgd }
96 1.1 cgd }
97 1.1 cgd
98 1.4 lukem void
99 1.7 jmc delete(LIST *l, PLANE *p)
100 1.1 cgd {
101 1.1 cgd if (l->head == NULL)
102 1.5 wiz loser(p, "deleted a non-existent plane! Get help!");
103 1.1 cgd
104 1.1 cgd if (l->head == p && l->tail == p)
105 1.1 cgd l->head = l->tail = NULL;
106 1.1 cgd else if (l->head == p) {
107 1.1 cgd l->head = p->next;
108 1.1 cgd l->head->prev = NULL;
109 1.1 cgd } else if (l->tail == p) {
110 1.1 cgd l->tail = p->prev;
111 1.1 cgd l->tail->next = NULL;
112 1.1 cgd } else {
113 1.1 cgd p->prev->next = p->next;
114 1.1 cgd p->next->prev = p->prev;
115 1.1 cgd }
116 1.1 cgd }
117