Browse Source Download (without any required ccan dependencies)

Module:

lstack

Summary:

Simple, singly-linked-list stack implementation

Author:

David Gibson <david@gibson.dropbear.id.au>

Dependencies:

Description:

This code provides a simple implementation of the Stack abstract data type in terms of a singly linked list.

Example:

#include <ccan/lstack/lstack.h>

struct arg {
        const char *arg;
        struct lstack_link sl;
};

int main(int argc, char *argv[])
{
        int i;
        struct arg *a;
        LSTACK(struct arg, sl) argstack;

        for (i = 0; i < argc; i++) {
                a = malloc(sizeof(*a));
                a->arg = argv[i];
                lstack_push(&argstack, a);
        }

        printf("Command line arguments in reverse:\n");

        while (!lstack_empty(&argstack)) {
                a = lstack_pop(&argstack);
                printf("Argument: %s\n", a->arg);
                free(a);
        }

        return 0;
}

License:

BSD-MIT