⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 namei.c

📁 LINUX 内核
💻 C
📖 第 1 页 / 共 2 页
字号:
		if ((void *) de >= (void *) (bh->b_data+BLOCK_SIZE)) {			brelse(bh);			block=bmap(inode,nr/MINIX_DIR_ENTRIES_PER_BLOCK);			if (!block) {				nr += MINIX_DIR_ENTRIES_PER_BLOCK;				continue;			}			if (!(bh=bread(inode->i_dev,block)))				return 0;			de = (struct minix_dir_entry *) bh->b_data;		}		if (de->inode) {			brelse(bh);			return 0;		}		de++;		nr++;	}	brelse(bh);	return 1;}int minix_rmdir(struct inode * dir, const char * name, int len){	int retval;	struct inode * inode;	struct buffer_head * bh;	struct minix_dir_entry * de;	inode = NULL;	bh = minix_find_entry(dir,name,len,&de);	retval = -ENOENT;	if (!bh)		goto end_rmdir;	retval = -EPERM;	if (!(inode = iget(dir->i_dev, de->inode)))		goto end_rmdir;	if ((dir->i_mode & S_ISVTX) && current->euid &&	   inode->i_uid != current->euid)		goto end_rmdir;	if (inode->i_dev != dir->i_dev)		goto end_rmdir;	if (inode == dir)	/* we may not delete ".", but "../dir" is ok */		goto end_rmdir;	if (!S_ISDIR(inode->i_mode)) {		retval = -ENOTDIR;		goto end_rmdir;	}	if (!empty_dir(inode)) {		retval = -ENOTEMPTY;		goto end_rmdir;	}	if (inode->i_count > 1) {		retval = -EBUSY;		goto end_rmdir;	}	if (inode->i_nlink != 2)		printk("empty directory has nlink!=2 (%d)\n",inode->i_nlink);	de->inode = 0;	bh->b_dirt = 1;	inode->i_nlink=0;	inode->i_dirt=1;	dir->i_nlink--;	dir->i_ctime = dir->i_mtime = CURRENT_TIME;	dir->i_dirt=1;	retval = 0;end_rmdir:	iput(dir);	iput(inode);	brelse(bh);	return retval;}int minix_unlink(struct inode * dir, const char * name, int len){	int retval;	struct inode * inode;	struct buffer_head * bh;	struct minix_dir_entry * de;	retval = -ENOENT;	inode = NULL;	bh = minix_find_entry(dir,name,len,&de);	if (!bh)		goto end_unlink;	if (!(inode = iget(dir->i_dev, de->inode)))		goto end_unlink;	retval = -EPERM;	if ((dir->i_mode & S_ISVTX) && !suser() &&	    current->euid != inode->i_uid &&	    current->euid != dir->i_uid)		goto end_unlink;	if (S_ISDIR(inode->i_mode))		goto end_unlink;	if (!inode->i_nlink) {		printk("Deleting nonexistent file (%04x:%d), %d\n",			inode->i_dev,inode->i_ino,inode->i_nlink);		inode->i_nlink=1;	}	de->inode = 0;	bh->b_dirt = 1;	inode->i_nlink--;	inode->i_dirt = 1;	inode->i_ctime = CURRENT_TIME;	retval = 0;end_unlink:	brelse(bh);	iput(inode);	iput(dir);	return retval;}int minix_symlink(struct inode * dir, const char * name, int len, const char * symname){	struct minix_dir_entry * de;	struct inode * inode = NULL;	struct buffer_head * bh = NULL, * name_block = NULL;	int i;	char c;	if (!(inode = minix_new_inode(dir->i_dev))) {		iput(dir);		return -ENOSPC;	}	inode->i_mode = S_IFLNK | 0777;	inode->i_dirt = 1;	if (!(inode->i_data[0] = minix_new_block(inode->i_dev))) {		iput(dir);		inode->i_nlink--;		iput(inode);		return -ENOSPC;	}	inode->i_dirt = 1;	if (!(name_block = bread(inode->i_dev,inode->i_data[0]))) {		iput(dir);		inode->i_nlink--;		iput(inode);		return -ERROR;	}	i = 0;	while (i < 1023 && (c=get_fs_byte(symname++)))		name_block->b_data[i++] = c;	name_block->b_data[i] = 0;	name_block->b_dirt = 1;	brelse(name_block);	inode->i_size = i;	inode->i_dirt = 1;	bh = minix_find_entry(dir,name,len,&de);	if (bh) {		inode->i_nlink--;		iput(inode);		brelse(bh);		iput(dir);		return -EEXIST;	}	bh = minix_add_entry(dir,name,len,&de);	if (!bh) {		inode->i_nlink--;		iput(inode);		iput(dir);		return -ENOSPC;	}	de->inode = inode->i_ino;	bh->b_dirt = 1;	brelse(bh);	iput(dir);	iput(inode);	return 0;}int minix_link(struct inode * oldinode, struct inode * dir, const char * name, int len){	struct minix_dir_entry * de;	struct buffer_head * bh;	if (S_ISDIR(oldinode->i_mode)) {		iput(oldinode);		iput(dir);		return -EPERM;	}	bh = minix_find_entry(dir,name,len,&de);	if (bh) {		brelse(bh);		iput(dir);		iput(oldinode);		return -EEXIST;	}	bh = minix_add_entry(dir,name,len,&de);	if (!bh) {		iput(dir);		iput(oldinode);		return -ENOSPC;	}	de->inode = oldinode->i_ino;	bh->b_dirt = 1;	brelse(bh);	iput(dir);	oldinode->i_nlink++;	oldinode->i_ctime = CURRENT_TIME;	oldinode->i_dirt = 1;	iput(oldinode);	return 0;}static int subdir(struct inode * new, struct inode * old){	unsigned short fs;	int ino;	int result;	__asm__("mov %%fs,%0":"=r" (fs));	__asm__("mov %0,%%fs"::"r" ((unsigned short) 0x10));	new->i_count++;	result = 0;	for (;;) {		if (new == old) {			result = 1;			break;		}		if (new->i_dev != old->i_dev)			break;		ino = new->i_ino;		if (minix_lookup(new,"..",2,&new))			break;		if (new->i_ino == ino)			break;	}	iput(new);	__asm__("mov %0,%%fs"::"r" (fs));	return result;}#define PARENT_INO(buffer) \(((struct minix_dir_entry *) (buffer))[1].inode)#define PARENT_NAME(buffer) \(((struct minix_dir_entry *) (buffer))[1].name)/* * rename uses retrying to avoid race-conditions: at least they should be minimal. * it tries to allocate all the blocks, then sanity-checks, and if the sanity- * checks fail, it tries to restart itself again. Very practical - no changes * are done until we know everything works ok.. and then all the changes can be * done in one fell swoop when we have claimed all the buffers needed. * * Anybody can rename anything with this: the permission checks are left to the * higher-level routines. */static int do_minix_rename(struct inode * old_dir, const char * old_name, int old_len,	struct inode * new_dir, const char * new_name, int new_len){	struct inode * old_inode, * new_inode;	struct buffer_head * old_bh, * new_bh, * dir_bh;	struct minix_dir_entry * old_de, * new_de;	int retval;	goto start_up;try_again:	brelse(old_bh);	brelse(new_bh);	brelse(dir_bh);	iput(old_inode);	iput(new_inode);	current->counter = 0;	schedule();start_up:	old_inode = new_inode = NULL;	old_bh = new_bh = dir_bh = NULL;	old_bh = minix_find_entry(old_dir,old_name,old_len,&old_de);	retval = -ENOENT;	if (!old_bh)		goto end_rename;	old_inode = iget(old_dir->i_dev, old_de->inode);	if (!old_inode)		goto end_rename;	new_bh = minix_find_entry(new_dir,new_name,new_len,&new_de);	if (new_bh) {		new_inode = iget(new_dir->i_dev, new_de->inode);		if (!new_inode) {			brelse(new_bh);			new_bh = NULL;		}	}	if (new_inode == old_inode) {		retval = 0;		goto end_rename;	}	if (S_ISDIR(old_inode->i_mode)) {		retval = -EEXIST;		if (new_bh)			goto end_rename;		retval = -EACCES;		if (!permission(old_inode, MAY_WRITE))			goto end_rename;		retval = -EINVAL;		if (subdir(new_dir, old_inode))			goto end_rename;		retval = -EIO;		if (!old_inode->i_data[0])			goto end_rename;		if (!(dir_bh = bread(old_inode->i_dev, old_inode->i_data[0])))			goto end_rename;		if (PARENT_INO(dir_bh->b_data) != old_dir->i_ino)			goto end_rename;	}	if (!new_bh)		new_bh = minix_add_entry(new_dir,new_name,new_len,&new_de);	retval = -ENOSPC;	if (!new_bh)		goto end_rename;/* sanity checking before doing the rename - avoid races */	if (new_inode && (new_de->inode != new_inode->i_ino))		goto try_again;	if (new_de->inode && !new_inode)		goto try_again;	if (old_de->inode != old_inode->i_ino)		goto try_again;/* ok, that's it */	old_de->inode = 0;	new_de->inode = old_inode->i_ino;	if (new_inode)		new_inode->i_nlink--;	old_bh->b_dirt = 1;	new_bh->b_dirt = 1;	if (dir_bh) {		PARENT_INO(dir_bh->b_data) = new_dir->i_ino;		dir_bh->b_dirt = 1;		old_dir->i_nlink--;		new_dir->i_nlink++;		old_dir->i_dirt = 1;		new_dir->i_dirt = 1;	}	retval = 0;end_rename:	brelse(dir_bh);	brelse(old_bh);	brelse(new_bh);	iput(old_inode);	iput(new_inode);	iput(old_dir);	iput(new_dir);	return retval;}/* * Ok, rename also locks out other renames, as they can change the parent of * a directory, and we don't want any races. Other races are checked for by * "do_rename()", which restarts if there are inconsistencies. * * Note that there is no race between different filesystems: it's only within * the same device that races occur: many renames can happen at once, as long * as they are on different partitions. */int minix_rename(struct inode * old_dir, const char * old_name, int old_len,	struct inode * new_dir, const char * new_name, int new_len){	static struct task_struct * wait = NULL;	static int lock = 0;	int result;	while (lock)		sleep_on(&wait);	lock = 1;	result = do_minix_rename(old_dir, old_name, old_len,		new_dir, new_name, new_len);	lock = 0;	wake_up(&wait);	return result;}int minix_readlink(struct inode * inode, char * buffer, int buflen){	struct buffer_head * bh;	int i;	char c;	if (!S_ISLNK(inode->i_mode)) {		iput(inode);		return -EINVAL;	}	if (buflen > 1023)		buflen = 1023;	if (inode->i_data[0])		bh = bread(inode->i_dev, inode->i_data[0]);	else		bh = NULL;	iput(inode);	if (!bh)		return 0;	i = 0;	while (i<buflen && (c = bh->b_data[i])) {		i++;		put_fs_byte(c,buffer++);	}	brelse(bh);	return i;}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -