mirror of
https://github.com/projectacrn/acrn-hypervisor.git
synced 2025-05-03 14:06:54 +00:00
4360235edf
Add the brackets for Macro parameter to avoid the unintentional
mistakes.
A simple example that may cause mistakes:
#define minus(x) -x
When the following call is made,
z = minus(a-b)
it becomes:
z = -a-b;
where "-a - b" is equivalent to "(-a) - b" rather than "- (a - b)", as
expected.
v2 -> v3:
* convert DMAR_WAIT_COMPLETION to inline function
* remove the macro PIC_PIN_FOREACH and implement the well-formed
for loop in each case
* replace __CPP_STRING with STRINGIFY and remove the unused CPP_STRING
v1 -> v2:
* Remove some changes to function like macro since MISRA-C requires to
use inline functions if it is possible.
These MACRO brackets violations will be fixed together when fixing
other issues related to function like macro.
Tracked-On: #861
Signed-off-by: Shiqing Gao <shiqing.gao@intel.com>
125 lines
3.5 KiB
C
125 lines
3.5 KiB
C
/*-
|
|
* Copyright (C) 2005-2011 HighPoint Technologies, Inc.
|
|
* Copyright (c) 2017 Intel Corporation
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*
|
|
* $FreeBSD$
|
|
*/
|
|
#ifndef LIST_H_
|
|
#define LIST_H_
|
|
|
|
struct list_head {
|
|
struct list_head *next, *prev;
|
|
};
|
|
|
|
#define INIT_LIST_HEAD(ptr) do { (ptr)->next = (ptr); (ptr)->prev = (ptr); } \
|
|
while (0)
|
|
|
|
static inline void list_add_node(struct list_head *new_node, struct list_head *prev,
|
|
struct list_head *next)
|
|
{
|
|
next->prev = new_node;
|
|
new_node->next = next;
|
|
new_node->prev = prev;
|
|
prev->next = new_node;
|
|
}
|
|
|
|
static inline void list_add(struct list_head *new_node, struct list_head *head)
|
|
{
|
|
list_add_node(new_node, head, head->next);
|
|
}
|
|
|
|
static inline void list_add_tail(struct list_head *new_node,
|
|
struct list_head *head)
|
|
{
|
|
list_add_node(new_node, head->prev, head);
|
|
}
|
|
|
|
static inline void list_del_node(struct list_head *prev, struct list_head *next)
|
|
{
|
|
next->prev = prev;
|
|
prev->next = next;
|
|
}
|
|
|
|
static inline void list_del(struct list_head *entry)
|
|
{
|
|
list_del_node(entry->prev, entry->next);
|
|
}
|
|
|
|
static inline void list_del_init(struct list_head *entry)
|
|
{
|
|
list_del_node(entry->prev, entry->next);
|
|
INIT_LIST_HEAD(entry);
|
|
}
|
|
|
|
static inline _Bool list_empty(struct list_head *head)
|
|
{
|
|
return head->next == head;
|
|
}
|
|
|
|
static inline void list_splice_node(struct list_head *list,
|
|
struct list_head *head)
|
|
{
|
|
struct list_head *first = list->next;
|
|
struct list_head *last = list->prev;
|
|
struct list_head *at = head->next;
|
|
|
|
first->prev = head;
|
|
head->next = first;
|
|
|
|
last->next = at;
|
|
at->prev = last;
|
|
}
|
|
|
|
static inline void list_splice(struct list_head *list, struct list_head *head)
|
|
{
|
|
if (!list_empty(list)) {
|
|
list_splice_node(list, head);
|
|
}
|
|
}
|
|
|
|
static inline void list_splice_init(struct list_head *list,
|
|
struct list_head *head)
|
|
{
|
|
if (!list_empty(list)) {
|
|
list_splice_node(list, head);
|
|
INIT_LIST_HEAD(list);
|
|
}
|
|
}
|
|
|
|
#define list_entry(ptr, type, member) \
|
|
((type *)((char *)(ptr)-(uint64_t)(&((type *)0)->member)))
|
|
|
|
#define list_for_each(pos, head) \
|
|
for ((pos) = (head)->next; (pos) != (head); (pos) = (pos)->next)
|
|
|
|
#define list_for_each_safe(pos, n, head) \
|
|
for ((pos) = (head)->next, (n) = (pos)->next; (pos) != (head); \
|
|
(pos) = (n), (n) = (pos)->next)
|
|
|
|
#define get_first_item(attached, type, member) \
|
|
((type *)((char *)((attached)->next)-(uint64_t)(&((type *)0)->member)))
|
|
|
|
#endif /* LIST_H_ */
|