blob: c05a08f4c4111fdfa4157e9447005523f256fb67 [file] [log] [blame]
Chris Mason6cbd5572007-06-12 09:07:21 -04001/*
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
Chris Mason9f5fae22007-03-20 14:38:32 -040019#include "ctree.h"
20#include "disk-io.h"
21#include "transaction.h"
22
Chris Mason1b05da22007-04-10 12:13:09 -040023int btrfs_find_highest_inode(struct btrfs_root *root, u64 *objectid)
Chris Mason5be6f7f2007-04-05 13:35:25 -040024{
25 struct btrfs_path *path;
26 int ret;
Chris Mason5f39d392007-10-15 16:14:19 -040027 struct extent_buffer *l;
Chris Mason5be6f7f2007-04-05 13:35:25 -040028 struct btrfs_key search_key;
Chris Mason5f39d392007-10-15 16:14:19 -040029 struct btrfs_key found_key;
Chris Mason5be6f7f2007-04-05 13:35:25 -040030 int slot;
31
32 path = btrfs_alloc_path();
Tsutomu Itohdb5b4932011-03-23 08:14:16 +000033 if (!path)
34 return -ENOMEM;
Chris Mason5be6f7f2007-04-05 13:35:25 -040035
Zheng Yan6527cdb2008-09-05 16:43:53 -040036 search_key.objectid = BTRFS_LAST_FREE_OBJECTID;
37 search_key.type = -1;
Chris Mason5be6f7f2007-04-05 13:35:25 -040038 search_key.offset = (u64)-1;
39 ret = btrfs_search_slot(NULL, root, &search_key, path, 0, 0);
40 if (ret < 0)
41 goto error;
42 BUG_ON(ret == 0);
43 if (path->slots[0] > 0) {
44 slot = path->slots[0] - 1;
Chris Mason5f39d392007-10-15 16:14:19 -040045 l = path->nodes[0];
46 btrfs_item_key_to_cpu(l, &found_key, slot);
Yan, Zheng13a8a7c2009-09-21 15:56:00 -040047 *objectid = max_t(u64, found_key.objectid,
48 BTRFS_FIRST_FREE_OBJECTID - 1);
Chris Mason5be6f7f2007-04-05 13:35:25 -040049 } else {
Yan, Zheng13a8a7c2009-09-21 15:56:00 -040050 *objectid = BTRFS_FIRST_FREE_OBJECTID - 1;
Chris Mason5be6f7f2007-04-05 13:35:25 -040051 }
52 ret = 0;
53error:
54 btrfs_free_path(path);
55 return ret;
56}
57
Chris Mason9f5fae22007-03-20 14:38:32 -040058int btrfs_find_free_objectid(struct btrfs_trans_handle *trans,
Chris Mason1b05da22007-04-10 12:13:09 -040059 struct btrfs_root *root,
Chris Mason9f5fae22007-03-20 14:38:32 -040060 u64 dirid, u64 *objectid)
61{
Chris Mason9f5fae22007-03-20 14:38:32 -040062 int ret;
Chris Masona2135012008-06-25 16:01:30 -040063 mutex_lock(&root->objectid_mutex);
Yan, Zheng13a8a7c2009-09-21 15:56:00 -040064
65 if (unlikely(root->highest_objectid < BTRFS_FIRST_FREE_OBJECTID)) {
66 ret = btrfs_find_highest_inode(root, &root->highest_objectid);
67 if (ret)
68 goto out;
Chris Masona2135012008-06-25 16:01:30 -040069 }
Chris Masonb1a4d962007-04-04 15:27:52 -040070
Yan, Zheng13a8a7c2009-09-21 15:56:00 -040071 if (unlikely(root->highest_objectid >= BTRFS_LAST_FREE_OBJECTID)) {
72 ret = -ENOSPC;
73 goto out;
Chris Mason9f5fae22007-03-20 14:38:32 -040074 }
Yan, Zheng13a8a7c2009-09-21 15:56:00 -040075
76 *objectid = ++root->highest_objectid;
77 ret = 0;
78out:
Chris Masona2135012008-06-25 16:01:30 -040079 mutex_unlock(&root->objectid_mutex);
Chris Mason9f5fae22007-03-20 14:38:32 -040080 return ret;
81}