diff options
Diffstat (limited to 'fs/btrfs/inode-item.c')
-rw-r--r-- | fs/btrfs/inode-item.c | 136 |
1 files changed, 136 insertions, 0 deletions
diff --git a/fs/btrfs/inode-item.c b/fs/btrfs/inode-item.c index 35d2608f8918..cba30b6cc6fe 100644 --- a/fs/btrfs/inode-item.c +++ b/fs/btrfs/inode-item.c | |||
@@ -20,6 +20,142 @@ | |||
20 | #include "disk-io.h" | 20 | #include "disk-io.h" |
21 | #include "transaction.h" | 21 | #include "transaction.h" |
22 | 22 | ||
23 | int find_name_in_backref(struct btrfs_path *path, const char * name, | ||
24 | int name_len, struct btrfs_inode_ref **ref_ret) | ||
25 | { | ||
26 | struct extent_buffer *leaf; | ||
27 | struct btrfs_inode_ref *ref; | ||
28 | unsigned long ptr; | ||
29 | unsigned long name_ptr; | ||
30 | u32 item_size; | ||
31 | u32 cur_offset = 0; | ||
32 | int len; | ||
33 | |||
34 | leaf = path->nodes[0]; | ||
35 | item_size = btrfs_item_size_nr(leaf, path->slots[0]); | ||
36 | ptr = btrfs_item_ptr_offset(leaf, path->slots[0]); | ||
37 | while (cur_offset < item_size) { | ||
38 | ref = (struct btrfs_inode_ref *)(ptr + cur_offset); | ||
39 | len = btrfs_inode_ref_name_len(leaf, ref); | ||
40 | name_ptr = (unsigned long)(ref + 1); | ||
41 | cur_offset += len + sizeof(*ref); | ||
42 | if (len != name_len) | ||
43 | continue; | ||
44 | if (memcmp_extent_buffer(leaf, name, name_ptr, name_len) == 0) { | ||
45 | *ref_ret = ref; | ||
46 | return 1; | ||
47 | } | ||
48 | } | ||
49 | return 0; | ||
50 | } | ||
51 | |||
52 | int btrfs_del_inode_ref(struct btrfs_trans_handle *trans, | ||
53 | struct btrfs_root *root, | ||
54 | const char *name, int name_len, | ||
55 | u64 inode_objectid, u64 ref_objectid) | ||
56 | { | ||
57 | struct btrfs_path *path; | ||
58 | struct btrfs_key key; | ||
59 | struct btrfs_inode_ref *ref; | ||
60 | struct extent_buffer *leaf; | ||
61 | unsigned long ptr; | ||
62 | unsigned long item_start; | ||
63 | u32 item_size; | ||
64 | u32 sub_item_len; | ||
65 | int ret; | ||
66 | int del_len = name_len + sizeof(*ref); | ||
67 | |||
68 | key.objectid = inode_objectid; | ||
69 | key.offset = ref_objectid; | ||
70 | btrfs_set_key_type(&key, BTRFS_INODE_REF_KEY); | ||
71 | |||
72 | path = btrfs_alloc_path(); | ||
73 | if (!path) | ||
74 | return -ENOMEM; | ||
75 | |||
76 | ret = btrfs_search_slot(trans, root, &key, path, -1, 1); | ||
77 | if (ret > 0) { | ||
78 | ret = -ENOENT; | ||
79 | goto out; | ||
80 | } else if (ret < 0) { | ||
81 | goto out; | ||
82 | } | ||
83 | if (!find_name_in_backref(path, name, name_len, &ref)) { | ||
84 | ret = -ENOENT; | ||
85 | goto out; | ||
86 | } | ||
87 | leaf = path->nodes[0]; | ||
88 | item_size = btrfs_item_size_nr(leaf, path->slots[0]); | ||
89 | if (del_len == item_size) { | ||
90 | ret = btrfs_del_item(trans, root, path); | ||
91 | goto out; | ||
92 | } | ||
93 | ptr = (unsigned long)ref; | ||
94 | sub_item_len = name_len + sizeof(*ref); | ||
95 | item_start = btrfs_item_ptr_offset(leaf, path->slots[0]); | ||
96 | memmove_extent_buffer(leaf, ptr, ptr + sub_item_len, | ||
97 | item_size - (ptr + sub_item_len - item_start)); | ||
98 | ret = btrfs_truncate_item(trans, root, path, | ||
99 | item_size - sub_item_len, 1); | ||
100 | BUG_ON(ret); | ||
101 | out: | ||
102 | btrfs_free_path(path); | ||
103 | return ret; | ||
104 | } | ||
105 | |||
106 | int btrfs_insert_inode_ref(struct btrfs_trans_handle *trans, | ||
107 | struct btrfs_root *root, | ||
108 | const char *name, int name_len, | ||
109 | u64 inode_objectid, u64 ref_objectid) | ||
110 | { | ||
111 | struct btrfs_path *path; | ||
112 | struct btrfs_key key; | ||
113 | struct btrfs_inode_ref *ref; | ||
114 | unsigned long ptr; | ||
115 | int ret; | ||
116 | int ins_len = name_len + sizeof(*ref); | ||
117 | |||
118 | key.objectid = inode_objectid; | ||
119 | key.offset = ref_objectid; | ||
120 | btrfs_set_key_type(&key, BTRFS_INODE_REF_KEY); | ||
121 | |||
122 | path = btrfs_alloc_path(); | ||
123 | if (!path) | ||
124 | return -ENOMEM; | ||
125 | |||
126 | ret = btrfs_insert_empty_item(trans, root, path, &key, | ||
127 | ins_len); | ||
128 | if (ret == -EEXIST) { | ||
129 | u32 old_size; | ||
130 | |||
131 | if (find_name_in_backref(path, name, name_len, &ref)) | ||
132 | goto out; | ||
133 | |||
134 | old_size = btrfs_item_size_nr(path->nodes[0], path->slots[0]); | ||
135 | ret = btrfs_extend_item(trans, root, path, ins_len); | ||
136 | BUG_ON(ret); | ||
137 | ref = btrfs_item_ptr(path->nodes[0], path->slots[0], | ||
138 | struct btrfs_inode_ref); | ||
139 | ref = (struct btrfs_inode_ref *)((unsigned long)ref + old_size); | ||
140 | btrfs_set_inode_ref_name_len(path->nodes[0], ref, name_len); | ||
141 | ptr = (unsigned long)(ref + 1); | ||
142 | ret = 0; | ||
143 | } else if (ret < 0) { | ||
144 | goto out; | ||
145 | } else { | ||
146 | ref = btrfs_item_ptr(path->nodes[0], path->slots[0], | ||
147 | struct btrfs_inode_ref); | ||
148 | btrfs_set_inode_ref_name_len(path->nodes[0], ref, name_len); | ||
149 | ptr = (unsigned long)(ref + 1); | ||
150 | } | ||
151 | write_extent_buffer(path->nodes[0], name, ptr, name_len); | ||
152 | btrfs_mark_buffer_dirty(path->nodes[0]); | ||
153 | |||
154 | out: | ||
155 | btrfs_free_path(path); | ||
156 | return ret; | ||
157 | } | ||
158 | |||
23 | int btrfs_insert_empty_inode(struct btrfs_trans_handle *trans, | 159 | int btrfs_insert_empty_inode(struct btrfs_trans_handle *trans, |
24 | struct btrfs_root *root, | 160 | struct btrfs_root *root, |
25 | struct btrfs_path *path, u64 objectid) | 161 | struct btrfs_path *path, u64 objectid) |