mirror of
git://git.savannah.gnu.org/libtool.git
synced 2025-02-05 14:40:42 +08:00
cae83b341b
upstream. Mostly comments, formal item boxing, a sort function, and const madness reduction. (slist_new): Removed. (slist_box, slist_unbox, slist_sort): New. (SListCompare, SListCallback): Swapped! (slist_remove, slist_find): Change order of parameters for orthogonality with slist_foreach. Changed all callers. * libltdl/lt_dlloader.c (loader_cmp): Renamed to... (loader_callback): ...this. Return boxed item. (lt_dlloader_remove): Adjust to new loader_callback semantics; unbox each removed item before returning. Remove unused variable. Remove const from name parameter, since the slist API cannot guarantee userdata const-ancy for its callback functions. (lt_dlloader_find): Adjust to new loader_callback semantics; need to return the contents of the boxed item. Remove const from name parameter, since the slist API cannot guarantee userdata const-ancy for its callback functions. * libltdl/lt_dlloader.h (lt_dlloader_find, lt_dlloader_remove): Adjust to new constless footprint. * libltdl/ltdl.c (ltdl_exit): The global `loaders' list is changed variable `loader' is invalidated. Since some loaders may be resident modules that cannot be unloaded (though we have none yet), we must save each `next' address before calling `lt_dlloader_remove'. * NEWS: Updated. * THANKS: Added Ralf.
82 lines
2.8 KiB
C
82 lines
2.8 KiB
C
/* slist.h -- generalised singly linked lists
|
|
Copyright (C) 2000, 2004 Free Software Foundation, Inc.
|
|
Written by Gary V. Vaughan <gary@gnu.org>
|
|
|
|
NOTE: The canonical source of this file is maintained with the
|
|
GNU Libtool package. Report bugs to bug-libtool@gnu.org.
|
|
|
|
This library is free software; you can redistribute it and/or
|
|
modify it under the terms of the GNU Lesser General Public
|
|
License as published by the Free Software Foundation; either
|
|
version 2 of the License, or (at your option) any later version.
|
|
|
|
As a special exception to the GNU Lesser General Public License,
|
|
if you distribute this file as part of a program or library that
|
|
is built using GNU libtool, you may include it under the same
|
|
distribution terms that you use for the rest of that program.
|
|
|
|
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
|
|
Lesser General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public
|
|
License along with this library; if not, write to the Free Software
|
|
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
|
|
02111-1307 USA
|
|
|
|
*/
|
|
|
|
/* A generalised list. This is deliberately transparent so that you
|
|
can make the NEXT field of all your chained data structures first,
|
|
and then cast them to `(SList *)' so that they can be manipulated
|
|
by this API.
|
|
|
|
Alternatively, you can generate raw SList elements using slist_new(),
|
|
and put the element data in the USERDATA field. Either way you
|
|
get to manage the memory involved by yourself.
|
|
*/
|
|
|
|
#if !defined(SLIST_H)
|
|
#define SLIST_H 1
|
|
|
|
#include <libltdl/lt_system.h>
|
|
|
|
|
|
LT_BEGIN_C_DECLS
|
|
|
|
typedef struct slist {
|
|
struct slist *next; /* chain forward pointer*/
|
|
const void *userdata; /* for boxed `SList' item */
|
|
} SList;
|
|
|
|
typedef void * SListCallback (SList *item, void *userdata);
|
|
typedef int SListCompare (const SList *item1, const SList *item2,
|
|
void *userdata);
|
|
|
|
LT_SCOPE SList *slist_concat (SList *head, SList *tail);
|
|
LT_SCOPE SList *slist_cons (SList *item, SList *slist);
|
|
|
|
LT_SCOPE SList *slist_delete (SList *slist, void (*delete) (void *item));
|
|
LT_SCOPE void * slist_remove (SList **phead, SListCallback *find,
|
|
void *matchdata);
|
|
LT_SCOPE SList *slist_reverse (SList *slist);
|
|
LT_SCOPE SList *slist_sort (SList *slist, SListCompare *compare,
|
|
void *userdata);
|
|
|
|
LT_SCOPE SList *slist_tail (SList *slist);
|
|
LT_SCOPE SList *slist_nth (SList *slist, size_t n);
|
|
LT_SCOPE void * slist_find (SList *slist, SListCallback *find,
|
|
void *matchdata);
|
|
LT_SCOPE size_t slist_length (SList *slist);
|
|
|
|
LT_SCOPE void * slist_foreach (SList *slist, SListCallback *foreach,
|
|
void *userdata);
|
|
|
|
LT_SCOPE SList *slist_box (const void *userdata);
|
|
LT_SCOPE void * slist_unbox (SList *item);
|
|
|
|
LT_END_C_DECLS
|
|
|
|
#endif /*!defined(SLIST_H)*/
|