mirror of
https://github.com/drasko/codezero.git
synced 2026-01-12 02:43:15 +01:00
0f9ea9674c
Capabilities will be shared among collection of threads. A pager will have a right to share its own capabilities with its space, its thread group and its container. Currently sharing is possible with only all of the caps. Next, it will be support for cap splitting, granting, and partial sharing and granting.
109 lines
2.6 KiB
C
109 lines
2.6 KiB
C
#ifndef __LIST_H__
|
|
#define __LIST_H__
|
|
|
|
#define L4_DEADWORD 0xDEADCCCC
|
|
|
|
struct link {
|
|
struct link *next;
|
|
struct link *prev;
|
|
};
|
|
|
|
static inline void link_init(struct link *l)
|
|
{
|
|
l->next = l;
|
|
l->prev = l;
|
|
}
|
|
|
|
#define LINK_INIT(link) { &(link), &(link) }
|
|
#define LINK_DECLARE(l) \
|
|
struct link l = LINK_INIT(l)
|
|
|
|
static inline void list_insert(struct link *new, struct link *list)
|
|
{
|
|
struct link *next = list->next;
|
|
|
|
/*
|
|
* The new link goes between the
|
|
* current and next links on the list e.g.
|
|
* list -> new -> next
|
|
*/
|
|
new->next = next;
|
|
next->prev = new;
|
|
list->next = new;
|
|
new->prev = list;
|
|
|
|
}
|
|
|
|
static inline void list_insert_tail(struct link *new, struct link *list)
|
|
{
|
|
struct link *prev = list->prev;
|
|
|
|
/*
|
|
* The new link goes between the
|
|
* current and prev links on the list, e.g.
|
|
* prev -> new -> list
|
|
*/
|
|
new->next = list;
|
|
list->prev = new;
|
|
new->prev = prev;
|
|
prev->next = new;
|
|
}
|
|
|
|
static inline void list_remove(struct link *link)
|
|
{
|
|
struct link *prev = link->prev;
|
|
struct link *next = link->next;
|
|
|
|
prev->next = next;
|
|
next->prev = prev;
|
|
|
|
link->next = (struct link *)L4_DEADWORD;
|
|
link->prev = (struct link *)L4_DEADWORD;
|
|
}
|
|
|
|
static inline void list_remove_init(struct link *link)
|
|
{
|
|
struct link *prev = link->prev;
|
|
struct link *next = link->next;
|
|
|
|
prev->next = next;
|
|
next->prev = prev;
|
|
|
|
link->next = link;
|
|
link->prev = link;
|
|
}
|
|
|
|
/* Cuts the whole list from head and returns it */
|
|
static inline struct link *list_detach(struct link *head)
|
|
{
|
|
struct link *next = head->next;
|
|
|
|
/* Detach head from rest of the list */
|
|
list_remove_init(head);
|
|
|
|
/* Return detached list */
|
|
return next;
|
|
}
|
|
|
|
static inline int list_empty(struct link *list)
|
|
{
|
|
return list->prev == list && list->next == list;
|
|
}
|
|
|
|
|
|
#define link_to_struct(link, struct_type, link_field) \
|
|
container_of(link, struct_type, link_field)
|
|
|
|
#define list_foreach_struct(struct_ptr, link_start, link_field) \
|
|
for (struct_ptr = link_to_struct((link_start)->next, typeof(*struct_ptr), link_field); \
|
|
&struct_ptr->link_field != (link_start); \
|
|
struct_ptr = link_to_struct(struct_ptr->link_field.next, typeof(*struct_ptr), link_field))
|
|
|
|
#define list_foreach_removable_struct(struct_ptr, temp_ptr, link_start, link_field) \
|
|
for (struct_ptr = link_to_struct((link_start)->next, typeof(*struct_ptr), link_field), \
|
|
temp_ptr = link_to_struct((struct_ptr)->link_field.next, typeof(*struct_ptr), link_field);\
|
|
&struct_ptr->link_field != (link_start); \
|
|
struct_ptr = temp_ptr, temp_ptr = link_to_struct(temp_ptr->link_field.next, typeof(*temp_ptr), link_field))
|
|
|
|
#endif /* __LIST_H__ */
|