asmotor-util/lists.h at master · asmotor/asmotor-util · GitHub

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
/*  Copyright 2008-2026 Carsten Elton Sorensen

    This file is part of ASMotor.

    ASMotor 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.

    ASMotor 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 ASMotor.  If not, see <http://www.gnu.org/licenses/>.
*/

#ifndef UTIL_LISTS_H_INCLUDED_
#define UTIL_LISTS_H_INCLUDED_

#include "types.h"

#define list_Data(type) \
	type* pPrev;        \
	type* pNext

#define list_Init(e)       \
	do {                   \
		(e)->pPrev = NULL; \
		(e)->pNext = NULL; \
	} while (0)
#define list_GetNext(e) ((e)->pNext)
#define list_GetPrev(e) ((e)->pPrev)
#define list_IsLast(e)  (list_GetNext(e) == NULL ? true : false)
#define list_IsFirst(e) (list_GetPrev(e) == NULL ? true : false)

#define list_Remove(head, e)                                     \
	do {                                                         \
		if ((head) == (e)) {                                     \
			(head) = list_GetNext(e);                            \
			if (head)                                            \
				list_GetPrev(head) = NULL;                       \
		} else {                                                 \
			list_GetNext(list_GetPrev(e)) = list_GetNext(e);     \
			if ((e) && !list_IsLast(e)) {                        \
				list_GetPrev(list_GetNext(e)) = list_GetPrev(e); \
			}                                                    \
		}                                                        \
	} while (0)

#define list_Insert(head, e)          \
	do {                              \
		if (head)                     \
			list_GetPrev(head) = (e); \
		list_GetNext(e) = (head);     \
		list_GetPrev(e) = NULL;       \
		(head) = (e);                 \
	} while (0)

#define list_InsertAfter(where, e)                   \
	do {                                             \
		list_GetPrev(e) = (where);                   \
		list_GetNext(e) = list_GetNext(where);       \
		if (!list_IsLast(where))                     \
			list_GetPrev(list_GetNext(where)) = (e); \
		list_GetNext(where) = (e);                   \
	} while (0)

#endif /* UTIL_LISTS_H_INCLUDED_ */