slist              58 ltdl/libltdl/slist.h   struct slist *next;		/* chain forward pointer*/
slist              67 ltdl/libltdl/slist.h LT_SCOPE SList *slist_cons	(SList *item, SList *slist);
slist              69 ltdl/libltdl/slist.h LT_SCOPE SList *slist_delete	(SList *slist, void (*delete_fct) (void *item));
slist              72 ltdl/libltdl/slist.h LT_SCOPE SList *slist_reverse	(SList *slist);
slist              73 ltdl/libltdl/slist.h LT_SCOPE SList *slist_sort	(SList *slist, SListCompare *compare,
slist              76 ltdl/libltdl/slist.h LT_SCOPE SList *slist_tail	(SList *slist);
slist              77 ltdl/libltdl/slist.h LT_SCOPE SList *slist_nth	(SList *slist, size_t n);
slist              78 ltdl/libltdl/slist.h LT_SCOPE void *	slist_find	(SList *slist, SListCallback *find,
slist              80 ltdl/libltdl/slist.h LT_SCOPE size_t slist_length	(SList *slist);
slist              82 ltdl/libltdl/slist.h LT_SCOPE void *	slist_foreach   (SList *slist, SListCallback *foreach,
slist             124 ltdl/slist.c     for (; slist; slist = slist->next)
slist             126 ltdl/slist.c         result = (*find) (slist, matchdata);
slist             172 ltdl/slist.c         return slist;
slist             177 ltdl/slist.c     item->next = slist;
slist             185 ltdl/slist.c     return slist ? slist->next : NULL;
slist             196 ltdl/slist.c     for (;n > 1 && slist; n--)
slist             197 ltdl/slist.c       slist = slist->next;
slist             199 ltdl/slist.c     return slist;
slist             209 ltdl/slist.c     for (n = 0; slist; ++n)
slist             210 ltdl/slist.c       slist = slist->next;
slist             228 ltdl/slist.c     while (slist)
slist             230 ltdl/slist.c         next		= slist->next;
slist             231 ltdl/slist.c         slist->next	= result;
slist             232 ltdl/slist.c         result		= slist;
slist             233 ltdl/slist.c         slist 		= next;
slist             248 ltdl/slist.c     while (slist)
slist             250 ltdl/slist.c         SList *next = slist->next;
slist             251 ltdl/slist.c         result = (*foreach) (slist, userdata);
slist             256 ltdl/slist.c         slist = next;
slist             311 ltdl/slist.c     if (!slist)
slist             312 ltdl/slist.c       return slist;
slist             315 ltdl/slist.c     left = slist;
slist             316 ltdl/slist.c     right = slist->next;
slist             327 ltdl/slist.c         slist = slist->next;
slist             329 ltdl/slist.c     right = slist->next;
slist             330 ltdl/slist.c     slist->next = 0;