ialloc.c 4.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179
  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. #include "udfdecl.h"
  21. #include <linux/fs.h>
  22. #include <linux/quotaops.h>
  23. #include <linux/udf_fs.h>
  24. #include <linux/sched.h>
  25. #include <linux/slab.h>
  26. #include "udf_i.h"
  27. #include "udf_sb.h"
  28. void udf_free_inode(struct inode *inode)
  29. {
  30. struct super_block *sb = inode->i_sb;
  31. struct udf_sb_info *sbi = UDF_SB(sb);
  32. /*
  33. * Note: we must free any quota before locking the superblock,
  34. * as writing the quota to disk may need the lock as well.
  35. */
  36. DQUOT_FREE_INODE(inode);
  37. DQUOT_DROP(inode);
  38. clear_inode(inode);
  39. mutex_lock(&sbi->s_alloc_mutex);
  40. if (sbi->s_lvid_bh) {
  41. struct logicalVolIntegrityDescImpUse *lvidiu =
  42. udf_sb_lvidiu(sbi);
  43. if (S_ISDIR(inode->i_mode))
  44. lvidiu->numDirs =
  45. cpu_to_le32(le32_to_cpu(lvidiu->numDirs) - 1);
  46. else
  47. lvidiu->numFiles =
  48. cpu_to_le32(le32_to_cpu(lvidiu->numFiles) - 1);
  49. mark_buffer_dirty(sbi->s_lvid_bh);
  50. }
  51. mutex_unlock(&sbi->s_alloc_mutex);
  52. udf_free_blocks(sb, NULL, UDF_I(inode)->i_location, 0, 1);
  53. }
  54. struct inode *udf_new_inode(struct inode *dir, int mode, int *err)
  55. {
  56. struct super_block *sb = dir->i_sb;
  57. struct udf_sb_info *sbi = UDF_SB(sb);
  58. struct inode *inode;
  59. int block;
  60. uint32_t start = UDF_I(dir)->i_location.logicalBlockNum;
  61. struct udf_inode_info *iinfo;
  62. struct udf_inode_info *dinfo = UDF_I(dir);
  63. inode = new_inode(sb);
  64. if (!inode) {
  65. *err = -ENOMEM;
  66. return NULL;
  67. }
  68. *err = -ENOSPC;
  69. iinfo = UDF_I(inode);
  70. iinfo->i_unique = 0;
  71. iinfo->i_lenExtents = 0;
  72. iinfo->i_next_alloc_block = 0;
  73. iinfo->i_next_alloc_goal = 0;
  74. iinfo->i_strat4096 = 0;
  75. block = udf_new_block(dir->i_sb, NULL,
  76. dinfo->i_location.partitionReferenceNum,
  77. start, err);
  78. if (*err) {
  79. iput(inode);
  80. return NULL;
  81. }
  82. mutex_lock(&sbi->s_alloc_mutex);
  83. if (sbi->s_lvid_bh) {
  84. struct logicalVolIntegrityDesc *lvid =
  85. (struct logicalVolIntegrityDesc *)
  86. sbi->s_lvid_bh->b_data;
  87. struct logicalVolIntegrityDescImpUse *lvidiu =
  88. udf_sb_lvidiu(sbi);
  89. struct logicalVolHeaderDesc *lvhd;
  90. uint64_t uniqueID;
  91. lvhd = (struct logicalVolHeaderDesc *)
  92. (lvid->logicalVolContentsUse);
  93. if (S_ISDIR(mode))
  94. lvidiu->numDirs =
  95. cpu_to_le32(le32_to_cpu(lvidiu->numDirs) + 1);
  96. else
  97. lvidiu->numFiles =
  98. cpu_to_le32(le32_to_cpu(lvidiu->numFiles) + 1);
  99. iinfo->i_unique = uniqueID = le64_to_cpu(lvhd->uniqueID);
  100. if (!(++uniqueID & 0x00000000FFFFFFFFUL))
  101. uniqueID += 16;
  102. lvhd->uniqueID = cpu_to_le64(uniqueID);
  103. mark_buffer_dirty(sbi->s_lvid_bh);
  104. }
  105. inode->i_mode = mode;
  106. inode->i_uid = current->fsuid;
  107. if (dir->i_mode & S_ISGID) {
  108. inode->i_gid = dir->i_gid;
  109. if (S_ISDIR(mode))
  110. mode |= S_ISGID;
  111. } else {
  112. inode->i_gid = current->fsgid;
  113. }
  114. iinfo->i_location.logicalBlockNum = block;
  115. iinfo->i_location.partitionReferenceNum =
  116. dinfo->i_location.partitionReferenceNum;
  117. inode->i_ino = udf_get_lb_pblock(sb, iinfo->i_location, 0);
  118. inode->i_blocks = 0;
  119. iinfo->i_lenEAttr = 0;
  120. iinfo->i_lenAlloc = 0;
  121. iinfo->i_use = 0;
  122. if (UDF_QUERY_FLAG(inode->i_sb, UDF_FLAG_USE_EXTENDED_FE)) {
  123. iinfo->i_efe = 1;
  124. if (UDF_VERS_USE_EXTENDED_FE > sbi->s_udfrev)
  125. sbi->s_udfrev = UDF_VERS_USE_EXTENDED_FE;
  126. iinfo->i_ext.i_data = kzalloc(inode->i_sb->s_blocksize -
  127. sizeof(struct extendedFileEntry),
  128. GFP_KERNEL);
  129. } else {
  130. iinfo->i_efe = 0;
  131. iinfo->i_ext.i_data = kzalloc(inode->i_sb->s_blocksize -
  132. sizeof(struct fileEntry),
  133. GFP_KERNEL);
  134. }
  135. if (!iinfo->i_ext.i_data) {
  136. iput(inode);
  137. *err = -ENOMEM;
  138. mutex_unlock(&sbi->s_alloc_mutex);
  139. return NULL;
  140. }
  141. if (UDF_QUERY_FLAG(inode->i_sb, UDF_FLAG_USE_AD_IN_ICB))
  142. iinfo->i_alloc_type = ICBTAG_FLAG_AD_IN_ICB;
  143. else if (UDF_QUERY_FLAG(inode->i_sb, UDF_FLAG_USE_SHORT_AD))
  144. iinfo->i_alloc_type = ICBTAG_FLAG_AD_SHORT;
  145. else
  146. iinfo->i_alloc_type = ICBTAG_FLAG_AD_LONG;
  147. inode->i_mtime = inode->i_atime = inode->i_ctime =
  148. iinfo->i_crtime = current_fs_time(inode->i_sb);
  149. insert_inode_hash(inode);
  150. mark_inode_dirty(inode);
  151. mutex_unlock(&sbi->s_alloc_mutex);
  152. if (DQUOT_ALLOC_INODE(inode)) {
  153. DQUOT_DROP(inode);
  154. inode->i_flags |= S_NOQUOTA;
  155. inode->i_nlink = 0;
  156. iput(inode);
  157. *err = -EDQUOT;
  158. return NULL;
  159. }
  160. *err = 0;
  161. return inode;
  162. }