kamkow1/mop3
1
1
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Redesign linked list
All checks were successful
Build documentation / build-and-deploy (push) Successful in 49s
Details

Browse Source
This commit is contained in:
Kamil Kowalczyk
2026-01-06 16:38:42 +01:00
parent d09e4d97ad
commit e50f8940a9
6 changed files with 51 additions and 141 deletions
Download Patch File Download Diff File Expand all files Collapse all files

150
kernel/libk/list.h
View File

@@ -1,12 +1,19 @@
#ifndef _KERNEL_LIBK_LIST_H
#define _KERNEL_LIBK_LIST_H
#define dlinklist_append(type, head, new) \
struct list_node_link {
struct list_node_link* next;
struct list_node_link* prev;
};
#define list_entry(ptr, type, member) ((type*)((char*)(ptr) - offsetof (type, member)))
#define list_append(head, new) \
do { \
if ((new) != NULL) { \
(new)->next = NULL; \
if ((head) != NULL) { \
type __tmp = (head); \
struct list_node_link* __tmp = (head); \
while (__tmp->next != NULL) { \
__tmp = __tmp->next; \
} \
@@ -19,7 +26,7 @@
} \
} while (0)
#define dlinklist_prepend(head, new) \
#define list_prepend(head, new) \
do { \
if ((new) != NULL) { \
(new)->prev = NULL; \
@@ -31,7 +38,7 @@
} \
} while (0)
#define dlinklist_remove(head, ele) \
#define list_remove(head, ele) \
do { \
if ((ele) != NULL) { \
if ((ele)->prev != NULL) { \
@@ -47,10 +54,10 @@
} \
} while (0)
#define dlinklist_find(type, head, out, propname, propvalue) \
#define list_find(head, out, propname, propvalue) \
do { \
(out) = NULL; \
type __tmp = (head); \
struct list_node_link* __tmp = (head); \
while (__tmp) { \
if (__tmp->propname == (propvalue)) { \
(out) = __tmp; \
@@ -60,23 +67,23 @@
} \
} while (0)
#define dlinklist_foreach(head, var, tmp) \
#define list_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) \
#define list_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) \
#define list_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) \
#define list_back(head, out) \
do { \
(out) = NULL; \
if ((head) != NULL) { \
type __tmp = (head); \
struct list_node_link* __tmp = (head); \
while (__tmp->next != NULL) { \
__tmp = __tmp->next; \
} \
@@ -84,11 +91,11 @@
} \
} while (0)
#define dlinklist_front(type, head, out) \
#define list_front(head, out) \
do { \
(out) = NULL; \
if ((head) != NULL) { \
type __tmp = (head); \
struct list_node_link* __tmp = (head); \
while (__tmp->prev != NULL) { \
__tmp = __tmp->prev; \
} \
@@ -96,7 +103,7 @@
} \
} while (0)
#define dlinklist_insert_after(head, pos, new) \
#define list_insert_after(head, pos, new) \
do { \
if ((pos) != NULL && (new) != NULL) { \
(new)->prev = (pos); \
@@ -112,7 +119,7 @@
} \
} while (0)
#define dlinklist_insert_before(head, pos, new) \
#define list_insert_before(head, pos, new) \
do { \
if ((pos) != NULL && (new) != NULL) { \
(new)->next = (pos); \
@@ -130,11 +137,11 @@
} \
} while (0)
#define dlinklist_index_of(type, head, ele, out_idx) \
#define list_index_of(head, ele, out_idx) \
do { \
(out_idx) = -1; \
int __idx = 0; \
type __tmp = (head); \
struct list_node_link* __tmp = (head); \
while (__tmp != NULL) { \
if (__tmp == (ele)) { \
(out_idx) = __idx; \
@@ -145,11 +152,11 @@
} \
} while (0)
#define dlinklist_index_of_prop(type, head, propname, propvalue, out_idx) \
#define list_index_of_prop(head, propname, propvalue, out_idx) \
do { \
(out_idx) = -1; \
int __idx = 0; \
type __tmp = (head); \
struct list_node_link* __tmp = (head); \
while (__tmp != NULL) { \
if (__tmp->propname == (propvalue)) { \
(out_idx) = __idx; \
@@ -160,109 +167,4 @@
} \
} while (0)
#define linklist_index_of(type, head, ele, out_idx) \
do { \
(out_idx) = -1; \
int __idx = 0; \
type __tmp = (head); \
while (__tmp != NULL) { \
if (__tmp == (ele)) { \
(out_idx) = __idx; \
break; \
} \
__tmp = __tmp->next; \
__idx++; \
} \
} while (0)
#define linklist_index_of_prop(type, head, propname, propvalue, out_idx) \
do { \
(out_idx) = -1; \
int __idx = 0; \
type __tmp = (head); \
while (__tmp != NULL) { \
if (__tmp->propname == (propvalue)) { \
(out_idx) = __idx; \
break; \
} \
__tmp = __tmp->next; \
__idx++; \
} \
} 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