LXR linux/fs/btrfs/delayed-inode.h

   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
  20#ifndef __DELAYED_TREE_OPERATION_H
  21#define __DELAYED_TREE_OPERATION_H
  22
  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>
  29
  30#include "ctree.h"
  31
  32/* types of the delayed item */
  33#define BTRFS_DELAYED_INSERTION_ITEM    1
  34#define BTRFS_DELAYED_DELETION_ITEM     2
  35
  36struct btrfs_delayed_root {
  37        spinlock_t lock;
  38        struct list_head node_list;
  39        /*
  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.
  43         */
  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;
  49};
  50
  51struct btrfs_delayed_node {
  52        u64 inode_id;
  53        u64 bytes_reserved;
  54        struct btrfs_root *root;
  55        /* Used to add the node into the delayed root's node list. */
  56        struct list_head n_list;
  57        /*
  58         * Used to add the node into the prepare list, the nodes in this list
  59         * is waiting to be dealt with by the async worker.
  60         */
  61        struct list_head p_list;
  62        struct rb_root ins_root;
  63        struct rb_root del_root;
  64        struct mutex mutex;
  65        struct btrfs_inode_item inode_item;
  66        atomic_t refs;
  67        u64 index_cnt;
  68        bool in_list;
  69        bool inode_dirty;
  70        int count;
  71};
  72
  73struct btrfs_delayed_item {
  74        struct rb_node rb_node;
  75        struct btrfs_key key;
  76        struct list_head tree_list;     /* used for batch insert/delete items */
  77        struct list_head readdir_list;  /* used for readdir items */
  78        u64 bytes_reserved;
  79        struct btrfs_delayed_node *delayed_node;
  80        atomic_t refs;
  81        int ins_or_del;
  82        u32 data_len;
  83        char data[0];
  84};
  85
  86static inline void btrfs_init_delayed_root(
  87                                struct btrfs_delayed_root *delayed_root)
  88{
  89        atomic_set(&delayed_root->items, 0);
  90        atomic_set(&delayed_root->items_seq, 0);
  91        delayed_root->nodes = 0;
  92        spin_lock_init(&delayed_root->lock);
  93        init_waitqueue_head(&delayed_root->wait);
  94        INIT_LIST_HEAD(&delayed_root->node_list);
  95        INIT_LIST_HEAD(&delayed_root->prepare_list);
  96}
  97
  98int btrfs_insert_delayed_dir_index(struct btrfs_trans_handle *trans,
  99                                   struct btrfs_root *root, const char *name,
 100                                   int name_len, struct inode *dir,
 101                                   struct btrfs_disk_key *disk_key, u8 type,
 102                                   u64 index);
 103
 104int btrfs_delete_delayed_dir_index(struct btrfs_trans_handle *trans,
 105                                   struct btrfs_root *root, struct inode *dir,
 106                                   u64 index);
 107
 108int btrfs_inode_delayed_dir_index_count(struct inode *inode);
 109
 110int btrfs_run_delayed_items(struct btrfs_trans_handle *trans,
 111                            struct btrfs_root *root);
 112int btrfs_run_delayed_items_nr(struct btrfs_trans_handle *trans,
 113                               struct btrfs_root *root, int nr);
 114
 115void btrfs_balance_delayed_items(struct btrfs_root *root);
 116
 117int btrfs_commit_inode_delayed_items(struct btrfs_trans_handle *trans,
 118                                     struct inode *inode);
 119/* Used for evicting the inode. */
 120void btrfs_remove_delayed_node(struct inode *inode);
 121void btrfs_kill_delayed_inode_items(struct inode *inode);
 122int btrfs_commit_inode_delayed_inode(struct inode *inode);
 123
 124
 125int btrfs_delayed_update_inode(struct btrfs_trans_handle *trans,
 126                               struct btrfs_root *root, struct inode *inode);
 127int btrfs_fill_inode(struct inode *inode, u32 *rdev);
 128
 129/* Used for drop dead root */
 130void btrfs_kill_all_delayed_nodes(struct btrfs_root *root);
 131
 132/* Used for clean the transaction */
 133void btrfs_destroy_delayed_inodes(struct btrfs_root *root);
 134
 135/* Used for readdir() */
 136void btrfs_get_delayed_items(struct inode *inode, struct list_head *ins_list,
 137                             struct list_head *del_list);
 138void btrfs_put_delayed_items(struct list_head *ins_list,
 139                             struct list_head *del_list);
 140int btrfs_should_delete_dir_index(struct list_head *del_list,
 141                                  u64 index);
 142int btrfs_readdir_delayed_dir_index(struct dir_context *ctx,
 143                                    struct list_head *ins_list);
 144
 145/* for init */
 146int __init btrfs_delayed_inode_init(void);
 147void btrfs_delayed_inode_exit(void);
 148
 149/* for debugging */
 150void btrfs_assert_delayed_root_empty(struct btrfs_root *root);
 151
 152#endif
 153