ialloc.c 4.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170
  1. /*
  2. * ialloc.c
  3. *
  4. * PURPOSE
  5. * Inode allocation handling routines for the OSTA-UDF(tm) filesystem.
  6. *
  7. * CONTACTS
  8. * E-mail regarding any portion of the Linux UDF file system should be
  9. * directed to the development team mailing list (run by majordomo):
  10. * linux_udf@hpesjro.fc.hp.com
  11. *
  12. * COPYRIGHT
  13. * This file is distributed under the terms of the GNU General Public
  14. * License (GPL). Copies of the GPL can be obtained from:
  15. * ftp://prep.ai.mit.edu/pub/gnu/GPL
  16. * Each contributing author retains all rights to their own work.
  17. *
  18. * (C) 1998-2001 Ben Fennema
  19. *
  20. * HISTORY
  21. *
  22. * 02/24/99 blf Created.
  23. *
  24. */
  25. #include "udfdecl.h"
  26. #include <linux/fs.h>
  27. #include <linux/quotaops.h>
  28. #include <linux/udf_fs.h>
  29. #include <linux/sched.h>
  30. #include <linux/slab.h>
  31. #include "udf_i.h"
  32. #include "udf_sb.h"
  33. void udf_free_inode(struct inode * inode)
  34. {
  35. struct super_block *sb = inode->i_sb;
  36. struct udf_sb_info *sbi = UDF_SB(sb);
  37. /*
  38. * Note: we must free any quota before locking the superblock,
  39. * as writing the quota to disk may need the lock as well.
  40. */
  41. DQUOT_FREE_INODE(inode);
  42. DQUOT_DROP(inode);
  43. clear_inode(inode);
  44. down(&sbi->s_alloc_sem);
  45. if (sbi->s_lvidbh) {
  46. if (S_ISDIR(inode->i_mode))
  47. UDF_SB_LVIDIU(sb)->numDirs =
  48. cpu_to_le32(le32_to_cpu(UDF_SB_LVIDIU(sb)->numDirs) - 1);
  49. else
  50. UDF_SB_LVIDIU(sb)->numFiles =
  51. cpu_to_le32(le32_to_cpu(UDF_SB_LVIDIU(sb)->numFiles) - 1);
  52. mark_buffer_dirty(sbi->s_lvidbh);
  53. }
  54. up(&sbi->s_alloc_sem);
  55. udf_free_blocks(sb, NULL, UDF_I_LOCATION(inode), 0, 1);
  56. }
  57. struct inode * udf_new_inode (struct inode *dir, int mode, int * err)
  58. {
  59. struct super_block *sb = dir->i_sb;
  60. struct udf_sb_info *sbi = UDF_SB(sb);
  61. struct inode * inode;
  62. int block;
  63. uint32_t start = UDF_I_LOCATION(dir).logicalBlockNum;
  64. inode = new_inode(sb);
  65. if (!inode)
  66. {
  67. *err = -ENOMEM;
  68. return NULL;
  69. }
  70. *err = -ENOSPC;
  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. down(&sbi->s_alloc_sem);
  79. UDF_I_UNIQUE(inode) = 0;
  80. UDF_I_LENEXTENTS(inode) = 0;
  81. UDF_I_NEXT_ALLOC_BLOCK(inode) = 0;
  82. UDF_I_NEXT_ALLOC_GOAL(inode) = 0;
  83. UDF_I_STRAT4096(inode) = 0;
  84. if (UDF_SB_LVIDBH(sb))
  85. {
  86. struct logicalVolHeaderDesc *lvhd;
  87. uint64_t uniqueID;
  88. lvhd = (struct logicalVolHeaderDesc *)(UDF_SB_LVID(sb)->logicalVolContentsUse);
  89. if (S_ISDIR(mode))
  90. UDF_SB_LVIDIU(sb)->numDirs =
  91. cpu_to_le32(le32_to_cpu(UDF_SB_LVIDIU(sb)->numDirs) + 1);
  92. else
  93. UDF_SB_LVIDIU(sb)->numFiles =
  94. cpu_to_le32(le32_to_cpu(UDF_SB_LVIDIU(sb)->numFiles) + 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. {
  105. inode->i_gid = dir->i_gid;
  106. if (S_ISDIR(mode))
  107. mode |= S_ISGID;
  108. }
  109. else
  110. inode->i_gid = current->fsgid;
  111. UDF_I_LOCATION(inode).logicalBlockNum = block;
  112. UDF_I_LOCATION(inode).partitionReferenceNum = UDF_I_LOCATION(dir).partitionReferenceNum;
  113. inode->i_ino = udf_get_lb_pblock(sb, UDF_I_LOCATION(inode), 0);
  114. inode->i_blksize = PAGE_SIZE;
  115. inode->i_blocks = 0;
  116. UDF_I_LENEATTR(inode) = 0;
  117. UDF_I_LENALLOC(inode) = 0;
  118. UDF_I_USE(inode) = 0;
  119. if (UDF_QUERY_FLAG(inode->i_sb, UDF_FLAG_USE_EXTENDED_FE))
  120. {
  121. UDF_I_EFE(inode) = 1;
  122. UDF_UPDATE_UDFREV(inode->i_sb, UDF_VERS_USE_EXTENDED_FE);
  123. UDF_I_DATA(inode) = kmalloc(inode->i_sb->s_blocksize - sizeof(struct extendedFileEntry), GFP_KERNEL);
  124. memset(UDF_I_DATA(inode), 0x00, inode->i_sb->s_blocksize - sizeof(struct extendedFileEntry));
  125. }
  126. else
  127. {
  128. UDF_I_EFE(inode) = 0;
  129. UDF_I_DATA(inode) = kmalloc(inode->i_sb->s_blocksize - sizeof(struct fileEntry), GFP_KERNEL);
  130. memset(UDF_I_DATA(inode), 0x00, inode->i_sb->s_blocksize - sizeof(struct fileEntry));
  131. }
  132. if (UDF_QUERY_FLAG(inode->i_sb, UDF_FLAG_USE_AD_IN_ICB))
  133. UDF_I_ALLOCTYPE(inode) = ICBTAG_FLAG_AD_IN_ICB;
  134. else if (UDF_QUERY_FLAG(inode->i_sb, UDF_FLAG_USE_SHORT_AD))
  135. UDF_I_ALLOCTYPE(inode) = ICBTAG_FLAG_AD_SHORT;
  136. else
  137. UDF_I_ALLOCTYPE(inode) = ICBTAG_FLAG_AD_LONG;
  138. inode->i_mtime = inode->i_atime = inode->i_ctime =
  139. UDF_I_CRTIME(inode) = current_fs_time(inode->i_sb);
  140. insert_inode_hash(inode);
  141. mark_inode_dirty(inode);
  142. up(&sbi->s_alloc_sem);
  143. if (DQUOT_ALLOC_INODE(inode))
  144. {
  145. DQUOT_DROP(inode);
  146. inode->i_flags |= S_NOQUOTA;
  147. inode->i_nlink = 0;
  148. iput(inode);
  149. *err = -EDQUOT;
  150. return NULL;
  151. }
  152. *err = 0;
  153. return inode;
  154. }