patch-2.1.70 linux/include/linux/coda_linux.h

• Lines: 188
• Date: Tue Dec 2 14:24:04 1997
• Orig file: v2.1.69/linux/include/linux/coda_linux.h
• Orig date: Wed Dec 31 16:00:00 1969

diff -u --recursive --new-file v2.1.69/linux/include/linux/coda_linux.h linux/include/linux/coda_linux.h
@@ -0,0 +1,187 @@
+/* 
+ * Coda File System, Linux Kernel module
+ * 
+ * Original version, adapted from cfs_mach.c, (C) Carnegie Mellon University
+ * Linux modifications (C) 1996, Peter J. Braam
+ * Rewritten for Linux 2.1 (C) 1997 Carnegie Mellon University
+ *
+ * Carnegie Mellon University encourages users of this software to
+ * contribute improvements to the Coda project.
+ */
+
+#ifndef _LINUX_CODA_FS
+#define _LINUX_CODA_FS
+
+#include <linux/kernel.h>
+#include <linux/param.h>
+#include <linux/sched.h> 
+#include <linux/mm.h>
+#include <linux/vmalloc.h>
+#include <linux/malloc.h>
+#include <linux/wait.h>		
+#include <linux/types.h>
+#include <linux/fs.h>
+
+/* operations */
+extern struct inode_operations coda_dir_inode_operations;
+extern struct inode_operations coda_file_inode_operations;
+extern struct inode_operations coda_ioctl_inode_operations;
+extern struct inode_operations coda_symlink_inode_operations;
+
+extern struct file_operations coda_dir_operations;
+extern struct file_operations coda_file_operations;
+extern struct file_operations coda_ioctl_operations;
+
+/* operations shared over more than one file */
+int coda_open(struct inode *i, struct file *f);
+int coda_release(struct inode *i, struct file *f);
+int coda_permission(struct inode *inode, int mask);
+
+/* global variables */
+extern int coda_debug;
+extern int coda_print_entry;
+extern int coda_access_cache;
+extern int cfsnc_use;
+
+
+/*   */
+char *coda_f2s(ViceFid *f, char *s);
+int coda_isroot(struct inode *i);
+void coda_load_creds(struct CodaCred *cred);
+
+
+
+/* defined in  file.c */
+void coda_prepare_openfile(struct inode *coda_inode, struct file *coda_file, 
+			   struct inode *open_inode,  struct file *open_file,
+			   struct dentry *open_dentry);
+void coda_restore_codafile(struct inode *coda_inode, struct file *coda_file, 
+			   struct inode *open_inode, struct file *open_file);
+int coda_inode_grab(dev_t dev, ino_t ino, struct inode **ind);
+struct super_block *coda_find_super(kdev_t device);
+
+
+#define INIT_IN(in, op) \
+	  (in)->opcode = (op); \
+	  (in)->pid = current->pid; \
+          (in)->pgid = current->gid; 
+
+/* debugging aids */
+
+#define coda_panic printk
+
+/* debugging masks */
+#define D_SUPER     1   /* print results returned by Venus */ 
+#define D_INODE     2   /* print entry and exit into procedure */
+#define D_FILE      4   /* print malloc, de-alloc information */
+#define D_CACHE     8   /* cache debugging */
+#define D_MALLOC    16
+#define D_CNODE     32
+#define D_UPCALL    64  /* up and downcall debugging */
+#define D_PSDEV    128  
+#define D_PIOCTL   256
+#define D_SPECIAL  512
+/* until we are really good, ... */
+#define coda_panic printk
+ 
+#define CDEBUG(mask, format, a...)                                \
+  do {                                                            \
+  if (coda_debug & mask) {                                        \
+    printk("(%s,l. %d): ",  __FUNCTION__, __LINE__);              \
+    printk(format, ## a); }                                       \
+} while (0) ;                            
+
+#define ENTRY    \
+    if(coda_print_entry) printk("Process %d entered %s\n",current->pid,__FUNCTION__)
+
+#define EXIT    \
+    if(coda_print_entry) printk("Process %d leaving %s\n",current->pid,__FUNCTION__)
+
+
+/* inode to cnode */
+#define ITOC(the_inode)  ((struct cnode *)(the_inode)->u.generic_ip)
+/* cnode to inode */
+#define CTOI(the_cnode)  ((the_cnode)->c_vnode)
+
+#define CHECK_CNODE(c)                                                \
+do {                                                                  \
+  struct cnode *cnode = (c);                                          \
+  if (!cnode)                                                         \
+    coda_panic ("%s(%d): cnode is null\n", __FUNCTION__, __LINE__);        \
+  if (cnode->c_magic != CODA_CNODE_MAGIC)                             \
+    coda_panic ("%s(%d): cnode magic wrong\n", __FUNCTION__, __LINE__);    \
+  if (!cnode->c_vnode)                                                \
+    coda_panic ("%s(%d): cnode has null inode\n", __FUNCTION__, __LINE__); \
+  if ( (struct cnode *)cnode->c_vnode->u.generic_ip != cnode )           \
+    coda_panic("AAooh, %s(%d) cnode doesn't link right!\n", __FUNCTION__,__LINE__);\
+} while (0);
+
+
+/* ioctl stuff */
+/* this needs to be sorted out XXXX */ 
+#ifdef	__linux__
+#define IOCPARM_MASK 0x0000ffff
+#endif 
+
+#define CODA_ALLOC(ptr, cast, size)                                       \
+do {                                                                      \
+    if (size < 3000) {                                                    \
+        ptr = (cast)kmalloc((unsigned long) size, GFP_KERNEL);            \
+                CDEBUG(D_MALLOC, "kmalloced: %x at %x.\n", (int) size, (int) ptr);\
+     }  else {                                                             \
+        ptr = (cast)vmalloc((unsigned long) size);                        \
+	CDEBUG(D_MALLOC, "vmalloced: %x at %x.\n", (int) size, (int) ptr);}\
+    if (ptr == 0) {                                                       \
+        coda_panic("kernel malloc returns 0 at %s:%d\n", __FILE__, __LINE__);  \
+    }                                                                     \
+    memset( ptr, 0, size );                                                   \
+} while (0)
+
+
+#define CODA_FREE(ptr,size) do {if (size < 3000) { kfree_s((ptr), (size)); CDEBUG(D_MALLOC, "kfreed: %x at %x.\n", (int) size, (int) ptr); } else { vfree((ptr)); CDEBUG(D_MALLOC, "vfreed: %x at %x.\n", (int) size, (int) ptr);} } while (0)
+
+
+
+
+/*
+ * Macros to manipulate the queue 
+ */
+#define crfree(cred) CODA_FREE( (cred), sizeof(struct ucred))
+
+#ifndef INIT_QUEUE
+
+struct queue {
+    struct queue *forw, *back;
+};
+
+#define INIT_QUEUE(head)                     \
+do {                                         \
+    (head).forw = (struct queue *)&(head);   \
+    (head).back = (struct queue *)&(head);   \
+} while (0)
+
+#define GETNEXT(head) (head).forw
+
+#define EMPTY(head) ((head).forw == &(head))
+
+#define EOQ(el, head) ((struct queue *)(el) == (struct queue *)&(head))
+
+#define INSQUE(el, head)                             \
+do {                                                 \
+	(el).forw = ((head).back)->forw;             \
+	(el).back = (head).back;                     \
+	((head).back)->forw = (struct queue *)&(el); \
+	(head).back = (struct queue *)&(el);         \
+} while (0)
+
+#define REMQUE(el)                         \
+do {                                       \
+	((el).forw)->back = (el).back;     \
+	(el).back->forw = (el).forw;       \
+}  while (0)
+
+#endif INIT_QUEUE
+
+
+#endif _LINUX_CODA_FS
+