Commit | Line | Data |
---|---|---|
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 | ||
9f5fae2f CM |
19 | #include "ctree.h" |
20 | #include "disk-io.h" | |
21 | #include "transaction.h" | |
22 | ||
1b05da2e | 23 | int btrfs_find_highest_inode(struct btrfs_root *root, u64 *objectid) |
5be6f7f1 CM |
24 | { |
25 | struct btrfs_path *path; | |
26 | int ret; | |
5f39d397 | 27 | struct extent_buffer *l; |
5be6f7f1 | 28 | struct btrfs_key search_key; |
5f39d397 | 29 | struct btrfs_key found_key; |
5be6f7f1 CM |
30 | int slot; |
31 | ||
32 | path = btrfs_alloc_path(); | |
33 | BUG_ON(!path); | |
34 | ||
6527cdbe ZY |
35 | search_key.objectid = BTRFS_LAST_FREE_OBJECTID; |
36 | search_key.type = -1; | |
5be6f7f1 CM |
37 | search_key.offset = (u64)-1; |
38 | ret = btrfs_search_slot(NULL, root, &search_key, path, 0, 0); | |
39 | if (ret < 0) | |
40 | goto error; | |
41 | BUG_ON(ret == 0); | |
42 | if (path->slots[0] > 0) { | |
43 | slot = path->slots[0] - 1; | |
5f39d397 CM |
44 | l = path->nodes[0]; |
45 | btrfs_item_key_to_cpu(l, &found_key, slot); | |
13a8a7c8 YZ |
46 | *objectid = max_t(u64, found_key.objectid, |
47 | BTRFS_FIRST_FREE_OBJECTID - 1); | |
5be6f7f1 | 48 | } else { |
13a8a7c8 | 49 | *objectid = BTRFS_FIRST_FREE_OBJECTID - 1; |
5be6f7f1 CM |
50 | } |
51 | ret = 0; | |
52 | error: | |
53 | btrfs_free_path(path); | |
54 | return ret; | |
55 | } | |
56 | ||
9f5fae2f | 57 | int btrfs_find_free_objectid(struct btrfs_trans_handle *trans, |
1b05da2e | 58 | struct btrfs_root *root, |
9f5fae2f CM |
59 | u64 dirid, u64 *objectid) |
60 | { | |
9f5fae2f | 61 | int ret; |
a2135011 | 62 | mutex_lock(&root->objectid_mutex); |
9f5fae2f | 63 | |
13a8a7c8 YZ |
64 | if (unlikely(root->highest_objectid < BTRFS_FIRST_FREE_OBJECTID)) { |
65 | ret = btrfs_find_highest_inode(root, &root->highest_objectid); | |
66 | if (ret) | |
67 | goto out; | |
68 | } | |
5b21f2ed | 69 | |
13a8a7c8 YZ |
70 | if (unlikely(root->highest_objectid >= BTRFS_LAST_FREE_OBJECTID)) { |
71 | ret = -ENOSPC; | |
72 | goto out; | |
9f5fae2f | 73 | } |
13a8a7c8 YZ |
74 | |
75 | *objectid = ++root->highest_objectid; | |
76 | ret = 0; | |
77 | out: | |
a2135011 | 78 | mutex_unlock(&root->objectid_mutex); |
9f5fae2f CM |
79 | return ret; |
80 | } |