1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
|
/* Copyright (c) 2007,2009, UNINETT AS */
/* See LICENSE for licensing information. */
#ifndef _LIST_H
#define _LIST_H
#include <stdint.h>
struct list_node {
struct list_node *next;
void *data;
};
struct list {
struct list_node *first, *last;
uint32_t count;
};
/* allocates and initialises list structure; returns NULL if malloc fails */
struct list *list_create(void);
/* frees all memory associated with the list */
void list_destroy(struct list *list);
/* frees memory allocated for the list itself */
void list_free(struct list *list);
/* appends entry to list; returns 1 if ok, 0 if malloc fails */
int list_push(struct list *list, void *data);
/* insert entry at front of the list; returns 1 if ok, 0 if malloc fails */
int list_push_front(struct list *list, void *data);
/* removes first entry from list and returns data */
void *list_shift(struct list *list);
/* removes all entries with matching data pointer */
void list_removedata(struct list *list, void *data);
/* 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);
/* returns number of nodes */
uint32_t list_count(struct list *list);
#endif /*_LIST_H*/
/* Local Variables: */
/* c-file-style: "stroustrup" */
/* End: */
|
