1 /* -*- mode: c; c-basic-offset: 8; indent-tabs-mode: nil; -*-
2 * vim:expandtab:shiftwidth=8:tabstop=8:
6 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
8 * This program is free software; you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License version 2 only,
10 * as published by the Free Software Foundation.
12 * This program is distributed in the hope that it will be useful, but
13 * WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * General Public License version 2 for more details (a copy is included
16 * in the LICENSE file that accompanied this code).
18 * You should have received a copy of the GNU General Public License
19 * version 2 along with this program; If not, see
20 * http://www.sun.com/software/products/lustre/docs/GPLv2.pdf
22 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
23 * CA 95054 USA or visit www.sun.com if you need additional information or
29 * Copyright 2008 Sun Microsystems, Inc. All rights reserved
30 * Use is subject to license terms.
33 * This file is part of Lustre, http://www.lustre.org/
34 * Lustre is a trademark of Sun Microsystems, Inc.
36 * libcfs/include/libcfs/posix/libcfs.h
38 * Defines for posix userspace.
40 * Author: Robert Read <rread@sun.com>
43 #ifndef __LIBCFS_POSIX_LIBCFS_H__
44 #define __LIBCFS_POSIX_LIBCFS_H__
46 #include <sys/errno.h>
58 #include <sys/signal.h>
63 #ifdef HAVE_LIBPTHREAD
67 #if defined(HAVE_SYS_TYPES_H)
68 #include <sys/types.h>
71 #ifdef HAVE_SYS_USER_H
72 # include <sys/user.h>
83 #include <libcfs/list.h>
84 #include <libcfs/posix/posix-types.h>
85 #include <libcfs/user-time.h>
86 #include <libcfs/user-prim.h>
87 #include <libcfs/user-mem.h>
88 #include <libcfs/user-lock.h>
89 #include <libcfs/user-tcpip.h>
90 #include <libcfs/posix/posix-wordsize.h>
91 #include <libcfs/user-bitops.h>
93 # define do_gettimeofday(tv) gettimeofday(tv, NULL);
94 typedef unsigned long long cycles_t;
96 #define IS_ERR(a) ((unsigned long)(a) > (unsigned long)-1000L)
97 #define PTR_ERR(a) ((long)(a))
98 #define ERR_PTR(a) ((void*)((long)(a)))
100 /* this goes in posix-fs.h */
101 #include <sys/mount.h>
107 typedef struct file cfs_file_t;
108 typedef struct dentry cfs_dentry_t;
110 typedef struct dirent64 cfs_dirent_t;
114 /* Userpace byte flipping */
116 # include <byteswap.h>
117 # define __swab16(x) bswap_16(x)
118 # define __swab32(x) bswap_32(x)
119 # define __swab64(x) bswap_64(x)
120 # define __swab16s(x) do {*(x) = bswap_16(*(x));} while (0)
121 # define __swab32s(x) do {*(x) = bswap_32(*(x));} while (0)
122 # define __swab64s(x) do {*(x) = bswap_64(*(x));} while (0)
123 # if __BYTE_ORDER == __LITTLE_ENDIAN
124 # define le16_to_cpu(x) (x)
125 # define cpu_to_le16(x) (x)
126 # define le32_to_cpu(x) (x)
127 # define cpu_to_le32(x) (x)
128 # define le64_to_cpu(x) (x)
129 # define cpu_to_le64(x) (x)
131 # define be16_to_cpu(x) bswap_16(x)
132 # define cpu_to_be16(x) bswap_16(x)
133 # define be32_to_cpu(x) bswap_32(x)
134 # define cpu_to_be32(x) bswap_32(x)
135 # define be64_to_cpu(x) bswap_64(x)
136 # define cpu_to_be64(x) bswap_64(x)
138 # if __BYTE_ORDER == __BIG_ENDIAN
139 # define le16_to_cpu(x) bswap_16(x)
140 # define cpu_to_le16(x) bswap_16(x)
141 # define le32_to_cpu(x) bswap_32(x)
142 # define cpu_to_le32(x) bswap_32(x)
143 # define le64_to_cpu(x) bswap_64(x)
144 # define cpu_to_le64(x) bswap_64(x)
146 # define be16_to_cpu(x) (x)
147 # define cpu_to_be16(x) (x)
148 # define be32_to_cpu(x) (x)
149 # define cpu_to_be32(x) (x)
150 # define be64_to_cpu(x) (x)
151 # define cpu_to_be64(x) (x)
154 # error "Unknown byte order"
155 # endif /* __BIG_ENDIAN */
156 # endif /* __LITTLE_ENDIAN */
158 #define __cpu_to_le64(x) OSSwapHostToLittleInt64(x)
159 #define __cpu_to_le32(x) OSSwapHostToLittleInt32(x)
160 #define __cpu_to_le16(x) OSSwapHostToLittleInt16(x)
162 #define __le16_to_cpu(x) OSSwapLittleToHostInt16(x)
163 #define __le32_to_cpu(x) OSSwapLittleToHostInt32(x)
164 #define __le64_to_cpu(x) OSSwapLittleToHostInt64(x)
166 #define cpu_to_le64(x) __cpu_to_le64(x)
167 #define cpu_to_le32(x) __cpu_to_le32(x)
168 #define cpu_to_le16(x) __cpu_to_le16(x)
170 #define le64_to_cpu(x) __le64_to_cpu(x)
171 #define le32_to_cpu(x) __le32_to_cpu(x)
172 #define le16_to_cpu(x) __le16_to_cpu(x)
174 #define __swab16(x) OSSwapInt16(x)
175 #define __swab32(x) OSSwapInt32(x)
176 #define __swab64(x) OSSwapInt64(x)
177 #define __swab16s(x) do { *(x) = __swab16(*(x)); } while (0)
178 #define __swab32s(x) do { *(x) = __swab32(*(x)); } while (0)
179 #define __swab64s(x) do { *(x) = __swab64(*(x)); } while (0)
183 # ifndef THREAD_SIZE /* x86_64 linux has THREAD_SIZE in userspace */
184 # define THREAD_SIZE 8192
187 #define LUSTRE_TRACE_SIZE (THREAD_SIZE >> 5)
189 #define CHECK_STACK() do { } while(0)
190 #define CDEBUG_STACK() (0L)
193 #define LUSTRE_LNET_PID 12345
195 #define ENTRY_NESTING_SUPPORT (1)
196 #define ENTRY_NESTING do {;} while (0)
197 #define EXIT_NESTING do {;} while (0)
198 #define __current_nesting_level() (0)
201 * Platform specific declarations for cfs_curproc API (libcfs/curproc.h)
203 * Implementation is in linux-curproc.c
205 #define CFS_CURPROC_COMM_MAX (sizeof ((struct task_struct *)0)->comm)
207 typedef __u32 cfs_kernel_cap_t;
210 * Module support (probably shouldn't be used in generic code?)
217 static inline void MODULE_AUTHOR(char *name)
219 printf("%s\n", name);
221 #define MODULE_DESCRIPTION(name) MODULE_AUTHOR(name)
222 #define MODULE_LICENSE(name) MODULE_AUTHOR(name)
224 #define THIS_MODULE (void *)0x11111
228 static inline int request_module(char *name)
233 static inline void __module_get(struct module *module)
237 static inline int try_module_get(struct module *module)
242 static inline void module_put(struct module *module)
247 static inline int module_refcount(struct module *m)
252 /***************************************************************************
254 * Linux kernel slab shrinker emulation. Currently used only in lu_object.c
256 ***************************************************************************/
262 #define DEFAULT_SEEKS (0)
264 typedef int (*shrinker_t)(int, unsigned int);
266 static inline struct shrinker *set_shrinker(int seeks, shrinker_t shrinkert)
268 return (struct shrinker *)0xdeadbea1; // Cannot return NULL here
271 static inline void remove_shrinker(struct shrinker *shrinker)
275 /***************************************************************************
277 * Linux kernel radix tree emulation.
279 * XXX this stub-implementation assumes that elements stored in a radix tree
280 * are struct page's and nothing else. Proper implementation will be
283 ***************************************************************************/
285 struct radix_tree_root {
286 struct list_head list;
290 struct radix_tree_node {
291 struct list_head _node;
296 #define RADIX_TREE_INIT(mask) { \
300 #define RADIX_TREE(name, mask) \
301 struct radix_tree_root name = RADIX_TREE_INIT(mask)
304 #define INIT_RADIX_TREE(root, mask) \
306 CFS_INIT_LIST_HEAD(&((struct radix_tree_root *)root)->list); \
307 ((struct radix_tree_root *)root)->rnode = NULL; \
310 static inline int radix_tree_insert(struct radix_tree_root *root,
311 unsigned long idx, void *item)
313 struct radix_tree_node *node;
314 node = malloc(sizeof(*node));
318 CFS_INIT_LIST_HEAD(&node->_node);
321 list_add_tail(&node->_node, &root->list);
322 root->rnode = (void *)1001;
326 static inline struct radix_tree_node *radix_tree_lookup0(struct radix_tree_root *root,
329 struct radix_tree_node *node;
331 if (list_empty(&root->list))
334 list_for_each_entry(node, &root->list, _node)
335 if (node->index == idx)
341 static inline void *radix_tree_lookup(struct radix_tree_root *root,
344 struct radix_tree_node *node = radix_tree_lookup0(root, idx);
351 static inline void *radix_tree_delete(struct radix_tree_root *root,
354 struct radix_tree_node *p = radix_tree_lookup0(root, idx);
360 list_del_init(&p->_node);
363 if (list_empty(&root->list))
369 static inline unsigned int
370 radix_tree_gang_lookup(struct radix_tree_root *root, void **results,
371 unsigned long first_index, unsigned int max_items)
376 for (i = 0; i < max_items; i++, first_index++) {
377 results[j++] = radix_tree_lookup(root, first_index);
378 if (results[j - 1] == NULL)
385 static inline int radix_tree_preload(int gfp_mask)
390 void radix_tree_init(void);
392 static inline void radix_tree_preload_end(void)
396 typedef ssize_t (*read_actor_t)();