[deliverable/linux.git] / fs / autofs / dirhash.c

/* -*- linux-c -*- --------------------------------------------------------- *
 *
 * linux/fs/autofs/dirhash.c
 *
 *  Copyright 1997-1998 Transmeta Corporation -- All Rights Reserved
 *
 * This file is part of the Linux kernel and is made available under
 * the terms of the GNU General Public License, version 2, or at your
 * option, any later version, incorporated herein by reference.
 *
 * ------------------------------------------------------------------------- */

#include "autofs_i.h"

/* Functions for maintenance of expiry queue */

static void autofs_init_usage(struct autofs_dirhash *dh,
			      struct autofs_dir_ent *ent)
{
	list_add_tail(&ent->exp, &dh->expiry_head);
	ent->last_usage = jiffies;
}

static void autofs_delete_usage(struct autofs_dir_ent *ent)
{
	list_del(&ent->exp);
}

void autofs_update_usage(struct autofs_dirhash *dh,
			 struct autofs_dir_ent *ent)
{
	autofs_delete_usage(ent);   /* Unlink from current position */
	autofs_init_usage(dh,ent);  /* Relink at queue tail */
}

struct autofs_dir_ent *autofs_expire(struct super_block *sb,
				     struct autofs_sb_info *sbi,
				     struct vfsmount *mnt)
{
	struct autofs_dirhash *dh = &sbi->dirhash;
	struct autofs_dir_ent *ent;
	unsigned long timeout = sbi->exp_timeout;

	while (1) {
		struct path path;
		int umount_ok;

		if ( list_empty(&dh->expiry_head) || sbi->catatonic )
			return NULL;	/* No entries */
		/* We keep the list sorted by last_usage and want old stuff */
		ent = list_entry(dh->expiry_head.next, struct autofs_dir_ent, exp);
		if (jiffies - ent->last_usage < timeout)
			break;
		/* Move to end of list in case expiry isn't desirable */
		autofs_update_usage(dh, ent);

		/* Check to see that entry is expirable */
		if ( ent->ino < AUTOFS_FIRST_DIR_INO )
			return ent; /* Symlinks are always expirable */

		/* Get the dentry for the autofs subdirectory */
		path.dentry = ent->dentry;

		if (!path.dentry) {
			/* Should only happen in catatonic mode */
			printk("autofs: dentry == NULL but inode range is directory, entry %s\n", ent->name);
			autofs_delete_usage(ent);
			continue;
		}

		if (!path.dentry->d_inode) {
			dput(path.dentry);
			printk("autofs: negative dentry on expiry queue: %s\n",
			       ent->name);
			autofs_delete_usage(ent);
			continue;
		}

		/* Make sure entry is mounted and unused; note that dentry will
		   point to the mounted-on-top root. */
		if (!S_ISDIR(path.dentry->d_inode->i_mode) ||
		    !d_mountpoint(path.dentry)) {
			DPRINTK(("autofs: not expirable (not a mounted directory): %s\n", ent->name));
			continue;
		}
		path.mnt = mnt;
		path_get(&path);
		if (!follow_down(&path.mnt, &path.dentry)) {
			path_put(&path);
			DPRINTK(("autofs: not expirable (not a mounted directory): %s\n", ent->name));
			continue;
		}
		while (d_mountpoint(path.dentry) &&
		       follow_down(&path.mnt, &path.dentry))
			;
		umount_ok = may_umount(path.mnt);
		path_put(&path);

		if (umount_ok) {
			DPRINTK(("autofs: signaling expire on %s\n", ent->name));
			return ent; /* Expirable! */
		}
		DPRINTK(("autofs: didn't expire due to may_umount: %s\n", ent->name));
	}
	return NULL;		/* No expirable entries */
}

void autofs_initialize_hash(struct autofs_dirhash *dh) {
	memset(&dh->h, 0, AUTOFS_HASH_SIZE*sizeof(struct autofs_dir_ent *));
	INIT_LIST_HEAD(&dh->expiry_head);
}

struct autofs_dir_ent *autofs_hash_lookup(const struct autofs_dirhash *dh, struct qstr *name)
{
	struct autofs_dir_ent *dhn;

	DPRINTK(("autofs_hash_lookup: hash = 0x%08x, name = ", name->hash));
	autofs_say(name->name,name->len);

	for ( dhn = dh->h[(unsigned) name->hash % AUTOFS_HASH_SIZE] ; dhn ; dhn = dhn->next ) {
		if ( name->hash == dhn->hash &&
		     name->len == dhn->len &&
		     !memcmp(name->name, dhn->name, name->len) )
			break;
	}

	return dhn;
}

void autofs_hash_insert(struct autofs_dirhash *dh, struct autofs_dir_ent *ent)
{
	struct autofs_dir_ent **dhnp;

	DPRINTK(("autofs_hash_insert: hash = 0x%08x, name = ", ent->hash));
	autofs_say(ent->name,ent->len);

	autofs_init_usage(dh,ent);
	if (ent->dentry)
		dget(ent->dentry);

	dhnp = &dh->h[(unsigned) ent->hash % AUTOFS_HASH_SIZE];
	ent->next = *dhnp;
	ent->back = dhnp;
	*dhnp = ent;
	if ( ent->next )
		ent->next->back = &(ent->next);
}

void autofs_hash_delete(struct autofs_dir_ent *ent)
{
	*(ent->back) = ent->next;
	if ( ent->next )
		ent->next->back = ent->back;

	autofs_delete_usage(ent);

	if ( ent->dentry )
		dput(ent->dentry);
	kfree(ent->name);
	kfree(ent);
}

/*
 * Used by readdir().  We must validate "ptr", so we can't simply make it
 * a pointer.  Values below 0xffff are reserved; calling with any value
 * <= 0x10000 will return the first entry found.
 *
 * "last" can be NULL or the value returned by the last search *if* we
 * want the next sequential entry.
 */
struct autofs_dir_ent *autofs_hash_enum(const struct autofs_dirhash *dh,
					off_t *ptr, struct autofs_dir_ent *last)
{
	int bucket, ecount, i;
	struct autofs_dir_ent *ent;

	bucket = (*ptr >> 16) - 1;
	ecount = *ptr & 0xffff;

	if ( bucket < 0 ) {
		bucket = ecount = 0;
	} 

	DPRINTK(("autofs_hash_enum: bucket %d, entry %d\n", bucket, ecount));

	ent = last ? last->next : NULL;

	if ( ent ) {
		ecount++;
	} else {
		while  ( bucket < AUTOFS_HASH_SIZE ) {
			ent = dh->h[bucket];
			for ( i = ecount ; ent && i ; i-- )
				ent = ent->next;
			
			if (ent) {
				ecount++; /* Point to *next* entry */
				break;
			}
			
			bucket++; ecount = 0;
		}
	}

#ifdef DEBUG
	if ( !ent )
		printk("autofs_hash_enum: nothing found\n");
	else {
		printk("autofs_hash_enum: found hash %08x, name", ent->hash);
		autofs_say(ent->name,ent->len);
	}
#endif

	*ptr = ((bucket+1) << 16) + ecount;
	return ent;
}

/* Iterate over all the ents, and remove all dentry pointers.  Used on
   entering catatonic mode, in order to make the filesystem unmountable. */
void autofs_hash_dputall(struct autofs_dirhash *dh)
{
	int i;
	struct autofs_dir_ent *ent;

	for ( i = 0 ; i < AUTOFS_HASH_SIZE ; i++ ) {
		for ( ent = dh->h[i] ; ent ; ent = ent->next ) {
			if ( ent->dentry ) {
				dput(ent->dentry);
				ent->dentry = NULL;
			}
		}
	}
}

/* Delete everything.  This is used on filesystem destruction, so we
   make no attempt to keep the pointers valid */
void autofs_hash_nuke(struct autofs_sb_info *sbi)
{
	int i;
	struct autofs_dir_ent *ent, *nent;

	for ( i = 0 ; i < AUTOFS_HASH_SIZE ; i++ ) {
		for ( ent = sbi->dirhash.h[i] ; ent ; ent = nent ) {
			nent = ent->next;
			if ( ent->dentry )
				dput(ent->dentry);
			kfree(ent->name);
			kfree(ent);
		}
	}
}
Commit	Line	Data
1da177e4 LT	1	/* -- linux-c -- --------------------------------------------------------- *
	2	*
	3	* linux/fs/autofs/dirhash.c
	4	*
	5	* Copyright 1997-1998 Transmeta Corporation -- All Rights Reserved
	6	*
	7	* This file is part of the Linux kernel and is made available under
	8	* the terms of the GNU General Public License, version 2, or at your
	9	* option, any later version, incorporated herein by reference.
	10	*
	11	* ------------------------------------------------------------------------- */
	12
	13	#include "autofs_i.h"
	14
	15	/* Functions for maintenance of expiry queue */
	16
	17	static void autofs_init_usage(struct autofs_dirhash *dh,
	18	struct autofs_dir_ent *ent)
	19	{
	20	list_add_tail(&ent->exp, &dh->expiry_head);
	21	ent->last_usage = jiffies;
	22	}
	23
	24	static void autofs_delete_usage(struct autofs_dir_ent *ent)
	25	{
	26	list_del(&ent->exp);
	27	}
	28
	29	void autofs_update_usage(struct autofs_dirhash *dh,
	30	struct autofs_dir_ent *ent)
	31	{
	32	autofs_delete_usage(ent); /* Unlink from current position */
	33	autofs_init_usage(dh,ent); /* Relink at queue tail */
	34	}
	35
	36	struct autofs_dir_ent autofs_expire(struct super_block sb,
	37	struct autofs_sb_info *sbi,
	38	struct vfsmount *mnt)
	39	{
	40	struct autofs_dirhash *dh = &sbi->dirhash;
	41	struct autofs_dir_ent *ent;
1da177e4 LT	42	unsigned long timeout = sbi->exp_timeout;
	43
	44	while (1) {
117aff74 AV	45	struct path path;
	46	int umount_ok;
	47
1da177e4 LT	48	if ( list_empty(&dh->expiry_head) \|\| sbi->catatonic )
	49	return NULL; /* No entries */
	50	/* We keep the list sorted by last_usage and want old stuff */
	51	ent = list_entry(dh->expiry_head.next, struct autofs_dir_ent, exp);
	52	if (jiffies - ent->last_usage < timeout)
	53	break;
	54	/* Move to end of list in case expiry isn't desirable */
	55	autofs_update_usage(dh, ent);
	56
	57	/* Check to see that entry is expirable */
	58	if ( ent->ino < AUTOFS_FIRST_DIR_INO )
	59	return ent; /* Symlinks are always expirable */
	60
	61	/* Get the dentry for the autofs subdirectory */
117aff74	62	path.dentry = ent->dentry;
1da177e4	63
117aff74	64	if (!path.dentry) {
1da177e4 LT	65	/* Should only happen in catatonic mode */
	66	printk("autofs: dentry == NULL but inode range is directory, entry %s\n", ent->name);
	67	autofs_delete_usage(ent);
	68	continue;
	69	}
	70
117aff74 AV	71	if (!path.dentry->d_inode) {
117aff74 AV	72	dput(path.dentry);
1da177e4 LT	73	printk("autofs: negative dentry on expiry queue: %s\n",
	74	ent->name);
	75	autofs_delete_usage(ent);
	76	continue;
	77	}
	78
	79	/* Make sure entry is mounted and unused; note that dentry will
	80	point to the mounted-on-top root. */
117aff74 AV	81	if (!S_ISDIR(path.dentry->d_inode->i_mode) \|\|
117aff74 AV	82	!d_mountpoint(path.dentry)) {
1da177e4 LT	83	DPRINTK(("autofs: not expirable (not a mounted directory): %s\n", ent->name));
	84	continue;
	85	}
117aff74 AV	86	path.mnt = mnt;
	87	path_get(&path);
	88	if (!follow_down(&path.mnt, &path.dentry)) {
	89	path_put(&path);
1da177e4 LT	90	DPRINTK(("autofs: not expirable (not a mounted directory): %s\n", ent->name));
	91	continue;
	92	}
117aff74 AV	93	while (d_mountpoint(path.dentry) &&
117aff74 AV	94	follow_down(&path.mnt, &path.dentry))
1da177e4	95	;
117aff74 AV	96	umount_ok = may_umount(path.mnt);
117aff74 AV	97	path_put(&path);
1da177e4	98
117aff74	99	if (umount_ok) {
1da177e4 LT	100	DPRINTK(("autofs: signaling expire on %s\n", ent->name));
	101	return ent; /* Expirable! */
	102	}
	103	DPRINTK(("autofs: didn't expire due to may_umount: %s\n", ent->name));
1da177e4 LT	104	}
	105	return NULL; /* No expirable entries */
	106	}
	107
	108	void autofs_initialize_hash(struct autofs_dirhash *dh) {
	109	memset(&dh->h, 0, AUTOFS_HASH_SIZEsizeof(struct autofs_dir_ent ));
	110	INIT_LIST_HEAD(&dh->expiry_head);
	111	}
	112
	113	struct autofs_dir_ent autofs_hash_lookup(const struct autofs_dirhash dh, struct qstr *name)
	114	{
	115	struct autofs_dir_ent *dhn;
	116
	117	DPRINTK(("autofs_hash_lookup: hash = 0x%08x, name = ", name->hash));
	118	autofs_say(name->name,name->len);
	119
	120	for ( dhn = dh->h[(unsigned) name->hash % AUTOFS_HASH_SIZE] ; dhn ; dhn = dhn->next ) {
	121	if ( name->hash == dhn->hash &&
	122	name->len == dhn->len &&
	123	!memcmp(name->name, dhn->name, name->len) )
	124	break;
	125	}
	126
	127	return dhn;
	128	}
	129
	130	void autofs_hash_insert(struct autofs_dirhash dh, struct autofs_dir_ent ent)
	131	{
	132	struct autofs_dir_ent **dhnp;
	133
	134	DPRINTK(("autofs_hash_insert: hash = 0x%08x, name = ", ent->hash));
	135	autofs_say(ent->name,ent->len);
	136
	137	autofs_init_usage(dh,ent);
	138	if (ent->dentry)
	139	dget(ent->dentry);
	140
	141	dhnp = &dh->h[(unsigned) ent->hash % AUTOFS_HASH_SIZE];
	142	ent->next = *dhnp;
	143	ent->back = dhnp;
	144	*dhnp = ent;
	145	if ( ent->next )
	146	ent->next->back = &(ent->next);
	147	}
	148
	149	void autofs_hash_delete(struct autofs_dir_ent *ent)
	150	{
	151	*(ent->back) = ent->next;
	152	if ( ent->next )
	153	ent->next->back = ent->back;
	154
	155	autofs_delete_usage(ent);
	156
	157	if ( ent->dentry )
	158	dput(ent->dentry);
	159	kfree(ent->name);
	160	kfree(ent);
	161	}
	162
	163	/*
	164	* Used by readdir(). We must validate "ptr", so we can't simply make it
	165	* a pointer. Values below 0xffff are reserved; calling with any value
	166	* <= 0x10000 will return the first entry found.
	167	*
168	* "last" can be NULL or the value returned by the last search if we
169	* want the next sequential entry.
170	*/
171	struct autofs_dir_ent autofs_hash_enum(const struct autofs_dirhash dh,
172	off_t ptr, struct autofs_dir_ent last)
173	{
174	int bucket, ecount, i;
175	struct autofs_dir_ent *ent;
176
177	bucket = (*ptr >> 16) - 1;
178	ecount = *ptr & 0xffff;
179
180	if ( bucket < 0 ) {
181	bucket = ecount = 0;
182	}
183
184	DPRINTK(("autofs_hash_enum: bucket %d, entry %d\n", bucket, ecount));
185
186	ent = last ? last->next : NULL;
187
188	if ( ent ) {
189	ecount++;
190	} else {
191	while ( bucket < AUTOFS_HASH_SIZE ) {
192	ent = dh->h[bucket];
193	for ( i = ecount ; ent && i ; i-- )
194	ent = ent->next;
195
196	if (ent) {
197	ecount++; /* Point to next entry */
198	break;
199	}
200
201	bucket++; ecount = 0;
202	}
203	}
204
205	#ifdef DEBUG
206	if ( !ent )
207	printk("autofs_hash_enum: nothing found\n");
208	else {
209	printk("autofs_hash_enum: found hash %08x, name", ent->hash);
210	autofs_say(ent->name,ent->len);
211	}
212	#endif
213
214	*ptr = ((bucket+1) << 16) + ecount;
215	return ent;
216	}
217
218	/* Iterate over all the ents, and remove all dentry pointers. Used on
219	entering catatonic mode, in order to make the filesystem unmountable. */
220	void autofs_hash_dputall(struct autofs_dirhash *dh)
221	{
222	int i;
223	struct autofs_dir_ent *ent;
224
225	for ( i = 0 ; i < AUTOFS_HASH_SIZE ; i++ ) {
226	for ( ent = dh->h[i] ; ent ; ent = ent->next ) {
227	if ( ent->dentry ) {
228	dput(ent->dentry);
229	ent->dentry = NULL;
230	}
231	}
232	}
233	}
234
235	/* Delete everything. This is used on filesystem destruction, so we
236	make no attempt to keep the pointers valid */
f76baf93	237	void autofs_hash_nuke(struct autofs_sb_info *sbi)
1da177e4 LT	238	{
	239	int i;
	240	struct autofs_dir_ent ent, nent;
	241
	242	for ( i = 0 ; i < AUTOFS_HASH_SIZE ; i++ ) {
f76baf93	243	for ( ent = sbi->dirhash.h[i] ; ent ; ent = nent ) {
1da177e4 LT	244	nent = ent->next;
	245	if ( ent->dentry )
	246	dput(ent->dentry);
	247	kfree(ent->name);
	248	kfree(ent);
	249	}
	250	}
	251	}