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_find_highest_inode(struct btrfs_root
*root
, u64
*objectid
)
25 struct btrfs_path
*path
;
27 struct extent_buffer
*l
;
28 struct btrfs_key search_key
;
29 struct btrfs_key found_key
;
32 path
= btrfs_alloc_path();
35 search_key
.objectid
= (u64
)-1;
36 search_key
.offset
= (u64
)-1;
37 ret
= btrfs_search_slot(NULL
, root
, &search_key
, path
, 0, 0);
41 if (path
->slots
[0] > 0) {
42 slot
= path
->slots
[0] - 1;
44 btrfs_item_key_to_cpu(l
, &found_key
, slot
);
45 *objectid
= found_key
.objectid
;
47 *objectid
= BTRFS_FIRST_FREE_OBJECTID
;
51 btrfs_free_path(path
);
56 * walks the btree of allocated inodes and find a hole.
58 int btrfs_find_free_objectid(struct btrfs_trans_handle
*trans
,
59 struct btrfs_root
*root
,
60 u64 dirid
, u64
*objectid
)
62 struct btrfs_path
*path
;
68 struct extent_buffer
*l
;
69 struct btrfs_key search_key
;
70 u64 search_start
= dirid
;
72 path
= btrfs_alloc_path();
74 search_start
= root
->last_inode_alloc
;
75 search_start
= max(search_start
, BTRFS_FIRST_FREE_OBJECTID
);
76 search_key
.objectid
= search_start
;
77 search_key
.offset
= 0;
79 btrfs_init_path(path
);
81 ret
= btrfs_search_slot(trans
, root
, &search_key
, path
, 0, 0);
85 if (path
->slots
[0] > 0)
90 slot
= path
->slots
[0];
91 if (slot
>= btrfs_header_nritems(l
)) {
92 ret
= btrfs_next_leaf(root
, path
);
98 *objectid
= search_start
;
102 *objectid
= last_ino
> search_start
?
103 last_ino
: search_start
;
106 btrfs_item_key_to_cpu(l
, &key
, slot
);
107 if (key
.objectid
>= search_start
) {
109 if (last_ino
< search_start
)
110 last_ino
= search_start
;
111 if (key
.objectid
> last_ino
) {
112 *objectid
= last_ino
;
118 last_ino
= key
.objectid
+ 1;
123 root
->last_inode_alloc
= *objectid
;
124 btrfs_release_path(root
, path
);
125 btrfs_free_path(path
);
126 BUG_ON(*objectid
< search_start
);
129 btrfs_release_path(root
, path
);
130 btrfs_free_path(path
);