2 * Copyright (C) 2007 Oracle. All rights reserved.
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.
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.
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.
21 #include "transaction.h"
23 int btrfs_insert_empty_inode(struct btrfs_trans_handle *trans,
24 struct btrfs_root *root,
25 struct btrfs_path *path, u64 objectid)
29 key.objectid = objectid;
30 btrfs_set_key_type(&key, BTRFS_INODE_ITEM_KEY);
33 ret = btrfs_insert_empty_item(trans, root, path, &key,
34 sizeof(struct btrfs_inode_item));
35 if (ret == 0 && objectid > root->highest_inode)
36 root->highest_inode = objectid;
40 int btrfs_lookup_inode(struct btrfs_trans_handle *trans, struct btrfs_root
41 *root, struct btrfs_path *path,
42 struct btrfs_key *location, int mod)
44 int ins_len = mod < 0 ? -1 : 0;
48 struct extent_buffer *leaf;
49 struct btrfs_key found_key;
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;
55 leaf = path->nodes[0];
56 btrfs_item_key_to_cpu(leaf, &found_key, slot);
57 if (found_key.objectid == location->objectid &&
58 btrfs_key_type(&found_key) == btrfs_key_type(location)) {