#include <sys/utsname.h>
#include <ctype.h>
#include <stdbool.h>
+#include <limits.h>
#ifdef HAVE_NETDB_H
#include <netdb.h>
#endif
#include <libcfs/list.h>
-#include <libcfs/posix/posix-types.h>
#include <libcfs/user-time.h>
#include <libcfs/user-prim.h>
#include <libcfs/user-mem.h>
#include <libcfs/user-lock.h>
#include <libcfs/user-tcpip.h>
-#include <libcfs/posix/posix-wordsize.h>
#include <libcfs/user-bitops.h>
# define do_gettimeofday(tv) gettimeofday(tv, NULL);
typedef unsigned long long cfs_cycles_t;
-#define IS_ERR(a) ((unsigned long)(a) > (unsigned long)-1000L)
-#define IS_ERR_VALUE(a) (IS_ERR(a))
-#define PTR_ERR(a) ((long)(a))
-#define ERR_PTR(a) ((void*)((long)(a)))
-
/* this goes in posix-fs.h */
#include <sys/mount.h>
#define __swab64s(x) do { *(x) = __swab64(*(x)); } while (0)
#endif
-#if !defined(ALIGN)
-#define __ALIGN_MASK(x, mask) (((x) + (mask)) & ~(mask))
-#define ALIGN(x, a) __ALIGN_MASK(x, (typeof(x))(a) - 1)
-#endif
-
# ifndef THREAD_SIZE /* x86_64 linux has THREAD_SIZE in userspace */
# define THREAD_SIZE 8192
# else
#define EXIT_NESTING do {;} while (0)
#define __current_nesting_level() (0)
-#define CAP_CHOWN 0
-#define CAP_DAC_OVERRIDE 1
-#define CAP_DAC_READ_SEARCH 2
-#define CAP_FOWNER 3
-#define CAP_FSETID 4
-#define CAP_LINUX_IMMUTABLE 9
-#define CAP_SYS_ADMIN 21
-#define CAP_SYS_BOOT 23
-#define CAP_SYS_RESOURCE 24
-
/**
* Platform specific declarations for cfs_curproc API (libcfs/curproc.h)
*
***************************************************************************/
struct shrinker {
- ;
+#ifndef __INTEL_COMPILER
+ ;
+#endif
};
-#define DEFAULT_SEEKS (0)
+struct shrinker_var {
+#ifndef __INTEL_COMPILER
+ ;
+#endif
+};
-typedef int (*shrinker_t)(int, unsigned int);
+#define DEF_SHRINKER_VAR(name, shrink, count, scan) \
+ struct shrinker_var name = {};
+
+#define DEFAULT_SEEKS (0)
static inline
-struct shrinker *set_shrinker(int seeks, shrinker_t shrink)
+struct shrinker *set_shrinker(int seeks, struct shrinker_var *var)
{
return (struct shrinker *)0xdeadbea1; /* Cannot return NULL here */
}
***************************************************************************/
struct radix_tree_root {
- cfs_list_t list;
- void *rnode;
+ struct list_head list;
+ void *rnode;
};
struct radix_tree_node {
- cfs_list_t _node;
- unsigned long index;
- void *item;
+ struct list_head _node;
+ unsigned long index;
+ void *item;
};
-#define RADIX_TREE_INIT(mask) { \
- NOT_IMPLEMENTED \
+#define RADIX_TREE_INIT(mask) { \
+ NOT_IMPLEMENTED \
}
#define RADIX_TREE(name, mask) \
struct radix_tree_root name = RADIX_TREE_INIT(mask)
-#define INIT_RADIX_TREE(root, mask) \
-do { \
- CFS_INIT_LIST_HEAD(&((struct radix_tree_root *)root)->list); \
- ((struct radix_tree_root *)root)->rnode = NULL; \
+#define INIT_RADIX_TREE(root, mask) \
+do { \
+ INIT_LIST_HEAD(&((struct radix_tree_root *)root)->list); \
+ ((struct radix_tree_root *)root)->rnode = NULL; \
} while (0)
static inline int radix_tree_insert(struct radix_tree_root *root,
- unsigned long idx, void *item)
+ unsigned long idx, void *item)
{
- struct radix_tree_node *node;
- node = malloc(sizeof(*node));
- if (!node)
- return -ENOMEM;
-
- CFS_INIT_LIST_HEAD(&node->_node);
- node->index = idx;
- node->item = item;
- cfs_list_add_tail(&node->_node, &root->list);
- root->rnode = (void *)1001;
- return 0;
+ struct radix_tree_node *node;
+ node = malloc(sizeof(*node));
+ if (!node)
+ return -ENOMEM;
+
+ INIT_LIST_HEAD(&node->_node);
+ node->index = idx;
+ node->item = item;
+ list_add_tail(&node->_node, &root->list);
+ root->rnode = (void *)1001;
+ return 0;
}
-static inline struct radix_tree_node *radix_tree_lookup0(struct radix_tree_root *root,
- unsigned long idx)
+static inline struct radix_tree_node *
+radix_tree_lookup0(struct radix_tree_root *root, unsigned long idx)
{
- struct radix_tree_node *node;
+ struct radix_tree_node *node;
- if (cfs_list_empty(&root->list))
- return NULL;
+ if (list_empty(&root->list))
+ return NULL;
- cfs_list_for_each_entry_typed(node, &root->list,
- struct radix_tree_node, _node)
- if (node->index == idx)
- return node;
+ list_for_each_entry(node, &root->list, _node)
+ if (node->index == idx)
+ return node;
- return NULL;
+ return NULL;
}
static inline void *radix_tree_lookup(struct radix_tree_root *root,
- unsigned long idx)
+ unsigned long idx)
{
- struct radix_tree_node *node = radix_tree_lookup0(root, idx);
+ struct radix_tree_node *node = radix_tree_lookup0(root, idx);
- if (node)
- return node->item;
- return node;
+ if (node)
+ return node->item;
+ return node;
}
static inline void *radix_tree_delete(struct radix_tree_root *root,
- unsigned long idx)
+ unsigned long idx)
{
- struct radix_tree_node *p = radix_tree_lookup0(root, idx);
- void *item;
+ struct radix_tree_node *p = radix_tree_lookup0(root, idx);
+ void *item;
- if (p == NULL)
- return NULL;
+ if (p == NULL)
+ return NULL;
- cfs_list_del_init(&p->_node);
- item = p->item;
- free(p);
- if (cfs_list_empty(&root->list))
- root->rnode = NULL;
+ list_del_init(&p->_node);
+ item = p->item;
+ free(p);
+ if (list_empty(&root->list))
+ root->rnode = NULL;
- return item;
+ return item;
}
static inline unsigned int
# define DTTOIF(dirtype) ((dirtype) << IFSHIFT)
# endif
+#ifndef ERESTARTSYS
+#define ERESTARTSYS ERESTART
+#endif
+
#endif
git://git.whamcloud.com / fs / lustre-release.git / blobdiff