From: Christopher R. Hertel Date: Wed, 15 Oct 1997 17:59:58 +0000 (+0000) Subject: Added ubi_sLinkList module which manages simple singly-linked lists. X-Git-Url: http://git.samba.org/samba.git/?p=kai%2Fsamba.git;a=commitdiff_plain;h=5619b53921aca62fea163399fd0ca1915e50cc11 Added ubi_sLinkList module which manages simple singly-linked lists. (This used to be commit e55a3dc94a824b61a7123b080705be2271268ee4) --- diff --git a/source3/ubiqx/Makefile b/source3/ubiqx/Makefile index 16fb454e77d..369f7762bfe 100644 --- a/source3/ubiqx/Makefile +++ b/source3/ubiqx/Makefile @@ -6,7 +6,8 @@ .SUFFIXES: .SUFFIXES: .c .o .h -all: ubi_AVLtree.o ubi_BinTree.o ubi_SplayTree.o ubi_dLinkList.o +all: ubi_AVLtree.o ubi_BinTree.o ubi_SplayTree.o \ + ubi_dLinkList.o ubi_sLinkList.o ubi_BinTree.o: ubi_BinTree.h @echo Compiling $*.c @@ -24,6 +25,10 @@ ubi_dLinkList.o: ubi_dLinkList.h @echo Compiling $*.c @$(CC) $(CFLAGS) -c $*.c +ubi_sLinkList.o: ubi_sLinkList.h + @echo Compiling $*.c + @$(CC) $(CFLAGS) -c $*.c + .c.o: @echo Compiling $*.c @$(CC) $(CFLAGS) -c $*.c diff --git a/source3/ubiqx/ubi_sLinkList.c b/source3/ubiqx/ubi_sLinkList.c new file mode 100644 index 00000000000..03694f4f9c7 --- /dev/null +++ b/source3/ubiqx/ubi_sLinkList.c @@ -0,0 +1,102 @@ +/* ========================================================================== ** + * ubi_sLinkList.c + * + * Copyright (C) 1997 by Christopher R. Hertel + * + * Email: crh@ubiqx.mn.org + * -------------------------------------------------------------------------- ** + * This module implements a really simple singly-linked list. + * -------------------------------------------------------------------------- ** + * + * This library is free software; you can redistribute it and/or + * modify it under the terms of the GNU Library General Public + * License as published by the Free Software Foundation; either + * version 2 of the License, or (at your option) any later version. + * + * This library is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + * Library General Public License for more details. + * + * You should have received a copy of the GNU Library General Public + * License along with this library; if not, write to the Free + * Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. + * + * -------------------------------------------------------------------------- ** + * + * $Log: ubi_sLinkList.c,v $ + * Revision 1.1 1997/10/15 17:59:58 crh + * Added ubi_sLinkList module which manages simple singly-linked lists. + * + * ========================================================================== ** + */ + +#include "ubi_sLinkList.h" + +/* ========================================================================== ** + * Functions... + */ + +ubi_slListPtr ubi_slInitList( ubi_slListPtr ListPtr ) + /* ------------------------------------------------------------------------ ** + * Initialize a singly-linked list header. + * + * Input: ListPtr - A pointer to the list structure that is to be + * initialized for use. + * + * Output: A pointer to the initialized list header (i.e., same as + * ). + * + * ------------------------------------------------------------------------ ** + */ + { + ListPtr->Head = NULL; + ListPtr->count = 0; + return( ListPtr ); + } /* ubi_slInitList */ + +ubi_slNodePtr ubi_slInsert( ubi_slListPtr ListPtr, + ubi_slNodePtr New ) + /* ------------------------------------------------------------------------ ** + * Insert a new node at the head of the list. + * + * Input: ListPtr - A pointer to the list into which the node is to + * be inserted. + * New - Pointer to the node that is to be added to the list. + * + * Output: A pointer to the node that was inserted into the list (i.e., + * the same as ). + * + * ------------------------------------------------------------------------ ** + */ + { + New->Next = ListPtr->Head; + ListPtr->Head = New; + ++(ListPtr->count); + return( New ); + } /* ubi_slInsert */ + +ubi_slNodePtr ubi_slRemove( ubi_slListPtr ListPtr ) + /* ------------------------------------------------------------------------ ** + * Remove a node from the head of the list. + * + * Input: ListPtr - A pointer to the list from which the node is to be + * removed. + * + * Output: A pointer to the node that was removed. + * + * ------------------------------------------------------------------------ ** + */ + { + ubi_slNodePtr Old = ListPtr->Head; + + if( NULL != Old ) + { + ListPtr->Head = Old->Next; + --(ListPtr->count); + } + return( Old ); + } /* ubi_slRemove */ + + +/* ================================ The End ================================= */ diff --git a/source3/ubiqx/ubi_sLinkList.h b/source3/ubiqx/ubi_sLinkList.h new file mode 100644 index 00000000000..80050e41271 --- /dev/null +++ b/source3/ubiqx/ubi_sLinkList.h @@ -0,0 +1,133 @@ +#ifndef ubi_sLinkList_H +#define ubi_sLinkList_H +/* ========================================================================== ** + * ubi_sLinkList.h + * + * Copyright (C) 1997 by Christopher R. Hertel + * + * Email: crh@ubiqx.mn.org + * -------------------------------------------------------------------------- ** + * This module implements a really simple singly-linked list. + * -------------------------------------------------------------------------- ** + * + * This library is free software; you can redistribute it and/or + * modify it under the terms of the GNU Library General Public + * License as published by the Free Software Foundation; either + * version 2 of the License, or (at your option) any later version. + * + * This library is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + * Library General Public License for more details. + * + * You should have received a copy of the GNU Library General Public + * License along with this library; if not, write to the Free + * Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. + * + * -------------------------------------------------------------------------- ** + * + * $Log: ubi_sLinkList.h,v $ + * Revision 1.1 1997/10/15 17:59:58 crh + * Added ubi_sLinkList module which manages simple singly-linked lists. + * + * ========================================================================== ** + */ + +#include + + +/* ========================================================================== ** + * Typedefs... + * + * ubi_slNode - This is the basic node structure. + * ubi_slNodePtr - Pointer to a node. + * ubi_slList - This is the list header structure. + * ubi_slListPtr - Pointer to a List (i.e., a list header structure). + * + */ + +typedef struct ubi_slListNode + { + struct ubi_slListNode *Next; + } ubi_slNode; + +typedef ubi_slNode *ubi_slNodePtr; + +typedef struct + { + ubi_slNodePtr Head; + unsigned long count; + } ubi_slList; + +typedef ubi_slList *ubi_slListPtr; + +/* ========================================================================== ** + * Macros... + * + * ubi_slAddHead - Add a new node at the head of the list. + * ubi_slRemHead - Remove the node at the head of the list, if any. + * ubi_slFirst - Return a pointer to the first node in the list, if any. + * ubi_slNext - Given a node, return a pointer to the next node. + * + * Note that all of these provide type casting of the parameters. The + * Add and Rem macros are nothing more than nice front-ends to the + * Insert and Remove operations. + * + */ + +#define ubi_slAddHead( L, N ) \ + ubi_slInsert( (ubi_slListPtr)(L), (ubi_slNodePtr)(N) ) + +#define ubi_slRemHead( L ) ubi_slRemove( (ubi_slListPtr)(L) ) + +#define ubi_slFirst( L ) (((ubi_slListPtr)(L))->Head) + +#define ubi_slNext( N ) (((ubi_slNodePtr)(N))->Next) + + +/* ========================================================================== ** + * Function prototypes... + */ + +ubi_slListPtr ubi_slInitList( ubi_slListPtr ListPtr ); + /* ------------------------------------------------------------------------ ** + * Initialize a singly-linked list header. + * + * Input: ListPtr - A pointer to the list structure that is to be + * initialized for use. + * + * Output: A pointer to the initialized list header (i.e., same as + * ). + * + * ------------------------------------------------------------------------ ** + */ + +ubi_slNodePtr ubi_slInsert( ubi_slListPtr ListPtr, + ubi_slNodePtr New ); + /* ------------------------------------------------------------------------ ** + * Insert a new node at the head of the list. + * + * Input: ListPtr - A pointer to the list into which the node is to + * be inserted. + * New - Pointer to the node that is to be added to the list. + * + * Output: A pointer to the node that was inserted into the list (i.e., + * the same as ). + * + * ------------------------------------------------------------------------ ** + */ + +ubi_slNodePtr ubi_slRemove( ubi_slListPtr ListPtr ); + /* ------------------------------------------------------------------------ ** + * Remove a node from the head of the list. + * + * Input: ListPtr - A pointer to the list from which the node is to be + * removed. + * + * Output: A pointer to the node that was removed. + * + * ------------------------------------------------------------------------ ** + */ + +/* ================================ The End ================================= */ +#endif /* ubi_sLinkList_H */