ialloc.c 4.1 KB

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