xref: /openbmc/linux/fs/udf/ialloc.c (revision 87c2ce3b)
1 /*
2  * ialloc.c
3  *
4  * PURPOSE
5  *	Inode allocation handling routines for the OSTA-UDF(tm) filesystem.
6  *
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>
23 #include <linux/quotaops.h>
24 #include <linux/udf_fs.h>
25 #include <linux/sched.h>
26 #include <linux/slab.h>
27 
28 #include "udf_i.h"
29 #include "udf_sb.h"
30 
31 void udf_free_inode(struct inode * inode)
32 {
33 	struct super_block *sb = inode->i_sb;
34 	struct udf_sb_info *sbi = UDF_SB(sb);
35 
36 	/*
37 	 * Note: we must free any quota before locking the superblock,
38 	 * as writing the quota to disk may need the lock as well.
39 	 */
40 	DQUOT_FREE_INODE(inode);
41 	DQUOT_DROP(inode);
42 
43 	clear_inode(inode);
44 
45 	down(&sbi->s_alloc_sem);
46 	if (sbi->s_lvidbh) {
47 		if (S_ISDIR(inode->i_mode))
48 			UDF_SB_LVIDIU(sb)->numDirs =
49 				cpu_to_le32(le32_to_cpu(UDF_SB_LVIDIU(sb)->numDirs) - 1);
50 		else
51 			UDF_SB_LVIDIU(sb)->numFiles =
52 				cpu_to_le32(le32_to_cpu(UDF_SB_LVIDIU(sb)->numFiles) - 1);
53 
54 		mark_buffer_dirty(sbi->s_lvidbh);
55 	}
56 	up(&sbi->s_alloc_sem);
57 
58 	udf_free_blocks(sb, NULL, UDF_I_LOCATION(inode), 0, 1);
59 }
60 
61 struct inode * udf_new_inode (struct inode *dir, int mode, int * err)
62 {
63 	struct super_block *sb = dir->i_sb;
64 	struct udf_sb_info *sbi = UDF_SB(sb);
65 	struct inode * inode;
66 	int block;
67 	uint32_t start = UDF_I_LOCATION(dir).logicalBlockNum;
68 
69 	inode = new_inode(sb);
70 
71 	if (!inode)
72 	{
73 		*err = -ENOMEM;
74 		return NULL;
75 	}
76 	*err = -ENOSPC;
77 
78 	block = udf_new_block(dir->i_sb, NULL, UDF_I_LOCATION(dir).partitionReferenceNum,
79 		start, err);
80 	if (*err)
81 	{
82 		iput(inode);
83 		return NULL;
84 	}
85 
86 	down(&sbi->s_alloc_sem);
87 	UDF_I_UNIQUE(inode) = 0;
88 	UDF_I_LENEXTENTS(inode) = 0;
89 	UDF_I_NEXT_ALLOC_BLOCK(inode) = 0;
90 	UDF_I_NEXT_ALLOC_GOAL(inode) = 0;
91 	UDF_I_STRAT4096(inode) = 0;
92 	if (UDF_SB_LVIDBH(sb))
93 	{
94 		struct logicalVolHeaderDesc *lvhd;
95 		uint64_t uniqueID;
96 		lvhd = (struct logicalVolHeaderDesc *)(UDF_SB_LVID(sb)->logicalVolContentsUse);
97 		if (S_ISDIR(mode))
98 			UDF_SB_LVIDIU(sb)->numDirs =
99 				cpu_to_le32(le32_to_cpu(UDF_SB_LVIDIU(sb)->numDirs) + 1);
100 		else
101 			UDF_SB_LVIDIU(sb)->numFiles =
102 				cpu_to_le32(le32_to_cpu(UDF_SB_LVIDIU(sb)->numFiles) + 1);
103 		UDF_I_UNIQUE(inode) = uniqueID = le64_to_cpu(lvhd->uniqueID);
104 		if (!(++uniqueID & 0x00000000FFFFFFFFUL))
105 			uniqueID += 16;
106 		lvhd->uniqueID = cpu_to_le64(uniqueID);
107 		mark_buffer_dirty(UDF_SB_LVIDBH(sb));
108 	}
109 	inode->i_mode = mode;
110 	inode->i_uid = current->fsuid;
111 	if (dir->i_mode & S_ISGID)
112 	{
113 		inode->i_gid = dir->i_gid;
114 		if (S_ISDIR(mode))
115 			mode |= S_ISGID;
116 	}
117 	else
118 		inode->i_gid = current->fsgid;
119 
120 	UDF_I_LOCATION(inode).logicalBlockNum = block;
121 	UDF_I_LOCATION(inode).partitionReferenceNum = UDF_I_LOCATION(dir).partitionReferenceNum;
122 	inode->i_ino = udf_get_lb_pblock(sb, UDF_I_LOCATION(inode), 0);
123 	inode->i_blksize = PAGE_SIZE;
124 	inode->i_blocks = 0;
125 	UDF_I_LENEATTR(inode) = 0;
126 	UDF_I_LENALLOC(inode) = 0;
127 	UDF_I_USE(inode) = 0;
128 	if (UDF_QUERY_FLAG(inode->i_sb, UDF_FLAG_USE_EXTENDED_FE))
129 	{
130 		UDF_I_EFE(inode) = 1;
131 		UDF_UPDATE_UDFREV(inode->i_sb, UDF_VERS_USE_EXTENDED_FE);
132 		UDF_I_DATA(inode) = kmalloc(inode->i_sb->s_blocksize - sizeof(struct extendedFileEntry), GFP_KERNEL);
133 		memset(UDF_I_DATA(inode), 0x00, inode->i_sb->s_blocksize - sizeof(struct extendedFileEntry));
134 	}
135 	else
136 	{
137 		UDF_I_EFE(inode) = 0;
138 		UDF_I_DATA(inode) = kmalloc(inode->i_sb->s_blocksize - sizeof(struct fileEntry), GFP_KERNEL);
139 		memset(UDF_I_DATA(inode), 0x00, inode->i_sb->s_blocksize - sizeof(struct fileEntry));
140 	}
141 	if (UDF_QUERY_FLAG(inode->i_sb, UDF_FLAG_USE_AD_IN_ICB))
142 		UDF_I_ALLOCTYPE(inode) = ICBTAG_FLAG_AD_IN_ICB;
143 	else if (UDF_QUERY_FLAG(inode->i_sb, UDF_FLAG_USE_SHORT_AD))
144 		UDF_I_ALLOCTYPE(inode) = ICBTAG_FLAG_AD_SHORT;
145 	else
146 		UDF_I_ALLOCTYPE(inode) = ICBTAG_FLAG_AD_LONG;
147 	inode->i_mtime = inode->i_atime = inode->i_ctime =
148 		UDF_I_CRTIME(inode) = current_fs_time(inode->i_sb);
149 	insert_inode_hash(inode);
150 	mark_inode_dirty(inode);
151 	up(&sbi->s_alloc_sem);
152 
153 	if (DQUOT_ALLOC_INODE(inode))
154 	{
155 		DQUOT_DROP(inode);
156 		inode->i_flags |= S_NOQUOTA;
157 		inode->i_nlink = 0;
158 		iput(inode);
159 		*err = -EDQUOT;
160 		return NULL;
161 	}
162 
163 	*err = 0;
164 	return inode;
165 }
166