VirtualBox

source: kBuild/branches/FREEBSD/src/kmk/lst.lib/lstInt.h@ 24

Last change on this file since 24 was 24, checked in by bird, 22 years ago

Import of RELENG_4_7_0_RELEASE

  • Property svn:eol-style set to native
  • Property svn:keywords set to Author Date Id Revision
File size: 3.9 KB
Line 
1/*
2 * Copyright (c) 1988, 1989, 1990, 1993
3 * The Regents of the University of California. All rights reserved.
4 *
5 * This code is derived from software contributed to Berkeley by
6 * Adam de Boor.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. All advertising materials mentioning features or use of this software
17 * must display the following acknowledgement:
18 * This product includes software developed by the University of
19 * California, Berkeley and its contributors.
20 * 4. Neither the name of the University nor the names of its contributors
21 * may be used to endorse or promote products derived from this software
22 * without specific prior written permission.
23 *
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 * SUCH DAMAGE.
35 *
36 * from: @(#)lstInt.h 8.1 (Berkeley) 6/6/93
37 * $FreeBSD: src/usr.bin/make/lst.lib/lstInt.h,v 1.7 1999/08/28 01:03:53 peter Exp $
38 */
39
40/*-
41 * lstInt.h --
42 * Internals for the list library
43 */
44#ifndef _LSTINT_H_
45#define _LSTINT_H_
46
47#include "make.h"
48#include "lst.h"
49
50typedef struct ListNode {
51 struct ListNode *prevPtr; /* previous element in list */
52 struct ListNode *nextPtr; /* next in list */
53 short useCount:8, /* Count of functions using the node.
54 * node may not be deleted until count
55 * goes to 0 */
56 flags:8; /* Node status flags */
57 ClientData datum; /* datum associated with this element */
58} *ListNode;
59/*
60 * Flags required for synchronization
61 */
62#define LN_DELETED 0x0001 /* List node should be removed when done */
63
64#define NilListNode ((ListNode)-1)
65
66typedef enum {
67 Head, Middle, Tail, Unknown
68} Where;
69
70typedef struct {
71 ListNode firstPtr; /* first node in list */
72 ListNode lastPtr; /* last node in list */
73 Boolean isCirc; /* true if the list should be considered
74 * circular */
75/*
76 * fields for sequential access
77 */
78 Where atEnd; /* Where in the list the last access was */
79 Boolean isOpen; /* true if list has been Lst_Open'ed */
80 ListNode curPtr; /* current node, if open. NilListNode if
81 * *just* opened */
82 ListNode prevPtr; /* Previous node, if open. Used by
83 * Lst_Remove */
84} *List;
85
86#define NilList ((List)-1)
87
88/*
89 * PAlloc (var, ptype) --
90 * Allocate a pointer-typedef structure 'ptype' into the variable 'var'
91 */
92#define PAlloc(var,ptype) var = (ptype) emalloc (sizeof (*var))
93
94/*
95 * LstValid (l) --
96 * Return TRUE if the list l is valid
97 */
98#define LstValid(l) (((Lst)l == NILLST) ? FALSE : TRUE)
99
100/*
101 * LstNodeValid (ln, l) --
102 * Return TRUE if the LstNode ln is valid with respect to l
103 */
104#define LstNodeValid(ln, l) ((((LstNode)ln) == NILLNODE) ? FALSE : TRUE)
105
106/*
107 * LstIsEmpty (l) --
108 * TRUE if the list l is empty.
109 */
110#define LstIsEmpty(l) (((List)l)->firstPtr == NilListNode)
111
112#endif /* _LSTINT_H_ */
Note: See TracBrowser for help on using the repository browser.

© 2024 Oracle Support Privacy / Do Not Sell My Info Terms of Use Trademark Policy Automated Access Etiquette