-
Notifications
You must be signed in to change notification settings - Fork 0
/
double_linked_list.h
76 lines (49 loc) · 2.12 KB
/
double_linked_list.h
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
66
67
68
69
70
71
72
73
74
75
76
/*************************************************************************************************************
This file is part of HWMonitor.
HWMonitor is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
HWMonitor is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with HWMonitor. If not, see <http://www.gnu.org/licenses/>.
*************************************************************************************************************/
#pragma once
//============================================================================================================
// GENERIC DOUBLE LINKED LIST
//============================================================================================================
#include "globals.h"
typedef struct list_node {
void* data;
struct list_node* prev;
struct list_node* next;
} list_node_t;
typedef struct list {
list_node_t* head;
list_node_t* tail;
u64 size;
data_release_cb rel_cb;
} list_t;
typedef struct list_iter {
list_node_t* node;
} list_iter_t;
void list_iter_init(list_t* l, list_iter_t** it);
void list_iter_release(list_iter_t* it);
void* list_iter_next(list_iter_t* it);
void list_init(list_t** l, data_release_cb cb);
void list_node_init(list_node_t** node);
void list_push(list_t* l, void* s);
void* list_pop_head(list_t* l);
void* list_crop_tail(list_t* l);
ret_t list_release(list_t* l, bool release_data);
ret_t list_merge(list_t* __restrict a, list_t* __restrict b);
//TODO segfault
ret_t list_remove(list_t* l, const void* data);
typedef void(* list_traverse_cb)(list_node_t*);
ret_t list_traverse(list_t* l, bool forward, list_traverse_cb cb);
#ifndef NDEBUG
void test_list(void);
#endif