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.
28 #error Kernel files should not #include <liblustre.h>
31 * The userspace implementations of linux/spinlock.h vary; we just
32 * include our own for all of them
34 #define __LINUX_SPINLOCK_H
41 #ifdef HAVE_ASM_PAGE_H
42 # include <asm/page.h>
44 #ifdef HAVE_SYS_USER_H
45 # include <sys/user.h>
47 #ifdef HAVE_SYS_IOCTL_H
48 # include <sys/ioctl.h>
55 #include <sys/ioctl.h>
67 #include <libcfs/list.h>
68 #include <libcfs/user-bitops.h>
69 #include <lnet/lnet.h>
70 #include <libcfs/kp30.h>
72 /* definitions for liblustre */
76 #define CFS_PAGE_SHIFT 12
77 #define CFS_PAGE_SIZE (1UL << CFS_PAGE_SHIFT)
78 #define CFS_PAGE_MASK (~((__u64)CFS_PAGE_SIZE-1))
79 #define loff_t long long
81 typedef unsigned short umode_t;
85 #ifndef CURRENT_SECONDS
86 # define CURRENT_SECONDS time(0)
90 #define ARRAY_SIZE(a) ((sizeof (a))/(sizeof ((a)[0])))
93 /* This is because lprocfs_status.h gets included here indirectly. It would
94 * be much better to just avoid lprocfs being included into liblustre entirely
95 * but that requires more header surgery than I can handle right now.
97 #ifndef smp_processor_id
98 #define smp_processor_id() 0
100 #ifndef num_online_cpus
101 #define num_online_cpus() 1
103 #ifndef num_possible_cpus
104 #define num_possible_cpus() 1
107 /* always adopt 2.5 definitions */
108 #define KERNEL_VERSION(a,b,c) ((a)*100+(b)*10+c)
109 #define LINUX_VERSION_CODE KERNEL_VERSION(2,6,5)
112 #define page_private(page) ((page)->private)
113 #define set_page_private(page, v) ((page)->private = (v))
117 static inline void inter_module_put(void *a)
122 void *inter_module_get(char *arg);
127 void (*ws_task)(void *arg);
131 static inline void prepare_work(struct work_struct *q, void (*t)(void *),
139 static inline void schedule_work(struct work_struct *q)
141 q->ws_task(q->ws_arg);
145 #define strnlen(a,b) strlen(a)
146 static inline void *kmalloc(int size, int prot)
150 #define vmalloc malloc
152 #define kfree(a) free(a)
154 #define GFP_HIGHUSER 1
157 #define IS_ERR(a) ((unsigned long)(a) > (unsigned long)-1000L)
158 #define PTR_ERR(a) ((long)(a))
159 #define ERR_PTR(a) ((void*)((long)(a)))
161 typedef int (read_proc_t)(char *page, char **start, off_t off,
162 int count, int *eof, void *data);
164 struct file; /* forward ref */
165 typedef int (write_proc_t)(struct file *file, const char *buffer,
166 unsigned long count, void *data);
168 #define NIPQUAD(addr) \
169 ((unsigned char *)&addr)[0], \
170 ((unsigned char *)&addr)[1], \
171 ((unsigned char *)&addr)[2], \
172 ((unsigned char *)&addr)[3]
174 #if defined(__LITTLE_ENDIAN)
175 #define HIPQUAD(addr) \
176 ((unsigned char *)&addr)[3], \
177 ((unsigned char *)&addr)[2], \
178 ((unsigned char *)&addr)[1], \
179 ((unsigned char *)&addr)[0]
180 #elif defined(__BIG_ENDIAN)
181 #define HIPQUAD NIPQUAD
183 #error "Undefined byteorder??"
184 #endif /* __LITTLE_ENDIAN */
188 /* a long can be more than 32 bits, so use BITS_PER_LONG
189 * to allow the compiler to adjust the bit shifting accordingly
192 /* test if bit nr is set in bitmap addr; returns previous value of bit nr */
193 static __inline__ int set_bit(int nr, long * addr)
197 addr += nr / BITS_PER_LONG;
198 mask = 1UL << (nr & (BITS_PER_LONG - 1));
199 nr = (mask & *addr) != 0;
204 /* clear bit nr in bitmap addr; returns previous value of bit nr*/
205 static __inline__ int clear_bit(int nr, long * addr)
209 addr += nr / BITS_PER_LONG;
210 mask = 1UL << (nr & (BITS_PER_LONG - 1));
211 nr = (mask & *addr) != 0;
216 static __inline__ int test_bit(int nr, const long * addr)
218 return ((1UL << (nr & (BITS_PER_LONG - 1))) & ((addr)[nr / BITS_PER_LONG])) != 0;
221 static __inline__ int ext2_set_bit(int nr, void *addr)
223 return set_bit(nr, (long*)addr);
226 static __inline__ int ext2_clear_bit(int nr, void *addr)
228 return clear_bit(nr, (long*)addr);
231 static __inline__ int ext2_test_bit(int nr, void *addr)
233 return test_bit(nr, (long*)addr);
242 static inline void MODULE_AUTHOR(char *name)
244 printf("%s\n", name);
246 #define MODULE_DESCRIPTION(name) MODULE_AUTHOR(name)
247 #define MODULE_LICENSE(name) MODULE_AUTHOR(name)
249 #define THIS_MODULE NULL
255 static inline int misc_register(void *foo)
260 static inline int misc_deregister(void *foo)
265 static inline int request_module(char *name)
270 #define __MOD_INC_USE_COUNT(m) do {} while (0)
271 #define __MOD_DEC_USE_COUNT(m) do {} while (0)
272 #define MOD_INC_USE_COUNT do {} while (0)
273 #define MOD_DEC_USE_COUNT do {} while (0)
274 static inline void __module_get(struct module *module)
278 static inline int try_module_get(struct module *module)
283 static inline void module_put(struct module *module)
287 /* module initialization */
288 extern int init_obdclass(void);
289 extern int ptlrpc_init(void);
290 extern int ldlm_init(void);
291 extern int osc_init(void);
292 extern int lov_init(void);
293 extern int mdc_init(void);
294 extern int lmv_init(void);
295 extern int mgc_init(void);
296 extern int echo_client_init(void);
302 #define EXPORT_SYMBOL(S)
306 typedef struct { } spinlock_t;
307 typedef __u64 kdev_t;
309 #define SPIN_LOCK_UNLOCKED (spinlock_t) { }
310 #define LASSERT_SPIN_LOCKED(lock) do {} while(0)
311 #define LASSERT_SEM_LOCKED(sem) do {} while(0)
313 static inline void spin_lock(spinlock_t *l) {return;}
314 static inline void spin_unlock(spinlock_t *l) {return;}
315 static inline void spin_lock_init(spinlock_t *l) {return;}
316 static inline void local_irq_save(unsigned long flag) {return;}
317 static inline void local_irq_restore(unsigned long flag) {return;}
318 static inline int spin_is_locked(spinlock_t *l) {return 1;}
320 static inline void spin_lock_bh(spinlock_t *l) {}
321 static inline void spin_unlock_bh(spinlock_t *l) {}
322 static inline void spin_lock_irqsave(spinlock_t *a, unsigned long b) {}
323 static inline void spin_unlock_irqrestore(spinlock_t *a, unsigned long b) {}
325 typedef spinlock_t rwlock_t;
326 #define RW_LOCK_UNLOCKED SPIN_LOCK_UNLOCKED
327 #define read_lock(l) spin_lock(l)
328 #define read_unlock(l) spin_unlock(l)
329 #define write_lock(l) spin_lock(l)
330 #define write_unlock(l) spin_unlock(l)
333 #define min(x,y) ((x)<(y) ? (x) : (y))
334 #define max(x,y) ((x)>(y) ? (x) : (y))
337 #define min_t(type,x,y) \
338 ({ type __x = (x); type __y = (y); __x < __y ? __x: __y; })
341 #define max_t(type,x,y) \
342 ({ type __x = (x); type __y = (y); __x > __y ? __x: __y; })
345 #define simple_strtol strtol
347 /* registering symbols */
349 #define ERESTARTSYS ERESTART
355 void get_random_bytes(void *ptr, int size);
359 /* memory size: used for some client tunables */
360 #define num_physpages (256 * 1024) /* 1GB */
362 static inline int copy_from_user(void *a,void *b, int c)
368 static inline int copy_to_user(void *a,void *b, int c)
379 #define SLAB_HWCACHE_ALIGN 0
380 static inline kmem_cache_t *
381 kmem_cache_create(const char *name, size_t objsize, size_t cdum,
383 void (*e)(void *, kmem_cache_t *, unsigned long),
384 void (*f)(void *, kmem_cache_t *, unsigned long))
387 c = malloc(sizeof(*c));
391 CDEBUG(D_MALLOC, "alloc slab cache %s at %p, objsize %d\n",
392 name, c, (int)objsize);
396 static inline int kmem_cache_destroy(kmem_cache_t *a)
398 CDEBUG(D_MALLOC, "destroy slab cache %p, objsize %u\n", a, a->size);
403 /* struct page decl moved out from here into portals/include/libcfs/user-prim.h */
406 #define PAGE_LIST_ENTRY list
407 #define PAGE_LIST(page) ((page)->list)
409 #define kmap(page) (page)->addr
410 #define kunmap(a) do {} while (0)
412 static inline cfs_page_t *alloc_pages(int mask, unsigned long order)
414 cfs_page_t *pg = malloc(sizeof(*pg));
418 #if 0 //#ifdef MAP_ANONYMOUS
419 pg->addr = mmap(0, PAGE_SIZE << order, PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0);
421 pg->addr = malloc(CFS_PAGE_SIZE << order);
430 #define cfs_alloc_pages(mask, order) alloc_pages((mask), (order))
432 #define alloc_page(mask) alloc_pages((mask), 0)
433 #define cfs_alloc_page(mask) alloc_page(mask)
435 static inline void __free_pages(cfs_page_t *pg, int what)
437 #if 0 //#ifdef MAP_ANONYMOUS
438 munmap(pg->addr, PAGE_SIZE);
444 #define __cfs_free_pages(pg, order) __free_pages((pg), (order))
446 #define __free_page(page) __free_pages((page), 0)
447 #define free_page(page) __free_page(page)
448 #define __cfs_free_page(page) __cfs_free_pages((page), 0)
450 static inline cfs_page_t* __grab_cache_page(unsigned long index)
452 cfs_page_t *pg = alloc_pages(0, 0);
459 #define grab_cache_page(index) __grab_cache_page(index)
460 #define page_cache_release(page) __free_pages(page, 0)
463 #define do_div(a,b) \
465 unsigned long remainder;\
466 remainder = (a) % (b); \
472 #define ATTR_MODE 0x0001
473 #define ATTR_UID 0x0002
474 #define ATTR_GID 0x0004
475 #define ATTR_SIZE 0x0008
476 #define ATTR_ATIME 0x0010
477 #define ATTR_MTIME 0x0020
478 #define ATTR_CTIME 0x0040
479 #define ATTR_ATIME_SET 0x0080
480 #define ATTR_MTIME_SET 0x0100
481 #define ATTR_FORCE 0x0200 /* Not a change, but a change it */
482 #define ATTR_ATTR_FLAG 0x0400
483 #define ATTR_RAW 0x0800 /* file system, not vfs will massage attrs */
484 #define ATTR_FROM_OPEN 0x1000 /* called from open path, ie O_TRUNC */
485 #define ATTR_CTIME_SET 0x2000
486 #define ATTR_BLOCKS 0x4000
487 #define ATTR_KILL_SUID 0
488 #define ATTR_KILL_SGID 0
491 unsigned int ia_valid;
499 unsigned int ia_attr_flags;
502 #define ll_iattr iattr
504 #define IT_OPEN 0x0001
505 #define IT_CREAT 0x0002
506 #define IT_READDIR 0x0004
507 #define IT_GETATTR 0x0008
508 #define IT_LOOKUP 0x0010
509 #define IT_UNLINK 0x0020
510 #define IT_GETXATTR 0x0040
511 #define IT_EXEC 0x0080
512 #define IT_PIN 0x0100
514 #define IT_FL_LOCKED 0x0001
515 #define IT_FL_FOLLOWED 0x0002 /* set by vfs_follow_link */
517 #define INTENT_MAGIC 0x19620323
519 struct lustre_intent_data {
522 __u64 it_lock_handle;
527 struct lookup_intent {
529 void (*it_op_release)(struct lookup_intent *);
534 struct lustre_intent_data lustre;
538 static inline void intent_init(struct lookup_intent *it, int op, int flags)
540 memset(it, 0, sizeof(*it));
541 it->it_magic = INTENT_MAGIC;
543 it->it_flags = flags;
555 struct rw_semaphore {
564 /* use the macro's argument to avoid unused warnings */
565 #define down(a) do { (void)a; } while (0)
566 #define mutex_down(a) down(a)
567 #define up(a) do { (void)a; } while (0)
568 #define mutex_up(a) up(a)
569 #define down_read(a) do { (void)a; } while (0)
570 #define up_read(a) do { (void)a; } while (0)
571 #define down_write(a) do { (void)a; } while (0)
572 #define up_write(a) do { (void)a; } while (0)
573 #define sema_init(a,b) do { (void)a; } while (0)
574 #define init_rwsem(a) do { (void)a; } while (0)
575 #define DECLARE_MUTEX(name) \
576 struct semaphore name = { 1 }
577 static inline void init_MUTEX (struct semaphore *sem)
581 static inline void init_MUTEX_LOCKED (struct semaphore *sem)
586 #define init_mutex(s) init_MUTEX(s)
589 struct list_head sleepers;
593 struct list_head sleeping;
603 struct signal pending;
616 typedef struct task_struct cfs_task_t;
617 #define cfs_current() current
618 #define cfs_curproc_pid() (current->pid)
619 #define cfs_curproc_comm() (current->comm)
621 extern struct task_struct *current;
622 int in_group_p(gid_t gid);
623 static inline int capable(int cap)
625 if (current->cap_effective & (1 << cap))
631 #define set_current_state(foo) do { current->state = foo; } while (0)
633 #define init_waitqueue_entry(q,p) do { (q)->process = p; } while (0)
634 #define add_wait_queue(q,p) do { list_add(&(q)->sleepers, &(p)->sleeping); } while (0)
635 #define del_wait_queue(p) do { list_del(&(p)->sleeping); } while (0)
636 #define remove_wait_queue(q,p) do { list_del(&(p)->sleeping); } while (0)
638 #define DECLARE_WAIT_QUEUE_HEAD(HEAD) \
639 wait_queue_head_t HEAD = { \
640 .sleepers = LIST_HEAD_INIT(HEAD.sleepers) \
642 #define init_waitqueue_head(l) INIT_LIST_HEAD(&(l)->sleepers)
643 #define wake_up(l) do { int a; a++; } while (0)
644 #define TASK_INTERRUPTIBLE 0
645 #define TASK_UNINTERRUPTIBLE 1
646 #define TASK_RUNNING 2
648 #define wait_event_interruptible(wq, condition) \
650 struct l_wait_info lwi; \
651 int timeout = 100000000;/* for ever */ \
654 lwi = LWI_TIMEOUT(timeout, NULL, NULL); \
655 ret = l_wait_event(NULL, condition, &lwi); \
660 #define in_interrupt() (0)
662 #define schedule() do {} while (0)
663 static inline int schedule_timeout(signed long t)
668 #define lock_kernel() do {} while (0)
669 #define unlock_kernel() do {} while (0)
670 #define daemonize(l) do {} while (0)
671 #define sigfillset(l) do {} while (0)
672 #define recalc_sigpending(l) do {} while (0)
673 #define kernel_thread(l,m,n) LBUG()
675 #define USERMODEHELPER(path, argv, envp) (0)
676 #define SIGNAL_MASK_ASSERT()
679 #include <sys/time.h>
681 #error "liblustre's jiffies currently expects HZ to be 1"
685 unsigned long _ret = 0; \
687 if (gettimeofday(&tv, NULL) == 0) \
691 #define get_jiffies_64() (__u64)jiffies
692 #define time_after(a, b) ((long)(b) - (long)(a) < 0)
693 #define time_before(a, b) time_after(b,a)
694 #define time_after_eq(a,b) ((long)(a) - (long)(b) >= 0)
697 struct list_head tl_list;
698 void (*function)(unsigned long unused);
703 static inline int timer_pending(struct timer_list *l)
705 if (time_after(l->expires, jiffies))
711 static inline int init_timer(struct timer_list *l)
713 INIT_LIST_HEAD(&l->tl_list);
717 static inline void mod_timer(struct timer_list *l, int thetime)
719 l->expires = thetime;
722 static inline void del_timer(struct timer_list *l)
727 typedef struct { volatile int counter; } atomic_t;
729 #define ATOMIC_INIT(i) { (i) }
731 #define atomic_read(a) ((a)->counter)
732 #define atomic_set(a,b) do {(a)->counter = b; } while (0)
733 #define atomic_dec_and_test(a) ((--((a)->counter)) == 0)
734 #define atomic_dec_and_lock(a,b) ((--((a)->counter)) == 0)
735 #define atomic_inc(a) (((a)->counter)++)
736 #define atomic_dec(a) do { (a)->counter--; } while (0)
737 #define atomic_add(b,a) do {(a)->counter += b;} while (0)
738 #define atomic_sub(b,a) do {(a)->counter -= b;} while (0)
739 #define atomic_sub_return(n,a) ((a)->counter -= n)
740 #define atomic_dec_return(a) atomic_sub_return(1,a)
743 #define likely(exp) (exp)
746 #define unlikely(exp) (exp)
749 #define might_sleep()
750 #define might_sleep_if(c)
754 int test_and_set_bit(int nr, unsigned long *addr)
758 while (nr >= sizeof(long)) {
763 oldbit = (*addr) & (1 << nr);
769 int test_and_clear_bit(int nr, unsigned long *addr)
773 while (nr >= sizeof(long)) {
778 oldbit = (*addr) & (1 << nr);
783 /* FIXME sys/capability will finally included linux/fs.h thus
784 * cause numerous trouble on x86-64. as temporary solution for
785 * build broken at Cray, we copy definition we need from capability.h
789 typedef struct _cap_struct *cap_t;
790 typedef int cap_value_t;
801 #define CAP_DAC_OVERRIDE 1
802 #define CAP_DAC_READ_SEARCH 2
805 #define CAP_SYS_ADMIN 21
807 cap_t cap_get_proc(void);
808 int cap_get_flag(cap_t, cap_value_t, cap_flag_t, cap_flag_value_t *);
811 static inline int llog_init_commit_master(void) { return 0; }
812 static inline int llog_cleanup_commit_master(int force) { return 0; }
813 static inline void libcfs_run_lbug_upcall(char *file, const char *fn,
822 #define COMPLETION_INITIALIZER(work) \
823 { 0, __WAIT_QUEUE_HEAD_INITIALIZER((work).wait) }
825 #define DECLARE_COMPLETION(work) \
826 struct completion work = COMPLETION_INITIALIZER(work)
828 #define INIT_COMPLETION(x) ((x).done = 0)
830 static inline void init_completion(struct completion *x)
833 init_waitqueue_head(&x->wait);
836 struct liblustre_wait_callback {
837 struct list_head llwc_list;
838 const char *llwc_name;
839 int (*llwc_fn)(void *arg);
843 void *liblustre_register_wait_callback(const char *name,
844 int (*fn)(void *arg), void *arg);
845 void liblustre_deregister_wait_callback(void *notifier);
846 int liblustre_wait_event(int timeout);
848 void *liblustre_register_idle_callback(const char *name,
849 int (*fn)(void *arg), void *arg);
850 void liblustre_deregister_idle_callback(void *notifier);
851 void liblustre_wait_idle(void);
854 struct nfs_lock_info {
860 typedef struct file_lock {
861 struct file_lock *fl_next; /* singly linked list for this inode */
862 struct list_head fl_link; /* doubly linked list of all locks */
863 struct list_head fl_block; /* circular list of blocked processes */
867 struct file *fl_file;
868 unsigned char fl_flags;
869 unsigned char fl_type;
873 void (*fl_notify)(struct file_lock *); /* unblock callback */
874 void (*fl_insert)(struct file_lock *); /* lock insertion callback */
875 void (*fl_remove)(struct file_lock *); /* lock removal callback */
877 void *fl_fasync; /* for lease break notifications */
878 unsigned long fl_break_time; /* for nonblocking lease breaks */
881 struct nfs_lock_info nfs_fl;
885 #define cfs_flock_type(fl) ((fl)->fl_type)
886 #define cfs_flock_set_type(fl, type) do { (fl)->fl_type = (type); } while(0)
887 #define cfs_flock_pid(fl) ((fl)->fl_pid)
888 #define cfs_flock_set_pid(fl, pid) do { (fl)->fl_pid = (pid); } while(0)
889 #define cfs_flock_start(fl) ((fl)->fl_start)
890 #define cfs_flock_set_start(fl, start) do { (fl)->fl_start = (start); } while(0)
891 #define cfs_flock_end(fl) ((fl)->fl_end)
892 #define cfs_flock_set_end(fl, end) do { (fl)->fl_end = (end); } while(0)
895 #define INT_LIMIT(x) (~((x)1 << (sizeof(x)*8 - 1)))
896 #define OFFSET_MAX INT_LIMIT(loff_t)
899 /* XXX: defined in kernel */
908 struct posix_acl_entry {
910 unsigned short e_perm;
916 unsigned int a_count;
917 struct posix_acl_entry a_entries[0];
928 xattr_acl_entry a_entries[0];
931 static inline size_t xattr_acl_size(int count)
933 return sizeof(xattr_acl_header) + count * sizeof(xattr_acl_entry);
937 struct posix_acl * posix_acl_from_xattr(const void *value, size_t size)
943 int posix_acl_valid(const struct posix_acl *acl)
949 void posix_acl_release(struct posix_acl *acl)
954 #define ENOTSUPP ENOTSUP
957 typedef int mm_segment_t;
962 static inline mm_segment_t get_fs(void)
967 static inline void set_fs(mm_segment_t seg)
971 #include <obd_support.h>
972 #include <lustre/lustre_idl.h>
973 #include <lustre_lib.h>
974 #include <lustre_import.h>
975 #include <lustre_export.h>
976 #include <lustre_net.h>
978 /* Fast hashing routine for a long.
979 (C) 2002 William Lee Irwin III, IBM */
982 * Knuth recommends primes in approximately golden ratio to the maximum
983 * integer representable by a machine word for multiplicative hashing.
984 * Chuck Lever verified the effectiveness of this technique:
985 * http://www.citi.umich.edu/techreports/reports/citi-tr-00-1.pdf
987 * These primes are chosen to be bit-sparse, that is operations on
988 * them can use shifts and additions instead of multiplications for
989 * machines where multiplications are slow.
991 #if BITS_PER_LONG == 32
992 /* 2^31 + 2^29 - 2^25 + 2^22 - 2^19 - 2^16 + 1 */
993 #define GOLDEN_RATIO_PRIME 0x9e370001UL
994 #elif BITS_PER_LONG == 64
995 /* 2^63 + 2^61 - 2^57 + 2^54 - 2^51 - 2^18 + 1 */
996 #define GOLDEN_RATIO_PRIME 0x9e37fffffffc0001UL
998 #error Define GOLDEN_RATIO_PRIME for your wordsize.
1001 static inline unsigned long hash_long(unsigned long val, unsigned int bits)
1003 unsigned long hash = val;
1005 #if BITS_PER_LONG == 64
1006 /* Sigh, gcc can't optimise this alone like it does for 32 bits. */
1007 unsigned long n = hash;
1021 /* On some cpus multiply is faster, on others gcc will do shifts */
1022 hash *= GOLDEN_RATIO_PRIME;
1025 /* High bits are more random, so use them. */
1026 return hash >> (BITS_PER_LONG - bits);
1029 static inline unsigned long hash_ptr(void *ptr, unsigned int bits)
1031 return hash_long((unsigned long)ptr, bits);