fs/btrfs/disk-io.c

   1 #define _XOPEN_SOURCE 500
   2 #include <stdio.h>
   3 #include <stdlib.h>
   4 #include <sys/types.h>
   5 #include <sys/stat.h>
   6 #include <fcntl.h>
   7 #include <unistd.h>
   8 #include "kerncompat.h"
   9 #include "radix-tree.h"
  10 #include "ctree.h"
  11 #include "disk-io.h"
  12
  13 static int allocated_blocks = 0;
  14 int cache_size = 0;
  15 int cache_max = 10000;
  16
  17 static int check_tree_block(struct ctree_root *root, struct tree_buffer *buf)
  18 {
  19         if (buf->blocknr != buf->node.header.blocknr)
  20                 BUG();
  21         if (root->node && buf->node.header.parentid != root->node->node.header.parentid)
  22                 BUG();
  23         return 0;
  24 }
  25
  26 static int free_some_buffers(struct ctree_root *root)
  27 {
  28         struct list_head *node, *next;
  29         struct tree_buffer *b;
  30         if (root->cache_size < cache_max)
  31                 return 0;
  32         list_for_each_safe(node, next, &root->cache) {
  33                 b = list_entry(node, struct tree_buffer, cache);
  34                 if (b->count == 1) {
  35                         BUG_ON(!list_empty(&b->dirty));
  36                         list_del_init(&b->cache);
  37                         tree_block_release(root, b);
  38                         if (root->cache_size < cache_max)
  39                                 return 0;
  40                 }
  41         }
  42         return 0;
  43 }
  44
  45 struct tree_buffer *alloc_tree_block(struct ctree_root *root, u64 blocknr)
  46 {
  47         struct tree_buffer *buf;
  48         int ret;
  49         buf = malloc(sizeof(struct tree_buffer));
  50         if (!buf)
  51                 return buf;
  52         allocated_blocks++;
  53         buf->blocknr = blocknr;
  54         buf->count = 2;
  55         INIT_LIST_HEAD(&buf->dirty);
  56         free_some_buffers(root);
  57         radix_tree_preload(GFP_KERNEL);
  58         ret = radix_tree_insert(&root->cache_radix, blocknr, buf);
  59         radix_tree_preload_end();
  60         list_add_tail(&buf->cache, &root->cache);
  61         root->cache_size++;
  62         if (ret) {
  63                 free(buf);
  64                 return NULL;
  65         }
  66         return buf;
  67 }
  68
  69 struct tree_buffer *find_tree_block(struct ctree_root *root, u64 blocknr)
  70 {
  71         struct tree_buffer *buf;
  72         buf = radix_tree_lookup(&root->cache_radix, blocknr);
  73         if (buf) {
  74                 buf->count++;
  75         } else {
  76                 buf = alloc_tree_block(root, blocknr);
  77                 if (!buf) {
  78                         BUG();
  79                         return NULL;
  80                 }
  81         }
  82         return buf;
  83 }
  84
  85 struct tree_buffer *read_tree_block(struct ctree_root *root, u64 blocknr)
  86 {
  87         loff_t offset = blocknr * CTREE_BLOCKSIZE;
  88         struct tree_buffer *buf;
  89         int ret;
  90
  91         buf = radix_tree_lookup(&root->cache_radix, blocknr);
  92         if (buf) {
  93                 buf->count++;
  94         } else {
  95                 buf = alloc_tree_block(root, blocknr);
  96                 if (!buf)
  97                         return NULL;
  98                 ret = pread(root->fp, &buf->node, CTREE_BLOCKSIZE, offset);
  99                 if (ret != CTREE_BLOCKSIZE) {
 100                         free(buf);
 101                         return NULL;
 102                 }
 103         }
 104         if (check_tree_block(root, buf))
 105                 BUG();
 106         return buf;
 107 }
 108
 109 int dirty_tree_block(struct ctree_root *root, struct tree_buffer *buf)
 110 {
 111         if (!list_empty(&buf->dirty))
 112                 return 0;
 113         list_add_tail(&buf->dirty, &root->trans);
 114         buf->count++;
 115         return 0;
 116 }
 117
 118 int clean_tree_block(struct ctree_root *root, struct tree_buffer *buf)
 119 {
 120         if (!list_empty(&buf->dirty)) {
 121                 list_del_init(&buf->dirty);
 122                 tree_block_release(root, buf);
 123         }
 124         return 0;
 125 }
 126
 127 int write_tree_block(struct ctree_root *root, struct tree_buffer *buf)
 128 {
 129         u64 blocknr = buf->blocknr;
 130         loff_t offset = blocknr * CTREE_BLOCKSIZE;
 131         int ret;
 132
 133         if (buf->blocknr != buf->node.header.blocknr)
 134                 BUG();
 135         ret = pwrite(root->fp, &buf->node, CTREE_BLOCKSIZE, offset);
 136         if (ret != CTREE_BLOCKSIZE)
 137                 return ret;
 138         return 0;
 139 }
 140
 141 static int __commit_transaction(struct ctree_root *root)
 142 {
 143         struct tree_buffer *b;
 144         int ret = 0;
 145         int wret;
 146         while(!list_empty(&root->trans)) {
 147                 b = list_entry(root->trans.next, struct tree_buffer, dirty);
 148                 list_del_init(&b->dirty);
 149                 wret = write_tree_block(root, b);
 150                 if (wret)
 151                         ret = wret;
 152                 tree_block_release(root, b);
 153         }
 154         return ret;
 155 }
 156
 157 int commit_transaction(struct ctree_root *root)
 158 {
 159         int ret;
 160         ret = __commit_transaction(root);
 161         if (!ret && root != root->extent_root)
 162                 ret = __commit_transaction(root->extent_root);
 163         BUG_ON(ret);
 164         return ret;
 165 }
 166
 167 static int __setup_root(struct ctree_root *root, struct ctree_root *extent_root,
 168                         struct ctree_root_info *info, int fp)
 169 {
 170         INIT_LIST_HEAD(&root->trans);
 171         INIT_LIST_HEAD(&root->cache);
 172         root->fp = fp;
 173         root->node = NULL;
 174         root->node = read_tree_block(root, info->tree_root);
 175         root->extent_root = extent_root;
 176         return 0;
 177 }
 178
 179 struct ctree_root *open_ctree(char *filename, struct ctree_super_block *super)
 180 {
 181         struct ctree_root *root = malloc(sizeof(struct ctree_root));
 182         struct ctree_root *extent_root = malloc(sizeof(struct ctree_root));
 183         int fp;
 184         int ret;
 185
 186         fp = open(filename, O_CREAT | O_RDWR, 0600);
 187         if (fp < 0) {
 188                 free(root);
 189                 return NULL;
 190         }
 191         INIT_RADIX_TREE(&root->cache_radix, GFP_KERNEL);
 192         INIT_RADIX_TREE(&extent_root->cache_radix, GFP_KERNEL);
 193         ret = pread(fp, super, sizeof(struct ctree_super_block),
 194                      CTREE_SUPER_INFO_OFFSET(CTREE_BLOCKSIZE));
 195         if (ret == 0 || super->root_info.tree_root == 0) {
 196                 printf("making new FS!\n");
 197                 ret = mkfs(fp);
 198                 if (ret)
 199                         return NULL;
 200                 ret = pread(fp, super, sizeof(struct ctree_super_block),
 201                              CTREE_SUPER_INFO_OFFSET(CTREE_BLOCKSIZE));
 202                 if (ret != sizeof(struct ctree_super_block))
 203                         return NULL;
 204         }
 205         BUG_ON(ret < 0);
 206         __setup_root(root, extent_root, &super->root_info, fp);
 207         __setup_root(extent_root, extent_root, &super->extent_info, fp);
 208         return root;
 209 }
 210
 211 static int __update_root(struct ctree_root *root, struct ctree_root_info *info)
 212 {
 213         info->tree_root = root->node->blocknr;
 214         return 0;
 215 }
 216
 217 int write_ctree_super(struct ctree_root *root, struct ctree_super_block *s)
 218 {
 219         int ret;
 220         __update_root(root, &s->root_info);
 221         __update_root(root->extent_root, &s->extent_info);
 222         ret = pwrite(root->fp, s, sizeof(*s), CTREE_SUPER_INFO_OFFSET(CTREE_BLOCKSIZE));
 223         if (ret != sizeof(*s)) {
 224                 fprintf(stderr, "failed to write new super block err %d\n", ret);
 225                 return ret;
 226         }
 227         return 0;
 228 }
 229
 230 static int drop_cache(struct ctree_root *root)
 231 {
 232         while(!list_empty(&root->cache)) {
 233                 struct tree_buffer *b = list_entry(root->cache.next,
 234                                                    struct tree_buffer, cache);
 235                 list_del_init(&b->cache);
 236                 tree_block_release(root, b);
 237         }
 238         return 0;
 239 }
 240 int close_ctree(struct ctree_root *root)
 241 {
 242         drop_cache(root->extent_root);
 243         drop_cache(root);
 244         BUG_ON(!list_empty(&root->trans));
 245         BUG_ON(!list_empty(&root->extent_root->trans));
 246
 247         close(root->fp);
 248         if (root->node)
 249                 tree_block_release(root, root->node);
 250         if (root->extent_root->node)
 251                 tree_block_release(root->extent_root, root->extent_root->node);
 252         free(root);
 253         printf("on close %d blocks are allocated\n", allocated_blocks);
 254         return 0;
 255 }
 256
 257 void tree_block_release(struct ctree_root *root, struct tree_buffer *buf)
 258 {
 259         buf->count--;
 260         if (buf->count < 0)
 261                 BUG();
 262         if (buf->count == 0) {
 263                 if (!radix_tree_lookup(&root->cache_radix, buf->blocknr))
 264                         BUG();
 265                 radix_tree_delete(&root->cache_radix, buf->blocknr);
 266                 memset(buf, 0, sizeof(*buf));
 267                 free(buf);
 268                 BUG_ON(allocated_blocks == 0);
 269                 allocated_blocks--;
 270                 BUG_ON(root->cache_size == 0);
 271                 root->cache_size--;
 272         }
 273 }
 274