delayed-inode.h 4.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156
  1. /*
  2. * Copyright (C) 2011 Fujitsu. All rights reserved.
  3. * Written by Miao Xie <miaox@cn.fujitsu.com>
  4. *
  5. * This program is free software; you can redistribute it and/or
  6. * modify it under the terms of the GNU General Public
  7. * License v2 as published by the Free Software Foundation.
  8. *
  9. * This program is distributed in the hope that it will be useful,
  10. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  12. * General Public License for more details.
  13. *
  14. * You should have received a copy of the GNU General Public
  15. * License along with this program; if not, write to the
  16. * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
  17. * Boston, MA 021110-1307, USA.
  18. */
  19. #ifndef __DELAYED_TREE_OPERATION_H
  20. #define __DELAYED_TREE_OPERATION_H
  21. #include <linux/rbtree.h>
  22. #include <linux/spinlock.h>
  23. #include <linux/mutex.h>
  24. #include <linux/list.h>
  25. #include <linux/wait.h>
  26. #include <linux/atomic.h>
  27. #include "ctree.h"
  28. /* types of the delayed item */
  29. #define BTRFS_DELAYED_INSERTION_ITEM 1
  30. #define BTRFS_DELAYED_DELETION_ITEM 2
  31. struct btrfs_delayed_root {
  32. spinlock_t lock;
  33. struct list_head node_list;
  34. /*
  35. * Used for delayed nodes which is waiting to be dealt with by the
  36. * worker. If the delayed node is inserted into the work queue, we
  37. * drop it from this list.
  38. */
  39. struct list_head prepare_list;
  40. atomic_t items; /* for delayed items */
  41. atomic_t items_seq; /* for delayed items */
  42. int nodes; /* for delayed nodes */
  43. wait_queue_head_t wait;
  44. };
  45. #define BTRFS_DELAYED_NODE_IN_LIST 0
  46. #define BTRFS_DELAYED_NODE_INODE_DIRTY 1
  47. #define BTRFS_DELAYED_NODE_DEL_IREF 2
  48. struct btrfs_delayed_node {
  49. u64 inode_id;
  50. u64 bytes_reserved;
  51. struct btrfs_root *root;
  52. /* Used to add the node into the delayed root's node list. */
  53. struct list_head n_list;
  54. /*
  55. * Used to add the node into the prepare list, the nodes in this list
  56. * is waiting to be dealt with by the async worker.
  57. */
  58. struct list_head p_list;
  59. struct rb_root ins_root;
  60. struct rb_root del_root;
  61. struct mutex mutex;
  62. struct btrfs_inode_item inode_item;
  63. atomic_t refs;
  64. u64 index_cnt;
  65. unsigned long flags;
  66. int count;
  67. };
  68. struct btrfs_delayed_item {
  69. struct rb_node rb_node;
  70. struct btrfs_key key;
  71. struct list_head tree_list; /* used for batch insert/delete items */
  72. struct list_head readdir_list; /* used for readdir items */
  73. u64 bytes_reserved;
  74. struct btrfs_delayed_node *delayed_node;
  75. atomic_t refs;
  76. int ins_or_del;
  77. u32 data_len;
  78. char data[0];
  79. };
  80. static inline void btrfs_init_delayed_root(
  81. struct btrfs_delayed_root *delayed_root)
  82. {
  83. atomic_set(&delayed_root->items, 0);
  84. atomic_set(&delayed_root->items_seq, 0);
  85. delayed_root->nodes = 0;
  86. spin_lock_init(&delayed_root->lock);
  87. init_waitqueue_head(&delayed_root->wait);
  88. INIT_LIST_HEAD(&delayed_root->node_list);
  89. INIT_LIST_HEAD(&delayed_root->prepare_list);
  90. }
  91. int btrfs_insert_delayed_dir_index(struct btrfs_trans_handle *trans,
  92. struct btrfs_root *root, const char *name,
  93. int name_len, struct inode *dir,
  94. struct btrfs_disk_key *disk_key, u8 type,
  95. u64 index);
  96. int btrfs_delete_delayed_dir_index(struct btrfs_trans_handle *trans,
  97. struct btrfs_root *root, struct inode *dir,
  98. u64 index);
  99. int btrfs_inode_delayed_dir_index_count(struct inode *inode);
  100. int btrfs_run_delayed_items(struct btrfs_trans_handle *trans,
  101. struct btrfs_root *root);
  102. int btrfs_run_delayed_items_nr(struct btrfs_trans_handle *trans,
  103. struct btrfs_root *root, int nr);
  104. void btrfs_balance_delayed_items(struct btrfs_root *root);
  105. int btrfs_commit_inode_delayed_items(struct btrfs_trans_handle *trans,
  106. struct inode *inode);
  107. /* Used for evicting the inode. */
  108. void btrfs_remove_delayed_node(struct inode *inode);
  109. void btrfs_kill_delayed_inode_items(struct inode *inode);
  110. int btrfs_commit_inode_delayed_inode(struct inode *inode);
  111. int btrfs_delayed_update_inode(struct btrfs_trans_handle *trans,
  112. struct btrfs_root *root, struct inode *inode);
  113. int btrfs_fill_inode(struct inode *inode, u32 *rdev);
  114. int btrfs_delayed_delete_inode_ref(struct inode *inode);
  115. /* Used for drop dead root */
  116. void btrfs_kill_all_delayed_nodes(struct btrfs_root *root);
  117. /* Used for clean the transaction */
  118. void btrfs_destroy_delayed_inodes(struct btrfs_root *root);
  119. /* Used for readdir() */
  120. void btrfs_get_delayed_items(struct inode *inode, struct list_head *ins_list,
  121. struct list_head *del_list);
  122. void btrfs_put_delayed_items(struct list_head *ins_list,
  123. struct list_head *del_list);
  124. int btrfs_should_delete_dir_index(struct list_head *del_list,
  125. u64 index);
  126. int btrfs_readdir_delayed_dir_index(struct dir_context *ctx,
  127. struct list_head *ins_list, bool *emitted);
  128. /* for init */
  129. int __init btrfs_delayed_inode_init(void);
  130. void btrfs_delayed_inode_exit(void);
  131. /* for debugging */
  132. void btrfs_assert_delayed_root_empty(struct btrfs_root *root);
  133. #endif