Return to xfs_dir_leaf.h CVS log

Up to [Development] / xfs-linux

Add support for in-core and on-disk inodes with both data and
attribute forks, or just a data fork.  Change all the data structures
and macros used to manipulate the variable portion of the inode, to
support this feature.

#ifndef _FS_XFS_DIR_LEAF_H
#define	_FS_XFS_DIR_LEAF_H

#ident	"$Revision: 1.1 $"

/*
 * xfs_dir_leaf.h
 *
 * Directory layout, internal structure, access macros, etc.
 *
 * Large directories are structured around Btrees where all the data
 * elements are in the leaf nodes.  Filenames are hashed into an int,
 * then that int is used as the index into the Btree.  Since the hashval
 * of a filename may not be unique, we may have duplicate keys.  The
 * internal links in the Btree are logical block offsets into the file.
 */

/*========================================================================
 * Directory Structure when equal to XFS_LBSIZE(mp) bytes.
 *========================================================================*/

/*
 * This is the structure of the leaf nodes in the Btree.
 *
 * Struct leaf_entry's are packed from the top.  Names grow from the bottom
 * but are not packed.  The freemap contains run-length-encoded entries
 * for the free bytes after the leaf_entry's, but only the N largest such,
 * smaller runs are dropped.  When the freemap doesn't show enough space
 * for an allocation, we compact the namelist area and try again.  If we
 * still don't have enough space, then we have to split the block.
 *
 * Since we have duplicate hash keys, for each key that matches, compare
 * the actual string.  The root and intermediate node search always takes
 * the first-in-the-block key match found, so we should only have to work
 * "forw"ard.  If none matches, continue with the "forw"ard leaf nodes
 * until the hash key changes or the filename is found.
 *
 * The parent directory and the self-pointer are explicitly represented
 * (ie: there are entries for "." and "..").
 *
 * Note that the count being a __uint16_t limits us to something like a 
 * blocksize of 1.3MB in the face of worst case (short) filenames.
 */
#define XFS_DIR_LEAF_MAPSIZE	3	/* how many freespace slots */

typedef struct xfs_dir_leafblock {
	struct xfs_dir_leaf_hdr {	/* constant-structure header block */
		xfs_da_blkinfo_t info;	/* block type, links, etc. */
		__uint16_t count;	/* count of active leaf_entry's */
		__uint16_t namebytes;	/* num bytes of name strings stored */
		__uint16_t firstused;	/* first used byte in name area */
		__uint8_t  holes;	/* != 0 if blk needs compaction */
		__uint8_t  pad1;
		struct xfs_dir_leaf_map {/* RLE map of free bytes */
			__uint16_t base; /* base of free region */
			__uint16_t size; /* run length of free region */
		} freemap[XFS_DIR_LEAF_MAPSIZE]; /* N largest free regions */
	} hdr;
	struct xfs_dir_leaf_entry {	/* sorted on key, not name */
		__uint32_t hashval;	/* hash value of name */
		__uint16_t nameidx;	/* index into buffer of name */
		__uint8_t namelen;	/* length of name string */
		__uint8_t pad2;
	} entries[1];			/* var sized array */
	struct xfs_dir_leaf_name {
		xfs_dir_ino_t inumber;	/* inode number for this key */
		__uint8_t name[1];	/* name string itself */
	} namelist[1];			/* grows from bottom of buf */
} xfs_dir_leafblock_t;
typedef struct xfs_dir_leaf_hdr xfs_dir_leaf_hdr_t;
typedef struct xfs_dir_leaf_map xfs_dir_leaf_map_t;
typedef struct xfs_dir_leaf_entry xfs_dir_leaf_entry_t;
typedef struct xfs_dir_leaf_name xfs_dir_leaf_name_t;

#define XFS_DIR_LEAF_ENTSIZE_BYNAME(LEN)	/* space a name will use */ \
	(sizeof(xfs_dir_leaf_name_t)-1 + LEN)
#define XFS_DIR_LEAF_ENTSIZE_BYENTRY(ENTRY)	/* space an entry will use */ \
	(sizeof(xfs_dir_leaf_name_t)-1 + (ENTRY)->namelen)
#define XFS_DIR_LEAF_NAMESTRUCT(LEAFP, OFFSET)	/* point to name struct */ \
	((xfs_dir_leaf_name_t *)&((char *)(LEAFP))[OFFSET])

/*========================================================================
 * Function prototypes for the kernel.
 *========================================================================*/

struct buf;
struct dirent;
struct uio;
struct xfs_bmap_free;
struct xfs_da_name;
struct xfs_da_state;
struct xfs_da_state_blk;
struct xfs_inode;
struct xfs_mount;
struct xfs_trans;

/*
 * Internal routines when dirsize < XFS_LITINO(mp).
 */
int xfs_dir_shortform_create(struct xfs_trans *trans, struct xfs_inode *dp,
					 xfs_ino_t parent_inumber);
int xfs_dir_shortform_addname(struct xfs_trans *trans, struct xfs_da_name *add);
int xfs_dir_shortform_lookup(struct xfs_trans *trans, struct xfs_da_name *args);
int xfs_dir_shortform_to_leaf(struct xfs_trans *trans,
				struct xfs_da_name *args);
#ifndef SIM
int xfs_dir_shortform_removename(struct xfs_trans *trans,
					struct xfs_da_name *remove);
void xfs_dir_shortform_print(struct xfs_trans *trans, struct xfs_inode *dp);
int xfs_dir_shortform_getdents(struct xfs_trans *trans, struct xfs_inode *dp,
					   struct uio *uio, int *eofp,
					   struct dirent *dbp);
int xfs_dir_shortform_replace(struct xfs_trans *trans,
					struct xfs_da_name *args);
#endif	/* !SIM */

/*
 * Internal routines when dirsize == XFS_LBSIZE(mp).
 */
int xfs_dir_leaf_to_node(struct xfs_trans *trans, struct xfs_da_name *args);
#ifndef SIM
int xfs_dir_leaf_to_shortform(struct xfs_trans *trans,
					struct xfs_da_name *args);
#endif	/* !SIM */

/*
 * Routines used for growing the Btree.
 */
int	xfs_dir_leaf_create(struct xfs_trans *trans, struct xfs_inode *dp,
					xfs_fileoff_t which_block,
					struct buf **bpp);
int	xfs_dir_leaf_split(struct xfs_da_state *state,
					  struct xfs_da_state_blk *oldblk,
					  struct xfs_da_state_blk *newblk);
int	xfs_dir_leaf_add(struct xfs_trans *trans, struct buf *leaf_buffer,
				     struct xfs_da_name *args,
				     int insertion_index);
int	xfs_dir_leaf_addname(struct xfs_trans *trans, struct xfs_da_name *args);
int	xfs_dir_leaf_lookup_int(struct buf *leaf_buffer, struct xfs_da_name *args,
				      int *index_found_at);
#ifndef SIM
int	xfs_dir_leaf_remove(struct xfs_trans *trans, struct buf *leaf_buffer,
					int index_to_remove);
int	xfs_dir_leaf_getdents_int(struct buf *bp, struct xfs_inode *dp,
					struct uio *uio,
					int *eobp, struct dirent *dbp);
void	xfs_dir_leaf_print_int(struct buf *leaf_buffer,
					struct xfs_inode *dir_inode);
/*
 * Routines used for shrinking the Btree.
 */
int	xfs_dir_leaf_toosmall(struct xfs_da_state *state, int *retval);
void	xfs_dir_leaf_unbalance(struct xfs_da_state *state,
					     struct xfs_da_state_blk *drop_blk,
					     struct xfs_da_state_blk *save_blk);
#endif	/* !SIM */

/*
 * Utility routines.
 */
uint	xfs_dir_leaf_lasthash(struct buf *bp, int *count);
int	xfs_dir_leaf_order(struct buf *leaf1_bp, struct buf *leaf2_bp);
int	xfs_dir_put_dirent(struct xfs_mount *mp, struct dirent *dbp,
				xfs_ino_t ino, char *name, int namelen,
				off_t doff, struct uio *uio, int *done);

#endif	/* !FS_XFS_DIR_BTREE_H */