list.h 1.38 KB
Newer Older
1
/*
venaas's avatar
venaas committed
2
 * Copyright (C) 2006-2009 Stig Venaas <venaas@uninett.no>
3 4 5 6 7 8
 *
 * Permission to use, copy, modify, and distribute this software for any
 * purpose with or without fee is hereby granted, provided that the above
 * copyright notice and this permission notice appear in all copies.
 */

venaas's avatar
venaas committed
9 10 11 12 13 14
#ifdef SYS_SOLARIS9
#include <sys/inttypes.h>
#else
#include <stdint.h>
#endif

15 16 17 18 19 20 21
struct list_node {
    struct list_node *next;
    void *data;
};

struct list {
    struct list_node *first, *last;
venaas's avatar
venaas committed
22
    uint32_t count;
23 24 25 26 27 28 29 30
};

/* allocates and initialises list structure; returns NULL if malloc fails */
struct list *list_create();

/* frees all memory associated with the list */
void list_destroy(struct list *list);

31 32 33
/* frees memory allocated for the list itself */
void list_free(struct list *list);

34
/* appends entry to list; returns 1 if ok, 0 if malloc fails */
35 36 37 38
int list_push(struct list *list, void *data);

/* removes first entry from list and returns data */
void *list_shift(struct list *list);
39

40 41
/* removes first entry with matching data pointer */
void list_removedata(struct list *list, void *data);
42

43 44 45 46 47
/* returns first node */
struct list_node *list_first(struct list *list);

/* returns the next node after the argument */
struct list_node *list_next(struct list_node *node);
venaas's avatar
venaas committed
48 49 50

/* returns number of nodes */
uint32_t list_count(struct list *list);
51 52 53 54

/* Local Variables: */
/* c-file-style: "stroustrup" */
/* End: */