Loading...
1// SPDX-License-Identifier: GPL-2.0
2/*
3 * Copyright (C) 2013 Fusion IO. All rights reserved.
4 */
5
6#include <linux/slab.h>
7#include "btrfs-tests.h"
8#include "../ctree.h"
9#include "../extent_io.h"
10#include "../disk-io.h"
11
12static int test_btrfs_split_item(u32 sectorsize, u32 nodesize)
13{
14 struct btrfs_fs_info *fs_info;
15 struct btrfs_path *path = NULL;
16 struct btrfs_root *root = NULL;
17 struct extent_buffer *eb;
18 struct btrfs_item *item;
19 char *value = "mary had a little lamb";
20 char *split1 = "mary had a little";
21 char *split2 = " lamb";
22 char *split3 = "mary";
23 char *split4 = " had a little";
24 char buf[32];
25 struct btrfs_key key;
26 u32 value_len = strlen(value);
27 int ret = 0;
28
29 test_msg("running btrfs_split_item tests");
30
31 fs_info = btrfs_alloc_dummy_fs_info(nodesize, sectorsize);
32 if (!fs_info) {
33 test_std_err(TEST_ALLOC_FS_INFO);
34 return -ENOMEM;
35 }
36
37 root = btrfs_alloc_dummy_root(fs_info);
38 if (IS_ERR(root)) {
39 test_std_err(TEST_ALLOC_ROOT);
40 ret = PTR_ERR(root);
41 goto out;
42 }
43
44 path = btrfs_alloc_path();
45 if (!path) {
46 test_std_err(TEST_ALLOC_PATH);
47 ret = -ENOMEM;
48 goto out;
49 }
50
51 path->nodes[0] = eb = alloc_dummy_extent_buffer(fs_info, nodesize);
52 if (!eb) {
53 test_std_err(TEST_ALLOC_EXTENT_BUFFER);
54 ret = -ENOMEM;
55 goto out;
56 }
57 path->slots[0] = 0;
58
59 key.objectid = 0;
60 key.type = BTRFS_EXTENT_CSUM_KEY;
61 key.offset = 0;
62
63 setup_items_for_insert(root, path, &key, &value_len, value_len,
64 value_len + sizeof(struct btrfs_item), 1);
65 item = btrfs_item_nr(0);
66 write_extent_buffer(eb, value, btrfs_item_ptr_offset(eb, 0),
67 value_len);
68
69 key.offset = 3;
70
71 /*
72 * Passing NULL trans here should be safe because we have plenty of
73 * space in this leaf to split the item without having to split the
74 * leaf.
75 */
76 ret = btrfs_split_item(NULL, root, path, &key, 17);
77 if (ret) {
78 test_err("split item failed %d", ret);
79 goto out;
80 }
81
82 /*
83 * Read the first slot, it should have the original key and contain only
84 * 'mary had a little'
85 */
86 btrfs_item_key_to_cpu(eb, &key, 0);
87 if (key.objectid != 0 || key.type != BTRFS_EXTENT_CSUM_KEY ||
88 key.offset != 0) {
89 test_err("invalid key at slot 0");
90 ret = -EINVAL;
91 goto out;
92 }
93
94 item = btrfs_item_nr(0);
95 if (btrfs_item_size(eb, item) != strlen(split1)) {
96 test_err("invalid len in the first split");
97 ret = -EINVAL;
98 goto out;
99 }
100
101 read_extent_buffer(eb, buf, btrfs_item_ptr_offset(eb, 0),
102 strlen(split1));
103 if (memcmp(buf, split1, strlen(split1))) {
104 test_err(
105"data in the buffer doesn't match what it should in the first split have='%.*s' want '%s'",
106 (int)strlen(split1), buf, split1);
107 ret = -EINVAL;
108 goto out;
109 }
110
111 btrfs_item_key_to_cpu(eb, &key, 1);
112 if (key.objectid != 0 || key.type != BTRFS_EXTENT_CSUM_KEY ||
113 key.offset != 3) {
114 test_err("invalid key at slot 1");
115 ret = -EINVAL;
116 goto out;
117 }
118
119 item = btrfs_item_nr(1);
120 if (btrfs_item_size(eb, item) != strlen(split2)) {
121 test_err("invalid len in the second split");
122 ret = -EINVAL;
123 goto out;
124 }
125
126 read_extent_buffer(eb, buf, btrfs_item_ptr_offset(eb, 1),
127 strlen(split2));
128 if (memcmp(buf, split2, strlen(split2))) {
129 test_err(
130 "data in the buffer doesn't match what it should in the second split");
131 ret = -EINVAL;
132 goto out;
133 }
134
135 key.offset = 1;
136 /* Do it again so we test memmoving the other items in the leaf */
137 ret = btrfs_split_item(NULL, root, path, &key, 4);
138 if (ret) {
139 test_err("second split item failed %d", ret);
140 goto out;
141 }
142
143 btrfs_item_key_to_cpu(eb, &key, 0);
144 if (key.objectid != 0 || key.type != BTRFS_EXTENT_CSUM_KEY ||
145 key.offset != 0) {
146 test_err("invalid key at slot 0");
147 ret = -EINVAL;
148 goto out;
149 }
150
151 item = btrfs_item_nr(0);
152 if (btrfs_item_size(eb, item) != strlen(split3)) {
153 test_err("invalid len in the first split");
154 ret = -EINVAL;
155 goto out;
156 }
157
158 read_extent_buffer(eb, buf, btrfs_item_ptr_offset(eb, 0),
159 strlen(split3));
160 if (memcmp(buf, split3, strlen(split3))) {
161 test_err(
162 "data in the buffer doesn't match what it should in the third split");
163 ret = -EINVAL;
164 goto out;
165 }
166
167 btrfs_item_key_to_cpu(eb, &key, 1);
168 if (key.objectid != 0 || key.type != BTRFS_EXTENT_CSUM_KEY ||
169 key.offset != 1) {
170 test_err("invalid key at slot 1");
171 ret = -EINVAL;
172 goto out;
173 }
174
175 item = btrfs_item_nr(1);
176 if (btrfs_item_size(eb, item) != strlen(split4)) {
177 test_err("invalid len in the second split");
178 ret = -EINVAL;
179 goto out;
180 }
181
182 read_extent_buffer(eb, buf, btrfs_item_ptr_offset(eb, 1),
183 strlen(split4));
184 if (memcmp(buf, split4, strlen(split4))) {
185 test_err(
186 "data in the buffer doesn't match what it should in the fourth split");
187 ret = -EINVAL;
188 goto out;
189 }
190
191 btrfs_item_key_to_cpu(eb, &key, 2);
192 if (key.objectid != 0 || key.type != BTRFS_EXTENT_CSUM_KEY ||
193 key.offset != 3) {
194 test_err("invalid key at slot 2");
195 ret = -EINVAL;
196 goto out;
197 }
198
199 item = btrfs_item_nr(2);
200 if (btrfs_item_size(eb, item) != strlen(split2)) {
201 test_err("invalid len in the second split");
202 ret = -EINVAL;
203 goto out;
204 }
205
206 read_extent_buffer(eb, buf, btrfs_item_ptr_offset(eb, 2),
207 strlen(split2));
208 if (memcmp(buf, split2, strlen(split2))) {
209 test_err(
210 "data in the buffer doesn't match what it should in the last chunk");
211 ret = -EINVAL;
212 goto out;
213 }
214out:
215 btrfs_free_path(path);
216 btrfs_free_dummy_root(root);
217 btrfs_free_dummy_fs_info(fs_info);
218 return ret;
219}
220
221int btrfs_test_extent_buffer_operations(u32 sectorsize, u32 nodesize)
222{
223 test_msg("running extent buffer operation tests");
224 return test_btrfs_split_item(sectorsize, nodesize);
225}
1/*
2 * Copyright (C) 2013 Fusion IO. 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
19#include <linux/slab.h>
20#include "btrfs-tests.h"
21#include "../ctree.h"
22#include "../extent_io.h"
23#include "../disk-io.h"
24
25static int test_btrfs_split_item(void)
26{
27 struct btrfs_path *path;
28 struct btrfs_root *root;
29 struct extent_buffer *eb;
30 struct btrfs_item *item;
31 char *value = "mary had a little lamb";
32 char *split1 = "mary had a little";
33 char *split2 = " lamb";
34 char *split3 = "mary";
35 char *split4 = " had a little";
36 char buf[32];
37 struct btrfs_key key;
38 u32 value_len = strlen(value);
39 int ret = 0;
40
41 test_msg("Running btrfs_split_item tests\n");
42
43 root = btrfs_alloc_dummy_root();
44 if (IS_ERR(root)) {
45 test_msg("Could not allocate root\n");
46 return PTR_ERR(root);
47 }
48
49 path = btrfs_alloc_path();
50 if (!path) {
51 test_msg("Could not allocate path\n");
52 kfree(root);
53 return -ENOMEM;
54 }
55
56 path->nodes[0] = eb = alloc_dummy_extent_buffer(0, 4096);
57 if (!eb) {
58 test_msg("Could not allocate dummy buffer\n");
59 ret = -ENOMEM;
60 goto out;
61 }
62 path->slots[0] = 0;
63
64 key.objectid = 0;
65 key.type = BTRFS_EXTENT_CSUM_KEY;
66 key.offset = 0;
67
68 setup_items_for_insert(root, path, &key, &value_len, value_len,
69 value_len + sizeof(struct btrfs_item), 1);
70 item = btrfs_item_nr(0);
71 write_extent_buffer(eb, value, btrfs_item_ptr_offset(eb, 0),
72 value_len);
73
74 key.offset = 3;
75
76 /*
77 * Passing NULL trans here should be safe because we have plenty of
78 * space in this leaf to split the item without having to split the
79 * leaf.
80 */
81 ret = btrfs_split_item(NULL, root, path, &key, 17);
82 if (ret) {
83 test_msg("Split item failed %d\n", ret);
84 goto out;
85 }
86
87 /*
88 * Read the first slot, it should have the original key and contain only
89 * 'mary had a little'
90 */
91 btrfs_item_key_to_cpu(eb, &key, 0);
92 if (key.objectid != 0 || key.type != BTRFS_EXTENT_CSUM_KEY ||
93 key.offset != 0) {
94 test_msg("Invalid key at slot 0\n");
95 ret = -EINVAL;
96 goto out;
97 }
98
99 item = btrfs_item_nr(0);
100 if (btrfs_item_size(eb, item) != strlen(split1)) {
101 test_msg("Invalid len in the first split\n");
102 ret = -EINVAL;
103 goto out;
104 }
105
106 read_extent_buffer(eb, buf, btrfs_item_ptr_offset(eb, 0),
107 strlen(split1));
108 if (memcmp(buf, split1, strlen(split1))) {
109 test_msg("Data in the buffer doesn't match what it should "
110 "in the first split have='%.*s' want '%s'\n",
111 (int)strlen(split1), buf, split1);
112 ret = -EINVAL;
113 goto out;
114 }
115
116 btrfs_item_key_to_cpu(eb, &key, 1);
117 if (key.objectid != 0 || key.type != BTRFS_EXTENT_CSUM_KEY ||
118 key.offset != 3) {
119 test_msg("Invalid key at slot 1\n");
120 ret = -EINVAL;
121 goto out;
122 }
123
124 item = btrfs_item_nr(1);
125 if (btrfs_item_size(eb, item) != strlen(split2)) {
126 test_msg("Invalid len in the second split\n");
127 ret = -EINVAL;
128 goto out;
129 }
130
131 read_extent_buffer(eb, buf, btrfs_item_ptr_offset(eb, 1),
132 strlen(split2));
133 if (memcmp(buf, split2, strlen(split2))) {
134 test_msg("Data in the buffer doesn't match what it should "
135 "in the second split\n");
136 ret = -EINVAL;
137 goto out;
138 }
139
140 key.offset = 1;
141 /* Do it again so we test memmoving the other items in the leaf */
142 ret = btrfs_split_item(NULL, root, path, &key, 4);
143 if (ret) {
144 test_msg("Second split item failed %d\n", ret);
145 goto out;
146 }
147
148 btrfs_item_key_to_cpu(eb, &key, 0);
149 if (key.objectid != 0 || key.type != BTRFS_EXTENT_CSUM_KEY ||
150 key.offset != 0) {
151 test_msg("Invalid key at slot 0\n");
152 ret = -EINVAL;
153 goto out;
154 }
155
156 item = btrfs_item_nr(0);
157 if (btrfs_item_size(eb, item) != strlen(split3)) {
158 test_msg("Invalid len in the first split\n");
159 ret = -EINVAL;
160 goto out;
161 }
162
163 read_extent_buffer(eb, buf, btrfs_item_ptr_offset(eb, 0),
164 strlen(split3));
165 if (memcmp(buf, split3, strlen(split3))) {
166 test_msg("Data in the buffer doesn't match what it should "
167 "in the third split");
168 ret = -EINVAL;
169 goto out;
170 }
171
172 btrfs_item_key_to_cpu(eb, &key, 1);
173 if (key.objectid != 0 || key.type != BTRFS_EXTENT_CSUM_KEY ||
174 key.offset != 1) {
175 test_msg("Invalid key at slot 1\n");
176 ret = -EINVAL;
177 goto out;
178 }
179
180 item = btrfs_item_nr(1);
181 if (btrfs_item_size(eb, item) != strlen(split4)) {
182 test_msg("Invalid len in the second split\n");
183 ret = -EINVAL;
184 goto out;
185 }
186
187 read_extent_buffer(eb, buf, btrfs_item_ptr_offset(eb, 1),
188 strlen(split4));
189 if (memcmp(buf, split4, strlen(split4))) {
190 test_msg("Data in the buffer doesn't match what it should "
191 "in the fourth split\n");
192 ret = -EINVAL;
193 goto out;
194 }
195
196 btrfs_item_key_to_cpu(eb, &key, 2);
197 if (key.objectid != 0 || key.type != BTRFS_EXTENT_CSUM_KEY ||
198 key.offset != 3) {
199 test_msg("Invalid key at slot 2\n");
200 ret = -EINVAL;
201 goto out;
202 }
203
204 item = btrfs_item_nr(2);
205 if (btrfs_item_size(eb, item) != strlen(split2)) {
206 test_msg("Invalid len in the second split\n");
207 ret = -EINVAL;
208 goto out;
209 }
210
211 read_extent_buffer(eb, buf, btrfs_item_ptr_offset(eb, 2),
212 strlen(split2));
213 if (memcmp(buf, split2, strlen(split2))) {
214 test_msg("Data in the buffer doesn't match what it should "
215 "in the last chunk\n");
216 ret = -EINVAL;
217 goto out;
218 }
219out:
220 btrfs_free_path(path);
221 kfree(root);
222 return ret;
223}
224
225int btrfs_test_extent_buffer_operations(void)
226{
227 test_msg("Running extent buffer operation tests");
228 return test_btrfs_split_item();
229}