/*
 * linux/fs/umsdos/check.c
 *
 * Sanity-checking code
 */

#include <linux/signal.h>
#include <linux/sched.h>
#include <linux/kernel.h>
#include <linux/errno.h>
#include <linux/string.h>
#include <linux/types.h>
#include <linux/ptrace.h>
#include <linux/mman.h>
#include <linux/mm.h>
#include <linux/umsdos_fs.h>

#include <asm/system.h>

#ifdef CHECK_PAGE_TABLES
static int check_one_table (struct pde *page_dir)
{
	if (pgd_none (*page_dir))
		return 0;
	if (pgd_bad (*page_dir))
		return 1;
	return 0;
}

/*
 * This function checks all page tables of "current"
 */
void check_page_tables (void)
{
	struct pgd *pg_dir;
	static int err = 0;

	int stack_level = (long) (&pg_dir) - current->kernel_stack_page;

	if (stack_level < 1500)
		printk ("** %d ** ", stack_level);
	pg_dir = PAGE_DIR_OFFSET (current, 0);
	if (err == 0) {
		int i;

		for (i = 0; i < PTRS_PER_PAGE; i++, page_dir++) {
			int notok = check_one_table (page_dir);

			if (notok) {
				err++;
				printk ("|%d:%08lx| ", i, page_dir->pgd);
			}
		}
		if (err)
			printk ("\nError MM %d\n", err);
	}
}
#endif


#if UMS_DEBUG
/*
 * check for wait queue in 2.3.x
 */
inline void uq_log (char *txt, struct inode *inode)
{
	printk (KERN_ERR "%s: (%lu) magic=%lu creator=%lu lock=%u\n", txt, inode->i_ino, inode->u.umsdos_i.dir_info.p.__magic, inode->u.umsdos_i.dir_info.p.__creator, inode->u.umsdos_i.dir_info.p.lock.lock);
}

/*
 * check a superblock
 */

void check_sb (struct super_block *sb, const char c)
{
	if (sb) {
		printk (" (has %c_sb=%d, %d)", 
			c, MAJOR (sb->s_dev), MINOR (sb->s_dev));
	} else {
		printk (" (%c_sb is NULL)", c);
	}
} 

/*
 * check an inode
 */

void check_inode (struct inode *inode)
{
	if (inode) {
		printk (KERN_DEBUG "*   inode is %lu (i_count=%d)",
			 inode->i_ino, inode->i_count);
		check_sb (inode->i_sb, 'i');
		
		if (inode->i_dentry.next) {	/* FIXME: does this work ? */
			printk (" (has i_dentry)");
		} else {
			printk (" (NO i_dentry)");
		}
		
		printk (" (i_patched=%d)", inode->u.umsdos_i.i_patched);

	} else {
		printk (KERN_DEBUG "*   inode is NULL\n");
	}
}

/*
 * checks all inode->i_dentry
 *
 */
void checkd_inode (struct inode *inode)
{
	struct dentry *ret;
	struct list_head *cur;
	int count = 0;
	if (!inode) {
		printk (KERN_ERR "checkd_inode: inode is NULL!\n");
		return;
	}

	printk (KERN_DEBUG "checkd_inode:  inode %lu\n", inode->i_ino);
	cur = inode->i_dentry.next;
	while (count++ < 10) {
		PRINTK (("1..."));
		if (!cur) {
			printk (KERN_ERR "checkd_inode: *** NULL reached. exit.\n");
			return;
		}
		PRINTK (("2..."));
		ret = list_entry (cur, struct dentry, d_alias);
		PRINTK (("3..."));
		if (cur == cur->next) {
			printk (KERN_DEBUG "checkd_inode: *** cur=cur->next: normal exit.\n");
			return;
		}
		PRINTK (("4..."));
		if (!ret) {
			printk (KERN_ERR "checkd_inode: *** ret dentry is NULL. exit.\n");
			return;
		}
		PRINTK (("5... (ret=%p)...", ret));
		PRINTK (("5.1.. (ret->d_dname=%p)...", &(ret->d_name)));
		PRINTK (("5.1.1. (ret->d_dname.len=%d)...", (int) ret->d_name.len));
		PRINTK (("5.1.2. (ret->d_dname.name=%c)...", ret->d_name.name));
		printk (KERN_DEBUG "checkd_inode:   i_dentry is %.*s\n", (int) ret->d_name.len, ret->d_name.name);
		PRINTK (("6..."));
		cur = cur->next;
		PRINTK (("7..."));
#if 1
		printk (KERN_DEBUG "checkd_inode: *** finished after count 1 (operator forced)\n");
		return;
#endif		
	}
	printk (KERN_ERR "checkd_inode: *** OVER LIMIT (loop?) !\n");
	return;
}

/*
 * internal part of check_dentry. does the real job.
 *
 */

void check_dent_int (struct dentry *dentry, int parent)
{
	if (parent) {
		printk (KERN_DEBUG "*  parent(%d) dentry: %.*s\n", 
			parent, (int) dentry->d_name.len, dentry->d_name.name);
	} else {
		printk (KERN_DEBUG "*  checking dentry: %.*s\n",
			 (int) dentry->d_name.len, dentry->d_name.name);
	}
	check_inode (dentry->d_inode);
	printk (KERN_DEBUG "*   d_count=%d", dentry->d_count);
	check_sb (dentry->d_sb, 'd');
	if (dentry->d_op == NULL) {
		printk (" (d_op is NULL)\n");
	} else {
		printk (" (d_op is UNKNOWN: %p)\n", dentry->d_op);
	}
}

/*
 * checks dentry with full traceback to root and prints info. Limited to 10 recursive depths to avoid infinite loops.
 *
 */

void check_dentry_path (struct dentry *dentry, const char *desc)
{
	int count=0;
	printk (KERN_DEBUG "*** check_dentry_path: %.60s\n", desc);

	if (!dentry) {
		printk (KERN_DEBUG "*** checking dentry... it is NULL !\n");
		return;
	}
	if (IS_ERR(dentry)) {
		printk (KERN_DEBUG "*** checking dentry... it is ERR(%ld) !\n",
			 PTR_ERR(dentry));
		return;
	}
	
	while (dentry && count < 10) {
		check_dent_int (dentry, count++);
		if (IS_ROOT(dentry)) {
			printk (KERN_DEBUG "*** end checking dentry (root reached ok)\n");
			break;
		}
		dentry = dentry->d_parent;
	}

	if (count >= 10) {	/* if infinite loop detected */
		printk (KERN_ERR 
			"*** WARNING ! INFINITE LOOP ! check_dentry_path aborted !\n");
	}
	
	if (!dentry) {
		printk (KERN_ERR 
			"*** WARNING ! NULL dentry ! check_dentry_path aborted !\n");
	}
}
#else
inline void uq_log (char *txt, struct inode *inode) {};
void check_sb (struct super_block *sb, const char c) {};
void check_inode (struct inode *inode) {};
void checkd_inode (struct inode *inode) {};
void check_dentry_path (struct dentry *dentry, const char *desc) {};
#endif	/* UMS_DEBUG */

