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

Dynamic IRQ handling

Browse Source
This commit is contained in:
Kamil Kowalczyk
2025-12-10 01:33:51 +01:00
parent 64b14f3878
commit 6feea1444a
18 changed files with 341 additions and 121 deletions
Download Patch File Download Diff File Expand all files Collapse all files

54
kernel/libk/list.h
View File

@@ -1,12 +1,12 @@
#ifndef _LIBK_LIST_H
#define _LIBK_LIST_H
#define DL_APPEND(head, new) \
#define dlinklist_append(type, head, new) \
do { \
if ((new) != NULL) { \
(new)->next = NULL; \
if ((head) != NULL) { \
typeof((head)) __tmp = (head); \
type __tmp = (head); \
while (__tmp->next != NULL) { \
__tmp = __tmp->next; \
} \
@@ -19,7 +19,7 @@
} \
} while (0)
#define DL_PREPEND(head, new) \
#define dlinklist_prepend(head, new) \
do { \
if ((new) != NULL) { \
(new)->prev = NULL; \
@@ -31,7 +31,7 @@
} \
} while (0)
#define DL_REMOVE(head, ele) \
#define dlinklist_remove(head, ele) \
do { \
if ((ele) != NULL) { \
if ((ele)->prev != NULL) { \
@@ -47,10 +47,10 @@
} \
} while (0)
#define DL_FINDPROP(head, out, propname, propvalue) \
#define dlinklist_find(type, head, out, propname, propvalue) \
do { \
(out) = NULL; \
typeof((head)) __tmp = (head); \
type __tmp = (head); \
while (__tmp) { \
if (__tmp->propname == (propvalue)) { \
(out) = __tmp; \
@@ -60,26 +60,26 @@
} \
} while (0)
#define DL_FOREACH_SAFE(head, var, tmp) \
#define dlinklist_foreach(head, var, tmp) \
for (var = (head), tmp = (var ? var->next : NULL); \
var != NULL; \
var = tmp, tmp = (var ? var->next : NULL))
#define DL_FOREACH_SAFE_IDX(head, var, tmp, idx) \
#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 DL_FOREACH_SAFE_IDX_LIMIT(head, var, tmp, idx, max) \
#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 DL_BACK(head, out) \
#define dlinklist_back(type, head, out) \
do { \
(out) = NULL; \
if ((head) != NULL) { \
typeof((head)) __tmp = (head); \
type __tmp = (head); \
while (__tmp->next != NULL) { \
__tmp = __tmp->next; \
} \
@@ -87,11 +87,11 @@
} \
} while (0)
#define DL_FRONT(head, out) \
#define dlinklist_front(type, head, out) \
do { \
(out) = NULL; \
if ((head) != NULL) { \
typeof((head)) __tmp = (head); \
type __tmp = (head); \
while (__tmp->prev != NULL) { \
__tmp = __tmp->prev; \
} \
@@ -99,7 +99,7 @@
} \
} while (0)
#define DL_INSERT_AFTER(head, pos, new) \
#define dlinklist_insert_after(head, pos, new) \
do { \
if ((pos) != NULL && (new) != NULL) { \
(new)->prev = (pos); \
@@ -115,7 +115,7 @@
} \
} while (0)
#define DL_INSERT_BEFORE(head, pos, new) \
#define dlinklist_insert_before(head, pos, new) \
do { \
if ((pos) != NULL && (new) != NULL) { \
(new)->next = (pos); \
@@ -133,11 +133,11 @@
} \
} while (0)
#define LL_APPEND(head, new) \
#define linklist_append(type, head, new) \
do { \
if ((new) != NULL) { \
if ((head) != NULL) { \
typeof((head)) __tmp; \
type __tmp; \
(new)->next = NULL; \
__tmp = (head); \
while (__tmp->next != NULL) { \
@@ -151,11 +151,11 @@
} \
} while(0)
#define LL_REMOVE(head, ele) \
#define linklist_remove(type, head, ele) \
do { \
if ((head) != NULL && (ele) != NULL) { \
typeof((head)) __cur = (head); \
typeof((head)) __prev = NULL; \
type __cur = (head); \
type __prev = NULL; \
while (__cur != NULL && __cur != (ele)) { \
__prev = __cur; \
__cur = __cur->next; \
@@ -171,10 +171,10 @@
} \
} while(0)
#define LL_FINDPROP(head, out, propname, propvalue) \
#define linklist_find(type, head, out, propname, propvalue) \
do { \
(out) = NULL; \
typeof((head)) __tmp = (head); \
type __tmp = (head); \
while (__tmp) { \
if (__tmp->propname == (propvalue)) { \
(out) = __tmp; \
@@ -184,27 +184,27 @@
} \
} while(0)
#define LL_FOREACH_SAFE(head, var, tmp) \
#define linklist_foreach(head, var, tmp) \
for (var = (head), tmp = (var ? var->next : NULL); \
var != NULL; \
var = tmp, tmp = (var ? var->next : NULL) \
)
#define LL_FOREACH_SAFE_IDX(head, var, tmp, idx) \
#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 LL_FOREACH_SAFE_IDX_LIMIT(head, var, tmp, idx, max) \
#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 LL_BACK(head, out) \
#define linklist_back(type, head, out) \
do { \
(out) = NULL; \
if ((head) != NULL) { \
typeof((head)) __tmp = (head); \
type __tmp = (head); \
while (__tmp->next != NULL) { \
__tmp = __tmp->next; \
} \