亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频

? 歡迎來到蟲蟲下載站! | ?? 資源下載 ?? 資源專輯 ?? 關(guān)于我們
? 蟲蟲下載站

?? namei.c

?? 內(nèi)核是系統(tǒng)的心臟
?? C
?? 第 1 頁 / 共 2 頁
字號(hào):
		inode->i_mode |= S_ISGID;
	inode->i_dirt = 1;
	bh = ext_add_entry(dir,name,len,&de);
	if (!bh) {
		iput(dir);
		inode->i_nlink=0;
		iput(inode);
		return -ENOSPC;
	}
	de->inode = inode->i_ino;
	bh->b_dirt = 1;
	dir->i_nlink++;
	dir->i_dirt = 1;
	iput(dir);
	iput(inode);
	brelse(bh);
	return 0;
}

/*
 * routine to check that the specified directory is empty (for rmdir)
 */
static int empty_dir(struct inode * inode)
{
	unsigned long offset;
	struct buffer_head * bh;
	struct ext_dir_entry * de, * de1;

	if (inode->i_size < 2 * 12 || !(bh = ext_bread(inode,0,0))) {
	    	printk("warning - bad directory on dev %04x\n",inode->i_dev);
		return 1;
	}
	de = (struct ext_dir_entry *) bh->b_data;
	de1 = (struct ext_dir_entry *) ((char *) de + de->rec_len);
	if (de->inode != inode->i_ino || !de1->inode || 
	    strcmp(".",de->name) || strcmp("..",de1->name)) {
	    	printk("warning - bad directory on dev %04x\n",inode->i_dev);
		return 1;
	}
	offset = de->rec_len + de1->rec_len;
	de = (struct ext_dir_entry *) ((char *) de1 + de1->rec_len);
	while (offset < inode->i_size ) {
		if ((void *) de >= (void *) (bh->b_data+BLOCK_SIZE)) {
			brelse(bh);
			bh = ext_bread(inode, offset >> BLOCK_SIZE_BITS,1);
			if (!bh) {
				offset += BLOCK_SIZE;
				continue;
			}
			de = (struct ext_dir_entry *) bh->b_data;
		}
		if (de->rec_len < 8 || de->rec_len %4 != 0 ||
		    de->rec_len < de->name_len + 8) {
			printk ("empty_dir: bad dir entry\n");
			printk ("dev=%d, dir=%d, offset=%d, rec_len=%d, name_len=%d\n",
				inode->i_dev, inode->i_ino, offset, de->rec_len, de->name_len);
			brelse (bh);
			return 1;
		}
		if (de->inode) {
			brelse(bh);
			return 0;
		}
		offset += de->rec_len;
		de = (struct ext_dir_entry *) ((char *) de + de->rec_len);
	}
	brelse(bh);
	return 1;
}

static inline void ext_merge_entries (struct ext_dir_entry * de,
	struct ext_dir_entry * pde, struct ext_dir_entry * nde)
{
	if (nde && !nde->inode)
		de->rec_len += nde->rec_len;
	if (pde && !pde->inode)
		pde->rec_len += de->rec_len;
}

int ext_rmdir(struct inode * dir, const char * name, int len)
{
	int retval;
	struct inode * inode;
	struct buffer_head * bh;
	struct ext_dir_entry * de, * pde, * nde;

	inode = NULL;
	bh = ext_find_entry(dir,name,len,&de,&pde,&nde);
	retval = -ENOENT;
	if (!bh)
		goto end_rmdir;
	retval = -EPERM;
	if (!(inode = iget(dir->i_sb, 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;
	de->name_len = 0;
	ext_merge_entries (de, pde, nde);
	bh->b_dirt = 1;
	inode->i_nlink=0;
	inode->i_dirt=1;
	dir->i_nlink--;
	inode->i_ctime = 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 ext_unlink(struct inode * dir, const char * name, int len)
{
	int retval;
	struct inode * inode;
	struct buffer_head * bh;
	struct ext_dir_entry * de, * pde, * nde;

	retval = -ENOENT;
	inode = NULL;
	bh = ext_find_entry(dir,name,len,&de,&pde,&nde);
	if (!bh)
		goto end_unlink;
	if (!(inode = iget(dir->i_sb, 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;
	de->name_len = 0;
	ext_merge_entries (de, pde, nde);
	bh->b_dirt = 1;
	inode->i_nlink--;
	inode->i_dirt = 1;
	inode->i_ctime = CURRENT_TIME;
	dir->i_ctime = dir->i_mtime = inode->i_ctime;
	dir->i_dirt = 1;
	retval = 0;
end_unlink:
	brelse(bh);
	iput(inode);
	iput(dir);
	return retval;
}

int ext_symlink(struct inode * dir, const char * name, int len, const char * symname)
{
	struct ext_dir_entry * de;
	struct inode * inode = NULL;
	struct buffer_head * bh = NULL, * name_block = NULL;
	int i;
	char c;

	if (!(inode = ext_new_inode(dir))) {
		iput(dir);
		return -ENOSPC;
	}
	inode->i_mode = S_IFLNK | 0777;
	inode->i_op = &ext_symlink_inode_operations;
	name_block = ext_bread(inode,0,1);
	if (!name_block) {
		iput(dir);
		inode->i_nlink--;
		inode->i_dirt = 1;
		iput(inode);
		return -ENOSPC;
	}
	i = 0;
	while (i < 1023 && (c = *(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 = ext_find_entry(dir,name,len,&de,NULL,NULL);
	if (bh) {
		inode->i_nlink--;
		inode->i_dirt = 1;
		iput(inode);
		brelse(bh);
		iput(dir);
		return -EEXIST;
	}
	bh = ext_add_entry(dir,name,len,&de);
	if (!bh) {
		inode->i_nlink--;
		inode->i_dirt = 1;
		iput(inode);
		iput(dir);
		return -ENOSPC;
	}
	de->inode = inode->i_ino;
	bh->b_dirt = 1;
	brelse(bh);
	iput(dir);
	iput(inode);
	return 0;
}

int ext_link(struct inode * oldinode, struct inode * dir, const char * name, int len)
{
	struct ext_dir_entry * de;
	struct buffer_head * bh;

	if (S_ISDIR(oldinode->i_mode)) {
		iput(oldinode);
		iput(dir);
		return -EPERM;
	}
	if (oldinode->i_nlink > 32000) {
		iput(oldinode);
		iput(dir);
		return -EMLINK;
	}
	bh = ext_find_entry(dir,name,len,&de,NULL,NULL);
	if (bh) {
		brelse(bh);
		iput(dir);
		iput(oldinode);
		return -EEXIST;
	}
	bh = ext_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_inode, struct inode * old_inode)
{
	int ino;
	int result;

	new_inode->i_count++;
	result = 0;
	for (;;) {
		if (new_inode == old_inode) {
			result = 1;
			break;
		}
		if (new_inode->i_dev != old_inode->i_dev)
			break;
		ino = new_inode->i_ino;
		if (ext_lookup(new_inode,"..",2,&new_inode))
			break;
		if (new_inode->i_ino == ino)
			break;
	}
	iput(new_inode);
	return result;
}

#define PARENT_INO(buffer) \
((struct ext_dir_entry *) ((char *) buffer + \
((struct ext_dir_entry *) buffer)->rec_len))->inode

#define PARENT_NAME(buffer) \
((struct ext_dir_entry *) ((char *) buffer + \
((struct ext_dir_entry *) buffer)->rec_len))->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_ext_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 ext_dir_entry * old_de, * new_de, * pde, * nde;
	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 = ext_find_entry(old_dir,old_name,old_len,&old_de,&pde,&nde);
	retval = -ENOENT;
	if (!old_bh)
		goto end_rename;
	old_inode = __iget(old_dir->i_sb, old_de->inode,0); /* don't cross mnt-points */
	if (!old_inode)
		goto end_rename;
	retval = -EPERM;
	if ((old_dir->i_mode & S_ISVTX) && 
	    current->euid != old_inode->i_uid &&
	    current->euid != old_dir->i_uid && !suser())
		goto end_rename;
	new_bh = ext_find_entry(new_dir,new_name,new_len,&new_de,NULL,NULL);
	if (new_bh) {
		new_inode = __iget(new_dir->i_sb, new_de->inode,0); /* don't cross mnt-points */
		if (!new_inode) {
			brelse(new_bh);
			new_bh = NULL;
		}
	}
	if (new_inode == old_inode) {
		retval = 0;
		goto end_rename;
	}
	if (new_inode && S_ISDIR(new_inode->i_mode)) {
		retval = -EEXIST;
		goto end_rename;
	}
	retval = -EPERM;
	if (new_inode && (new_dir->i_mode & S_ISVTX) && 
	    current->euid != new_inode->i_uid &&
	    current->euid != new_dir->i_uid && !suser())
		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;
		dir_bh = ext_bread(old_inode,0,0);
		if (!dir_bh)
			goto end_rename;
		if (PARENT_INO(dir_bh->b_data) != old_dir->i_ino)
			goto end_rename;
	}
	if (!new_bh)
		new_bh = ext_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;
	old_de->name_len = 0;
	new_de->inode = old_inode->i_ino;
	ext_merge_entries (old_de, pde, nde);
	if (new_inode) {
		new_inode->i_nlink--;
		new_inode->i_dirt = 1;
	}
	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 ext_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 wait_queue * wait = NULL;
	static int lock = 0;
	int result;

	while (lock)
		sleep_on(&wait);
	lock = 1;
	result = do_ext_rename(old_dir, old_name, old_len,
		new_dir, new_name, new_len);
	lock = 0;
	wake_up(&wait);
	return result;
}

?? 快捷鍵說明

復(fù)制代碼 Ctrl + C
搜索代碼 Ctrl + F
全屏模式 F11
切換主題 Ctrl + Shift + D
顯示快捷鍵 ?
增大字號(hào) Ctrl + =
減小字號(hào) Ctrl + -
亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频
亚洲精品一区二区三区99| 中文字幕亚洲一区二区av在线| 69堂成人精品免费视频| 亚洲精品一区二区三区在线观看| 国产精品视频第一区| 午夜精品福利一区二区蜜股av| 国产一区二区主播在线| 94-欧美-setu| 国精产品一区一区三区mba视频| 99久久99久久精品免费观看| 日韩欧美一区在线| 亚洲男人的天堂一区二区| 精品一区二区在线看| 欧美亚一区二区| 久久久久久99久久久精品网站| 亚洲精品高清在线| 成人在线综合网站| xnxx国产精品| 免费在线观看视频一区| 欧美日韩精品三区| 欧美丝袜丝nylons| 亚洲欧美一区二区久久| 国产91精品免费| 日韩久久久久久| 五月婷婷综合在线| 欧美亚洲自拍偷拍| 亚洲美女在线国产| www.亚洲精品| 国产欧美在线观看一区| 国产一区二区在线看| 欧美一区二区三区啪啪| 一区二区欧美在线观看| 91黄视频在线观看| 欧美男男青年gay1069videost| 亚洲视频 欧洲视频| 99视频有精品| 中文字幕在线观看一区二区| 国产白丝精品91爽爽久久| 久久久久久久久久久久久女国产乱| 老司机免费视频一区二区三区| 欧美一区二区在线播放| 日本不卡一二三区黄网| 日韩欧美在线123| 国产中文字幕精品| 久久精品在这里| 国产中文一区二区三区| 国产欧美一区二区精品性色| 国产成人精品亚洲午夜麻豆| 国产欧美日韩另类视频免费观看| 国产69精品久久久久777| 久久九九99视频| 成人av午夜电影| 亚洲精品中文在线影院| 欧美日韩精品一区二区三区蜜桃 | www.99精品| 国产精品欧美精品| 色94色欧美sute亚洲13| 亚洲成人免费看| 日韩午夜激情av| 国产成人午夜精品5599| 综合欧美亚洲日本| 欧美日本国产视频| 国产综合一区二区| 国产精品成人一区二区三区夜夜夜| 成人av片在线观看| 亚洲国产精品一区二区久久恐怖片 | 欧美精彩视频一区二区三区| 亚洲精品国产精华液| 欧美乱熟臀69xxxxxx| 免播放器亚洲一区| 中文字幕av一区二区三区免费看| 99免费精品在线| 爽爽淫人综合网网站 | 欧美老人xxxx18| 激情五月婷婷综合网| 国产精品乱码一区二三区小蝌蚪| 欧美无砖专区一中文字| 日本成人中文字幕在线视频| 国产精品午夜电影| 在线不卡免费av| 成人黄色免费短视频| 亚洲不卡一区二区三区| 国产亚洲成年网址在线观看| 精品视频在线免费看| 国产一区二三区好的| 亚洲一级二级在线| 国产女人18水真多18精品一级做| 欧美午夜电影网| 成人av影院在线| 国产曰批免费观看久久久| 中文字幕一区二区三区在线播放| 日韩无一区二区| 欧美最猛性xxxxx直播| 国产夫妻精品视频| 日本成人在线不卡视频| 国产精品乱码久久久久久| 欧美一卡在线观看| 欧美亚洲国产一区在线观看网站| 国产v综合v亚洲欧| 九九九久久久精品| 视频在线观看一区| 国产精品剧情在线亚洲| 久久精品一区二区三区四区| 91精品国产色综合久久不卡电影 | 欧美精品亚洲二区| 国产.欧美.日韩| 黄页网站大全一区二区| 奇米影视一区二区三区小说| 亚洲在线免费播放| 亚洲视频一区二区在线观看| 成人黄色软件下载| 不卡一区二区在线| 岛国精品在线观看| 国产麻豆91精品| 久久99精品国产91久久来源| 亚洲精品写真福利| 日本黄色一区二区| 高清成人免费视频| 国产91丝袜在线播放0| 国产一区二区电影| 国产精品888| 国产河南妇女毛片精品久久久| 五月天久久比比资源色| 亚洲一级二级三级| 中文字幕第一区第二区| 国产午夜精品在线观看| 2021中文字幕一区亚洲| 久久久久亚洲蜜桃| 久久久久久久免费视频了| 欧美色综合网站| 麻豆成人免费电影| 日本伊人色综合网| 青青草成人在线观看| 麻豆国产精品官网| 狠狠色2019综合网| 国产不卡高清在线观看视频| 不卡在线视频中文字幕| 欧美色爱综合网| 精品视频在线免费观看| 精品蜜桃在线看| 亚洲国产精品二十页| 中文字幕精品—区二区四季| 成人欧美一区二区三区| 欧美日韩卡一卡二| 欧美大黄免费观看| 国产欧美精品一区二区色综合| 中文字幕欧美一区| 丝袜美腿亚洲一区| 国产中文一区二区三区| www.色综合.com| 欧美日韩国产天堂| 精品成人在线观看| 中文字幕一区二区三区视频| 亚洲高清久久久| 国产乱码精品1区2区3区| 成人福利在线看| 欧美一区二区三区视频免费播放 | 毛片av一区二区三区| 成人污污视频在线观看| 欧美日韩一区二区三区视频| 日韩一级高清毛片| 国产精品传媒入口麻豆| 免费av成人在线| 日本韩国一区二区| 欧美精品一区二区三区高清aⅴ| 自拍偷拍国产精品| 久久99久久久久久久久久久| 91麻豆国产自产在线观看| 这里只有精品视频在线观看| 国产精品麻豆久久久| 美女被吸乳得到大胸91| 色婷婷综合久久久久中文一区二区| 日韩精品一区二区三区视频在线观看| 国产精品久久久久国产精品日日| 丝袜美腿亚洲色图| 欧美三级韩国三级日本一级| 国产精品免费丝袜| 韩国理伦片一区二区三区在线播放| 91成人免费在线| 国产精品水嫩水嫩| 老司机精品视频线观看86| 色欧美片视频在线观看在线视频| 国产亚洲精品超碰| 日本aⅴ精品一区二区三区| 99r国产精品| 国产三级欧美三级| 久久99热狠狠色一区二区| 欧美日韩美少妇 | 国产日韩三级在线| 奇米亚洲午夜久久精品| 日本精品一区二区三区高清| 中文字幕中文字幕一区| 国产成人精品三级| 亚洲精品一区二区三区精华液| 日韩精品一级中文字幕精品视频免费观看 | 亚洲黄色性网站| 国产传媒久久文化传媒| 欧美成va人片在线观看| 日本va欧美va精品| 69久久夜色精品国产69蝌蚪网|