1 /* -*- mode: c; c-basic-offset: 8; indent-tabs-mode: nil; -*-
2 * vim:expandtab:shiftwidth=8:tabstop=8:
4 * Copyright (C) 2001 Cluster File Systems, Inc. <info@clusterfs.com>
6 * This file is part of Lustre, http://www.lustre.org.
8 * Lustre is free software; you can redistribute it and/or
9 * modify it under the terms of version 2 of the GNU General Public
10 * License as published by the Free Software Foundation.
12 * Lustre is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 * GNU General Public License for more details.
17 * You should have received a copy of the GNU General Public License
18 * along with Lustre; if not, write to the Free Software
19 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21 * User-space Lustre headers.
32 #include <sys/types.h>
36 #include <sys/ioctl.h>
43 #include <portals/list.h>
44 #include <portals/p30.h>
45 #include <linux/kp30.h>
47 /* definitions for liblustre */
52 #define PAGE_SIZE (1UL << PAGE_SHIFT)
53 #define PAGE_MASK (~(PAGE_SIZE-1))
54 #define loff_t long long
56 typedef unsigned short umode_t;
60 /* This is because lprocfs_status.h gets included here indirectly. It would
61 * be much better to just avoid lprocfs being included into liblustre entirely
62 * but that requires more header surgery than I can handle right now.
64 #ifndef smp_processor_id
65 #define smp_processor_id() 0
68 /* always adopt 2.5 definitions */
69 #define KERNEL_VERSION(a,b,c) ((a)*100+(b)*10+c)
70 #define LINUX_VERSION_CODE (2*200+5*10+0)
72 static inline void inter_module_put(void *a)
77 extern ptl_handle_ni_t tcpnal_ni;
79 void *inter_module_get(char *arg);
84 void (*ws_task)(void *arg);
88 static inline void prepare_work(struct work_struct *q, void (*t)(void *),
96 static inline void schedule_work(struct work_struct *q)
98 q->ws_task(q->ws_arg);
102 #define strnlen(a,b) strlen(a)
103 static inline void *kmalloc(int size, int prot)
107 #define vmalloc malloc
109 #define kfree(a) free(a)
111 #define GFP_HIGHUSER 1
114 #define IS_ERR(a) (((a) && abs((long)(a)) < 500) ? 1 : 0)
115 #define PTR_ERR(a) ((long)(a))
116 #define ERR_PTR(a) ((void*)((long)(a)))
122 typedef int (read_proc_t)(char *page, char **start, off_t off,
123 int count, int *eof, void *data);
125 struct file; /* forward ref */
126 typedef int (write_proc_t)(struct file *file, const char *buffer,
127 unsigned long count, void *data);
129 #define NIPQUAD(addr) \
130 ((unsigned char *)&addr)[0], \
131 ((unsigned char *)&addr)[1], \
132 ((unsigned char *)&addr)[2], \
133 ((unsigned char *)&addr)[3]
135 #if defined(__LITTLE_ENDIAN)
136 #define HIPQUAD(addr) \
137 ((unsigned char *)&addr)[3], \
138 ((unsigned char *)&addr)[2], \
139 ((unsigned char *)&addr)[1], \
140 ((unsigned char *)&addr)[0]
141 #elif defined(__BIG_ENDIAN)
142 #define HIPQUAD NIPQUAD
144 #error "Undefined byteorder??"
145 #endif /* __LITTLE_ENDIAN */
148 static __inline__ int set_bit(int nr,long * addr)
153 mask = 1 << (nr & 0x1f);
154 retval = (mask & *addr) != 0;
159 static __inline__ int clear_bit(int nr, long * addr)
164 mask = 1 << (nr & 0x1f);
165 retval = (mask & *addr) != 0;
170 static __inline__ int test_bit(int nr, long * addr)
175 mask = 1 << (nr & 0x1f);
176 return ((mask & *addr) != 0);
179 static __inline__ int ext2_set_bit(int nr, void *addr)
181 return set_bit(nr, (long*)addr);
184 static __inline__ int ext2_clear_bit(int nr, void *addr)
186 return clear_bit(nr, (long*)addr);
189 static __inline__ int ext2_test_bit(int nr, void *addr)
191 return test_bit(nr, (long*)addr);
200 static inline void MODULE_AUTHOR(char *name)
202 printf("%s\n", name);
204 #define MODULE_DESCRIPTION(name) MODULE_AUTHOR(name)
205 #define MODULE_LICENSE(name) MODULE_AUTHOR(name)
207 #define THIS_MODULE NULL
213 static inline int misc_register(void *foo)
218 static inline int misc_deregister(void *foo)
223 static inline int request_module(char *name)
228 #define __MOD_INC_USE_COUNT(m) do {} while (0)
229 #define __MOD_DEC_USE_COUNT(m) do {} while (0)
230 #define MOD_INC_USE_COUNT do {} while (0)
231 #define MOD_DEC_USE_COUNT do {} while (0)
232 static inline void __module_get(struct module *module)
236 static inline int try_module_get(struct module *module)
241 static inline void module_put(struct module *module)
245 /* module initialization */
246 extern int init_obdclass(void);
247 extern int ptlrpc_init(void);
248 extern int ldlm_init(void);
249 extern int osc_init(void);
250 extern int lov_init(void);
251 extern int mdc_init(void);
252 extern int echo_client_init(void);
258 #define EXPORT_SYMBOL(S)
260 typedef struct { } spinlock_t;
261 typedef __u64 kdev_t;
263 #define SPIN_LOCK_UNLOCKED (spinlock_t) { }
264 #define LASSERT_SPIN_LOCKED(lock) do {} while(0)
266 static inline void spin_lock(spinlock_t *l) {return;}
267 static inline void spin_unlock(spinlock_t *l) {return;}
268 static inline void spin_lock_init(spinlock_t *l) {return;}
269 static inline void local_irq_save(unsigned long flag) {return;}
270 static inline void local_irq_restore(unsigned long flag) {return;}
271 static inline int spin_is_locked(spinlock_t *l) {return 1;}
273 static inline void spin_lock_bh(spinlock_t *l) {}
274 static inline void spin_unlock_bh(spinlock_t *l) {}
275 static inline void spin_lock_irqsave(spinlock_t *a, unsigned long b) {}
276 static inline void spin_unlock_irqrestore(spinlock_t *a, unsigned long b) {}
278 #define min(x,y) ((x)<(y) ? (x) : (y))
279 #define max(x,y) ((x)>(y) ? (x) : (y))
282 #define min_t(type,x,y) \
283 ({ type __x = (x); type __y = (y); __x < __y ? __x: __y; })
286 #define max_t(type,x,y) \
287 ({ type __x = (x); type __y = (y); __x > __y ? __x: __y; })
290 /* registering symbols */
292 #define ERESTARTSYS ERESTART
297 void get_random_bytes(void *ptr, int size);
302 #define num_physpages (16 * 1024)
304 static inline int copy_from_user(void *a,void *b, int c)
310 static inline int copy_to_user(void *a,void *b, int c)
321 #define SLAB_HWCACHE_ALIGN 0
322 static inline kmem_cache_t *
323 kmem_cache_create(const char *name, size_t objsize, size_t cdum,
325 void (*e)(void *, kmem_cache_t *, unsigned long),
326 void (*f)(void *, kmem_cache_t *, unsigned long))
329 c = malloc(sizeof(*c));
333 CDEBUG(D_MALLOC, "alloc slab cache %s at %p, objsize %d\n",
334 name, c, (int)objsize);
338 static inline int kmem_cache_destroy(kmem_cache_t *a)
340 CDEBUG(D_MALLOC, "destroy slab cache %p, objsize %u\n", a, a->size);
344 #define kmem_cache_alloc(cache, prio) malloc(cache->size)
345 #define kmem_cache_free(cache, obj) free(obj)
347 #define PAGE_CACHE_SIZE PAGE_SIZE
348 #define PAGE_CACHE_SHIFT PAGE_SHIFT
349 #define PAGE_CACHE_MASK PAGE_MASK
354 struct list_head list;
355 unsigned long private;
357 /* internally used by liblustre file i/o */
363 #define PAGE_LIST_ENTRY list
364 #define PAGE_LIST(page) ((page)->list)
366 #define page_address(page) ((page)->addr)
367 #define kmap(page) (page)->addr
368 #define kunmap(a) do {} while (0)
370 static inline struct page *alloc_pages(int mask, unsigned long order)
372 struct page *pg = malloc(sizeof(*pg));
376 #if 0 //#ifdef MAP_ANONYMOUS
377 pg->addr = mmap(0, PAGE_SIZE << order, PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0);
379 pg->addr = malloc(PAGE_SIZE << order);
389 #define alloc_page(mask) alloc_pages((mask), 0)
391 static inline void __free_pages(struct page *pg, int what)
393 #if 0 //#ifdef MAP_ANONYMOUS
394 munmap(pg->addr, PAGE_SIZE);
401 #define __free_page(page) __free_pages((page), 0)
402 #define free_page(page) __free_page(page)
404 static inline struct page* __grab_cache_page(unsigned long index)
406 struct page *pg = alloc_pages(0, 0);
413 #define grab_cache_page(index) __grab_cache_page(index)
414 #define page_cache_release(page) __free_pages(page, 0)
417 #define do_div(a,b) \
419 unsigned long remainder;\
420 remainder = (a) % (b); \
426 #define ATTR_MODE 0x0001
427 #define ATTR_UID 0x0002
428 #define ATTR_GID 0x0004
429 #define ATTR_SIZE 0x0008
430 #define ATTR_ATIME 0x0010
431 #define ATTR_MTIME 0x0020
432 #define ATTR_CTIME 0x0040
433 #define ATTR_ATIME_SET 0x0080
434 #define ATTR_MTIME_SET 0x0100
435 #define ATTR_FORCE 0x0200 /* Not a change, but a change it */
436 #define ATTR_ATTR_FLAG 0x0400
437 #define ATTR_RAW 0x0800 /* file system, not vfs will massage attrs */
438 #define ATTR_FROM_OPEN 0x1000 /* called from open path, ie O_TRUNC */
439 #define ATTR_CTIME_SET 0x2000
442 unsigned int ia_valid;
450 unsigned int ia_attr_flags;
453 #define IT_OPEN 0x0001
454 #define IT_CREAT 0x0002
455 #define IT_READDIR 0x0004
456 #define IT_GETATTR 0x0008
457 #define IT_LOOKUP 0x0010
458 #define IT_UNLINK 0x0020
459 #define IT_GETXATTR 0x0040
460 #define IT_EXEC 0x0080
461 #define IT_PIN 0x0100
462 #define IT_CHDIR 0x0200
464 #define IT_FL_LOCKED 0x0001
465 #define IT_FL_FOLLOWED 0x0002 /* set by vfs_follow_link */
467 #define INTENT_MAGIC 0x19620323
469 struct lustre_intent_data {
472 __u64 it_lock_handle;
477 struct lookup_intent {
479 void (*it_op_release)(struct lookup_intent *);
484 struct lustre_intent_data lustre;
488 static inline void intent_init(struct lookup_intent *it, int op, int flags)
490 memset(it, 0, sizeof(*it));
491 it->it_magic = INTENT_MAGIC;
493 it->it_flags = flags;
506 struct rw_semaphore {
515 /* use the macro's argument to avoid unused warnings */
516 #define down(a) do { (void)a; } while (0)
517 #define up(a) do { (void)a; } while (0)
518 #define down_read(a) do { (void)a; } while (0)
519 #define up_read(a) do { (void)a; } while (0)
520 #define down_write(a) do { (void)a; } while (0)
521 #define up_write(a) do { (void)a; } while (0)
522 #define sema_init(a,b) do { (void)a; } while (0)
523 #define init_rwsem(a) do { (void)a; } while (0)
524 #define DECLARE_MUTEX(name) \
525 struct semaphore name = { 1 }
526 static inline void init_MUTEX (struct semaphore *sem)
533 struct list_head sleepers;
537 struct list_head sleeping;
550 struct fs_struct *fs;
552 struct signal pending;
562 struct fs_struct __fs;
565 extern struct task_struct *current;
566 int in_group_p(gid_t gid);
567 static inline int capable(int cap)
569 if (current->cap_effective & (1 << cap))
575 #define set_current_state(foo) do { current->state = foo; } while (0)
577 #define init_waitqueue_entry(q,p) do { (q)->process = p; } while (0)
578 #define add_wait_queue(q,p) do { list_add(&(q)->sleepers, &(p)->sleeping); } while (0)
579 #define del_wait_queue(p) do { list_del(&(p)->sleeping); } while (0)
580 #define remove_wait_queue(q,p) do { list_del(&(p)->sleeping); } while (0)
582 #define DECLARE_WAIT_QUEUE_HEAD(HEAD) \
583 wait_queue_head_t HEAD = { \
584 .sleepers = LIST_HEAD_INIT(HEAD.sleepers) \
586 #define init_waitqueue_head(l) INIT_LIST_HEAD(&(l)->sleepers)
587 #define wake_up(l) do { int a; a++; } while (0)
588 #define TASK_INTERRUPTIBLE 0
589 #define TASK_UNINTERRUPTIBLE 1
590 #define TASK_RUNNING 2
592 #define wait_event_interruptible(wq, condition) \
594 struct l_wait_info lwi; \
595 int timeout = 100000000;/* for ever */ \
598 lwi = LWI_TIMEOUT(timeout, NULL, NULL); \
599 ret = l_wait_event(NULL, condition, &lwi); \
604 #define in_interrupt() (0)
606 #define schedule() do {} while (0)
607 static inline int schedule_timeout(signed long t)
612 #define lock_kernel() do {} while (0)
613 #define daemonize(l) do {} while (0)
614 #define sigfillset(l) do {} while (0)
615 #define recalc_sigpending(l) do {} while (0)
616 #define kernel_thread(l,m,n) LBUG()
618 #define USERMODEHELPER(path, argv, envp) (0)
619 #define SIGNAL_MASK_ASSERT()
622 #include <sys/time.h>
624 #error "liblustre's jiffies currently expects HZ to be 1"
628 unsigned long _ret = 0; \
630 if (gettimeofday(&tv, NULL) == 0) \
634 #define time_after(a, b) ((long)(b) - (long)(a) < 0)
635 #define time_before(a, b) time_after(b,a)
638 struct list_head tl_list;
639 void (*function)(unsigned long unused);
644 static inline int timer_pending(struct timer_list *l)
646 if (l->expires > jiffies)
652 static inline int init_timer(struct timer_list *l)
654 INIT_LIST_HEAD(&l->tl_list);
658 static inline void mod_timer(struct timer_list *l, int thetime)
660 l->expires = thetime;
663 static inline void del_timer(struct timer_list *l)
668 typedef struct { volatile int counter; } atomic_t;
670 #define atomic_read(a) ((a)->counter)
671 #define atomic_set(a,b) do {(a)->counter = b; } while (0)
672 #define atomic_dec_and_test(a) ((--((a)->counter)) == 0)
673 #define atomic_inc(a) (((a)->counter)++)
674 #define atomic_dec(a) do { (a)->counter--; } while (0)
675 #define atomic_add(b,a) do {(a)->counter += b;} while (0)
676 #define atomic_sub(b,a) do {(a)->counter -= b;} while (0)
679 #define likely(exp) (exp)
682 #define unlikely(exp) (exp)
685 /* FIXME sys/capability will finally included linux/fs.h thus
686 * cause numerous trouble on x86-64. as temporary solution for
687 * build broken at cary, we copy definition we need from capability.h
691 typedef struct _cap_struct *cap_t;
692 typedef int cap_value_t;
703 #define CAP_DAC_OVERRIDE 1
704 #define CAP_DAC_READ_SEARCH 2
707 #define CAP_SYS_ADMIN 21
709 cap_t cap_get_proc(void);
710 int cap_get_flag(cap_t, cap_value_t, cap_flag_t, cap_flag_value_t *);
715 static inline int llog_init_commit_master(void) { return 0; }
716 static inline int llog_cleanup_commit_master(int force) { return 0; }
717 static inline void portals_run_lbug_upcall(char *file, const char *fn,
722 printf("!!!LBUG at %s:%d\n", __FILE__, __LINE__); \
731 wait_queue_head_t wait;
734 #define COMPLETION_INITIALIZER(work) \
735 { 0, __WAIT_QUEUE_HEAD_INITIALIZER((work).wait) }
737 #define DECLARE_COMPLETION(work) \
738 struct completion work = COMPLETION_INITIALIZER(work)
740 #define INIT_COMPLETION(x) ((x).done = 0)
742 static inline void init_completion(struct completion *x)
745 init_waitqueue_head(&x->wait);
748 struct liblustre_wait_callback {
749 struct list_head llwc_list;
750 int (*llwc_fn)(void *arg);
754 void *liblustre_register_wait_callback(int (*fn)(void *arg), void *arg);
755 void liblustre_deregister_wait_callback(void *notifier);
756 int liblustre_wait_event(int timeout);
758 #include <linux/obd_support.h>
759 #include <linux/lustre_idl.h>
760 #include <linux/lustre_lib.h>
761 #include <linux/lustre_import.h>
762 #include <linux/lustre_export.h>
763 #include <linux/lustre_net.h>