76 lines
2.2 KiB
C
76 lines
2.2 KiB
C
/*
|
|
* Copyright (c) 2020 Institute of Parallel And Distributed Systems (IPADS), Shanghai Jiao Tong University (SJTU)
|
|
* OS-Lab-2020 (i.e., ChCore) is licensed under the Mulan PSL v1.
|
|
* You can use this software according to the terms and conditions of the Mulan PSL v1.
|
|
* You may obtain a copy of Mulan PSL v1 at:
|
|
* http://license.coscl.org.cn/MulanPSL
|
|
* THIS SOFTWARE IS PROVIDED ON AN "AS IS" BASIS, WITHOUT WARRANTIES OF ANY KIND, EITHER EXPRESS OR
|
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO NON-INFRINGEMENT, MERCHANTABILITY OR FIT FOR A PARTICULAR
|
|
* PURPOSE.
|
|
* See the Mulan PSL v1 for more details.
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include <common/macro.h>
|
|
#include <common/types.h>
|
|
|
|
struct list_head {
|
|
struct list_head *prev;
|
|
struct list_head *next;
|
|
};
|
|
|
|
static inline void init_list_head(struct list_head *list)
|
|
{
|
|
list->next = list;
|
|
list->prev = list;
|
|
}
|
|
|
|
static inline void list_add(struct list_head *new, struct list_head *head)
|
|
{
|
|
new->next = head->next;
|
|
new->prev = head;
|
|
head->next->prev = new;
|
|
head->next = new;
|
|
}
|
|
|
|
static inline void list_append(struct list_head *new, struct list_head *head)
|
|
{
|
|
struct list_head *tail = head->prev;
|
|
return list_add(new, tail);
|
|
}
|
|
|
|
static inline void list_del(struct list_head *node)
|
|
{
|
|
node->prev->next = node->next;
|
|
node->next->prev = node->prev;
|
|
}
|
|
|
|
static inline bool list_empty(struct list_head *head)
|
|
{
|
|
return (head->prev == head && head->next == head);
|
|
}
|
|
|
|
#define next_container_of_safe(obj, type, field) ({ \
|
|
typeof (obj) __obj = (obj); \
|
|
(__obj ? \
|
|
container_of_safe(((__obj)->field).next, type, field) : NULL); \
|
|
})
|
|
|
|
#define list_entry(ptr, type, field) \
|
|
container_of(ptr, type, field)
|
|
|
|
#define for_each_in_list(elem, type, field, head) \
|
|
for (elem = container_of((head)->next, type, field); \
|
|
&((elem)->field) != (head); \
|
|
elem = container_of(((elem)->field).next, type, field))
|
|
|
|
#define __for_each_in_list_safe(elem, tmp, type, field, head) \
|
|
for (elem = container_of((head)->next, type, field), \
|
|
tmp = next_container_of_safe(elem, type, field); \
|
|
&((elem)->field) != (head); \
|
|
elem = tmp, tmp = next_container_of_safe(tmp, type, field))
|
|
|
|
#define for_each_in_list_safe(elem, tmp, field, head) \
|
|
__for_each_in_list_safe(elem, tmp, typeof (*elem), field, head)
|