|
@@ -37,7 +37,7 @@ extern "C" {
|
|
|
*/
|
|
|
rt_inline void rt_list_init(rt_list_t *l)
|
|
|
{
|
|
|
- l->next = l->prev = l;
|
|
|
+ l->next = l->prev = l;
|
|
|
}
|
|
|
|
|
|
/**
|
|
@@ -48,11 +48,11 @@ rt_inline void rt_list_init(rt_list_t *l)
|
|
|
*/
|
|
|
rt_inline void rt_list_insert_after(rt_list_t *l, rt_list_t *n)
|
|
|
{
|
|
|
- l->next->prev = n;
|
|
|
- n->next = l->next;
|
|
|
+ l->next->prev = n;
|
|
|
+ n->next = l->next;
|
|
|
|
|
|
- l->next = n;
|
|
|
- n->prev = l;
|
|
|
+ l->next = n;
|
|
|
+ n->prev = l;
|
|
|
}
|
|
|
|
|
|
/**
|
|
@@ -63,11 +63,11 @@ rt_inline void rt_list_insert_after(rt_list_t *l, rt_list_t *n)
|
|
|
*/
|
|
|
rt_inline void rt_list_insert_before(rt_list_t *l, rt_list_t *n)
|
|
|
{
|
|
|
- l->prev->next = n;
|
|
|
- n->prev = l->prev;
|
|
|
+ l->prev->next = n;
|
|
|
+ n->prev = l->prev;
|
|
|
|
|
|
- l->prev = n;
|
|
|
- n->next = l;
|
|
|
+ l->prev = n;
|
|
|
+ n->next = l;
|
|
|
}
|
|
|
|
|
|
/**
|
|
@@ -76,10 +76,10 @@ rt_inline void rt_list_insert_before(rt_list_t *l, rt_list_t *n)
|
|
|
*/
|
|
|
rt_inline void rt_list_remove(rt_list_t *n)
|
|
|
{
|
|
|
- n->next->prev = n->prev;
|
|
|
- n->prev->next = n->next;
|
|
|
+ n->next->prev = n->prev;
|
|
|
+ n->prev->next = n->next;
|
|
|
|
|
|
- n->next = n->prev = n;
|
|
|
+ n->next = n->prev = n;
|
|
|
}
|
|
|
|
|
|
/**
|
|
@@ -88,7 +88,7 @@ rt_inline void rt_list_remove(rt_list_t *n)
|
|
|
*/
|
|
|
rt_inline int rt_list_isempty(const rt_list_t *l)
|
|
|
{
|
|
|
- return l->next == l;
|
|
|
+ return l->next == l;
|
|
|
}
|
|
|
|
|
|
/**
|