/* MECHANICALLY GENERATED, DO NOT EDIT!!! */
+#ifndef _INCLUDE_API_H
#define _INCLUDE_API_H
/*
* to redistribute under later versions of GPL might not be available.
*/
+#include <urcu/arch.h>
+
#ifndef __always_inline
#define __always_inline inline
#endif
#define CONFIG_PPC64
-#define CACHE_LINE_SIZE 128
+/*#define CACHE_LINE_SIZE 128 */
#define ____cacheline_internodealigned_in_smp \
__attribute__((__aligned__(1 << 7)))
*/
#ifndef CACHE_LINE_SIZE
-#define CACHE_LINE_SIZE 128
+/* #define CACHE_LINE_SIZE 128 */
#endif /* #ifndef CACHE_LINE_SIZE */
/*
const typeof( ((type *)0)->member ) *__mptr = (ptr); \
(type *)( (char *)__mptr - offsetof(type,member) );})
+#if 0
+
/*
* Simple doubly linked list implementation.
*
&pos->member != (head); \
pos = n, n = list_entry(n->member.prev, typeof(*n), member))
+#endif //0
+
/*
* Double linked lists with a single pointer list head.
* Mostly useful for hash tables where the two pointer list head is
pos = n)
#endif
+
+#endif