bsl_module_list.h

/*
 * This file is part of the openHiTLS project.
 *
 * openHiTLS is licensed under the Mulan PSL v2.
 * You can use this software according to the terms and conditions of the Mulan PSL v2.
 * You may obtain a copy of Mulan PSL v2 at:
 *
 *     http://license.coscl.org.cn/MulanPSL2
 *
 * 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 v2 for more details.
 */
 
#ifndef BSL_MODULE_LIST_H
#define BSL_MODULE_LIST_H
 
#include <stdint.h>
 
#ifdef __cplusplus
extern "C" {
#endif
 
/*
 * This structure is used to store the forward and backward pointers of nodes in the bidirectional linked list.
 * This linked list does not contain substantial data areas and is generally used to organize (concatenate) data nodes.
 */
typedef struct ListHeadSt {
    struct ListHeadSt *next, *prev;
} ListHead;

#define LIST_INIT(head) (head)->next = (head)->prev = (head)

#define LIST_ADD_AFTER(where, item) do {  \
    (item)->next       = (where)->next; \
    (item)->prev       = (where);       \
    (where)->next      = (item);        \
    (item)->next->prev = (item);        \
} while (0)

#define LIST_ADD_BEFORE(where, item) LIST_ADD_AFTER((where)->prev, (item))

#define LIST_REMOVE(item) do { \
    (item)->prev->next = (item)->next; \
    (item)->next->prev = (item)->prev; \
} while (0)

#define LIST_IS_EMPTY(head) ((head)->next == (head))

#define LIST_FOR_EACH_ITEM_SAFE(item, temp, head) \
    for ((item) = (head)->next, (temp) = (item)->next; (item) != (head); (item) = (temp), (temp) = (item)->next)

#define LIST_ENTRY(item, type, member) \
    ((type *)((uintptr_t)(char *)(item) - (uintptr_t)(&((type *)0)->member)))
 
#ifdef __cplusplus
}
#endif
#endif // BSL_MODULE_LIST_H