*	leaf node entry head/only segment * * 	For legacy filesystems, name contains 13 unichars -- no index field */typedef struct {	u32 inumber;		/* 4: 4-byte aligned */	s8 next;		/* 1: */	u8 namlen;		/* 1: */	UniChar name[11];	/* 22: 2-byte aligned */	u32 index;		/* 4: index into dir_table */} ldtentry_t;			/* (32) */#define DTLHDRDATALEN	11/* * dir_table used for directory traversal during readdir*/ /* * Maximum entry in inline directory table */typedef struct dir_table_slot {	u8 rsrvd;	/* 1: */	u8 flag;	/* 1: 0 if free */	u8 slot;	/* 1: slot within leaf page of entry */	u8 addr1;	/* 1: upper 8 bits of leaf page address */	u32 addr2;	/* 4: lower 32 bits of leaf page address -OR-			      index of next entry when this entry was deleted */} dir_table_slot_t;	/* (8) *//* *	directory root page (in-line in on-disk inode): * * cf. dtpage_t below. */typedef union {	struct {		dasd_t DASD;	/* 16: DASD limit/usage info  F226941 */		u8 flag;	/* 1: */		s8 nextindex;	/* 1: next free entry in stbl */		s8 freecnt;	/* 1: free count */		s8 freelist;	/* 1: freelist header */		u32 idotdot;	/* 4: parent inode number */		s8 stbl[8];	/* 8: sorted entry index table */	} header;		/* (32) */	dtslot_t slot[9];} dtroot_t;/* *	directory regular page: * *	entry slot array of 32 byte slot * * sorted entry slot index table (stbl): * contiguous slots at slot specified by stblindex, * 1-byte per entry *   512 byte block:  16 entry tbl (1 slot) *  1024 byte block:  32 entry tbl (1 slot) *  2048 byte block:  64 entry tbl (2 slot) *  4096 byte block: 128 entry tbl (4 slot) * * data area: *   512 byte block:  16 - 2 =  14 slot *  1024 byte block:  32 - 2 =  30 slot *  2048 byte block:  64 - 3 =  61 slot *  4096 byte block: 128 - 5 = 123 slot * * N.B. index is 0-based; index fields refer to slot index * except nextindex which refers to entry index in stbl; * end of entry stot list or freelist is marked with -1. */typedef union {	struct {		s64 next;	/* 8: next sibling */		s64 prev;	/* 8: previous sibling */		u8 flag;	/* 1: */		s8 nextindex;	/* 1: next entry index in stbl */		s8 freecnt;	/* 1: */		s8 freelist;	/* 1: slot index of head of freelist */		u8 maxslot;	/* 1: number of slots in page slot[] */		s8 stblindex;	/* 1: slot index of start of stbl */		u8 rsrvd[2];	/* 2: */		pxd_t self;	/* 8: self pxd */	} header;		/* (32) */	dtslot_t slot[128];} dtpage_t;/* from jfs_xtree.h *//* *      extent allocation descriptor (xad) */typedef struct xad {	unsigned flag:8;	/* 1: flag */	unsigned rsvrd:16;	/* 2: reserved */	unsigned off1:8;	/* 1: offset in unit of fsblksize */	u32 off2;		/* 4: offset in unit of fsblksize */	unsigned len:24;	/* 3: length in unit of fsblksize */	unsigned addr1:8;	/* 1: address in unit of fsblksize */	u32 addr2;		/* 4: address in unit of fsblksize */} xad_t;			/* (16) *//* xad_t field extraction */#define offsetXAD(xad)	(((s64)((xad)->off1)) << 32 | ((xad)->off2))#define addressXAD(xad)	(((s64)((xad)->addr1)) << 32 | ((xad)->addr2))#define lengthXAD(xad)	((xad)->len)/* possible values for maxentry */#define XTPAGEMAXSLOT   256#define XTENTRYSTART    2/* *      xtree page: */typedef union {	struct xtheader {		s64 next;	/* 8: */		s64 prev;	/* 8: */		u8 flag;	/* 1: */		u8 rsrvd1;	/* 1: */		s16 nextindex;	/* 2: next index = number of entries */		s16 maxentry;	/* 2: max number of entries */		s16 rsrvd2;	/* 2: */		pxd_t self;	/* 8: self */	} header;		/* (32) */	xad_t xad[XTPAGEMAXSLOT];	/* 16 * maxentry: xad array */} xtpage_t;/* from jfs_dinode.h */struct dinode {	/*	 *      I. base area (128 bytes)	 *      ------------------------	 *	 * define generic/POSIX attributes	 */	u32 di_inostamp;	/* 4: stamp to show inode belongs to fileset */	s32 di_fileset;		/* 4: fileset number */	u32 di_number;		/* 4: inode number, aka file serial number */	u32 di_gen;		/* 4: inode generation number */	pxd_t di_ixpxd;		/* 8: inode extent descriptor */	s64 di_size;		/* 8: size */	s64 di_nblocks;		/* 8: number of blocks allocated */	u32 di_nlink;		/* 4: number of links to the object */	u32 di_uid;		/* 4: user id of owner */	u32 di_gid;		/* 4: group id of owner */	u32 di_mode;		/* 4: attribute, format and permission */	struct timestruc_t di_atime;	/* 8: time last data accessed */	struct timestruc_t di_ctime;	/* 8: time last status changed */	struct timestruc_t di_mtime;	/* 8: time last data modified */	struct timestruc_t di_otime;	/* 8: time created */	dxd_t di_acl;		/* 16: acl descriptor */	dxd_t di_ea;		/* 16: ea descriptor */	s32 di_next_index;  /* 4: Next available dir_table index */	s32 di_acltype;		/* 4: Type of ACL */	/*	 * 	Extension Areas.	 *	 *	Historically, the inode was partitioned into 4 128-byte areas,	 *	the last 3 being defined as unions which could have multiple	 *	uses.  The first 96 bytes had been completely unused until	 *	an index table was added to the directory.  It is now more	 *	useful to describe the last 3/4 of the inode as a single	 *	union.  We would probably be better off redesigning the	 *	entire structure from scratch, but we don't want to break	 *	commonality with OS/2's JFS at this time.	 */	union {		struct {			/*			 * This table contains the information needed to			 * find a directory entry from a 32-bit index.			 * If the index is small enough, the table is inline,			 * otherwise, an x-tree root overlays this table			 */			dir_table_slot_t _table[12];	/* 96: inline */			dtroot_t _dtroot;		/* 288: dtree root */		} _dir;					/* (384) */#define di_dirtable	u._dir._table#define di_dtroot	u._dir._dtroot#define di_parent       di_dtroot.header.idotdot#define di_DASD		di_dtroot.header.DASD		struct {			union {				u8 _data[96];		/* 96: unused */				struct {					void *_imap;	/* 4: unused */					u32 _gengen;	/* 4: generator */				} _imap;			} _u1;				/* 96: */#define di_gengen	u._file._u1._imap._gengen			union {				xtpage_t _xtroot;				struct {					u8 unused[16];	/* 16: */					dxd_t _dxd;	/* 16: */					union {						u32 _rdev;	/* 4: */						u8 _fastsymlink[128];					} _u;					u8 _inlineea[128];				} _special;			} _u2;		} _file;#define di_xtroot	u._file._u2._xtroot#define di_dxd		u._file._u2._special._dxd#define di_btroot	di_xtroot#define di_inlinedata	u._file._u2._special._u#define di_rdev		u._file._u2._special._u._rdev#define di_fastsymlink	u._file._u2._special._u._fastsymlink#define di_inlineea     u._file._u2._special._inlineea	} u;};typedef struct dinode dinode_t;/* di_mode */#define IFMT	0xF000		/* S_IFMT - mask of file type */#define IFDIR	0x4000		/* S_IFDIR - directory */#define IFREG	0x8000		/* S_IFREG - regular file */#define IFLNK	0xA000		/* S_IFLNK - symbolic link *//* extended mode bits (on-disk inode di_mode) */#define INLINEEA        0x00040000	/* inline EA area free *//* from jfs_imap.h */#define	EXTSPERIAG	128	/* number of disk inode extent per iag  */#define SMAPSZ		4	/* number of words per summary map      */#define	MAXAG		128	/* maximum number of allocation groups  *//* *	inode allocation map: *  * inode allocation map consists of  * . the inode map control page and * . inode allocation group pages (per 4096 inodes) * which are addressed by standard JFS xtree. *//* *	inode allocation group page (per 4096 inodes of an AG) */typedef struct {	s64 agstart;		/* 8: starting block of ag              */	s32 iagnum;		/* 4: inode allocation group number     */	s32 inofreefwd;		/* 4: ag inode free list forward        */	s32 inofreeback;	/* 4: ag inode free list back           */	s32 extfreefwd;		/* 4: ag inode extent free list forward */	s32 extfreeback;	/* 4: ag inode extent free list back    */	s32 iagfree;		/* 4: iag free list                     */	/* summary map: 1 bit per inode extent */	s32 inosmap[SMAPSZ];	/* 16: sum map of mapwords w/ free inodes;				 *      note: this indicates free and backed				 *      inodes, if the extent is not backed the				 *      value will be 1.  if the extent is				 *      backed but all inodes are being used the				 *      value will be 1.  if the extent is				 *      backed but at least one of the inodes is				 *      free the value will be 0.				 */	s32 extsmap[SMAPSZ];	/* 16: sum map of mapwords w/ free extents */	s32 nfreeinos;		/* 4: number of free inodes             */	s32 nfreeexts;		/* 4: number of free extents            */	/* (72) */	u8 pad[1976];		/* 1976: pad to 2048 bytes */	/* allocation bit map: 1 bit per inode (0 - free, 1 - allocated) */	u32 wmap[EXTSPERIAG];	/* 512: working allocation map  */	u32 pmap[EXTSPERIAG];	/* 512: persistent allocation map */	pxd_t inoext[EXTSPERIAG];	/* 1024: inode extent addresses */} iag_t;			/* (4096) */#endif /* _JFS_H_ */