@@ -110,8 +110,10 @@ list_move(struct list *list, struct list *head)
}
}
+#ifndef __container_of
#define __container_of(ptr, sample, member) \
(void *)((char *)(ptr) - ((char *)&(sample)->member - (char *)(sample)))
+#endif
#define list_for_each_entry(pos, head, member) \
for (pos = __container_of((head)->next, pos, member); \
@@ -305,8 +305,11 @@ list_is_empty(const struct list *head)
#define list_last_entry(ptr, type, member) \
list_entry((ptr)->prev, type, member)
+#ifndef __container_of
#define __container_of(ptr, sample, member) \
(void *)((char *)(ptr) - ((char *)&(sample)->member - (char *)(sample)))
+#endif
+
/**
* Loop through the list given by head and set pos to struct in the list.
*
@@ -108,8 +108,10 @@ list_move(struct list *list, struct list *head)
}
}
+#ifndef __container_of
#define __container_of(ptr, sample, member) \
(void *)((char *)(ptr) - ((char *)&(sample)->member - (char *)(sample)))
+#endif
#define list_for_each_entry(pos, head, member) \
for (pos = __container_of((head)->next, pos, member); \
Silence warnings. Signed-off-by: Enrico Weigelt, metux IT consult <info@metux.net> --- benchmarks/dri3-swap.c | 2 ++ src/intel_list.h | 3 +++ test/present-speed.c | 2 ++ 3 files changed, 7 insertions(+) -- 2.39.5