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.
22 #include "transaction.h"
24 static struct btrfs_dir_item
*insert_with_overflow(struct btrfs_trans_handle
26 struct btrfs_root
*root
,
27 struct btrfs_path
*path
,
28 struct btrfs_key
*cpu_key
,
35 struct btrfs_item
*item
;
36 struct extent_buffer
*leaf
;
38 ret
= btrfs_insert_empty_item(trans
, root
, path
, cpu_key
, data_size
);
40 struct btrfs_dir_item
*di
;
41 di
= btrfs_match_dir_item_name(root
, path
, name
, name_len
);
43 return ERR_PTR(-EEXIST
);
44 ret
= btrfs_extend_item(trans
, root
, path
, data_size
);
52 leaf
= path
->nodes
[0];
53 item
= btrfs_item_nr(leaf
, path
->slots
[0]);
54 ptr
= btrfs_item_ptr(leaf
, path
->slots
[0], char);
55 BUG_ON(data_size
> btrfs_item_size(leaf
, item
));
56 ptr
+= btrfs_item_size(leaf
, item
) - data_size
;
57 return (struct btrfs_dir_item
*)ptr
;
60 int btrfs_insert_dir_item(struct btrfs_trans_handle
*trans
, struct btrfs_root
61 *root
, const char *name
, int name_len
, u64 dir
,
62 struct btrfs_key
*location
, u8 type
)
66 struct btrfs_path
*path
;
67 struct btrfs_dir_item
*dir_item
;
68 struct extent_buffer
*leaf
;
69 unsigned long name_ptr
;
71 struct btrfs_disk_key disk_key
;
75 btrfs_set_key_type(&key
, BTRFS_DIR_ITEM_KEY
);
76 ret
= btrfs_name_hash(name
, name_len
, &key
.offset
);
78 path
= btrfs_alloc_path();
79 data_size
= sizeof(*dir_item
) + name_len
;
80 dir_item
= insert_with_overflow(trans
, root
, path
, &key
, data_size
,
82 if (IS_ERR(dir_item
)) {
83 ret
= PTR_ERR(dir_item
);
89 leaf
= path
->nodes
[0];
90 btrfs_cpu_key_to_disk(&disk_key
, location
);
91 btrfs_set_dir_item_key(leaf
, dir_item
, &disk_key
);
92 btrfs_set_dir_type(leaf
, dir_item
, type
);
93 btrfs_set_dir_flags(leaf
, dir_item
, 0);
94 btrfs_set_dir_name_len(leaf
, dir_item
, name_len
);
95 name_ptr
= (unsigned long)(dir_item
+ 1);
97 write_extent_buffer(leaf
, name
, name_ptr
, name_len
);
98 btrfs_mark_buffer_dirty(leaf
);
101 /* FIXME, use some real flag for selecting the extra index */
102 if (root
== root
->fs_info
->tree_root
) {
106 btrfs_release_path(root
, path
);
108 btrfs_set_key_type(&key
, BTRFS_DIR_INDEX_KEY
);
109 key
.offset
= location
->objectid
;
110 dir_item
= insert_with_overflow(trans
, root
, path
, &key
, data_size
,
112 if (IS_ERR(dir_item
)) {
113 ret2
= PTR_ERR(dir_item
);
116 leaf
= path
->nodes
[0];
117 btrfs_cpu_key_to_disk(&disk_key
, location
);
118 btrfs_set_dir_item_key(leaf
, dir_item
, &disk_key
);
119 btrfs_set_dir_type(leaf
, dir_item
, type
);
120 btrfs_set_dir_flags(leaf
, dir_item
, 0);
121 btrfs_set_dir_name_len(leaf
, dir_item
, name_len
);
122 name_ptr
= (unsigned long)(dir_item
+ 1);
123 write_extent_buffer(leaf
, name
, name_ptr
, name_len
);
124 btrfs_mark_buffer_dirty(leaf
);
126 btrfs_free_path(path
);
134 struct btrfs_dir_item
*btrfs_lookup_dir_item(struct btrfs_trans_handle
*trans
,
135 struct btrfs_root
*root
,
136 struct btrfs_path
*path
, u64 dir
,
137 const char *name
, int name_len
,
141 struct btrfs_key key
;
142 int ins_len
= mod
< 0 ? -1 : 0;
144 struct btrfs_key found_key
;
145 struct extent_buffer
*leaf
;
148 btrfs_set_key_type(&key
, BTRFS_DIR_ITEM_KEY
);
150 ret
= btrfs_name_hash(name
, name_len
, &key
.offset
);
153 ret
= btrfs_search_slot(trans
, root
, &key
, path
, ins_len
, cow
);
157 if (path
->slots
[0] == 0)
162 leaf
= path
->nodes
[0];
163 btrfs_item_key_to_cpu(leaf
, &found_key
, path
->slots
[0]);
165 if (found_key
.objectid
!= dir
||
166 btrfs_key_type(&found_key
) != BTRFS_DIR_ITEM_KEY
||
167 found_key
.offset
!= key
.offset
)
170 return btrfs_match_dir_item_name(root
, path
, name
, name_len
);
173 struct btrfs_dir_item
*
174 btrfs_lookup_dir_index_item(struct btrfs_trans_handle
*trans
,
175 struct btrfs_root
*root
,
176 struct btrfs_path
*path
, u64 dir
,
177 u64 objectid
, const char *name
, int name_len
,
181 struct btrfs_key key
;
182 int ins_len
= mod
< 0 ? -1 : 0;
186 btrfs_set_key_type(&key
, BTRFS_DIR_INDEX_KEY
);
187 key
.offset
= objectid
;
189 ret
= btrfs_search_slot(trans
, root
, &key
, path
, ins_len
, cow
);
193 return ERR_PTR(-ENOENT
);
194 return btrfs_match_dir_item_name(root
, path
, name
, name_len
);
197 struct btrfs_dir_item
*btrfs_match_dir_item_name(struct btrfs_root
*root
,
198 struct btrfs_path
*path
,
199 const char *name
, int name_len
)
201 struct btrfs_dir_item
*dir_item
;
202 unsigned long name_ptr
;
206 struct extent_buffer
*leaf
;
208 leaf
= path
->nodes
[0];
209 dir_item
= btrfs_item_ptr(leaf
, path
->slots
[0], struct btrfs_dir_item
);
210 total_len
= btrfs_item_size_nr(leaf
, path
->slots
[0]);
211 while(cur
< total_len
) {
212 this_len
= sizeof(*dir_item
) +
213 btrfs_dir_name_len(leaf
, dir_item
);
214 name_ptr
= (unsigned long)(dir_item
+ 1);
216 if (btrfs_dir_name_len(leaf
, dir_item
) == name_len
&&
217 memcmp_extent_buffer(leaf
, name
, name_ptr
, name_len
) == 0)
221 dir_item
= (struct btrfs_dir_item
*)((char *)dir_item
+
227 int btrfs_delete_one_dir_name(struct btrfs_trans_handle
*trans
,
228 struct btrfs_root
*root
,
229 struct btrfs_path
*path
,
230 struct btrfs_dir_item
*di
)
233 struct extent_buffer
*leaf
;
238 leaf
= path
->nodes
[0];
239 sub_item_len
= sizeof(*di
) + btrfs_dir_name_len(leaf
, di
);
240 item_len
= btrfs_item_size_nr(leaf
, path
->slots
[0]);
241 if (sub_item_len
== item_len
) {
242 ret
= btrfs_del_item(trans
, root
, path
);
245 unsigned long ptr
= (unsigned long)di
;
248 start
= btrfs_item_ptr_offset(leaf
, path
->slots
[0]);
249 memmove_extent_buffer(leaf
, ptr
, ptr
+ sub_item_len
,
250 item_len
- (ptr
+ sub_item_len
- start
));
251 ret
= btrfs_truncate_item(trans
, root
, path
,
252 item_len
- sub_item_len
);
This page took 0.036431 seconds and 5 git commands to generate.