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
|
/*
* Copyright ©️ 2022 Mario Forzanini <mf@marioforzanini.com>
*
* This file is part of dwrt.
*
* Dwrt 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.
*
* Dwrt 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 dwrt. If not, see <https://www.gnu.org/licenses/>.
*
*/
typedef struct Stack Stack;
struct Stack {
void *data;
size_t len;
Stack *next;
};
#define STACK_ALLOC(s, content) do { \
(s) = ecalloc(1, sizeof(Stack)); \
(s)->data = (content); \
(s)->next = NULL; \
(s)->len = 0; \
} while(0)
#define STACK_PUSH_ALLOCED(head, s) do { \
(s)->next = (head); \
if((head)) (s)->len = (head)->len; \
(head) = (s); \
(head)->len++; \
} while(0)
#define STACK_PUSH(head, tmp, content) do { \
STACK_ALLOC((tmp), (content)); \
STACK_PUSH_ALLOCED((head), (tmp)); \
} while(0)
#define STACK_POP(head, tmp, content) do { \
(content) = NULL; \
if((head)) { \
(content) = (head)->data; \
(tmp) = (head); \
(head) = (head)->next; \
free((tmp)); \
} \
} while(0)
#define STACK_PEEK(head) ((head)?(head)->data:(head))
#define STACK_ITER(head, tmp, content) \
for((tmp) = (head), (content) = (tmp)?((tmp)->data):NULL; (tmp); \
(head) = (head)?((head)->next):(head), (tmp) = (head), (content) = (tmp)?((tmp)->data):NULL)
#define STACK_LEN(head) ((head)?(head)->len:0U)
|
