#include #include #include #include /* * slist macro usage examples by Peter Werner * * please see http://www.ifost.org.au/~peterw/queue.html for more info */ /* * our struct definition, with the slist element */ struct foo { int f_a; char f_b; SLIST_ENTRY(foo) f_link; }; /* * the head of our list of struct foo's (see the manpage for more info) */ SLIST_HEAD(, foo) list; struct foo *alloc_foo(int a, char b); int main(void) { struct foo *fp; SLIST_INIT(&list); /* * insert the elements, note the use of the f_link item */ fp = alloc_foo(1, 'a'); SLIST_INSERT_HEAD(&list, fp, f_link); fp = alloc_foo(2, 'b'); SLIST_INSERT_HEAD(&list, fp, f_link); fp = alloc_foo(3, 'c'); SLIST_INSERT_HEAD(&list, fp, f_link); /* * loop through the list */ for (fp = SLIST_FIRST(&list); fp != NULL; fp = SLIST_NEXT(fp, f_link)) printf("%d %c\n", fp->f_a, fp->f_b); /* * another way of looping */ SLIST_FOREACH(fp, &list, f_link) printf("%d %c\n", fp->f_a, fp->f_b); /* * free up our list */ while (!SLIST_EMPTY(&list)) { fp = SLIST_FIRST(&list); SLIST_REMOVE_HEAD(&list, f_link); free(fp); } /* * make sure */ if (SLIST_EMPTY(&list)) printf("List is empty!\n"); else printf("List not empty!\n"); return(0); } struct foo * alloc_foo(int a, char b) { struct foo *tmp; tmp = (struct foo *)malloc(sizeof(struct foo)); if (tmp == NULL) err(1, "malloc"); tmp->f_a = a; tmp->f_b = b; return(tmp); }