Searched refs:insert_num (Results 1 - 1 of 1) sorted by relevance
| /linux-4.1.27/fs/reiserfs/ |
| H A D | ibalance.c | 629 * Delete insert_num node pointers together with their left items
635 int insert_num; balance_internal_when_delete() local
640 insert_num = tb->insert_size[h] / ((int)(DC_SIZE + KEY_SIZE)); balance_internal_when_delete()
648 internal_delete_childs(&bi, child_pos, -insert_num); balance_internal_when_delete()
819 int insert_num, n, k; balance_internal() local
834 * Using insert_size[h] calculate the number insert_num of items balance_internal()
837 insert_num = tb->insert_size[h] / ((int)(KEY_SIZE + DC_SIZE)); balance_internal()
839 /* Check whether insert_num is proper * */ balance_internal()
840 RFALSE(insert_num < -2 || insert_num > 2, balance_internal()
842 insert_num); balance_internal()
843 RFALSE(h > 1 && (insert_num > 1 || insert_num < -1), balance_internal()
845 insert_num, h); balance_internal()
847 /* Make balance in case insert_num < 0 */ balance_internal()
848 if (insert_num < 0) { balance_internal()
866 } else if (tb->lnum[h] > child_pos + insert_num) { balance_internal()
869 tb->lnum[h] - insert_num); balance_internal()
870 /* insert insert_num keys and node-pointers into L[h] */ balance_internal()
878 insert_num, insert_key, balance_internal()
881 insert_num = 0; balance_internal()
918 insert_num -= k; balance_internal()
934 else if (n + insert_num - tb->rnum[h] < child_pos) { balance_internal()
937 tb->rnum[h] - insert_num); balance_internal()
939 /* insert insert_num keys and node-pointers into R[h] */ balance_internal()
946 child_pos - n - insert_num + balance_internal()
948 insert_num, insert_key, balance_internal()
950 insert_num = 0; balance_internal()
967 replace_rkey(tb, h, insert_key + insert_num - k - 1); balance_internal()
971 * node-ptr insert_ptr[insert_num-k-1] balance_internal()
976 [insert_num - k - 1]) - balance_internal()
978 [insert_num - k - 1])); balance_internal()
980 insert_ptr[insert_num - k - balance_internal()
985 insert_num -= (k + 1); balance_internal()
1060 snum = (insert_num + n + 1) / 2; balance_internal()
1070 } else if (n + insert_num - snum < child_pos) { balance_internal()
1078 internal_key(tbSh, n + insert_num - snum), balance_internal()
1083 snum - insert_num, 0); balance_internal()
1086 * insert insert_num keys and node-pointers balance_internal()
1091 child_pos - n - insert_num + balance_internal()
1093 insert_num, insert_key, balance_internal()
1096 insert_num = 0; balance_internal()
1111 /* new_insert_key = insert_key[insert_num - k - 1] */ balance_internal()
1112 memcpy(&new_insert_key, insert_key + insert_num - k - 1, balance_internal()
1116 * to insert_ptr[insert_num-k-1] balance_internal()
1122 (insert_ptr[insert_num - k - 1]) - balance_internal()
1124 [insert_num - k - 1]))); balance_internal()
1126 insert_ptr[insert_num - k - balance_internal()
1131 insert_num -= (k + 1); balance_internal()
1145 if (0 <= child_pos && child_pos <= n && insert_num > 0) { balance_internal()
1152 child_pos, insert_num, insert_key, balance_internal()
|
Completed in 57 milliseconds