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