ialloc.c 4.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173
  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_lvidbh) {
  41. if (S_ISDIR(inode->i_mode))
  42. UDF_SB_LVIDIU(sb)->numDirs =
  43. cpu_to_le32(le32_to_cpu(UDF_SB_LVIDIU(sb)->numDirs)
  44. - 1);
  45. else
  46. UDF_SB_LVIDIU(sb)->numFiles =
  47. cpu_to_le32(le32_to_cpu(UDF_SB_LVIDIU(sb)->numFiles)
  48. - 1);
  49. mark_buffer_dirty(sbi->s_lvidbh);
  50. }
  51. mutex_unlock(&sbi->s_alloc_mutex);
  52. udf_free_blocks(sb, NULL, UDF_I_LOCATION(inode), 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_LOCATION(dir).logicalBlockNum;
  61. inode = new_inode(sb);
  62. if (!inode) {
  63. *err = -ENOMEM;
  64. return NULL;
  65. }
  66. *err = -ENOSPC;
  67. UDF_I_UNIQUE(inode) = 0;
  68. UDF_I_LENEXTENTS(inode) = 0;
  69. UDF_I_NEXT_ALLOC_BLOCK(inode) = 0;
  70. UDF_I_NEXT_ALLOC_GOAL(inode) = 0;
  71. UDF_I_STRAT4096(inode) = 0;
  72. block =
  73. udf_new_block(dir->i_sb, NULL,
  74. UDF_I_LOCATION(dir).partitionReferenceNum, start,
  75. err);
  76. if (*err) {
  77. iput(inode);
  78. return NULL;
  79. }
  80. mutex_lock(&sbi->s_alloc_mutex);
  81. if (UDF_SB_LVIDBH(sb)) {
  82. struct logicalVolHeaderDesc *lvhd;
  83. uint64_t uniqueID;
  84. lvhd =
  85. (struct logicalVolHeaderDesc *)(UDF_SB_LVID(sb)->
  86. logicalVolContentsUse);
  87. if (S_ISDIR(mode))
  88. UDF_SB_LVIDIU(sb)->numDirs =
  89. cpu_to_le32(le32_to_cpu(UDF_SB_LVIDIU(sb)->numDirs)
  90. + 1);
  91. else
  92. UDF_SB_LVIDIU(sb)->numFiles =
  93. cpu_to_le32(le32_to_cpu(UDF_SB_LVIDIU(sb)->numFiles)
  94. + 1);
  95. UDF_I_UNIQUE(inode) = uniqueID = le64_to_cpu(lvhd->uniqueID);
  96. if (!(++uniqueID & 0x00000000FFFFFFFFUL))
  97. uniqueID += 16;
  98. lvhd->uniqueID = cpu_to_le64(uniqueID);
  99. mark_buffer_dirty(UDF_SB_LVIDBH(sb));
  100. }
  101. inode->i_mode = mode;
  102. inode->i_uid = current->fsuid;
  103. if (dir->i_mode & S_ISGID) {
  104. inode->i_gid = dir->i_gid;
  105. if (S_ISDIR(mode))
  106. mode |= S_ISGID;
  107. } else
  108. inode->i_gid = current->fsgid;
  109. UDF_I_LOCATION(inode).logicalBlockNum = block;
  110. UDF_I_LOCATION(inode).partitionReferenceNum =
  111. UDF_I_LOCATION(dir).partitionReferenceNum;
  112. inode->i_ino = udf_get_lb_pblock(sb, UDF_I_LOCATION(inode), 0);
  113. inode->i_blocks = 0;
  114. UDF_I_LENEATTR(inode) = 0;
  115. UDF_I_LENALLOC(inode) = 0;
  116. UDF_I_USE(inode) = 0;
  117. if (UDF_QUERY_FLAG(inode->i_sb, UDF_FLAG_USE_EXTENDED_FE)) {
  118. UDF_I_EFE(inode) = 1;
  119. UDF_UPDATE_UDFREV(inode->i_sb, UDF_VERS_USE_EXTENDED_FE);
  120. UDF_I_DATA(inode) =
  121. kzalloc(inode->i_sb->s_blocksize -
  122. sizeof(struct extendedFileEntry), GFP_KERNEL);
  123. } else {
  124. UDF_I_EFE(inode) = 0;
  125. UDF_I_DATA(inode) =
  126. kzalloc(inode->i_sb->s_blocksize - sizeof(struct fileEntry),
  127. GFP_KERNEL);
  128. }
  129. if (!UDF_I_DATA(inode)) {
  130. iput(inode);
  131. *err = -ENOMEM;
  132. mutex_unlock(&sbi->s_alloc_mutex);
  133. return NULL;
  134. }
  135. if (UDF_QUERY_FLAG(inode->i_sb, UDF_FLAG_USE_AD_IN_ICB))
  136. UDF_I_ALLOCTYPE(inode) = ICBTAG_FLAG_AD_IN_ICB;
  137. else if (UDF_QUERY_FLAG(inode->i_sb, UDF_FLAG_USE_SHORT_AD))
  138. UDF_I_ALLOCTYPE(inode) = ICBTAG_FLAG_AD_SHORT;
  139. else
  140. UDF_I_ALLOCTYPE(inode) = ICBTAG_FLAG_AD_LONG;
  141. inode->i_mtime = inode->i_atime = inode->i_ctime =
  142. UDF_I_CRTIME(inode) = current_fs_time(inode->i_sb);
  143. insert_inode_hash(inode);
  144. mark_inode_dirty(inode);
  145. mutex_unlock(&sbi->s_alloc_mutex);
  146. if (DQUOT_ALLOC_INODE(inode)) {
  147. DQUOT_DROP(inode);
  148. inode->i_flags |= S_NOQUOTA;
  149. inode->i_nlink = 0;
  150. iput(inode);
  151. *err = -EDQUOT;
  152. return NULL;
  153. }
  154. *err = 0;
  155. return inode;
  156. }