[deliverable/linux.git] / fs / udf / ialloc.c

/*
 * ialloc.c
 *
 * PURPOSE
 *	Inode allocation handling routines for the OSTA-UDF(tm) filesystem.
 *
 * COPYRIGHT
 *	This file is distributed under the terms of the GNU General Public
 *	License (GPL). Copies of the GPL can be obtained from:
 *		ftp://prep.ai.mit.edu/pub/gnu/GPL
 *	Each contributing author retains all rights to their own work.
 *
 *  (C) 1998-2001 Ben Fennema
 *
 * HISTORY
 *
 *  02/24/99 blf  Created.
 *
 */

#include "udfdecl.h"
#include <linux/fs.h>
#include <linux/sched.h>
#include <linux/slab.h>

#include "udf_i.h"
#include "udf_sb.h"

void udf_free_inode(struct inode *inode)
{
	struct super_block *sb = inode->i_sb;
	struct udf_sb_info *sbi = UDF_SB(sb);
	struct logicalVolIntegrityDescImpUse *lvidiu = udf_sb_lvidiu(sb);

	if (lvidiu) {
		mutex_lock(&sbi->s_alloc_mutex);
		if (S_ISDIR(inode->i_mode))
			le32_add_cpu(&lvidiu->numDirs, -1);
		else
			le32_add_cpu(&lvidiu->numFiles, -1);
		udf_updated_lvid(sb);
		mutex_unlock(&sbi->s_alloc_mutex);
	}

	udf_free_blocks(sb, NULL, &UDF_I(inode)->i_location, 0, 1);
}

struct inode *udf_new_inode(struct inode *dir, umode_t mode, int *err)
{
	struct super_block *sb = dir->i_sb;
	struct udf_sb_info *sbi = UDF_SB(sb);
	struct inode *inode;
	int block;
	uint32_t start = UDF_I(dir)->i_location.logicalBlockNum;
	struct udf_inode_info *iinfo;
	struct udf_inode_info *dinfo = UDF_I(dir);
	struct logicalVolIntegrityDescImpUse *lvidiu;

	inode = new_inode(sb);

	if (!inode) {
		*err = -ENOMEM;
		return NULL;
	}
	*err = -ENOSPC;

	iinfo = UDF_I(inode);
	if (UDF_QUERY_FLAG(inode->i_sb, UDF_FLAG_USE_EXTENDED_FE)) {
		iinfo->i_efe = 1;
		if (UDF_VERS_USE_EXTENDED_FE > sbi->s_udfrev)
			sbi->s_udfrev = UDF_VERS_USE_EXTENDED_FE;
		iinfo->i_ext.i_data = kzalloc(inode->i_sb->s_blocksize -
					    sizeof(struct extendedFileEntry),
					    GFP_KERNEL);
	} else {
		iinfo->i_efe = 0;
		iinfo->i_ext.i_data = kzalloc(inode->i_sb->s_blocksize -
					    sizeof(struct fileEntry),
					    GFP_KERNEL);
	}
	if (!iinfo->i_ext.i_data) {
		iput(inode);
		*err = -ENOMEM;
		return NULL;
	}

	block = udf_new_block(dir->i_sb, NULL,
			      dinfo->i_location.partitionReferenceNum,
			      start, err);
	if (*err) {
		iput(inode);
		return NULL;
	}

	lvidiu = udf_sb_lvidiu(sb);
	if (lvidiu) {
		iinfo->i_unique = lvid_get_unique_id(sb);
		mutex_lock(&sbi->s_alloc_mutex);
		if (S_ISDIR(mode))
			le32_add_cpu(&lvidiu->numDirs, 1);
		else
			le32_add_cpu(&lvidiu->numFiles, 1);
		udf_updated_lvid(sb);
		mutex_unlock(&sbi->s_alloc_mutex);
	}

	inode_init_owner(inode, dir, mode);

	iinfo->i_location.logicalBlockNum = block;
	iinfo->i_location.partitionReferenceNum =
				dinfo->i_location.partitionReferenceNum;
	inode->i_ino = udf_get_lb_pblock(sb, &iinfo->i_location, 0);
	inode->i_blocks = 0;
	iinfo->i_lenEAttr = 0;
	iinfo->i_lenAlloc = 0;
	iinfo->i_use = 0;
	iinfo->i_checkpoint = 1;
	if (UDF_QUERY_FLAG(inode->i_sb, UDF_FLAG_USE_AD_IN_ICB))
		iinfo->i_alloc_type = ICBTAG_FLAG_AD_IN_ICB;
	else if (UDF_QUERY_FLAG(inode->i_sb, UDF_FLAG_USE_SHORT_AD))
		iinfo->i_alloc_type = ICBTAG_FLAG_AD_SHORT;
	else
		iinfo->i_alloc_type = ICBTAG_FLAG_AD_LONG;
	inode->i_mtime = inode->i_atime = inode->i_ctime =
		iinfo->i_crtime = current_fs_time(inode->i_sb);
	insert_inode_hash(inode);
	mark_inode_dirty(inode);

	*err = 0;
	return inode;
}
Commit	Line	Data
1da177e4 LT	1	/*
	2	* ialloc.c
	3	*
	4	* PURPOSE
	5	* Inode allocation handling routines for the OSTA-UDF(tm) filesystem.
	6	*
1da177e4 LT	7	* COPYRIGHT
	8	* This file is distributed under the terms of the GNU General Public
	9	* License (GPL). Copies of the GPL can be obtained from:
	10	* ftp://prep.ai.mit.edu/pub/gnu/GPL
	11	* Each contributing author retains all rights to their own work.
	12	*
	13	* (C) 1998-2001 Ben Fennema
	14	*
	15	* HISTORY
	16	*
	17	* 02/24/99 blf Created.
	18	*
	19	*/
	20
	21	#include "udfdecl.h"
	22	#include <linux/fs.h>
1da177e4 LT	23	#include <linux/sched.h>
	24	#include <linux/slab.h>
	25
	26	#include "udf_i.h"
	27	#include "udf_sb.h"
	28
cb00ea35	29	void udf_free_inode(struct inode *inode)
1da177e4 LT	30	{
	31	struct super_block *sb = inode->i_sb;
	32	struct udf_sb_info *sbi = UDF_SB(sb);
69d75671	33	struct logicalVolIntegrityDescImpUse *lvidiu = udf_sb_lvidiu(sb);
1da177e4	34
69d75671 JK	35	if (lvidiu) {
69d75671 JK	36	mutex_lock(&sbi->s_alloc_mutex);
1da177e4	37	if (S_ISDIR(inode->i_mode))
c2104fda	38	le32_add_cpu(&lvidiu->numDirs, -1);
1da177e4	39	else
c2104fda	40	le32_add_cpu(&lvidiu->numFiles, -1);
146bca72	41	udf_updated_lvid(sb);
69d75671	42	mutex_unlock(&sbi->s_alloc_mutex);
1da177e4	43	}
1da177e4	44
97e961fd	45	udf_free_blocks(sb, NULL, &UDF_I(inode)->i_location, 0, 1);
1da177e4 LT	46	}
1da177e4 LT	47
faa17292	48	struct inode udf_new_inode(struct inode dir, umode_t mode, int *err)
1da177e4 LT	49	{
	50	struct super_block *sb = dir->i_sb;
	51	struct udf_sb_info *sbi = UDF_SB(sb);
cb00ea35	52	struct inode *inode;
36350462	53	int block;
c0b34438	54	uint32_t start = UDF_I(dir)->i_location.logicalBlockNum;
48d6d8ff MS	55	struct udf_inode_info *iinfo;
48d6d8ff MS	56	struct udf_inode_info *dinfo = UDF_I(dir);
69d75671	57	struct logicalVolIntegrityDescImpUse *lvidiu;
1da177e4 LT	58
	59	inode = new_inode(sb);
	60
cb00ea35	61	if (!inode) {
1da177e4 LT	62	*err = -ENOMEM;
	63	return NULL;
	64	}
	65	*err = -ENOSPC;
	66
48d6d8ff	67	iinfo = UDF_I(inode);
97e1cfb0 JK	68	if (UDF_QUERY_FLAG(inode->i_sb, UDF_FLAG_USE_EXTENDED_FE)) {
	69	iinfo->i_efe = 1;
	70	if (UDF_VERS_USE_EXTENDED_FE > sbi->s_udfrev)
	71	sbi->s_udfrev = UDF_VERS_USE_EXTENDED_FE;
	72	iinfo->i_ext.i_data = kzalloc(inode->i_sb->s_blocksize -
	73	sizeof(struct extendedFileEntry),
	74	GFP_KERNEL);
	75	} else {
	76	iinfo->i_efe = 0;
	77	iinfo->i_ext.i_data = kzalloc(inode->i_sb->s_blocksize -
	78	sizeof(struct fileEntry),
	79	GFP_KERNEL);
	80	}
	81	if (!iinfo->i_ext.i_data) {
	82	iput(inode);
	83	*err = -ENOMEM;
	84	return NULL;
	85	}
225add61	86
4b11111a	87	block = udf_new_block(dir->i_sb, NULL,
48d6d8ff	88	dinfo->i_location.partitionReferenceNum,
28de7948	89	start, err);
cb00ea35	90	if (*err) {
1da177e4 LT	91	iput(inode);
	92	return NULL;
	93	}
	94
69d75671 JK	95	lvidiu = udf_sb_lvidiu(sb);
69d75671 JK	96	if (lvidiu) {
d664b6af JK	97	iinfo->i_unique = lvid_get_unique_id(sb);
d664b6af JK	98	mutex_lock(&sbi->s_alloc_mutex);
1da177e4	99	if (S_ISDIR(mode))
c2104fda	100	le32_add_cpu(&lvidiu->numDirs, 1);
1da177e4	101	else
c2104fda	102	le32_add_cpu(&lvidiu->numFiles, 1);
146bca72	103	udf_updated_lvid(sb);
d664b6af	104	mutex_unlock(&sbi->s_alloc_mutex);
1da177e4	105	}
a6c5a034 DM	106
a6c5a034 DM	107	inode_init_owner(inode, dir, mode);
1da177e4	108
48d6d8ff MS	109	iinfo->i_location.logicalBlockNum = block;
	110	iinfo->i_location.partitionReferenceNum =
	111	dinfo->i_location.partitionReferenceNum;
97e961fd	112	inode->i_ino = udf_get_lb_pblock(sb, &iinfo->i_location, 0);
1da177e4	113	inode->i_blocks = 0;
48d6d8ff MS	114	iinfo->i_lenEAttr = 0;
	115	iinfo->i_lenAlloc = 0;
	116	iinfo->i_use = 0;
d5e2cf07	117	iinfo->i_checkpoint = 1;
1da177e4	118	if (UDF_QUERY_FLAG(inode->i_sb, UDF_FLAG_USE_AD_IN_ICB))
48d6d8ff	119	iinfo->i_alloc_type = ICBTAG_FLAG_AD_IN_ICB;
1da177e4	120	else if (UDF_QUERY_FLAG(inode->i_sb, UDF_FLAG_USE_SHORT_AD))
48d6d8ff	121	iinfo->i_alloc_type = ICBTAG_FLAG_AD_SHORT;
1da177e4	122	else
48d6d8ff	123	iinfo->i_alloc_type = ICBTAG_FLAG_AD_LONG;
1da177e4	124	inode->i_mtime = inode->i_atime = inode->i_ctime =
48d6d8ff	125	iinfo->i_crtime = current_fs_time(inode->i_sb);
1da177e4 LT	126	insert_inode_hash(inode);
1da177e4 LT	127	mark_inode_dirty(inode);
1da177e4	128
1da177e4 LT	129	*err = 0;
	130	return inode;
	131	}