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/10 14:46:43 crh
29 * This is the ubiqx binary tree and linked list library.
30 * This library is being included as part of the Samba distribution.
33 * Revision 0.1 1997/10/07 04:34:07 crh
37 * ========================================================================== **
40 #include "ubi_dLinkList.h"
42 /* ========================================================================== **
46 ubi_dlListPtr ubi_dlInitList( ubi_dlListPtr ListPtr )
47 /* ------------------------------------------------------------------------ **
48 * Initialize a doubly-linked list header.
50 * Input: ListPtr - A pointer to the list structure that is to be
51 * initialized for use.
53 * Output: A pointer to the initialized list header (i.e., same as
56 * ------------------------------------------------------------------------ **
63 } /* ubi_dlInitList */
65 ubi_dlNodePtr ubi_dlInsert( ubi_dlListPtr ListPtr,
68 /* ------------------------------------------------------------------------ **
69 * Insert a new node into the list.
71 * Input: ListPtr - A pointer to the list into which the node is to
73 * New - Pointer to the new node.
74 * After - NULL, or a pointer to a node that is already in the
76 * If NULL, then <New> will be added at the head of the
77 * list, else it will be added following <After>.
79 * Output: A pointer to the node that was inserted into the list (i.e.,
82 * ------------------------------------------------------------------------ **
87 New->Next = ListPtr->Head;
89 if( NULL != ListPtr->Head )
90 ListPtr->Head->Prev = New;
97 New->Next = After->Next;
99 if( NULL != After->Next )
100 After->Next->Prev = New;
111 ubi_dlNodePtr ubi_dlRemove( ubi_dlListPtr ListPtr, ubi_dlNodePtr Old )
112 /* ------------------------------------------------------------------------ **
113 * Remove a node from the list.
115 * Input: ListPtr - A pointer to the list from which <Old> is to be
117 * Old - A pointer to the node that is to be removed from the
120 * Output: A pointer to the node that was removed (i.e., <Old>).
122 * ------------------------------------------------------------------------ **
128 Old->Next->Prev = Old->Prev;
130 ListPtr->Tail = Old->Prev;
133 Old->Prev->Next = Old->Next;
135 ListPtr->Head = Old->Next;
144 /* ================================ The End ================================= */