1 /* ========================================================================== **
4 * Copyright (C) 1997 by Christopher R. Hertel
6 * Email: crh@ubiqx.mn.org
7 * -------------------------------------------------------------------------- **
8 * This module implements simple doubly-linked lists.
9 * -------------------------------------------------------------------------- **
11 * This library is free software; you can redistribute it and/or
12 * modify it under the terms of the GNU Library General Public
13 * License as published by the Free Software Foundation; either
14 * version 2 of the License, or (at your option) any later version.
16 * This library is distributed in the hope that it will be useful,
17 * but WITHOUT ANY WARRANTY; without even the implied warranty of
18 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
19 * Library General Public License for more details.
21 * You should have received a copy of the GNU Library General Public
22 * License along with this library; if not, write to the Free
23 * Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
25 * -------------------------------------------------------------------------- **
27 * $Log: ubi_dLinkList.c,v $
28 * Revision 1.1 1997/10/09 04:09:55 crh
29 * This is my library of lists and trees. My hope is to replace all of the
30 * hard coded linked lists that are currently used in Samba with calls to
31 * these modules. This should make the code simpler, smaller, and (I hope)
32 * faster. The tree code, in particular, should speed up processing where
33 * large lists are involved.
37 * Revision 0.2 1997/10/08 03:07:21 crh
38 * Fixed a few forgotten link-ups in Insert(), and fixed the AddHead()
39 * macro, which was passing the wrong value for <After> to Insert().
41 * Revision 0.1 1997/10/07 04:34:07 crh
45 * ========================================================================== **
48 #include "ubi_dLinkList.h"
50 /* ========================================================================== **
54 ubi_dlListPtr ubi_dlInitList( ubi_dlListPtr ListPtr )
55 /* ------------------------------------------------------------------------ **
56 * Initialize a doubly-linked list header.
58 * Input: ListPtr - A pointer to the list structure that is to be
59 * initialized for use.
61 * Output: A pointer to the initialized list header (i.e., same as
64 * ------------------------------------------------------------------------ **
71 } /* ubi_dlInitList */
73 ubi_dlNodePtr ubi_dlInsert( ubi_dlListPtr ListPtr,
76 /* ------------------------------------------------------------------------ **
77 * Insert a new node into the list.
79 * Input: ListPtr - A pointer to the list into which the node is to
81 * New - Pointer to the new node.
82 * After - NULL, or a pointer to a node that is already in the
84 * If NULL, then <New> will be added at the head of the
85 * list, else it will be added following <After>.
87 * Output: A pointer to the node that was inserted into the list (i.e.,
90 * ------------------------------------------------------------------------ **
95 New->Next = ListPtr->Head;
97 if( NULL != ListPtr->Head )
98 ListPtr->Head->Prev = New;
105 New->Next = After->Next;
107 if( NULL != After->Next )
108 After->Next->Prev = New;
119 ubi_dlNodePtr ubi_dlRemove( ubi_dlListPtr ListPtr, ubi_dlNodePtr Old )
120 /* ------------------------------------------------------------------------ **
121 * Remove a node from the list.
123 * Input: ListPtr - A pointer to the list from which <Old> is to be
125 * Old - A pointer to the node that is to be removed from the
128 * Output: A pointer to the node that was removed (i.e., <Old>).
130 * ------------------------------------------------------------------------ **
136 Old->Next->Prev = Old->Prev;
138 ListPtr->Tail = Old->Prev;
141 Old->Prev->Next = Old->Next;
143 ListPtr->Head = Old->Next;
152 /* ================================ The End ================================= */