2 * Copyright 2000 by Hans Reiser, licensing governed by reiserfs/README
6 * Written by Anatoly P. Pinchuk pap@namesys.botik.ru
7 * Programm System Institute
8 * Pereslavl-Zalessky Russia
12 * This file contains functions dealing with S+tree
27 * pathrelse_and_restore
31 * search_for_position_by_key
33 * prepare_for_direct_item
34 * prepare_for_direntry_item
35 * prepare_for_delete_or_cut
36 * calc_deleted_bytes_number
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
46 * reiserfs_do_truncate
47 * reiserfs_paste_into_item
48 * reiserfs_insert_item
51 #include <linux/time.h>
52 #include <linux/string.h>
53 #include <linux/pagemap.h>
54 #include <linux/reiserfs_fs.h>
55 #include <linux/buffer_head.h>
56 #include <linux/quotaops.h>
58 /* Does the buffer contain a disk block which is in the tree. */
59 inline int B_IS_IN_TREE(const struct buffer_head *bh)
62 RFALSE(B_LEVEL(bh) > MAX_HEIGHT,
63 "PAP-1010: block (%b) has too big level (%z)", bh, bh);
65 return (B_LEVEL(bh) != FREE_LEVEL);
69 // to gets item head in le form
71 inline void copy_item_head(struct item_head *to,
72 const struct item_head *from)
74 memcpy(to, from, IH_SIZE);
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.
80 Returns: -1 if key1 < key2
83 inline int comp_short_keys(const struct reiserfs_key *le_key,
84 const struct cpu_key *cpu_key)
87 n = le32_to_cpu(le_key->k_dir_id);
88 if (n < cpu_key->on_disk_key.k_dir_id)
90 if (n > cpu_key->on_disk_key.k_dir_id)
92 n = le32_to_cpu(le_key->k_objectid);
93 if (n < cpu_key->on_disk_key.k_objectid)
95 if (n > cpu_key->on_disk_key.k_objectid)
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 */
105 static inline int comp_keys(const struct reiserfs_key *le_key,
106 const struct cpu_key *cpu_key)
110 retval = comp_short_keys(le_key, cpu_key);
113 if (le_key_k_offset(le_key_version(le_key), le_key) <
114 cpu_key_k_offset(cpu_key))
116 if (le_key_k_offset(le_key_version(le_key), le_key) >
117 cpu_key_k_offset(cpu_key))
120 if (cpu_key->key_length == 3)
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))
128 if (le_key_k_type(le_key_version(le_key), le_key) >
129 cpu_key_k_type(cpu_key))
135 inline int comp_short_le_keys(const struct reiserfs_key *key1,
136 const struct reiserfs_key *key2)
138 __u32 *k1_u32, *k2_u32;
139 int n_key_length = REISERFS_SHORT_KEY_LEN;
141 k1_u32 = (__u32 *) key1;
142 k2_u32 = (__u32 *) key2;
143 for (; n_key_length--; ++k1_u32, ++k2_u32) {
144 if (le32_to_cpu(*k1_u32) < le32_to_cpu(*k2_u32))
146 if (le32_to_cpu(*k1_u32) > le32_to_cpu(*k2_u32))
152 inline void le_key2cpu_key(struct cpu_key *to, const struct reiserfs_key *from)
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);
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);
165 // this does not say which one is bigger, it only returns 1 if keys
166 // are not equal, 0 otherwise
167 inline int comp_le_keys(const struct reiserfs_key *k1,
168 const struct reiserfs_key *k2)
170 return memcmp(k1, k2, sizeof(struct reiserfs_key));
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; *
177 * *pos = number of the searched element if found, else the *
178 * number of the first element that is larger than key. *
179 **************************************************************************/
180 /* For those not familiar with binary search: n_lbound is the leftmost item that it
181 could be, n_rbound the rightmost item that it could be. We examine the item
182 halfway between n_lbound and n_rbound, and that tells us either that we can increase
183 n_lbound, or decrease n_rbound, or that we have found it, or if n_lbound <= n_rbound that
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,
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
198 int *pos /* Number of the searched for element. */
201 int n_rbound, n_lbound, n_j;
203 for (n_j = ((n_rbound = num - 1) + (n_lbound = 0)) / 2;
204 n_lbound <= n_rbound; n_j = (n_rbound + n_lbound) / 2)
206 ((struct reiserfs_key *)((char *)base +
208 (struct cpu_key *)key)) {
217 return ITEM_FOUND; /* Key found in the array. */
220 /* bin_search did not find given key, it returns position of key,
221 that is minimal and greater than the given one. */
223 return ITEM_NOT_FOUND;
226 #ifdef CONFIG_REISERFS_CHECK
227 extern struct tree_balance *cur_tb;
230 /* Minimal possible key. It is never in the tree. */
231 const struct reiserfs_key MIN_KEY = { 0, 0, {{0, 0},} };
233 /* Maximal possible key. It is never in the tree. */
234 static const struct reiserfs_key MAX_KEY = {
235 __constant_cpu_to_le32(0xffffffff),
236 __constant_cpu_to_le32(0xffffffff),
237 {{__constant_cpu_to_le32(0xffffffff),
238 __constant_cpu_to_le32(0xffffffff)},}
241 /* Get delimiting key of the buffer by looking for it in the buffers in the path, starting from the bottom
242 of the path, and going upwards. We must check the path's validity at each step. If the key is not in
243 the path, there is no delimiting key in the tree (buffer is first or last buffer in tree), and in this
244 case we return a special key, either MIN_KEY or MAX_KEY. */
245 static inline const struct reiserfs_key *get_lkey(const struct treepath
247 const struct super_block
250 int n_position, n_path_offset = chk_path->path_length;
251 struct buffer_head *parent;
253 RFALSE(n_path_offset < FIRST_PATH_ELEMENT_OFFSET,
254 "PAP-5010: invalid offset in the path");
256 /* While not higher in path than first element. */
257 while (n_path_offset-- > FIRST_PATH_ELEMENT_OFFSET) {
259 RFALSE(!buffer_uptodate
260 (PATH_OFFSET_PBUFFER(chk_path, n_path_offset)),
261 "PAP-5020: parent is not uptodate");
263 /* Parent at the path is not in the tree now. */
266 PATH_OFFSET_PBUFFER(chk_path, n_path_offset)))
268 /* Check whether position in the parent is correct. */
270 PATH_OFFSET_POSITION(chk_path,
274 /* Check whether parent at the path really points to the child. */
275 if (B_N_CHILD_NUM(parent, n_position) !=
276 PATH_OFFSET_PBUFFER(chk_path,
277 n_path_offset + 1)->b_blocknr)
279 /* Return delimiting key if position in the parent is not equal to zero. */
281 return B_N_PDELIM_KEY(parent, n_position - 1);
283 /* Return MIN_KEY if we are in the root of the buffer tree. */
284 if (PATH_OFFSET_PBUFFER(chk_path, FIRST_PATH_ELEMENT_OFFSET)->
285 b_blocknr == SB_ROOT_BLOCK(sb))
290 /* Get delimiting key of the buffer at the path and its right neighbor. */
291 inline const struct reiserfs_key *get_rkey(const struct treepath *chk_path,
292 const struct super_block *sb)
294 int n_position, n_path_offset = chk_path->path_length;
295 struct buffer_head *parent;
297 RFALSE(n_path_offset < FIRST_PATH_ELEMENT_OFFSET,
298 "PAP-5030: invalid offset in the path");
300 while (n_path_offset-- > FIRST_PATH_ELEMENT_OFFSET) {
302 RFALSE(!buffer_uptodate
303 (PATH_OFFSET_PBUFFER(chk_path, n_path_offset)),
304 "PAP-5040: parent is not uptodate");
306 /* Parent at the path is not in the tree now. */
309 PATH_OFFSET_PBUFFER(chk_path, n_path_offset)))
311 /* Check whether position in the parent is correct. */
313 PATH_OFFSET_POSITION(chk_path,
317 /* Check whether parent at the path really points to the child. */
318 if (B_N_CHILD_NUM(parent, n_position) !=
319 PATH_OFFSET_PBUFFER(chk_path,
320 n_path_offset + 1)->b_blocknr)
322 /* Return delimiting key if position in the parent is not the last one. */
323 if (n_position != B_NR_ITEMS(parent))
324 return B_N_PDELIM_KEY(parent, n_position);
326 /* Return MAX_KEY if we are in the root of the buffer tree. */
327 if (PATH_OFFSET_PBUFFER(chk_path, FIRST_PATH_ELEMENT_OFFSET)->
328 b_blocknr == SB_ROOT_BLOCK(sb))
333 /* Check whether a key is contained in the tree rooted from a buffer at a path. */
334 /* This works by looking at the left and right delimiting keys for the buffer in the last path_element in
335 the path. These delimiting keys are stored at least one level above that buffer in the tree. If the
336 buffer is the first or last node in the tree order then one of the delimiting keys may be absent, and in
337 this case get_lkey and get_rkey return a special key which is MIN_KEY or MAX_KEY. */
338 static inline int key_in_buffer(struct treepath *chk_path, /* Path which should be checked. */
339 const struct cpu_key *key, /* Key which should be checked. */
340 struct super_block *sb
344 RFALSE(!key || chk_path->path_length < FIRST_PATH_ELEMENT_OFFSET
345 || chk_path->path_length > MAX_HEIGHT,
346 "PAP-5050: pointer to the key(%p) is NULL or invalid path length(%d)",
347 key, chk_path->path_length);
348 RFALSE(!PATH_PLAST_BUFFER(chk_path)->b_bdev,
349 "PAP-5060: device must not be NODEV");
351 if (comp_keys(get_lkey(chk_path, sb), key) == 1)
352 /* left delimiting key is bigger, that the key we look for */
354 /* if ( comp_keys(key, get_rkey(chk_path, sb)) != -1 ) */
355 if (comp_keys(get_rkey(chk_path, sb), key) != 1)
356 /* key must be less than right delimitiing key */
361 int reiserfs_check_path(struct treepath *p)
363 RFALSE(p->path_length != ILLEGAL_PATH_ELEMENT_OFFSET,
364 "path not properly relsed");
368 /* Drop the reference to each buffer in a path and restore
369 * dirty bits clean when preparing the buffer for the log.
370 * This version should only be called from fix_nodes() */
371 void pathrelse_and_restore(struct super_block *sb,
372 struct treepath *search_path)
374 int n_path_offset = search_path->path_length;
376 RFALSE(n_path_offset < ILLEGAL_PATH_ELEMENT_OFFSET,
377 "clm-4000: invalid path offset");
379 while (n_path_offset > ILLEGAL_PATH_ELEMENT_OFFSET) {
380 struct buffer_head *bh;
381 bh = PATH_OFFSET_PBUFFER(search_path, n_path_offset--);
382 reiserfs_restore_prepared_buffer(sb, bh);
385 search_path->path_length = ILLEGAL_PATH_ELEMENT_OFFSET;
388 /* Drop the reference to each buffer in a path */
389 void pathrelse(struct treepath *search_path)
391 int n_path_offset = search_path->path_length;
393 RFALSE(n_path_offset < ILLEGAL_PATH_ELEMENT_OFFSET,
394 "PAP-5090: invalid path offset");
396 while (n_path_offset > ILLEGAL_PATH_ELEMENT_OFFSET)
397 brelse(PATH_OFFSET_PBUFFER(search_path, n_path_offset--));
399 search_path->path_length = ILLEGAL_PATH_ELEMENT_OFFSET;
402 static int is_leaf(char *buf, int blocksize, struct buffer_head *bh)
404 struct block_head *blkh;
405 struct item_head *ih;
411 blkh = (struct block_head *)buf;
412 if (blkh_level(blkh) != DISK_LEAF_NODE_LEVEL) {
413 reiserfs_warning(NULL, "reiserfs-5080",
414 "this should be caught earlier");
418 nr = blkh_nr_item(blkh);
419 if (nr < 1 || nr > ((blocksize - BLKH_SIZE) / (IH_SIZE + MIN_ITEM_LEN))) {
420 /* item number is too big or too small */
421 reiserfs_warning(NULL, "reiserfs-5081",
422 "nr_item seems wrong: %z", bh);
425 ih = (struct item_head *)(buf + BLKH_SIZE) + nr - 1;
426 used_space = BLKH_SIZE + IH_SIZE * nr + (blocksize - ih_location(ih));
427 if (used_space != blocksize - blkh_free_space(blkh)) {
428 /* free space does not match to calculated amount of use space */
429 reiserfs_warning(NULL, "reiserfs-5082",
430 "free space seems wrong: %z", bh);
433 // FIXME: it is_leaf will hit performance too much - we may have
436 /* check tables of item heads */
437 ih = (struct item_head *)(buf + BLKH_SIZE);
438 prev_location = blocksize;
439 for (i = 0; i < nr; i++, ih++) {
440 if (le_ih_k_type(ih) == TYPE_ANY) {
441 reiserfs_warning(NULL, "reiserfs-5083",
442 "wrong item type for item %h",
446 if (ih_location(ih) >= blocksize
447 || ih_location(ih) < IH_SIZE * nr) {
448 reiserfs_warning(NULL, "reiserfs-5084",
449 "item location seems wrong: %h",
453 if (ih_item_len(ih) < 1
454 || ih_item_len(ih) > MAX_ITEM_LEN(blocksize)) {
455 reiserfs_warning(NULL, "reiserfs-5085",
456 "item length seems wrong: %h",
460 if (prev_location - ih_location(ih) != ih_item_len(ih)) {
461 reiserfs_warning(NULL, "reiserfs-5086",
462 "item location seems wrong "
463 "(second one): %h", ih);
466 prev_location = ih_location(ih);
469 // one may imagine much more checks
473 /* returns 1 if buf looks like an internal node, 0 otherwise */
474 static int is_internal(char *buf, int blocksize, struct buffer_head *bh)
476 struct block_head *blkh;
480 blkh = (struct block_head *)buf;
481 nr = blkh_level(blkh);
482 if (nr <= DISK_LEAF_NODE_LEVEL || nr > MAX_HEIGHT) {
483 /* this level is not possible for internal nodes */
484 reiserfs_warning(NULL, "reiserfs-5087",
485 "this should be caught earlier");
489 nr = blkh_nr_item(blkh);
490 if (nr > (blocksize - BLKH_SIZE - DC_SIZE) / (KEY_SIZE + DC_SIZE)) {
491 /* for internal which is not root we might check min number of keys */
492 reiserfs_warning(NULL, "reiserfs-5088",
493 "number of key seems wrong: %z", bh);
497 used_space = BLKH_SIZE + KEY_SIZE * nr + DC_SIZE * (nr + 1);
498 if (used_space != blocksize - blkh_free_space(blkh)) {
499 reiserfs_warning(NULL, "reiserfs-5089",
500 "free space seems wrong: %z", bh);
503 // one may imagine much more checks
507 // make sure that bh contains formatted node of reiserfs tree of
509 static int is_tree_node(struct buffer_head *bh, int level)
511 if (B_LEVEL(bh) != level) {
512 reiserfs_warning(NULL, "reiserfs-5090", "node level %d does "
513 "not match to the expected one %d",
517 if (level == DISK_LEAF_NODE_LEVEL)
518 return is_leaf(bh->b_data, bh->b_size, bh);
520 return is_internal(bh->b_data, bh->b_size, bh);
523 #define SEARCH_BY_KEY_READA 16
525 /* The function is NOT SCHEDULE-SAFE! */
526 static void search_by_key_reada(struct super_block *s,
527 struct buffer_head **bh,
528 b_blocknr_t *b, int num)
532 for (i = 0; i < num; i++) {
533 bh[i] = sb_getblk(s, b[i]);
535 for (j = 0; j < i; j++) {
537 * note, this needs attention if we are getting rid of the BKL
538 * you have to make sure the prepared bit isn't set on this buffer
540 if (!buffer_uptodate(bh[j]))
541 ll_rw_block(READA, 1, bh + j);
546 /**************************************************************************
547 * Algorithm SearchByKey *
548 * look for item in the Disk S+Tree by its key *
549 * Input: sb - super block *
550 * key - pointer to the key to search *
551 * Output: ITEM_FOUND, ITEM_NOT_FOUND or IO_ERROR *
552 * search_path - path from the root to the needed leaf *
553 **************************************************************************/
555 /* This function fills up the path from the root to the leaf as it
556 descends the tree looking for the key. It uses reiserfs_bread to
557 try to find buffers in the cache given their block number. If it
558 does not find them in the cache it reads them from disk. For each
559 node search_by_key finds using reiserfs_bread it then uses
560 bin_search to look through that node. bin_search will find the
561 position of the block_number of the next node if it is looking
562 through an internal node. If it is looking through a leaf node
563 bin_search will find the position of the item which has key either
564 equal to given key, or which is the maximal key less than the given
565 key. search_by_key returns a path that must be checked for the
566 correctness of the top of the path but need not be checked for the
567 correctness of the bottom of the path */
568 /* The function is NOT SCHEDULE-SAFE! */
569 int search_by_key(struct super_block *sb, const struct cpu_key *key, /* Key to search. */
570 struct treepath *search_path,/* This structure was
571 allocated and initialized
573 function. It is filled up
575 int n_stop_level /* How far down the tree to search. To
576 stop at leaf level - set to
577 DISK_LEAF_NODE_LEVEL */
580 b_blocknr_t n_block_number;
582 struct buffer_head *bh;
583 struct path_element *last_element;
584 int n_node_level, n_retval;
585 int right_neighbor_of_leaf_node;
587 struct buffer_head *reada_bh[SEARCH_BY_KEY_READA];
588 b_blocknr_t reada_blocks[SEARCH_BY_KEY_READA];
591 #ifdef CONFIG_REISERFS_CHECK
592 int n_repeat_counter = 0;
595 PROC_INFO_INC(sb, search_by_key);
597 /* As we add each node to a path we increase its count. This means that
598 we must be careful to release all nodes in a path before we either
599 discard the path struct or re-use the path struct, as we do here. */
601 pathrelse(search_path);
603 right_neighbor_of_leaf_node = 0;
605 /* With each iteration of this loop we search through the items in the
606 current node, and calculate the next current node(next path element)
607 for the next iteration of this loop.. */
608 n_block_number = SB_ROOT_BLOCK(sb);
612 #ifdef CONFIG_REISERFS_CHECK
613 if (!(++n_repeat_counter % 50000))
614 reiserfs_warning(sb, "PAP-5100",
615 "%s: there were %d iterations of "
616 "while loop looking for key %K",
617 current->comm, n_repeat_counter,
621 /* prep path to have another element added to it. */
623 PATH_OFFSET_PELEMENT(search_path,
624 ++search_path->path_length);
625 fs_gen = get_generation(sb);
627 /* Read the next tree node, and set the last element in the path to
628 have a pointer to it. */
629 if ((bh = last_element->pe_buffer =
630 sb_getblk(sb, n_block_number))) {
631 if (!buffer_uptodate(bh) && reada_count > 1)
632 search_by_key_reada(sb, reada_bh,
633 reada_blocks, reada_count);
634 ll_rw_block(READ, 1, &bh);
636 if (!buffer_uptodate(bh))
640 search_path->path_length--;
641 pathrelse(search_path);
645 if (expected_level == -1)
646 expected_level = SB_TREE_HEIGHT(sb);
649 /* It is possible that schedule occurred. We must check whether the key
650 to search is still in the tree rooted from the current buffer. If
651 not then repeat search from the root. */
652 if (fs_changed(fs_gen, sb) &&
653 (!B_IS_IN_TREE(bh) ||
654 B_LEVEL(bh) != expected_level ||
655 !key_in_buffer(search_path, key, sb))) {
656 PROC_INFO_INC(sb, search_by_key_fs_changed);
657 PROC_INFO_INC(sb, search_by_key_restarted);
659 sbk_restarted[expected_level - 1]);
660 pathrelse(search_path);
662 /* Get the root block number so that we can repeat the search
663 starting from the root. */
664 n_block_number = SB_ROOT_BLOCK(sb);
666 right_neighbor_of_leaf_node = 0;
668 /* repeat search from the root */
672 /* only check that the key is in the buffer if key is not
673 equal to the MAX_KEY. Latter case is only possible in
674 "finish_unfinished()" processing during mount. */
675 RFALSE(comp_keys(&MAX_KEY, key) &&
676 !key_in_buffer(search_path, key, sb),
677 "PAP-5130: key is not in the buffer");
678 #ifdef CONFIG_REISERFS_CHECK
680 print_cur_tb("5140");
681 reiserfs_panic(sb, "PAP-5140",
682 "schedule occurred in do_balance!");
686 // make sure, that the node contents look like a node of
688 if (!is_tree_node(bh, expected_level)) {
689 reiserfs_error(sb, "vs-5150",
690 "invalid format found in block %ld. "
691 "Fsck?", bh->b_blocknr);
692 pathrelse(search_path);
696 /* ok, we have acquired next formatted node in the tree */
697 n_node_level = B_LEVEL(bh);
699 PROC_INFO_BH_STAT(sb, bh, n_node_level - 1);
701 RFALSE(n_node_level < n_stop_level,
702 "vs-5152: tree level (%d) is less than stop level (%d)",
703 n_node_level, n_stop_level);
705 n_retval = bin_search(key, B_N_PITEM_HEAD(bh, 0),
708 DISK_LEAF_NODE_LEVEL) ? IH_SIZE :
710 &(last_element->pe_position));
711 if (n_node_level == n_stop_level) {
715 /* we are not in the stop level */
716 if (n_retval == ITEM_FOUND)
717 /* item has been found, so we choose the pointer which is to the right of the found one */
718 last_element->pe_position++;
720 /* if item was not found we choose the position which is to
721 the left of the found item. This requires no code,
722 bin_search did it already. */
724 /* So we have chosen a position in the current node which is
725 an internal node. Now we calculate child block number by
726 position in the node. */
728 B_N_CHILD_NUM(bh, last_element->pe_position);
730 /* if we are going to read leaf nodes, try for read ahead as well */
731 if ((search_path->reada & PATH_READA) &&
732 n_node_level == DISK_LEAF_NODE_LEVEL + 1) {
733 int pos = last_element->pe_position;
734 int limit = B_NR_ITEMS(bh);
735 struct reiserfs_key *le_key;
737 if (search_path->reada & PATH_READA_BACK)
739 while (reada_count < SEARCH_BY_KEY_READA) {
742 reada_blocks[reada_count++] =
743 B_N_CHILD_NUM(bh, pos);
744 if (search_path->reada & PATH_READA_BACK)
750 * check to make sure we're in the same object
752 le_key = B_N_PDELIM_KEY(bh, pos);
753 if (le32_to_cpu(le_key->k_objectid) !=
754 key->on_disk_key.k_objectid) {
762 /* Form the path to an item and position in this item which contains
763 file byte defined by key. If there is no such item
764 corresponding to the key, we point the path to the item with
765 maximal key less than key, and *pos_in_item is set to one
766 past the last entry/byte in the item. If searching for entry in a
767 directory item, and it is not found, *pos_in_item is set to one
768 entry more than the entry with maximal key which is less than the
771 Note that if there is no entry in this same node which is one more,
772 then we point to an imaginary entry. for direct items, the
773 position is in units of bytes, for indirect items the position is
774 in units of blocknr entries, for directory items the position is in
775 units of directory entries. */
777 /* The function is NOT SCHEDULE-SAFE! */
778 int search_for_position_by_key(struct super_block *sb, /* Pointer to the super block. */
779 const struct cpu_key *p_cpu_key, /* Key to search (cpu variable) */
780 struct treepath *search_path /* Filled up by this function. */
783 struct item_head *p_le_ih; /* pointer to on-disk structure */
785 loff_t item_offset, offset;
786 struct reiserfs_dir_entry de;
789 /* If searching for directory entry. */
790 if (is_direntry_cpu_key(p_cpu_key))
791 return search_by_entry_key(sb, p_cpu_key, search_path,
794 /* If not searching for directory entry. */
796 /* If item is found. */
797 retval = search_item(sb, p_cpu_key, search_path);
798 if (retval == IO_ERROR)
800 if (retval == ITEM_FOUND) {
804 (PATH_PLAST_BUFFER(search_path),
805 PATH_LAST_POSITION(search_path))),
806 "PAP-5165: item length equals zero");
808 pos_in_item(search_path) = 0;
809 return POSITION_FOUND;
812 RFALSE(!PATH_LAST_POSITION(search_path),
813 "PAP-5170: position equals zero");
815 /* Item is not found. Set path to the previous item. */
817 B_N_PITEM_HEAD(PATH_PLAST_BUFFER(search_path),
818 --PATH_LAST_POSITION(search_path));
819 n_blk_size = sb->s_blocksize;
821 if (comp_short_keys(&(p_le_ih->ih_key), p_cpu_key)) {
822 return FILE_NOT_FOUND;
824 // FIXME: quite ugly this far
826 item_offset = le_ih_k_offset(p_le_ih);
827 offset = cpu_key_k_offset(p_cpu_key);
829 /* Needed byte is contained in the item pointed to by the path. */
830 if (item_offset <= offset &&
831 item_offset + op_bytes_number(p_le_ih, n_blk_size) > offset) {
832 pos_in_item(search_path) = offset - item_offset;
833 if (is_indirect_le_ih(p_le_ih)) {
834 pos_in_item(search_path) /= n_blk_size;
836 return POSITION_FOUND;
839 /* Needed byte is not contained in the item pointed to by the
840 path. Set pos_in_item out of the item. */
841 if (is_indirect_le_ih(p_le_ih))
842 pos_in_item(search_path) =
843 ih_item_len(p_le_ih) / UNFM_P_SIZE;
845 pos_in_item(search_path) = ih_item_len(p_le_ih);
847 return POSITION_NOT_FOUND;
850 /* Compare given item and item pointed to by the path. */
851 int comp_items(const struct item_head *stored_ih, const struct treepath *path)
853 struct buffer_head *bh = PATH_PLAST_BUFFER(path);
854 struct item_head *ih;
856 /* Last buffer at the path is not in the tree. */
857 if (!B_IS_IN_TREE(bh))
860 /* Last path position is invalid. */
861 if (PATH_LAST_POSITION(path) >= B_NR_ITEMS(bh))
864 /* we need only to know, whether it is the same item */
866 return memcmp(stored_ih, ih, IH_SIZE);
869 /* unformatted nodes are not logged anymore, ever. This is safe
872 #define held_by_others(bh) (atomic_read(&(bh)->b_count) > 1)
874 // block can not be forgotten as it is in I/O or held by someone
875 #define block_in_use(bh) (buffer_locked(bh) || (held_by_others(bh)))
877 // prepare for delete or cut of direct item
878 static inline int prepare_for_direct_item(struct treepath *path,
879 struct item_head *le_ih,
881 loff_t new_file_length, int *cut_size)
885 if (new_file_length == max_reiserfs_offset(inode)) {
886 /* item has to be deleted */
887 *cut_size = -(IH_SIZE + ih_item_len(le_ih));
890 // new file gets truncated
891 if (get_inode_item_key_version(inode) == KEY_FORMAT_3_6) {
893 round_len = ROUND_UP(new_file_length);
894 /* this was n_new_file_length < le_ih ... */
895 if (round_len < le_ih_k_offset(le_ih)) {
896 *cut_size = -(IH_SIZE + ih_item_len(le_ih));
897 return M_DELETE; /* Delete this item. */
899 /* Calculate first position and size for cutting from item. */
900 pos_in_item(path) = round_len - (le_ih_k_offset(le_ih) - 1);
901 *cut_size = -(ih_item_len(le_ih) - pos_in_item(path));
903 return M_CUT; /* Cut from this item. */
906 // old file: items may have any length
908 if (new_file_length < le_ih_k_offset(le_ih)) {
909 *cut_size = -(IH_SIZE + ih_item_len(le_ih));
910 return M_DELETE; /* Delete this item. */
912 /* Calculate first position and size for cutting from item. */
913 *cut_size = -(ih_item_len(le_ih) -
915 new_file_length + 1 - le_ih_k_offset(le_ih)));
916 return M_CUT; /* Cut from this item. */
919 static inline int prepare_for_direntry_item(struct treepath *path,
920 struct item_head *le_ih,
922 loff_t new_file_length,
925 if (le_ih_k_offset(le_ih) == DOT_OFFSET &&
926 new_file_length == max_reiserfs_offset(inode)) {
927 RFALSE(ih_entry_count(le_ih) != 2,
928 "PAP-5220: incorrect empty directory item (%h)", le_ih);
929 *cut_size = -(IH_SIZE + ih_item_len(le_ih));
930 return M_DELETE; /* Delete the directory item containing "." and ".." entry. */
933 if (ih_entry_count(le_ih) == 1) {
934 /* Delete the directory item such as there is one record only
936 *cut_size = -(IH_SIZE + ih_item_len(le_ih));
940 /* Cut one record from the directory item. */
943 entry_length(get_last_bh(path), le_ih, pos_in_item(path)));
947 #define JOURNAL_FOR_FREE_BLOCK_AND_UPDATE_SD (2 * JOURNAL_PER_BALANCE_CNT + 1)
949 /* If the path points to a directory or direct item, calculate mode and the size cut, for balance.
950 If the path points to an indirect item, remove some number of its unformatted nodes.
951 In case of file truncate calculate whether this item must be deleted/truncated or last
952 unformatted node of this item will be converted to a direct item.
953 This function returns a determination of what balance mode the calling function should employ. */
954 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
955 from end of the file. */
956 int *cut_size, unsigned long long n_new_file_length /* MAX_KEY_OFFSET in case of delete. */
959 struct super_block *sb = inode->i_sb;
960 struct item_head *p_le_ih = PATH_PITEM_HEAD(path);
961 struct buffer_head *bh = PATH_PLAST_BUFFER(path);
963 BUG_ON(!th->t_trans_id);
965 /* Stat_data item. */
966 if (is_statdata_le_ih(p_le_ih)) {
968 RFALSE(n_new_file_length != max_reiserfs_offset(inode),
969 "PAP-5210: mode must be M_DELETE");
971 *cut_size = -(IH_SIZE + ih_item_len(p_le_ih));
975 /* Directory item. */
976 if (is_direntry_le_ih(p_le_ih))
977 return prepare_for_direntry_item(path, p_le_ih, inode,
982 if (is_direct_le_ih(p_le_ih))
983 return prepare_for_direct_item(path, p_le_ih, inode,
984 n_new_file_length, cut_size);
986 /* Case of an indirect item. */
988 int blk_size = sb->s_blocksize;
989 struct item_head s_ih;
995 if ( n_new_file_length == max_reiserfs_offset (inode) ) {
996 /* prepare_for_delete_or_cut() is called by
997 * reiserfs_delete_item() */
998 n_new_file_length = 0;
1005 bh = PATH_PLAST_BUFFER(path);
1006 copy_item_head(&s_ih, PATH_PITEM_HEAD(path));
1007 pos = I_UNFM_NUM(&s_ih);
1009 while (le_ih_k_offset (&s_ih) + (pos - 1) * blk_size > n_new_file_length) {
1013 /* Each unformatted block deletion may involve one additional
1014 * bitmap block into the transaction, thereby the initial
1015 * journal space reservation might not be enough. */
1016 if (!delete && (*cut_size) != 0 &&
1017 reiserfs_transaction_free_space(th) < JOURNAL_FOR_FREE_BLOCK_AND_UPDATE_SD)
1020 unfm = (__le32 *)B_I_PITEM(bh, &s_ih) + pos - 1;
1021 block = get_block_num(unfm, 0);
1024 reiserfs_prepare_for_journal(sb, bh, 1);
1025 put_block_num(unfm, 0, 0);
1026 journal_mark_dirty(th, sb, bh);
1027 reiserfs_free_block(th, inode, block, 1);
1032 if (item_moved (&s_ih, path)) {
1039 (*cut_size) -= UNFM_P_SIZE;
1042 (*cut_size) -= IH_SIZE;
1047 /* a trick. If the buffer has been logged, this will do nothing. If
1048 ** we've broken the loop without logging it, it will restore the
1050 reiserfs_restore_prepared_buffer(sb, bh);
1051 } while (need_re_search &&
1052 search_for_position_by_key(sb, item_key, path) == POSITION_FOUND);
1053 pos_in_item(path) = pos * UNFM_P_SIZE;
1055 if (*cut_size == 0) {
1056 /* Nothing were cut. maybe convert last unformatted node to the
1064 /* Calculate number of bytes which will be deleted or cut during balance */
1065 static int calc_deleted_bytes_number(struct tree_balance *tb, char c_mode)
1068 struct item_head *p_le_ih = PATH_PITEM_HEAD(tb->tb_path);
1070 if (is_statdata_le_ih(p_le_ih))
1075 M_DELETE) ? ih_item_len(p_le_ih) : -tb->insert_size[0];
1076 if (is_direntry_le_ih(p_le_ih)) {
1077 // return EMPTY_DIR_SIZE; /* We delete emty directoris only. */
1078 // we can't use EMPTY_DIR_SIZE, as old format dirs have a different
1079 // empty size. ick. FIXME, is this right?
1084 if (is_indirect_le_ih(p_le_ih))
1085 n_del_size = (n_del_size / UNFM_P_SIZE) *
1086 (PATH_PLAST_BUFFER(tb->tb_path)->b_size);
1090 static void init_tb_struct(struct reiserfs_transaction_handle *th,
1091 struct tree_balance *tb,
1092 struct super_block *sb,
1093 struct treepath *path, int n_size)
1096 BUG_ON(!th->t_trans_id);
1098 memset(tb, '\0', sizeof(struct tree_balance));
1099 tb->transaction_handle = th;
1102 PATH_OFFSET_PBUFFER(path, ILLEGAL_PATH_ELEMENT_OFFSET) = NULL;
1103 PATH_OFFSET_POSITION(path, ILLEGAL_PATH_ELEMENT_OFFSET) = 0;
1104 tb->insert_size[0] = n_size;
1107 void padd_item(char *item, int total_length, int length)
1111 for (i = total_length; i > length;)
1115 #ifdef REISERQUOTA_DEBUG
1116 char key2type(struct reiserfs_key *ih)
1118 if (is_direntry_le_key(2, ih))
1120 if (is_direct_le_key(2, ih))
1122 if (is_indirect_le_key(2, ih))
1124 if (is_statdata_le_key(2, ih))
1129 char head2type(struct item_head *ih)
1131 if (is_direntry_le_ih(ih))
1133 if (is_direct_le_ih(ih))
1135 if (is_indirect_le_ih(ih))
1137 if (is_statdata_le_ih(ih))
1143 /* Delete object item.
1144 * th - active transaction handle
1145 * path - path to the deleted item
1146 * item_key - key to search for the deleted item
1147 * indode - used for updating i_blocks and quotas
1148 * un_bh - NULL or unformatted node pointer
1150 int reiserfs_delete_item(struct reiserfs_transaction_handle *th,
1151 struct treepath *path, const struct cpu_key *item_key,
1152 struct inode *inode, struct buffer_head *un_bh)
1154 struct super_block *sb = inode->i_sb;
1155 struct tree_balance s_del_balance;
1156 struct item_head s_ih;
1157 struct item_head *q_ih;
1158 int quota_cut_bytes;
1159 int n_ret_value, n_del_size, n_removed;
1161 #ifdef CONFIG_REISERFS_CHECK
1166 BUG_ON(!th->t_trans_id);
1168 init_tb_struct(th, &s_del_balance, sb, path,
1169 0 /*size is unknown */ );
1174 #ifdef CONFIG_REISERFS_CHECK
1178 prepare_for_delete_or_cut(th, inode, path,
1179 item_key, &n_removed,
1181 max_reiserfs_offset(inode));
1183 RFALSE(c_mode != M_DELETE, "PAP-5320: mode must be M_DELETE");
1185 copy_item_head(&s_ih, PATH_PITEM_HEAD(path));
1186 s_del_balance.insert_size[0] = n_del_size;
1188 n_ret_value = fix_nodes(M_DELETE, &s_del_balance, NULL, NULL);
1189 if (n_ret_value != REPEAT_SEARCH)
1192 PROC_INFO_INC(sb, delete_item_restarted);
1194 // file system changed, repeat search
1196 search_for_position_by_key(sb, item_key, path);
1197 if (n_ret_value == IO_ERROR)
1199 if (n_ret_value == FILE_NOT_FOUND) {
1200 reiserfs_warning(sb, "vs-5340",
1201 "no items of the file %K found",
1207 if (n_ret_value != CARRY_ON) {
1208 unfix_nodes(&s_del_balance);
1211 // reiserfs_delete_item returns item length when success
1212 n_ret_value = calc_deleted_bytes_number(&s_del_balance, M_DELETE);
1213 q_ih = get_ih(path);
1214 quota_cut_bytes = ih_item_len(q_ih);
1216 /* hack so the quota code doesn't have to guess if the file
1217 ** has a tail. On tail insert, we allocate quota for 1 unformatted node.
1218 ** We test the offset because the tail might have been
1219 ** split into multiple items, and we only want to decrement for
1220 ** the unfm node once
1222 if (!S_ISLNK(inode->i_mode) && is_direct_le_ih(q_ih)) {
1223 if ((le_ih_k_offset(q_ih) & (sb->s_blocksize - 1)) == 1) {
1224 quota_cut_bytes = sb->s_blocksize + UNFM_P_SIZE;
1226 quota_cut_bytes = 0;
1234 /* We are in direct2indirect conversion, so move tail contents
1235 to the unformatted node */
1236 /* note, we do the copy before preparing the buffer because we
1237 ** don't care about the contents of the unformatted node yet.
1238 ** the only thing we really care about is the direct item's data
1239 ** is in the unformatted node.
1241 ** Otherwise, we would have to call reiserfs_prepare_for_journal on
1242 ** the unformatted node, which might schedule, meaning we'd have to
1243 ** loop all the way back up to the start of the while loop.
1245 ** The unformatted node must be dirtied later on. We can't be
1246 ** sure here if the entire tail has been deleted yet.
1248 ** un_bh is from the page cache (all unformatted nodes are
1249 ** from the page cache) and might be a highmem page. So, we
1250 ** can't use un_bh->b_data.
1254 data = kmap_atomic(un_bh->b_page, KM_USER0);
1255 off = ((le_ih_k_offset(&s_ih) - 1) & (PAGE_CACHE_SIZE - 1));
1257 B_I_PITEM(PATH_PLAST_BUFFER(path), &s_ih),
1259 kunmap_atomic(data, KM_USER0);
1261 /* Perform balancing after all resources have been collected at once. */
1262 do_balance(&s_del_balance, NULL, NULL, M_DELETE);
1264 #ifdef REISERQUOTA_DEBUG
1265 reiserfs_debug(sb, REISERFS_DEBUG_CODE,
1266 "reiserquota delete_item(): freeing %u, id=%u type=%c",
1267 quota_cut_bytes, inode->i_uid, head2type(&s_ih));
1269 DQUOT_FREE_SPACE_NODIRTY(inode, quota_cut_bytes);
1271 /* Return deleted body length */
1275 /* Summary Of Mechanisms For Handling Collisions Between Processes:
1277 deletion of the body of the object is performed by iput(), with the
1278 result that if multiple processes are operating on a file, the
1279 deletion of the body of the file is deferred until the last process
1280 that has an open inode performs its iput().
1282 writes and truncates are protected from collisions by use of
1285 creates, linking, and mknod are protected from collisions with other
1286 processes by making the reiserfs_add_entry() the last step in the
1287 creation, and then rolling back all changes if there was a collision.
1291 /* this deletes item which never gets split */
1292 void reiserfs_delete_solid_item(struct reiserfs_transaction_handle *th,
1293 struct inode *inode, struct reiserfs_key *key)
1295 struct tree_balance tb;
1296 INITIALIZE_PATH(path);
1299 struct cpu_key cpu_key;
1301 int quota_cut_bytes = 0;
1303 BUG_ON(!th->t_trans_id);
1305 le_key2cpu_key(&cpu_key, key);
1308 retval = search_item(th->t_super, &cpu_key, &path);
1309 if (retval == IO_ERROR) {
1310 reiserfs_error(th->t_super, "vs-5350",
1311 "i/o failure occurred trying "
1312 "to delete %K", &cpu_key);
1315 if (retval != ITEM_FOUND) {
1317 // No need for a warning, if there is just no free space to insert '..' item into the newly-created subdir
1319 ((unsigned long long)
1320 GET_HASH_VALUE(le_key_k_offset
1321 (le_key_version(key), key)) == 0
1322 && (unsigned long long)
1323 GET_GENERATION_NUMBER(le_key_k_offset
1324 (le_key_version(key),
1326 reiserfs_warning(th->t_super, "vs-5355",
1327 "%k not found", key);
1332 item_len = ih_item_len(PATH_PITEM_HEAD(&path));
1333 init_tb_struct(th, &tb, th->t_super, &path,
1334 -(IH_SIZE + item_len));
1336 quota_cut_bytes = ih_item_len(PATH_PITEM_HEAD(&path));
1338 retval = fix_nodes(M_DELETE, &tb, NULL, NULL);
1339 if (retval == REPEAT_SEARCH) {
1340 PROC_INFO_INC(th->t_super, delete_solid_item_restarted);
1344 if (retval == CARRY_ON) {
1345 do_balance(&tb, NULL, NULL, M_DELETE);
1346 if (inode) { /* Should we count quota for item? (we don't count quotas for save-links) */
1347 #ifdef REISERQUOTA_DEBUG
1348 reiserfs_debug(th->t_super, REISERFS_DEBUG_CODE,
1349 "reiserquota delete_solid_item(): freeing %u id=%u type=%c",
1350 quota_cut_bytes, inode->i_uid,
1353 DQUOT_FREE_SPACE_NODIRTY(inode,
1358 // IO_ERROR, NO_DISK_SPACE, etc
1359 reiserfs_warning(th->t_super, "vs-5360",
1360 "could not delete %K due to fix_nodes failure",
1366 reiserfs_check_path(&path);
1369 int reiserfs_delete_object(struct reiserfs_transaction_handle *th,
1370 struct inode *inode)
1374 BUG_ON(!th->t_trans_id);
1376 /* for directory this deletes item containing "." and ".." */
1378 reiserfs_do_truncate(th, inode, NULL, 0 /*no timestamp updates */ );
1382 #if defined( USE_INODE_GENERATION_COUNTER )
1383 if (!old_format_only(th->t_super)) {
1384 __le32 *inode_generation;
1387 &REISERFS_SB(th->t_super)->s_rs->s_inode_generation;
1388 le32_add_cpu(inode_generation, 1);
1390 /* USE_INODE_GENERATION_COUNTER */
1392 reiserfs_delete_solid_item(th, inode, INODE_PKEY(inode));
1397 static void unmap_buffers(struct page *page, loff_t pos)
1399 struct buffer_head *bh;
1400 struct buffer_head *head;
1401 struct buffer_head *next;
1402 unsigned long tail_index;
1403 unsigned long cur_index;
1406 if (page_has_buffers(page)) {
1407 tail_index = pos & (PAGE_CACHE_SIZE - 1);
1409 head = page_buffers(page);
1412 next = bh->b_this_page;
1414 /* we want to unmap the buffers that contain the tail, and
1415 ** all the buffers after it (since the tail must be at the
1416 ** end of the file). We don't want to unmap file data
1417 ** before the tail, since it might be dirty and waiting to
1420 cur_index += bh->b_size;
1421 if (cur_index > tail_index) {
1422 reiserfs_unmap_buffer(bh);
1425 } while (bh != head);
1430 static int maybe_indirect_to_direct(struct reiserfs_transaction_handle *th,
1431 struct inode *inode,
1433 struct treepath *path,
1434 const struct cpu_key *item_key,
1435 loff_t n_new_file_size, char *mode)
1437 struct super_block *sb = inode->i_sb;
1438 int n_block_size = sb->s_blocksize;
1440 BUG_ON(!th->t_trans_id);
1441 BUG_ON(n_new_file_size != inode->i_size);
1443 /* the page being sent in could be NULL if there was an i/o error
1444 ** reading in the last block. The user will hit problems trying to
1445 ** read the file, but for now we just skip the indirect2direct
1447 if (atomic_read(&inode->i_count) > 1 ||
1448 !tail_has_to_be_packed(inode) ||
1449 !page || (REISERFS_I(inode)->i_flags & i_nopack_mask)) {
1450 /* leave tail in an unformatted node */
1451 *mode = M_SKIP_BALANCING;
1453 n_block_size - (n_new_file_size & (n_block_size - 1));
1457 /* Perform the conversion to a direct_item. */
1458 /* return indirect_to_direct(inode, path, item_key,
1459 n_new_file_size, mode); */
1460 return indirect2direct(th, inode, page, path, item_key,
1461 n_new_file_size, mode);
1464 /* we did indirect_to_direct conversion. And we have inserted direct
1465 item successesfully, but there were no disk space to cut unfm
1466 pointer being converted. Therefore we have to delete inserted
1468 static void indirect_to_direct_roll_back(struct reiserfs_transaction_handle *th,
1469 struct inode *inode, struct treepath *path)
1471 struct cpu_key tail_key;
1474 BUG_ON(!th->t_trans_id);
1476 make_cpu_key(&tail_key, inode, inode->i_size + 1, TYPE_DIRECT, 4); // !!!!
1477 tail_key.key_length = 4;
1480 (cpu_key_k_offset(&tail_key) & (inode->i_sb->s_blocksize - 1)) - 1;
1482 /* look for the last byte of the tail */
1483 if (search_for_position_by_key(inode->i_sb, &tail_key, path) ==
1485 reiserfs_panic(inode->i_sb, "vs-5615",
1486 "found invalid item");
1487 RFALSE(path->pos_in_item !=
1488 ih_item_len(PATH_PITEM_HEAD(path)) - 1,
1489 "vs-5616: appended bytes found");
1490 PATH_LAST_POSITION(path)--;
1493 reiserfs_delete_item(th, path, &tail_key, inode,
1494 NULL /*unbh not needed */ );
1496 || removed > tail_len,
1497 "vs-5617: there was tail %d bytes, removed item length %d bytes",
1499 tail_len -= removed;
1500 set_cpu_key_k_offset(&tail_key,
1501 cpu_key_k_offset(&tail_key) - removed);
1503 reiserfs_warning(inode->i_sb, "reiserfs-5091", "indirect_to_direct "
1504 "conversion has been rolled back due to "
1505 "lack of disk space");
1506 //mark_file_without_tail (inode);
1507 mark_inode_dirty(inode);
1510 /* (Truncate or cut entry) or delete object item. Returns < 0 on failure */
1511 int reiserfs_cut_from_item(struct reiserfs_transaction_handle *th,
1512 struct treepath *path,
1513 struct cpu_key *item_key,
1514 struct inode *inode,
1515 struct page *page, loff_t n_new_file_size)
1517 struct super_block *sb = inode->i_sb;
1518 /* Every function which is going to call do_balance must first
1519 create a tree_balance structure. Then it must fill up this
1520 structure by using the init_tb_struct and fix_nodes functions.
1521 After that we can make tree balancing. */
1522 struct tree_balance s_cut_balance;
1523 struct item_head *p_le_ih;
1524 int n_cut_size = 0, /* Amount to be cut. */
1525 n_ret_value = CARRY_ON, n_removed = 0, /* Number of the removed unformatted nodes. */
1526 n_is_inode_locked = 0;
1527 char c_mode; /* Mode of the balance. */
1529 int quota_cut_bytes;
1530 loff_t tail_pos = 0;
1532 BUG_ON(!th->t_trans_id);
1534 init_tb_struct(th, &s_cut_balance, inode->i_sb, path,
1537 /* Repeat this loop until we either cut the item without needing
1538 to balance, or we fix_nodes without schedule occurring */
1540 /* Determine the balance mode, position of the first byte to
1541 be cut, and size to be cut. In case of the indirect item
1542 free unformatted nodes which are pointed to by the cut
1546 prepare_for_delete_or_cut(th, inode, path,
1547 item_key, &n_removed,
1548 &n_cut_size, n_new_file_size);
1549 if (c_mode == M_CONVERT) {
1550 /* convert last unformatted node to direct item or leave
1551 tail in the unformatted node */
1552 RFALSE(n_ret_value != CARRY_ON,
1553 "PAP-5570: can not convert twice");
1556 maybe_indirect_to_direct(th, inode, page,
1558 n_new_file_size, &c_mode);
1559 if (c_mode == M_SKIP_BALANCING)
1560 /* tail has been left in the unformatted node */
1563 n_is_inode_locked = 1;
1565 /* removing of last unformatted node will change value we
1566 have to return to truncate. Save it */
1567 retval2 = n_ret_value;
1568 /*retval2 = sb->s_blocksize - (n_new_file_size & (sb->s_blocksize - 1)); */
1570 /* So, we have performed the first part of the conversion:
1571 inserting the new direct item. Now we are removing the
1572 last unformatted node pointer. Set key to search for
1574 set_cpu_key_k_type(item_key, TYPE_INDIRECT);
1575 item_key->key_length = 4;
1577 (n_new_file_size & (sb->s_blocksize - 1));
1578 tail_pos = n_new_file_size;
1579 set_cpu_key_k_offset(item_key, n_new_file_size + 1);
1580 if (search_for_position_by_key
1582 path) == POSITION_NOT_FOUND) {
1583 print_block(PATH_PLAST_BUFFER(path), 3,
1584 PATH_LAST_POSITION(path) - 1,
1585 PATH_LAST_POSITION(path) + 1);
1586 reiserfs_panic(sb, "PAP-5580", "item to "
1587 "convert does not exist (%K)",
1592 if (n_cut_size == 0) {
1597 s_cut_balance.insert_size[0] = n_cut_size;
1599 n_ret_value = fix_nodes(c_mode, &s_cut_balance, NULL, NULL);
1600 if (n_ret_value != REPEAT_SEARCH)
1603 PROC_INFO_INC(sb, cut_from_item_restarted);
1606 search_for_position_by_key(sb, item_key, path);
1607 if (n_ret_value == POSITION_FOUND)
1610 reiserfs_warning(sb, "PAP-5610", "item %K not found",
1612 unfix_nodes(&s_cut_balance);
1613 return (n_ret_value == IO_ERROR) ? -EIO : -ENOENT;
1616 // check fix_nodes results (IO_ERROR or NO_DISK_SPACE)
1617 if (n_ret_value != CARRY_ON) {
1618 if (n_is_inode_locked) {
1619 // FIXME: this seems to be not needed: we are always able
1621 indirect_to_direct_roll_back(th, inode, path);
1623 if (n_ret_value == NO_DISK_SPACE)
1624 reiserfs_warning(sb, "reiserfs-5092",
1626 unfix_nodes(&s_cut_balance);
1630 /* go ahead and perform balancing */
1632 RFALSE(c_mode == M_PASTE || c_mode == M_INSERT, "invalid mode");
1634 /* Calculate number of bytes that need to be cut from the item. */
1637 M_DELETE) ? ih_item_len(get_ih(path)) : -s_cut_balance.
1640 n_ret_value = calc_deleted_bytes_number(&s_cut_balance, c_mode);
1642 n_ret_value = retval2;
1644 /* For direct items, we only change the quota when deleting the last
1647 p_le_ih = PATH_PITEM_HEAD(s_cut_balance.tb_path);
1648 if (!S_ISLNK(inode->i_mode) && is_direct_le_ih(p_le_ih)) {
1649 if (c_mode == M_DELETE &&
1650 (le_ih_k_offset(p_le_ih) & (sb->s_blocksize - 1)) ==
1652 // FIXME: this is to keep 3.5 happy
1653 REISERFS_I(inode)->i_first_direct_byte = U32_MAX;
1654 quota_cut_bytes = sb->s_blocksize + UNFM_P_SIZE;
1656 quota_cut_bytes = 0;
1659 #ifdef CONFIG_REISERFS_CHECK
1660 if (n_is_inode_locked) {
1661 struct item_head *le_ih =
1662 PATH_PITEM_HEAD(s_cut_balance.tb_path);
1663 /* we are going to complete indirect2direct conversion. Make
1664 sure, that we exactly remove last unformatted node pointer
1666 if (!is_indirect_le_ih(le_ih))
1667 reiserfs_panic(sb, "vs-5652",
1668 "item must be indirect %h", le_ih);
1670 if (c_mode == M_DELETE && ih_item_len(le_ih) != UNFM_P_SIZE)
1671 reiserfs_panic(sb, "vs-5653", "completing "
1672 "indirect2direct conversion indirect "
1673 "item %h being deleted must be of "
1674 "4 byte long", le_ih);
1677 && s_cut_balance.insert_size[0] != -UNFM_P_SIZE) {
1678 reiserfs_panic(sb, "vs-5654", "can not complete "
1679 "indirect2direct conversion of %h "
1680 "(CUT, insert_size==%d)",
1681 le_ih, s_cut_balance.insert_size[0]);
1683 /* it would be useful to make sure, that right neighboring
1684 item is direct item of this file */
1688 do_balance(&s_cut_balance, NULL, NULL, c_mode);
1689 if (n_is_inode_locked) {
1690 /* we've done an indirect->direct conversion. when the data block
1691 ** was freed, it was removed from the list of blocks that must
1692 ** be flushed before the transaction commits, make sure to
1693 ** unmap and invalidate it
1695 unmap_buffers(page, tail_pos);
1696 REISERFS_I(inode)->i_flags &= ~i_pack_on_close_mask;
1698 #ifdef REISERQUOTA_DEBUG
1699 reiserfs_debug(inode->i_sb, REISERFS_DEBUG_CODE,
1700 "reiserquota cut_from_item(): freeing %u id=%u type=%c",
1701 quota_cut_bytes, inode->i_uid, '?');
1703 DQUOT_FREE_SPACE_NODIRTY(inode, quota_cut_bytes);
1707 static void truncate_directory(struct reiserfs_transaction_handle *th,
1708 struct inode *inode)
1710 BUG_ON(!th->t_trans_id);
1712 reiserfs_error(inode->i_sb, "vs-5655", "link count != 0");
1714 set_le_key_k_offset(KEY_FORMAT_3_5, INODE_PKEY(inode), DOT_OFFSET);
1715 set_le_key_k_type(KEY_FORMAT_3_5, INODE_PKEY(inode), TYPE_DIRENTRY);
1716 reiserfs_delete_solid_item(th, inode, INODE_PKEY(inode));
1717 reiserfs_update_sd(th, inode);
1718 set_le_key_k_offset(KEY_FORMAT_3_5, INODE_PKEY(inode), SD_OFFSET);
1719 set_le_key_k_type(KEY_FORMAT_3_5, INODE_PKEY(inode), TYPE_STAT_DATA);
1722 /* Truncate file to the new size. Note, this must be called with a transaction
1724 int reiserfs_do_truncate(struct reiserfs_transaction_handle *th,
1725 struct inode *inode, /* ->i_size contains new size */
1726 struct page *page, /* up to date for last block */
1727 int update_timestamps /* when it is called by
1728 file_release to convert
1729 the tail - no timestamps
1730 should be updated */
1733 INITIALIZE_PATH(s_search_path); /* Path to the current object item. */
1734 struct item_head *p_le_ih; /* Pointer to an item header. */
1735 struct cpu_key s_item_key; /* Key to search for a previous file item. */
1736 loff_t n_file_size, /* Old file size. */
1737 n_new_file_size; /* New file size. */
1738 int n_deleted; /* Number of deleted or truncated bytes. */
1742 BUG_ON(!th->t_trans_id);
1744 (S_ISREG(inode->i_mode) || S_ISDIR(inode->i_mode)
1745 || S_ISLNK(inode->i_mode)))
1748 if (S_ISDIR(inode->i_mode)) {
1749 // deletion of directory - no need to update timestamps
1750 truncate_directory(th, inode);
1754 /* Get new file size. */
1755 n_new_file_size = inode->i_size;
1757 // FIXME: note, that key type is unimportant here
1758 make_cpu_key(&s_item_key, inode, max_reiserfs_offset(inode),
1762 search_for_position_by_key(inode->i_sb, &s_item_key,
1764 if (retval == IO_ERROR) {
1765 reiserfs_error(inode->i_sb, "vs-5657",
1766 "i/o failure occurred trying to truncate %K",
1771 if (retval == POSITION_FOUND || retval == FILE_NOT_FOUND) {
1772 reiserfs_error(inode->i_sb, "PAP-5660",
1773 "wrong result %d of search for %K", retval,
1780 s_search_path.pos_in_item--;
1782 /* Get real file size (total length of all file items) */
1783 p_le_ih = PATH_PITEM_HEAD(&s_search_path);
1784 if (is_statdata_le_ih(p_le_ih))
1787 loff_t offset = le_ih_k_offset(p_le_ih);
1789 op_bytes_number(p_le_ih, inode->i_sb->s_blocksize);
1791 /* this may mismatch with real file size: if last direct item
1792 had no padding zeros and last unformatted node had no free
1793 space, this file would have this file size */
1794 n_file_size = offset + bytes - 1;
1797 * are we doing a full truncate or delete, if so
1798 * kick in the reada code
1800 if (n_new_file_size == 0)
1801 s_search_path.reada = PATH_READA | PATH_READA_BACK;
1803 if (n_file_size == 0 || n_file_size < n_new_file_size) {
1804 goto update_and_out;
1807 /* Update key to search for the last file item. */
1808 set_cpu_key_k_offset(&s_item_key, n_file_size);
1811 /* Cut or delete file item. */
1813 reiserfs_cut_from_item(th, &s_search_path, &s_item_key,
1814 inode, page, n_new_file_size);
1815 if (n_deleted < 0) {
1816 reiserfs_warning(inode->i_sb, "vs-5665",
1817 "reiserfs_cut_from_item failed");
1818 reiserfs_check_path(&s_search_path);
1822 RFALSE(n_deleted > n_file_size,
1823 "PAP-5670: reiserfs_cut_from_item: too many bytes deleted: deleted %d, file_size %lu, item_key %K",
1824 n_deleted, n_file_size, &s_item_key);
1826 /* Change key to search the last file item. */
1827 n_file_size -= n_deleted;
1829 set_cpu_key_k_offset(&s_item_key, n_file_size);
1831 /* While there are bytes to truncate and previous file item is presented in the tree. */
1834 ** This loop could take a really long time, and could log
1835 ** many more blocks than a transaction can hold. So, we do a polite
1836 ** journal end here, and if the transaction needs ending, we make
1837 ** sure the file is consistent before ending the current trans
1838 ** and starting a new one
1840 if (journal_transaction_should_end(th, 0) ||
1841 reiserfs_transaction_free_space(th) <= JOURNAL_FOR_FREE_BLOCK_AND_UPDATE_SD) {
1842 int orig_len_alloc = th->t_blocks_allocated;
1843 pathrelse(&s_search_path);
1845 if (update_timestamps) {
1846 inode->i_mtime = CURRENT_TIME_SEC;
1847 inode->i_ctime = CURRENT_TIME_SEC;
1849 reiserfs_update_sd(th, inode);
1851 err = journal_end(th, inode->i_sb, orig_len_alloc);
1854 err = journal_begin(th, inode->i_sb,
1855 JOURNAL_FOR_FREE_BLOCK_AND_UPDATE_SD + JOURNAL_PER_BALANCE_CNT * 4) ;
1858 reiserfs_update_inode_transaction(inode);
1860 } while (n_file_size > ROUND_UP(n_new_file_size) &&
1861 search_for_position_by_key(inode->i_sb, &s_item_key,
1862 &s_search_path) == POSITION_FOUND);
1864 RFALSE(n_file_size > ROUND_UP(n_new_file_size),
1865 "PAP-5680: truncate did not finish: new_file_size %Ld, current %Ld, oid %d",
1866 n_new_file_size, n_file_size, s_item_key.on_disk_key.k_objectid);
1869 if (update_timestamps) {
1870 // this is truncate, not file closing
1871 inode->i_mtime = CURRENT_TIME_SEC;
1872 inode->i_ctime = CURRENT_TIME_SEC;
1874 reiserfs_update_sd(th, inode);
1877 pathrelse(&s_search_path);
1881 #ifdef CONFIG_REISERFS_CHECK
1882 // this makes sure, that we __append__, not overwrite or add holes
1883 static void check_research_for_paste(struct treepath *path,
1884 const struct cpu_key *key)
1886 struct item_head *found_ih = get_ih(path);
1888 if (is_direct_le_ih(found_ih)) {
1889 if (le_ih_k_offset(found_ih) +
1890 op_bytes_number(found_ih,
1891 get_last_bh(path)->b_size) !=
1892 cpu_key_k_offset(key)
1893 || op_bytes_number(found_ih,
1894 get_last_bh(path)->b_size) !=
1896 reiserfs_panic(NULL, "PAP-5720", "found direct item "
1897 "%h or position (%d) does not match "
1898 "to key %K", found_ih,
1899 pos_in_item(path), key);
1901 if (is_indirect_le_ih(found_ih)) {
1902 if (le_ih_k_offset(found_ih) +
1903 op_bytes_number(found_ih,
1904 get_last_bh(path)->b_size) !=
1905 cpu_key_k_offset(key)
1906 || I_UNFM_NUM(found_ih) != pos_in_item(path)
1907 || get_ih_free_space(found_ih) != 0)
1908 reiserfs_panic(NULL, "PAP-5730", "found indirect "
1909 "item (%h) or position (%d) does not "
1910 "match to key (%K)",
1911 found_ih, pos_in_item(path), key);
1914 #endif /* config reiserfs check */
1916 /* Paste bytes to the existing item. Returns bytes number pasted into the item. */
1917 int reiserfs_paste_into_item(struct reiserfs_transaction_handle *th, struct treepath *search_path, /* Path to the pasted item. */
1918 const struct cpu_key *key, /* Key to search for the needed item. */
1919 struct inode *inode, /* Inode item belongs to */
1920 const char *body, /* Pointer to the bytes to paste. */
1922 { /* Size of pasted bytes. */
1923 struct tree_balance s_paste_balance;
1927 BUG_ON(!th->t_trans_id);
1929 fs_gen = get_generation(inode->i_sb);
1931 #ifdef REISERQUOTA_DEBUG
1932 reiserfs_debug(inode->i_sb, REISERFS_DEBUG_CODE,
1933 "reiserquota paste_into_item(): allocating %u id=%u type=%c",
1934 n_pasted_size, inode->i_uid,
1935 key2type(&(key->on_disk_key)));
1938 if (DQUOT_ALLOC_SPACE_NODIRTY(inode, n_pasted_size)) {
1939 pathrelse(search_path);
1942 init_tb_struct(th, &s_paste_balance, th->t_super, search_path,
1944 #ifdef DISPLACE_NEW_PACKING_LOCALITIES
1945 s_paste_balance.key = key->on_disk_key;
1948 /* DQUOT_* can schedule, must check before the fix_nodes */
1949 if (fs_changed(fs_gen, inode->i_sb)) {
1954 fix_nodes(M_PASTE, &s_paste_balance, NULL,
1955 body)) == REPEAT_SEARCH) {
1957 /* file system changed while we were in the fix_nodes */
1958 PROC_INFO_INC(th->t_super, paste_into_item_restarted);
1960 search_for_position_by_key(th->t_super, key,
1962 if (retval == IO_ERROR) {
1966 if (retval == POSITION_FOUND) {
1967 reiserfs_warning(inode->i_sb, "PAP-5710",
1968 "entry or pasted byte (%K) exists",
1973 #ifdef CONFIG_REISERFS_CHECK
1974 check_research_for_paste(search_path, key);
1978 /* Perform balancing after all resources are collected by fix_nodes, and
1979 accessing them will not risk triggering schedule. */
1980 if (retval == CARRY_ON) {
1981 do_balance(&s_paste_balance, NULL /*ih */ , body, M_PASTE);
1984 retval = (retval == NO_DISK_SPACE) ? -ENOSPC : -EIO;
1986 /* this also releases the path */
1987 unfix_nodes(&s_paste_balance);
1988 #ifdef REISERQUOTA_DEBUG
1989 reiserfs_debug(inode->i_sb, REISERFS_DEBUG_CODE,
1990 "reiserquota paste_into_item(): freeing %u id=%u type=%c",
1991 n_pasted_size, inode->i_uid,
1992 key2type(&(key->on_disk_key)));
1994 DQUOT_FREE_SPACE_NODIRTY(inode, n_pasted_size);
1998 /* Insert new item into the buffer at the path.
1999 * th - active transaction handle
2000 * path - path to the inserted item
2001 * ih - pointer to the item header to insert
2002 * body - pointer to the bytes to insert
2004 int reiserfs_insert_item(struct reiserfs_transaction_handle *th,
2005 struct treepath *path, const struct cpu_key *key,
2006 struct item_head *ih, struct inode *inode,
2009 struct tree_balance s_ins_balance;
2012 int quota_bytes = 0;
2014 BUG_ON(!th->t_trans_id);
2016 if (inode) { /* Do we count quotas for item? */
2017 fs_gen = get_generation(inode->i_sb);
2018 quota_bytes = ih_item_len(ih);
2020 /* hack so the quota code doesn't have to guess if the file has
2021 ** a tail, links are always tails, so there's no guessing needed
2023 if (!S_ISLNK(inode->i_mode) && is_direct_le_ih(ih))
2024 quota_bytes = inode->i_sb->s_blocksize + UNFM_P_SIZE;
2025 #ifdef REISERQUOTA_DEBUG
2026 reiserfs_debug(inode->i_sb, REISERFS_DEBUG_CODE,
2027 "reiserquota insert_item(): allocating %u id=%u type=%c",
2028 quota_bytes, inode->i_uid, head2type(ih));
2030 /* We can't dirty inode here. It would be immediately written but
2031 * appropriate stat item isn't inserted yet... */
2032 if (DQUOT_ALLOC_SPACE_NODIRTY(inode, quota_bytes)) {
2037 init_tb_struct(th, &s_ins_balance, th->t_super, path,
2038 IH_SIZE + ih_item_len(ih));
2039 #ifdef DISPLACE_NEW_PACKING_LOCALITIES
2040 s_ins_balance.key = key->on_disk_key;
2042 /* DQUOT_* can schedule, must check to be sure calling fix_nodes is safe */
2043 if (inode && fs_changed(fs_gen, inode->i_sb)) {
2048 fix_nodes(M_INSERT, &s_ins_balance, ih,
2049 body)) == REPEAT_SEARCH) {
2051 /* file system changed while we were in the fix_nodes */
2052 PROC_INFO_INC(th->t_super, insert_item_restarted);
2053 retval = search_item(th->t_super, key, path);
2054 if (retval == IO_ERROR) {
2058 if (retval == ITEM_FOUND) {
2059 reiserfs_warning(th->t_super, "PAP-5760",
2060 "key %K already exists in the tree",
2067 /* make balancing after all resources will be collected at a time */
2068 if (retval == CARRY_ON) {
2069 do_balance(&s_ins_balance, ih, body, M_INSERT);
2073 retval = (retval == NO_DISK_SPACE) ? -ENOSPC : -EIO;
2075 /* also releases the path */
2076 unfix_nodes(&s_ins_balance);
2077 #ifdef REISERQUOTA_DEBUG
2078 reiserfs_debug(th->t_super, REISERFS_DEBUG_CODE,
2079 "reiserquota insert_item(): freeing %u id=%u type=%c",
2080 quota_bytes, inode->i_uid, head2type(ih));
2083 DQUOT_FREE_SPACE_NODIRTY(inode, quota_bytes);