ordered-data.h 4.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149
  1. /*
  2. * Copyright (C) 2007 Oracle. All rights reserved.
  3. *
  4. * This program is free software; you can redistribute it and/or
  5. * modify it under the terms of the GNU General Public
  6. * License v2 as published by the Free Software Foundation.
  7. *
  8. * This program is distributed in the hope that it will be useful,
  9. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  10. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  11. * General Public License for more details.
  12. *
  13. * You should have received a copy of the GNU General Public
  14. * License along with this program; if not, write to the
  15. * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
  16. * Boston, MA 021110-1307, USA.
  17. */
  18. #ifndef __BTRFS_ORDERED_DATA__
  19. #define __BTRFS_ORDERED_DATA__
  20. /* one of these per inode */
  21. struct btrfs_ordered_inode_tree {
  22. struct mutex mutex;
  23. struct rb_root tree;
  24. struct rb_node *last;
  25. };
  26. /*
  27. * these are used to collect checksums done just before bios submission.
  28. * They are attached via a list into the ordered extent, and
  29. * checksum items are inserted into the tree after all the blocks in
  30. * the ordered extent are on disk
  31. */
  32. struct btrfs_sector_sum {
  33. u64 offset;
  34. u32 sum;
  35. };
  36. struct btrfs_ordered_sum {
  37. u64 file_offset;
  38. /*
  39. * this is the length in bytes covered by the sums array below.
  40. * But, the sums array may not be contiguous in the file.
  41. */
  42. unsigned long len;
  43. struct list_head list;
  44. /* last field is a variable length array of btrfs_sector_sums */
  45. struct btrfs_sector_sum sums[];
  46. };
  47. /*
  48. * bits for the flags field:
  49. *
  50. * BTRFS_ORDERED_IO_DONE is set when all of the blocks are written.
  51. * It is used to make sure metadata is inserted into the tree only once
  52. * per extent.
  53. *
  54. * BTRFS_ORDERED_COMPLETE is set when the extent is removed from the
  55. * rbtree, just before waking any waiters. It is used to indicate the
  56. * IO is done and any metadata is inserted into the tree.
  57. */
  58. #define BTRFS_ORDERED_IO_DONE 0 /* set when all the pages are written */
  59. #define BTRFS_ORDERED_COMPLETE 1 /* set when removed from the tree */
  60. #define BTRFS_ORDERED_NOCOW 2 /* set when we want to write in place */
  61. struct btrfs_ordered_extent {
  62. /* logical offset in the file */
  63. u64 file_offset;
  64. /* disk byte number */
  65. u64 start;
  66. /* length of the extent in bytes */
  67. u64 len;
  68. /* flags (described above) */
  69. unsigned long flags;
  70. /* reference count */
  71. atomic_t refs;
  72. /* the inode we belong to */
  73. struct inode *inode;
  74. /* list of checksums for insertion when the extent io is done */
  75. struct list_head list;
  76. /* used to wait for the BTRFS_ORDERED_COMPLETE bit */
  77. wait_queue_head_t wait;
  78. /* our friendly rbtree entry */
  79. struct rb_node rb_node;
  80. /* a per root list of all the pending ordered extents */
  81. struct list_head root_extent_list;
  82. };
  83. /*
  84. * calculates the total size you need to allocate for an ordered sum
  85. * structure spanning 'bytes' in the file
  86. */
  87. static inline int btrfs_ordered_sum_size(struct btrfs_root *root,
  88. unsigned long bytes)
  89. {
  90. unsigned long num_sectors = (bytes + root->sectorsize - 1) /
  91. root->sectorsize;
  92. num_sectors++;
  93. return sizeof(struct btrfs_ordered_sum) +
  94. num_sectors * sizeof(struct btrfs_sector_sum);
  95. }
  96. static inline void
  97. btrfs_ordered_inode_tree_init(struct btrfs_ordered_inode_tree *t)
  98. {
  99. mutex_init(&t->mutex);
  100. t->tree.rb_node = NULL;
  101. t->last = NULL;
  102. }
  103. int btrfs_put_ordered_extent(struct btrfs_ordered_extent *entry);
  104. int btrfs_remove_ordered_extent(struct inode *inode,
  105. struct btrfs_ordered_extent *entry);
  106. int btrfs_dec_test_ordered_pending(struct inode *inode,
  107. u64 file_offset, u64 io_size);
  108. int btrfs_add_ordered_extent(struct inode *inode, u64 file_offset,
  109. u64 start, u64 len, int nocow);
  110. int btrfs_add_ordered_sum(struct inode *inode,
  111. struct btrfs_ordered_extent *entry,
  112. struct btrfs_ordered_sum *sum);
  113. struct btrfs_ordered_extent *btrfs_lookup_ordered_extent(struct inode *inode,
  114. u64 file_offset);
  115. void btrfs_start_ordered_extent(struct inode *inode,
  116. struct btrfs_ordered_extent *entry, int wait);
  117. void btrfs_wait_ordered_range(struct inode *inode, u64 start, u64 len);
  118. struct btrfs_ordered_extent *
  119. btrfs_lookup_first_ordered_extent(struct inode * inode, u64 file_offset);
  120. int btrfs_ordered_update_i_size(struct inode *inode,
  121. struct btrfs_ordered_extent *ordered);
  122. int btrfs_find_ordered_sum(struct inode *inode, u64 offset, u32 *sum);
  123. int btrfs_wait_on_page_writeback_range(struct address_space *mapping,
  124. pgoff_t start, pgoff_t end);
  125. int btrfs_fdatawrite_range(struct address_space *mapping, loff_t start,
  126. loff_t end, int sync_mode);
  127. int btrfs_wait_ordered_extents(struct btrfs_root *root, int nocow_only);
  128. #endif