blob: c011cb31c9cfda3e4bd537e00a116cf895928d71 (
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
64
65
|
/*
* Rune Game Engine
* Copyright 2024 Danny Holman <dholman@gymli.org>
*
* This software is provided 'as-is', without any express or implied
* warranty. In no event will the authors be held liable for any damages
* arising from the use of this software.
*
* Permission is granted to anyone to use this software for any purpose,
* including commercial applications, and to alter it and redistribute it
* freely, subject to the following restrictions:
*
* 1. The origin of this software must not be misrepresented; you must not
* claim that you wrote the original software. If you use this software
* in a product, an acknowledgment in the product documentation would be
* appreciated but is not required.
* 2. Altered source versions must be plainly marked as such, and must not be
* misrepresented as being the original software.
* 3. This notice may not be removed or altered from any source distribution.
*/
#ifndef RUNE_UTIL_LIST_H
#define RUNE_UTIL_LIST_H
#include <stddef.h>
/**
* Linux-kernel combatible linked list implementation
*/
typedef struct list_head {
struct list_head *next; ///< Next list element
struct list_head *prev; ///< Previous list element
} list_head_t;
/**
* \brief Add element to the end of a list
* \param[in] new Pointer to list_head_t, part of another struct
* \param[in] head Start point of the list to be added to
*/
static inline void list_add(list_head_t *new, list_head_t *head) {
list_head_t *temp = head;
while (temp->next != NULL)
temp = temp->next;
temp->next = new;
new->prev = temp;
new->next = NULL;
}
/**
* \brief Remove element from a list
* \param[in] item Pointer to list_head_t, part of another struct
*/
static inline void list_del(list_head_t *item) {
list_head_t *next = item->next;
list_head_t *prev = item->prev;
if (next != NULL)
next->prev = prev;
if (prev != NULL)
prev->next = next;
item->next = NULL;
item->prev = NULL;
}
#endif
|
