#ifdef KDUMP_KERNEL
#include <afs/afs_args.h>
#else
-#include "../afs/afs_args.h"
+#include "afs/afs_args.h"
#endif
* Macros to uniquely identify the AFS vfs struct
*/
#define AFS_VFSMAGIC 0x1234
-#if defined(AFS_SUN_ENV) || defined(AFS_HPUX90_ENV) || defined(AFS_LINUX20_ENV)
+#if defined(AFS_SUN5_ENV) || defined(AFS_HPUX90_ENV) || defined(AFS_LINUX20_ENV)
#define AFS_VFSFSID 99
#else
#if defined(AFS_SGI_ENV)
#if defined(AFS_HPUX102_ENV)
#define AFS_FLOCK k_flock
#else
-#if defined(AFS_SUN56_ENV) || defined(AFS_LINUX24_ENV)
+#if defined(AFS_SUN56_ENV) || (defined(AFS_LINUX24_ENV) && !(defined(AFS_LINUX26_ENV) && defined(AFS_LINUX_64BIT_KERNEL)))
#define AFS_FLOCK flock64
#else
#define AFS_FLOCK flock
/* The basic defines for the Andrew file system
better keep things powers of two so "& (foo-1)" hack works for masking bits */
-#define MAXHOSTS 13 /* max hosts per single volume */
-#define OMAXHOSTS 8 /* backwards compatibility */
-#define MAXCELLHOSTS 8 /* max vldb servers per cell */
-#define NBRS 15 /* max number of queued daemon requests */
-#define NUSERS 16 /* hash table size for unixuser table */
-#define NSERVERS 16 /* hash table size for server table */
-#define NVOLS 64 /* hash table size for volume table */
-#define NFENTRIES 256 /* hash table size for disk volume table */
-#define VCSIZE 1024 /* stat cache hash table size */
-#define DCSIZE 512 /* disk cache hash table size */
-#define PIGGYSIZE 1350 /* max piggyback size */
-#define MAXVOLS 128 /* max vols we can store */
-#define MAXSYSNAME 128 /* max sysname (i.e. @sys) size */
-#define MAXNUMSYSNAMES 16 /* max that current constants allow */
-#define NOTOKTIMEOUT (2*3600) /* time after which to timeout conns sans tokens */
+#define MAXHOSTS 13 /* max hosts per single volume */
+#define OMAXHOSTS 8 /* backwards compatibility */
+#define MAXCELLHOSTS 8 /* max vldb servers per cell */
+#define NBRS 15 /* max number of queued daemon requests */
+#define NUSERS 16 /* hash table size for unixuser table */
+#define NSERVERS 16 /* hash table size for server table */
+#define NVOLS 64 /* hash table size for volume table */
+#define NFENTRIES 256 /* hash table size for disk volume table */
+#define VCSIZE 1024 /* stat cache hash table size */
+#define DCSIZE 512 /* disk cache hash table size */
+#define CBRSIZE 512 /* call back returns hash table size */
+#define PIGGYSIZE 1350 /* max piggyback size */
+#define MAXVOLS 128 /* max vols we can store */
+#define MAXSYSNAME 128 /* max sysname (i.e. @sys) size */
+#define MAXNUMSYSNAMES 16 /* max that current constants allow */
+#define NOTOKTIMEOUT (2*3600) /* time after which to timeout conns sans tokens */
#define NOPAG 0xffffffff
-#define AFS_NCBRS 300 /* max # of call back return entries */
-#define AFS_MAXCBRSCALL 16 /* max to return in a given call */
-#define AFS_SALLOC_LOW_WATER 250 /* Min free blocks before allocating more */
-#define AFS_LRALLOCSIZ 4096 /* "Large" allocated size */
+#define AFS_NCBRS 300 /* max # of call back return entries */
+#define AFS_MAXCBRSCALL 16 /* max to return in a given call */
+#define AFS_SALLOC_LOW_WATER 250 /* Min free blocks before allocating more */
+#define AFS_LRALLOCSIZ 4096 /* "Large" allocated size */
#define VCACHE_FREE 5
#define AFS_NRXPACKETS 80
#define AFS_RXDEADTIME 50
-#define AFS_HARDDEADTIME 120
+#define AFS_HARDDEADTIME 120
+#define AFS_IDLEDEADTIME 50
+#define AFS_BLKBITS 12
+#define AFS_BLKSIZE (1 << AFS_BLKBITS)
+
+extern afs_int32 afs_rx_deadtime;
+extern afs_int32 afs_rx_harddead;
+extern afs_int32 afs_rx_idledead;
struct sysname_info {
- char *name;
- short offset;
- char index, allocked;
+ char *name;
+ short offset;
+ char index, allocked;
};
/* flags to use with AFSOP_CACHEINIT */
-#define AFSCALL_INIT_MEMCACHE 0x1 /* use a memory-based cache */
+#define AFSCALL_INIT_MEMCACHE 0x1 /* use a memory-based cache */
/* below here used only for kernel procedures */
#ifdef KERNEL
/* background request structure */
#define BPARMS 4
-#define BOP_NOOP 0 /* leave 0 unused */
-#define BOP_FETCH 1 /* parm1 is chunk to get */
-#define BOP_STORE 2 /* parm1 is chunk to store */
-#define BOP_PATH 3 /* parm1 is path, parm2 is chunk to fetch */
+#define BOP_NOOP 0 /* leave 0 unused */
+#define BOP_FETCH 1 /* parm1 is chunk to get */
+#define BOP_STORE 2 /* parm1 is chunk to store */
+#define BOP_PATH 3 /* parm1 is path, parm2 is chunk to fetch */
+
+#if defined(AFS_CACHE_BYPASS)
+#define BOP_FETCH_NOCACHE 4 /* parms are: vnode ptr, offset, segment ptr, addr, cred ptr */
+#endif
-#define B_DONTWAIT 1 /* On failure return; don't wait */
+#define B_DONTWAIT 1 /* On failure return; don't wait */
/* protocol is: refCount is incremented by user to take block out of free pool.
Next, BSTARTED is set when daemon finds request. This prevents
request is done, refCount is zeroed. BDONE and BWAIT are used by
dudes waiting for operation to proceed to a certain point before returning.
*/
-#define BSTARTED 1 /* request picked up by a daemon */
-#define BUVALID 2 /* code is valid (store) */
-#define BUWAIT 4 /* someone is waiting for BUVALID */
+#define BSTARTED 1 /* request picked up by a daemon */
+#define BUVALID 2 /* code is valid (store) */
+#define BUWAIT 4 /* someone is waiting for BUVALID */
struct brequest {
- struct vcache *vnode; /* vnode to use, with vrefcount bumped */
- struct AFS_UCRED *cred; /* credentials to use for operation */
- afs_size_t size_parm[BPARMS]; /* random parameters */
- void *ptr_parm[BPARMS]; /* pointer parameters */
- afs_int32 code; /* return code */
- short refCount; /* use counter for this structure */
- char opcode; /* what to do (store, fetch, etc) */
- char flags; /* free, etc */
- afs_int32 ts; /* counter "timestamp" */
+ struct vcache *vc; /* vnode to use, with vrefcount bumped */
+ struct AFS_UCRED *cred; /* credentials to use for operation */
+ afs_size_t size_parm[BPARMS]; /* random parameters */
+ void *ptr_parm[BPARMS]; /* pointer parameters */
+ afs_int32 code; /* return code */
+ short refCount; /* use counter for this structure */
+ char opcode; /* what to do (store, fetch, etc) */
+ char flags; /* free, etc */
+ afs_int32 ts; /* counter "timestamp" */
};
struct SecretToken {
};
struct ClearToken {
- afs_int32 AuthHandle;
- char HandShakeKey[8];
- afs_int32 ViceId;
- afs_int32 BeginTimestamp;
- afs_int32 EndTimestamp;
+ afs_int32 AuthHandle;
+ char HandShakeKey[8];
+ afs_int32 ViceId;
+ afs_int32 BeginTimestamp;
+ afs_int32 EndTimestamp;
};
struct VenusFid {
- afs_int32 Cell; /* better sun packing if at end of structure */
+ afs_int32 Cell; /* better sun packing if at end of structure */
struct AFSFid Fid;
};
/* The actual number of bytes in the SmallFid, not the sizeof struct. */
#define SIZEOF_SMALLFID 10
+/* Queues
+ * ------
+ *
+ * Circular queues, implemented with pointers. Structures may contain as many
+ * queues as required, which may be located at any point within the structure,
+ * providing the QEntry macro is used to translate between a queue pointer, and
+ * the address of its containing structure
+ */
-/*
- * Queues implemented with both pointers and short offsets into a disk file.
- */
struct afs_q {
struct afs_q *next;
struct afs_q *prev;
};
+#define QZero(e) ((e)->prev = (e)->next = NULL)
+#define QInit(q) ((q)->prev = (q)->next = (q))
+#define QAdd(q,e) ((e)->next = (q)->next, (e)->prev = (q), \
+ (q)->next->prev = (e), (q)->next = (e))
+#define QRemove(e) ((e)->next->prev = (e)->prev, (e)->prev->next = (e)->next, (e)->prev = NULL, (e)->next = NULL)
+#define QNext(e) ((e)->next)
+#define QPrev(e) ((e)->prev)
+#define QEmpty(q) ((q)->prev == (q))
+/* this one takes q1 and sticks it on the end of q2 - that is, the other end, not the end
+ * that things are added onto. q1 shouldn't be empty, it's silly */
+#define QCat(q1,q2) ((q2)->prev->next = (q1)->next, (q1)->next->prev=(q2)->prev, (q1)->prev->next=(q2), (q2)->prev=(q1)->prev, (q1)->prev=(q1)->next=(q1))
+
+/* Given a pointer to an afs_q within a structure, go back to the address of
+ * the parent structure
+ */
+
+#define QEntry(queue, structure, member) \
+ ((structure *)((char *)(queue)-(char *)(&((structure *)NULL)->member)))
+
+/* And implement operations for individual lists in terms of the above macro */
+
+#define QTOV(e) QEntry(e, struct vcache, vlruq)
+#define QTOC(e) QEntry(e, struct cell, lruq)
+#define QTOVH(e) QEntry(e, struct vcache, vhashq)
+
+/*!
+ * List of free slot numbers
+ */
+struct afs_slotlist {
+ afs_uint32 slot;
+ struct afs_slotlist *next;
+};
+
struct vrequest {
- afs_int32 uid; /* user id making the request */
- afs_int32 busyCount; /* how many busies we've seen so far */
- afs_int32 flags; /* things like O_SYNC, O_NONBLOCK go here */
- char initd; /* if non-zero, non-uid fields meaningful */
+ afs_int32 uid; /* user id making the request */
+ afs_int32 busyCount; /* how many busies we've seen so far */
+ afs_int32 flags; /* things like O_SYNC, O_NONBLOCK go here */
+ char initd; /* if non-zero, Error fields meaningful */
char accessError; /* flags for overriding error return code */
char volumeError; /* encountered a missing or busy volume */
char networkError; /* encountered network problems */
char permWriteError; /* fileserver returns permenent error. */
+ char tokenError; /* a token error other than expired. */
+ char idleError; /* the server idled too long */
+ char skipserver[MAXHOSTS];
};
#define VOLMISSING 1
#define VOLBUSY 2
* callbacks. Sent asynchronously when we run a little low on free dudes.
*/
struct afs_cbr {
+ struct afs_cbr **pprev;
struct afs_cbr *next;
+
+ struct afs_cbr **hash_pprev;
+ struct afs_cbr *hash_next;
+
struct AFSFid fid;
};
#define CLinkedCell 0x20 /* has a linked cell in lcellp */
struct cell {
- struct afs_q lruq; /* lru q next and prev */
- char *cellName; /* char string name of cell */
- afs_int32 cellIndex; /* sequence number */
- afs_int32 cellNum; /* semi-permanent cell number */
- struct server *cellHosts[MAXCELLHOSTS]; /* volume *location* hosts */
- struct cell *lcellp; /* Associated linked cell */
- u_short fsport; /* file server port */
- u_short vlport; /* volume server port */
- short states; /* state flags */
- time_t timeout; /* data expire time, if non-zero */
- struct cell_name *cnamep; /* pointer to our cell_name */
- afs_rwlock_t lock; /* protects cell data */
+ struct afs_q lruq; /* lru q next and prev */
+ char *cellName; /* char string name of cell */
+ afs_int32 cellIndex; /* sequence number */
+ afs_int32 cellNum; /* semi-permanent cell number */
+ struct server *cellHosts[MAXCELLHOSTS]; /* volume *location* hosts */
+ struct cell *lcellp; /* Associated linked cell */
+ u_short fsport; /* file server port */
+ u_short vlport; /* volume server port */
+ short states; /* state flags */
+ time_t timeout; /* data expire time, if non-zero */
+ struct cell_name *cnamep; /* pointer to our cell_name */
+ afs_rwlock_t lock; /* protects cell data */
+ unsigned char cellHandle[16]; /* deterministic handle for this cell */
};
struct cell_name {
#define afs_PutCell(cellp, locktype)
/* the unixuser flag bit definitions */
-#define UHasTokens 1 /* are the st and ct fields valid (ever set)? */
-#define UTokensBad 2 /* are tokens bad? */
-#define UPrimary 4 /* on iff primary identity */
-#define UNeedsReset 8 /* needs afs_ResetAccessCache call done */
-#define UPAGCounted 16 /* entry seen during PAG search (for stats) */
+#define UHasTokens 1 /* are the st and ct fields valid (ever set)? */
+#define UTokensBad 2 /* are tokens bad? */
+#define UPrimary 4 /* on iff primary identity */
+#define UNeedsReset 8 /* needs afs_ResetAccessCache call done */
+#define UPAGCounted 16 /* entry seen during PAG search (for stats) */
+#define UNFSGetCreds 32 /* getting creds for NFS client */
/* A flag used by afs_GCPAGs to keep track of
* which entries in afs_users need to be deleted.
* The lifetime of its presence in the table is the
#define TMP_UPAGNotReferenced 128
/* values for afs_gcpags */
-enum
-{ AFS_GCPAGS_NOTCOMPILED = 0
-, AFS_GCPAGS_OK = 1
-, AFS_GCPAGS_USERDISABLED
-, AFS_GCPAGS_EPROC0
-, AFS_GCPAGS_EPROCN
-, AFS_GCPAGS_EEQPID
-, AFS_GCPAGS_EINEXACT
-, AFS_GCPAGS_EPROCEND
-, AFS_GCPAGS_EPROCWALK
-, AFS_GCPAGS_ECREDWALK
-, AFS_GCPAGS_EPIDCHECK
-, AFS_GCPAGS_ENICECHECK
+enum { AFS_GCPAGS_NOTCOMPILED = 0, AFS_GCPAGS_OK =
+ 1, AFS_GCPAGS_USERDISABLED, AFS_GCPAGS_EPROC0, AFS_GCPAGS_EPROCN,
+ AFS_GCPAGS_EEQPID, AFS_GCPAGS_EINEXACT, AFS_GCPAGS_EPROCEND,
+ AFS_GCPAGS_EPROCWALK, AFS_GCPAGS_ECREDWALK, AFS_GCPAGS_EPIDCHECK,
+ AFS_GCPAGS_ENICECHECK
};
extern afs_int32 afs_gcpags;
extern afs_int32 afs_gcpags_procsize;
+extern afs_int32 afs_bkvolpref;
+extern char afs_cachebasedir[1024];
+extern afs_int32 afs_numcachefiles;
+extern afs_int32 afs_numfilesperdir;
struct unixuser {
- struct unixuser *next; /* next hash pointer */
- afs_int32 uid; /* search based on uid and cell */
+ struct unixuser *next; /* next hash pointer */
+ afs_int32 uid; /* search based on uid and cell */
afs_int32 cell;
- afs_int32 vid; /* corresponding vice id in specified cell */
- short refCount; /* reference count for allocation */
- char states; /* flag info */
- afs_int32 tokenTime; /* last time tokens were set, used for timing out conn data */
- afs_int32 stLen; /* ticket length (if kerberos, includes kvno at head) */
- char *stp; /* pointer to ticket itself */
+ afs_int32 vid; /* corresponding vice id in specified cell */
+ short refCount; /* reference count for allocation */
+ char states; /* flag info */
+ afs_int32 tokenTime; /* last time tokens were set, used for timing out conn data */
+ afs_int32 stLen; /* ticket length (if kerberos, includes kvno at head) */
+ char *stp; /* pointer to ticket itself */
struct ClearToken ct;
- struct afs_exporter *exporter; /* more info about the exporter for the remote user */
+ struct afs_exporter *exporter; /* more info about the exporter for the remote user */
+ void *cellinfo; /* pointer to cell info (PAG manager only) */
};
-struct conn {
+struct afs_conn {
/* Per-connection block. */
- struct conn *next; /* Next dude same server. */
- struct unixuser *user; /* user validated with respect to. */
- struct rx_connection *id; /* RPC connid. */
- struct srvAddr *srvr; /* server associated with this conn */
- short refCount; /* reference count for allocation */
- unsigned short port; /* port associated with this connection */
- char forceConnectFS; /* Should we try again with these tokens? */
+ struct afs_conn *next; /* Next dude same server. */
+ struct unixuser *user; /* user validated with respect to. */
+ struct rx_connection *id; /* RPC connid. */
+ struct srvAddr *srvr; /* server associated with this conn */
+ short refCount; /* reference count for allocation */
+ unsigned short port; /* port associated with this connection */
+ char forceConnectFS; /* Should we try again with these tokens? */
};
|| (a)->Fid.Volume != (b)->Fid.Volume \
|| (a)->Cell != (b)->Cell)
-#define FidMatches(afid,tvc) ((tvc)->fid.Fid.Vnode == (afid)->Fid.Vnode && \
- (tvc)->fid.Fid.Volume == (afid)->Fid.Volume && \
- (tvc)->fid.Cell == (afid)->Cell && \
- ( (tvc)->fid.Fid.Unique == (afid)->Fid.Unique || \
- (!(afid)->Fid.Unique && ((tvc)->states & CUnique))))
-
+#define FidMatches(afid,tvc) ((tvc)->f.fid.Fid.Vnode == (afid)->Fid.Vnode && \
+ (tvc)->f.fid.Fid.Volume == (afid)->Fid.Volume && \
+ (tvc)->f.fid.Cell == (afid)->Cell && \
+ ( (tvc)->f.fid.Fid.Unique == (afid)->Fid.Unique || \
+ (!(afid)->Fid.Unique && ((tvc)->f.states & CUnique))))
-/*
- * Operations on circular queues implemented with pointers. Note: these queue
- * objects are always located at the beginning of the structures they are linking.
- */
-#define QInit(q) ((q)->prev = (q)->next = (q))
-#define QAdd(q,e) ((e)->next = (q)->next, (e)->prev = (q), \
- (q)->next->prev = (e), (q)->next = (e))
-#define QRemove(e) ((e)->next->prev = (e)->prev, (e)->prev->next = (e)->next)
-#define QNext(e) ((e)->next)
-#define QPrev(e) ((e)->prev)
-#define QEmpty(q) ((q)->prev == (q))
-/* this one takes q1 and sticks it on the end of q2 - that is, the other end, not the end
- * that things are added onto. q1 shouldn't be empty, it's silly */
-#define QCat(q1,q2) ((q2)->prev->next = (q1)->next, (q1)->next->prev=(q2)->prev, (q1)->prev->next=(q2), (q2)->prev=(q1)->prev, (q1)->prev=(q1)->next=(q1))
-/*
- * Do lots of address arithmetic to go from vlruq to the base of the vcache
- * structure. Don't move struct vnode, since we think of a struct vcache as
- * a specialization of a struct vnode
- */
-#define QTOV(e) ((struct vcache *)(((char *) (e)) - (((char *)(&(((struct vcache *)(e))->vlruq))) - ((char *)(e)))))
-#define QTOC(e) ((struct cell *)((char *) (e)))
#define SRVADDR_MH 1
#define SRVADDR_ISDOWN 0x20 /* same as SRVR_ISDOWN */
-#define SRVADDR_NOUSE 0x40 /* Don't use this srvAddr */
+#define SRVADDR_NOUSE 0x40 /* Don't use this srvAddr */
struct srvAddr {
- struct srvAddr *next_bkt; /* next item in hash bucket */
- struct srvAddr *next_sa; /* another interface on same host */
+ struct srvAddr *next_bkt; /* next item in hash bucket */
+ struct srvAddr *next_sa; /* another interface on same host */
struct server *server; /* back to parent */
- struct conn *conns; /* All user connections to this server */
- afs_int32 sa_ip; /* Host addr in network byte order */
+ struct afs_conn *conns; /* All user connections to this server */
+ afs_int32 sa_ip; /* Host addr in network byte order */
u_short sa_iprank; /* indiv ip address priority */
u_short sa_portal; /* port addr in network byte order */
u_char sa_flags;
#define SRVR_MULTIHOMED 0x40
#define SRVR_ISGONE 0x80
#define SNO_INLINEBULK 0x100
-#define SNO_64BIT 0x200
+#define SNO_64BIT 0x200
#define afs_serverSetNo64Bit(s) ((s)->srvr->server->flags |= SNO_64BIT)
#define afs_serverHasNo64Bit(s) ((s)->srvr->server->flags & SNO_64BIT)
afs_int32 addr_uniquifier;
afs_int32 spares[2];
} _srvUuid;
- struct {
+ struct {
struct srvAddr haddr;
- } _srvId;
+ } _srvId;
} _suid;
#define sr_uuid _suid._srvUuid.suuid
#define sr_addr_uniquifier _suid._srvUuid.addr_uniquifier
#define sr_flags _suid._srvId.haddr.flags
#define sr_conns _suid._srvId.haddr.conns
struct server *next; /* Ptr to next server in hash chain */
- struct cell *cell; /* Cell in which this host resides */
+ struct cell *cell; /* Cell in which this host resides */
struct afs_cbr *cbrs; /* Return list of callbacks */
afs_int32 activationTime; /* Time when this record was first activated */
afs_int32 lastDowntimeStart; /* Time when last downtime incident began */
afs_int32 numDowntimeIncidents; /* # (completed) downtime incidents */
afs_int32 sumOfDowntimes; /* Total downtime experienced, in seconds */
struct srvAddr *addr;
- afs_uint32 flags; /* Misc flags*/
+ afs_uint32 flags; /* Misc flags */
};
-#define afs_PutServer(servp, locktype)
+#define afs_PutServer(servp, locktype)
/* structs for some pioctls - these are (or should be)
* also in venus.h
*/
struct spref {
- struct in_addr host;
- unsigned short rank;
+ struct in_addr host;
+ unsigned short rank;
};
struct sprefrequest_33 {
- unsigned short offset;
- unsigned short num_servers;
+ unsigned short offset;
+ unsigned short num_servers;
};
-struct sprefrequest { /* new struct for 3.4 */
- unsigned short offset;
- unsigned short num_servers;
- unsigned short flags;
+struct sprefrequest { /* new struct for 3.4 */
+ unsigned short offset;
+ unsigned short num_servers;
+ unsigned short flags;
};
#define DBservers 1
struct sprefinfo {
- unsigned short next_offset;
- unsigned short num_servers;
- struct spref servers[1]; /* we overrun this array intentionally...*/
+ unsigned short next_offset;
+ unsigned short num_servers;
+ struct spref servers[1]; /* we overrun this array intentionally... */
};
struct setspref {
- unsigned short flags;
- unsigned short num_servers;
- struct spref servers[1]; /* we overrun this array intentionally...*/
+ unsigned short flags;
+ unsigned short num_servers;
+ struct spref servers[1]; /* we overrun this array intentionally... */
};
/* struct for GAG pioctl
*/
struct gaginfo {
- afs_uint32 showflags, logflags, logwritethruflag, spare[3];
- unsigned char spare2[128];
+ afs_uint32 showflags, logflags, logwritethruflag, spare[3];
+ unsigned char spare2[128];
};
#define GAGUSER 1
#define GAGCONSOLE 2
#define logwritethruON 1
struct rxparams {
- afs_int32 rx_initReceiveWindow, rx_maxReceiveWindow,
- rx_initSendWindow, rx_maxSendWindow, rxi_nSendFrags,
- rxi_nRecvFrags, rxi_OrphanFragSize;
- afs_int32 rx_maxReceiveSize, rx_MyMaxSendSize;
- afs_uint32 spare[21];
- };
+ afs_int32 rx_initReceiveWindow, rx_maxReceiveWindow, rx_initSendWindow,
+ rx_maxSendWindow, rxi_nSendFrags, rxi_nRecvFrags, rxi_OrphanFragSize;
+ afs_int32 rx_maxReceiveSize, rx_MyMaxSendSize;
+ afs_uint32 spare[21];
+};
/* struct for checkservers */
-struct chservinfo
-{
- int magic;
- char tbuffer[128];
- int tsize;
- afs_int32 tinterval;
- afs_int32 tflags;
-}
-;
+struct chservinfo {
+ int magic;
+ char tbuffer[128];
+ int tsize;
+ afs_int32 tinterval;
+ afs_int32 tflags;
+};
/* state bits for volume */
-#define VRO 1 /* volume is readonly */
-#define VRecheck 2 /* recheck volume info with server */
-#define VBackup 4 /* is this a backup volume? */
-#define VForeign 8 /* this is a non-afs volume */
-#define VResort 16 /* server order was rearranged, sort when able */
-#define VMoreReps 32 /* This volume has more replicas than we are */
- /* keeping track of now -- check with VLDB */
+#define VRO 1 /* volume is readonly */
+#define VRecheck 2 /* recheck volume info with server */
+#define VBackup 4 /* is this a backup volume? */
+#define VForeign 8 /* this is a non-afs volume */
+#define VResort 16 /* server order was rearranged, sort when able */
+#define VMoreReps 32 /* This volume has more replicas than we are */
+ /* keeping track of now -- check with VLDB */
- enum repstate { not_busy, end_not_busy = 6, rd_busy, rdwr_busy, offline };
+enum repstate { not_busy, end_not_busy = 6, rd_busy, rdwr_busy, offline };
struct volume {
/* One structure per volume, describing where the volume is located
- and where its mount points are. */
+ * and where its mount points are. */
struct volume *next; /* Next volume in hash list. */
- afs_int32 cell; /* the cell in which the volume resides */
+ afs_int32 cell; /* the cell in which the volume resides */
afs_rwlock_t lock; /* the lock for this structure */
afs_int32 volume; /* This volume's ID number. */
char *name; /* This volume's name, or 0 if unknown */
- struct server *serverHost[MAXHOSTS]; /* servers serving this volume */
- enum repstate status[MAXHOSTS]; /* busy, offline, etc */
+ struct server *serverHost[MAXHOSTS]; /* servers serving this volume */
+ enum repstate status[MAXHOSTS]; /* busy, offline, etc */
struct VenusFid dotdot; /* dir to access as .. */
struct VenusFid mtpoint; /* The mount point for this volume. */
afs_int32 rootVnode, rootUnique; /* Volume's root fid */
afs_int32 roVol;
afs_int32 backVol;
- afs_int32 rwVol; /* For r/o vols, original read/write volume. */
- afs_int32 accessTime; /* last time we used it */
- afs_int32 vtix; /* volume table index */
+ afs_int32 rwVol; /* For r/o vols, original read/write volume. */
+ afs_int32 accessTime; /* last time we used it */
+ afs_int32 vtix; /* volume table index */
afs_int32 copyDate; /* copyDate field, for tracking vol releases */
- afs_int32 expireTime; /* for per-volume callbacks... */
+ afs_int32 expireTime; /* for per-volume callbacks... */
short refCount; /* reference count for allocation */
char states; /* here for alignment reasons */
};
/* format of an entry in volume info file */
struct fvolume {
- afs_int32 cell; /* cell for this entry */
+ afs_int32 cell; /* cell for this entry */
afs_int32 volume; /* volume */
- afs_int32 next; /* has index */
+ afs_int32 next; /* has index */
struct VenusFid dotdot; /* .. value */
struct VenusFid mtpoint; /* mt point's fid */
afs_int32 rootVnode, rootUnique; /* Volume's root fid */
#ifdef AFS_OSF_ENV
#define CWired 0x00000800 /* OSF hack only */
#else
+#ifdef AFS_DARWIN80_ENV
+#define CDeadVnode 0x00000800
+#else
#ifdef AFS_DARWIN_ENV
#define CUBCinit 0x00000800
#else
#define CWRITE_IGN 0x00000800 /* Next OS hack only */
#endif
#endif
+#endif
#define CUnique 0x00001000 /* vc's uniquifier - latest unifiquier for fid */
#define CForeign 0x00002000 /* this is a non-afs vcache */
+#define CReadDir 0x00004000 /* readdir in progress */
#define CUnlinked 0x00010000
#define CBulkStat 0x00020000 /* loaded by a bulk stat, and not ref'd since */
#define CUnlinkedDel 0x00040000
#define CVFlushed 0x00080000
#define CCore1 0x00100000 /* osf1 core file; not same as CCore above */
+#ifdef AFS_LINUX22_ENV
+#define CPageWrite 0x00200000 /* to detect vm deadlock - linux */
+#else
#define CWritingUFS 0x00200000 /* to detect vm deadlock - used by sgi */
+#endif
#define CCreating 0x00400000 /* avoid needless store after open truncate */
#define CPageHog 0x00800000 /* AIX - dumping large cores is a page hog. */
#define CDCLock 0x02000000 /* Vnode lock held over call to GetDownD */
#define CBulkFetching 0x04000000 /* stats are being fetched by bulk stat */
#define CExtendedFile 0x08000000 /* extended file via ftruncate call. */
+#define CVInit 0x10000000 /* being initialized */
+#define CMetaDirty 0x20000000 /* vnode meta-data needs to be flushed */
/* vcache vstate bits */
#define VRevokeWait 0x1
#define VPageCleaning 0x2 /* Solaris - Cache Trunc Daemon sez keep out */
+#if defined(AFS_DISCON_ENV)
+
+/* Dirty disconnected vcache flags. */
+#define VDisconSetTime 0x00000001 /* set time. */
+#define VDisconSetMode 0x00000002 /* set mode. */
+/* XXX: to be continued ? */
+#define VDisconTrunc 0x00000020 /* truncate file. */
+#define VDisconSetAttrMask 0x0000003F /* Masks for setattr ops. */
+#define VDisconWriteClose 0x00000400 /* Write op on file close. */
+#define VDisconWriteFlush 0x00000800 /* Write op on normal fsync/flush. */
+#define VDisconWriteOsiFlush 0x00001000 /* Write op on osi flush. */
+
+#define VDisconRemove 0x00002000 /* Remove vnop. */
+#define VDisconCreate 0x00004000 /* Create vnop. */
+#define VDisconCreated 0x00008000 /* A file that was created during
+ this resync operation */
+#define VDisconRename 0x00010000 /* Rename vnop. */
+#define VDisconRenameSameDir 0x00020000 /* Rename in same dir. */
+
+/*... to be continued ... */
+#endif
+
+#if defined(AFS_CACHE_BYPASS)
+/* vcache (file) cachingStates bits */
+#define FCSDesireBypass 0x1 /* This file should bypass the cache */
+#define FCSBypass 0x2 /* This file is currently NOT being cached */
+#define FCSManuallySet 0x4 /* The bypass flags were set, or reset, manually (via pioctl)
+ and should not be overridden by the file's name */
+
+/* Flag values used by the Transition routines */
+#define TRANSChangeDesiredBit 0x1 /* The Transition routine should set or
+ * reset the FCSDesireBypass bit */
+#define TRANSVcacheIsLocked 0x2 /* The Transition routine does not need to
+ * lock vcache (it's already locked) */
+#define TRANSSetManualBit 0x4 /* The Transition routine should set FCSManuallySet so that
+ * filename checking does not override pioctl requests */
+#endif /* AFS_CACHE_BYPASS */
+
#define CPSIZE 2
-#if !defined(AFS_FBSD_ENV)
-#define vrefCount v.v_count
+#if defined(AFS_XBSD_ENV) || defined(AFS_DARWIN_ENV)
+#define vrefCount v->v_usecount
#else
-#define vrefCount v.v_usecount
-#endif /* AFS_FBSD_ENV */
-
-#ifdef AFS_LINUX24_ENV
-#define VREFCOUNT(v) atomic_read(&((vnode_t *) v)->v_count)
-#define VREFCOUNT_SET(v, c) atomic_set(&((vnode_t *) v)->v_count, c)
-#define VREFCOUNT_DEC(v) atomic_dec(&((vnode_t *) v)->v_count)
-#define VREFCOUNT_INC(v) atomic_inc(&((vnode_t *) v)->v_count)
-#define DLOCK() spin_lock(&dcache_lock)
-#define DUNLOCK() spin_unlock(&dcache_lock)
-#define DGET(d) dget_locked(d)
-#define DCOUNT(d) atomic_read(&(d)->d_count)
+#define vrefCount v.v_count
+#endif /* AFS_XBSD_ENV */
+
+#if defined(AFS_DARWIN80_ENV)
+#define VREFCOUNT_GT(v, y) vnode_isinuse(AFSTOV(v), (y))
+#elif defined(AFS_XBSD_ENV) || defined(AFS_DARWIN_ENV)
+#define VREFCOUNT(v) ((v)->vrefCount)
+#define VREFCOUNT_GT(v, y) (AFSTOV(v)->v_usecount > (y))
+#elif defined(AFS_LINUX24_ENV)
+#define VREFCOUNT(v) atomic_read(&(AFSTOV(v)->v_count))
+#define VREFCOUNT_GT(v, y) (VREFCOUNT(v)>y)
+#define VREFCOUNT_SET(v, c) atomic_set(&(AFSTOV(v)->v_count), c)
+#define VREFCOUNT_DEC(v) atomic_dec(&(AFSTOV(v)->v_count))
+#define VREFCOUNT_INC(v) atomic_inc(&(AFSTOV(v)->v_count))
#else
#define VREFCOUNT(v) ((v)->vrefCount)
+#define VREFCOUNT_GT(v,y) ((v)->vrefCount > (y))
#define VREFCOUNT_SET(v, c) (v)->vrefCount = c;
#define VREFCOUNT_DEC(v) (v)->vrefCount--;
#define VREFCOUNT_INC(v) (v)->vrefCount++;
-#define DLOCK()
-#define DUNLOCK()
-#define DGET(d) dget(d)
-#define DCOUNT(d) ((d)->d_count)
+#define d_unhash(d) list_empty(&(d)->d_hash)
+#define dget_locked(d) dget(d)
#endif
-#define AFS_MAXDV 0x7fffffff /* largest dataversion number */
+#define AFS_MAXDV 0x7fffffff /* largest dataversion number */
#ifdef AFS_64BIT_CLIENT
-#define AFS_NOTRUNC 0x7fffffffffffffffLL /* largest positive int64 number */
+#define AFS_NOTRUNC 0x7fffffffffffffffLL /* largest positive int64 number */
#else /* AFS_64BIT_CLIENT */
-#define AFS_NOTRUNC 0x7fffffff /* largest dataversion number */
+#define AFS_NOTRUNC 0x7fffffff /* largest dataversion number */
#endif /* AFS_64BIT_CLIENT */
-extern afs_int32 vmPageHog; /* counter for # of vnodes which are page hogs. */
+extern afs_int32 vmPageHog; /* counter for # of vnodes which are page hogs. */
-/*
- * Fast map from vcache to dcache
- */
-struct vtodc
- {
- struct dcache * dc;
- afs_uint32 stamp;
- struct osi_file * f;
- afs_offs_t minLoc; /* smallest offset into dc. */
- afs_offs_t len; /* largest offset into dc. */
- };
-
-extern afs_uint32 afs_stampValue; /* stamp for pair's usage */
-#define MakeStamp() (++afs_stampValue)
-
-#define VTOAFS(V) ((struct vcache*)(V))
+#if defined(AFS_DARWIN80_ENV)
+#define VTOAFS(v) ((struct vcache *)vnode_fsnode((v)))
+#define AFSTOV(vc) ((vc)->v)
+#elif defined(AFS_XBSD_ENV) || defined(AFS_DARWIN_ENV) || (defined(AFS_LINUX22_ENV) && !defined(STRUCT_SUPER_HAS_ALLOC_INODE))
+#define VTOAFS(v) ((struct vcache *)(v)->v_data)
+#define AFSTOV(vc) ((vc)->v)
+#else
+#define VTOAFS(V) ((struct vcache *)(V))
#define AFSTOV(V) (&(V)->v)
-#ifdef AFS_LINUX22_ENV
-#define ITOAFS(V) ((struct vcache*)(V))
-#define AFSTOI(V) (struct inode *)(&(V)->v)
#endif
-/* INVARIANTs: (vlruq.next != NULL) == (vlruq.prev != NULL)
- * nextfree => !vlruq.next && ! vlruq.prev
- * !(avc->nextfree) && !avc->vlruq.next => (FreeVCList == avc->nextfree)
- */
-struct vcache {
- struct vnode v; /* Has reference count in v.v_count */
- struct afs_q vlruq; /* lru q next and prev */
- struct vcache *nextfree; /* next on free list (if free) */
- struct vcache *hnext; /* Hash next */
+struct afs_vnuniq {
+ afs_uint32 vnode;
+ afs_uint32 unique;
+};
+
+/* VCache elements which are kept on disk, and in the kernel */
+struct fvcache {
struct VenusFid fid;
struct mstat {
- afs_size_t Length;
- afs_hyper_t DataVersion;
- afs_uint32 Date;
- afs_uint32 Owner;
+ afs_size_t Length;
+ afs_hyper_t DataVersion;
+ afs_uint32 Date;
+ afs_uint32 Owner;
afs_uint32 Group;
- ushort Mode; /* XXXX Should be afs_int32 XXXX */
- ushort LinkCount;
+ afs_uint16 Mode; /* XXXX Should be afs_int32 XXXX */
+ afs_uint16 LinkCount;
+#ifdef AFS_DARWIN80_ENV
+ afs_uint16 Type;
+#else
/* vnode type is in v.v_type */
+#endif
} m;
- afs_rwlock_t lock; /* The lock on the vcache contents. */
+ struct afs_vnuniq parent;
+
+ /*! Truncate file to this position at the next store */
+ afs_size_t truncPos;
+
+ /*! System:AnyUser's access to this. */
+ afs_int32 anyAccess;
+
+ /*! state bits */
+ afs_uint32 states;
+
+#if defined(AFS_DISCON_ENV)
+ /*! Disconnected flags for this vcache element. */
+ afs_uint32 ddirty_flags;
+ /*! Shadow vnode + unique keep the shadow dir location. */
+ struct afs_vnuniq shadow;
+ /*! The old parent FID for renamed vnodes */
+ struct afs_vnuniq oldParent;
+#endif
+};
+
+/* INVARIANTs: (vlruq.next != NULL) == (vlruq.prev != NULL)
+ * nextfree => !vlruq.next && ! vlruq.prev
+ * !(avc->nextfree) && !avc->vlruq.next => (FreeVCList == avc->nextfree)
+ */
+struct vcache {
+#if defined(AFS_XBSD_ENV) || defined(AFS_DARWIN_ENV) || (defined(AFS_LINUX22_ENV) && !defined(STRUCT_SUPER_HAS_ALLOC_INODE))
+ struct vnode *v;
+#else
+ struct vnode v; /* Has reference count in v.v_count */
+#endif
+ struct afs_q vlruq; /* lru q next and prev */
+#if !defined(AFS_LINUX22_ENV)
+ struct vcache *nextfree; /* next on free list (if free) */
+#endif
+ struct vcache *hnext; /* Hash next */
+ struct afs_q vhashq; /* Hashed per-volume list */
+#if defined(AFS_DISCON_ENV)
+ /*! Queue of dirty vcaches. Lock with afs_disconDirtyLock */
+ struct afs_q dirtyq;
+ /*! Queue of vcaches with shadow entries. Lock with afs_disconDirtyLock */
+ struct afs_q shadowq;
+ /*! Queue of vcaches with dirty metadata. Locked by afs_xvcdirty */
+ struct afs_q metadirty;
+ /*! Vcaches slot number in the disk backup. Protected by tvc->lock */
+ afs_uint32 diskSlot;
+#endif
+ struct fvcache f;
+ afs_rwlock_t lock; /* The lock on the vcache contents. */
#if defined(AFS_SUN5_ENV)
/* Lock used to protect the activeV, multipage, and vstates fields.
* Do not try to get the vcache lock when the vlock is held */
afs_rwlock_t vlock;
-#endif /* defined(AFS_SUN5_ENV) */
+#endif /* defined(AFS_SUN5_ENV) */
#if defined(AFS_SUN5_ENV)
krwlock_t rwlock;
struct cred *credp;
#endif
-#if defined(AFS_SUN_ENV) || defined(AFS_ALPHA_ENV) || defined(AFS_DARWIN_ENV) || defined(AFS_FBSD_ENV)
+#ifdef AFS_BOZONLOCK_ENV
afs_bozoLock_t pvnLock; /* see locks.x */
#endif
#ifdef AFS_AIX32_ENV
#if defined(AFS_AIX51_ENV)
vmid_t segid;
#else
- int segid;
+ int segid;
#endif
struct ucred *credp;
#endif
#ifdef AFS_AIX_ENV
- int ownslock; /* pid of owner of excl lock, else 0 - defect 3083 */
+ int ownslock; /* pid of owner of excl lock, else 0 - defect 3083 */
#endif
-#ifdef AFS_DARWIN_ENV
- struct lock__bsd__ rwlock;
+#ifdef AFS_DARWIN80_ENV
+ lck_mtx_t *rwlock;
+#elif defined(AFS_DARWIN_ENV)
+ struct lock__bsd__ rwlock;
#endif
-#ifdef AFS_FBSD_ENV
- struct lock rwlock;
+#ifdef AFS_XBSD_ENV
+#if !defined(AFS_DFBSD_ENV)
+ struct lock rwlock;
#endif
- afs_int32 parentVnode; /* Parent dir, if a file. */
- afs_int32 parentUnique;
- struct VenusFid *mvid; /* Either parent dir (if root) or root (if mt pt) */
- char *linkData; /* Link data if a symlink. */
- afs_hyper_t flushDV; /* data version last flushed from text */
- afs_hyper_t mapDV; /* data version last flushed from map */
- afs_size_t truncPos; /* truncate file to this position at next store */
- struct server *callback; /* The callback host, if any */
- afs_uint32 cbExpires; /* time the callback expires */
- struct afs_q callsort; /* queue in expiry order, sort of */
- struct axscache *Access; /* a list of cached access bits */
- afs_int32 anyAccess; /* System:AnyUser's access to this. */
- afs_int32 last_looker; /* pag/uid from last lookup here */
+#endif
+
+ struct VenusFid *mvid; /* Either parent dir (if root) or root (if mt pt) */
+ char *linkData; /* Link data if a symlink. */
+ afs_hyper_t flushDV; /* data version last flushed from text */
+ afs_hyper_t mapDV; /* data version last flushed from map */
+ struct server *callback; /* The callback host, if any */
+ afs_uint32 cbExpires; /* time the callback expires */
+ struct afs_q callsort; /* queue in expiry order, sort of */
+ struct axscache *Access; /* a list of cached access bits */
+ afs_int32 last_looker; /* pag/uid from last lookup here */
#if defined(AFS_SUN5_ENV)
afs_int32 activeV;
-#endif /* defined(AFS_SUN5_ENV) */
+#endif /* defined(AFS_SUN5_ENV) */
struct SimpleLocks *slocks;
- short opens; /* The numbers of opens, read or write, on this file. */
- short execsOrWriters; /* The number of execs (if < 0) or writers (if > 0) of
- this file. */
- short flockCount; /* count of flock readers, or -1 if writer */
- char mvstat; /* 0->normal, 1->mt pt, 2->root. */
- afs_uint32 states; /* state bits */
+ short opens; /* The numbers of opens, read or write, on this file. */
+ short execsOrWriters; /* The number of execs (if < 0) or writers (if > 0) of
+ * this file. */
+ short flockCount; /* count of flock readers, or -1 if writer */
+ char mvstat; /* 0->normal, 1->mt pt, 2->root. */
+
+#if defined(AFS_CACHE_BYPASS)
+ char cachingStates; /* Caching policies for this file */
+ afs_uint32 cachingTransitions; /* # of times file has flopped between caching and not */
+#if defined(AFS_LINUX24_ENV)
+ off_t next_seq_offset; /* Next sequential offset (used by prefetch/readahead) */
+#else
+ off_t next_seq_blk_offset; /* accounted in blocks for Solaris & IRIX */
+#endif
+#endif
+
#if defined(AFS_SUN5_ENV)
- afs_uint32 vstates; /* vstate bits */
-#endif /* defined(AFS_SUN5_ENV) */
- struct vtodc quick;
- afs_uint32 symhintstamp;
- union {
- struct vcache *symhint;
- struct dcache *dchint;
- } h1;
+ afs_uint32 vstates; /* vstate bits */
+#endif /* defined(AFS_SUN5_ENV) */
+ struct dcache *dchint;
+ struct dcache *dcreaddir; /* dcache for in-progress readdir */
+ unsigned int readdir_pid; /* pid of the thread in readdir */
#ifdef AFS_LINUX22_ENV
- u_short flushcnt; /* Number of flushes which haven't released yet. */
- u_short mapcnt; /* Number of mappings of this file. */
+ u_short mapcnt; /* Number of mappings of this file. */
#endif
#if defined(AFS_SGI_ENV)
- daddr_t lastr; /* for read-ahead */
+ daddr_t lastr; /* for read-ahead */
#ifdef AFS_SGI64_ENV
- uint64_t vc_rwlockid; /* kthread owning rwlock */
+ uint64_t vc_rwlockid; /* kthread owning rwlock */
#else
- short vc_rwlockid; /* pid of process owning rwlock */
+ short vc_rwlockid; /* pid of process owning rwlock */
#endif
- short vc_locktrips; /* # of rwlock reacquisitions */
- sema_t vc_rwlock; /* vop_rwlock for afs */
- pgno_t mapcnt; /* # of pages mapped */
- struct cred *cred; /* last writer's cred */
+ short vc_locktrips; /* # of rwlock reacquisitions */
+ sema_t vc_rwlock; /* vop_rwlock for afs */
+ pgno_t mapcnt; /* # of pages mapped */
+ struct cred *cred; /* last writer's cred */
#ifdef AFS_SGI64_ENV
struct bhv_desc vc_bhv_desc; /* vnode's behavior data. */
#endif
-#endif /* AFS_SGI_ENV */
- afs_int32 vc_error; /* stash write error for this vnode. */
- int xlatordv; /* Used by nfs xlator */
+#endif /* AFS_SGI_ENV */
+ afs_int32 vc_error; /* stash write error for this vnode. */
+ int xlatordv; /* Used by nfs xlator */
struct AFS_UCRED *uncred;
- int asynchrony; /* num kbytes to store behind */
+ int asynchrony; /* num kbytes to store behind */
#ifdef AFS_SUN5_ENV
short multiPage; /* count of multi-page getpages in progress */
#endif
};
-#define afs_symhint_inval(avc)
-
-
#define DONT_CHECK_MODE_BITS 0
#define CHECK_MODE_BITS 1
-#define CMB_ALLOW_EXEC_AS_READ 2 /* For the NFS xlator */
+#define CMB_ALLOW_EXEC_AS_READ 2 /* For the NFS xlator */
#if defined(AFS_SGI_ENV)
#define AVCRWLOCK(avc) (valusema(&(avc)->vc_rwlock) <= 0)
#ifdef AFS_SGI53_ENV
#ifdef AFS_SGI62_ENV
#define AFS_RWLOCK_T vrwlock_t
-#else
+#else
#define AFS_RWLOCK_T int
#endif /* AFS_SGI62_ENV */
#ifdef AFS_SGI64_ENV
struct VenusFid fid;
afs_hyper_t DataVersion;
afs_rwlock_t lock;
- afs_int32 parentVnode;
+ afs_int32 parentVnode;
afs_int32 parentUnique;
afs_hyper_t flushDV;
afs_hyper_t mapDV;
afs_uint32 states;
};
+struct vcxstat2 {
+ afs_int32 callerAccess;
+ afs_int32 cbExpires;
+ afs_int32 anyAccess;
+ char mvstat;
+};
+
struct sbstruct {
- int sb_thisfile;
- int sb_default;
+ int sb_thisfile;
+ int sb_default;
};
/* CM inititialization parameters. What CM actually used after calculations
* based on passed in arguments.
*/
-#define CMI_VERSION 1 /* increment when adding new fields. */
+#define CMI_VERSION 1 /* increment when adding new fields. */
struct cm_initparams {
int cmi_version;
int cmi_nChunkFiles;
int cmi_nVolumeCaches;
int cmi_firstChunkSize;
int cmi_otherChunkSize;
- int cmi_cacheSize; /* The original cache size, in 1K blocks. */
+ int cmi_cacheSize; /* The original cache size, in 1K blocks. */
unsigned cmi_setTime:1;
unsigned cmi_memCache:1;
- int spare[16-9]; /* size of struct is 16 * 4 = 64 bytes */
+ int spare[16 - 9]; /* size of struct is 16 * 4 = 64 bytes */
};
#define NULLIDX (-1) /* null index definition */
/* struct dcache states bits */
+#define DRO 1
+#define DBackup 2
+#define DRW 4
#define DWriting 8 /* file being written (used for cache validation) */
/* dcache data flags */
/* flags in afs_indexFlags array */
-#define IFEverUsed 1 /* index entry has >= 1 byte of data */
-#define IFFree 2 /* index entry in freeDCList */
-#define IFDataMod 4 /* file needs to be written out */
-#define IFFlag 8 /* utility flag */
+#define IFEverUsed 1 /* index entry has >= 1 byte of data */
+#define IFFree 2 /* index entry in freeDCList */
+#define IFDataMod 4 /* file needs to be written out */
+#define IFFlag 8 /* utility flag */
#define IFDirtyPages 16
#define IFAnyPages 32
-#define IFDiscarded 64 /* index entry in discardDCList */
+#define IFDiscarded 64 /* index entry in discardDCList */
struct afs_ioctl {
- char *in; /* input buffer */
- char *out; /* output buffer */
- short in_size; /* Size of input buffer <= 2K */
- short out_size; /* Maximum size of output buffer, <= 2K */
+ char *in; /* input buffer */
+ char *out; /* output buffer */
+ short in_size; /* Size of input buffer <= 2K */
+ short out_size; /* Maximum size of output buffer, <= 2K */
};
/*
* instead of using it.
*/
struct afs_fheader {
-#define AFS_FHMAGIC 0x7635abaf /* uses version number */
+#define AFS_FHMAGIC 0x7635abaf /* uses version number */
afs_int32 magic;
#if defined(AFS_SUN57_64BIT_ENV)
#define AFS_CI_VERSION 3
afs_int32 otherCSize;
};
-#if defined(AFS_SGI61_ENV) || defined(AFS_SUN57_64BIT_ENV)
+#if defined(AFS_CACHE_VNODE_PATH) || defined(UKERNEL)
+typedef afs_int32 afs_ufs_dcache_id_t;
+#elif defined(AFS_SGI61_ENV) || defined(AFS_SUN57_64BIT_ENV)
/* Using ino64_t here so that user level debugging programs compile
* the size correctly.
*/
-#define afs_inode_t ino64_t
-#else
-#if defined(AFS_LINUX_64BIT_KERNEL)
-#define afs_inode_t long
+typedef ino64_t afs_ufs_dcache_id_t;
+#elif defined(LINUX_USE_FH)
+#define MAX_FH_LEN 10
+typedef union {
+ struct fid fh;
+ __u32 raw[MAX_FH_LEN];
+} afs_ufs_dcache_id_t;
+extern int cache_fh_type;
+extern int cache_fh_len;
+#elif defined(AFS_LINUX_64BIT_KERNEL) && !defined(AFS_S390X_LINUX24_ENV)
+typedef long afs_ufs_dcache_id_t;
+#elif defined(AFS_AIX51_ENV) || defined(AFS_HPUX1123_ENV)
+typedef ino_t afs_ufs_dcache_id_t;
#else
-#if defined(AFS_AIX51_ENV)
-#define afs_inode_t ino_t
-#else
-#define afs_inode_t afs_int32
-#endif
+typedef afs_int32 afs_ufs_dcache_id_t;
#endif
+
+typedef afs_int32 afs_mem_dcache_id_t;
+
+typedef union {
+ afs_ufs_dcache_id_t ufs;
+ afs_mem_dcache_id_t mem;
+} afs_dcache_id_t;
+
+#ifdef KERNEL
+/* it does not compile outside kernel */
+struct buffer {
+ afs_int32 fid; /* is adc->index, the cache file number */
+ afs_dcache_id_t inode; /* is adc->f.inode, the inode number of the cac\
+ he file */
+ afs_int32 page;
+ afs_int32 accesstime;
+ struct buffer *hashNext;
+ char *data;
+ char lockers;
+ char dirty;
+ char hashIndex;
+#if defined(AFS_USEBUFFERS)
+ struct buf *bufp;
#endif
+ afs_rwlock_t lock; /* the lock for this structure */
+};
/* kept on disk and in dcache entries */
struct fcache {
afs_int32 modTime; /* last time this entry was modified */
afs_hyper_t versionNo; /* Associated data version number */
afs_int32 chunk; /* Relative chunk number */
- afs_inode_t inode; /* Unix inode for this chunk */
+ afs_dcache_id_t inode; /* Unix inode for this chunk */
afs_int32 chunkBytes; /* Num bytes in this chunk */
char states; /* Has this chunk been modified? */
};
+#endif
/* magic numbers to specify the cache type */
/* kept in memory */
struct dcache {
struct afs_q lruq; /* Free queue for in-memory images */
+ struct afs_q dirty; /* Queue of dirty entries that need written */
afs_rwlock_t lock; /* Protects validPos, some f */
afs_rwlock_t tlock; /* Atomizes updates to refCount */
afs_rwlock_t mflock; /* Atomizes accesses/updates to mflags */
afs_size_t validPos; /* number of valid bytes during fetch */
- afs_int32 index; /* The index in the CacheInfo file*/
+ afs_int32 index; /* The index in the CacheInfo file */
short refCount; /* Associated reference count. */
char dflags; /* Data flags */
char mflags; /* Meta flags */
struct fcache f; /* disk image */
- afs_int32 stamp; /* used with vtodc struct for hints */
-
+ afs_int32 bucket; /* which bucket these dcache entries are in */
/*
* Locking rules:
*
* Note that dcache.lock(W) gives you the right to update mflags,
* as dcache.mflock(W) can only be held with dcache.lock(R).
*
- * dcache.stamp is protected by the associated vcache lock, because
- * it's only purpose is to establish correspondence between vcache
- * and dcache entries.
- *
* dcache.index, dcache.f.fid, dcache.f.chunk and dcache.f.inode are
* write-protected by afs_xdcache and read-protected by refCount.
* Once an entry is referenced, these values cannot change, and if
* ensuring noone else has a refCount on it).
*/
};
-/* this is obsolete and should be removed */
-#define ihint stamp
+
+/* afs_memcache.c */
+struct memCacheEntry {
+ int size; /* # of valid bytes in this entry */
+ int dataSize; /* size of allocated data area */
+ afs_lock_t afs_memLock;
+ char *data; /* bytes */
+};
/* macro to mark a dcache entry as bad */
#define ZapDCE(x) \
#define afs_FakeClose(avc, acred) \
{ if (avc->execsOrWriters == 1) { \
/* we're the last writer, just use CCore flag */ \
- avc->states |= CCore; /* causes close to be called later */ \
+ avc->f.states |= CCore; /* causes close to be called later */ \
\
/* The cred and vnode holds will be released in afs_FlushActiveVcaches */ \
VN_HOLD(AFSTOV(avc)); /* So it won't disappear */ \
avc->opens--; \
avc->execsOrWriters--; \
} \
-}
+}
+
+#define AFS_ZEROS 64 /* zero buffer */
-#define AFS_ZEROS 64 /* zero buffer */
+/*#define afs_DirtyPages(avc) (((avc)->f.states & CDirty) || osi_VMDirty_p((avc)))*/
+#define afs_DirtyPages(avc) ((avc)->f.states & CDirty)
-/*#define afs_DirtyPages(avc) (((avc)->states & CDirty) || osi_VMDirty_p((avc)))*/
-#define afs_DirtyPages(avc) ((avc)->states & CDirty)
+#define afs_InReadDir(avc) (((avc)->f.states & CReadDir) && (avc)->readdir_pid == MyPidxx2Pid(MyPidxx))
/* The PFlush algorithm makes use of the fact that Fid.Unique is not used in
below hash algorithms. Change it if need be so that flushing algorithm
*/
/* extern int afs_dhashsize; */
#define DCHash(v, c) ((((v)->Fid.Vnode + (v)->Fid.Volume + (c))) & (afs_dhashsize-1))
- /*Vnode, Chunk -> Hash table index*/
+ /*Vnode, Chunk -> Hash table index */
#define DVHash(v) ((((v)->Fid.Vnode + (v)->Fid.Volume )) & (afs_dhashsize-1))
- /*Vnode -> Other hash table index*/
+ /*Vnode -> Other hash table index */
/* don't hash on the cell, our callback-breaking code sometimes fails to compute
the cell correctly, and only scans one hash bucket */
#define VCHash(fid) (((fid)->Fid.Volume + (fid)->Fid.Vnode) & (VCSIZE-1))
-
-extern struct dcache **afs_indexTable; /*Pointers to in-memory dcache entries*/
-extern afs_int32 *afs_indexUnique; /*dcache entry Fid.Unique */
-extern afs_int32 *afs_dvnextTbl; /*Dcache hash table links */
-extern afs_int32 *afs_dcnextTbl; /*Dcache hash table links */
-extern afs_int32 afs_cacheFiles; /*Size of afs_indexTable*/
-extern afs_int32 afs_cacheBlocks; /*1K blocks in cache*/
-extern afs_int32 afs_cacheStats; /*Stat entries in cache*/
-extern struct vcache *afs_vhashT[VCSIZE]; /*Stat cache hash table*/
-extern afs_int32 afs_initState; /*Initialization state*/
-extern afs_int32 afs_termState; /* Termination state */
-extern struct VenusFid afs_rootFid; /*Root for whole file system*/
-extern afs_int32 afs_allCBs; /* Count of callbacks*/
-extern afs_int32 afs_oddCBs; /* Count of odd callbacks*/
-extern afs_int32 afs_evenCBs; /* Count of even callbacks*/
-extern afs_int32 afs_allZaps; /* Count of fid deletes */
-extern afs_int32 afs_oddZaps; /* Count of odd fid deletes */
-extern afs_int32 afs_evenZaps; /* Count of even fid deletes */
-extern struct brequest afs_brs[NBRS]; /* request structures */
+/* Hash only on volume to speed up volume callbacks. */
+#define VCHashV(fid) ((fid)->Fid.Volume & (VCSIZE-1))
+
+extern struct dcache **afs_indexTable; /*Pointers to in-memory dcache entries */
+extern afs_int32 *afs_indexUnique; /*dcache entry Fid.Unique */
+extern afs_int32 *afs_dvnextTbl; /*Dcache hash table links */
+extern afs_int32 *afs_dcnextTbl; /*Dcache hash table links */
+extern afs_int32 afs_cacheFiles; /*Size of afs_indexTable */
+extern afs_int32 afs_cacheBlocks; /*1K blocks in cache */
+extern afs_int32 afs_cacheStats; /*Stat entries in cache */
+extern struct vcache *afs_vhashT[VCSIZE]; /*Stat cache hash table */
+extern struct afs_q afs_vhashTV[VCSIZE]; /* cache hash table on volume */
+extern afs_int32 afs_initState; /*Initialization state */
+extern afs_int32 afs_termState; /* Termination state */
+extern struct VenusFid afs_rootFid; /*Root for whole file system */
+extern afs_int32 afs_allCBs; /* Count of callbacks */
+extern afs_int32 afs_oddCBs; /* Count of odd callbacks */
+extern afs_int32 afs_evenCBs; /* Count of even callbacks */
+extern afs_int32 afs_allZaps; /* Count of fid deletes */
+extern afs_int32 afs_oddZaps; /* Count of odd fid deletes */
+extern afs_int32 afs_evenZaps; /* Count of even fid deletes */
+extern struct brequest afs_brs[NBRS]; /* request structures */
#define UHash(auid) ((auid) & (NUSERS-1))
#define VHash(avol) ((avol)&(NVOLS-1))
* GetVCache incantation, and could eliminate even this code from afs_UFSRead
* by making intentionally invalidating quick.stamp in the various callbacks
* expiration/breaking code */
-#ifdef AFS_LINUX20_ENV
-#define afs_VerifyVCache(avc, areq) \
- (((avc)->states & CStatd) ? (vcache2inode(avc), 0) : \
- afs_VerifyVCache2((avc),areq))
-#else
#ifdef AFS_DARWIN_ENV
#define afs_VerifyVCache(avc, areq) \
- (((avc)->states & CStatd) ? (osi_VM_Setup(avc, 0), 0) : \
+ (((avc)->f.states & CStatd) ? (osi_VM_Setup(avc, 0), 0) : \
afs_VerifyVCache2((avc),areq))
#else
#define afs_VerifyVCache(avc, areq) \
- (((avc)->states & CStatd) ? 0 : afs_VerifyVCache2((avc),areq))
-#endif
+ (((avc)->f.states & CStatd) ? 0 : afs_VerifyVCache2((avc),areq))
#endif
-#define DO_STATS 1 /* bits used by FindVCache */
+#define DO_STATS 1 /* bits used by FindVCache */
#define DO_VLRU 2
+#define IS_SLOCK 4
+#define IS_WLOCK 8
/* values for flag param of afs_CheckVolumeNames */
#define AFS_VOLCHECK_EXPIRED 0x1 /* volumes whose callbacks have expired */
* afs_GetDownD wakes those processes once the cache is 95% full
* (CM_CACHESIZEDRAINEDPCT).
*/
-#define CM_MAXDISCARDEDCHUNKS 16 /* # of chunks */
-#define CM_DCACHECOUNTFREEPCT 95 /* max pct of chunks in use */
-#define CM_DCACHESPACEFREEPCT 90 /* max pct of space in use */
-#define CM_DCACHEEXTRAPCT 5 /* extra to get when freeing */
-#define CM_CACHESIZEDRAINEDPCT 95 /* wakeup processes when down to here.*/
-#define CM_WAITFORDRAINPCT 98 /* sleep if cache is this full. */
+#define CM_MAXDISCARDEDCHUNKS 16 /* # of chunks */
+#define CM_DCACHECOUNTFREEPCT 95 /* max pct of chunks in use */
+#define CM_DCACHESPACEFREEPCT 90 /* max pct of space in use */
+#define CM_DCACHEEXTRAPCT 5 /* extra to get when freeing */
+#define CM_CACHESIZEDRAINEDPCT 95 /* wakeup processes when down to here. */
+#define CM_WAITFORDRAINPCT 98 /* sleep if cache is this full. */
+
+/* when afs_cacheBlocks is large, settle for slightly decreased precision */
+#define PERCENT(p, v) \
+ ((afs_cacheBlocks & 0xffe00000) ? ((v) / 100 * (p)) : ((p) * (v) / 100))
#define afs_CacheIsTooFull() \
(afs_blocksUsed - afs_blocksDiscarded > \
- (CM_DCACHECOUNTFREEPCT*afs_cacheBlocks)/100 || \
+ PERCENT(CM_DCACHECOUNTFREEPCT, afs_cacheBlocks) || \
afs_freeDCCount - afs_discardDCCount < \
- ((100-CM_DCACHECOUNTFREEPCT)*afs_cacheFiles)/100)
+ PERCENT(100 - CM_DCACHECOUNTFREEPCT, afs_cacheFiles))
/* Handy max length of a numeric string. */
-#define CVBS 12 /* max afs_int32 is 2^32 ~ 4*10^9, +1 for NULL, +luck */
+#define CVBS 12 /* max afs_int32 is 2^32 ~ 4*10^9, +1 for NULL, +luck */
#define refpanic(foo) if (afs_norefpanic) \
{ printf( foo ); afs_norefpanic++;} else osi_Panic( foo )
#ifndef afs_vnodeToDev
#if defined(AFS_SGI62_ENV) || defined(AFS_HAVE_VXFS) || defined(AFS_DARWIN_ENV)
#define afs_vnodeToDev(V) VnodeToDev(V)
-#else
-#ifdef AFS_DECOSF_ENV
+#elif defined(AFS_DECOSF_ENV)
#define afs_vnodeToDev(V) osi_vnodeToDev(V)
#else
#define afs_vnodeToDev(V) (VTOI(V)->i_dev)
-#endif /* AFS_DECOSF_ENV */
-#endif /* AFS_SGI62_ENV */
+#endif
#endif
struct buf;
#endif
+struct storeOps {
+ int (*prepare)(void *rock, afs_uint32 size, afs_uint32 *bytestoxfer);
+ int (*read)(void *rock, struct osi_file *tfile, afs_uint32 offset,
+ afs_uint32 tlen, afs_uint32 *bytesread);
+ int (*write)(void *rock, afs_uint32 tlen, afs_uint32 *byteswritten);
+ int (*status)(void *rock);
+ int (*destroy)(void **rock, afs_int32 error);
+};
+
+struct fetchOps {
+ int (*more)(void *rock, afs_uint32 *length, afs_uint32 *moredata);
+ int (*read)(void *rock, afs_uint32 tlen, afs_uint32 *bytesread);
+ int (*write)(void *rock, struct osi_file *fp, afs_uint32 offset,
+ afs_uint32 tlen, afs_uint32 *byteswritten);
+ int (*destroy)(void **rock, afs_int32 error);
+};
+
/* fakestat support: opaque storage for afs_EvalFakeStat to remember
* what vcache should be released.
*/
};
extern int afs_fakestat_enable;
-
-struct buffer {
- ino_t fid[1]; /* Unique cache key + i/o addressing */
- afs_int32 page;
- afs_int32 accesstime;
- struct buffer *hashNext;
- char *data;
- char lockers;
- char dirty;
- char hashIndex;
-#if AFS_USEBUFFERS
- struct buf *bufp;
-#endif
- afs_rwlock_t lock; /* the lock for this structure */
-};
-
-/* afs_memcache.c */
-struct memCacheEntry {
- int size; /* # of valid bytes in this entry */
- int dataSize; /* size of allocated data area */
- afs_lock_t afs_memLock;
- char *data; /* bytes */
-};
-
-#endif /* _AFS_H_ */
-
+#endif /* _AFS_H_ */
git://git.openafs.org / openafs.git / blobdiff