blob: 5492615bc0765f382e1be0a40c6abcaf5dc5cf26 (
plain)
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
54
55
56
57
58
59
60
61
62
63
|
/**
** @file list.c
**
** @author Warren R. Carithers
**
** @brief Support for a basic linked list data type.
**
** This module provides a very basic linked list data structure.
** A list can contain anything that has a pointer field in the first
** four bytes; these routines assume those bytes contain a pointer to
** the following entry in the list, whatever that may be.
*/
#define KERNEL_SRC
#include <common.h>
#include <list.h>
/*
** FUNCTIONS
*/
/**
** Name: list_add
**
** Add the supplied data to the beginning of the specified list.
**
** @param[in,out] list The address of a list_t variable
** @param[in] data The data to prepend to the list
*/
void list_add(list_t *list, void *data)
{
// sanity checks
assert1(list != NULL);
assert1(data != NULL);
list_t *tmp = (list_t *)data;
tmp->next = list->next;
list->next = tmp;
}
/**
** Name: list_remove
**
** Remove the first entry from a linked list.
**
** @param[in,out] list The address of a list_t variable
**
** @return a pointer to the removed data, or NULL if the list was empty
*/
void *list_remove(list_t *list)
{
assert1(list != NULL);
list_t *data = list->next;
if (data != NULL) {
list->next = data->next;
data->next = NULL;
}
return (void *)data;
}
|
