209 lines
17 KiB
C
209 lines
17 KiB
C
#ifndef _KERNEL_LIBK_LIST_H
|
|
#define _KERNEL_LIBK_LIST_H
|
|
|
|
#define dlinklist_append(type, head, new) \
|
|
do { \
|
|
if ((new) != NULL) { \
|
|
(new)->next = NULL; \
|
|
if ((head) != NULL) { \
|
|
type __tmp = (head); \
|
|
while (__tmp->next != NULL) { \
|
|
__tmp = __tmp->next; \
|
|
} \
|
|
__tmp->next = (new); \
|
|
(new)->prev = __tmp; \
|
|
} else { \
|
|
(new)->prev = NULL; \
|
|
(head) = (new); \
|
|
} \
|
|
} \
|
|
} while (0)
|
|
|
|
#define dlinklist_prepend(head, new) \
|
|
do { \
|
|
if ((new) != NULL) { \
|
|
(new)->prev = NULL; \
|
|
(new)->next = (head); \
|
|
if ((head) != NULL) { \
|
|
(head)->prev = (new); \
|
|
} \
|
|
(head) = (new); \
|
|
} \
|
|
} while (0)
|
|
|
|
#define dlinklist_remove(head, ele) \
|
|
do { \
|
|
if ((ele) != NULL) { \
|
|
if ((ele)->prev != NULL) { \
|
|
(ele)->prev->next = (ele)->next; \
|
|
} else { \
|
|
(head) = (ele)->next; \
|
|
} \
|
|
if ((ele)->next != NULL) { \
|
|
(ele)->next->prev = (ele)->prev; \
|
|
} \
|
|
(ele)->next = NULL; \
|
|
(ele)->prev = NULL; \
|
|
} \
|
|
} while (0)
|
|
|
|
#define dlinklist_find(type, head, out, propname, propvalue) \
|
|
do { \
|
|
(out) = NULL; \
|
|
type __tmp = (head); \
|
|
while (__tmp) { \
|
|
if (__tmp->propname == (propvalue)) { \
|
|
(out) = __tmp; \
|
|
break; \
|
|
} \
|
|
__tmp = __tmp->next; \
|
|
} \
|
|
} while (0)
|
|
|
|
#define dlinklist_foreach(head, var, tmp) \
|
|
for (var = (head), tmp = (var ? var->next : NULL); var != NULL; \
|
|
var = tmp, tmp = (var ? var->next : NULL))
|
|
|
|
#define dlinklist_foreach_index(head, var, tmp, idx) \
|
|
for ((idx) = 0, var = (head), tmp = (var ? var->next : NULL); var != NULL; \
|
|
var = tmp, tmp = (var ? var->next : NULL), (idx)++)
|
|
|
|
#define dlinklist_foreach_index_limit(head, var, tmp, idx, max) \
|
|
for ((idx) = 0, var = (head), tmp = (var ? var->next : NULL); var != NULL && (idx) < (max); \
|
|
var = tmp, tmp = (var ? var->next : NULL), (idx)++)
|
|
|
|
#define dlinklist_back(type, head, out) \
|
|
do { \
|
|
(out) = NULL; \
|
|
if ((head) != NULL) { \
|
|
type __tmp = (head); \
|
|
while (__tmp->next != NULL) { \
|
|
__tmp = __tmp->next; \
|
|
} \
|
|
(out) = __tmp; \
|
|
} \
|
|
} while (0)
|
|
|
|
#define dlinklist_front(type, head, out) \
|
|
do { \
|
|
(out) = NULL; \
|
|
if ((head) != NULL) { \
|
|
type __tmp = (head); \
|
|
while (__tmp->prev != NULL) { \
|
|
__tmp = __tmp->prev; \
|
|
} \
|
|
(out) = __tmp; \
|
|
} \
|
|
} while (0)
|
|
|
|
#define dlinklist_insert_after(head, pos, new) \
|
|
do { \
|
|
if ((pos) != NULL && (new) != NULL) { \
|
|
(new)->prev = (pos); \
|
|
(new)->next = (pos)->next; \
|
|
if ((pos)->next != NULL) { \
|
|
(pos)->next->prev = (new); \
|
|
} \
|
|
(pos)->next = (new); \
|
|
} else if ((pos) == NULL && (head) == NULL) { \
|
|
(new)->prev = NULL; \
|
|
(new)->next = NULL; \
|
|
(head) = (new); \
|
|
} \
|
|
} while (0)
|
|
|
|
#define dlinklist_insert_before(head, pos, new) \
|
|
do { \
|
|
if ((pos) != NULL && (new) != NULL) { \
|
|
(new)->next = (pos); \
|
|
(new)->prev = (pos)->prev; \
|
|
if ((pos)->prev != NULL) { \
|
|
(pos)->prev->next = (new); \
|
|
} else { \
|
|
(head) = (new); \
|
|
} \
|
|
(pos)->prev = (new); \
|
|
} else if ((pos) == NULL && (head) == NULL) { \
|
|
(new)->prev = NULL; \
|
|
(new)->next = NULL; \
|
|
(head) = (new); \
|
|
} \
|
|
} while (0)
|
|
|
|
#define linklist_append(type, head, new) \
|
|
do { \
|
|
if ((new) != NULL) { \
|
|
if ((head) != NULL) { \
|
|
type __tmp; \
|
|
(new)->next = NULL; \
|
|
__tmp = (head); \
|
|
while (__tmp->next != NULL) { \
|
|
__tmp = __tmp->next; \
|
|
} \
|
|
__tmp->next = (new); \
|
|
} else { \
|
|
(new)->next = NULL; \
|
|
(head) = (new); \
|
|
} \
|
|
} \
|
|
} while (0)
|
|
|
|
#define linklist_remove(type, head, ele) \
|
|
do { \
|
|
if ((head) != NULL && (ele) != NULL) { \
|
|
type __cur = (head); \
|
|
type __prev = NULL; \
|
|
while (__cur != NULL && __cur != (ele)) { \
|
|
__prev = __cur; \
|
|
__cur = __cur->next; \
|
|
} \
|
|
if (__cur == (ele)) { \
|
|
if (__prev != NULL) { \
|
|
__prev->next = __cur->next; \
|
|
} else { \
|
|
(head) = __cur->next; \
|
|
} \
|
|
(ele)->next = NULL; \
|
|
} \
|
|
} \
|
|
} while (0)
|
|
|
|
#define linklist_find(type, head, out, propname, propvalue) \
|
|
do { \
|
|
(out) = NULL; \
|
|
type __tmp = (head); \
|
|
while (__tmp) { \
|
|
if (__tmp->propname == (propvalue)) { \
|
|
(out) = __tmp; \
|
|
break; \
|
|
} \
|
|
__tmp = __tmp->next; \
|
|
} \
|
|
} while (0)
|
|
|
|
#define linklist_foreach(head, var, tmp) \
|
|
for (var = (head), tmp = (var ? var->next : NULL); var != NULL; \
|
|
var = tmp, tmp = (var ? var->next : NULL))
|
|
|
|
#define linklist_foreach_index(head, var, tmp, idx) \
|
|
for ((idx) = 0, var = (head), tmp = (var ? var->next : NULL); var != NULL; \
|
|
var = tmp, tmp = (var ? var->next : NULL), (idx)++)
|
|
|
|
#define linklist_foreach_index_limit(head, var, tmp, idx, max) \
|
|
for ((idx) = 0, var = (head), tmp = (var ? var->next : NULL); var != NULL && (idx) < (max); \
|
|
var = tmp, tmp = (var ? var->next : NULL), (idx)++)
|
|
|
|
#define linklist_back(type, head, out) \
|
|
do { \
|
|
(out) = NULL; \
|
|
if ((head) != NULL) { \
|
|
type __tmp = (head); \
|
|
while (__tmp->next != NULL) { \
|
|
__tmp = __tmp->next; \
|
|
} \
|
|
(out) = __tmp; \
|
|
} \
|
|
} while (0)
|
|
|
|
#endif // _KERNEL_LIBK_LIST_H
|