GHES: Elliminate double-loop in the NMI handler
[linux/fpc-iii.git] / fs / btrfs / delayed-inode.h
blobf70119f254216583f3c7317085ec209eceb03d0f
1 /*
2 * Copyright (C) 2011 Fujitsu. All rights reserved.
3 * Written by Miao Xie <miaox@cn.fujitsu.com>
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.
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.
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.
20 #ifndef __DELAYED_TREE_OPERATION_H
21 #define __DELAYED_TREE_OPERATION_H
23 #include <linux/rbtree.h>
24 #include <linux/spinlock.h>
25 #include <linux/mutex.h>
26 #include <linux/list.h>
27 #include <linux/wait.h>
28 #include <linux/atomic.h>
30 #include "ctree.h"
32 /* types of the delayed item */
33 #define BTRFS_DELAYED_INSERTION_ITEM 1
34 #define BTRFS_DELAYED_DELETION_ITEM 2
36 struct btrfs_delayed_root {
37 spinlock_t lock;
38 struct list_head node_list;
40 * Used for delayed nodes which is waiting to be dealt with by the
41 * worker. If the delayed node is inserted into the work queue, we
42 * drop it from this list.
44 struct list_head prepare_list;
45 atomic_t items; /* for delayed items */
46 atomic_t items_seq; /* for delayed items */
47 int nodes; /* for delayed nodes */
48 wait_queue_head_t wait;
51 #define BTRFS_DELAYED_NODE_IN_LIST 0
52 #define BTRFS_DELAYED_NODE_INODE_DIRTY 1
53 #define BTRFS_DELAYED_NODE_DEL_IREF 2
55 struct btrfs_delayed_node {
56 u64 inode_id;
57 u64 bytes_reserved;
58 struct btrfs_root *root;
59 /* Used to add the node into the delayed root's node list. */
60 struct list_head n_list;
62 * Used to add the node into the prepare list, the nodes in this list
63 * is waiting to be dealt with by the async worker.
65 struct list_head p_list;
66 struct rb_root ins_root;
67 struct rb_root del_root;
68 struct mutex mutex;
69 struct btrfs_inode_item inode_item;
70 atomic_t refs;
71 u64 index_cnt;
72 unsigned long flags;
73 int count;
76 struct btrfs_delayed_item {
77 struct rb_node rb_node;
78 struct btrfs_key key;
79 struct list_head tree_list; /* used for batch insert/delete items */
80 struct list_head readdir_list; /* used for readdir items */
81 u64 bytes_reserved;
82 struct btrfs_delayed_node *delayed_node;
83 atomic_t refs;
84 int ins_or_del;
85 u32 data_len;
86 char data[0];
89 static inline void btrfs_init_delayed_root(
90 struct btrfs_delayed_root *delayed_root)
92 atomic_set(&delayed_root->items, 0);
93 atomic_set(&delayed_root->items_seq, 0);
94 delayed_root->nodes = 0;
95 spin_lock_init(&delayed_root->lock);
96 init_waitqueue_head(&delayed_root->wait);
97 INIT_LIST_HEAD(&delayed_root->node_list);
98 INIT_LIST_HEAD(&delayed_root->prepare_list);
101 int btrfs_insert_delayed_dir_index(struct btrfs_trans_handle *trans,
102 struct btrfs_root *root, const char *name,
103 int name_len, struct inode *dir,
104 struct btrfs_disk_key *disk_key, u8 type,
105 u64 index);
107 int btrfs_delete_delayed_dir_index(struct btrfs_trans_handle *trans,
108 struct btrfs_root *root, struct inode *dir,
109 u64 index);
111 int btrfs_inode_delayed_dir_index_count(struct inode *inode);
113 int btrfs_run_delayed_items(struct btrfs_trans_handle *trans,
114 struct btrfs_root *root);
115 int btrfs_run_delayed_items_nr(struct btrfs_trans_handle *trans,
116 struct btrfs_root *root, int nr);
118 void btrfs_balance_delayed_items(struct btrfs_root *root);
120 int btrfs_commit_inode_delayed_items(struct btrfs_trans_handle *trans,
121 struct inode *inode);
122 /* Used for evicting the inode. */
123 void btrfs_remove_delayed_node(struct inode *inode);
124 void btrfs_kill_delayed_inode_items(struct inode *inode);
125 int btrfs_commit_inode_delayed_inode(struct inode *inode);
128 int btrfs_delayed_update_inode(struct btrfs_trans_handle *trans,
129 struct btrfs_root *root, struct inode *inode);
130 int btrfs_fill_inode(struct inode *inode, u32 *rdev);
131 int btrfs_delayed_delete_inode_ref(struct inode *inode);
133 /* Used for drop dead root */
134 void btrfs_kill_all_delayed_nodes(struct btrfs_root *root);
136 /* Used for clean the transaction */
137 void btrfs_destroy_delayed_inodes(struct btrfs_root *root);
139 /* Used for readdir() */
140 void btrfs_get_delayed_items(struct inode *inode, struct list_head *ins_list,
141 struct list_head *del_list);
142 void btrfs_put_delayed_items(struct list_head *ins_list,
143 struct list_head *del_list);
144 int btrfs_should_delete_dir_index(struct list_head *del_list,
145 u64 index);
146 int btrfs_readdir_delayed_dir_index(struct dir_context *ctx,
147 struct list_head *ins_list);
149 /* for init */
150 int __init btrfs_delayed_inode_init(void);
151 void btrfs_delayed_inode_exit(void);
153 /* for debugging */
154 void btrfs_assert_delayed_root_empty(struct btrfs_root *root);
156 #endif