[net-next-2.6.git] / fs / reiserfs / dir.c

/*
 * Copyright 2000 by Hans Reiser, licensing governed by reiserfs/README
 */

#include <linux/string.h>
#include <linux/errno.h>
#include <linux/fs.h>
#include <linux/reiserfs_fs.h>
#include <linux/stat.h>
#include <linux/buffer_head.h>
#include <linux/slab.h>
#include <asm/uaccess.h>

extern const struct reiserfs_key MIN_KEY;

static int reiserfs_readdir(struct file *, void *, filldir_t);
static int reiserfs_dir_fsync(struct file *filp, int datasync);

const struct file_operations reiserfs_dir_operations = {
	.llseek = generic_file_llseek,
	.read = generic_read_dir,
	.readdir = reiserfs_readdir,
	.fsync = reiserfs_dir_fsync,
	.unlocked_ioctl = reiserfs_ioctl,
#ifdef CONFIG_COMPAT
	.compat_ioctl = reiserfs_compat_ioctl,
#endif
};

static int reiserfs_dir_fsync(struct file *filp, int datasync)
{
	struct inode *inode = filp->f_mapping->host;
	int err;
	reiserfs_write_lock(inode->i_sb);
	err = reiserfs_commit_for_inode(inode);
	reiserfs_write_unlock(inode->i_sb);
	if (err < 0)
		return err;
	return 0;
}

#define store_ih(where,what) copy_item_head (where, what)

static inline bool is_privroot_deh(struct dentry *dir,
				   struct reiserfs_de_head *deh)
{
	struct dentry *privroot = REISERFS_SB(dir->d_sb)->priv_root;
	return (dir == dir->d_parent && privroot->d_inode &&
	        deh->deh_objectid == INODE_PKEY(privroot->d_inode)->k_objectid);
}

int reiserfs_readdir_dentry(struct dentry *dentry, void *dirent,
			   filldir_t filldir, loff_t *pos)
{
	struct inode *inode = dentry->d_inode;
	struct cpu_key pos_key;	/* key of current position in the directory (key of directory entry) */
	INITIALIZE_PATH(path_to_entry);
	struct buffer_head *bh;
	int item_num, entry_num;
	const struct reiserfs_key *rkey;
	struct item_head *ih, tmp_ih;
	int search_res;
	char *local_buf;
	loff_t next_pos;
	char small_buf[32];	/* avoid kmalloc if we can */
	struct reiserfs_dir_entry de;
	int ret = 0;

	reiserfs_write_lock(inode->i_sb);

	reiserfs_check_lock_depth(inode->i_sb, "readdir");

	/* form key for search the next directory entry using f_pos field of
	   file structure */
	make_cpu_key(&pos_key, inode, *pos ?: DOT_OFFSET, TYPE_DIRENTRY, 3);
	next_pos = cpu_key_k_offset(&pos_key);

	path_to_entry.reada = PATH_READA;
	while (1) {
	      research:
		/* search the directory item, containing entry with specified key */
		search_res =
		    search_by_entry_key(inode->i_sb, &pos_key, &path_to_entry,
					&de);
		if (search_res == IO_ERROR) {
			// FIXME: we could just skip part of directory which could
			// not be read
			ret = -EIO;
			goto out;
		}
		entry_num = de.de_entry_num;
		bh = de.de_bh;
		item_num = de.de_item_num;
		ih = de.de_ih;
		store_ih(&tmp_ih, ih);

		/* we must have found item, that is item of this directory, */
		RFALSE(COMP_SHORT_KEYS(&(ih->ih_key), &pos_key),
		       "vs-9000: found item %h does not match to dir we readdir %K",
		       ih, &pos_key);
		RFALSE(item_num > B_NR_ITEMS(bh) - 1,
		       "vs-9005 item_num == %d, item amount == %d",
		       item_num, B_NR_ITEMS(bh));

		/* and entry must be not more than number of entries in the item */
		RFALSE(I_ENTRY_COUNT(ih) < entry_num,
		       "vs-9010: entry number is too big %d (%d)",
		       entry_num, I_ENTRY_COUNT(ih));

		if (search_res == POSITION_FOUND
		    || entry_num < I_ENTRY_COUNT(ih)) {
			/* go through all entries in the directory item beginning from the entry, that has been found */
			struct reiserfs_de_head *deh =
			    B_I_DEH(bh, ih) + entry_num;

			for (; entry_num < I_ENTRY_COUNT(ih);
			     entry_num++, deh++) {
				int d_reclen;
				char *d_name;
				off_t d_off;
				ino_t d_ino;

				if (!de_visible(deh))
					/* it is hidden entry */
					continue;
				d_reclen = entry_length(bh, ih, entry_num);
				d_name = B_I_DEH_ENTRY_FILE_NAME(bh, ih, deh);

				if (d_reclen <= 0 ||
				    d_name + d_reclen > bh->b_data + bh->b_size) {
					/* There is corrupted data in entry,
					 * We'd better stop here */
					pathrelse(&path_to_entry);
					ret = -EIO;
					goto out;
				}

				if (!d_name[d_reclen - 1])
					d_reclen = strlen(d_name);

				if (d_reclen >
				    REISERFS_MAX_NAME(inode->i_sb->
						      s_blocksize)) {
					/* too big to send back to VFS */
					continue;
				}

				/* Ignore the .reiserfs_priv entry */
				if (is_privroot_deh(dentry, deh))
					continue;

				d_off = deh_offset(deh);
				*pos = d_off;
				d_ino = deh_objectid(deh);
				if (d_reclen <= 32) {
					local_buf = small_buf;
				} else {
					local_buf = kmalloc(d_reclen,
							    GFP_NOFS);
					if (!local_buf) {
						pathrelse(&path_to_entry);
						ret = -ENOMEM;
						goto out;
					}
					if (item_moved(&tmp_ih, &path_to_entry)) {
						kfree(local_buf);
						goto research;
					}
				}
				// Note, that we copy name to user space via temporary
				// buffer (local_buf) because filldir will block if
				// user space buffer is swapped out. At that time
				// entry can move to somewhere else
				memcpy(local_buf, d_name, d_reclen);

				/*
				 * Since filldir might sleep, we can release
				 * the write lock here for other waiters
				 */
				reiserfs_write_unlock(inode->i_sb);
				if (filldir
				    (dirent, local_buf, d_reclen, d_off, d_ino,
				     DT_UNKNOWN) < 0) {
					reiserfs_write_lock(inode->i_sb);
					if (local_buf != small_buf) {
						kfree(local_buf);
					}
					goto end;
				}
				reiserfs_write_lock(inode->i_sb);
				if (local_buf != small_buf) {
					kfree(local_buf);
				}
				// next entry should be looked for with such offset
				next_pos = deh_offset(deh) + 1;

				if (item_moved(&tmp_ih, &path_to_entry)) {
					goto research;
				}
			}	/* for */
		}

		if (item_num != B_NR_ITEMS(bh) - 1)
			// end of directory has been reached
			goto end;

		/* item we went through is last item of node. Using right
		   delimiting key check is it directory end */
		rkey = get_rkey(&path_to_entry, inode->i_sb);
		if (!comp_le_keys(rkey, &MIN_KEY)) {
			/* set pos_key to key, that is the smallest and greater
			   that key of the last entry in the item */
			set_cpu_key_k_offset(&pos_key, next_pos);
			continue;
		}

		if (COMP_SHORT_KEYS(rkey, &pos_key)) {
			// end of directory has been reached
			goto end;
		}

		/* directory continues in the right neighboring block */
		set_cpu_key_k_offset(&pos_key,
				     le_key_k_offset(KEY_FORMAT_3_5, rkey));

	}			/* while */

end:
	*pos = next_pos;
	pathrelse(&path_to_entry);
	reiserfs_check_path(&path_to_entry);
out:
	reiserfs_write_unlock(inode->i_sb);
	return ret;
}

static int reiserfs_readdir(struct file *file, void *dirent, filldir_t filldir)
{
	struct dentry *dentry = file->f_path.dentry;
	return reiserfs_readdir_dentry(dentry, dirent, filldir, &file->f_pos);
}

/* compose directory item containing "." and ".." entries (entries are
   not aligned to 4 byte boundary) */
/* the last four params are LE */
void make_empty_dir_item_v1(char *body, __le32 dirid, __le32 objid,
			    __le32 par_dirid, __le32 par_objid)
{
	struct reiserfs_de_head *deh;

	memset(body, 0, EMPTY_DIR_SIZE_V1);
	deh = (struct reiserfs_de_head *)body;

	/* direntry header of "." */
	put_deh_offset(&(deh[0]), DOT_OFFSET);
	/* these two are from make_le_item_head, and are are LE */
	deh[0].deh_dir_id = dirid;
	deh[0].deh_objectid = objid;
	deh[0].deh_state = 0;	/* Endian safe if 0 */
	put_deh_location(&(deh[0]), EMPTY_DIR_SIZE_V1 - strlen("."));
	mark_de_visible(&(deh[0]));

	/* direntry header of ".." */
	put_deh_offset(&(deh[1]), DOT_DOT_OFFSET);
	/* key of ".." for the root directory */
	/* these two are from the inode, and are are LE */
	deh[1].deh_dir_id = par_dirid;
	deh[1].deh_objectid = par_objid;
	deh[1].deh_state = 0;	/* Endian safe if 0 */
	put_deh_location(&(deh[1]), deh_location(&(deh[0])) - strlen(".."));
	mark_de_visible(&(deh[1]));

	/* copy ".." and "." */
	memcpy(body + deh_location(&(deh[0])), ".", 1);
	memcpy(body + deh_location(&(deh[1])), "..", 2);
}

/* compose directory item containing "." and ".." entries */
void make_empty_dir_item(char *body, __le32 dirid, __le32 objid,
			 __le32 par_dirid, __le32 par_objid)
{
	struct reiserfs_de_head *deh;

	memset(body, 0, EMPTY_DIR_SIZE);
	deh = (struct reiserfs_de_head *)body;

	/* direntry header of "." */
	put_deh_offset(&(deh[0]), DOT_OFFSET);
	/* these two are from make_le_item_head, and are are LE */
	deh[0].deh_dir_id = dirid;
	deh[0].deh_objectid = objid;
	deh[0].deh_state = 0;	/* Endian safe if 0 */
	put_deh_location(&(deh[0]), EMPTY_DIR_SIZE - ROUND_UP(strlen(".")));
	mark_de_visible(&(deh[0]));

	/* direntry header of ".." */
	put_deh_offset(&(deh[1]), DOT_DOT_OFFSET);
	/* key of ".." for the root directory */
	/* these two are from the inode, and are are LE */
	deh[1].deh_dir_id = par_dirid;
	deh[1].deh_objectid = par_objid;
	deh[1].deh_state = 0;	/* Endian safe if 0 */
	put_deh_location(&(deh[1]),
			 deh_location(&(deh[0])) - ROUND_UP(strlen("..")));
	mark_de_visible(&(deh[1]));

	/* copy ".." and "." */
	memcpy(body + deh_location(&(deh[0])), ".", 1);
	memcpy(body + deh_location(&(deh[1])), "..", 2);
}
Commit	Line	Data
1da177e4 LT	1	/*
	2	* Copyright 2000 by Hans Reiser, licensing governed by reiserfs/README
	3	*/
	4
1da177e4 LT	5	#include <linux/string.h>
	6	#include <linux/errno.h>
	7	#include <linux/fs.h>
	8	#include <linux/reiserfs_fs.h>
	9	#include <linux/stat.h>
1da177e4	10	#include <linux/buffer_head.h>
5a0e3ad6	11	#include <linux/slab.h>
1da177e4 LT	12	#include <asm/uaccess.h>
1da177e4 LT	13
5a1b6391	14	extern const struct reiserfs_key MIN_KEY;
1da177e4	15
bd4c625c	16	static int reiserfs_readdir(struct file , void , filldir_t);
7ea80859	17	static int reiserfs_dir_fsync(struct file *filp, int datasync);
1da177e4	18
4b6f5d20	19	const struct file_operations reiserfs_dir_operations = {
ca572727	20	.llseek = generic_file_llseek,
bd4c625c LT	21	.read = generic_read_dir,
	22	.readdir = reiserfs_readdir,
	23	.fsync = reiserfs_dir_fsync,
205cb37b	24	.unlocked_ioctl = reiserfs_ioctl,
52b499c4 DH	25	#ifdef CONFIG_COMPAT
	26	.compat_ioctl = reiserfs_compat_ioctl,
	27	#endif
1da177e4 LT	28	};
1da177e4 LT	29
7ea80859	30	static int reiserfs_dir_fsync(struct file *filp, int datasync)
bd4c625c	31	{
7ea80859	32	struct inode *inode = filp->f_mapping->host;
bd4c625c LT	33	int err;
	34	reiserfs_write_lock(inode->i_sb);
	35	err = reiserfs_commit_for_inode(inode);
	36	reiserfs_write_unlock(inode->i_sb);
	37	if (err < 0)
	38	return err;
	39	return 0;
1da177e4 LT	40	}
1da177e4 LT	41
1da177e4 LT	42	#define store_ih(where,what) copy_item_head (where, what)
1da177e4 LT	43
677c9b2e JM	44	static inline bool is_privroot_deh(struct dentry *dir,
	45	struct reiserfs_de_head *deh)
	46	{
677c9b2e	47	struct dentry *privroot = REISERFS_SB(dir->d_sb)->priv_root;
73422811 JM	48	return (dir == dir->d_parent && privroot->d_inode &&
73422811 JM	49	deh->deh_objectid == INODE_PKEY(privroot->d_inode)->k_objectid);
677c9b2e JM	50	}
677c9b2e JM	51
a41f1a47 JM	52	int reiserfs_readdir_dentry(struct dentry dentry, void dirent,
a41f1a47 JM	53	filldir_t filldir, loff_t *pos)
1da177e4	54	{
a41f1a47	55	struct inode *inode = dentry->d_inode;
bd4c625c LT	56	struct cpu_key pos_key; /* key of current position in the directory (key of directory entry) */
	57	INITIALIZE_PATH(path_to_entry);
	58	struct buffer_head *bh;
	59	int item_num, entry_num;
	60	const struct reiserfs_key *rkey;
	61	struct item_head *ih, tmp_ih;
	62	int search_res;
	63	char *local_buf;
	64	loff_t next_pos;
	65	char small_buf[32]; /* avoid kmalloc if we can */
	66	struct reiserfs_dir_entry de;
	67	int ret = 0;
	68
	69	reiserfs_write_lock(inode->i_sb);
	70
	71	reiserfs_check_lock_depth(inode->i_sb, "readdir");
	72
	73	/* form key for search the next directory entry using f_pos field of
	74	file structure */
a41f1a47	75	make_cpu_key(&pos_key, inode, *pos ?: DOT_OFFSET, TYPE_DIRENTRY, 3);
bd4c625c LT	76	next_pos = cpu_key_k_offset(&pos_key);
bd4c625c LT	77
bd4c625c LT	78	path_to_entry.reada = PATH_READA;
	79	while (1) {
	80	research:
	81	/* search the directory item, containing entry with specified key */
	82	search_res =
	83	search_by_entry_key(inode->i_sb, &pos_key, &path_to_entry,
	84	&de);
	85	if (search_res == IO_ERROR) {
	86	// FIXME: we could just skip part of directory which could
	87	// not be read
	88	ret = -EIO;
1da177e4	89	goto out;
1da177e4	90	}
bd4c625c LT	91	entry_num = de.de_entry_num;
	92	bh = de.de_bh;
	93	item_num = de.de_item_num;
	94	ih = de.de_ih;
	95	store_ih(&tmp_ih, ih);
	96
	97	/* we must have found item, that is item of this directory, */
	98	RFALSE(COMP_SHORT_KEYS(&(ih->ih_key), &pos_key),
	99	"vs-9000: found item %h does not match to dir we readdir %K",
	100	ih, &pos_key);
	101	RFALSE(item_num > B_NR_ITEMS(bh) - 1,
	102	"vs-9005 item_num == %d, item amount == %d",
	103	item_num, B_NR_ITEMS(bh));
	104
	105	/* and entry must be not more than number of entries in the item */
	106	RFALSE(I_ENTRY_COUNT(ih) < entry_num,
	107	"vs-9010: entry number is too big %d (%d)",
	108	entry_num, I_ENTRY_COUNT(ih));
	109
	110	if (search_res == POSITION_FOUND
	111	\|\| entry_num < I_ENTRY_COUNT(ih)) {
	112	/* go through all entries in the directory item beginning from the entry, that has been found */
	113	struct reiserfs_de_head *deh =
	114	B_I_DEH(bh, ih) + entry_num;
	115
	116	for (; entry_num < I_ENTRY_COUNT(ih);
	117	entry_num++, deh++) {
	118	int d_reclen;
	119	char *d_name;
	120	off_t d_off;
	121	ino_t d_ino;
	122
	123	if (!de_visible(deh))
	124	/* it is hidden entry */
	125	continue;
	126	d_reclen = entry_length(bh, ih, entry_num);
	127	d_name = B_I_DEH_ENTRY_FILE_NAME(bh, ih, deh);
80eb68d2 LW	128
	129	if (d_reclen <= 0 \|\|
	130	d_name + d_reclen > bh->b_data + bh->b_size) {
	131	/* There is corrupted data in entry,
	132	* We'd better stop here */
	133	pathrelse(&path_to_entry);
	134	ret = -EIO;
	135	goto out;
	136	}
	137
bd4c625c LT	138	if (!d_name[d_reclen - 1])
	139	d_reclen = strlen(d_name);
	140
	141	if (d_reclen >
	142	REISERFS_MAX_NAME(inode->i_sb->
	143	s_blocksize)) {
	144	/* too big to send back to VFS */
	145	continue;
	146	}
	147
	148	/* Ignore the .reiserfs_priv entry */
677c9b2e	149	if (is_privroot_deh(dentry, deh))
bd4c625c	150	continue;
bd4c625c LT	151
bd4c625c LT	152	d_off = deh_offset(deh);
a41f1a47	153	*pos = d_off;
bd4c625c LT	154	d_ino = deh_objectid(deh);
	155	if (d_reclen <= 32) {
	156	local_buf = small_buf;
	157	} else {
d739b42b PE	158	local_buf = kmalloc(d_reclen,
d739b42b PE	159	GFP_NOFS);
bd4c625c LT	160	if (!local_buf) {
	161	pathrelse(&path_to_entry);
	162	ret = -ENOMEM;
	163	goto out;
	164	}
	165	if (item_moved(&tmp_ih, &path_to_entry)) {
d739b42b	166	kfree(local_buf);
bd4c625c LT	167	goto research;
	168	}
	169	}
	170	// Note, that we copy name to user space via temporary
	171	// buffer (local_buf) because filldir will block if
	172	// user space buffer is swapped out. At that time
	173	// entry can move to somewhere else
	174	memcpy(local_buf, d_name, d_reclen);
8ebc4232 FW	175
	176	/*
	177	* Since filldir might sleep, we can release
	178	* the write lock here for other waiters
	179	*/
	180	reiserfs_write_unlock(inode->i_sb);
bd4c625c LT	181	if (filldir
	182	(dirent, local_buf, d_reclen, d_off, d_ino,
	183	DT_UNKNOWN) < 0) {
8ebc4232	184	reiserfs_write_lock(inode->i_sb);
bd4c625c	185	if (local_buf != small_buf) {
d739b42b	186	kfree(local_buf);
bd4c625c LT	187	}
	188	goto end;
	189	}
8ebc4232	190	reiserfs_write_lock(inode->i_sb);
bd4c625c	191	if (local_buf != small_buf) {
d739b42b	192	kfree(local_buf);
bd4c625c LT	193	}
	194	// next entry should be looked for with such offset
	195	next_pos = deh_offset(deh) + 1;
	196
	197	if (item_moved(&tmp_ih, &path_to_entry)) {
	198	goto research;
	199	}
	200	} /* for */
1da177e4 LT	201	}
1da177e4 LT	202
bd4c625c LT	203	if (item_num != B_NR_ITEMS(bh) - 1)
	204	// end of directory has been reached
	205	goto end;
	206
	207	/* item we went through is last item of node. Using right
	208	delimiting key check is it directory end */
	209	rkey = get_rkey(&path_to_entry, inode->i_sb);
	210	if (!comp_le_keys(rkey, &MIN_KEY)) {
	211	/* set pos_key to key, that is the smallest and greater
	212	that key of the last entry in the item */
	213	set_cpu_key_k_offset(&pos_key, next_pos);
	214	continue;
	215	}
1da177e4	216
bd4c625c LT	217	if (COMP_SHORT_KEYS(rkey, &pos_key)) {
	218	// end of directory has been reached
	219	goto end;
1da177e4	220	}
bd4c625c LT	221
	222	/* directory continues in the right neighboring block */
	223	set_cpu_key_k_offset(&pos_key,
	224	le_key_k_offset(KEY_FORMAT_3_5, rkey));
	225
	226	} /* while */
	227
a41f1a47 JM	228	end:
a41f1a47 JM	229	*pos = next_pos;
bd4c625c LT	230	pathrelse(&path_to_entry);
bd4c625c LT	231	reiserfs_check_path(&path_to_entry);
a41f1a47	232	out:
bd4c625c LT	233	reiserfs_write_unlock(inode->i_sb);
bd4c625c LT	234	return ret;
1da177e4 LT	235	}
1da177e4 LT	236
a41f1a47 JM	237	static int reiserfs_readdir(struct file file, void dirent, filldir_t filldir)
	238	{
	239	struct dentry *dentry = file->f_path.dentry;
	240	return reiserfs_readdir_dentry(dentry, dirent, filldir, &file->f_pos);
	241	}
	242
1da177e4 LT	243	/* compose directory item containing "." and ".." entries (entries are
	244	not aligned to 4 byte boundary) */
	245	/* the last four params are LE */
bd4c625c LT	246	void make_empty_dir_item_v1(char *body, __le32 dirid, __le32 objid,
bd4c625c LT	247	__le32 par_dirid, __le32 par_objid)
1da177e4	248	{
bd4c625c LT	249	struct reiserfs_de_head *deh;
	250
	251	memset(body, 0, EMPTY_DIR_SIZE_V1);
	252	deh = (struct reiserfs_de_head *)body;
	253
	254	/* direntry header of "." */
	255	put_deh_offset(&(deh[0]), DOT_OFFSET);
	256	/* these two are from make_le_item_head, and are are LE */
	257	deh[0].deh_dir_id = dirid;
	258	deh[0].deh_objectid = objid;
	259	deh[0].deh_state = 0; /* Endian safe if 0 */
	260	put_deh_location(&(deh[0]), EMPTY_DIR_SIZE_V1 - strlen("."));
	261	mark_de_visible(&(deh[0]));
	262
	263	/* direntry header of ".." */
	264	put_deh_offset(&(deh[1]), DOT_DOT_OFFSET);
	265	/* key of ".." for the root directory */
	266	/* these two are from the inode, and are are LE */
	267	deh[1].deh_dir_id = par_dirid;
	268	deh[1].deh_objectid = par_objid;
	269	deh[1].deh_state = 0; /* Endian safe if 0 */
	270	put_deh_location(&(deh[1]), deh_location(&(deh[0])) - strlen(".."));
	271	mark_de_visible(&(deh[1]));
	272
	273	/* copy ".." and "." */
	274	memcpy(body + deh_location(&(deh[0])), ".", 1);
	275	memcpy(body + deh_location(&(deh[1])), "..", 2);
1da177e4 LT	276	}
	277
	278	/* compose directory item containing "." and ".." entries */
bd4c625c LT	279	void make_empty_dir_item(char *body, __le32 dirid, __le32 objid,
bd4c625c LT	280	__le32 par_dirid, __le32 par_objid)
1da177e4	281	{
bd4c625c LT	282	struct reiserfs_de_head *deh;
	283
	284	memset(body, 0, EMPTY_DIR_SIZE);
	285	deh = (struct reiserfs_de_head *)body;
	286
	287	/* direntry header of "." */
	288	put_deh_offset(&(deh[0]), DOT_OFFSET);
	289	/* these two are from make_le_item_head, and are are LE */
	290	deh[0].deh_dir_id = dirid;
	291	deh[0].deh_objectid = objid;
	292	deh[0].deh_state = 0; /* Endian safe if 0 */
	293	put_deh_location(&(deh[0]), EMPTY_DIR_SIZE - ROUND_UP(strlen(".")));
	294	mark_de_visible(&(deh[0]));
	295
	296	/* direntry header of ".." */
	297	put_deh_offset(&(deh[1]), DOT_DOT_OFFSET);
	298	/* key of ".." for the root directory */
	299	/* these two are from the inode, and are are LE */
	300	deh[1].deh_dir_id = par_dirid;
	301	deh[1].deh_objectid = par_objid;
	302	deh[1].deh_state = 0; /* Endian safe if 0 */
	303	put_deh_location(&(deh[1]),
	304	deh_location(&(deh[0])) - ROUND_UP(strlen("..")));
	305	mark_de_visible(&(deh[1]));
	306
	307	/* copy ".." and "." */
	308	memcpy(body + deh_location(&(deh[0])), ".", 1);
	309	memcpy(body + deh_location(&(deh[1])), "..", 2);
1da177e4	310	}