ext4_i.h 4.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167
  1. /*
  2. * ext4_i.h
  3. *
  4. * Copyright (C) 1992, 1993, 1994, 1995
  5. * Remy Card (card@masi.ibp.fr)
  6. * Laboratoire MASI - Institut Blaise Pascal
  7. * Universite Pierre et Marie Curie (Paris VI)
  8. *
  9. * from
  10. *
  11. * linux/include/linux/minix_fs_i.h
  12. *
  13. * Copyright (C) 1991, 1992 Linus Torvalds
  14. */
  15. #ifndef _EXT4_I
  16. #define _EXT4_I
  17. #include <linux/rwsem.h>
  18. #include <linux/rbtree.h>
  19. #include <linux/seqlock.h>
  20. #include <linux/mutex.h>
  21. /* data type for block offset of block group */
  22. typedef int ext4_grpblk_t;
  23. /* data type for filesystem-wide blocks number */
  24. typedef unsigned long long ext4_fsblk_t;
  25. /* data type for file logical block number */
  26. typedef __u32 ext4_lblk_t;
  27. /* data type for block group number */
  28. typedef unsigned long ext4_group_t;
  29. struct ext4_reserve_window {
  30. ext4_fsblk_t _rsv_start; /* First byte reserved */
  31. ext4_fsblk_t _rsv_end; /* Last byte reserved or 0 */
  32. };
  33. struct ext4_reserve_window_node {
  34. struct rb_node rsv_node;
  35. __u32 rsv_goal_size;
  36. __u32 rsv_alloc_hit;
  37. struct ext4_reserve_window rsv_window;
  38. };
  39. struct ext4_block_alloc_info {
  40. /* information about reservation window */
  41. struct ext4_reserve_window_node rsv_window_node;
  42. /*
  43. * was i_next_alloc_block in ext4_inode_info
  44. * is the logical (file-relative) number of the
  45. * most-recently-allocated block in this file.
  46. * We use this for detecting linearly ascending allocation requests.
  47. */
  48. ext4_lblk_t last_alloc_logical_block;
  49. /*
  50. * Was i_next_alloc_goal in ext4_inode_info
  51. * is the *physical* companion to i_next_alloc_block.
  52. * it the physical block number of the block which was most-recentl
  53. * allocated to this file. This give us the goal (target) for the next
  54. * allocation when we detect linearly ascending requests.
  55. */
  56. ext4_fsblk_t last_alloc_physical_block;
  57. };
  58. #define rsv_start rsv_window._rsv_start
  59. #define rsv_end rsv_window._rsv_end
  60. /*
  61. * storage for cached extent
  62. */
  63. struct ext4_ext_cache {
  64. ext4_fsblk_t ec_start;
  65. ext4_lblk_t ec_block;
  66. __u32 ec_len; /* must be 32bit to return holes */
  67. __u32 ec_type;
  68. };
  69. /*
  70. * third extended file system inode data in memory
  71. */
  72. struct ext4_inode_info {
  73. __le32 i_data[15]; /* unconverted */
  74. __u32 i_flags;
  75. ext4_fsblk_t i_file_acl;
  76. __u32 i_dtime;
  77. /*
  78. * i_block_group is the number of the block group which contains
  79. * this file's inode. Constant across the lifetime of the inode,
  80. * it is ued for making block allocation decisions - we try to
  81. * place a file's data blocks near its inode block, and new inodes
  82. * near to their parent directory's inode.
  83. */
  84. ext4_group_t i_block_group;
  85. __u32 i_state; /* Dynamic state flags for ext4 */
  86. /* block reservation info */
  87. struct ext4_block_alloc_info *i_block_alloc_info;
  88. ext4_lblk_t i_dir_start_lookup;
  89. #ifdef CONFIG_EXT4DEV_FS_XATTR
  90. /*
  91. * Extended attributes can be read independently of the main file
  92. * data. Taking i_mutex even when reading would cause contention
  93. * between readers of EAs and writers of regular file data, so
  94. * instead we synchronize on xattr_sem when reading or changing
  95. * EAs.
  96. */
  97. struct rw_semaphore xattr_sem;
  98. #endif
  99. #ifdef CONFIG_EXT4DEV_FS_POSIX_ACL
  100. struct posix_acl *i_acl;
  101. struct posix_acl *i_default_acl;
  102. #endif
  103. struct list_head i_orphan; /* unlinked but open inodes */
  104. /*
  105. * i_disksize keeps track of what the inode size is ON DISK, not
  106. * in memory. During truncate, i_size is set to the new size by
  107. * the VFS prior to calling ext4_truncate(), but the filesystem won't
  108. * set i_disksize to 0 until the truncate is actually under way.
  109. *
  110. * The intent is that i_disksize always represents the blocks which
  111. * are used by this file. This allows recovery to restart truncate
  112. * on orphans if we crash during truncate. We actually write i_disksize
  113. * into the on-disk inode when writing inodes out, instead of i_size.
  114. *
  115. * The only time when i_disksize and i_size may be different is when
  116. * a truncate is in progress. The only things which change i_disksize
  117. * are ext4_get_block (growth) and ext4_truncate (shrinkth).
  118. */
  119. loff_t i_disksize;
  120. /* on-disk additional length */
  121. __u16 i_extra_isize;
  122. /*
  123. * i_data_sem is for serialising ext4_truncate() against
  124. * ext4_getblock(). In the 2.4 ext2 design, great chunks of inode's
  125. * data tree are chopped off during truncate. We can't do that in
  126. * ext4 because whenever we perform intermediate commits during
  127. * truncate, the inode and all the metadata blocks *must* be in a
  128. * consistent state which allows truncation of the orphans to restart
  129. * during recovery. Hence we must fix the get_block-vs-truncate race
  130. * by other means, so we have i_data_sem.
  131. */
  132. struct rw_semaphore i_data_sem;
  133. struct inode vfs_inode;
  134. unsigned long i_ext_generation;
  135. struct ext4_ext_cache i_cached_extent;
  136. /*
  137. * File creation time. Its function is same as that of
  138. * struct timespec i_{a,c,m}time in the generic inode.
  139. */
  140. struct timespec i_crtime;
  141. /* mballoc */
  142. struct list_head i_prealloc_list;
  143. spinlock_t i_prealloc_lock;
  144. };
  145. #endif /* _EXT4_I */