Blame view
fs/reiserfs/do_balan.c
54.3 KB
1da177e4c Linux-2.6.12-rc2 |
1 2 3 |
/* * Copyright 2000 by Hans Reiser, licensing governed by reiserfs/README */ |
098297b27 reiserfs: cleanup... |
4 5 6 7 8 9 10 |
/* * Now we have all buffers that must be used in balancing of the tree * Further calculations can not cause schedule(), and thus the buffer * tree will be stable until the balancing will be finished * balance the tree according to the analysis made before, * and using buffers obtained after all above. */ |
1da177e4c Linux-2.6.12-rc2 |
11 |
|
17093991a fs/reiserfs: use ... |
12 |
#include <linux/uaccess.h> |
1da177e4c Linux-2.6.12-rc2 |
13 |
#include <linux/time.h> |
f466c6fdb move private bits... |
14 |
#include "reiserfs.h" |
1da177e4c Linux-2.6.12-rc2 |
15 |
#include <linux/buffer_head.h> |
79a81aef7 [PATCH] reiserfs:... |
16 |
#include <linux/kernel.h> |
1da177e4c Linux-2.6.12-rc2 |
17 |
|
fba4ebb5f reiserfs: factor ... |
18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 |
static inline void buffer_info_init_left(struct tree_balance *tb, struct buffer_info *bi) { bi->tb = tb; bi->bi_bh = tb->L[0]; bi->bi_parent = tb->FL[0]; bi->bi_position = get_left_neighbor_position(tb, 0); } static inline void buffer_info_init_right(struct tree_balance *tb, struct buffer_info *bi) { bi->tb = tb; bi->bi_bh = tb->R[0]; bi->bi_parent = tb->FR[0]; bi->bi_position = get_right_neighbor_position(tb, 0); } static inline void buffer_info_init_tbS0(struct tree_balance *tb, struct buffer_info *bi) { bi->tb = tb; bi->bi_bh = PATH_PLAST_BUFFER(tb->tb_path); bi->bi_parent = PATH_H_PPARENT(tb->tb_path, 0); bi->bi_position = PATH_H_POSITION(tb->tb_path, 1); } static inline void buffer_info_init_bh(struct tree_balance *tb, struct buffer_info *bi, struct buffer_head *bh) { bi->tb = tb; bi->bi_bh = bh; bi->bi_parent = NULL; bi->bi_position = 0; } |
bd4c625c0 reiserfs: run scr... |
54 55 |
inline void do_balance_mark_leaf_dirty(struct tree_balance *tb, struct buffer_head *bh, int flag) |
1da177e4c Linux-2.6.12-rc2 |
56 |
{ |
09f1b80ba reiserfs: cleanup... |
57 |
journal_mark_dirty(tb->transaction_handle, bh); |
1da177e4c Linux-2.6.12-rc2 |
58 59 60 61 |
} #define do_balance_mark_internal_dirty do_balance_mark_leaf_dirty #define do_balance_mark_sb_dirty do_balance_mark_leaf_dirty |
098297b27 reiserfs: cleanup... |
62 63 64 65 66 67 68 69 70 71 |
/* * summary: * if deleting something ( tb->insert_size[0] < 0 ) * return(balance_leaf_when_delete()); (flag d handled here) * else * if lnum is larger than 0 we put items into the left node * if rnum is larger than 0 we put items into the right node * if snum1 is larger than 0 we put items into the new node s1 * if snum2 is larger than 0 we put items into the new node s2 * Note that all *num* count new items being created. |
098297b27 reiserfs: cleanup... |
72 |
*/ |
83a3a5693 reiserfs: balance... |
73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 |
static void balance_leaf_when_delete_del(struct tree_balance *tb) { struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path); int item_pos = PATH_LAST_POSITION(tb->tb_path); struct buffer_info bi; #ifdef CONFIG_REISERFS_CHECK struct item_head *ih = item_head(tbS0, item_pos); #endif RFALSE(ih_item_len(ih) + IH_SIZE != -tb->insert_size[0], "vs-12013: mode Delete, insert size %d, ih to be deleted %h", -tb->insert_size[0], ih); buffer_info_init_tbS0(tb, &bi); leaf_delete_items(&bi, 0, item_pos, 1, -1); if (!item_pos && tb->CFL[0]) { if (B_NR_ITEMS(tbS0)) { replace_key(tb, tb->CFL[0], tb->lkey[0], tbS0, 0); } else { if (!PATH_H_POSITION(tb->tb_path, 1)) replace_key(tb, tb->CFL[0], tb->lkey[0], PATH_H_PPARENT(tb->tb_path, 0), 0); } } RFALSE(!item_pos && !tb->CFL[0], "PAP-12020: tb->CFL[0]==%p, tb->L[0]==%p", tb->CFL[0], tb->L[0]); } /* cut item in S[0] */ static void balance_leaf_when_delete_cut(struct tree_balance *tb) { struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path); int item_pos = PATH_LAST_POSITION(tb->tb_path); struct item_head *ih = item_head(tbS0, item_pos); int pos_in_item = tb->tb_path->pos_in_item; struct buffer_info bi; buffer_info_init_tbS0(tb, &bi); if (is_direntry_le_ih(ih)) { /* * UFS unlink semantics are such that you can only * delete one directory entry at a time. * * when we cut a directory tb->insert_size[0] means * number of entries to be cut (always 1) */ tb->insert_size[0] = -1; leaf_cut_from_buffer(&bi, item_pos, pos_in_item, -tb->insert_size[0]); RFALSE(!item_pos && !pos_in_item && !tb->CFL[0], "PAP-12030: can not change delimiting key. CFL[0]=%p", tb->CFL[0]); if (!item_pos && !pos_in_item && tb->CFL[0]) replace_key(tb, tb->CFL[0], tb->lkey[0], tbS0, 0); } else { leaf_cut_from_buffer(&bi, item_pos, pos_in_item, -tb->insert_size[0]); RFALSE(!ih_item_len(ih), "PAP-12035: cut must leave non-zero dynamic " "length of item"); } } static int balance_leaf_when_delete_left(struct tree_balance *tb) { struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path); int n = B_NR_ITEMS(tbS0); /* L[0] must be joined with S[0] */ if (tb->lnum[0] == -1) { /* R[0] must be also joined with S[0] */ if (tb->rnum[0] == -1) { if (tb->FR[0] == PATH_H_PPARENT(tb->tb_path, 0)) { /* * all contents of all the * 3 buffers will be in L[0] */ if (PATH_H_POSITION(tb->tb_path, 1) == 0 && 1 < B_NR_ITEMS(tb->FR[0])) replace_key(tb, tb->CFL[0], tb->lkey[0], tb->FR[0], 1); leaf_move_items(LEAF_FROM_S_TO_L, tb, n, -1, NULL); leaf_move_items(LEAF_FROM_R_TO_L, tb, B_NR_ITEMS(tb->R[0]), -1, NULL); reiserfs_invalidate_buffer(tb, tbS0); reiserfs_invalidate_buffer(tb, tb->R[0]); return 0; } /* all contents of all the 3 buffers will be in R[0] */ leaf_move_items(LEAF_FROM_S_TO_R, tb, n, -1, NULL); leaf_move_items(LEAF_FROM_L_TO_R, tb, B_NR_ITEMS(tb->L[0]), -1, NULL); /* right_delimiting_key is correct in R[0] */ replace_key(tb, tb->CFR[0], tb->rkey[0], tb->R[0], 0); reiserfs_invalidate_buffer(tb, tbS0); reiserfs_invalidate_buffer(tb, tb->L[0]); return -1; } RFALSE(tb->rnum[0] != 0, "PAP-12045: rnum must be 0 (%d)", tb->rnum[0]); /* all contents of L[0] and S[0] will be in L[0] */ leaf_shift_left(tb, n, -1); reiserfs_invalidate_buffer(tb, tbS0); return 0; } /* * a part of contents of S[0] will be in L[0] and * the rest part of S[0] will be in R[0] */ RFALSE((tb->lnum[0] + tb->rnum[0] < n) || (tb->lnum[0] + tb->rnum[0] > n + 1), "PAP-12050: rnum(%d) and lnum(%d) and item " "number(%d) in S[0] are not consistent", tb->rnum[0], tb->lnum[0], n); RFALSE((tb->lnum[0] + tb->rnum[0] == n) && (tb->lbytes != -1 || tb->rbytes != -1), "PAP-12055: bad rbytes (%d)/lbytes (%d) " "parameters when items are not split", tb->rbytes, tb->lbytes); RFALSE((tb->lnum[0] + tb->rnum[0] == n + 1) && (tb->lbytes < 1 || tb->rbytes != -1), "PAP-12060: bad rbytes (%d)/lbytes (%d) " "parameters when items are split", tb->rbytes, tb->lbytes); leaf_shift_left(tb, tb->lnum[0], tb->lbytes); leaf_shift_right(tb, tb->rnum[0], tb->rbytes); reiserfs_invalidate_buffer(tb, tbS0); return 0; } |
098297b27 reiserfs: cleanup... |
225 226 |
/* * Balance leaf node in case of delete or cut: insert_size[0] < 0 |
1da177e4c Linux-2.6.12-rc2 |
227 228 229 230 |
* * lnum, rnum can have values >= -1 * -1 means that the neighbor must be joined with S * 0 means that nothing should be done with the neighbor |
098297b27 reiserfs: cleanup... |
231 232 |
* >0 means to shift entirely or partly the specified number of items * to the neighbor |
1da177e4c Linux-2.6.12-rc2 |
233 |
*/ |
bd4c625c0 reiserfs: run scr... |
234 |
static int balance_leaf_when_delete(struct tree_balance *tb, int flag) |
1da177e4c Linux-2.6.12-rc2 |
235 |
{ |
bd4c625c0 reiserfs: run scr... |
236 237 |
struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path); int item_pos = PATH_LAST_POSITION(tb->tb_path); |
bd4c625c0 reiserfs: run scr... |
238 239 240 |
struct buffer_info bi; int n; struct item_head *ih; |
1da177e4c Linux-2.6.12-rc2 |
241 |
|
bd4c625c0 reiserfs: run scr... |
242 243 244 245 246 247 |
RFALSE(tb->FR[0] && B_LEVEL(tb->FR[0]) != DISK_LEAF_NODE_LEVEL + 1, "vs- 12000: level: wrong FR %z", tb->FR[0]); RFALSE(tb->blknum[0] > 1, "PAP-12005: tb->blknum == %d, can not be > 1", tb->blknum[0]); RFALSE(!tb->blknum[0] && !PATH_H_PPARENT(tb->tb_path, 0), "PAP-12010: tree can not be empty"); |
1da177e4c Linux-2.6.12-rc2 |
248 |
|
4cf5f7add reiserfs: cleanup... |
249 |
ih = item_head(tbS0, item_pos); |
fba4ebb5f reiserfs: factor ... |
250 |
buffer_info_init_tbS0(tb, &bi); |
1da177e4c Linux-2.6.12-rc2 |
251 |
|
bd4c625c0 reiserfs: run scr... |
252 |
/* Delete or truncate the item */ |
1da177e4c Linux-2.6.12-rc2 |
253 |
|
83a3a5693 reiserfs: balance... |
254 255 256 257 258 |
BUG_ON(flag != M_DELETE && flag != M_CUT); if (flag == M_DELETE) balance_leaf_when_delete_del(tb); else /* M_CUT */ balance_leaf_when_delete_cut(tb); |
1da177e4c Linux-2.6.12-rc2 |
259 |
|
1da177e4c Linux-2.6.12-rc2 |
260 |
|
098297b27 reiserfs: cleanup... |
261 262 263 264 |
/* * the rule is that no shifting occurs unless by shifting * a node can be freed */ |
bd4c625c0 reiserfs: run scr... |
265 |
n = B_NR_ITEMS(tbS0); |
bd4c625c0 reiserfs: run scr... |
266 |
|
1da177e4c Linux-2.6.12-rc2 |
267 |
|
83a3a5693 reiserfs: balance... |
268 269 270 |
/* L[0] takes part in balancing */ if (tb->lnum[0]) return balance_leaf_when_delete_left(tb); |
1da177e4c Linux-2.6.12-rc2 |
271 |
|
bd4c625c0 reiserfs: run scr... |
272 273 274 275 276 277 |
if (tb->rnum[0] == -1) { /* all contents of R[0] and S[0] will be in R[0] */ leaf_shift_right(tb, n, -1); reiserfs_invalidate_buffer(tb, tbS0); return 0; } |
1da177e4c Linux-2.6.12-rc2 |
278 |
|
bd4c625c0 reiserfs: run scr... |
279 280 |
RFALSE(tb->rnum[0], "PAP-12065: bad rnum parameter must be 0 (%d)", tb->rnum[0]); |
1da177e4c Linux-2.6.12-rc2 |
281 |
return 0; |
1da177e4c Linux-2.6.12-rc2 |
282 |
} |
27d0e5bc8 reiserfs: fix cor... |
283 284 285 |
static unsigned int balance_leaf_insert_left(struct tree_balance *tb, struct item_head *const ih, const char * const body) |
f1f007c30 reiserfs: balance... |
286 |
{ |
4bf4de6bc reiserfs: balance... |
287 |
int ret; |
f1f007c30 reiserfs: balance... |
288 289 |
struct buffer_info bi; int n = B_NR_ITEMS(tb->L[0]); |
27d0e5bc8 reiserfs: fix cor... |
290 |
unsigned body_shift_bytes = 0; |
f1f007c30 reiserfs: balance... |
291 |
|
4bf4de6bc reiserfs: balance... |
292 293 294 295 296 297 298 299 300 301 302 303 |
if (tb->item_pos == tb->lnum[0] - 1 && tb->lbytes != -1) { /* part of new item falls into L[0] */ int new_item_len, shift; int version; ret = leaf_shift_left(tb, tb->lnum[0] - 1, -1); /* Calculate item length to insert to S[0] */ new_item_len = ih_item_len(ih) - tb->lbytes; /* Calculate and check item length to insert to L[0] */ put_ih_item_len(ih, ih_item_len(ih) - new_item_len); |
f1f007c30 reiserfs: balance... |
304 |
|
4bf4de6bc reiserfs: balance... |
305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 |
RFALSE(ih_item_len(ih) <= 0, "PAP-12080: there is nothing to insert into L[0]: " "ih_item_len=%d", ih_item_len(ih)); /* Insert new item into L[0] */ buffer_info_init_left(tb, &bi); leaf_insert_into_buf(&bi, n + tb->item_pos - ret, ih, body, min_t(int, tb->zeroes_num, ih_item_len(ih))); version = ih_version(ih); /* * Calculate key component, item length and body to * insert into S[0] */ shift = 0; if (is_indirect_le_ih(ih)) shift = tb->tb_sb->s_blocksize_bits - UNFM_P_SHIFT; add_le_ih_k_offset(ih, tb->lbytes << shift); put_ih_item_len(ih, new_item_len); if (tb->lbytes > tb->zeroes_num) { |
27d0e5bc8 reiserfs: fix cor... |
328 |
body_shift_bytes = tb->lbytes - tb->zeroes_num; |
4bf4de6bc reiserfs: balance... |
329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 |
tb->zeroes_num = 0; } else tb->zeroes_num -= tb->lbytes; RFALSE(ih_item_len(ih) <= 0, "PAP-12085: there is nothing to insert into S[0]: " "ih_item_len=%d", ih_item_len(ih)); } else { /* new item in whole falls into L[0] */ /* Shift lnum[0]-1 items to L[0] */ ret = leaf_shift_left(tb, tb->lnum[0] - 1, tb->lbytes); /* Insert new item into L[0] */ buffer_info_init_left(tb, &bi); leaf_insert_into_buf(&bi, n + tb->item_pos - ret, ih, body, tb->zeroes_num); tb->insert_size[0] = 0; tb->zeroes_num = 0; } |
27d0e5bc8 reiserfs: fix cor... |
348 |
return body_shift_bytes; |
f1f007c30 reiserfs: balance... |
349 |
} |
3fade9377 reiserfs: balance... |
350 |
static void balance_leaf_paste_left_shift_dirent(struct tree_balance *tb, |
27d0e5bc8 reiserfs: fix cor... |
351 352 |
struct item_head * const ih, const char * const body) |
3fade9377 reiserfs: balance... |
353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 |
{ int n = B_NR_ITEMS(tb->L[0]); struct buffer_info bi; RFALSE(tb->zeroes_num, "PAP-12090: invalid parameter in case of a directory"); /* directory item */ if (tb->lbytes > tb->pos_in_item) { /* new directory entry falls into L[0] */ struct item_head *pasted; int ret, l_pos_in_item = tb->pos_in_item; /* * Shift lnum[0] - 1 items in whole. * Shift lbytes - 1 entries from given directory item */ ret = leaf_shift_left(tb, tb->lnum[0], tb->lbytes - 1); if (ret && !tb->item_pos) { pasted = item_head(tb->L[0], B_NR_ITEMS(tb->L[0]) - 1); l_pos_in_item += ih_entry_count(pasted) - (tb->lbytes - 1); } /* Append given directory entry to directory item */ buffer_info_init_left(tb, &bi); leaf_paste_in_buffer(&bi, n + tb->item_pos - ret, l_pos_in_item, tb->insert_size[0], body, tb->zeroes_num); /* * previous string prepared space for pasting new entry, * following string pastes this entry */ /* * when we have merge directory item, pos_in_item * has been changed too */ /* paste new directory entry. 1 is entry number */ leaf_paste_entries(&bi, n + tb->item_pos - ret, l_pos_in_item, 1, (struct reiserfs_de_head *) body, body + DEH_SIZE, tb->insert_size[0]); tb->insert_size[0] = 0; } else { /* new directory item doesn't fall into L[0] */ /* * Shift lnum[0]-1 items in whole. Shift lbytes * directory entries from directory item number lnum[0] */ leaf_shift_left(tb, tb->lnum[0], tb->lbytes); } /* Calculate new position to append in item body */ tb->pos_in_item -= tb->lbytes; } |
27d0e5bc8 reiserfs: fix cor... |
411 412 413 |
static unsigned int balance_leaf_paste_left_shift(struct tree_balance *tb, struct item_head * const ih, const char * const body) |
1da177e4c Linux-2.6.12-rc2 |
414 |
{ |
bd4c625c0 reiserfs: run scr... |
415 |
struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path); |
3fade9377 reiserfs: balance... |
416 |
int n = B_NR_ITEMS(tb->L[0]); |
cf22df182 reiserfs: balance... |
417 |
struct buffer_info bi; |
27d0e5bc8 reiserfs: fix cor... |
418 |
int body_shift_bytes = 0; |
3fade9377 reiserfs: balance... |
419 420 421 |
if (is_direntry_le_ih(item_head(tbS0, tb->item_pos))) { balance_leaf_paste_left_shift_dirent(tb, ih, body); |
27d0e5bc8 reiserfs: fix cor... |
422 |
return 0; |
3fade9377 reiserfs: balance... |
423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 |
} RFALSE(tb->lbytes <= 0, "PAP-12095: there is nothing to shift to L[0]. " "lbytes=%d", tb->lbytes); RFALSE(tb->pos_in_item != ih_item_len(item_head(tbS0, tb->item_pos)), "PAP-12100: incorrect position to paste: " "item_len=%d, pos_in_item=%d", ih_item_len(item_head(tbS0, tb->item_pos)), tb->pos_in_item); /* appended item will be in L[0] in whole */ if (tb->lbytes >= tb->pos_in_item) { struct item_head *tbS0_pos_ih, *tbL0_ih; struct item_head *tbS0_0_ih; struct reiserfs_key *left_delim_key; int ret, l_n, version, temp_l; tbS0_pos_ih = item_head(tbS0, tb->item_pos); tbS0_0_ih = item_head(tbS0, 0); /* * this bytes number must be appended * to the last item of L[h] */ l_n = tb->lbytes - tb->pos_in_item; /* Calculate new insert_size[0] */ tb->insert_size[0] -= l_n; RFALSE(tb->insert_size[0] <= 0, "PAP-12105: there is nothing to paste into " "L[0]. insert_size=%d", tb->insert_size[0]); ret = leaf_shift_left(tb, tb->lnum[0], ih_item_len(tbS0_pos_ih)); tbL0_ih = item_head(tb->L[0], n + tb->item_pos - ret); /* Append to body of item in L[0] */ buffer_info_init_left(tb, &bi); leaf_paste_in_buffer(&bi, n + tb->item_pos - ret, ih_item_len(tbL0_ih), l_n, body, min_t(int, l_n, tb->zeroes_num)); /* * 0-th item in S0 can be only of DIRECT type * when l_n != 0 */ temp_l = l_n; RFALSE(ih_item_len(tbS0_0_ih), "PAP-12106: item length must be 0"); RFALSE(comp_short_le_keys(&tbS0_0_ih->ih_key, leaf_key(tb->L[0], n + tb->item_pos - ret)), "PAP-12107: items must be of the same file"); if (is_indirect_le_ih(tbL0_ih)) { int shift = tb->tb_sb->s_blocksize_bits - UNFM_P_SHIFT; temp_l = l_n << shift; } /* update key of first item in S0 */ version = ih_version(tbS0_0_ih); add_le_key_k_offset(version, &tbS0_0_ih->ih_key, temp_l); /* update left delimiting key */ left_delim_key = internal_key(tb->CFL[0], tb->lkey[0]); add_le_key_k_offset(version, left_delim_key, temp_l); /* * Calculate new body, position in item and * insert_size[0] */ if (l_n > tb->zeroes_num) { |
27d0e5bc8 reiserfs: fix cor... |
496 |
body_shift_bytes = l_n - tb->zeroes_num; |
3fade9377 reiserfs: balance... |
497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 |
tb->zeroes_num = 0; } else tb->zeroes_num -= l_n; tb->pos_in_item = 0; RFALSE(comp_short_le_keys(&tbS0_0_ih->ih_key, leaf_key(tb->L[0], B_NR_ITEMS(tb->L[0]) - 1)) || !op_is_left_mergeable(leaf_key(tbS0, 0), tbS0->b_size) || !op_is_left_mergeable(left_delim_key, tbS0->b_size), "PAP-12120: item must be merge-able with left " "neighboring item"); } else { /* only part of the appended item will be in L[0] */ /* Calculate position in item for append in S[0] */ tb->pos_in_item -= tb->lbytes; RFALSE(tb->pos_in_item <= 0, "PAP-12125: no place for paste. pos_in_item=%d", tb->pos_in_item); /* * Shift lnum[0] - 1 items in whole. * Shift lbytes - 1 byte from item number lnum[0] */ leaf_shift_left(tb, tb->lnum[0], tb->lbytes); } |
27d0e5bc8 reiserfs: fix cor... |
525 |
return body_shift_bytes; |
3fade9377 reiserfs: balance... |
526 527 528 529 530 |
} /* appended item will be in L[0] in whole */ static void balance_leaf_paste_left_whole(struct tree_balance *tb, |
27d0e5bc8 reiserfs: fix cor... |
531 532 |
struct item_head * const ih, const char * const body) |
3fade9377 reiserfs: balance... |
533 534 |
{ struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path); |
cf22df182 reiserfs: balance... |
535 |
int n = B_NR_ITEMS(tb->L[0]); |
3fade9377 reiserfs: balance... |
536 537 538 |
struct buffer_info bi; struct item_head *pasted; int ret; |
bd4c625c0 reiserfs: run scr... |
539 |
|
3fade9377 reiserfs: balance... |
540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 |
/* if we paste into first item of S[0] and it is left mergable */ if (!tb->item_pos && op_is_left_mergeable(leaf_key(tbS0, 0), tbS0->b_size)) { /* * then increment pos_in_item by the size of the * last item in L[0] */ pasted = item_head(tb->L[0], n - 1); if (is_direntry_le_ih(pasted)) tb->pos_in_item += ih_entry_count(pasted); else tb->pos_in_item += ih_item_len(pasted); } /* * Shift lnum[0] - 1 items in whole. * Shift lbytes - 1 byte from item number lnum[0] */ ret = leaf_shift_left(tb, tb->lnum[0], tb->lbytes); /* Append to body of item in L[0] */ buffer_info_init_left(tb, &bi); leaf_paste_in_buffer(&bi, n + tb->item_pos - ret, tb->pos_in_item, tb->insert_size[0], body, tb->zeroes_num); /* if appended item is directory, paste entry */ pasted = item_head(tb->L[0], n + tb->item_pos - ret); if (is_direntry_le_ih(pasted)) leaf_paste_entries(&bi, n + tb->item_pos - ret, tb->pos_in_item, 1, (struct reiserfs_de_head *)body, body + DEH_SIZE, tb->insert_size[0]); /* * if appended item is indirect item, put unformatted node * into un list */ if (is_indirect_le_ih(pasted)) set_ih_free_space(pasted, 0); |
cf22df182 reiserfs: balance... |
579 |
|
3fade9377 reiserfs: balance... |
580 581 582 |
tb->insert_size[0] = 0; tb->zeroes_num = 0; } |
27d0e5bc8 reiserfs: fix cor... |
583 584 585 |
static unsigned int balance_leaf_paste_left(struct tree_balance *tb, struct item_head * const ih, const char * const body) |
3fade9377 reiserfs: balance... |
586 587 588 |
{ /* we must shift the part of the appended item */ if (tb->item_pos == tb->lnum[0] - 1 && tb->lbytes != -1) |
27d0e5bc8 reiserfs: fix cor... |
589 |
return balance_leaf_paste_left_shift(tb, ih, body); |
3fade9377 reiserfs: balance... |
590 591 |
else balance_leaf_paste_left_whole(tb, ih, body); |
27d0e5bc8 reiserfs: fix cor... |
592 |
return 0; |
cf22df182 reiserfs: balance... |
593 |
} |
0080e9f9d reiserfs: balance... |
594 |
/* Shift lnum[0] items from S[0] to the left neighbor L[0] */ |
27d0e5bc8 reiserfs: fix cor... |
595 596 597 |
static unsigned int balance_leaf_left(struct tree_balance *tb, struct item_head * const ih, const char * const body, int flag) |
0080e9f9d reiserfs: balance... |
598 599 |
{ if (tb->lnum[0] <= 0) |
27d0e5bc8 reiserfs: fix cor... |
600 |
return 0; |
0080e9f9d reiserfs: balance... |
601 602 603 604 605 606 |
/* new item or it part falls to L[0], shift it too */ if (tb->item_pos < tb->lnum[0]) { BUG_ON(flag != M_INSERT && flag != M_PASTE); if (flag == M_INSERT) |
27d0e5bc8 reiserfs: fix cor... |
607 |
return balance_leaf_insert_left(tb, ih, body); |
0080e9f9d reiserfs: balance... |
608 |
else /* M_PASTE */ |
27d0e5bc8 reiserfs: fix cor... |
609 |
return balance_leaf_paste_left(tb, ih, body); |
0080e9f9d reiserfs: balance... |
610 611 612 |
} else /* new item doesn't fall into L[0] */ leaf_shift_left(tb, tb->lnum[0], tb->lbytes); |
27d0e5bc8 reiserfs: fix cor... |
613 |
return 0; |
0080e9f9d reiserfs: balance... |
614 |
} |
e80ef3d14 reiserfs: balance... |
615 |
static void balance_leaf_insert_right(struct tree_balance *tb, |
27d0e5bc8 reiserfs: fix cor... |
616 617 |
struct item_head * const ih, const char * const body) |
e80ef3d14 reiserfs: balance... |
618 619 620 621 622 |
{ struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path); int n = B_NR_ITEMS(tbS0); struct buffer_info bi; |
8dbf0d8c9 reiserfs: balance... |
623 |
int ret; |
e80ef3d14 reiserfs: balance... |
624 |
|
8dbf0d8c9 reiserfs: balance... |
625 626 627 628 629 630 631 632 633 634 635 636 637 638 |
/* new item or part of it doesn't fall into R[0] */ if (n - tb->rnum[0] >= tb->item_pos) { leaf_shift_right(tb, tb->rnum[0], tb->rbytes); return; } /* new item or its part falls to R[0] */ /* part of new item falls into R[0] */ if (tb->item_pos == n - tb->rnum[0] + 1 && tb->rbytes != -1) { loff_t old_key_comp, old_len, r_zeroes_number; const char *r_body; int version, shift; loff_t offset; |
e80ef3d14 reiserfs: balance... |
639 |
|
8dbf0d8c9 reiserfs: balance... |
640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 |
leaf_shift_right(tb, tb->rnum[0] - 1, -1); version = ih_version(ih); /* Remember key component and item length */ old_key_comp = le_ih_k_offset(ih); old_len = ih_item_len(ih); /* * Calculate key component and item length to insert * into R[0] */ shift = 0; if (is_indirect_le_ih(ih)) shift = tb->tb_sb->s_blocksize_bits - UNFM_P_SHIFT; offset = le_ih_k_offset(ih) + ((old_len - tb->rbytes) << shift); set_le_ih_k_offset(ih, offset); put_ih_item_len(ih, tb->rbytes); /* Insert part of the item into R[0] */ buffer_info_init_right(tb, &bi); if ((old_len - tb->rbytes) > tb->zeroes_num) { r_zeroes_number = 0; r_body = body + (old_len - tb->rbytes) - tb->zeroes_num; } else { r_body = body; r_zeroes_number = tb->zeroes_num - (old_len - tb->rbytes); tb->zeroes_num -= r_zeroes_number; } leaf_insert_into_buf(&bi, 0, ih, r_body, r_zeroes_number); /* Replace right delimiting key by first key in R[0] */ replace_key(tb, tb->CFR[0], tb->rkey[0], tb->R[0], 0); /* * Calculate key component and item length to * insert into S[0] */ set_le_ih_k_offset(ih, old_key_comp); put_ih_item_len(ih, old_len - tb->rbytes); tb->insert_size[0] -= tb->rbytes; } else { /* whole new item falls into R[0] */ /* Shift rnum[0]-1 items to R[0] */ ret = leaf_shift_right(tb, tb->rnum[0] - 1, tb->rbytes); /* Insert new item into R[0] */ buffer_info_init_right(tb, &bi); leaf_insert_into_buf(&bi, tb->item_pos - n + tb->rnum[0] - 1, ih, body, tb->zeroes_num); if (tb->item_pos - n + tb->rnum[0] - 1 == 0) replace_key(tb, tb->CFR[0], tb->rkey[0], tb->R[0], 0); tb->zeroes_num = tb->insert_size[0] = 0; } |
e80ef3d14 reiserfs: balance... |
701 |
} |
2369ecd8e reiserfs: balance... |
702 703 |
static void balance_leaf_paste_right_shift_dirent(struct tree_balance *tb, |
27d0e5bc8 reiserfs: fix cor... |
704 705 |
struct item_head * const ih, const char * const body) |
cf22df182 reiserfs: balance... |
706 707 708 |
{ struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path); struct buffer_info bi; |
2369ecd8e reiserfs: balance... |
709 |
int entry_count; |
cf22df182 reiserfs: balance... |
710 |
|
b54b8c918 reiserfs: balance... |
711 |
RFALSE(tb->zeroes_num, |
2369ecd8e reiserfs: balance... |
712 713 |
"PAP-12145: invalid parameter in case of a directory"); entry_count = ih_entry_count(item_head(tbS0, tb->item_pos)); |
bd4c625c0 reiserfs: run scr... |
714 |
|
2369ecd8e reiserfs: balance... |
715 716 717 |
/* new directory entry falls into R[0] */ if (entry_count - tb->rbytes < tb->pos_in_item) { int paste_entry_position; |
bd4c625c0 reiserfs: run scr... |
718 |
|
2369ecd8e reiserfs: balance... |
719 720 721 |
RFALSE(tb->rbytes - 1 >= entry_count || !tb->insert_size[0], "PAP-12150: no enough of entries to shift to R[0]: " "rbytes=%d, entry_count=%d", tb->rbytes, entry_count); |
416e2abd9 reiserfs: fix utt... |
722 |
|
2369ecd8e reiserfs: balance... |
723 724 725 726 727 728 |
/* * Shift rnum[0]-1 items in whole. * Shift rbytes-1 directory entries from directory * item number rnum[0] */ leaf_shift_right(tb, tb->rnum[0], tb->rbytes - 1); |
bd4c625c0 reiserfs: run scr... |
729 |
|
2369ecd8e reiserfs: balance... |
730 731 732 733 734 735 |
/* Paste given directory entry to directory item */ paste_entry_position = tb->pos_in_item - entry_count + tb->rbytes - 1; buffer_info_init_right(tb, &bi); leaf_paste_in_buffer(&bi, 0, paste_entry_position, tb->insert_size[0], body, tb->zeroes_num); |
bd4c625c0 reiserfs: run scr... |
736 |
|
2369ecd8e reiserfs: balance... |
737 738 739 740 |
/* paste entry */ leaf_paste_entries(&bi, 0, paste_entry_position, 1, (struct reiserfs_de_head *) body, body + DEH_SIZE, tb->insert_size[0]); |
bd4c625c0 reiserfs: run scr... |
741 |
|
2369ecd8e reiserfs: balance... |
742 743 744 |
/* change delimiting keys */ if (paste_entry_position == 0) replace_key(tb, tb->CFR[0], tb->rkey[0], tb->R[0], 0); |
bd4c625c0 reiserfs: run scr... |
745 |
|
2369ecd8e reiserfs: balance... |
746 747 748 749 750 751 752 |
tb->insert_size[0] = 0; tb->pos_in_item++; } else { /* new directory entry doesn't fall into R[0] */ leaf_shift_right(tb, tb->rnum[0], tb->rbytes); } } |
bd4c625c0 reiserfs: run scr... |
753 |
|
2369ecd8e reiserfs: balance... |
754 |
static void balance_leaf_paste_right_shift(struct tree_balance *tb, |
27d0e5bc8 reiserfs: fix cor... |
755 756 |
struct item_head * const ih, const char * const body) |
2369ecd8e reiserfs: balance... |
757 758 759 760 761 762 |
{ struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path); int n_shift, n_rem, r_zeroes_number, version; unsigned long temp_rem; const char *r_body; struct buffer_info bi; |
416e2abd9 reiserfs: fix utt... |
763 |
|
2369ecd8e reiserfs: balance... |
764 765 766 767 768 |
/* we append to directory item */ if (is_direntry_le_ih(item_head(tbS0, tb->item_pos))) { balance_leaf_paste_right_shift_dirent(tb, ih, body); return; } |
bd4c625c0 reiserfs: run scr... |
769 |
|
2369ecd8e reiserfs: balance... |
770 |
/* regular object */ |
416e2abd9 reiserfs: fix utt... |
771 |
|
2369ecd8e reiserfs: balance... |
772 773 774 775 776 777 778 |
/* * Calculate number of bytes which must be shifted * from appended item */ n_shift = tb->rbytes - tb->insert_size[0]; if (n_shift < 0) n_shift = 0; |
bd4c625c0 reiserfs: run scr... |
779 |
|
b54b8c918 reiserfs: balance... |
780 |
RFALSE(tb->pos_in_item != ih_item_len(item_head(tbS0, tb->item_pos)), |
2369ecd8e reiserfs: balance... |
781 |
"PAP-12155: invalid position to paste. ih_item_len=%d, " |
b54b8c918 reiserfs: balance... |
782 783 |
"pos_in_item=%d", tb->pos_in_item, ih_item_len(item_head(tbS0, tb->item_pos))); |
bd4c625c0 reiserfs: run scr... |
784 |
|
2369ecd8e reiserfs: balance... |
785 |
leaf_shift_right(tb, tb->rnum[0], n_shift); |
416e2abd9 reiserfs: fix utt... |
786 |
|
2369ecd8e reiserfs: balance... |
787 788 789 790 791 792 793 |
/* * Calculate number of bytes which must remain in body * after appending to R[0] */ n_rem = tb->insert_size[0] - tb->rbytes; if (n_rem < 0) n_rem = 0; |
bd4c625c0 reiserfs: run scr... |
794 |
|
2369ecd8e reiserfs: balance... |
795 |
temp_rem = n_rem; |
bd4c625c0 reiserfs: run scr... |
796 |
|
2369ecd8e reiserfs: balance... |
797 |
version = ih_version(item_head(tb->R[0], 0)); |
bd4c625c0 reiserfs: run scr... |
798 |
|
2369ecd8e reiserfs: balance... |
799 800 801 802 |
if (is_indirect_le_key(version, leaf_key(tb->R[0], 0))) { int shift = tb->tb_sb->s_blocksize_bits - UNFM_P_SHIFT; temp_rem = n_rem << shift; } |
bd4c625c0 reiserfs: run scr... |
803 |
|
2369ecd8e reiserfs: balance... |
804 805 806 |
add_le_key_k_offset(version, leaf_key(tb->R[0], 0), temp_rem); add_le_key_k_offset(version, internal_key(tb->CFR[0], tb->rkey[0]), temp_rem); |
bd4c625c0 reiserfs: run scr... |
807 |
|
2369ecd8e reiserfs: balance... |
808 |
do_balance_mark_internal_dirty(tb, tb->CFR[0], 0); |
bd4c625c0 reiserfs: run scr... |
809 |
|
2369ecd8e reiserfs: balance... |
810 811 812 813 814 815 816 817 818 819 |
/* Append part of body into R[0] */ buffer_info_init_right(tb, &bi); if (n_rem > tb->zeroes_num) { r_zeroes_number = 0; r_body = body + n_rem - tb->zeroes_num; } else { r_body = body; r_zeroes_number = tb->zeroes_num - n_rem; tb->zeroes_num -= r_zeroes_number; } |
1da177e4c Linux-2.6.12-rc2 |
820 |
|
2369ecd8e reiserfs: balance... |
821 822 823 824 825 826 827 828 829 830 831 832 |
leaf_paste_in_buffer(&bi, 0, n_shift, tb->insert_size[0] - n_rem, r_body, r_zeroes_number); if (is_indirect_le_ih(item_head(tb->R[0], 0))) set_ih_free_space(item_head(tb->R[0], 0), 0); tb->insert_size[0] = n_rem; if (!n_rem) tb->pos_in_item++; } static void balance_leaf_paste_right_whole(struct tree_balance *tb, |
27d0e5bc8 reiserfs: fix cor... |
833 834 |
struct item_head * const ih, const char * const body) |
2369ecd8e reiserfs: balance... |
835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 |
{ struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path); int n = B_NR_ITEMS(tbS0); struct item_head *pasted; struct buffer_info bi; buffer_info_init_right(tb, &bi); leaf_shift_right(tb, tb->rnum[0], tb->rbytes); /* append item in R[0] */ if (tb->pos_in_item >= 0) { buffer_info_init_right(tb, &bi); leaf_paste_in_buffer(&bi, tb->item_pos - n + tb->rnum[0], tb->pos_in_item, tb->insert_size[0], body, tb->zeroes_num); } /* paste new entry, if item is directory item */ pasted = item_head(tb->R[0], tb->item_pos - n + tb->rnum[0]); if (is_direntry_le_ih(pasted) && tb->pos_in_item >= 0) { leaf_paste_entries(&bi, tb->item_pos - n + tb->rnum[0], tb->pos_in_item, 1, (struct reiserfs_de_head *)body, body + DEH_SIZE, tb->insert_size[0]); if (!tb->pos_in_item) { RFALSE(tb->item_pos - n + tb->rnum[0], "PAP-12165: directory item must be first " "item of node when pasting is in 0th position"); |
3f0eb2765 reiserfs: balance... |
865 |
|
2369ecd8e reiserfs: balance... |
866 867 868 869 870 871 872 873 874 875 876 |
/* update delimiting keys */ replace_key(tb, tb->CFR[0], tb->rkey[0], tb->R[0], 0); } } if (is_indirect_le_ih(pasted)) set_ih_free_space(pasted, 0); tb->zeroes_num = tb->insert_size[0] = 0; } static void balance_leaf_paste_right(struct tree_balance *tb, |
27d0e5bc8 reiserfs: fix cor... |
877 878 |
struct item_head * const ih, const char * const body) |
2369ecd8e reiserfs: balance... |
879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 |
{ struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path); int n = B_NR_ITEMS(tbS0); /* new item doesn't fall into R[0] */ if (n - tb->rnum[0] > tb->item_pos) { leaf_shift_right(tb, tb->rnum[0], tb->rbytes); return; } /* pasted item or part of it falls to R[0] */ if (tb->item_pos == n - tb->rnum[0] && tb->rbytes != -1) /* we must shift the part of the appended item */ balance_leaf_paste_right_shift(tb, ih, body); else /* pasted item in whole falls into R[0] */ balance_leaf_paste_right_whole(tb, ih, body); |
3f0eb2765 reiserfs: balance... |
897 |
} |
0080e9f9d reiserfs: balance... |
898 |
/* shift rnum[0] items from S[0] to the right neighbor R[0] */ |
27d0e5bc8 reiserfs: fix cor... |
899 900 901 |
static void balance_leaf_right(struct tree_balance *tb, struct item_head * const ih, const char * const body, int flag) |
0080e9f9d reiserfs: balance... |
902 903 904 905 906 907 908 909 910 911 |
{ if (tb->rnum[0] <= 0) return; BUG_ON(flag != M_INSERT && flag != M_PASTE); if (flag == M_INSERT) balance_leaf_insert_right(tb, ih, body); else /* M_PASTE */ balance_leaf_paste_right(tb, ih, body); |
0080e9f9d reiserfs: balance... |
912 |
} |
65ab18cb7 reiserfs: balance... |
913 |
static void balance_leaf_new_nodes_insert(struct tree_balance *tb, |
27d0e5bc8 reiserfs: fix cor... |
914 915 |
struct item_head * const ih, const char * const body, |
65ab18cb7 reiserfs: balance... |
916 917 918 919 920 921 922 |
struct item_head *insert_key, struct buffer_head **insert_ptr, int i) { struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path); int n = B_NR_ITEMS(tbS0); struct buffer_info bi; |
b54b8c918 reiserfs: balance... |
923 924 925 926 927 928 929 930 |
int shift; /* new item or it part don't falls into S_new[i] */ if (n - tb->snum[i] >= tb->item_pos) { leaf_move_items(LEAF_FROM_S_TO_SNEW, tb, tb->snum[i], tb->sbytes[i], tb->S_new[i]); return; } |
65ab18cb7 reiserfs: balance... |
931 |
|
b54b8c918 reiserfs: balance... |
932 |
/* new item or it's part falls to first new node S_new[i] */ |
65ab18cb7 reiserfs: balance... |
933 |
|
b54b8c918 reiserfs: balance... |
934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 |
/* part of new item falls into S_new[i] */ if (tb->item_pos == n - tb->snum[i] + 1 && tb->sbytes[i] != -1) { int old_key_comp, old_len, r_zeroes_number; const char *r_body; int version; /* Move snum[i]-1 items from S[0] to S_new[i] */ leaf_move_items(LEAF_FROM_S_TO_SNEW, tb, tb->snum[i] - 1, -1, tb->S_new[i]); /* Remember key component and item length */ version = ih_version(ih); old_key_comp = le_ih_k_offset(ih); old_len = ih_item_len(ih); /* * Calculate key component and item length to insert * into S_new[i] */ shift = 0; if (is_indirect_le_ih(ih)) shift = tb->tb_sb->s_blocksize_bits - UNFM_P_SHIFT; set_le_ih_k_offset(ih, le_ih_k_offset(ih) + ((old_len - tb->sbytes[i]) << shift)); put_ih_item_len(ih, tb->sbytes[i]); /* Insert part of the item into S_new[i] before 0-th item */ buffer_info_init_bh(tb, &bi, tb->S_new[i]); if ((old_len - tb->sbytes[i]) > tb->zeroes_num) { r_zeroes_number = 0; r_body = body + (old_len - tb->sbytes[i]) - tb->zeroes_num; } else { r_body = body; r_zeroes_number = tb->zeroes_num - (old_len - tb->sbytes[i]); tb->zeroes_num -= r_zeroes_number; } leaf_insert_into_buf(&bi, 0, ih, r_body, r_zeroes_number); /* * Calculate key component and item length to * insert into S[i] */ set_le_ih_k_offset(ih, old_key_comp); put_ih_item_len(ih, old_len - tb->sbytes[i]); tb->insert_size[0] -= tb->sbytes[i]; } else { /* whole new item falls into S_new[i] */ /* * Shift snum[0] - 1 items to S_new[i] * (sbytes[i] of split item) */ leaf_move_items(LEAF_FROM_S_TO_SNEW, tb, tb->snum[i] - 1, tb->sbytes[i], tb->S_new[i]); /* Insert new item into S_new[i] */ buffer_info_init_bh(tb, &bi, tb->S_new[i]); leaf_insert_into_buf(&bi, tb->item_pos - n + tb->snum[i] - 1, ih, body, tb->zeroes_num); tb->zeroes_num = tb->insert_size[0] = 0; } |
65ab18cb7 reiserfs: balance... |
1002 |
} |
b54b8c918 reiserfs: balance... |
1003 1004 |
/* we append to directory item */ static void balance_leaf_new_nodes_paste_dirent(struct tree_balance *tb, |
27d0e5bc8 reiserfs: fix cor... |
1005 1006 |
struct item_head * const ih, const char * const body, |
b54b8c918 reiserfs: balance... |
1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 |
struct item_head *insert_key, struct buffer_head **insert_ptr, int i) { struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path); struct item_head *aux_ih = item_head(tbS0, tb->item_pos); int entry_count = ih_entry_count(aux_ih); struct buffer_info bi; if (entry_count - tb->sbytes[i] < tb->pos_in_item && tb->pos_in_item <= entry_count) { /* new directory entry falls into S_new[i] */ RFALSE(!tb->insert_size[0], "PAP-12215: insert_size is already 0"); RFALSE(tb->sbytes[i] - 1 >= entry_count, "PAP-12220: there are no so much entries (%d), only %d", tb->sbytes[i] - 1, entry_count); /* * Shift snum[i]-1 items in whole. * Shift sbytes[i] directory entries * from directory item number snum[i] */ leaf_move_items(LEAF_FROM_S_TO_SNEW, tb, tb->snum[i], tb->sbytes[i] - 1, tb->S_new[i]); /* * Paste given directory entry to * directory item */ buffer_info_init_bh(tb, &bi, tb->S_new[i]); leaf_paste_in_buffer(&bi, 0, tb->pos_in_item - entry_count + tb->sbytes[i] - 1, tb->insert_size[0], body, tb->zeroes_num); /* paste new directory entry */ leaf_paste_entries(&bi, 0, tb->pos_in_item - entry_count + tb->sbytes[i] - 1, 1, (struct reiserfs_de_head *) body, body + DEH_SIZE, tb->insert_size[0]); tb->insert_size[0] = 0; tb->pos_in_item++; } else { /* new directory entry doesn't fall into S_new[i] */ leaf_move_items(LEAF_FROM_S_TO_SNEW, tb, tb->snum[i], tb->sbytes[i], tb->S_new[i]); } } static void balance_leaf_new_nodes_paste_shift(struct tree_balance *tb, |
27d0e5bc8 reiserfs: fix cor... |
1060 1061 |
struct item_head * const ih, const char * const body, |
9d496552b reiserfs: balance... |
1062 1063 1064 1065 1066 |
struct item_head *insert_key, struct buffer_head **insert_ptr, int i) { struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path); |
b54b8c918 reiserfs: balance... |
1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 |
struct item_head *aux_ih = item_head(tbS0, tb->item_pos); int n_shift, n_rem, r_zeroes_number, shift; const char *r_body; struct item_head *tmp; struct buffer_info bi; RFALSE(ih, "PAP-12210: ih must be 0"); if (is_direntry_le_ih(aux_ih)) { balance_leaf_new_nodes_paste_dirent(tb, ih, body, insert_key, insert_ptr, i); return; } /* regular object */ RFALSE(tb->pos_in_item != ih_item_len(item_head(tbS0, tb->item_pos)) || tb->insert_size[0] <= 0, "PAP-12225: item too short or insert_size <= 0"); /* * Calculate number of bytes which must be shifted from appended item */ n_shift = tb->sbytes[i] - tb->insert_size[0]; if (n_shift < 0) n_shift = 0; leaf_move_items(LEAF_FROM_S_TO_SNEW, tb, tb->snum[i], n_shift, tb->S_new[i]); /* * Calculate number of bytes which must remain in body after * append to S_new[i] */ n_rem = tb->insert_size[0] - tb->sbytes[i]; if (n_rem < 0) n_rem = 0; /* Append part of body into S_new[0] */ buffer_info_init_bh(tb, &bi, tb->S_new[i]); if (n_rem > tb->zeroes_num) { r_zeroes_number = 0; r_body = body + n_rem - tb->zeroes_num; } else { r_body = body; r_zeroes_number = tb->zeroes_num - n_rem; tb->zeroes_num -= r_zeroes_number; } leaf_paste_in_buffer(&bi, 0, n_shift, tb->insert_size[0] - n_rem, r_body, r_zeroes_number); tmp = item_head(tb->S_new[i], 0); shift = 0; if (is_indirect_le_ih(tmp)) { set_ih_free_space(tmp, 0); shift = tb->tb_sb->s_blocksize_bits - UNFM_P_SHIFT; } add_le_ih_k_offset(tmp, n_rem << shift); tb->insert_size[0] = n_rem; if (!n_rem) tb->pos_in_item++; } static void balance_leaf_new_nodes_paste_whole(struct tree_balance *tb, |
27d0e5bc8 reiserfs: fix cor... |
1133 1134 |
struct item_head * const ih, const char * const body, |
b54b8c918 reiserfs: balance... |
1135 1136 1137 1138 1139 1140 |
struct item_head *insert_key, struct buffer_head **insert_ptr, int i) { struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path); |
9d496552b reiserfs: balance... |
1141 |
int n = B_NR_ITEMS(tbS0); |
b54b8c918 reiserfs: balance... |
1142 1143 |
int leaf_mi; struct item_head *pasted; |
9d496552b reiserfs: balance... |
1144 |
struct buffer_info bi; |
9d496552b reiserfs: balance... |
1145 1146 |
#ifdef CONFIG_REISERFS_CHECK |
b54b8c918 reiserfs: balance... |
1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 |
struct item_head *ih_check = item_head(tbS0, tb->item_pos); if (!is_direntry_le_ih(ih_check) && (tb->pos_in_item != ih_item_len(ih_check) || tb->insert_size[0] <= 0)) reiserfs_panic(tb->tb_sb, "PAP-12235", "pos_in_item must be equal to ih_item_len"); #endif leaf_mi = leaf_move_items(LEAF_FROM_S_TO_SNEW, tb, tb->snum[i], tb->sbytes[i], tb->S_new[i]); RFALSE(leaf_mi, "PAP-12240: unexpected value returned by leaf_move_items (%d)", leaf_mi); /* paste into item */ buffer_info_init_bh(tb, &bi, tb->S_new[i]); leaf_paste_in_buffer(&bi, tb->item_pos - n + tb->snum[i], tb->pos_in_item, tb->insert_size[0], body, tb->zeroes_num); pasted = item_head(tb->S_new[i], tb->item_pos - n + tb->snum[i]); if (is_direntry_le_ih(pasted)) leaf_paste_entries(&bi, tb->item_pos - n + tb->snum[i], tb->pos_in_item, 1, (struct reiserfs_de_head *)body, body + DEH_SIZE, tb->insert_size[0]); |
9d496552b reiserfs: balance... |
1177 |
|
b54b8c918 reiserfs: balance... |
1178 1179 1180 |
/* if we paste to indirect item update ih_free_space */ if (is_indirect_le_ih(pasted)) set_ih_free_space(pasted, 0); |
9d496552b reiserfs: balance... |
1181 |
|
b54b8c918 reiserfs: balance... |
1182 1183 1184 1185 |
tb->zeroes_num = tb->insert_size[0] = 0; } static void balance_leaf_new_nodes_paste(struct tree_balance *tb, |
27d0e5bc8 reiserfs: fix cor... |
1186 1187 |
struct item_head * const ih, const char * const body, |
b54b8c918 reiserfs: balance... |
1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 |
struct item_head *insert_key, struct buffer_head **insert_ptr, int i) { struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path); int n = B_NR_ITEMS(tbS0); /* pasted item doesn't fall into S_new[i] */ if (n - tb->snum[i] > tb->item_pos) { leaf_move_items(LEAF_FROM_S_TO_SNEW, tb, tb->snum[i], tb->sbytes[i], tb->S_new[i]); return; } |
9d496552b reiserfs: balance... |
1201 |
|
b54b8c918 reiserfs: balance... |
1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 |
/* pasted item or part if it falls to S_new[i] */ if (tb->item_pos == n - tb->snum[i] && tb->sbytes[i] != -1) /* we must shift part of the appended item */ balance_leaf_new_nodes_paste_shift(tb, ih, body, insert_key, insert_ptr, i); else /* item falls wholly into S_new[i] */ balance_leaf_new_nodes_paste_whole(tb, ih, body, insert_key, insert_ptr, i); |
9d496552b reiserfs: balance... |
1212 |
} |
0080e9f9d reiserfs: balance... |
1213 1214 |
/* Fill new nodes that appear in place of S[0] */ static void balance_leaf_new_nodes(struct tree_balance *tb, |
27d0e5bc8 reiserfs: fix cor... |
1215 1216 |
struct item_head * const ih, const char * const body, |
0080e9f9d reiserfs: balance... |
1217 1218 1219 1220 1221 1222 |
struct item_head *insert_key, struct buffer_head **insert_ptr, int flag) { int i; for (i = tb->blknum[0] - 2; i >= 0; i--) { |
b54b8c918 reiserfs: balance... |
1223 |
BUG_ON(flag != M_INSERT && flag != M_PASTE); |
0080e9f9d reiserfs: balance... |
1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 |
RFALSE(!tb->snum[i], "PAP-12200: snum[%d] == %d. Must be > 0", i, tb->snum[i]); /* here we shift from S to S_new nodes */ tb->S_new[i] = get_FEB(tb); /* initialized block type and tree level */ set_blkh_level(B_BLK_HEAD(tb->S_new[i]), DISK_LEAF_NODE_LEVEL); |
b54b8c918 reiserfs: balance... |
1235 |
if (flag == M_INSERT) |
0080e9f9d reiserfs: balance... |
1236 1237 |
balance_leaf_new_nodes_insert(tb, ih, body, insert_key, insert_ptr, i); |
b54b8c918 reiserfs: balance... |
1238 |
else /* M_PASTE */ |
0080e9f9d reiserfs: balance... |
1239 1240 |
balance_leaf_new_nodes_paste(tb, ih, body, insert_key, insert_ptr, i); |
0080e9f9d reiserfs: balance... |
1241 1242 1243 1244 1245 1246 1247 1248 |
memcpy(insert_key + i, leaf_key(tb->S_new[i], 0), KEY_SIZE); insert_ptr[i] = tb->S_new[i]; RFALSE(!buffer_journaled(tb->S_new[i]) || buffer_journal_dirty(tb->S_new[i]) || buffer_dirty(tb->S_new[i]), "PAP-12247: S_new[%d] : (%b)", |
19ef1229b reiserfs: Fix com... |
1249 |
i, tb->S_new[i]); |
0080e9f9d reiserfs: balance... |
1250 1251 |
} } |
8c480ea19 reiserfs: balance... |
1252 |
static void balance_leaf_finish_node_insert(struct tree_balance *tb, |
27d0e5bc8 reiserfs: fix cor... |
1253 1254 |
struct item_head * const ih, const char * const body) |
8c480ea19 reiserfs: balance... |
1255 1256 1257 |
{ struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path); struct buffer_info bi; |
441378c2b reiserfs: balance... |
1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 |
buffer_info_init_tbS0(tb, &bi); leaf_insert_into_buf(&bi, tb->item_pos, ih, body, tb->zeroes_num); /* If we insert the first key change the delimiting key */ if (tb->item_pos == 0) { if (tb->CFL[0]) /* can be 0 in reiserfsck */ replace_key(tb, tb->CFL[0], tb->lkey[0], tbS0, 0); } } static void balance_leaf_finish_node_paste_dirent(struct tree_balance *tb, |
27d0e5bc8 reiserfs: fix cor... |
1270 1271 |
struct item_head * const ih, const char * const body) |
441378c2b reiserfs: balance... |
1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 |
{ struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path); struct item_head *pasted = item_head(tbS0, tb->item_pos); struct buffer_info bi; if (tb->pos_in_item >= 0 && tb->pos_in_item <= ih_entry_count(pasted)) { RFALSE(!tb->insert_size[0], "PAP-12260: insert_size is 0 already"); /* prepare space */ buffer_info_init_tbS0(tb, &bi); leaf_paste_in_buffer(&bi, tb->item_pos, tb->pos_in_item, tb->insert_size[0], body, tb->zeroes_num); /* paste entry */ leaf_paste_entries(&bi, tb->item_pos, tb->pos_in_item, 1, (struct reiserfs_de_head *)body, body + DEH_SIZE, tb->insert_size[0]); if (!tb->item_pos && !tb->pos_in_item) { RFALSE(!tb->CFL[0] || !tb->L[0], "PAP-12270: CFL[0]/L[0] must be specified"); if (tb->CFL[0]) replace_key(tb, tb->CFL[0], tb->lkey[0], tbS0, 0); } tb->insert_size[0] = 0; } |
8c480ea19 reiserfs: balance... |
1301 |
} |
7f447ba82 reiserfs: balance... |
1302 |
static void balance_leaf_finish_node_paste(struct tree_balance *tb, |
27d0e5bc8 reiserfs: fix cor... |
1303 1304 |
struct item_head * const ih, const char * const body) |
7f447ba82 reiserfs: balance... |
1305 1306 1307 |
{ struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path); struct buffer_info bi; |
441378c2b reiserfs: balance... |
1308 |
struct item_head *pasted = item_head(tbS0, tb->item_pos); |
7f447ba82 reiserfs: balance... |
1309 |
|
441378c2b reiserfs: balance... |
1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 |
/* when directory, may be new entry already pasted */ if (is_direntry_le_ih(pasted)) { balance_leaf_finish_node_paste_dirent(tb, ih, body); return; } /* regular object */ if (tb->pos_in_item == ih_item_len(pasted)) { RFALSE(tb->insert_size[0] <= 0, "PAP-12275: insert size must not be %d", tb->insert_size[0]); buffer_info_init_tbS0(tb, &bi); leaf_paste_in_buffer(&bi, tb->item_pos, tb->pos_in_item, tb->insert_size[0], body, tb->zeroes_num); if (is_indirect_le_ih(pasted)) set_ih_free_space(pasted, 0); tb->insert_size[0] = 0; } #ifdef CONFIG_REISERFS_CHECK else if (tb->insert_size[0]) { print_cur_tb("12285"); reiserfs_panic(tb->tb_sb, "PAP-12285", "insert_size must be 0 (%d)", tb->insert_size[0]); } #endif |
7f447ba82 reiserfs: balance... |
1339 |
} |
0080e9f9d reiserfs: balance... |
1340 1341 1342 1343 1344 1345 |
/* * if the affected item was not wholly shifted then we * perform all necessary operations on that part or whole * of the affected item which remains in S */ static void balance_leaf_finish_node(struct tree_balance *tb, |
27d0e5bc8 reiserfs: fix cor... |
1346 1347 |
struct item_head * const ih, const char * const body, int flag) |
0080e9f9d reiserfs: balance... |
1348 1349 1350 1351 1352 1353 1354 1355 1356 |
{ /* if we must insert or append into buffer S[0] */ if (0 <= tb->item_pos && tb->item_pos < tb->s0num) { if (flag == M_INSERT) balance_leaf_finish_node_insert(tb, ih, body); else /* M_PASTE */ balance_leaf_finish_node_paste(tb, ih, body); } } |
3f0eb2765 reiserfs: balance... |
1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 |
/** * balance_leaf - reiserfs tree balancing algorithm * @tb: tree balance state * @ih: item header of inserted item (little endian) * @body: body of inserted item or bytes to paste * @flag: i - insert, d - delete, c - cut, p - paste (see do_balance) * passed back: * @insert_key: key to insert new nodes * @insert_ptr: array of nodes to insert at the next level * * In our processing of one level we sometimes determine what must be * inserted into the next higher level. This insertion consists of a * key or two keys and their corresponding pointers. */ static int balance_leaf(struct tree_balance *tb, struct item_head *ih, const char *body, int flag, struct item_head *insert_key, struct buffer_head **insert_ptr) { struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path); |
3f0eb2765 reiserfs: balance... |
1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 |
PROC_INFO_INC(tb->tb_sb, balance_at[0]); /* Make balance in case insert_size[0] < 0 */ if (tb->insert_size[0] < 0) return balance_leaf_when_delete(tb, flag); tb->item_pos = PATH_LAST_POSITION(tb->tb_path), tb->pos_in_item = tb->tb_path->pos_in_item, tb->zeroes_num = 0; if (flag == M_INSERT && !body) tb->zeroes_num = ih_item_len(ih); /* * for indirect item pos_in_item is measured in unformatted node * pointers. Recalculate to bytes */ if (flag != M_INSERT && is_indirect_le_ih(item_head(tbS0, tb->item_pos))) tb->pos_in_item *= UNFM_P_SIZE; |
27d0e5bc8 reiserfs: fix cor... |
1397 |
body += balance_leaf_left(tb, ih, body, flag); |
3f0eb2765 reiserfs: balance... |
1398 1399 1400 1401 |
/* tb->lnum[0] > 0 */ /* Calculate new item position */ tb->item_pos -= (tb->lnum[0] - ((tb->lbytes != -1) ? 1 : 0)); |
0080e9f9d reiserfs: balance... |
1402 |
balance_leaf_right(tb, ih, body, flag); |
1da177e4c Linux-2.6.12-rc2 |
1403 |
|
bd4c625c0 reiserfs: run scr... |
1404 1405 |
/* tb->rnum[0] > 0 */ RFALSE(tb->blknum[0] > 3, |
416e2abd9 reiserfs: fix utt... |
1406 |
"PAP-12180: blknum can not be %d. It must be <= 3", tb->blknum[0]); |
bd4c625c0 reiserfs: run scr... |
1407 |
RFALSE(tb->blknum[0] < 0, |
416e2abd9 reiserfs: fix utt... |
1408 |
"PAP-12185: blknum can not be %d. It must be >= 0", tb->blknum[0]); |
bd4c625c0 reiserfs: run scr... |
1409 |
|
97fd4b97a reiserfs: balance... |
1410 1411 1412 1413 1414 |
/* * if while adding to a node we discover that it is possible to split * it in two, and merge the left part into the left neighbor and the * right part into the right neighbor, eliminating the node */ |
bd4c625c0 reiserfs: run scr... |
1415 1416 1417 1418 |
if (tb->blknum[0] == 0) { /* node S[0] is empty now */ RFALSE(!tb->lnum[0] || !tb->rnum[0], "PAP-12190: lnum and rnum must not be zero"); |
97fd4b97a reiserfs: balance... |
1419 1420 1421 1422 1423 |
/* * if insertion was done before 0-th position in R[0], right * delimiting key of the tb->L[0]'s and left delimiting key are * not set correctly */ |
bd4c625c0 reiserfs: run scr... |
1424 1425 |
if (tb->CFL[0]) { if (!tb->CFR[0]) |
c3a9c2109 reiserfs: rework ... |
1426 1427 |
reiserfs_panic(tb->tb_sb, "vs-12195", "CFR not initialized"); |
4cf5f7add reiserfs: cleanup... |
1428 1429 |
copy_key(internal_key(tb->CFL[0], tb->lkey[0]), internal_key(tb->CFR[0], tb->rkey[0])); |
bd4c625c0 reiserfs: run scr... |
1430 1431 |
do_balance_mark_internal_dirty(tb, tb->CFL[0], 0); } |
1da177e4c Linux-2.6.12-rc2 |
1432 |
|
bd4c625c0 reiserfs: run scr... |
1433 1434 1435 |
reiserfs_invalidate_buffer(tb, tbS0); return 0; } |
1da177e4c Linux-2.6.12-rc2 |
1436 |
|
0080e9f9d reiserfs: balance... |
1437 |
balance_leaf_new_nodes(tb, ih, body, insert_key, insert_ptr, flag); |
bd4c625c0 reiserfs: run scr... |
1438 |
|
0080e9f9d reiserfs: balance... |
1439 |
balance_leaf_finish_node(tb, ih, body, flag); |
bd4c625c0 reiserfs: run scr... |
1440 |
|
1da177e4c Linux-2.6.12-rc2 |
1441 |
#ifdef CONFIG_REISERFS_CHECK |
bd4c625c0 reiserfs: run scr... |
1442 1443 1444 |
if (flag == M_PASTE && tb->insert_size[0]) { print_cur_tb("12290"); reiserfs_panic(tb->tb_sb, |
c3a9c2109 reiserfs: rework ... |
1445 |
"PAP-12290", "insert_size is still not 0 (%d)", |
bd4c625c0 reiserfs: run scr... |
1446 1447 |
tb->insert_size[0]); } |
97fd4b97a reiserfs: balance... |
1448 1449 1450 |
#endif /* Leaf level of the tree is balanced (end of balance_leaf) */ |
bd4c625c0 reiserfs: run scr... |
1451 |
return 0; |
97fd4b97a reiserfs: balance... |
1452 |
} |
1da177e4c Linux-2.6.12-rc2 |
1453 1454 |
/* Make empty node */ |
bd4c625c0 reiserfs: run scr... |
1455 |
void make_empty_node(struct buffer_info *bi) |
1da177e4c Linux-2.6.12-rc2 |
1456 |
{ |
bd4c625c0 reiserfs: run scr... |
1457 |
struct block_head *blkh; |
1da177e4c Linux-2.6.12-rc2 |
1458 |
|
bd4c625c0 reiserfs: run scr... |
1459 |
RFALSE(bi->bi_bh == NULL, "PAP-12295: pointer to the buffer is NULL"); |
1da177e4c Linux-2.6.12-rc2 |
1460 |
|
bd4c625c0 reiserfs: run scr... |
1461 1462 1463 |
blkh = B_BLK_HEAD(bi->bi_bh); set_blkh_nr_item(blkh, 0); set_blkh_free_space(blkh, MAX_CHILD_SIZE(bi->bi_bh)); |
1da177e4c Linux-2.6.12-rc2 |
1464 |
|
bd4c625c0 reiserfs: run scr... |
1465 1466 |
if (bi->bi_parent) B_N_CHILD(bi->bi_parent, bi->bi_position)->dc_size = 0; /* Endian safe if 0 */ |
1da177e4c Linux-2.6.12-rc2 |
1467 |
} |
1da177e4c Linux-2.6.12-rc2 |
1468 |
/* Get first empty buffer */ |
bd4c625c0 reiserfs: run scr... |
1469 |
struct buffer_head *get_FEB(struct tree_balance *tb) |
1da177e4c Linux-2.6.12-rc2 |
1470 |
{ |
bd4c625c0 reiserfs: run scr... |
1471 |
int i; |
bd4c625c0 reiserfs: run scr... |
1472 |
struct buffer_info bi; |
1da177e4c Linux-2.6.12-rc2 |
1473 |
|
bd4c625c0 reiserfs: run scr... |
1474 |
for (i = 0; i < MAX_FEB_SIZE; i++) |
9dce07f1a NULL noise: fs/*,... |
1475 |
if (tb->FEB[i] != NULL) |
bd4c625c0 reiserfs: run scr... |
1476 1477 1478 |
break; if (i == MAX_FEB_SIZE) |
c3a9c2109 reiserfs: rework ... |
1479 |
reiserfs_panic(tb->tb_sb, "vs-12300", "FEB list is empty"); |
bd4c625c0 reiserfs: run scr... |
1480 |
|
fba4ebb5f reiserfs: factor ... |
1481 |
buffer_info_init_bh(tb, &bi, tb->FEB[i]); |
bd4c625c0 reiserfs: run scr... |
1482 |
make_empty_node(&bi); |
fba4ebb5f reiserfs: factor ... |
1483 1484 |
set_buffer_uptodate(tb->FEB[i]); tb->used[i] = tb->FEB[i]; |
bd4c625c0 reiserfs: run scr... |
1485 |
tb->FEB[i] = NULL; |
bd4c625c0 reiserfs: run scr... |
1486 |
|
fba4ebb5f reiserfs: factor ... |
1487 |
return tb->used[i]; |
bd4c625c0 reiserfs: run scr... |
1488 |
} |
1da177e4c Linux-2.6.12-rc2 |
1489 |
|
098297b27 reiserfs: cleanup... |
1490 |
/* This is now used because reiserfs_free_block has to be able to schedule. */ |
bd4c625c0 reiserfs: run scr... |
1491 |
static void store_thrown(struct tree_balance *tb, struct buffer_head *bh) |
1da177e4c Linux-2.6.12-rc2 |
1492 |
{ |
bd4c625c0 reiserfs: run scr... |
1493 1494 1495 |
int i; if (buffer_dirty(bh)) |
45b03d5e8 reiserfs: rework ... |
1496 1497 |
reiserfs_warning(tb->tb_sb, "reiserfs-12320", "called with dirty buffer"); |
79a81aef7 [PATCH] reiserfs:... |
1498 |
for (i = 0; i < ARRAY_SIZE(tb->thrown); i++) |
bd4c625c0 reiserfs: run scr... |
1499 1500 1501 1502 1503 |
if (!tb->thrown[i]) { tb->thrown[i] = bh; get_bh(bh); /* free_thrown puts this */ return; } |
45b03d5e8 reiserfs: rework ... |
1504 1505 |
reiserfs_warning(tb->tb_sb, "reiserfs-12321", "too many thrown buffers"); |
1da177e4c Linux-2.6.12-rc2 |
1506 |
} |
bd4c625c0 reiserfs: run scr... |
1507 1508 1509 1510 |
static void free_thrown(struct tree_balance *tb) { int i; b_blocknr_t blocknr; |
79a81aef7 [PATCH] reiserfs:... |
1511 |
for (i = 0; i < ARRAY_SIZE(tb->thrown); i++) { |
bd4c625c0 reiserfs: run scr... |
1512 1513 1514 |
if (tb->thrown[i]) { blocknr = tb->thrown[i]->b_blocknr; if (buffer_dirty(tb->thrown[i])) |
45b03d5e8 reiserfs: rework ... |
1515 1516 |
reiserfs_warning(tb->tb_sb, "reiserfs-12322", "called with dirty buffer %d", |
bd4c625c0 reiserfs: run scr... |
1517 1518 1519 1520 1521 |
blocknr); brelse(tb->thrown[i]); /* incremented in store_thrown */ reiserfs_free_block(tb->transaction_handle, NULL, blocknr, 0); } |
1da177e4c Linux-2.6.12-rc2 |
1522 |
} |
1da177e4c Linux-2.6.12-rc2 |
1523 |
} |
bd4c625c0 reiserfs: run scr... |
1524 |
void reiserfs_invalidate_buffer(struct tree_balance *tb, struct buffer_head *bh) |
1da177e4c Linux-2.6.12-rc2 |
1525 |
{ |
bd4c625c0 reiserfs: run scr... |
1526 1527 1528 1529 1530 1531 1532 |
struct block_head *blkh; blkh = B_BLK_HEAD(bh); set_blkh_level(blkh, FREE_LEVEL); set_blkh_nr_item(blkh, 0); clear_buffer_dirty(bh); store_thrown(tb, bh); |
1da177e4c Linux-2.6.12-rc2 |
1533 1534 1535 |
} /* Replace n_dest'th key in buffer dest by n_src'th key of buffer src.*/ |
bd4c625c0 reiserfs: run scr... |
1536 1537 |
void replace_key(struct tree_balance *tb, struct buffer_head *dest, int n_dest, struct buffer_head *src, int n_src) |
1da177e4c Linux-2.6.12-rc2 |
1538 |
{ |
bd4c625c0 reiserfs: run scr... |
1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 |
RFALSE(dest == NULL || src == NULL, "vs-12305: source or destination buffer is 0 (src=%p, dest=%p)", src, dest); RFALSE(!B_IS_KEYS_LEVEL(dest), "vs-12310: invalid level (%z) for destination buffer. dest must be leaf", dest); RFALSE(n_dest < 0 || n_src < 0, "vs-12315: src(%d) or dest(%d) key number < 0", n_src, n_dest); RFALSE(n_dest >= B_NR_ITEMS(dest) || n_src >= B_NR_ITEMS(src), "vs-12320: src(%d(%d)) or dest(%d(%d)) key number is too big", n_src, B_NR_ITEMS(src), n_dest, B_NR_ITEMS(dest)); if (B_IS_ITEMS_LEVEL(src)) /* source buffer contains leaf node */ |
4cf5f7add reiserfs: cleanup... |
1553 |
memcpy(internal_key(dest, n_dest), item_head(src, n_src), |
bd4c625c0 reiserfs: run scr... |
1554 1555 |
KEY_SIZE); else |
4cf5f7add reiserfs: cleanup... |
1556 |
memcpy(internal_key(dest, n_dest), internal_key(src, n_src), |
bd4c625c0 reiserfs: run scr... |
1557 1558 1559 |
KEY_SIZE); do_balance_mark_internal_dirty(tb, dest, 0); |
1da177e4c Linux-2.6.12-rc2 |
1560 |
} |
bd4c625c0 reiserfs: run scr... |
1561 |
int get_left_neighbor_position(struct tree_balance *tb, int h) |
1da177e4c Linux-2.6.12-rc2 |
1562 |
{ |
bd4c625c0 reiserfs: run scr... |
1563 |
int Sh_position = PATH_H_POSITION(tb->tb_path, h + 1); |
1da177e4c Linux-2.6.12-rc2 |
1564 |
|
9dce07f1a NULL noise: fs/*,... |
1565 |
RFALSE(PATH_H_PPARENT(tb->tb_path, h) == NULL || tb->FL[h] == NULL, |
bd4c625c0 reiserfs: run scr... |
1566 1567 |
"vs-12325: FL[%d](%p) or F[%d](%p) does not exist", h, tb->FL[h], h, PATH_H_PPARENT(tb->tb_path, h)); |
1da177e4c Linux-2.6.12-rc2 |
1568 |
|
bd4c625c0 reiserfs: run scr... |
1569 1570 1571 1572 |
if (Sh_position == 0) return B_NR_ITEMS(tb->FL[h]); else return Sh_position - 1; |
1da177e4c Linux-2.6.12-rc2 |
1573 |
} |
bd4c625c0 reiserfs: run scr... |
1574 |
int get_right_neighbor_position(struct tree_balance *tb, int h) |
1da177e4c Linux-2.6.12-rc2 |
1575 |
{ |
bd4c625c0 reiserfs: run scr... |
1576 |
int Sh_position = PATH_H_POSITION(tb->tb_path, h + 1); |
1da177e4c Linux-2.6.12-rc2 |
1577 |
|
9dce07f1a NULL noise: fs/*,... |
1578 |
RFALSE(PATH_H_PPARENT(tb->tb_path, h) == NULL || tb->FR[h] == NULL, |
bd4c625c0 reiserfs: run scr... |
1579 1580 |
"vs-12330: F[%d](%p) or FR[%d](%p) does not exist", h, PATH_H_PPARENT(tb->tb_path, h), h, tb->FR[h]); |
1da177e4c Linux-2.6.12-rc2 |
1581 |
|
bd4c625c0 reiserfs: run scr... |
1582 1583 1584 1585 |
if (Sh_position == B_NR_ITEMS(PATH_H_PPARENT(tb->tb_path, h))) return 0; else return Sh_position + 1; |
1da177e4c Linux-2.6.12-rc2 |
1586 |
} |
1da177e4c Linux-2.6.12-rc2 |
1587 |
#ifdef CONFIG_REISERFS_CHECK |
bd4c625c0 reiserfs: run scr... |
1588 1589 1590 |
int is_reusable(struct super_block *s, b_blocknr_t block, int bit_value); static void check_internal_node(struct super_block *s, struct buffer_head *bh, char *mes) |
1da177e4c Linux-2.6.12-rc2 |
1591 |
{ |
bd4c625c0 reiserfs: run scr... |
1592 1593 |
struct disk_child *dc; int i; |
1da177e4c Linux-2.6.12-rc2 |
1594 |
|
bd4c625c0 reiserfs: run scr... |
1595 |
RFALSE(!bh, "PAP-12336: bh == 0"); |
1da177e4c Linux-2.6.12-rc2 |
1596 |
|
bd4c625c0 reiserfs: run scr... |
1597 1598 |
if (!bh || !B_IS_IN_TREE(bh)) return; |
1da177e4c Linux-2.6.12-rc2 |
1599 |
|
bd4c625c0 reiserfs: run scr... |
1600 1601 1602 1603 |
RFALSE(!buffer_dirty(bh) && !(buffer_journaled(bh) || buffer_journal_dirty(bh)), "PAP-12337: buffer (%b) must be dirty", bh); dc = B_N_CHILD(bh, 0); |
1da177e4c Linux-2.6.12-rc2 |
1604 |
|
bd4c625c0 reiserfs: run scr... |
1605 1606 1607 |
for (i = 0; i <= B_NR_ITEMS(bh); i++, dc++) { if (!is_reusable(s, dc_block_number(dc), 1)) { print_cur_tb(mes); |
c3a9c2109 reiserfs: rework ... |
1608 1609 |
reiserfs_panic(s, "PAP-12338", "invalid child pointer %y in %b", |
bd4c625c0 reiserfs: run scr... |
1610 1611 1612 |
dc, bh); } } |
1da177e4c Linux-2.6.12-rc2 |
1613 |
} |
45b03d5e8 reiserfs: rework ... |
1614 1615 |
static int locked_or_not_in_tree(struct tree_balance *tb, struct buffer_head *bh, char *which) |
bd4c625c0 reiserfs: run scr... |
1616 1617 1618 |
{ if ((!buffer_journal_prepared(bh) && buffer_locked(bh)) || !B_IS_IN_TREE(bh)) { |
45b03d5e8 reiserfs: rework ... |
1619 |
reiserfs_warning(tb->tb_sb, "vs-12339", "%s (%b)", which, bh); |
bd4c625c0 reiserfs: run scr... |
1620 1621 1622 1623 |
return 1; } return 0; } |
1da177e4c Linux-2.6.12-rc2 |
1624 |
|
bd4c625c0 reiserfs: run scr... |
1625 |
static int check_before_balancing(struct tree_balance *tb) |
1da177e4c Linux-2.6.12-rc2 |
1626 |
{ |
bd4c625c0 reiserfs: run scr... |
1627 |
int retval = 0; |
08f14fc89 kill-the-bkl/reis... |
1628 |
if (REISERFS_SB(tb->tb_sb)->cur_tb) { |
c3a9c2109 reiserfs: rework ... |
1629 1630 1631 |
reiserfs_panic(tb->tb_sb, "vs-12335", "suspect that schedule " "occurred based on cur_tb not being null at " "this point in code. do_balance cannot properly " |
08f14fc89 kill-the-bkl/reis... |
1632 1633 |
"handle concurrent tree accesses on a same " "mount point."); |
1da177e4c Linux-2.6.12-rc2 |
1634 |
} |
bd4c625c0 reiserfs: run scr... |
1635 |
|
098297b27 reiserfs: cleanup... |
1636 1637 1638 1639 |
/* * double check that buffers that we will modify are unlocked. * (fix_nodes should already have prepped all of these for us). */ |
bd4c625c0 reiserfs: run scr... |
1640 |
if (tb->lnum[0]) { |
45b03d5e8 reiserfs: rework ... |
1641 1642 1643 |
retval |= locked_or_not_in_tree(tb, tb->L[0], "L[0]"); retval |= locked_or_not_in_tree(tb, tb->FL[0], "FL[0]"); retval |= locked_or_not_in_tree(tb, tb->CFL[0], "CFL[0]"); |
bd4c625c0 reiserfs: run scr... |
1644 |
check_leaf(tb->L[0]); |
1da177e4c Linux-2.6.12-rc2 |
1645 |
} |
bd4c625c0 reiserfs: run scr... |
1646 |
if (tb->rnum[0]) { |
45b03d5e8 reiserfs: rework ... |
1647 1648 1649 |
retval |= locked_or_not_in_tree(tb, tb->R[0], "R[0]"); retval |= locked_or_not_in_tree(tb, tb->FR[0], "FR[0]"); retval |= locked_or_not_in_tree(tb, tb->CFR[0], "CFR[0]"); |
bd4c625c0 reiserfs: run scr... |
1650 1651 |
check_leaf(tb->R[0]); } |
45b03d5e8 reiserfs: rework ... |
1652 1653 |
retval |= locked_or_not_in_tree(tb, PATH_PLAST_BUFFER(tb->tb_path), "S[0]"); |
bd4c625c0 reiserfs: run scr... |
1654 |
check_leaf(PATH_PLAST_BUFFER(tb->tb_path)); |
1da177e4c Linux-2.6.12-rc2 |
1655 |
|
bd4c625c0 reiserfs: run scr... |
1656 1657 |
return retval; } |
1da177e4c Linux-2.6.12-rc2 |
1658 |
|
bd4c625c0 reiserfs: run scr... |
1659 |
static void check_after_balance_leaf(struct tree_balance *tb) |
1da177e4c Linux-2.6.12-rc2 |
1660 |
{ |
bd4c625c0 reiserfs: run scr... |
1661 1662 1663 1664 1665 1666 |
if (tb->lnum[0]) { if (B_FREE_SPACE(tb->L[0]) != MAX_CHILD_SIZE(tb->L[0]) - dc_size(B_N_CHILD (tb->FL[0], get_left_neighbor_position(tb, 0)))) { print_cur_tb("12221"); |
c3a9c2109 reiserfs: rework ... |
1667 1668 |
reiserfs_panic(tb->tb_sb, "PAP-12355", "shift to left was incorrect"); |
bd4c625c0 reiserfs: run scr... |
1669 1670 1671 1672 1673 1674 1675 1676 |
} } if (tb->rnum[0]) { if (B_FREE_SPACE(tb->R[0]) != MAX_CHILD_SIZE(tb->R[0]) - dc_size(B_N_CHILD (tb->FR[0], get_right_neighbor_position(tb, 0)))) { print_cur_tb("12222"); |
c3a9c2109 reiserfs: rework ... |
1677 1678 |
reiserfs_panic(tb->tb_sb, "PAP-12360", "shift to right was incorrect"); |
bd4c625c0 reiserfs: run scr... |
1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 |
} } if (PATH_H_PBUFFER(tb->tb_path, 1) && (B_FREE_SPACE(PATH_H_PBUFFER(tb->tb_path, 0)) != (MAX_CHILD_SIZE(PATH_H_PBUFFER(tb->tb_path, 0)) - dc_size(B_N_CHILD(PATH_H_PBUFFER(tb->tb_path, 1), PATH_H_POSITION(tb->tb_path, 1)))))) { int left = B_FREE_SPACE(PATH_H_PBUFFER(tb->tb_path, 0)); int right = (MAX_CHILD_SIZE(PATH_H_PBUFFER(tb->tb_path, 0)) - dc_size(B_N_CHILD(PATH_H_PBUFFER(tb->tb_path, 1), PATH_H_POSITION(tb->tb_path, 1)))); print_cur_tb("12223"); |
45b03d5e8 reiserfs: rework ... |
1692 |
reiserfs_warning(tb->tb_sb, "reiserfs-12363", |
bd4c625c0 reiserfs: run scr... |
1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 |
"B_FREE_SPACE (PATH_H_PBUFFER(tb->tb_path,0)) = %d; " "MAX_CHILD_SIZE (%d) - dc_size( %y, %d ) [%d] = %d", left, MAX_CHILD_SIZE(PATH_H_PBUFFER(tb->tb_path, 0)), PATH_H_PBUFFER(tb->tb_path, 1), PATH_H_POSITION(tb->tb_path, 1), dc_size(B_N_CHILD (PATH_H_PBUFFER(tb->tb_path, 1), PATH_H_POSITION(tb->tb_path, 1))), right); |
c3a9c2109 reiserfs: rework ... |
1703 |
reiserfs_panic(tb->tb_sb, "PAP-12365", "S is incorrect"); |
bd4c625c0 reiserfs: run scr... |
1704 |
} |
1da177e4c Linux-2.6.12-rc2 |
1705 |
} |
bd4c625c0 reiserfs: run scr... |
1706 |
static void check_leaf_level(struct tree_balance *tb) |
1da177e4c Linux-2.6.12-rc2 |
1707 |
{ |
bd4c625c0 reiserfs: run scr... |
1708 1709 1710 1711 |
check_leaf(tb->L[0]); check_leaf(tb->R[0]); check_leaf(PATH_PLAST_BUFFER(tb->tb_path)); } |
1da177e4c Linux-2.6.12-rc2 |
1712 |
|
bd4c625c0 reiserfs: run scr... |
1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 |
static void check_internal_levels(struct tree_balance *tb) { int h; /* check all internal nodes */ for (h = 1; tb->insert_size[h]; h++) { check_internal_node(tb->tb_sb, PATH_H_PBUFFER(tb->tb_path, h), "BAD BUFFER ON PATH"); if (tb->lnum[h]) check_internal_node(tb->tb_sb, tb->L[h], "BAD L"); if (tb->rnum[h]) check_internal_node(tb->tb_sb, tb->R[h], "BAD R"); } |
1da177e4c Linux-2.6.12-rc2 |
1726 1727 1728 1729 |
} #endif |
098297b27 reiserfs: cleanup... |
1730 1731 1732 1733 1734 1735 1736 1737 |
/* * Now we have all of the buffers that must be used in balancing of * the tree. We rely on the assumption that schedule() will not occur * while do_balance works. ( Only interrupt handlers are acceptable.) * We balance the tree according to the analysis made before this, * using buffers already obtained. For SMP support it will someday be * necessary to add ordered locking of tb. */ |
1da177e4c Linux-2.6.12-rc2 |
1738 |
|
098297b27 reiserfs: cleanup... |
1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 |
/* * Some interesting rules of balancing: * we delete a maximum of two nodes per level per balancing: we never * delete R, when we delete two of three nodes L, S, R then we move * them into R. * * we only delete L if we are deleting two nodes, if we delete only * one node we delete S * * if we shift leaves then we shift as much as we can: this is a * deliberate policy of extremism in node packing which results in * higher average utilization after repeated random balance operations * at the cost of more memory copies and more balancing as a result of * small insertions to full nodes. * * if we shift internal nodes we try to evenly balance the node * utilization, with consequent less balancing at the cost of lower * utilization. * * one could argue that the policy for directories in leaves should be * that of internal nodes, but we will wait until another day to * evaluate this.... It would be nice to someday measure and prove * these assumptions as to what is optimal.... */ |
1da177e4c Linux-2.6.12-rc2 |
1763 |
|
bd4c625c0 reiserfs: run scr... |
1764 |
static inline void do_balance_starts(struct tree_balance *tb) |
1da177e4c Linux-2.6.12-rc2 |
1765 |
{ |
098297b27 reiserfs: cleanup... |
1766 |
/* use print_cur_tb() to see initial state of struct tree_balance */ |
1da177e4c Linux-2.6.12-rc2 |
1767 |
|
bd4c625c0 reiserfs: run scr... |
1768 |
/* store_print_tb (tb); */ |
1da177e4c Linux-2.6.12-rc2 |
1769 |
|
bd4c625c0 reiserfs: run scr... |
1770 |
/* do not delete, just comment it out */ |
098297b27 reiserfs: cleanup... |
1771 1772 1773 1774 |
/* print_tb(flag, PATH_LAST_POSITION(tb->tb_path), tb->tb_path->pos_in_item, tb, "check"); */ |
bd4c625c0 reiserfs: run scr... |
1775 |
RFALSE(check_before_balancing(tb), "PAP-12340: locked buffers in TB"); |
1da177e4c Linux-2.6.12-rc2 |
1776 |
#ifdef CONFIG_REISERFS_CHECK |
08f14fc89 kill-the-bkl/reis... |
1777 |
REISERFS_SB(tb->tb_sb)->cur_tb = tb; |
1da177e4c Linux-2.6.12-rc2 |
1778 1779 |
#endif } |
bd4c625c0 reiserfs: run scr... |
1780 |
static inline void do_balance_completed(struct tree_balance *tb) |
1da177e4c Linux-2.6.12-rc2 |
1781 |
{ |
bd4c625c0 reiserfs: run scr... |
1782 |
|
1da177e4c Linux-2.6.12-rc2 |
1783 |
#ifdef CONFIG_REISERFS_CHECK |
bd4c625c0 reiserfs: run scr... |
1784 1785 |
check_leaf_level(tb); check_internal_levels(tb); |
08f14fc89 kill-the-bkl/reis... |
1786 |
REISERFS_SB(tb->tb_sb)->cur_tb = NULL; |
1da177e4c Linux-2.6.12-rc2 |
1787 |
#endif |
098297b27 reiserfs: cleanup... |
1788 1789 1790 1791 |
/* * reiserfs_free_block is no longer schedule safe. So, we need to * put the buffers we want freed on the thrown list during do_balance, * and then free them now |
bd4c625c0 reiserfs: run scr... |
1792 |
*/ |
1da177e4c Linux-2.6.12-rc2 |
1793 |
|
bd4c625c0 reiserfs: run scr... |
1794 |
REISERFS_SB(tb->tb_sb)->s_do_balance++; |
1da177e4c Linux-2.6.12-rc2 |
1795 |
|
bd4c625c0 reiserfs: run scr... |
1796 1797 |
/* release all nodes hold to perform the balancing */ unfix_nodes(tb); |
1da177e4c Linux-2.6.12-rc2 |
1798 |
|
bd4c625c0 reiserfs: run scr... |
1799 |
free_thrown(tb); |
1da177e4c Linux-2.6.12-rc2 |
1800 |
} |
098297b27 reiserfs: cleanup... |
1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 |
/* * do_balance - balance the tree * * @tb: tree_balance structure * @ih: item header of inserted item * @body: body of inserted item or bytes to paste * @flag: 'i' - insert, 'd' - delete, 'c' - cut, 'p' paste * * Cut means delete part of an item (includes removing an entry from a * directory). * * Delete means delete whole item. * * Insert means add a new item into the tree. * * Paste means to append to the end of an existing file or to * insert a directory entry. */ void do_balance(struct tree_balance *tb, struct item_head *ih, const char *body, int flag) { int child_pos; /* position of a child node in its parent */ int h; /* level of the tree being processed */ /* * in our processing of one level we sometimes determine what * must be inserted into the next higher level. This insertion * consists of a key or two keys and their corresponding * pointers */ struct item_head insert_key[2]; /* inserted node-ptrs for the next level */ struct buffer_head *insert_ptr[2]; |
bd4c625c0 reiserfs: run scr... |
1835 1836 1837 1838 1839 |
tb->tb_mode = flag; tb->need_balance_dirty = 0; if (FILESYSTEM_CHANGED_TB(tb)) { |
c3a9c2109 reiserfs: rework ... |
1840 1841 |
reiserfs_panic(tb->tb_sb, "clm-6000", "fs generation has " "changed"); |
bd4c625c0 reiserfs: run scr... |
1842 1843 1844 |
} /* if we have no real work to do */ if (!tb->insert_size[0]) { |
45b03d5e8 reiserfs: rework ... |
1845 1846 |
reiserfs_warning(tb->tb_sb, "PAP-12350", "insert_size == 0, mode == %c", flag); |
bd4c625c0 reiserfs: run scr... |
1847 1848 1849 |
unfix_nodes(tb); return; } |
1da177e4c Linux-2.6.12-rc2 |
1850 |
|
a228bf8f0 reiserfs: cleanup... |
1851 |
atomic_inc(&fs_generation(tb->tb_sb)); |
bd4c625c0 reiserfs: run scr... |
1852 |
do_balance_starts(tb); |
1da177e4c Linux-2.6.12-rc2 |
1853 |
|
098297b27 reiserfs: cleanup... |
1854 1855 1856 1857 1858 |
/* * balance_leaf returns 0 except if combining L R and S into * one node. see balance_internal() for explanation of this * line of code. */ |
bd4c625c0 reiserfs: run scr... |
1859 1860 |
child_pos = PATH_H_B_ITEM_ORDER(tb->tb_path, 0) + balance_leaf(tb, ih, body, flag, insert_key, insert_ptr); |
1da177e4c Linux-2.6.12-rc2 |
1861 1862 |
#ifdef CONFIG_REISERFS_CHECK |
bd4c625c0 reiserfs: run scr... |
1863 |
check_after_balance_leaf(tb); |
1da177e4c Linux-2.6.12-rc2 |
1864 |
#endif |
bd4c625c0 reiserfs: run scr... |
1865 1866 |
/* Balance internal level of the tree. */ for (h = 1; h < MAX_HEIGHT && tb->insert_size[h]; h++) |
83a3a5693 reiserfs: balance... |
1867 1868 |
child_pos = balance_internal(tb, h, child_pos, insert_key, insert_ptr); |
1da177e4c Linux-2.6.12-rc2 |
1869 |
|
bd4c625c0 reiserfs: run scr... |
1870 |
do_balance_completed(tb); |
1da177e4c Linux-2.6.12-rc2 |
1871 |
} |