]> bbs.cooldavid.org Git - net-next-2.6.git/blame - fs/btrfs/inode-item.c
Btrfs: Add lowest key information to back refs for extent tree blocks as well.
[net-next-2.6.git] / fs / btrfs / inode-item.c
CommitLineData
6cbd5570
CM
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
1e1d2701
CM
19#include "ctree.h"
20#include "disk-io.h"
e089f05c 21#include "transaction.h"
1e1d2701 22
5f39d397
CM
23int btrfs_insert_empty_inode(struct btrfs_trans_handle *trans,
24 struct btrfs_root *root,
25 struct btrfs_path *path, u64 objectid)
1e1d2701 26{
1e1d2701
CM
27 struct btrfs_key key;
28 int ret;
29 key.objectid = objectid;
1e1d2701
CM
30 btrfs_set_key_type(&key, BTRFS_INODE_ITEM_KEY);
31 key.offset = 0;
32
5f39d397
CM
33 ret = btrfs_insert_empty_item(trans, root, path, &key,
34 sizeof(struct btrfs_inode_item));
1b05da2e
CM
35 if (ret == 0 && objectid > root->highest_inode)
36 root->highest_inode = objectid;
1e1d2701
CM
37 return ret;
38}
39
e089f05c 40int btrfs_lookup_inode(struct btrfs_trans_handle *trans, struct btrfs_root
d6e4a428
CM
41 *root, struct btrfs_path *path,
42 struct btrfs_key *location, int mod)
1e1d2701 43{
1e1d2701
CM
44 int ins_len = mod < 0 ? -1 : 0;
45 int cow = mod != 0;
d6e4a428
CM
46 int ret;
47 int slot;
5f39d397 48 struct extent_buffer *leaf;
d6e4a428 49 struct btrfs_key found_key;
1e1d2701 50
d6e4a428
CM
51 ret = btrfs_search_slot(trans, root, location, path, ins_len, cow);
52 if (ret > 0 && btrfs_key_type(location) == BTRFS_ROOT_ITEM_KEY &&
53 location->offset == (u64)-1 && path->slots[0] != 0) {
54 slot = path->slots[0] - 1;
5f39d397
CM
55 leaf = path->nodes[0];
56 btrfs_item_key_to_cpu(leaf, &found_key, slot);
d6e4a428
CM
57 if (found_key.objectid == location->objectid &&
58 btrfs_key_type(&found_key) == btrfs_key_type(location)) {
59 path->slots[0]--;
60 return 0;
61 }
62 }
63 return ret;
1e1d2701 64}