X-Git-Url: https://git.whamcloud.com/?p=fs%2Flustre-release.git;a=blobdiff_plain;f=lustre%2Finclude%2Fliblustre.h;h=bf34f0475ff90abf6b62dc6372a7df7760c18889;hp=21338884003cda4ef2bef054fbfa64793e19ff9f;hb=9496591a7f31e8766ee1124725fbab3841d8baef;hpb=57e6d88a8a8d858e2d74aeefba4c764ad08cf86d diff --git a/lustre/include/liblustre.h b/lustre/include/liblustre.h index 2133888..bf34f04 100644 --- a/lustre/include/liblustre.h +++ b/lustre/include/liblustre.h @@ -1,247 +1,120 @@ -/* -*- mode: c; c-basic-offset: 8; indent-tabs-mode: nil; -*- - * vim:expandtab:shiftwidth=8:tabstop=8: +/* + * GPL HEADER START * - * Copyright (C) 2001 Cluster File Systems, Inc. + * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * - * This file is part of Lustre, http://www.lustre.org. + * This program is free software; you can redistribute it and/or modify + * it under the terms of the GNU General Public License version 2 only, + * as published by the Free Software Foundation. * - * Lustre is free software; you can redistribute it and/or - * modify it under the terms of version 2 of the GNU General Public - * License as published by the Free Software Foundation. + * This program is distributed in the hope that it will be useful, but + * WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + * General Public License version 2 for more details (a copy is included + * in the LICENSE file that accompanied this code). * - * Lustre is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU General Public License for more details. + * You should have received a copy of the GNU General Public License + * version 2 along with this program; If not, see + * http://www.sun.com/software/products/lustre/docs/GPLv2.pdf * - * You should have received a copy of the GNU General Public License - * along with Lustre; if not, write to the Free Software - * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. + * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, + * CA 95054 USA or visit www.sun.com if you need additional information or + * have any questions. * - * User-space Lustre headers. + * GPL HEADER END + */ +/* + * Copyright (c) 2003, 2010, Oracle and/or its affiliates. All rights reserved. + * Use is subject to license terms. * + * Copyright (c) 2011, 2012, Whamcloud, Inc. */ +/* + * This file is part of Lustre, http://www.lustre.org/ + * Lustre is a trademark of Sun Microsystems, Inc. + * + * lustre/include/liblustre.h + * + * User-space Lustre headers. + */ + #ifndef LIBLUSTRE_H__ #define LIBLUSTRE_H__ -#include -#include -#ifndef __CYGWIN__ -#include -#include -#else -#include -#include "ioctl.h" +/** \defgroup liblustre liblustre + * + * @{ + */ +#include +#include + +#ifdef __KERNEL__ +#error Kernel files should not #include #endif -#include -#include -#include -#include -#include -#include -#include - -#include -#include -#include + +#include +#include /* definitions for liblustre */ #ifdef __CYGWIN__ -#define PAGE_SHIFT 12 -#define PAGE_SIZE (1UL << PAGE_SHIFT) -#define PAGE_MASK (~(PAGE_SIZE-1)) -#define loff_t __u64 +#define loff_t long long #define ERESTART 2001 -typedef unsigned short umode_t; +typedef unsigned short cfs_umode_t; #endif -/* This is because lprocfs_status.h gets included here indirectly. It would - * be much better to just avoid lprocfs being included into liblustre entirely - * but that requires more header surgery than I can handle right now. - */ -#ifndef smp_processor_id -#define smp_processor_id() 0 +#ifndef page_private +#define page_private(page) ((page)->private) +#define set_page_private(page, v) ((page)->private = (v)) #endif -/* always adopt 2.5 definitions */ -#define KERNEL_VERSION(a,b,c) ((a)*100+(b)*10+c) -#define LINUX_VERSION_CODE (2*200+5*10+0) +/* + * The inter_module_get implementation is specific to liblustre, so this needs + * to stay here for now. + */ static inline void inter_module_put(void *a) { return; } - -extern ptl_handle_ni_t tcpnal_ni; - void *inter_module_get(char *arg); -/* cheats for now */ - -struct work_struct { - void (*ws_task)(void *arg); - void *ws_arg; -}; - -static inline void prepare_work(struct work_struct *q, void (*t)(void *), - void *arg) -{ - q->ws_task = t; - q->ws_arg = arg; - return; -} - -static inline void schedule_work(struct work_struct *q) -{ - q->ws_task(q->ws_arg); -} - - -#define strnlen(a,b) strlen(a) -static inline void *kmalloc(int size, int prot) -{ - return malloc(size); -} -#define vmalloc malloc -#define vfree free -#define kfree(a) free(a) -#define GFP_KERNEL 1 -#define GFP_HIGHUSER 1 -#define GFP_ATOMIC 1 -#define GFP_NOFS 1 -#define IS_ERR(a) (((a) && abs((long)(a)) < 500) ? 1 : 0) -#define PTR_ERR(a) ((long)(a)) -#define ERR_PTR(a) ((void*)((long)(a))) - -#define capable(foo) 1 -#define CAP_SYS_ADMIN 1 - -typedef struct { - void *cwd; -}mm_segment_t; - -typedef int (read_proc_t)(char *page, char **start, off_t off, - int count, int *eof, void *data); - -struct file; /* forward ref */ -typedef int (write_proc_t)(struct file *file, const char *buffer, - unsigned long count, void *data); - -# define le16_to_cpu(x) __le16_to_cpu(x) -# define cpu_to_le16(x) __cpu_to_le16(x) -# define le32_to_cpu(x) __le32_to_cpu(x) -# define cpu_to_le32(x) __cpu_to_le32(x) -# define le64_to_cpu(x) __le64_to_cpu(x) -# define cpu_to_le64(x) __cpu_to_le64(x) - -#define NIPQUAD(addr) \ - ((unsigned char *)&addr)[0], \ - ((unsigned char *)&addr)[1], \ - ((unsigned char *)&addr)[2], \ - ((unsigned char *)&addr)[3] - -#if defined(__LITTLE_ENDIAN) -#define HIPQUAD(addr) \ - ((unsigned char *)&addr)[3], \ - ((unsigned char *)&addr)[2], \ - ((unsigned char *)&addr)[1], \ - ((unsigned char *)&addr)[0] -#elif defined(__BIG_ENDIAN) -#define HIPQUAD NIPQUAD -#else -#error "Undefined byteorder??" -#endif /* __LITTLE_ENDIAN */ - /* bits ops */ -static __inline__ int set_bit(int nr,long * addr) -{ - int mask, retval; - - addr += nr >> 5; - mask = 1 << (nr & 0x1f); - retval = (mask & *addr) != 0; - *addr |= mask; - return retval; -} -static __inline__ int clear_bit(int nr, long * addr) -{ - int mask, retval; - - addr += nr >> 5; - mask = 1 << (nr & 0x1f); - retval = (mask & *addr) != 0; - *addr &= ~mask; - return retval; -} - -static __inline__ int test_bit(int nr, long * addr) -{ - int mask; - - addr += nr >> 5; - mask = 1 << (nr & 0x1f); - return ((mask & *addr) != 0); -} +/* a long can be more than 32 bits, so use BITS_PER_LONG + * to allow the compiler to adjust the bit shifting accordingly + */ static __inline__ int ext2_set_bit(int nr, void *addr) { - return set_bit(nr, (long*)addr); +#ifdef __BIG_ENDIAN + return cfs_set_bit((nr ^ ((BITS_PER_LONG-1) & ~0x7)), addr); +#else + return cfs_set_bit(nr, addr); +#endif } static __inline__ int ext2_clear_bit(int nr, void *addr) { - return clear_bit(nr, (long*)addr); +#ifdef __BIG_ENDIAN + return cfs_clear_bit((nr ^ ((BITS_PER_LONG-1) & ~0x7)), addr); +#else + return cfs_clear_bit(nr, addr); +#endif } static __inline__ int ext2_test_bit(int nr, void *addr) { - return test_bit(nr, (long*)addr); -} - -/* modules */ - -struct module { - int count; -}; - -static inline void MODULE_AUTHOR(char *name) -{ - printf("%s\n", name); -} -#define MODULE_DESCRIPTION(name) MODULE_AUTHOR(name) -#define MODULE_LICENSE(name) MODULE_AUTHOR(name) - -#define THIS_MODULE NULL -#define __init -#define __exit - -/* devices */ - -static inline int misc_register(void *foo) -{ - return 0; -} - -static inline int misc_deregister(void *foo) -{ - return 0; -} - -static inline int request_module(char *name) -{ - return (-EINVAL); +#ifdef __BIG_ENDIAN + __const__ unsigned char *tmp = (__const__ unsigned char *) addr; + return (tmp[nr >> 3] >> (nr & 7)) & 1; +#else + return cfs_test_bit(nr, addr); +#endif } -#define __MOD_INC_USE_COUNT(m) do {} while (0) -#define __MOD_DEC_USE_COUNT(m) do {} while (0) -#define MOD_INC_USE_COUNT do {} while (0) -#define MOD_DEC_USE_COUNT do {} while (0) -#define try_module_get __MOD_INC_USE_COUNT -#define module_put __MOD_DEC_USE_COUNT /* module initialization */ extern int init_obdclass(void); @@ -250,189 +123,49 @@ extern int ldlm_init(void); extern int osc_init(void); extern int lov_init(void); extern int mdc_init(void); +extern int lmv_init(void); +extern int mgc_init(void); extern int echo_client_init(void); /* general stuff */ -#define jiffies 0 - -#define EXPORT_SYMBOL(S) - -typedef int spinlock_t; -typedef __u64 kdev_t; - -#define SPIN_LOCK_UNLOCKED 0 -#define LASSERT_SPIN_LOCKED(lock) do {} while(0) - -static inline void spin_lock(spinlock_t *l) {return;} -static inline void spin_unlock(spinlock_t *l) {return;} -static inline void spin_lock_init(spinlock_t *l) {return;} -static inline void local_irq_save(unsigned long flag) {return;} -static inline void local_irq_restore(unsigned long flag) {return;} -static inline int spin_is_locked(spinlock_t *l) {return 1;} - -static inline void spin_lock_bh(spinlock_t *l) {} -static inline void spin_unlock_bh(spinlock_t *l) {} -static inline void spin_lock_irqsave(spinlock_t *a, unsigned long b) {} -static inline void spin_unlock_irqrestore(spinlock_t *a, unsigned long b) {} +#ifndef min #define min(x,y) ((x)<(y) ? (x) : (y)) +#endif + +#ifndef max #define max(x,y) ((x)>(y) ? (x) : (y)) +#endif #ifndef min_t #define min_t(type,x,y) \ - ({ type __x = (x); type __y = (y); __x < __y ? __x: __y; }) + ({ type __x = (x); type __y = (y); __x < __y ? __x: __y; }) #endif #ifndef max_t #define max_t(type,x,y) \ - ({ type __x = (x); type __y = (y); __x > __y ? __x: __y; }) + ({ type __x = (x); type __y = (y); __x > __y ? __x: __y; }) #endif -/* registering symbols */ +#define simple_strtol strtol +/* registering symbols */ +#ifndef ERESTARTSYS #define ERESTARTSYS ERESTART -#define HZ 1 +#endif +#define CFS_HZ 1 /* random */ -static inline void get_random_bytes(void *ptr, int size) -{ - int *p = (int *)ptr; - int i, count = size/sizeof(int); - - for (i = 0; i< count; i++) - *p++ = rand(); -} +void cfs_get_random_bytes(void *ptr, int size); /* memory */ -/* FIXME */ -#define num_physpages (16 * 1024) +/* memory size: used for some client tunables */ +#define cfs_num_physpages (256 * 1024) /* 1GB */ +#define CFS_NUM_CACHEPAGES cfs_num_physpages -static inline int copy_from_user(void *a,void *b, int c) -{ - memcpy(a,b,c); - return 0; -} - -static inline int copy_to_user(void *a,void *b, int c) -{ - memcpy(a,b,c); - return 0; -} - - -/* slabs */ -typedef struct { - int size; -} kmem_cache_t; -#define SLAB_HWCACHE_ALIGN 0 -static inline kmem_cache_t * -kmem_cache_create(const char *name, size_t objsize, size_t cdum, - unsigned long d, - void (*e)(void *, kmem_cache_t *, unsigned long), - void (*f)(void *, kmem_cache_t *, unsigned long)) -{ - kmem_cache_t *c; - c = malloc(sizeof(*c)); - if (!c) - return NULL; - c->size = objsize; - CDEBUG(D_MALLOC, "alloc slab cache %s at %p, objsize %d\n", - name, c, (int)objsize); - return c; -}; - -static inline int kmem_cache_destroy(kmem_cache_t *a) -{ - CDEBUG(D_MALLOC, "destroy slab cache %p, objsize %u\n", a, a->size); - free(a); - return 0; -} -#define kmem_cache_alloc(cache, prio) malloc(cache->size) -#define kmem_cache_free(cache, obj) free(obj) - -#define PAGE_CACHE_SIZE PAGE_SIZE -#define PAGE_CACHE_SHIFT 12 -#define PAGE_CACHE_MASK PAGE_MASK - -/* XXX - * for this moment, liblusre will not rely OST for non-page-aligned write - */ -#define LIBLUSTRE_HANDLE_UNALIGNED_PAGE - -struct page { - void *addr; - unsigned long index; - struct list_head list; - unsigned long private; - - /* internally used by liblustre file i/o */ - int _offset; - int _count; -#ifdef LIBLUSTRE_HANDLE_UNALIGNED_PAGE - int _managed; -#endif -}; - -#define kmap(page) (page)->addr -#define kunmap(a) do {} while (0) - -static inline struct page *alloc_pages(int mask, unsigned long order) -{ - struct page *pg = malloc(sizeof(*pg)); - - if (!pg) - return NULL; -#if 0 //#ifdef MAP_ANONYMOUS - pg->addr = mmap(0, PAGE_SIZE << order, PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0); -#else - pg->addr = malloc(PAGE_SIZE << order); -#endif - - if (!pg->addr) { - free(pg); - return NULL; - } - return pg; -} - -#define alloc_page(mask) alloc_pages((mask), 0) - -static inline void __free_pages(struct page *pg, int what) -{ -#if 0 //#ifdef MAP_ANONYMOUS - munmap(pg->addr, PAGE_SIZE); -#else - free(pg->addr); -#endif - free(pg); -} - -#define __free_page(page) __free_pages((page), 0) -#define free_page(page) __free_page(page) - -static inline struct page* __grab_cache_page(unsigned long index) -{ - struct page *pg = alloc_pages(0, 0); - - if (pg) - pg->index = index; - return pg; -} - -#define grab_cache_page(index) __grab_cache_page(index) -#define page_cache_release(page) __free_pages(page, 0) - -/* arithmetic */ -#define do_div(a,b) \ - ({ \ - unsigned long remainder;\ - remainder = (a) % (b); \ - (a) = (a) / (b); \ - (remainder); \ - }) /* VFS stuff */ #define ATTR_MODE 0x0001 @@ -449,10 +182,14 @@ static inline struct page* __grab_cache_page(unsigned long index) #define ATTR_RAW 0x0800 /* file system, not vfs will massage attrs */ #define ATTR_FROM_OPEN 0x1000 /* called from open path, ie O_TRUNC */ #define ATTR_CTIME_SET 0x2000 +#define ATTR_BLOCKS 0x4000 +#define ATTR_KILL_SUID 0 +#define ATTR_KILL_SGID 0 +#define ATTR_FILE 0 struct iattr { unsigned int ia_valid; - umode_t ia_mode; + cfs_umode_t ia_mode; uid_t ia_uid; gid_t ia_gid; loff_t ia_size; @@ -462,19 +199,7 @@ struct iattr { unsigned int ia_attr_flags; }; -#define IT_OPEN 0x0001 -#define IT_CREAT 0x0002 -#define IT_READDIR 0x0004 -#define IT_GETATTR 0x0008 -#define IT_LOOKUP 0x0010 -#define IT_UNLINK 0x0020 -#define IT_GETXATTR 0x0040 -#define IT_EXEC 0x0080 -#define IT_PIN 0x0100 - -#define IT_FL_LOCKED 0x0001 -#define IT_FL_FOLLOWED 0x0002 /* set by vfs_follow_link */ - +/* defined in kernel header include/linux/namei.h */ #define INTENT_MAGIC 0x19620323 struct lustre_intent_data { @@ -483,7 +208,6 @@ struct lustre_intent_data { __u64 it_lock_handle; void *it_data; int it_lock_mode; - int it_int_flags; }; struct lookup_intent { int it_magic; @@ -504,7 +228,6 @@ static inline void intent_init(struct lookup_intent *it, int op, int flags) it->it_flags = flags; } - struct dentry { int d_count; }; @@ -513,79 +236,44 @@ struct vfsmount { void *pwd; }; -/* semaphores */ -struct rw_semaphore { - int count; -}; - -/* semaphores */ -struct semaphore { - int count; -}; - -#define down(a) do {} while (0) -#define up(a) do {} while (0) -#define down_read(a) do {} while (0) -#define up_read(a) do {} while (0) -#define down_write(a) do {} while (0) -#define up_write(a) do {} while (0) -#define sema_init(a,b) do {} while (0) -#define init_rwsem(a) do {} while (0) -#define DECLARE_MUTEX(name) \ - struct semaphore name = { 1 } -static inline void init_MUTEX (struct semaphore *sem) -{ - sema_init(sem, 1); -} - - -typedef struct { - struct list_head sleepers; -} wait_queue_head_t; - -typedef struct { - struct list_head sleeping; - void *process; -} wait_queue_t; - struct signal { int signal; }; -struct fs_struct { - int umask; -}; +#undef LL_TASK_CL_ENV +#define LL_TASK_CL_ENV cl_env struct task_struct { - struct fs_struct *fs; int state; struct signal pending; char comm[32]; + int uid; + int gid; int pid; int fsuid; int fsgid; + int max_groups; + int ngroups; + gid_t *groups; + void *cl_env; __u32 cap_effective; }; -extern struct task_struct *current; - -#define in_group_p(a) 0 /* FIXME */ -#define set_current_state(foo) do { current->state = foo; } while (0) +typedef struct task_struct cfs_task_t; +#define cfs_current() current +#define cfs_curproc_pid() (current->pid) +#define cfs_curproc_comm() (current->comm) +#define cfs_curproc_fsuid() (current->fsuid) +#define cfs_curproc_fsgid() (current->fsgid) -#define init_waitqueue_entry(q,p) do { (q)->process = p; } while (0) -#define add_wait_queue(q,p) do { list_add(&(q)->sleepers, &(p)->sleeping); } while (0) -#define del_wait_queue(p) do { list_del(&(p)->sleeping); } while (0) -#define remove_wait_queue(q,p) do { list_del(&(p)->sleeping); } while (0) +extern struct task_struct *current; +int cfs_curproc_is_in_groups(gid_t gid); -#define init_waitqueue_head(l) INIT_LIST_HEAD(&(l)->sleepers) -#define wake_up(l) do { int a; a++; } while (0) -#define TASK_INTERRUPTIBLE 0 -#define TASK_UNINTERRUPTIBLE 1 -#define TASK_RUNNING 2 +#define cfs_set_current_state(foo) do { current->state = foo; } while (0) -#define wait_event_interruptible(wq, condition) \ -({ \ +#define cfs_wait_event_interruptible(wq, condition, ret) \ +{ \ struct l_wait_info lwi; \ int timeout = 100000000;/* for ever */ \ int ret; \ @@ -594,72 +282,28 @@ extern struct task_struct *current; ret = l_wait_event(NULL, condition, &lwi); \ \ ret; \ -}) - -#define in_interrupt() (0) - -#define schedule() do {} while (0) -static inline int schedule_timeout(signed long t) -{ - return 0; } -#define lock_kernel() do {} while (0) #define daemonize(l) do {} while (0) #define sigfillset(l) do {} while (0) #define recalc_sigpending(l) do {} while (0) -#define kernel_thread(l,m,n) LBUG() #define USERMODEHELPER(path, argv, envp) (0) #define SIGNAL_MASK_ASSERT() -#define KERN_INFO - - -struct timer_list { - struct list_head tl_list; - void (*function)(unsigned long unused); - unsigned long data; - long expires; -}; - -static inline int timer_pending(struct timer_list *l) -{ - if (l->expires > jiffies) - return 1; - else - return 0; -} +#define CFS_KERN_INFO -static inline int init_timer(struct timer_list *l) -{ - INIT_LIST_HEAD(&l->tl_list); - return 0; -} - -static inline void mod_timer(struct timer_list *l, int thetime) -{ - l->expires = thetime; -} - -static inline void del_timer(struct timer_list *l) -{ - free(l); -} - -#define time_after(a, b) \ -({ \ - 1; \ +#if CFS_HZ != 1 +#error "liblustre's jiffies currently expects HZ to be 1" +#endif +#define jiffies \ +({ \ + unsigned long _ret = 0; \ + struct timeval tv; \ + if (gettimeofday(&tv, NULL) == 0) \ + _ret = tv.tv_sec; \ + _ret; \ }) - -typedef struct { volatile int counter; } atomic_t; - -#define atomic_read(a) ((a)->counter) -#define atomic_set(a,b) do {(a)->counter = b; } while (0) -#define atomic_dec_and_test(a) ((--((a)->counter)) == 0) -#define atomic_inc(a) (((a)->counter)++) -#define atomic_dec(a) do { (a)->counter--; } while (0) -#define atomic_add(b,a) do {(a)->counter += b;} while (0) -#define atomic_sub(b,a) do {(a)->counter -= b;} while (0) +#define get_jiffies_64() (__u64)jiffies #ifndef likely #define likely(exp) (exp) @@ -668,56 +312,189 @@ typedef struct { volatile int counter; } atomic_t; #define unlikely(exp) (exp) #endif -/* log related */ -static inline int llog_init_commit_master(void) { return 0; } -static inline int llog_cleanup_commit_master(int force) { return 0; } -static inline void portals_run_lbug_upcall(char *file, const char *fn, +#define cfs_might_sleep() +#define might_sleep_if(c) +#define smp_mb() + +/* FIXME sys/capability will finally included linux/fs.h thus + * cause numerous trouble on x86-64. as temporary solution for + * build broken at Cray, we copy definition we need from capability.h + * FIXME + */ +struct _cap_struct; +typedef struct _cap_struct *cap_t; +typedef int cap_value_t; +typedef enum { + CAP_EFFECTIVE=0, + CAP_PERMITTED=1, + CAP_INHERITABLE=2 +} cap_flag_t; +typedef enum { + CAP_CLEAR=0, + CAP_SET=1 +} cap_flag_value_t; + +cap_t cap_get_proc(void); +int cap_get_flag(cap_t, cap_value_t, cap_flag_t, cap_flag_value_t *); + +static inline void libcfs_run_lbug_upcall(char *file, const char *fn, const int l){} -#define LBUG() \ - do { \ - printf("!!!LBUG at %s:%d\n", __FILE__, __LINE__); \ - sleep(1000000); \ - } while (0) +struct liblustre_wait_callback { + cfs_list_t llwc_list; + const char *llwc_name; + int (*llwc_fn)(void *arg); + void *llwc_arg; +}; + +void *liblustre_register_wait_callback(const char *name, + int (*fn)(void *arg), void *arg); +void liblustre_deregister_wait_callback(void *notifier); +int liblustre_wait_event(int timeout); + +void *liblustre_register_idle_callback(const char *name, + int (*fn)(void *arg), void *arg); +void liblustre_deregister_idle_callback(void *notifier); +void liblustre_wait_idle(void); + +/* flock related */ +struct nfs_lock_info { + __u32 state; + __u32 flags; + void *host; +}; + +typedef struct file_lock { + struct file_lock *fl_next; /* singly linked list for this inode */ + cfs_list_t fl_link; /* doubly linked list of all locks */ + cfs_list_t fl_block; /* circular list of blocked processes */ + void *fl_owner; + unsigned int fl_pid; + cfs_waitq_t fl_wait; + struct file *fl_file; + unsigned char fl_flags; + unsigned char fl_type; + loff_t fl_start; + loff_t fl_end; + + void (*fl_notify)(struct file_lock *); /* unblock callback */ + void (*fl_insert)(struct file_lock *); /* lock insertion callback */ + void (*fl_remove)(struct file_lock *); /* lock removal callback */ + + void *fl_fasync; /* for lease break notifications */ + unsigned long fl_break_time; /* for nonblocking lease breaks */ + union { + struct nfs_lock_info nfs_fl; + } fl_u; +} cfs_flock_t; + +#define cfs_flock_type(fl) ((fl)->fl_type) +#define cfs_flock_set_type(fl, type) do { (fl)->fl_type = (type); } while(0) +#define cfs_flock_pid(fl) ((fl)->fl_pid) +#define cfs_flock_set_pid(fl, pid) do { (fl)->fl_pid = (pid); } while(0) +#define cfs_flock_start(fl) ((fl)->fl_start) +#define cfs_flock_set_start(fl, start) do { (fl)->fl_start = (start); } while(0) +#define cfs_flock_end(fl) ((fl)->fl_end) +#define cfs_flock_set_end(fl, end) do { (fl)->fl_end = (end); } while(0) + +#ifndef OFFSET_MAX +#define INT_LIMIT(x) (~((x)1 << (sizeof(x)*8 - 1))) +#define OFFSET_MAX INT_LIMIT(loff_t) +#endif -/* completion */ -struct completion { - unsigned int done; - wait_queue_head_t wait; +#define i_atime i_stbuf.st_atime +#define i_mtime i_stbuf.st_mtime +#define i_ctime i_stbuf.st_ctime +/* use i_size_read() i_size_write() to access i_stbuf.st_size */ +#define i_blocks i_stbuf.st_blocks +#define i_blksize i_stbuf.st_blksize +#define i_mode i_stbuf.st_mode +#define i_uid i_stbuf.st_uid +#define i_gid i_stbuf.st_gid + +/* XXX: defined in kernel */ +#define FL_POSIX 1 +#define FL_SLEEP 128 + +/* quota */ +#define QUOTA_OK 0 +#define NO_QUOTA 1 + +/* ACL */ +typedef struct { + __u16 e_tag; + __u16 e_perm; + __u32 e_id; +} posix_acl_xattr_entry; + +struct posix_acl { + cfs_atomic_t a_refcount; + unsigned int a_count; + posix_acl_xattr_entry a_entries[0]; }; -#define COMPLETION_INITIALIZER(work) \ - { 0, __WAIT_QUEUE_HEAD_INITIALIZER((work).wait) } +typedef struct { + __u32 a_version; + posix_acl_xattr_entry a_entries[0]; +} posix_acl_xattr_header; -#define DECLARE_COMPLETION(work) \ - struct completion work = COMPLETION_INITIALIZER(work) +static inline size_t posix_acl_xattr_size(int count) +{ + return sizeof(posix_acl_xattr_header) + count * + sizeof(posix_acl_xattr_entry); +} -#define INIT_COMPLETION(x) ((x).done = 0) +static inline +struct posix_acl * posix_acl_from_xattr(const void *value, size_t size) +{ + return NULL; +} -static inline void init_completion(struct completion *x) +static inline +int posix_acl_valid(const struct posix_acl *acl) { - x->done = 0; - init_waitqueue_head(&x->wait); + return 0; } -struct liblustre_wait_callback { - struct list_head llwc_list; - int (*llwc_fn)(void *arg); - void *llwc_arg; +static inline +void posix_acl_release(struct posix_acl *acl) +{ +} + +#if defined(LIBLUSTRE_POSIX_ACL) && !defined(CONFIG_FS_POSIX_ACL) +# define CONFIG_FS_POSIX_ACL 1 +#endif + +#ifndef ENOTSUPP +#define ENOTSUPP ENOTSUP +#endif + +typedef int mm_segment_t; +enum { + KERNEL_DS, + USER_DS }; +static inline mm_segment_t get_fs(void) +{ + return USER_DS; +} -void *liblustre_register_wait_callback(int (*fn)(void *arg), void *arg); -void liblustre_deregister_wait_callback(void *notifier); -int liblustre_wait_event(int timeout); +static inline void set_fs(mm_segment_t seg) +{ +} + +#define S_IRWXUGO (S_IRWXU|S_IRWXG|S_IRWXO) +#define S_IALLUGO (S_ISUID|S_ISGID|S_ISVTX|S_IRWXUGO) -#include -#include -#include -#include -#include -#include +#include +#include +#include +#include +#include +#include +/** @} liblustre */ #endif