4 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License version 2 only,
8 * as published by the Free Software Foundation.
10 * This program is distributed in the hope that it will be useful, but
11 * WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * General Public License version 2 for more details (a copy is included
14 * in the LICENSE file that accompanied this code).
16 * You should have received a copy of the GNU General Public License
17 * version 2 along with this program; If not, see
18 * http://www.sun.com/software/products/lustre/docs/GPLv2.pdf
20 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
21 * CA 95054 USA or visit www.sun.com if you need additional information or
27 * Copyright (c) 2008, 2010, Oracle and/or its affiliates. All rights reserved.
28 * Use is subject to license terms.
30 * Copyright (c) 2012, 2013, Intel Corporation.
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__
47 #include <sys/errno.h>
58 #include <sys/ioctl.h>
59 #include <sys/signal.h>
66 #include <sys/socket.h>
67 #include <sys/utsname.h>
80 #ifdef HAVE_LIBPTHREAD
84 #if defined(HAVE_SYS_TYPES_H)
85 #include <sys/types.h>
88 #ifdef HAVE_SYS_USER_H
89 # include <sys/user.h>
100 #include <libcfs/list.h>
101 #include <libcfs/user-time.h>
102 #include <libcfs/user-prim.h>
103 #include <libcfs/user-mem.h>
104 #include <libcfs/user-lock.h>
105 #include <libcfs/user-tcpip.h>
106 #include <libcfs/user-bitops.h>
108 #define do_gettimeofday(tv) gettimeofday(tv, NULL);
109 typedef unsigned long long cfs_cycles_t;
111 /* this goes in posix-fs.h */
112 #include <sys/mount.h>
117 #define fput(f) do {} while (0)
119 #ifndef THREAD_SIZE /* x86_64 linux has THREAD_SIZE in userspace */
120 # define THREAD_SIZE 8192
121 #endif /* THREAD_SIZE */
123 #define CFS_CHECK_STACK(msgdata, mask, cdls) do {} while(0)
124 #define CDEBUG_STACK() (0L)
127 * Platform specific declarations for cfs_curproc API (libcfs/curproc.h)
129 * Implementation is in linux-curproc.c
131 #define CFS_CURPROC_COMM_MAX (sizeof ((struct task_struct *)0)->comm)
133 typedef __u32 kernel_cap_t;
136 * Module support (probably shouldn't be used in generic code?)
143 static inline void MODULE_AUTHOR(char *name)
145 printf("%s\n", name);
147 #define MODULE_DESCRIPTION(name) MODULE_AUTHOR(name)
148 #define MODULE_LICENSE(name) MODULE_AUTHOR(name)
150 #define THIS_MODULE (void *)0x11111
154 static inline int request_module(const char *name, ...)
159 static inline void __module_get(struct module *module)
163 static inline int try_module_get(struct module *module)
168 static inline void module_put(struct module *module)
173 static inline int module_refcount(struct module *m)
178 /***************************************************************************
180 * Linux kernel slab shrinker emulation. Currently used only in lu_object.c
182 ***************************************************************************/
185 #ifndef __INTEL_COMPILER
190 struct shrinker_var {
191 #ifndef __INTEL_COMPILER
196 #define DEF_SHRINKER_VAR(name, shrink, count, scan) \
197 struct shrinker_var name = {};
199 #define DEFAULT_SEEKS (0)
202 struct shrinker *set_shrinker(int seeks, struct shrinker_var *var)
204 return (struct shrinker *)0xdeadbea1; /* Cannot return NULL here */
207 static inline void remove_shrinker(struct shrinker *shrinker)
211 /***************************************************************************
213 * Linux kernel radix tree emulation.
215 * XXX this stub-implementation assumes that elements stored in a radix tree
216 * are struct page's and nothing else. Proper implementation will be
219 ***************************************************************************/
221 struct radix_tree_root {
222 struct list_head list;
226 struct radix_tree_node {
227 struct list_head _node;
232 #define RADIX_TREE_INIT(mask) { \
236 #define RADIX_TREE(name, mask) \
237 struct radix_tree_root name = RADIX_TREE_INIT(mask)
240 #define INIT_RADIX_TREE(root, mask) \
242 INIT_LIST_HEAD(&((struct radix_tree_root *)root)->list); \
243 ((struct radix_tree_root *)root)->rnode = NULL; \
246 static inline int radix_tree_insert(struct radix_tree_root *root,
247 unsigned long idx, void *item)
249 struct radix_tree_node *node;
250 node = malloc(sizeof(*node));
254 INIT_LIST_HEAD(&node->_node);
257 list_add_tail(&node->_node, &root->list);
258 root->rnode = (void *)1001;
262 static inline struct radix_tree_node *
263 radix_tree_lookup0(struct radix_tree_root *root, unsigned long idx)
265 struct radix_tree_node *node;
267 if (list_empty(&root->list))
270 list_for_each_entry(node, &root->list, _node)
271 if (node->index == idx)
277 static inline void *radix_tree_lookup(struct radix_tree_root *root,
280 struct radix_tree_node *node = radix_tree_lookup0(root, idx);
287 static inline void *radix_tree_delete(struct radix_tree_root *root,
290 struct radix_tree_node *p = radix_tree_lookup0(root, idx);
296 list_del_init(&p->_node);
299 if (list_empty(&root->list))
305 static inline unsigned int
306 radix_tree_gang_lookup(struct radix_tree_root *root, void **results,
307 unsigned long first_index, unsigned int max_items)
312 for (i = 0; i < max_items; i++, first_index++) {
313 results[j++] = radix_tree_lookup(root, first_index);
314 if (results[j - 1] == NULL)
321 static inline int radix_tree_preload(int gfp_mask)
326 void radix_tree_init(void);
328 static inline void radix_tree_preload_end(void)
332 /***************************************************************************
334 * Linux kernel red black tree emulation.
336 ***************************************************************************/
338 unsigned long rb_parent_color;
341 struct rb_node *rb_right;
342 struct rb_node *rb_left;
346 struct rb_node *rb_node;
350 #define rb_parent(r) ((struct rb_node *)((r)->rb_parent_color & ~3))
351 #define rb_color(r) ((r)->rb_parent_color & 1)
352 #define rb_is_red(r) (!rb_color(r))
353 #define rb_is_black(r) rb_color(r)
354 #define rb_set_red(r) do { (r)->rb_parent_color &= ~1; } while (0)
355 #define rb_set_black(r) do { (r)->rb_parent_color |= 1; } while (0)
357 static inline void rb_set_parent(struct rb_node *rb, struct rb_node *p)
359 rb->rb_parent_color = (rb->rb_parent_color & 3) | (unsigned long)p;
361 static inline void rb_set_color(struct rb_node *rb, int color)
363 rb->rb_parent_color = (rb->rb_parent_color & ~1) | color;
366 #define RB_ROOT ((struct rb_root) { NULL, })
367 #define rb_entry(ptr, type, member) container_of(ptr, type, member)
369 #define RB_EMPTY_ROOT(root) ((root)->rb_node == NULL)
370 #define RB_EMPTY_NODE(node) (rb_parent(node) == node)
371 #define RB_CLEAR_NODE(node) (rb_set_parent(node, node))
373 static inline void rb_init_node(struct rb_node *rb)
375 rb->rb_parent_color = 0;
381 extern void rb_insert_color(struct rb_node *, struct rb_root *);
382 extern void rb_erase(struct rb_node *, struct rb_root *);
384 /* Find logical next and previous nodes in a tree */
385 extern struct rb_node *rb_next(const struct rb_node *);
386 extern struct rb_node *rb_prev(const struct rb_node *);
387 extern struct rb_node *rb_first(const struct rb_root *);
388 extern struct rb_node *rb_last(const struct rb_root *);
389 static inline void rb_link_node(struct rb_node *node, struct rb_node *parent,
390 struct rb_node **rb_link)
392 node->rb_parent_color = (unsigned long)parent;
393 node->rb_left = node->rb_right = NULL;
398 /***************************************************************************
400 * End of Linux kernel red black tree emulation.
402 ***************************************************************************/
404 typedef ssize_t (*read_actor_t)();
408 # define IFTODT(type) (((type) & S_IFMT) >> IFSHIFT)
409 # define DTTOIF(dirtype) ((dirtype) << IFSHIFT)
413 #define ERESTARTSYS ERESTART