Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* |
2 | * Copyright 2000 by Hans Reiser, licensing governed by reiserfs/README | |
3 | */ | |
4 | ||
5 | /* | |
6 | * Written by Anatoly P. Pinchuk pap@namesys.botik.ru | |
7 | * Programm System Institute | |
8 | * Pereslavl-Zalessky Russia | |
9 | */ | |
10 | ||
11 | /* | |
12 | * This file contains functions dealing with S+tree | |
13 | * | |
14 | * B_IS_IN_TREE | |
15 | * copy_item_head | |
16 | * comp_short_keys | |
17 | * comp_keys | |
18 | * comp_short_le_keys | |
19 | * le_key2cpu_key | |
20 | * comp_le_keys | |
21 | * bin_search | |
22 | * get_lkey | |
23 | * get_rkey | |
24 | * key_in_buffer | |
25 | * decrement_bcount | |
1da177e4 LT |
26 | * reiserfs_check_path |
27 | * pathrelse_and_restore | |
28 | * pathrelse | |
29 | * search_by_key_reada | |
30 | * search_by_key | |
31 | * search_for_position_by_key | |
32 | * comp_items | |
33 | * prepare_for_direct_item | |
34 | * prepare_for_direntry_item | |
35 | * prepare_for_delete_or_cut | |
36 | * calc_deleted_bytes_number | |
37 | * init_tb_struct | |
38 | * padd_item | |
39 | * reiserfs_delete_item | |
40 | * reiserfs_delete_solid_item | |
41 | * reiserfs_delete_object | |
42 | * maybe_indirect_to_direct | |
43 | * indirect_to_direct_roll_back | |
44 | * reiserfs_cut_from_item | |
45 | * truncate_directory | |
46 | * reiserfs_do_truncate | |
47 | * reiserfs_paste_into_item | |
48 | * reiserfs_insert_item | |
49 | */ | |
50 | ||
1da177e4 LT |
51 | #include <linux/time.h> |
52 | #include <linux/string.h> | |
53 | #include <linux/pagemap.h> | |
f466c6fd | 54 | #include "reiserfs.h" |
1da177e4 LT |
55 | #include <linux/buffer_head.h> |
56 | #include <linux/quotaops.h> | |
57 | ||
58 | /* Does the buffer contain a disk block which is in the tree. */ | |
ad31a4fc | 59 | inline int B_IS_IN_TREE(const struct buffer_head *bh) |
1da177e4 LT |
60 | { |
61 | ||
ad31a4fc JM |
62 | RFALSE(B_LEVEL(bh) > MAX_HEIGHT, |
63 | "PAP-1010: block (%b) has too big level (%z)", bh, bh); | |
1da177e4 | 64 | |
ad31a4fc | 65 | return (B_LEVEL(bh) != FREE_LEVEL); |
1da177e4 LT |
66 | } |
67 | ||
68 | // | |
69 | // to gets item head in le form | |
70 | // | |
d68caa95 JM |
71 | inline void copy_item_head(struct item_head *to, |
72 | const struct item_head *from) | |
1da177e4 | 73 | { |
d68caa95 | 74 | memcpy(to, from, IH_SIZE); |
1da177e4 LT |
75 | } |
76 | ||
1da177e4 LT |
77 | /* k1 is pointer to on-disk structure which is stored in little-endian |
78 | form. k2 is pointer to cpu variable. For key of items of the same | |
79 | object this returns 0. | |
0222e657 | 80 | Returns: -1 if key1 < key2 |
1da177e4 LT |
81 | 0 if key1 == key2 |
82 | 1 if key1 > key2 */ | |
bd4c625c LT |
83 | inline int comp_short_keys(const struct reiserfs_key *le_key, |
84 | const struct cpu_key *cpu_key) | |
1da177e4 | 85 | { |
bd4c625c LT |
86 | __u32 n; |
87 | n = le32_to_cpu(le_key->k_dir_id); | |
88 | if (n < cpu_key->on_disk_key.k_dir_id) | |
89 | return -1; | |
90 | if (n > cpu_key->on_disk_key.k_dir_id) | |
91 | return 1; | |
92 | n = le32_to_cpu(le_key->k_objectid); | |
93 | if (n < cpu_key->on_disk_key.k_objectid) | |
94 | return -1; | |
95 | if (n > cpu_key->on_disk_key.k_objectid) | |
96 | return 1; | |
97 | return 0; | |
1da177e4 LT |
98 | } |
99 | ||
1da177e4 LT |
100 | /* k1 is pointer to on-disk structure which is stored in little-endian |
101 | form. k2 is pointer to cpu variable. | |
102 | Compare keys using all 4 key fields. | |
103 | Returns: -1 if key1 < key2 0 | |
104 | if key1 = key2 1 if key1 > key2 */ | |
bd4c625c LT |
105 | static inline int comp_keys(const struct reiserfs_key *le_key, |
106 | const struct cpu_key *cpu_key) | |
1da177e4 | 107 | { |
bd4c625c LT |
108 | int retval; |
109 | ||
110 | retval = comp_short_keys(le_key, cpu_key); | |
111 | if (retval) | |
112 | return retval; | |
113 | if (le_key_k_offset(le_key_version(le_key), le_key) < | |
114 | cpu_key_k_offset(cpu_key)) | |
115 | return -1; | |
116 | if (le_key_k_offset(le_key_version(le_key), le_key) > | |
117 | cpu_key_k_offset(cpu_key)) | |
118 | return 1; | |
119 | ||
120 | if (cpu_key->key_length == 3) | |
121 | return 0; | |
122 | ||
123 | /* this part is needed only when tail conversion is in progress */ | |
124 | if (le_key_k_type(le_key_version(le_key), le_key) < | |
125 | cpu_key_k_type(cpu_key)) | |
126 | return -1; | |
127 | ||
128 | if (le_key_k_type(le_key_version(le_key), le_key) > | |
129 | cpu_key_k_type(cpu_key)) | |
130 | return 1; | |
1da177e4 | 131 | |
bd4c625c | 132 | return 0; |
1da177e4 LT |
133 | } |
134 | ||
bd4c625c LT |
135 | inline int comp_short_le_keys(const struct reiserfs_key *key1, |
136 | const struct reiserfs_key *key2) | |
1da177e4 | 137 | { |
d68caa95 | 138 | __u32 *k1_u32, *k2_u32; |
ee93961b | 139 | int key_length = REISERFS_SHORT_KEY_LEN; |
bd4c625c | 140 | |
d68caa95 JM |
141 | k1_u32 = (__u32 *) key1; |
142 | k2_u32 = (__u32 *) key2; | |
ee93961b | 143 | for (; key_length--; ++k1_u32, ++k2_u32) { |
d68caa95 | 144 | if (le32_to_cpu(*k1_u32) < le32_to_cpu(*k2_u32)) |
bd4c625c | 145 | return -1; |
d68caa95 | 146 | if (le32_to_cpu(*k1_u32) > le32_to_cpu(*k2_u32)) |
bd4c625c LT |
147 | return 1; |
148 | } | |
149 | return 0; | |
1da177e4 LT |
150 | } |
151 | ||
bd4c625c | 152 | inline void le_key2cpu_key(struct cpu_key *to, const struct reiserfs_key *from) |
1da177e4 | 153 | { |
bd4c625c LT |
154 | int version; |
155 | to->on_disk_key.k_dir_id = le32_to_cpu(from->k_dir_id); | |
156 | to->on_disk_key.k_objectid = le32_to_cpu(from->k_objectid); | |
157 | ||
158 | // find out version of the key | |
159 | version = le_key_version(from); | |
160 | to->version = version; | |
161 | to->on_disk_key.k_offset = le_key_k_offset(version, from); | |
162 | to->on_disk_key.k_type = le_key_k_type(version, from); | |
1da177e4 LT |
163 | } |
164 | ||
1da177e4 LT |
165 | // this does not say which one is bigger, it only returns 1 if keys |
166 | // are not equal, 0 otherwise | |
bd4c625c LT |
167 | inline int comp_le_keys(const struct reiserfs_key *k1, |
168 | const struct reiserfs_key *k2) | |
1da177e4 | 169 | { |
bd4c625c | 170 | return memcmp(k1, k2, sizeof(struct reiserfs_key)); |
1da177e4 LT |
171 | } |
172 | ||
173 | /************************************************************************** | |
174 | * Binary search toolkit function * | |
175 | * Search for an item in the array by the item key * | |
176 | * Returns: 1 if found, 0 if not found; * | |
d68caa95 JM |
177 | * *pos = number of the searched element if found, else the * |
178 | * number of the first element that is larger than key. * | |
1da177e4 | 179 | **************************************************************************/ |
ee93961b JM |
180 | /* For those not familiar with binary search: lbound is the leftmost item that it |
181 | could be, rbound the rightmost item that it could be. We examine the item | |
182 | halfway between lbound and rbound, and that tells us either that we can increase | |
183 | lbound, or decrease rbound, or that we have found it, or if lbound <= rbound that | |
1da177e4 LT |
184 | there are no possible items, and we have not found it. With each examination we |
185 | cut the number of possible items it could be by one more than half rounded down, | |
186 | or we find it. */ | |
d68caa95 JM |
187 | static inline int bin_search(const void *key, /* Key to search for. */ |
188 | const void *base, /* First item in the array. */ | |
189 | int num, /* Number of items in the array. */ | |
190 | int width, /* Item size in the array. | |
191 | searched. Lest the reader be | |
192 | confused, note that this is crafted | |
193 | as a general function, and when it | |
194 | is applied specifically to the array | |
195 | of item headers in a node, width | |
196 | is actually the item header size not | |
197 | the item size. */ | |
198 | int *pos /* Number of the searched for element. */ | |
bd4c625c LT |
199 | ) |
200 | { | |
ee93961b | 201 | int rbound, lbound, j; |
bd4c625c | 202 | |
ee93961b JM |
203 | for (j = ((rbound = num - 1) + (lbound = 0)) / 2; |
204 | lbound <= rbound; j = (rbound + lbound) / 2) | |
bd4c625c | 205 | switch (comp_keys |
ee93961b | 206 | ((struct reiserfs_key *)((char *)base + j * width), |
d68caa95 | 207 | (struct cpu_key *)key)) { |
bd4c625c | 208 | case -1: |
ee93961b | 209 | lbound = j + 1; |
bd4c625c LT |
210 | continue; |
211 | case 1: | |
ee93961b | 212 | rbound = j - 1; |
bd4c625c LT |
213 | continue; |
214 | case 0: | |
ee93961b | 215 | *pos = j; |
bd4c625c LT |
216 | return ITEM_FOUND; /* Key found in the array. */ |
217 | } | |
218 | ||
219 | /* bin_search did not find given key, it returns position of key, | |
220 | that is minimal and greater than the given one. */ | |
ee93961b | 221 | *pos = lbound; |
bd4c625c | 222 | return ITEM_NOT_FOUND; |
1da177e4 LT |
223 | } |
224 | ||
1da177e4 | 225 | |
1da177e4 | 226 | /* Minimal possible key. It is never in the tree. */ |
bd4c625c | 227 | const struct reiserfs_key MIN_KEY = { 0, 0, {{0, 0},} }; |
1da177e4 LT |
228 | |
229 | /* Maximal possible key. It is never in the tree. */ | |
bd4c625c | 230 | static const struct reiserfs_key MAX_KEY = { |
3e8962be AV |
231 | __constant_cpu_to_le32(0xffffffff), |
232 | __constant_cpu_to_le32(0xffffffff), | |
233 | {{__constant_cpu_to_le32(0xffffffff), | |
bd4c625c | 234 | __constant_cpu_to_le32(0xffffffff)},} |
3e8962be | 235 | }; |
1da177e4 | 236 | |
1da177e4 LT |
237 | /* Get delimiting key of the buffer by looking for it in the buffers in the path, starting from the bottom |
238 | of the path, and going upwards. We must check the path's validity at each step. If the key is not in | |
239 | the path, there is no delimiting key in the tree (buffer is first or last buffer in tree), and in this | |
240 | case we return a special key, either MIN_KEY or MAX_KEY. */ | |
ee93961b JM |
241 | static inline const struct reiserfs_key *get_lkey(const struct treepath *chk_path, |
242 | const struct super_block *sb) | |
bd4c625c | 243 | { |
ee93961b | 244 | int position, path_offset = chk_path->path_length; |
d68caa95 | 245 | struct buffer_head *parent; |
bd4c625c | 246 | |
ee93961b | 247 | RFALSE(path_offset < FIRST_PATH_ELEMENT_OFFSET, |
bd4c625c LT |
248 | "PAP-5010: invalid offset in the path"); |
249 | ||
250 | /* While not higher in path than first element. */ | |
ee93961b | 251 | while (path_offset-- > FIRST_PATH_ELEMENT_OFFSET) { |
bd4c625c LT |
252 | |
253 | RFALSE(!buffer_uptodate | |
ee93961b | 254 | (PATH_OFFSET_PBUFFER(chk_path, path_offset)), |
bd4c625c LT |
255 | "PAP-5020: parent is not uptodate"); |
256 | ||
257 | /* Parent at the path is not in the tree now. */ | |
258 | if (!B_IS_IN_TREE | |
d68caa95 | 259 | (parent = |
ee93961b | 260 | PATH_OFFSET_PBUFFER(chk_path, path_offset))) |
bd4c625c LT |
261 | return &MAX_KEY; |
262 | /* Check whether position in the parent is correct. */ | |
ee93961b | 263 | if ((position = |
d68caa95 | 264 | PATH_OFFSET_POSITION(chk_path, |
ee93961b | 265 | path_offset)) > |
d68caa95 | 266 | B_NR_ITEMS(parent)) |
bd4c625c LT |
267 | return &MAX_KEY; |
268 | /* Check whether parent at the path really points to the child. */ | |
ee93961b | 269 | if (B_N_CHILD_NUM(parent, position) != |
d68caa95 | 270 | PATH_OFFSET_PBUFFER(chk_path, |
ee93961b | 271 | path_offset + 1)->b_blocknr) |
bd4c625c LT |
272 | return &MAX_KEY; |
273 | /* Return delimiting key if position in the parent is not equal to zero. */ | |
ee93961b JM |
274 | if (position) |
275 | return B_N_PDELIM_KEY(parent, position - 1); | |
bd4c625c LT |
276 | } |
277 | /* Return MIN_KEY if we are in the root of the buffer tree. */ | |
d68caa95 | 278 | if (PATH_OFFSET_PBUFFER(chk_path, FIRST_PATH_ELEMENT_OFFSET)-> |
a9dd3643 | 279 | b_blocknr == SB_ROOT_BLOCK(sb)) |
bd4c625c LT |
280 | return &MIN_KEY; |
281 | return &MAX_KEY; | |
1da177e4 LT |
282 | } |
283 | ||
1da177e4 | 284 | /* Get delimiting key of the buffer at the path and its right neighbor. */ |
d68caa95 | 285 | inline const struct reiserfs_key *get_rkey(const struct treepath *chk_path, |
a9dd3643 | 286 | const struct super_block *sb) |
bd4c625c | 287 | { |
ee93961b | 288 | int position, path_offset = chk_path->path_length; |
d68caa95 | 289 | struct buffer_head *parent; |
bd4c625c | 290 | |
ee93961b | 291 | RFALSE(path_offset < FIRST_PATH_ELEMENT_OFFSET, |
bd4c625c LT |
292 | "PAP-5030: invalid offset in the path"); |
293 | ||
ee93961b | 294 | while (path_offset-- > FIRST_PATH_ELEMENT_OFFSET) { |
bd4c625c LT |
295 | |
296 | RFALSE(!buffer_uptodate | |
ee93961b | 297 | (PATH_OFFSET_PBUFFER(chk_path, path_offset)), |
bd4c625c LT |
298 | "PAP-5040: parent is not uptodate"); |
299 | ||
300 | /* Parent at the path is not in the tree now. */ | |
301 | if (!B_IS_IN_TREE | |
d68caa95 | 302 | (parent = |
ee93961b | 303 | PATH_OFFSET_PBUFFER(chk_path, path_offset))) |
bd4c625c LT |
304 | return &MIN_KEY; |
305 | /* Check whether position in the parent is correct. */ | |
ee93961b | 306 | if ((position = |
d68caa95 | 307 | PATH_OFFSET_POSITION(chk_path, |
ee93961b | 308 | path_offset)) > |
d68caa95 | 309 | B_NR_ITEMS(parent)) |
bd4c625c LT |
310 | return &MIN_KEY; |
311 | /* Check whether parent at the path really points to the child. */ | |
ee93961b | 312 | if (B_N_CHILD_NUM(parent, position) != |
d68caa95 | 313 | PATH_OFFSET_PBUFFER(chk_path, |
ee93961b | 314 | path_offset + 1)->b_blocknr) |
bd4c625c LT |
315 | return &MIN_KEY; |
316 | /* Return delimiting key if position in the parent is not the last one. */ | |
ee93961b JM |
317 | if (position != B_NR_ITEMS(parent)) |
318 | return B_N_PDELIM_KEY(parent, position); | |
bd4c625c LT |
319 | } |
320 | /* Return MAX_KEY if we are in the root of the buffer tree. */ | |
d68caa95 | 321 | if (PATH_OFFSET_PBUFFER(chk_path, FIRST_PATH_ELEMENT_OFFSET)-> |
a9dd3643 | 322 | b_blocknr == SB_ROOT_BLOCK(sb)) |
bd4c625c LT |
323 | return &MAX_KEY; |
324 | return &MIN_KEY; | |
1da177e4 LT |
325 | } |
326 | ||
1da177e4 LT |
327 | /* Check whether a key is contained in the tree rooted from a buffer at a path. */ |
328 | /* This works by looking at the left and right delimiting keys for the buffer in the last path_element in | |
329 | the path. These delimiting keys are stored at least one level above that buffer in the tree. If the | |
330 | buffer is the first or last node in the tree order then one of the delimiting keys may be absent, and in | |
331 | this case get_lkey and get_rkey return a special key which is MIN_KEY or MAX_KEY. */ | |
d68caa95 JM |
332 | static inline int key_in_buffer(struct treepath *chk_path, /* Path which should be checked. */ |
333 | const struct cpu_key *key, /* Key which should be checked. */ | |
334 | struct super_block *sb | |
bd4c625c LT |
335 | ) |
336 | { | |
1da177e4 | 337 | |
d68caa95 JM |
338 | RFALSE(!key || chk_path->path_length < FIRST_PATH_ELEMENT_OFFSET |
339 | || chk_path->path_length > MAX_HEIGHT, | |
bd4c625c | 340 | "PAP-5050: pointer to the key(%p) is NULL or invalid path length(%d)", |
d68caa95 JM |
341 | key, chk_path->path_length); |
342 | RFALSE(!PATH_PLAST_BUFFER(chk_path)->b_bdev, | |
bd4c625c LT |
343 | "PAP-5060: device must not be NODEV"); |
344 | ||
d68caa95 | 345 | if (comp_keys(get_lkey(chk_path, sb), key) == 1) |
bd4c625c LT |
346 | /* left delimiting key is bigger, that the key we look for */ |
347 | return 0; | |
d68caa95 JM |
348 | /* if ( comp_keys(key, get_rkey(chk_path, sb)) != -1 ) */ |
349 | if (comp_keys(get_rkey(chk_path, sb), key) != 1) | |
350 | /* key must be less than right delimitiing key */ | |
bd4c625c LT |
351 | return 0; |
352 | return 1; | |
1da177e4 LT |
353 | } |
354 | ||
fec6d055 | 355 | int reiserfs_check_path(struct treepath *p) |
bd4c625c LT |
356 | { |
357 | RFALSE(p->path_length != ILLEGAL_PATH_ELEMENT_OFFSET, | |
358 | "path not properly relsed"); | |
359 | return 0; | |
360 | } | |
1da177e4 | 361 | |
3cd6dbe6 JM |
362 | /* Drop the reference to each buffer in a path and restore |
363 | * dirty bits clean when preparing the buffer for the log. | |
364 | * This version should only be called from fix_nodes() */ | |
365 | void pathrelse_and_restore(struct super_block *sb, | |
d68caa95 | 366 | struct treepath *search_path) |
bd4c625c | 367 | { |
ee93961b | 368 | int path_offset = search_path->path_length; |
bd4c625c | 369 | |
ee93961b | 370 | RFALSE(path_offset < ILLEGAL_PATH_ELEMENT_OFFSET, |
bd4c625c LT |
371 | "clm-4000: invalid path offset"); |
372 | ||
ee93961b | 373 | while (path_offset > ILLEGAL_PATH_ELEMENT_OFFSET) { |
3cd6dbe6 | 374 | struct buffer_head *bh; |
ee93961b | 375 | bh = PATH_OFFSET_PBUFFER(search_path, path_offset--); |
3cd6dbe6 JM |
376 | reiserfs_restore_prepared_buffer(sb, bh); |
377 | brelse(bh); | |
bd4c625c | 378 | } |
d68caa95 | 379 | search_path->path_length = ILLEGAL_PATH_ELEMENT_OFFSET; |
1da177e4 LT |
380 | } |
381 | ||
3cd6dbe6 | 382 | /* Drop the reference to each buffer in a path */ |
d68caa95 | 383 | void pathrelse(struct treepath *search_path) |
bd4c625c | 384 | { |
ee93961b | 385 | int path_offset = search_path->path_length; |
1da177e4 | 386 | |
ee93961b | 387 | RFALSE(path_offset < ILLEGAL_PATH_ELEMENT_OFFSET, |
bd4c625c | 388 | "PAP-5090: invalid path offset"); |
1da177e4 | 389 | |
ee93961b JM |
390 | while (path_offset > ILLEGAL_PATH_ELEMENT_OFFSET) |
391 | brelse(PATH_OFFSET_PBUFFER(search_path, path_offset--)); | |
1da177e4 | 392 | |
d68caa95 | 393 | search_path->path_length = ILLEGAL_PATH_ELEMENT_OFFSET; |
bd4c625c | 394 | } |
1da177e4 | 395 | |
bd4c625c LT |
396 | static int is_leaf(char *buf, int blocksize, struct buffer_head *bh) |
397 | { | |
398 | struct block_head *blkh; | |
399 | struct item_head *ih; | |
400 | int used_space; | |
401 | int prev_location; | |
402 | int i; | |
403 | int nr; | |
404 | ||
405 | blkh = (struct block_head *)buf; | |
406 | if (blkh_level(blkh) != DISK_LEAF_NODE_LEVEL) { | |
45b03d5e JM |
407 | reiserfs_warning(NULL, "reiserfs-5080", |
408 | "this should be caught earlier"); | |
bd4c625c | 409 | return 0; |
1da177e4 | 410 | } |
bd4c625c LT |
411 | |
412 | nr = blkh_nr_item(blkh); | |
413 | if (nr < 1 || nr > ((blocksize - BLKH_SIZE) / (IH_SIZE + MIN_ITEM_LEN))) { | |
414 | /* item number is too big or too small */ | |
45b03d5e JM |
415 | reiserfs_warning(NULL, "reiserfs-5081", |
416 | "nr_item seems wrong: %z", bh); | |
bd4c625c | 417 | return 0; |
1da177e4 | 418 | } |
bd4c625c LT |
419 | ih = (struct item_head *)(buf + BLKH_SIZE) + nr - 1; |
420 | used_space = BLKH_SIZE + IH_SIZE * nr + (blocksize - ih_location(ih)); | |
421 | if (used_space != blocksize - blkh_free_space(blkh)) { | |
422 | /* free space does not match to calculated amount of use space */ | |
45b03d5e JM |
423 | reiserfs_warning(NULL, "reiserfs-5082", |
424 | "free space seems wrong: %z", bh); | |
bd4c625c | 425 | return 0; |
1da177e4 | 426 | } |
bd4c625c LT |
427 | // FIXME: it is_leaf will hit performance too much - we may have |
428 | // return 1 here | |
429 | ||
430 | /* check tables of item heads */ | |
431 | ih = (struct item_head *)(buf + BLKH_SIZE); | |
432 | prev_location = blocksize; | |
433 | for (i = 0; i < nr; i++, ih++) { | |
434 | if (le_ih_k_type(ih) == TYPE_ANY) { | |
45b03d5e JM |
435 | reiserfs_warning(NULL, "reiserfs-5083", |
436 | "wrong item type for item %h", | |
bd4c625c LT |
437 | ih); |
438 | return 0; | |
439 | } | |
440 | if (ih_location(ih) >= blocksize | |
441 | || ih_location(ih) < IH_SIZE * nr) { | |
45b03d5e JM |
442 | reiserfs_warning(NULL, "reiserfs-5084", |
443 | "item location seems wrong: %h", | |
bd4c625c LT |
444 | ih); |
445 | return 0; | |
446 | } | |
447 | if (ih_item_len(ih) < 1 | |
448 | || ih_item_len(ih) > MAX_ITEM_LEN(blocksize)) { | |
45b03d5e JM |
449 | reiserfs_warning(NULL, "reiserfs-5085", |
450 | "item length seems wrong: %h", | |
bd4c625c LT |
451 | ih); |
452 | return 0; | |
453 | } | |
454 | if (prev_location - ih_location(ih) != ih_item_len(ih)) { | |
45b03d5e JM |
455 | reiserfs_warning(NULL, "reiserfs-5086", |
456 | "item location seems wrong " | |
457 | "(second one): %h", ih); | |
bd4c625c LT |
458 | return 0; |
459 | } | |
460 | prev_location = ih_location(ih); | |
1da177e4 | 461 | } |
1da177e4 | 462 | |
bd4c625c LT |
463 | // one may imagine much more checks |
464 | return 1; | |
1da177e4 LT |
465 | } |
466 | ||
1da177e4 | 467 | /* returns 1 if buf looks like an internal node, 0 otherwise */ |
bd4c625c | 468 | static int is_internal(char *buf, int blocksize, struct buffer_head *bh) |
1da177e4 | 469 | { |
bd4c625c LT |
470 | struct block_head *blkh; |
471 | int nr; | |
472 | int used_space; | |
473 | ||
474 | blkh = (struct block_head *)buf; | |
475 | nr = blkh_level(blkh); | |
476 | if (nr <= DISK_LEAF_NODE_LEVEL || nr > MAX_HEIGHT) { | |
477 | /* this level is not possible for internal nodes */ | |
45b03d5e JM |
478 | reiserfs_warning(NULL, "reiserfs-5087", |
479 | "this should be caught earlier"); | |
bd4c625c LT |
480 | return 0; |
481 | } | |
1da177e4 | 482 | |
bd4c625c LT |
483 | nr = blkh_nr_item(blkh); |
484 | if (nr > (blocksize - BLKH_SIZE - DC_SIZE) / (KEY_SIZE + DC_SIZE)) { | |
485 | /* for internal which is not root we might check min number of keys */ | |
45b03d5e JM |
486 | reiserfs_warning(NULL, "reiserfs-5088", |
487 | "number of key seems wrong: %z", bh); | |
bd4c625c LT |
488 | return 0; |
489 | } | |
1da177e4 | 490 | |
bd4c625c LT |
491 | used_space = BLKH_SIZE + KEY_SIZE * nr + DC_SIZE * (nr + 1); |
492 | if (used_space != blocksize - blkh_free_space(blkh)) { | |
45b03d5e JM |
493 | reiserfs_warning(NULL, "reiserfs-5089", |
494 | "free space seems wrong: %z", bh); | |
bd4c625c LT |
495 | return 0; |
496 | } | |
497 | // one may imagine much more checks | |
498 | return 1; | |
1da177e4 LT |
499 | } |
500 | ||
1da177e4 LT |
501 | // make sure that bh contains formatted node of reiserfs tree of |
502 | // 'level'-th level | |
bd4c625c | 503 | static int is_tree_node(struct buffer_head *bh, int level) |
1da177e4 | 504 | { |
bd4c625c | 505 | if (B_LEVEL(bh) != level) { |
45b03d5e JM |
506 | reiserfs_warning(NULL, "reiserfs-5090", "node level %d does " |
507 | "not match to the expected one %d", | |
bd4c625c LT |
508 | B_LEVEL(bh), level); |
509 | return 0; | |
510 | } | |
511 | if (level == DISK_LEAF_NODE_LEVEL) | |
512 | return is_leaf(bh->b_data, bh->b_size, bh); | |
1da177e4 | 513 | |
bd4c625c | 514 | return is_internal(bh->b_data, bh->b_size, bh); |
1da177e4 LT |
515 | } |
516 | ||
1da177e4 LT |
517 | #define SEARCH_BY_KEY_READA 16 |
518 | ||
2ac62695 FW |
519 | /* |
520 | * The function is NOT SCHEDULE-SAFE! | |
521 | * It might unlock the write lock if we needed to wait for a block | |
522 | * to be read. Note that in this case it won't recover the lock to avoid | |
523 | * high contention resulting from too much lock requests, especially | |
524 | * the caller (search_by_key) will perform other schedule-unsafe | |
525 | * operations just after calling this function. | |
526 | * | |
278f6679 | 527 | * @return depth of lock to be restored after read completes |
2ac62695 | 528 | */ |
278f6679 | 529 | static int search_by_key_reada(struct super_block *s, |
bd4c625c | 530 | struct buffer_head **bh, |
3ee16670 | 531 | b_blocknr_t *b, int num) |
1da177e4 | 532 | { |
bd4c625c | 533 | int i, j; |
278f6679 | 534 | int depth = -1; |
bd4c625c LT |
535 | |
536 | for (i = 0; i < num; i++) { | |
537 | bh[i] = sb_getblk(s, b[i]); | |
538 | } | |
09eb47a7 FW |
539 | /* |
540 | * We are going to read some blocks on which we | |
541 | * have a reference. It's safe, though we might be | |
542 | * reading blocks concurrently changed if we release | |
543 | * the lock. But it's still fine because we check later | |
544 | * if the tree changed | |
545 | */ | |
bd4c625c LT |
546 | for (j = 0; j < i; j++) { |
547 | /* | |
548 | * note, this needs attention if we are getting rid of the BKL | |
549 | * you have to make sure the prepared bit isn't set on this buffer | |
550 | */ | |
2ac62695 | 551 | if (!buffer_uptodate(bh[j])) { |
278f6679 JM |
552 | if (depth == -1) |
553 | depth = reiserfs_write_unlock_nested(s); | |
bd4c625c | 554 | ll_rw_block(READA, 1, bh + j); |
2ac62695 | 555 | } |
bd4c625c LT |
556 | brelse(bh[j]); |
557 | } | |
278f6679 | 558 | return depth; |
1da177e4 LT |
559 | } |
560 | ||
561 | /************************************************************************** | |
562 | * Algorithm SearchByKey * | |
563 | * look for item in the Disk S+Tree by its key * | |
a9dd3643 | 564 | * Input: sb - super block * |
d68caa95 | 565 | * key - pointer to the key to search * |
1da177e4 | 566 | * Output: ITEM_FOUND, ITEM_NOT_FOUND or IO_ERROR * |
d68caa95 | 567 | * search_path - path from the root to the needed leaf * |
1da177e4 LT |
568 | **************************************************************************/ |
569 | ||
570 | /* This function fills up the path from the root to the leaf as it | |
571 | descends the tree looking for the key. It uses reiserfs_bread to | |
572 | try to find buffers in the cache given their block number. If it | |
573 | does not find them in the cache it reads them from disk. For each | |
574 | node search_by_key finds using reiserfs_bread it then uses | |
575 | bin_search to look through that node. bin_search will find the | |
576 | position of the block_number of the next node if it is looking | |
577 | through an internal node. If it is looking through a leaf node | |
578 | bin_search will find the position of the item which has key either | |
579 | equal to given key, or which is the maximal key less than the given | |
580 | key. search_by_key returns a path that must be checked for the | |
581 | correctness of the top of the path but need not be checked for the | |
582 | correctness of the bottom of the path */ | |
583 | /* The function is NOT SCHEDULE-SAFE! */ | |
d68caa95 JM |
584 | int search_by_key(struct super_block *sb, const struct cpu_key *key, /* Key to search. */ |
585 | struct treepath *search_path,/* This structure was | |
bd4c625c LT |
586 | allocated and initialized |
587 | by the calling | |
588 | function. It is filled up | |
589 | by this function. */ | |
ee93961b | 590 | int stop_level /* How far down the tree to search. To |
bd4c625c LT |
591 | stop at leaf level - set to |
592 | DISK_LEAF_NODE_LEVEL */ | |
593 | ) | |
594 | { | |
ee93961b | 595 | b_blocknr_t block_number; |
bd4c625c | 596 | int expected_level; |
ad31a4fc | 597 | struct buffer_head *bh; |
d68caa95 | 598 | struct path_element *last_element; |
ee93961b | 599 | int node_level, retval; |
bd4c625c LT |
600 | int right_neighbor_of_leaf_node; |
601 | int fs_gen; | |
602 | struct buffer_head *reada_bh[SEARCH_BY_KEY_READA]; | |
3ee16670 | 603 | b_blocknr_t reada_blocks[SEARCH_BY_KEY_READA]; |
bd4c625c | 604 | int reada_count = 0; |
1da177e4 LT |
605 | |
606 | #ifdef CONFIG_REISERFS_CHECK | |
ee93961b | 607 | int repeat_counter = 0; |
1da177e4 | 608 | #endif |
1da177e4 | 609 | |
a9dd3643 | 610 | PROC_INFO_INC(sb, search_by_key); |
bd4c625c LT |
611 | |
612 | /* As we add each node to a path we increase its count. This means that | |
613 | we must be careful to release all nodes in a path before we either | |
614 | discard the path struct or re-use the path struct, as we do here. */ | |
1da177e4 | 615 | |
d68caa95 | 616 | pathrelse(search_path); |
1da177e4 | 617 | |
bd4c625c LT |
618 | right_neighbor_of_leaf_node = 0; |
619 | ||
620 | /* With each iteration of this loop we search through the items in the | |
621 | current node, and calculate the next current node(next path element) | |
622 | for the next iteration of this loop.. */ | |
ee93961b | 623 | block_number = SB_ROOT_BLOCK(sb); |
bd4c625c LT |
624 | expected_level = -1; |
625 | while (1) { | |
1da177e4 LT |
626 | |
627 | #ifdef CONFIG_REISERFS_CHECK | |
ee93961b | 628 | if (!(++repeat_counter % 50000)) |
a9dd3643 | 629 | reiserfs_warning(sb, "PAP-5100", |
45b03d5e JM |
630 | "%s: there were %d iterations of " |
631 | "while loop looking for key %K", | |
ee93961b | 632 | current->comm, repeat_counter, |
d68caa95 | 633 | key); |
1da177e4 LT |
634 | #endif |
635 | ||
bd4c625c | 636 | /* prep path to have another element added to it. */ |
d68caa95 JM |
637 | last_element = |
638 | PATH_OFFSET_PELEMENT(search_path, | |
639 | ++search_path->path_length); | |
a9dd3643 | 640 | fs_gen = get_generation(sb); |
bd4c625c LT |
641 | |
642 | /* Read the next tree node, and set the last element in the path to | |
643 | have a pointer to it. */ | |
d68caa95 | 644 | if ((bh = last_element->pe_buffer = |
ee93961b | 645 | sb_getblk(sb, block_number))) { |
2ac62695 | 646 | |
2ac62695 | 647 | /* |
278f6679 JM |
648 | * We'll need to drop the lock if we encounter any |
649 | * buffers that need to be read. If all of them are | |
650 | * already up to date, we don't need to drop the lock. | |
2ac62695 | 651 | */ |
278f6679 JM |
652 | int depth = -1; |
653 | ||
654 | if (!buffer_uptodate(bh) && reada_count > 1) | |
655 | depth = search_by_key_reada(sb, reada_bh, | |
656 | reada_blocks, reada_count); | |
657 | ||
658 | if (!buffer_uptodate(bh) && depth == -1) | |
659 | depth = reiserfs_write_unlock_nested(sb); | |
660 | ||
ad31a4fc JM |
661 | ll_rw_block(READ, 1, &bh); |
662 | wait_on_buffer(bh); | |
2ac62695 | 663 | |
278f6679 JM |
664 | if (depth != -1) |
665 | reiserfs_write_lock_nested(sb, depth); | |
ad31a4fc | 666 | if (!buffer_uptodate(bh)) |
bd4c625c LT |
667 | goto io_error; |
668 | } else { | |
669 | io_error: | |
d68caa95 JM |
670 | search_path->path_length--; |
671 | pathrelse(search_path); | |
bd4c625c LT |
672 | return IO_ERROR; |
673 | } | |
674 | reada_count = 0; | |
675 | if (expected_level == -1) | |
a9dd3643 | 676 | expected_level = SB_TREE_HEIGHT(sb); |
bd4c625c LT |
677 | expected_level--; |
678 | ||
679 | /* It is possible that schedule occurred. We must check whether the key | |
680 | to search is still in the tree rooted from the current buffer. If | |
681 | not then repeat search from the root. */ | |
a9dd3643 | 682 | if (fs_changed(fs_gen, sb) && |
ad31a4fc JM |
683 | (!B_IS_IN_TREE(bh) || |
684 | B_LEVEL(bh) != expected_level || | |
d68caa95 | 685 | !key_in_buffer(search_path, key, sb))) { |
a9dd3643 JM |
686 | PROC_INFO_INC(sb, search_by_key_fs_changed); |
687 | PROC_INFO_INC(sb, search_by_key_restarted); | |
688 | PROC_INFO_INC(sb, | |
bd4c625c | 689 | sbk_restarted[expected_level - 1]); |
d68caa95 | 690 | pathrelse(search_path); |
bd4c625c LT |
691 | |
692 | /* Get the root block number so that we can repeat the search | |
693 | starting from the root. */ | |
ee93961b | 694 | block_number = SB_ROOT_BLOCK(sb); |
bd4c625c LT |
695 | expected_level = -1; |
696 | right_neighbor_of_leaf_node = 0; | |
697 | ||
698 | /* repeat search from the root */ | |
699 | continue; | |
700 | } | |
1da177e4 | 701 | |
d68caa95 | 702 | /* only check that the key is in the buffer if key is not |
bd4c625c LT |
703 | equal to the MAX_KEY. Latter case is only possible in |
704 | "finish_unfinished()" processing during mount. */ | |
d68caa95 JM |
705 | RFALSE(comp_keys(&MAX_KEY, key) && |
706 | !key_in_buffer(search_path, key, sb), | |
bd4c625c | 707 | "PAP-5130: key is not in the buffer"); |
1da177e4 | 708 | #ifdef CONFIG_REISERFS_CHECK |
08f14fc8 | 709 | if (REISERFS_SB(sb)->cur_tb) { |
bd4c625c | 710 | print_cur_tb("5140"); |
a9dd3643 | 711 | reiserfs_panic(sb, "PAP-5140", |
c3a9c210 | 712 | "schedule occurred in do_balance!"); |
bd4c625c | 713 | } |
1da177e4 LT |
714 | #endif |
715 | ||
bd4c625c LT |
716 | // make sure, that the node contents look like a node of |
717 | // certain level | |
ad31a4fc | 718 | if (!is_tree_node(bh, expected_level)) { |
a9dd3643 | 719 | reiserfs_error(sb, "vs-5150", |
0030b645 | 720 | "invalid format found in block %ld. " |
ad31a4fc | 721 | "Fsck?", bh->b_blocknr); |
d68caa95 | 722 | pathrelse(search_path); |
bd4c625c LT |
723 | return IO_ERROR; |
724 | } | |
1da177e4 | 725 | |
bd4c625c | 726 | /* ok, we have acquired next formatted node in the tree */ |
ee93961b | 727 | node_level = B_LEVEL(bh); |
1da177e4 | 728 | |
ee93961b | 729 | PROC_INFO_BH_STAT(sb, bh, node_level - 1); |
1da177e4 | 730 | |
ee93961b | 731 | RFALSE(node_level < stop_level, |
bd4c625c | 732 | "vs-5152: tree level (%d) is less than stop level (%d)", |
ee93961b | 733 | node_level, stop_level); |
1da177e4 | 734 | |
ee93961b | 735 | retval = bin_search(key, B_N_PITEM_HEAD(bh, 0), |
ad31a4fc | 736 | B_NR_ITEMS(bh), |
ee93961b | 737 | (node_level == |
bd4c625c LT |
738 | DISK_LEAF_NODE_LEVEL) ? IH_SIZE : |
739 | KEY_SIZE, | |
d68caa95 | 740 | &(last_element->pe_position)); |
ee93961b JM |
741 | if (node_level == stop_level) { |
742 | return retval; | |
bd4c625c | 743 | } |
1da177e4 | 744 | |
bd4c625c | 745 | /* we are not in the stop level */ |
ee93961b | 746 | if (retval == ITEM_FOUND) |
bd4c625c | 747 | /* item has been found, so we choose the pointer which is to the right of the found one */ |
d68caa95 | 748 | last_element->pe_position++; |
bd4c625c LT |
749 | |
750 | /* if item was not found we choose the position which is to | |
751 | the left of the found item. This requires no code, | |
752 | bin_search did it already. */ | |
753 | ||
754 | /* So we have chosen a position in the current node which is | |
755 | an internal node. Now we calculate child block number by | |
756 | position in the node. */ | |
ee93961b | 757 | block_number = |
d68caa95 | 758 | B_N_CHILD_NUM(bh, last_element->pe_position); |
bd4c625c LT |
759 | |
760 | /* if we are going to read leaf nodes, try for read ahead as well */ | |
d68caa95 | 761 | if ((search_path->reada & PATH_READA) && |
ee93961b | 762 | node_level == DISK_LEAF_NODE_LEVEL + 1) { |
d68caa95 | 763 | int pos = last_element->pe_position; |
ad31a4fc | 764 | int limit = B_NR_ITEMS(bh); |
bd4c625c LT |
765 | struct reiserfs_key *le_key; |
766 | ||
d68caa95 | 767 | if (search_path->reada & PATH_READA_BACK) |
bd4c625c LT |
768 | limit = 0; |
769 | while (reada_count < SEARCH_BY_KEY_READA) { | |
770 | if (pos == limit) | |
771 | break; | |
772 | reada_blocks[reada_count++] = | |
ad31a4fc | 773 | B_N_CHILD_NUM(bh, pos); |
d68caa95 | 774 | if (search_path->reada & PATH_READA_BACK) |
bd4c625c LT |
775 | pos--; |
776 | else | |
777 | pos++; | |
778 | ||
779 | /* | |
780 | * check to make sure we're in the same object | |
781 | */ | |
ad31a4fc | 782 | le_key = B_N_PDELIM_KEY(bh, pos); |
bd4c625c | 783 | if (le32_to_cpu(le_key->k_objectid) != |
d68caa95 | 784 | key->on_disk_key.k_objectid) { |
bd4c625c LT |
785 | break; |
786 | } | |
787 | } | |
1da177e4 | 788 | } |
bd4c625c | 789 | } |
1da177e4 LT |
790 | } |
791 | ||
1da177e4 | 792 | /* Form the path to an item and position in this item which contains |
d68caa95 | 793 | file byte defined by key. If there is no such item |
1da177e4 | 794 | corresponding to the key, we point the path to the item with |
d68caa95 | 795 | maximal key less than key, and *pos_in_item is set to one |
1da177e4 | 796 | past the last entry/byte in the item. If searching for entry in a |
d68caa95 | 797 | directory item, and it is not found, *pos_in_item is set to one |
1da177e4 LT |
798 | entry more than the entry with maximal key which is less than the |
799 | sought key. | |
800 | ||
801 | Note that if there is no entry in this same node which is one more, | |
802 | then we point to an imaginary entry. for direct items, the | |
803 | position is in units of bytes, for indirect items the position is | |
804 | in units of blocknr entries, for directory items the position is in | |
805 | units of directory entries. */ | |
806 | ||
807 | /* The function is NOT SCHEDULE-SAFE! */ | |
a9dd3643 | 808 | int search_for_position_by_key(struct super_block *sb, /* Pointer to the super block. */ |
bd4c625c | 809 | const struct cpu_key *p_cpu_key, /* Key to search (cpu variable) */ |
d68caa95 | 810 | struct treepath *search_path /* Filled up by this function. */ |
bd4c625c LT |
811 | ) |
812 | { | |
813 | struct item_head *p_le_ih; /* pointer to on-disk structure */ | |
ee93961b | 814 | int blk_size; |
bd4c625c LT |
815 | loff_t item_offset, offset; |
816 | struct reiserfs_dir_entry de; | |
817 | int retval; | |
818 | ||
819 | /* If searching for directory entry. */ | |
820 | if (is_direntry_cpu_key(p_cpu_key)) | |
d68caa95 | 821 | return search_by_entry_key(sb, p_cpu_key, search_path, |
bd4c625c LT |
822 | &de); |
823 | ||
824 | /* If not searching for directory entry. */ | |
825 | ||
826 | /* If item is found. */ | |
d68caa95 | 827 | retval = search_item(sb, p_cpu_key, search_path); |
bd4c625c LT |
828 | if (retval == IO_ERROR) |
829 | return retval; | |
830 | if (retval == ITEM_FOUND) { | |
1da177e4 | 831 | |
bd4c625c LT |
832 | RFALSE(!ih_item_len |
833 | (B_N_PITEM_HEAD | |
d68caa95 JM |
834 | (PATH_PLAST_BUFFER(search_path), |
835 | PATH_LAST_POSITION(search_path))), | |
bd4c625c | 836 | "PAP-5165: item length equals zero"); |
1da177e4 | 837 | |
d68caa95 | 838 | pos_in_item(search_path) = 0; |
bd4c625c LT |
839 | return POSITION_FOUND; |
840 | } | |
1da177e4 | 841 | |
d68caa95 | 842 | RFALSE(!PATH_LAST_POSITION(search_path), |
bd4c625c | 843 | "PAP-5170: position equals zero"); |
1da177e4 | 844 | |
bd4c625c LT |
845 | /* Item is not found. Set path to the previous item. */ |
846 | p_le_ih = | |
d68caa95 JM |
847 | B_N_PITEM_HEAD(PATH_PLAST_BUFFER(search_path), |
848 | --PATH_LAST_POSITION(search_path)); | |
ee93961b | 849 | blk_size = sb->s_blocksize; |
1da177e4 | 850 | |
bd4c625c LT |
851 | if (comp_short_keys(&(p_le_ih->ih_key), p_cpu_key)) { |
852 | return FILE_NOT_FOUND; | |
853 | } | |
854 | // FIXME: quite ugly this far | |
1da177e4 | 855 | |
bd4c625c LT |
856 | item_offset = le_ih_k_offset(p_le_ih); |
857 | offset = cpu_key_k_offset(p_cpu_key); | |
1da177e4 | 858 | |
bd4c625c LT |
859 | /* Needed byte is contained in the item pointed to by the path. */ |
860 | if (item_offset <= offset && | |
ee93961b | 861 | item_offset + op_bytes_number(p_le_ih, blk_size) > offset) { |
d68caa95 | 862 | pos_in_item(search_path) = offset - item_offset; |
bd4c625c | 863 | if (is_indirect_le_ih(p_le_ih)) { |
ee93961b | 864 | pos_in_item(search_path) /= blk_size; |
bd4c625c LT |
865 | } |
866 | return POSITION_FOUND; | |
1da177e4 | 867 | } |
1da177e4 | 868 | |
bd4c625c LT |
869 | /* Needed byte is not contained in the item pointed to by the |
870 | path. Set pos_in_item out of the item. */ | |
871 | if (is_indirect_le_ih(p_le_ih)) | |
d68caa95 | 872 | pos_in_item(search_path) = |
bd4c625c LT |
873 | ih_item_len(p_le_ih) / UNFM_P_SIZE; |
874 | else | |
d68caa95 | 875 | pos_in_item(search_path) = ih_item_len(p_le_ih); |
bd4c625c LT |
876 | |
877 | return POSITION_NOT_FOUND; | |
878 | } | |
1da177e4 LT |
879 | |
880 | /* Compare given item and item pointed to by the path. */ | |
d68caa95 | 881 | int comp_items(const struct item_head *stored_ih, const struct treepath *path) |
1da177e4 | 882 | { |
d68caa95 | 883 | struct buffer_head *bh = PATH_PLAST_BUFFER(path); |
bd4c625c | 884 | struct item_head *ih; |
1da177e4 | 885 | |
bd4c625c | 886 | /* Last buffer at the path is not in the tree. */ |
ad31a4fc | 887 | if (!B_IS_IN_TREE(bh)) |
bd4c625c | 888 | return 1; |
1da177e4 | 889 | |
bd4c625c | 890 | /* Last path position is invalid. */ |
d68caa95 | 891 | if (PATH_LAST_POSITION(path) >= B_NR_ITEMS(bh)) |
bd4c625c | 892 | return 1; |
1da177e4 | 893 | |
bd4c625c | 894 | /* we need only to know, whether it is the same item */ |
d68caa95 | 895 | ih = get_ih(path); |
bd4c625c | 896 | return memcmp(stored_ih, ih, IH_SIZE); |
1da177e4 LT |
897 | } |
898 | ||
1da177e4 LT |
899 | /* unformatted nodes are not logged anymore, ever. This is safe |
900 | ** now | |
901 | */ | |
902 | #define held_by_others(bh) (atomic_read(&(bh)->b_count) > 1) | |
903 | ||
904 | // block can not be forgotten as it is in I/O or held by someone | |
905 | #define block_in_use(bh) (buffer_locked(bh) || (held_by_others(bh))) | |
906 | ||
1da177e4 | 907 | // prepare for delete or cut of direct item |
fec6d055 | 908 | static inline int prepare_for_direct_item(struct treepath *path, |
bd4c625c LT |
909 | struct item_head *le_ih, |
910 | struct inode *inode, | |
911 | loff_t new_file_length, int *cut_size) | |
1da177e4 | 912 | { |
bd4c625c LT |
913 | loff_t round_len; |
914 | ||
915 | if (new_file_length == max_reiserfs_offset(inode)) { | |
916 | /* item has to be deleted */ | |
917 | *cut_size = -(IH_SIZE + ih_item_len(le_ih)); | |
918 | return M_DELETE; | |
919 | } | |
920 | // new file gets truncated | |
921 | if (get_inode_item_key_version(inode) == KEY_FORMAT_3_6) { | |
0222e657 | 922 | // |
bd4c625c | 923 | round_len = ROUND_UP(new_file_length); |
ee93961b | 924 | /* this was new_file_length < le_ih ... */ |
bd4c625c LT |
925 | if (round_len < le_ih_k_offset(le_ih)) { |
926 | *cut_size = -(IH_SIZE + ih_item_len(le_ih)); | |
927 | return M_DELETE; /* Delete this item. */ | |
928 | } | |
929 | /* Calculate first position and size for cutting from item. */ | |
930 | pos_in_item(path) = round_len - (le_ih_k_offset(le_ih) - 1); | |
931 | *cut_size = -(ih_item_len(le_ih) - pos_in_item(path)); | |
932 | ||
933 | return M_CUT; /* Cut from this item. */ | |
934 | } | |
935 | ||
936 | // old file: items may have any length | |
937 | ||
938 | if (new_file_length < le_ih_k_offset(le_ih)) { | |
939 | *cut_size = -(IH_SIZE + ih_item_len(le_ih)); | |
940 | return M_DELETE; /* Delete this item. */ | |
1da177e4 LT |
941 | } |
942 | /* Calculate first position and size for cutting from item. */ | |
bd4c625c LT |
943 | *cut_size = -(ih_item_len(le_ih) - |
944 | (pos_in_item(path) = | |
945 | new_file_length + 1 - le_ih_k_offset(le_ih))); | |
946 | return M_CUT; /* Cut from this item. */ | |
1da177e4 LT |
947 | } |
948 | ||
fec6d055 | 949 | static inline int prepare_for_direntry_item(struct treepath *path, |
bd4c625c LT |
950 | struct item_head *le_ih, |
951 | struct inode *inode, | |
952 | loff_t new_file_length, | |
953 | int *cut_size) | |
1da177e4 | 954 | { |
bd4c625c LT |
955 | if (le_ih_k_offset(le_ih) == DOT_OFFSET && |
956 | new_file_length == max_reiserfs_offset(inode)) { | |
957 | RFALSE(ih_entry_count(le_ih) != 2, | |
958 | "PAP-5220: incorrect empty directory item (%h)", le_ih); | |
959 | *cut_size = -(IH_SIZE + ih_item_len(le_ih)); | |
960 | return M_DELETE; /* Delete the directory item containing "." and ".." entry. */ | |
961 | } | |
1da177e4 | 962 | |
bd4c625c LT |
963 | if (ih_entry_count(le_ih) == 1) { |
964 | /* Delete the directory item such as there is one record only | |
965 | in this item */ | |
966 | *cut_size = -(IH_SIZE + ih_item_len(le_ih)); | |
967 | return M_DELETE; | |
968 | } | |
969 | ||
970 | /* Cut one record from the directory item. */ | |
971 | *cut_size = | |
972 | -(DEH_SIZE + | |
973 | entry_length(get_last_bh(path), le_ih, pos_in_item(path))); | |
974 | return M_CUT; | |
975 | } | |
1da177e4 | 976 | |
23f9e0f8 AZ |
977 | #define JOURNAL_FOR_FREE_BLOCK_AND_UPDATE_SD (2 * JOURNAL_PER_BALANCE_CNT + 1) |
978 | ||
1da177e4 LT |
979 | /* If the path points to a directory or direct item, calculate mode and the size cut, for balance. |
980 | If the path points to an indirect item, remove some number of its unformatted nodes. | |
981 | In case of file truncate calculate whether this item must be deleted/truncated or last | |
982 | unformatted node of this item will be converted to a direct item. | |
983 | This function returns a determination of what balance mode the calling function should employ. */ | |
d68caa95 | 984 | static char prepare_for_delete_or_cut(struct reiserfs_transaction_handle *th, struct inode *inode, struct treepath *path, const struct cpu_key *item_key, int *removed, /* Number of unformatted nodes which were removed |
bd4c625c | 985 | from end of the file. */ |
ee93961b | 986 | int *cut_size, unsigned long long new_file_length /* MAX_KEY_OFFSET in case of delete. */ |
bd4c625c LT |
987 | ) |
988 | { | |
a9dd3643 | 989 | struct super_block *sb = inode->i_sb; |
d68caa95 JM |
990 | struct item_head *p_le_ih = PATH_PITEM_HEAD(path); |
991 | struct buffer_head *bh = PATH_PLAST_BUFFER(path); | |
1da177e4 | 992 | |
bd4c625c | 993 | BUG_ON(!th->t_trans_id); |
1da177e4 | 994 | |
bd4c625c LT |
995 | /* Stat_data item. */ |
996 | if (is_statdata_le_ih(p_le_ih)) { | |
1da177e4 | 997 | |
ee93961b | 998 | RFALSE(new_file_length != max_reiserfs_offset(inode), |
bd4c625c | 999 | "PAP-5210: mode must be M_DELETE"); |
1da177e4 | 1000 | |
d68caa95 | 1001 | *cut_size = -(IH_SIZE + ih_item_len(p_le_ih)); |
bd4c625c LT |
1002 | return M_DELETE; |
1003 | } | |
1da177e4 | 1004 | |
bd4c625c LT |
1005 | /* Directory item. */ |
1006 | if (is_direntry_le_ih(p_le_ih)) | |
d68caa95 | 1007 | return prepare_for_direntry_item(path, p_le_ih, inode, |
ee93961b | 1008 | new_file_length, |
d68caa95 | 1009 | cut_size); |
1da177e4 | 1010 | |
bd4c625c LT |
1011 | /* Direct item. */ |
1012 | if (is_direct_le_ih(p_le_ih)) | |
d68caa95 | 1013 | return prepare_for_direct_item(path, p_le_ih, inode, |
ee93961b | 1014 | new_file_length, cut_size); |
bd4c625c LT |
1015 | |
1016 | /* Case of an indirect item. */ | |
1017 | { | |
a9dd3643 | 1018 | int blk_size = sb->s_blocksize; |
23f9e0f8 AZ |
1019 | struct item_head s_ih; |
1020 | int need_re_search; | |
1021 | int delete = 0; | |
1022 | int result = M_CUT; | |
1023 | int pos = 0; | |
1024 | ||
ee93961b | 1025 | if ( new_file_length == max_reiserfs_offset (inode) ) { |
23f9e0f8 AZ |
1026 | /* prepare_for_delete_or_cut() is called by |
1027 | * reiserfs_delete_item() */ | |
ee93961b | 1028 | new_file_length = 0; |
23f9e0f8 AZ |
1029 | delete = 1; |
1030 | } | |
1031 | ||
1032 | do { | |
1033 | need_re_search = 0; | |
d68caa95 JM |
1034 | *cut_size = 0; |
1035 | bh = PATH_PLAST_BUFFER(path); | |
1036 | copy_item_head(&s_ih, PATH_PITEM_HEAD(path)); | |
23f9e0f8 | 1037 | pos = I_UNFM_NUM(&s_ih); |
bd4c625c | 1038 | |
ee93961b | 1039 | while (le_ih_k_offset (&s_ih) + (pos - 1) * blk_size > new_file_length) { |
87588dd6 AV |
1040 | __le32 *unfm; |
1041 | __u32 block; | |
bd4c625c | 1042 | |
23f9e0f8 AZ |
1043 | /* Each unformatted block deletion may involve one additional |
1044 | * bitmap block into the transaction, thereby the initial | |
1045 | * journal space reservation might not be enough. */ | |
d68caa95 JM |
1046 | if (!delete && (*cut_size) != 0 && |
1047 | reiserfs_transaction_free_space(th) < JOURNAL_FOR_FREE_BLOCK_AND_UPDATE_SD) | |
23f9e0f8 | 1048 | break; |
bd4c625c | 1049 | |
ad31a4fc | 1050 | unfm = (__le32 *)B_I_PITEM(bh, &s_ih) + pos - 1; |
23f9e0f8 | 1051 | block = get_block_num(unfm, 0); |
bd4c625c | 1052 | |
23f9e0f8 | 1053 | if (block != 0) { |
ad31a4fc | 1054 | reiserfs_prepare_for_journal(sb, bh, 1); |
23f9e0f8 | 1055 | put_block_num(unfm, 0, 0); |
ad31a4fc | 1056 | journal_mark_dirty(th, sb, bh); |
23f9e0f8 AZ |
1057 | reiserfs_free_block(th, inode, block, 1); |
1058 | } | |
bd4c625c | 1059 | |
278f6679 | 1060 | reiserfs_cond_resched(sb); |
bd4c625c | 1061 | |
d68caa95 | 1062 | if (item_moved (&s_ih, path)) { |
23f9e0f8 AZ |
1063 | need_re_search = 1; |
1064 | break; | |
1065 | } | |
1066 | ||
1067 | pos --; | |
d68caa95 JM |
1068 | (*removed)++; |
1069 | (*cut_size) -= UNFM_P_SIZE; | |
23f9e0f8 AZ |
1070 | |
1071 | if (pos == 0) { | |
d68caa95 | 1072 | (*cut_size) -= IH_SIZE; |
23f9e0f8 AZ |
1073 | result = M_DELETE; |
1074 | break; | |
1075 | } | |
1076 | } | |
1077 | /* a trick. If the buffer has been logged, this will do nothing. If | |
1078 | ** we've broken the loop without logging it, it will restore the | |
1079 | ** buffer */ | |
ad31a4fc | 1080 | reiserfs_restore_prepared_buffer(sb, bh); |
23f9e0f8 | 1081 | } while (need_re_search && |
d68caa95 JM |
1082 | search_for_position_by_key(sb, item_key, path) == POSITION_FOUND); |
1083 | pos_in_item(path) = pos * UNFM_P_SIZE; | |
23f9e0f8 | 1084 | |
d68caa95 | 1085 | if (*cut_size == 0) { |
23f9e0f8 AZ |
1086 | /* Nothing were cut. maybe convert last unformatted node to the |
1087 | * direct item? */ | |
1088 | result = M_CONVERT; | |
1089 | } | |
1090 | return result; | |
bd4c625c | 1091 | } |
1da177e4 LT |
1092 | } |
1093 | ||
1094 | /* Calculate number of bytes which will be deleted or cut during balance */ | |
ee93961b | 1095 | static int calc_deleted_bytes_number(struct tree_balance *tb, char mode) |
bd4c625c | 1096 | { |
ee93961b | 1097 | int del_size; |
a063ae17 | 1098 | struct item_head *p_le_ih = PATH_PITEM_HEAD(tb->tb_path); |
bd4c625c LT |
1099 | |
1100 | if (is_statdata_le_ih(p_le_ih)) | |
1101 | return 0; | |
1102 | ||
ee93961b JM |
1103 | del_size = |
1104 | (mode == | |
a063ae17 | 1105 | M_DELETE) ? ih_item_len(p_le_ih) : -tb->insert_size[0]; |
bd4c625c | 1106 | if (is_direntry_le_ih(p_le_ih)) { |
ee93961b JM |
1107 | /* return EMPTY_DIR_SIZE; We delete emty directoris only. |
1108 | * we can't use EMPTY_DIR_SIZE, as old format dirs have a different | |
1109 | * empty size. ick. FIXME, is this right? */ | |
1110 | return del_size; | |
bd4c625c | 1111 | } |
1da177e4 | 1112 | |
bd4c625c | 1113 | if (is_indirect_le_ih(p_le_ih)) |
ee93961b | 1114 | del_size = (del_size / UNFM_P_SIZE) * |
a063ae17 | 1115 | (PATH_PLAST_BUFFER(tb->tb_path)->b_size); |
ee93961b | 1116 | return del_size; |
1da177e4 LT |
1117 | } |
1118 | ||
bd4c625c | 1119 | static void init_tb_struct(struct reiserfs_transaction_handle *th, |
a063ae17 | 1120 | struct tree_balance *tb, |
a9dd3643 | 1121 | struct super_block *sb, |
ee93961b | 1122 | struct treepath *path, int size) |
bd4c625c | 1123 | { |
1da177e4 | 1124 | |
bd4c625c | 1125 | BUG_ON(!th->t_trans_id); |
1da177e4 | 1126 | |
a063ae17 JM |
1127 | memset(tb, '\0', sizeof(struct tree_balance)); |
1128 | tb->transaction_handle = th; | |
1129 | tb->tb_sb = sb; | |
d68caa95 JM |
1130 | tb->tb_path = path; |
1131 | PATH_OFFSET_PBUFFER(path, ILLEGAL_PATH_ELEMENT_OFFSET) = NULL; | |
1132 | PATH_OFFSET_POSITION(path, ILLEGAL_PATH_ELEMENT_OFFSET) = 0; | |
ee93961b | 1133 | tb->insert_size[0] = size; |
bd4c625c | 1134 | } |
1da177e4 | 1135 | |
bd4c625c | 1136 | void padd_item(char *item, int total_length, int length) |
1da177e4 | 1137 | { |
bd4c625c | 1138 | int i; |
1da177e4 | 1139 | |
bd4c625c LT |
1140 | for (i = total_length; i > length;) |
1141 | item[--i] = 0; | |
1da177e4 LT |
1142 | } |
1143 | ||
1144 | #ifdef REISERQUOTA_DEBUG | |
1145 | char key2type(struct reiserfs_key *ih) | |
1146 | { | |
bd4c625c LT |
1147 | if (is_direntry_le_key(2, ih)) |
1148 | return 'd'; | |
1149 | if (is_direct_le_key(2, ih)) | |
1150 | return 'D'; | |
1151 | if (is_indirect_le_key(2, ih)) | |
1152 | return 'i'; | |
1153 | if (is_statdata_le_key(2, ih)) | |
1154 | return 's'; | |
1155 | return 'u'; | |
1da177e4 LT |
1156 | } |
1157 | ||
1158 | char head2type(struct item_head *ih) | |
1159 | { | |
bd4c625c LT |
1160 | if (is_direntry_le_ih(ih)) |
1161 | return 'd'; | |
1162 | if (is_direct_le_ih(ih)) | |
1163 | return 'D'; | |
1164 | if (is_indirect_le_ih(ih)) | |
1165 | return 'i'; | |
1166 | if (is_statdata_le_ih(ih)) | |
1167 | return 's'; | |
1168 | return 'u'; | |
1da177e4 LT |
1169 | } |
1170 | #endif | |
1171 | ||
d68caa95 JM |
1172 | /* Delete object item. |
1173 | * th - active transaction handle | |
1174 | * path - path to the deleted item | |
1175 | * item_key - key to search for the deleted item | |
1176 | * indode - used for updating i_blocks and quotas | |
1177 | * un_bh - NULL or unformatted node pointer | |
1178 | */ | |
1179 | int reiserfs_delete_item(struct reiserfs_transaction_handle *th, | |
1180 | struct treepath *path, const struct cpu_key *item_key, | |
1181 | struct inode *inode, struct buffer_head *un_bh) | |
1182 | { | |
995c762e | 1183 | struct super_block *sb = inode->i_sb; |
bd4c625c LT |
1184 | struct tree_balance s_del_balance; |
1185 | struct item_head s_ih; | |
1186 | struct item_head *q_ih; | |
1187 | int quota_cut_bytes; | |
ee93961b | 1188 | int ret_value, del_size, removed; |
1da177e4 LT |
1189 | |
1190 | #ifdef CONFIG_REISERFS_CHECK | |
ee93961b JM |
1191 | char mode; |
1192 | int iter = 0; | |
1da177e4 LT |
1193 | #endif |
1194 | ||
bd4c625c | 1195 | BUG_ON(!th->t_trans_id); |
1da177e4 | 1196 | |
d68caa95 | 1197 | init_tb_struct(th, &s_del_balance, sb, path, |
bd4c625c | 1198 | 0 /*size is unknown */ ); |
1da177e4 | 1199 | |
bd4c625c | 1200 | while (1) { |
ee93961b | 1201 | removed = 0; |
1da177e4 LT |
1202 | |
1203 | #ifdef CONFIG_REISERFS_CHECK | |
ee93961b JM |
1204 | iter++; |
1205 | mode = | |
1da177e4 | 1206 | #endif |
d68caa95 | 1207 | prepare_for_delete_or_cut(th, inode, path, |
ee93961b JM |
1208 | item_key, &removed, |
1209 | &del_size, | |
995c762e | 1210 | max_reiserfs_offset(inode)); |
bd4c625c | 1211 | |
ee93961b | 1212 | RFALSE(mode != M_DELETE, "PAP-5320: mode must be M_DELETE"); |
bd4c625c | 1213 | |
d68caa95 | 1214 | copy_item_head(&s_ih, PATH_PITEM_HEAD(path)); |
ee93961b | 1215 | s_del_balance.insert_size[0] = del_size; |
bd4c625c | 1216 | |
ee93961b JM |
1217 | ret_value = fix_nodes(M_DELETE, &s_del_balance, NULL, NULL); |
1218 | if (ret_value != REPEAT_SEARCH) | |
bd4c625c LT |
1219 | break; |
1220 | ||
a9dd3643 | 1221 | PROC_INFO_INC(sb, delete_item_restarted); |
bd4c625c LT |
1222 | |
1223 | // file system changed, repeat search | |
ee93961b | 1224 | ret_value = |
d68caa95 | 1225 | search_for_position_by_key(sb, item_key, path); |
ee93961b | 1226 | if (ret_value == IO_ERROR) |
bd4c625c | 1227 | break; |
ee93961b | 1228 | if (ret_value == FILE_NOT_FOUND) { |
a9dd3643 | 1229 | reiserfs_warning(sb, "vs-5340", |
bd4c625c | 1230 | "no items of the file %K found", |
d68caa95 | 1231 | item_key); |
bd4c625c LT |
1232 | break; |
1233 | } | |
1234 | } /* while (1) */ | |
1da177e4 | 1235 | |
ee93961b | 1236 | if (ret_value != CARRY_ON) { |
bd4c625c LT |
1237 | unfix_nodes(&s_del_balance); |
1238 | return 0; | |
1239 | } | |
1240 | // reiserfs_delete_item returns item length when success | |
ee93961b | 1241 | ret_value = calc_deleted_bytes_number(&s_del_balance, M_DELETE); |
d68caa95 | 1242 | q_ih = get_ih(path); |
bd4c625c LT |
1243 | quota_cut_bytes = ih_item_len(q_ih); |
1244 | ||
1245 | /* hack so the quota code doesn't have to guess if the file | |
1246 | ** has a tail. On tail insert, we allocate quota for 1 unformatted node. | |
1247 | ** We test the offset because the tail might have been | |
1248 | ** split into multiple items, and we only want to decrement for | |
1249 | ** the unfm node once | |
1250 | */ | |
995c762e | 1251 | if (!S_ISLNK(inode->i_mode) && is_direct_le_ih(q_ih)) { |
a9dd3643 JM |
1252 | if ((le_ih_k_offset(q_ih) & (sb->s_blocksize - 1)) == 1) { |
1253 | quota_cut_bytes = sb->s_blocksize + UNFM_P_SIZE; | |
bd4c625c LT |
1254 | } else { |
1255 | quota_cut_bytes = 0; | |
1256 | } | |
1da177e4 | 1257 | } |
1da177e4 | 1258 | |
d68caa95 | 1259 | if (un_bh) { |
bd4c625c LT |
1260 | int off; |
1261 | char *data; | |
1262 | ||
1263 | /* We are in direct2indirect conversion, so move tail contents | |
1264 | to the unformatted node */ | |
1265 | /* note, we do the copy before preparing the buffer because we | |
1266 | ** don't care about the contents of the unformatted node yet. | |
1267 | ** the only thing we really care about is the direct item's data | |
1268 | ** is in the unformatted node. | |
1269 | ** | |
1270 | ** Otherwise, we would have to call reiserfs_prepare_for_journal on | |
1271 | ** the unformatted node, which might schedule, meaning we'd have to | |
1272 | ** loop all the way back up to the start of the while loop. | |
1273 | ** | |
1274 | ** The unformatted node must be dirtied later on. We can't be | |
1275 | ** sure here if the entire tail has been deleted yet. | |
1276 | ** | |
d68caa95 | 1277 | ** un_bh is from the page cache (all unformatted nodes are |
bd4c625c | 1278 | ** from the page cache) and might be a highmem page. So, we |
d68caa95 | 1279 | ** can't use un_bh->b_data. |
bd4c625c LT |
1280 | ** -clm |
1281 | */ | |
1282 | ||
883da600 | 1283 | data = kmap_atomic(un_bh->b_page); |
bd4c625c LT |
1284 | off = ((le_ih_k_offset(&s_ih) - 1) & (PAGE_CACHE_SIZE - 1)); |
1285 | memcpy(data + off, | |
d68caa95 | 1286 | B_I_PITEM(PATH_PLAST_BUFFER(path), &s_ih), |
ee93961b | 1287 | ret_value); |
883da600 | 1288 | kunmap_atomic(data); |
1da177e4 | 1289 | } |
bd4c625c LT |
1290 | /* Perform balancing after all resources have been collected at once. */ |
1291 | do_balance(&s_del_balance, NULL, NULL, M_DELETE); | |
1da177e4 LT |
1292 | |
1293 | #ifdef REISERQUOTA_DEBUG | |
a9dd3643 | 1294 | reiserfs_debug(sb, REISERFS_DEBUG_CODE, |
bd4c625c | 1295 | "reiserquota delete_item(): freeing %u, id=%u type=%c", |
995c762e | 1296 | quota_cut_bytes, inode->i_uid, head2type(&s_ih)); |
1da177e4 | 1297 | #endif |
5dd4056d | 1298 | dquot_free_space_nodirty(inode, quota_cut_bytes); |
1da177e4 | 1299 | |
bd4c625c | 1300 | /* Return deleted body length */ |
ee93961b | 1301 | return ret_value; |
1da177e4 LT |
1302 | } |
1303 | ||
1da177e4 LT |
1304 | /* Summary Of Mechanisms For Handling Collisions Between Processes: |
1305 | ||
1306 | deletion of the body of the object is performed by iput(), with the | |
1307 | result that if multiple processes are operating on a file, the | |
1308 | deletion of the body of the file is deferred until the last process | |
1309 | that has an open inode performs its iput(). | |
1310 | ||
1311 | writes and truncates are protected from collisions by use of | |
1312 | semaphores. | |
1313 | ||
1314 | creates, linking, and mknod are protected from collisions with other | |
1315 | processes by making the reiserfs_add_entry() the last step in the | |
1316 | creation, and then rolling back all changes if there was a collision. | |
1317 | - Hans | |
1318 | */ | |
1319 | ||
1da177e4 | 1320 | /* this deletes item which never gets split */ |
bd4c625c LT |
1321 | void reiserfs_delete_solid_item(struct reiserfs_transaction_handle *th, |
1322 | struct inode *inode, struct reiserfs_key *key) | |
1da177e4 | 1323 | { |
bd4c625c LT |
1324 | struct tree_balance tb; |
1325 | INITIALIZE_PATH(path); | |
1326 | int item_len = 0; | |
1327 | int tb_init = 0; | |
1328 | struct cpu_key cpu_key; | |
1329 | int retval; | |
1330 | int quota_cut_bytes = 0; | |
1331 | ||
1332 | BUG_ON(!th->t_trans_id); | |
1333 | ||
1334 | le_key2cpu_key(&cpu_key, key); | |
1335 | ||
1336 | while (1) { | |
1337 | retval = search_item(th->t_super, &cpu_key, &path); | |
1338 | if (retval == IO_ERROR) { | |
0030b645 JM |
1339 | reiserfs_error(th->t_super, "vs-5350", |
1340 | "i/o failure occurred trying " | |
1341 | "to delete %K", &cpu_key); | |
bd4c625c LT |
1342 | break; |
1343 | } | |
1344 | if (retval != ITEM_FOUND) { | |
1345 | pathrelse(&path); | |
1346 | // No need for a warning, if there is just no free space to insert '..' item into the newly-created subdir | |
1347 | if (! | |
1348 | ((unsigned long long) | |
1349 | GET_HASH_VALUE(le_key_k_offset | |
1350 | (le_key_version(key), key)) == 0 | |
1351 | && (unsigned long long) | |
1352 | GET_GENERATION_NUMBER(le_key_k_offset | |
1353 | (le_key_version(key), | |
1354 | key)) == 1)) | |
45b03d5e JM |
1355 | reiserfs_warning(th->t_super, "vs-5355", |
1356 | "%k not found", key); | |
bd4c625c LT |
1357 | break; |
1358 | } | |
1359 | if (!tb_init) { | |
1360 | tb_init = 1; | |
1361 | item_len = ih_item_len(PATH_PITEM_HEAD(&path)); | |
1362 | init_tb_struct(th, &tb, th->t_super, &path, | |
1363 | -(IH_SIZE + item_len)); | |
1364 | } | |
1365 | quota_cut_bytes = ih_item_len(PATH_PITEM_HEAD(&path)); | |
1da177e4 | 1366 | |
bd4c625c LT |
1367 | retval = fix_nodes(M_DELETE, &tb, NULL, NULL); |
1368 | if (retval == REPEAT_SEARCH) { | |
1369 | PROC_INFO_INC(th->t_super, delete_solid_item_restarted); | |
1370 | continue; | |
1371 | } | |
1da177e4 | 1372 | |
bd4c625c LT |
1373 | if (retval == CARRY_ON) { |
1374 | do_balance(&tb, NULL, NULL, M_DELETE); | |
1375 | if (inode) { /* Should we count quota for item? (we don't count quotas for save-links) */ | |
1da177e4 | 1376 | #ifdef REISERQUOTA_DEBUG |
bd4c625c LT |
1377 | reiserfs_debug(th->t_super, REISERFS_DEBUG_CODE, |
1378 | "reiserquota delete_solid_item(): freeing %u id=%u type=%c", | |
1379 | quota_cut_bytes, inode->i_uid, | |
1380 | key2type(key)); | |
1da177e4 | 1381 | #endif |
5dd4056d | 1382 | dquot_free_space_nodirty(inode, |
bd4c625c LT |
1383 | quota_cut_bytes); |
1384 | } | |
1385 | break; | |
1386 | } | |
1387 | // IO_ERROR, NO_DISK_SPACE, etc | |
45b03d5e | 1388 | reiserfs_warning(th->t_super, "vs-5360", |
bd4c625c LT |
1389 | "could not delete %K due to fix_nodes failure", |
1390 | &cpu_key); | |
1391 | unfix_nodes(&tb); | |
1392 | break; | |
1da177e4 LT |
1393 | } |
1394 | ||
bd4c625c | 1395 | reiserfs_check_path(&path); |
1da177e4 LT |
1396 | } |
1397 | ||
bd4c625c LT |
1398 | int reiserfs_delete_object(struct reiserfs_transaction_handle *th, |
1399 | struct inode *inode) | |
1da177e4 | 1400 | { |
bd4c625c LT |
1401 | int err; |
1402 | inode->i_size = 0; | |
1403 | BUG_ON(!th->t_trans_id); | |
1404 | ||
1405 | /* for directory this deletes item containing "." and ".." */ | |
1406 | err = | |
1407 | reiserfs_do_truncate(th, inode, NULL, 0 /*no timestamp updates */ ); | |
1408 | if (err) | |
1409 | return err; | |
1410 | ||
1da177e4 | 1411 | #if defined( USE_INODE_GENERATION_COUNTER ) |
bd4c625c LT |
1412 | if (!old_format_only(th->t_super)) { |
1413 | __le32 *inode_generation; | |
1414 | ||
1415 | inode_generation = | |
1416 | &REISERFS_SB(th->t_super)->s_rs->s_inode_generation; | |
9e902df6 | 1417 | le32_add_cpu(inode_generation, 1); |
bd4c625c | 1418 | } |
1da177e4 LT |
1419 | /* USE_INODE_GENERATION_COUNTER */ |
1420 | #endif | |
bd4c625c | 1421 | reiserfs_delete_solid_item(th, inode, INODE_PKEY(inode)); |
1da177e4 | 1422 | |
bd4c625c | 1423 | return err; |
1da177e4 LT |
1424 | } |
1425 | ||
bd4c625c LT |
1426 | static void unmap_buffers(struct page *page, loff_t pos) |
1427 | { | |
1428 | struct buffer_head *bh; | |
1429 | struct buffer_head *head; | |
1430 | struct buffer_head *next; | |
1431 | unsigned long tail_index; | |
1432 | unsigned long cur_index; | |
1433 | ||
1434 | if (page) { | |
1435 | if (page_has_buffers(page)) { | |
1436 | tail_index = pos & (PAGE_CACHE_SIZE - 1); | |
1437 | cur_index = 0; | |
1438 | head = page_buffers(page); | |
1439 | bh = head; | |
1440 | do { | |
1441 | next = bh->b_this_page; | |
1442 | ||
1443 | /* we want to unmap the buffers that contain the tail, and | |
1444 | ** all the buffers after it (since the tail must be at the | |
1445 | ** end of the file). We don't want to unmap file data | |
1446 | ** before the tail, since it might be dirty and waiting to | |
1447 | ** reach disk | |
1448 | */ | |
1449 | cur_index += bh->b_size; | |
1450 | if (cur_index > tail_index) { | |
1451 | reiserfs_unmap_buffer(bh); | |
1452 | } | |
1453 | bh = next; | |
1454 | } while (bh != head); | |
1da177e4 | 1455 | } |
1da177e4 | 1456 | } |
1da177e4 LT |
1457 | } |
1458 | ||
bd4c625c | 1459 | static int maybe_indirect_to_direct(struct reiserfs_transaction_handle *th, |
995c762e | 1460 | struct inode *inode, |
bd4c625c | 1461 | struct page *page, |
d68caa95 JM |
1462 | struct treepath *path, |
1463 | const struct cpu_key *item_key, | |
ee93961b | 1464 | loff_t new_file_size, char *mode) |
bd4c625c | 1465 | { |
995c762e | 1466 | struct super_block *sb = inode->i_sb; |
ee93961b | 1467 | int block_size = sb->s_blocksize; |
bd4c625c LT |
1468 | int cut_bytes; |
1469 | BUG_ON(!th->t_trans_id); | |
ee93961b | 1470 | BUG_ON(new_file_size != inode->i_size); |
1da177e4 | 1471 | |
bd4c625c LT |
1472 | /* the page being sent in could be NULL if there was an i/o error |
1473 | ** reading in the last block. The user will hit problems trying to | |
1474 | ** read the file, but for now we just skip the indirect2direct | |
1475 | */ | |
995c762e JM |
1476 | if (atomic_read(&inode->i_count) > 1 || |
1477 | !tail_has_to_be_packed(inode) || | |
1478 | !page || (REISERFS_I(inode)->i_flags & i_nopack_mask)) { | |
0222e657 | 1479 | /* leave tail in an unformatted node */ |
d68caa95 | 1480 | *mode = M_SKIP_BALANCING; |
bd4c625c | 1481 | cut_bytes = |
ee93961b | 1482 | block_size - (new_file_size & (block_size - 1)); |
d68caa95 | 1483 | pathrelse(path); |
bd4c625c LT |
1484 | return cut_bytes; |
1485 | } | |
d68caa95 JM |
1486 | /* Perform the conversion to a direct_item. */ |
1487 | /* return indirect_to_direct(inode, path, item_key, | |
ee93961b | 1488 | new_file_size, mode); */ |
d68caa95 | 1489 | return indirect2direct(th, inode, page, path, item_key, |
ee93961b | 1490 | new_file_size, mode); |
bd4c625c | 1491 | } |
1da177e4 LT |
1492 | |
1493 | /* we did indirect_to_direct conversion. And we have inserted direct | |
1494 | item successesfully, but there were no disk space to cut unfm | |
1495 | pointer being converted. Therefore we have to delete inserted | |
1496 | direct item(s) */ | |
bd4c625c | 1497 | static void indirect_to_direct_roll_back(struct reiserfs_transaction_handle *th, |
fec6d055 | 1498 | struct inode *inode, struct treepath *path) |
1da177e4 | 1499 | { |
bd4c625c LT |
1500 | struct cpu_key tail_key; |
1501 | int tail_len; | |
1502 | int removed; | |
1503 | BUG_ON(!th->t_trans_id); | |
1504 | ||
1505 | make_cpu_key(&tail_key, inode, inode->i_size + 1, TYPE_DIRECT, 4); // !!!! | |
1506 | tail_key.key_length = 4; | |
1507 | ||
1508 | tail_len = | |
1509 | (cpu_key_k_offset(&tail_key) & (inode->i_sb->s_blocksize - 1)) - 1; | |
1510 | while (tail_len) { | |
1511 | /* look for the last byte of the tail */ | |
1512 | if (search_for_position_by_key(inode->i_sb, &tail_key, path) == | |
1513 | POSITION_NOT_FOUND) | |
c3a9c210 JM |
1514 | reiserfs_panic(inode->i_sb, "vs-5615", |
1515 | "found invalid item"); | |
bd4c625c LT |
1516 | RFALSE(path->pos_in_item != |
1517 | ih_item_len(PATH_PITEM_HEAD(path)) - 1, | |
1518 | "vs-5616: appended bytes found"); | |
1519 | PATH_LAST_POSITION(path)--; | |
1520 | ||
1521 | removed = | |
1522 | reiserfs_delete_item(th, path, &tail_key, inode, | |
1523 | NULL /*unbh not needed */ ); | |
1524 | RFALSE(removed <= 0 | |
1525 | || removed > tail_len, | |
1526 | "vs-5617: there was tail %d bytes, removed item length %d bytes", | |
1527 | tail_len, removed); | |
1528 | tail_len -= removed; | |
1529 | set_cpu_key_k_offset(&tail_key, | |
1530 | cpu_key_k_offset(&tail_key) - removed); | |
1531 | } | |
45b03d5e JM |
1532 | reiserfs_warning(inode->i_sb, "reiserfs-5091", "indirect_to_direct " |
1533 | "conversion has been rolled back due to " | |
1534 | "lack of disk space"); | |
bd4c625c LT |
1535 | //mark_file_without_tail (inode); |
1536 | mark_inode_dirty(inode); | |
1da177e4 LT |
1537 | } |
1538 | ||
1da177e4 | 1539 | /* (Truncate or cut entry) or delete object item. Returns < 0 on failure */ |
bd4c625c | 1540 | int reiserfs_cut_from_item(struct reiserfs_transaction_handle *th, |
d68caa95 JM |
1541 | struct treepath *path, |
1542 | struct cpu_key *item_key, | |
995c762e | 1543 | struct inode *inode, |
ee93961b | 1544 | struct page *page, loff_t new_file_size) |
1da177e4 | 1545 | { |
995c762e | 1546 | struct super_block *sb = inode->i_sb; |
bd4c625c LT |
1547 | /* Every function which is going to call do_balance must first |
1548 | create a tree_balance structure. Then it must fill up this | |
1549 | structure by using the init_tb_struct and fix_nodes functions. | |
1550 | After that we can make tree balancing. */ | |
1551 | struct tree_balance s_cut_balance; | |
1552 | struct item_head *p_le_ih; | |
ee93961b JM |
1553 | int cut_size = 0, /* Amount to be cut. */ |
1554 | ret_value = CARRY_ON, removed = 0, /* Number of the removed unformatted nodes. */ | |
1555 | is_inode_locked = 0; | |
1556 | char mode; /* Mode of the balance. */ | |
bd4c625c LT |
1557 | int retval2 = -1; |
1558 | int quota_cut_bytes; | |
1559 | loff_t tail_pos = 0; | |
1560 | ||
1561 | BUG_ON(!th->t_trans_id); | |
1562 | ||
d68caa95 | 1563 | init_tb_struct(th, &s_cut_balance, inode->i_sb, path, |
ee93961b | 1564 | cut_size); |
bd4c625c LT |
1565 | |
1566 | /* Repeat this loop until we either cut the item without needing | |
1567 | to balance, or we fix_nodes without schedule occurring */ | |
1568 | while (1) { | |
1569 | /* Determine the balance mode, position of the first byte to | |
1570 | be cut, and size to be cut. In case of the indirect item | |
1571 | free unformatted nodes which are pointed to by the cut | |
1572 | pointers. */ | |
1573 | ||
ee93961b | 1574 | mode = |
d68caa95 | 1575 | prepare_for_delete_or_cut(th, inode, path, |
ee93961b JM |
1576 | item_key, &removed, |
1577 | &cut_size, new_file_size); | |
1578 | if (mode == M_CONVERT) { | |
bd4c625c LT |
1579 | /* convert last unformatted node to direct item or leave |
1580 | tail in the unformatted node */ | |
ee93961b | 1581 | RFALSE(ret_value != CARRY_ON, |
bd4c625c LT |
1582 | "PAP-5570: can not convert twice"); |
1583 | ||
ee93961b | 1584 | ret_value = |
995c762e | 1585 | maybe_indirect_to_direct(th, inode, page, |
d68caa95 | 1586 | path, item_key, |
ee93961b JM |
1587 | new_file_size, &mode); |
1588 | if (mode == M_SKIP_BALANCING) | |
bd4c625c | 1589 | /* tail has been left in the unformatted node */ |
ee93961b | 1590 | return ret_value; |
bd4c625c | 1591 | |
ee93961b | 1592 | is_inode_locked = 1; |
bd4c625c LT |
1593 | |
1594 | /* removing of last unformatted node will change value we | |
1595 | have to return to truncate. Save it */ | |
ee93961b JM |
1596 | retval2 = ret_value; |
1597 | /*retval2 = sb->s_blocksize - (new_file_size & (sb->s_blocksize - 1)); */ | |
bd4c625c LT |
1598 | |
1599 | /* So, we have performed the first part of the conversion: | |
1600 | inserting the new direct item. Now we are removing the | |
1601 | last unformatted node pointer. Set key to search for | |
1602 | it. */ | |
d68caa95 JM |
1603 | set_cpu_key_k_type(item_key, TYPE_INDIRECT); |
1604 | item_key->key_length = 4; | |
ee93961b JM |
1605 | new_file_size -= |
1606 | (new_file_size & (sb->s_blocksize - 1)); | |
1607 | tail_pos = new_file_size; | |
1608 | set_cpu_key_k_offset(item_key, new_file_size + 1); | |
bd4c625c | 1609 | if (search_for_position_by_key |
d68caa95 JM |
1610 | (sb, item_key, |
1611 | path) == POSITION_NOT_FOUND) { | |
1612 | print_block(PATH_PLAST_BUFFER(path), 3, | |
1613 | PATH_LAST_POSITION(path) - 1, | |
1614 | PATH_LAST_POSITION(path) + 1); | |
a9dd3643 | 1615 | reiserfs_panic(sb, "PAP-5580", "item to " |
c3a9c210 | 1616 | "convert does not exist (%K)", |
d68caa95 | 1617 | item_key); |
bd4c625c LT |
1618 | } |
1619 | continue; | |
1620 | } | |
ee93961b | 1621 | if (cut_size == 0) { |
d68caa95 | 1622 | pathrelse(path); |
bd4c625c LT |
1623 | return 0; |
1624 | } | |
1625 | ||
ee93961b | 1626 | s_cut_balance.insert_size[0] = cut_size; |
bd4c625c | 1627 | |
ee93961b JM |
1628 | ret_value = fix_nodes(mode, &s_cut_balance, NULL, NULL); |
1629 | if (ret_value != REPEAT_SEARCH) | |
bd4c625c LT |
1630 | break; |
1631 | ||
a9dd3643 | 1632 | PROC_INFO_INC(sb, cut_from_item_restarted); |
bd4c625c | 1633 | |
ee93961b | 1634 | ret_value = |
d68caa95 | 1635 | search_for_position_by_key(sb, item_key, path); |
ee93961b | 1636 | if (ret_value == POSITION_FOUND) |
bd4c625c | 1637 | continue; |
1da177e4 | 1638 | |
a9dd3643 | 1639 | reiserfs_warning(sb, "PAP-5610", "item %K not found", |
d68caa95 | 1640 | item_key); |
bd4c625c | 1641 | unfix_nodes(&s_cut_balance); |
ee93961b | 1642 | return (ret_value == IO_ERROR) ? -EIO : -ENOENT; |
bd4c625c LT |
1643 | } /* while */ |
1644 | ||
1645 | // check fix_nodes results (IO_ERROR or NO_DISK_SPACE) | |
ee93961b JM |
1646 | if (ret_value != CARRY_ON) { |
1647 | if (is_inode_locked) { | |
bd4c625c LT |
1648 | // FIXME: this seems to be not needed: we are always able |
1649 | // to cut item | |
d68caa95 | 1650 | indirect_to_direct_roll_back(th, inode, path); |
bd4c625c | 1651 | } |
ee93961b | 1652 | if (ret_value == NO_DISK_SPACE) |
a9dd3643 | 1653 | reiserfs_warning(sb, "reiserfs-5092", |
45b03d5e | 1654 | "NO_DISK_SPACE"); |
bd4c625c LT |
1655 | unfix_nodes(&s_cut_balance); |
1656 | return -EIO; | |
1da177e4 | 1657 | } |
bd4c625c LT |
1658 | |
1659 | /* go ahead and perform balancing */ | |
1660 | ||
ee93961b | 1661 | RFALSE(mode == M_PASTE || mode == M_INSERT, "invalid mode"); |
bd4c625c LT |
1662 | |
1663 | /* Calculate number of bytes that need to be cut from the item. */ | |
1664 | quota_cut_bytes = | |
ee93961b | 1665 | (mode == |
d68caa95 | 1666 | M_DELETE) ? ih_item_len(get_ih(path)) : -s_cut_balance. |
bd4c625c LT |
1667 | insert_size[0]; |
1668 | if (retval2 == -1) | |
ee93961b | 1669 | ret_value = calc_deleted_bytes_number(&s_cut_balance, mode); |
bd4c625c | 1670 | else |
ee93961b | 1671 | ret_value = retval2; |
bd4c625c LT |
1672 | |
1673 | /* For direct items, we only change the quota when deleting the last | |
1674 | ** item. | |
1675 | */ | |
1676 | p_le_ih = PATH_PITEM_HEAD(s_cut_balance.tb_path); | |
995c762e | 1677 | if (!S_ISLNK(inode->i_mode) && is_direct_le_ih(p_le_ih)) { |
ee93961b | 1678 | if (mode == M_DELETE && |
a9dd3643 | 1679 | (le_ih_k_offset(p_le_ih) & (sb->s_blocksize - 1)) == |
bd4c625c LT |
1680 | 1) { |
1681 | // FIXME: this is to keep 3.5 happy | |
995c762e | 1682 | REISERFS_I(inode)->i_first_direct_byte = U32_MAX; |
a9dd3643 | 1683 | quota_cut_bytes = sb->s_blocksize + UNFM_P_SIZE; |
bd4c625c LT |
1684 | } else { |
1685 | quota_cut_bytes = 0; | |
1686 | } | |
1da177e4 | 1687 | } |
1da177e4 | 1688 | #ifdef CONFIG_REISERFS_CHECK |
ee93961b | 1689 | if (is_inode_locked) { |
bd4c625c LT |
1690 | struct item_head *le_ih = |
1691 | PATH_PITEM_HEAD(s_cut_balance.tb_path); | |
1692 | /* we are going to complete indirect2direct conversion. Make | |
1693 | sure, that we exactly remove last unformatted node pointer | |
1694 | of the item */ | |
1695 | if (!is_indirect_le_ih(le_ih)) | |
a9dd3643 | 1696 | reiserfs_panic(sb, "vs-5652", |
bd4c625c LT |
1697 | "item must be indirect %h", le_ih); |
1698 | ||
ee93961b | 1699 | if (mode == M_DELETE && ih_item_len(le_ih) != UNFM_P_SIZE) |
a9dd3643 | 1700 | reiserfs_panic(sb, "vs-5653", "completing " |
c3a9c210 JM |
1701 | "indirect2direct conversion indirect " |
1702 | "item %h being deleted must be of " | |
1703 | "4 byte long", le_ih); | |
bd4c625c | 1704 | |
ee93961b | 1705 | if (mode == M_CUT |
bd4c625c | 1706 | && s_cut_balance.insert_size[0] != -UNFM_P_SIZE) { |
a9dd3643 | 1707 | reiserfs_panic(sb, "vs-5654", "can not complete " |
c3a9c210 JM |
1708 | "indirect2direct conversion of %h " |
1709 | "(CUT, insert_size==%d)", | |
bd4c625c LT |
1710 | le_ih, s_cut_balance.insert_size[0]); |
1711 | } | |
1712 | /* it would be useful to make sure, that right neighboring | |
1713 | item is direct item of this file */ | |
1da177e4 | 1714 | } |
1da177e4 | 1715 | #endif |
bd4c625c | 1716 | |
ee93961b JM |
1717 | do_balance(&s_cut_balance, NULL, NULL, mode); |
1718 | if (is_inode_locked) { | |
bd4c625c LT |
1719 | /* we've done an indirect->direct conversion. when the data block |
1720 | ** was freed, it was removed from the list of blocks that must | |
1721 | ** be flushed before the transaction commits, make sure to | |
1722 | ** unmap and invalidate it | |
1723 | */ | |
1724 | unmap_buffers(page, tail_pos); | |
995c762e | 1725 | REISERFS_I(inode)->i_flags &= ~i_pack_on_close_mask; |
bd4c625c | 1726 | } |
1da177e4 | 1727 | #ifdef REISERQUOTA_DEBUG |
995c762e | 1728 | reiserfs_debug(inode->i_sb, REISERFS_DEBUG_CODE, |
bd4c625c | 1729 | "reiserquota cut_from_item(): freeing %u id=%u type=%c", |
995c762e | 1730 | quota_cut_bytes, inode->i_uid, '?'); |
1da177e4 | 1731 | #endif |
5dd4056d | 1732 | dquot_free_space_nodirty(inode, quota_cut_bytes); |
ee93961b | 1733 | return ret_value; |
1da177e4 LT |
1734 | } |
1735 | ||
bd4c625c LT |
1736 | static void truncate_directory(struct reiserfs_transaction_handle *th, |
1737 | struct inode *inode) | |
1da177e4 | 1738 | { |
bd4c625c LT |
1739 | BUG_ON(!th->t_trans_id); |
1740 | if (inode->i_nlink) | |
0030b645 | 1741 | reiserfs_error(inode->i_sb, "vs-5655", "link count != 0"); |
bd4c625c LT |
1742 | |
1743 | set_le_key_k_offset(KEY_FORMAT_3_5, INODE_PKEY(inode), DOT_OFFSET); | |
1744 | set_le_key_k_type(KEY_FORMAT_3_5, INODE_PKEY(inode), TYPE_DIRENTRY); | |
1745 | reiserfs_delete_solid_item(th, inode, INODE_PKEY(inode)); | |
1746 | reiserfs_update_sd(th, inode); | |
1747 | set_le_key_k_offset(KEY_FORMAT_3_5, INODE_PKEY(inode), SD_OFFSET); | |
1748 | set_le_key_k_type(KEY_FORMAT_3_5, INODE_PKEY(inode), TYPE_STAT_DATA); | |
1da177e4 LT |
1749 | } |
1750 | ||
bd4c625c LT |
1751 | /* Truncate file to the new size. Note, this must be called with a transaction |
1752 | already started */ | |
995c762e JM |
1753 | int reiserfs_do_truncate(struct reiserfs_transaction_handle *th, |
1754 | struct inode *inode, /* ->i_size contains new size */ | |
bd4c625c LT |
1755 | struct page *page, /* up to date for last block */ |
1756 | int update_timestamps /* when it is called by | |
1757 | file_release to convert | |
1758 | the tail - no timestamps | |
1759 | should be updated */ | |
1760 | ) | |
1761 | { | |
1762 | INITIALIZE_PATH(s_search_path); /* Path to the current object item. */ | |
1763 | struct item_head *p_le_ih; /* Pointer to an item header. */ | |
1764 | struct cpu_key s_item_key; /* Key to search for a previous file item. */ | |
ee93961b JM |
1765 | loff_t file_size, /* Old file size. */ |
1766 | new_file_size; /* New file size. */ | |
1767 | int deleted; /* Number of deleted or truncated bytes. */ | |
bd4c625c LT |
1768 | int retval; |
1769 | int err = 0; | |
1770 | ||
1771 | BUG_ON(!th->t_trans_id); | |
1772 | if (! | |
995c762e JM |
1773 | (S_ISREG(inode->i_mode) || S_ISDIR(inode->i_mode) |
1774 | || S_ISLNK(inode->i_mode))) | |
bd4c625c LT |
1775 | return 0; |
1776 | ||
995c762e | 1777 | if (S_ISDIR(inode->i_mode)) { |
bd4c625c | 1778 | // deletion of directory - no need to update timestamps |
995c762e | 1779 | truncate_directory(th, inode); |
bd4c625c LT |
1780 | return 0; |
1781 | } | |
1da177e4 | 1782 | |
bd4c625c | 1783 | /* Get new file size. */ |
ee93961b | 1784 | new_file_size = inode->i_size; |
1da177e4 | 1785 | |
bd4c625c | 1786 | // FIXME: note, that key type is unimportant here |
995c762e | 1787 | make_cpu_key(&s_item_key, inode, max_reiserfs_offset(inode), |
bd4c625c | 1788 | TYPE_DIRECT, 3); |
1da177e4 | 1789 | |
bd4c625c | 1790 | retval = |
995c762e | 1791 | search_for_position_by_key(inode->i_sb, &s_item_key, |
bd4c625c LT |
1792 | &s_search_path); |
1793 | if (retval == IO_ERROR) { | |
995c762e | 1794 | reiserfs_error(inode->i_sb, "vs-5657", |
0030b645 JM |
1795 | "i/o failure occurred trying to truncate %K", |
1796 | &s_item_key); | |
bd4c625c LT |
1797 | err = -EIO; |
1798 | goto out; | |
1799 | } | |
1800 | if (retval == POSITION_FOUND || retval == FILE_NOT_FOUND) { | |
995c762e | 1801 | reiserfs_error(inode->i_sb, "PAP-5660", |
0030b645 JM |
1802 | "wrong result %d of search for %K", retval, |
1803 | &s_item_key); | |
bd4c625c LT |
1804 | |
1805 | err = -EIO; | |
1806 | goto out; | |
1807 | } | |
1da177e4 | 1808 | |
bd4c625c LT |
1809 | s_search_path.pos_in_item--; |
1810 | ||
1811 | /* Get real file size (total length of all file items) */ | |
1812 | p_le_ih = PATH_PITEM_HEAD(&s_search_path); | |
1813 | if (is_statdata_le_ih(p_le_ih)) | |
ee93961b | 1814 | file_size = 0; |
bd4c625c LT |
1815 | else { |
1816 | loff_t offset = le_ih_k_offset(p_le_ih); | |
1817 | int bytes = | |
995c762e | 1818 | op_bytes_number(p_le_ih, inode->i_sb->s_blocksize); |
bd4c625c LT |
1819 | |
1820 | /* this may mismatch with real file size: if last direct item | |
1821 | had no padding zeros and last unformatted node had no free | |
1822 | space, this file would have this file size */ | |
ee93961b | 1823 | file_size = offset + bytes - 1; |
bd4c625c LT |
1824 | } |
1825 | /* | |
1826 | * are we doing a full truncate or delete, if so | |
1827 | * kick in the reada code | |
1828 | */ | |
ee93961b | 1829 | if (new_file_size == 0) |
bd4c625c LT |
1830 | s_search_path.reada = PATH_READA | PATH_READA_BACK; |
1831 | ||
ee93961b | 1832 | if (file_size == 0 || file_size < new_file_size) { |
bd4c625c | 1833 | goto update_and_out; |
1da177e4 LT |
1834 | } |
1835 | ||
bd4c625c | 1836 | /* Update key to search for the last file item. */ |
ee93961b | 1837 | set_cpu_key_k_offset(&s_item_key, file_size); |
bd4c625c LT |
1838 | |
1839 | do { | |
1840 | /* Cut or delete file item. */ | |
ee93961b | 1841 | deleted = |
bd4c625c | 1842 | reiserfs_cut_from_item(th, &s_search_path, &s_item_key, |
ee93961b JM |
1843 | inode, page, new_file_size); |
1844 | if (deleted < 0) { | |
995c762e | 1845 | reiserfs_warning(inode->i_sb, "vs-5665", |
45b03d5e | 1846 | "reiserfs_cut_from_item failed"); |
bd4c625c LT |
1847 | reiserfs_check_path(&s_search_path); |
1848 | return 0; | |
1849 | } | |
1da177e4 | 1850 | |
ee93961b | 1851 | RFALSE(deleted > file_size, |
bd4c625c | 1852 | "PAP-5670: reiserfs_cut_from_item: too many bytes deleted: deleted %d, file_size %lu, item_key %K", |
ee93961b | 1853 | deleted, file_size, &s_item_key); |
1da177e4 | 1854 | |
bd4c625c | 1855 | /* Change key to search the last file item. */ |
ee93961b | 1856 | file_size -= deleted; |
1da177e4 | 1857 | |
ee93961b | 1858 | set_cpu_key_k_offset(&s_item_key, file_size); |
1da177e4 | 1859 | |
bd4c625c LT |
1860 | /* While there are bytes to truncate and previous file item is presented in the tree. */ |
1861 | ||
1862 | /* | |
0222e657 | 1863 | ** This loop could take a really long time, and could log |
bd4c625c LT |
1864 | ** many more blocks than a transaction can hold. So, we do a polite |
1865 | ** journal end here, and if the transaction needs ending, we make | |
1866 | ** sure the file is consistent before ending the current trans | |
1867 | ** and starting a new one | |
1868 | */ | |
23f9e0f8 AZ |
1869 | if (journal_transaction_should_end(th, 0) || |
1870 | reiserfs_transaction_free_space(th) <= JOURNAL_FOR_FREE_BLOCK_AND_UPDATE_SD) { | |
bd4c625c | 1871 | int orig_len_alloc = th->t_blocks_allocated; |
3cd6dbe6 | 1872 | pathrelse(&s_search_path); |
bd4c625c LT |
1873 | |
1874 | if (update_timestamps) { | |
995c762e JM |
1875 | inode->i_mtime = CURRENT_TIME_SEC; |
1876 | inode->i_ctime = CURRENT_TIME_SEC; | |
bd4c625c | 1877 | } |
995c762e | 1878 | reiserfs_update_sd(th, inode); |
bd4c625c | 1879 | |
995c762e | 1880 | err = journal_end(th, inode->i_sb, orig_len_alloc); |
bd4c625c LT |
1881 | if (err) |
1882 | goto out; | |
995c762e | 1883 | err = journal_begin(th, inode->i_sb, |
23f9e0f8 | 1884 | JOURNAL_FOR_FREE_BLOCK_AND_UPDATE_SD + JOURNAL_PER_BALANCE_CNT * 4) ; |
bd4c625c LT |
1885 | if (err) |
1886 | goto out; | |
995c762e | 1887 | reiserfs_update_inode_transaction(inode); |
bd4c625c | 1888 | } |
ee93961b | 1889 | } while (file_size > ROUND_UP(new_file_size) && |
995c762e | 1890 | search_for_position_by_key(inode->i_sb, &s_item_key, |
bd4c625c LT |
1891 | &s_search_path) == POSITION_FOUND); |
1892 | ||
ee93961b | 1893 | RFALSE(file_size > ROUND_UP(new_file_size), |
bd4c625c | 1894 | "PAP-5680: truncate did not finish: new_file_size %Ld, current %Ld, oid %d", |
ee93961b | 1895 | new_file_size, file_size, s_item_key.on_disk_key.k_objectid); |
bd4c625c LT |
1896 | |
1897 | update_and_out: | |
1898 | if (update_timestamps) { | |
1899 | // this is truncate, not file closing | |
995c762e JM |
1900 | inode->i_mtime = CURRENT_TIME_SEC; |
1901 | inode->i_ctime = CURRENT_TIME_SEC; | |
1da177e4 | 1902 | } |
995c762e | 1903 | reiserfs_update_sd(th, inode); |
1da177e4 | 1904 | |
bd4c625c LT |
1905 | out: |
1906 | pathrelse(&s_search_path); | |
1907 | return err; | |
1908 | } | |
1da177e4 LT |
1909 | |
1910 | #ifdef CONFIG_REISERFS_CHECK | |
1911 | // this makes sure, that we __append__, not overwrite or add holes | |
fec6d055 | 1912 | static void check_research_for_paste(struct treepath *path, |
d68caa95 | 1913 | const struct cpu_key *key) |
1da177e4 | 1914 | { |
bd4c625c LT |
1915 | struct item_head *found_ih = get_ih(path); |
1916 | ||
1917 | if (is_direct_le_ih(found_ih)) { | |
1918 | if (le_ih_k_offset(found_ih) + | |
1919 | op_bytes_number(found_ih, | |
1920 | get_last_bh(path)->b_size) != | |
d68caa95 | 1921 | cpu_key_k_offset(key) |
bd4c625c LT |
1922 | || op_bytes_number(found_ih, |
1923 | get_last_bh(path)->b_size) != | |
1924 | pos_in_item(path)) | |
c3a9c210 JM |
1925 | reiserfs_panic(NULL, "PAP-5720", "found direct item " |
1926 | "%h or position (%d) does not match " | |
1927 | "to key %K", found_ih, | |
d68caa95 | 1928 | pos_in_item(path), key); |
bd4c625c LT |
1929 | } |
1930 | if (is_indirect_le_ih(found_ih)) { | |
1931 | if (le_ih_k_offset(found_ih) + | |
1932 | op_bytes_number(found_ih, | |
1933 | get_last_bh(path)->b_size) != | |
d68caa95 | 1934 | cpu_key_k_offset(key) |
bd4c625c LT |
1935 | || I_UNFM_NUM(found_ih) != pos_in_item(path) |
1936 | || get_ih_free_space(found_ih) != 0) | |
c3a9c210 JM |
1937 | reiserfs_panic(NULL, "PAP-5730", "found indirect " |
1938 | "item (%h) or position (%d) does not " | |
1939 | "match to key (%K)", | |
d68caa95 | 1940 | found_ih, pos_in_item(path), key); |
bd4c625c | 1941 | } |
1da177e4 | 1942 | } |
bd4c625c | 1943 | #endif /* config reiserfs check */ |
1da177e4 LT |
1944 | |
1945 | /* Paste bytes to the existing item. Returns bytes number pasted into the item. */ | |
d68caa95 JM |
1946 | int reiserfs_paste_into_item(struct reiserfs_transaction_handle *th, struct treepath *search_path, /* Path to the pasted item. */ |
1947 | const struct cpu_key *key, /* Key to search for the needed item. */ | |
bd4c625c | 1948 | struct inode *inode, /* Inode item belongs to */ |
d68caa95 | 1949 | const char *body, /* Pointer to the bytes to paste. */ |
ee93961b | 1950 | int pasted_size) |
bd4c625c LT |
1951 | { /* Size of pasted bytes. */ |
1952 | struct tree_balance s_paste_balance; | |
1953 | int retval; | |
1954 | int fs_gen; | |
1955 | ||
1956 | BUG_ON(!th->t_trans_id); | |
1da177e4 | 1957 | |
bd4c625c | 1958 | fs_gen = get_generation(inode->i_sb); |
1da177e4 LT |
1959 | |
1960 | #ifdef REISERQUOTA_DEBUG | |
bd4c625c LT |
1961 | reiserfs_debug(inode->i_sb, REISERFS_DEBUG_CODE, |
1962 | "reiserquota paste_into_item(): allocating %u id=%u type=%c", | |
ee93961b | 1963 | pasted_size, inode->i_uid, |
d68caa95 | 1964 | key2type(&(key->on_disk_key))); |
1da177e4 LT |
1965 | #endif |
1966 | ||
7af11686 | 1967 | reiserfs_write_unlock(inode->i_sb); |
5dd4056d | 1968 | retval = dquot_alloc_space_nodirty(inode, pasted_size); |
7af11686 | 1969 | reiserfs_write_lock(inode->i_sb); |
5dd4056d | 1970 | if (retval) { |
d68caa95 | 1971 | pathrelse(search_path); |
5dd4056d | 1972 | return retval; |
bd4c625c | 1973 | } |
d68caa95 | 1974 | init_tb_struct(th, &s_paste_balance, th->t_super, search_path, |
ee93961b | 1975 | pasted_size); |
1da177e4 | 1976 | #ifdef DISPLACE_NEW_PACKING_LOCALITIES |
d68caa95 | 1977 | s_paste_balance.key = key->on_disk_key; |
1da177e4 LT |
1978 | #endif |
1979 | ||
bd4c625c LT |
1980 | /* DQUOT_* can schedule, must check before the fix_nodes */ |
1981 | if (fs_changed(fs_gen, inode->i_sb)) { | |
1982 | goto search_again; | |
1da177e4 | 1983 | } |
bd4c625c LT |
1984 | |
1985 | while ((retval = | |
1986 | fix_nodes(M_PASTE, &s_paste_balance, NULL, | |
d68caa95 | 1987 | body)) == REPEAT_SEARCH) { |
bd4c625c LT |
1988 | search_again: |
1989 | /* file system changed while we were in the fix_nodes */ | |
1990 | PROC_INFO_INC(th->t_super, paste_into_item_restarted); | |
1991 | retval = | |
d68caa95 JM |
1992 | search_for_position_by_key(th->t_super, key, |
1993 | search_path); | |
bd4c625c LT |
1994 | if (retval == IO_ERROR) { |
1995 | retval = -EIO; | |
1996 | goto error_out; | |
1997 | } | |
1998 | if (retval == POSITION_FOUND) { | |
45b03d5e JM |
1999 | reiserfs_warning(inode->i_sb, "PAP-5710", |
2000 | "entry or pasted byte (%K) exists", | |
d68caa95 | 2001 | key); |
bd4c625c LT |
2002 | retval = -EEXIST; |
2003 | goto error_out; | |
2004 | } | |
1da177e4 | 2005 | #ifdef CONFIG_REISERFS_CHECK |
d68caa95 | 2006 | check_research_for_paste(search_path, key); |
1da177e4 | 2007 | #endif |
bd4c625c | 2008 | } |
1da177e4 | 2009 | |
bd4c625c LT |
2010 | /* Perform balancing after all resources are collected by fix_nodes, and |
2011 | accessing them will not risk triggering schedule. */ | |
2012 | if (retval == CARRY_ON) { | |
d68caa95 | 2013 | do_balance(&s_paste_balance, NULL /*ih */ , body, M_PASTE); |
bd4c625c LT |
2014 | return 0; |
2015 | } | |
2016 | retval = (retval == NO_DISK_SPACE) ? -ENOSPC : -EIO; | |
2017 | error_out: | |
2018 | /* this also releases the path */ | |
2019 | unfix_nodes(&s_paste_balance); | |
1da177e4 | 2020 | #ifdef REISERQUOTA_DEBUG |
bd4c625c LT |
2021 | reiserfs_debug(inode->i_sb, REISERFS_DEBUG_CODE, |
2022 | "reiserquota paste_into_item(): freeing %u id=%u type=%c", | |
ee93961b | 2023 | pasted_size, inode->i_uid, |
d68caa95 | 2024 | key2type(&(key->on_disk_key))); |
1da177e4 | 2025 | #endif |
5dd4056d | 2026 | dquot_free_space_nodirty(inode, pasted_size); |
bd4c625c | 2027 | return retval; |
1da177e4 LT |
2028 | } |
2029 | ||
d68caa95 JM |
2030 | /* Insert new item into the buffer at the path. |
2031 | * th - active transaction handle | |
2032 | * path - path to the inserted item | |
2033 | * ih - pointer to the item header to insert | |
2034 | * body - pointer to the bytes to insert | |
2035 | */ | |
2036 | int reiserfs_insert_item(struct reiserfs_transaction_handle *th, | |
2037 | struct treepath *path, const struct cpu_key *key, | |
2038 | struct item_head *ih, struct inode *inode, | |
2039 | const char *body) | |
2040 | { | |
bd4c625c LT |
2041 | struct tree_balance s_ins_balance; |
2042 | int retval; | |
2043 | int fs_gen = 0; | |
2044 | int quota_bytes = 0; | |
2045 | ||
2046 | BUG_ON(!th->t_trans_id); | |
2047 | ||
2048 | if (inode) { /* Do we count quotas for item? */ | |
2049 | fs_gen = get_generation(inode->i_sb); | |
d68caa95 | 2050 | quota_bytes = ih_item_len(ih); |
bd4c625c LT |
2051 | |
2052 | /* hack so the quota code doesn't have to guess if the file has | |
2053 | ** a tail, links are always tails, so there's no guessing needed | |
2054 | */ | |
d68caa95 | 2055 | if (!S_ISLNK(inode->i_mode) && is_direct_le_ih(ih)) |
bd4c625c | 2056 | quota_bytes = inode->i_sb->s_blocksize + UNFM_P_SIZE; |
1da177e4 | 2057 | #ifdef REISERQUOTA_DEBUG |
bd4c625c LT |
2058 | reiserfs_debug(inode->i_sb, REISERFS_DEBUG_CODE, |
2059 | "reiserquota insert_item(): allocating %u id=%u type=%c", | |
d68caa95 | 2060 | quota_bytes, inode->i_uid, head2type(ih)); |
1da177e4 | 2061 | #endif |
7af11686 | 2062 | reiserfs_write_unlock(inode->i_sb); |
bd4c625c LT |
2063 | /* We can't dirty inode here. It would be immediately written but |
2064 | * appropriate stat item isn't inserted yet... */ | |
5dd4056d | 2065 | retval = dquot_alloc_space_nodirty(inode, quota_bytes); |
7af11686 | 2066 | reiserfs_write_lock(inode->i_sb); |
5dd4056d | 2067 | if (retval) { |
d68caa95 | 2068 | pathrelse(path); |
5dd4056d | 2069 | return retval; |
bd4c625c | 2070 | } |
1da177e4 | 2071 | } |
d68caa95 JM |
2072 | init_tb_struct(th, &s_ins_balance, th->t_super, path, |
2073 | IH_SIZE + ih_item_len(ih)); | |
1da177e4 | 2074 | #ifdef DISPLACE_NEW_PACKING_LOCALITIES |
bd4c625c | 2075 | s_ins_balance.key = key->on_disk_key; |
1da177e4 | 2076 | #endif |
bd4c625c LT |
2077 | /* DQUOT_* can schedule, must check to be sure calling fix_nodes is safe */ |
2078 | if (inode && fs_changed(fs_gen, inode->i_sb)) { | |
2079 | goto search_again; | |
1da177e4 | 2080 | } |
bd4c625c LT |
2081 | |
2082 | while ((retval = | |
d68caa95 JM |
2083 | fix_nodes(M_INSERT, &s_ins_balance, ih, |
2084 | body)) == REPEAT_SEARCH) { | |
bd4c625c LT |
2085 | search_again: |
2086 | /* file system changed while we were in the fix_nodes */ | |
2087 | PROC_INFO_INC(th->t_super, insert_item_restarted); | |
d68caa95 | 2088 | retval = search_item(th->t_super, key, path); |
bd4c625c LT |
2089 | if (retval == IO_ERROR) { |
2090 | retval = -EIO; | |
2091 | goto error_out; | |
2092 | } | |
2093 | if (retval == ITEM_FOUND) { | |
45b03d5e | 2094 | reiserfs_warning(th->t_super, "PAP-5760", |
bd4c625c LT |
2095 | "key %K already exists in the tree", |
2096 | key); | |
2097 | retval = -EEXIST; | |
2098 | goto error_out; | |
2099 | } | |
1da177e4 | 2100 | } |
1da177e4 | 2101 | |
bd4c625c LT |
2102 | /* make balancing after all resources will be collected at a time */ |
2103 | if (retval == CARRY_ON) { | |
d68caa95 | 2104 | do_balance(&s_ins_balance, ih, body, M_INSERT); |
bd4c625c LT |
2105 | return 0; |
2106 | } | |
1da177e4 | 2107 | |
bd4c625c LT |
2108 | retval = (retval == NO_DISK_SPACE) ? -ENOSPC : -EIO; |
2109 | error_out: | |
2110 | /* also releases the path */ | |
2111 | unfix_nodes(&s_ins_balance); | |
1da177e4 | 2112 | #ifdef REISERQUOTA_DEBUG |
bd4c625c LT |
2113 | reiserfs_debug(th->t_super, REISERFS_DEBUG_CODE, |
2114 | "reiserquota insert_item(): freeing %u id=%u type=%c", | |
d68caa95 | 2115 | quota_bytes, inode->i_uid, head2type(ih)); |
1da177e4 | 2116 | #endif |
bd4c625c | 2117 | if (inode) |
5dd4056d | 2118 | dquot_free_space_nodirty(inode, quota_bytes); |
bd4c625c | 2119 | return retval; |
1da177e4 | 2120 | } |