Lines Matching defs:vn
81 struct virtual_node *vn = tb->tb_vn;
88 vn->vn_size =
93 vn->vn_nr_item = (vn->vn_size - DC_SIZE) / (DC_SIZE + KEY_SIZE);
98 vn->vn_nr_item =
99 B_NR_ITEMS(Sh) + ((vn->vn_mode == M_INSERT) ? 1 : 0) -
100 ((vn->vn_mode == M_DELETE) ? 1 : 0);
103 vn->vn_vi = (struct virtual_item *)(tb->tb_vn + 1);
104 memset(vn->vn_vi, 0, vn->vn_nr_item * sizeof(struct virtual_item));
105 vn->vn_free_ptr += vn->vn_nr_item * sizeof(struct virtual_item);
112 && (vn->vn_mode != M_DELETE || vn->vn_affected_item_num))
113 vn->vn_vi[0].vi_type |= VI_TYPE_LEFT_MERGEABLE;
116 for (new_num = 0; new_num < vn->vn_nr_item; new_num++) {
118 struct virtual_item *vi = vn->vn_vi + new_num;
120 ((new_num != vn->vn_affected_item_num) ? 0 : 1);
122 if (is_affected && vn->vn_mode == M_INSERT)
126 j = old_item_num(new_num, vn->vn_affected_item_num,
127 vn->vn_mode);
132 vi->vi_uarea = vn->vn_free_ptr;
135 vn->vn_free_ptr +=
136 op_create_vi(vn, vi, is_affected, tb->insert_size[0]);
137 if (tb->vn_buf + tb->vn_buf_size < vn->vn_free_ptr)
145 if (vn->vn_mode == M_PASTE || vn->vn_mode == M_CUT) {
146 vn->vn_vi[new_num].vi_item_len += tb->insert_size[0];
147 vi->vi_new_data = vn->vn_data; // pointer to data which is going to be pasted
152 if (vn->vn_mode == M_INSERT) {
153 struct virtual_item *vi = vn->vn_vi + vn->vn_affected_item_num;
155 RFALSE(vn->vn_ins_ih == NULL,
158 vi->vi_ih = vn->vn_ins_ih;
159 vi->vi_item = vn->vn_data;
160 vi->vi_uarea = vn->vn_free_ptr;
162 op_create_vi(vn, vi, 0 /*not pasted or cut */ ,
172 && (vn->vn_mode != M_DELETE
173 || vn->vn_affected_item_num != B_NR_ITEMS(Sh) - 1))
174 vn->vn_vi[vn->vn_nr_item - 1].vi_type |=
179 !(vn->vn_mode != M_DELETE
180 || vn->vn_affected_item_num != B_NR_ITEMS(Sh) - 1)) {
191 key, vn->vn_affected_item_num,
192 vn->vn_mode, M_DELETE);
205 struct virtual_node *vn = tb->tb_vn;
219 if (!cur_free || !vn->vn_nr_item) {
229 vi = vn->vn_vi;
231 (vn->vn_size -
235 RFALSE(vn->vn_mode == M_INSERT || vn->vn_mode == M_PASTE,
238 tb->lnum[0] = vn->vn_nr_item;
250 for (i = 0; i < vn->vn_nr_item;
285 struct virtual_node *vn = tb->tb_vn;
299 if (!cur_free || !vn->vn_nr_item) {
309 vi = vn->vn_vi + vn->vn_nr_item - 1;
311 (vn->vn_size -
315 RFALSE(vn->vn_mode == M_INSERT || vn->vn_mode == M_PASTE,
318 tb->rnum[h] = vn->vn_nr_item;
330 for (i = vn->vn_nr_item - 1; i >= 0;
373 struct virtual_node *vn = tb->tb_vn;
424 end_item = vn->vn_nr_item - to - 1;
433 struct virtual_item *vi = vn->vn_vi + i;
531 op_unit_num(&vn->vn_vi[split_item_num]) - snum012[4] -
534 if (vn->vn_vi[split_item_num].vi_index != TYPE_DIRENTRY &&
535 vn->vn_vi[split_item_num].vi_index != TYPE_INDIRECT)
559 op_unit_num(&vn->vn_vi[split_item_num]) - snum012[3] -
613 struct virtual_node *vn = tb->tb_vn;
622 remain_items = vn->vn_nr_item;
629 set_parameters(tb, 0, to_left, vn->vn_nr_item - to_left, 0,
641 size = op_unit_num(&(vn->vn_vi[to_left]));
655 struct virtual_node *vn = tb->tb_vn;
662 if (vn->vn_nr_item) {
663 if (vn->vn_vi[0].vi_type & VI_TYPE_LEFT_MERGEABLE)
666 if (vn->vn_vi[vn->vn_nr_item - 1].
700 if (MAX_CHILD_SIZE(S0) + vn->vn_size <= rfree + lfree + ih_size) {
715 to_l = (MAX_NR_KEY(Sh)+1 - lpar + vn->vn_nr_item + 1) / 2 -\
735 to_r = (MAX_NR_KEY(Sh)+1 - rpar + vn->vn_nr_item + 1) / 2 - (MAX_NR_KEY(Sh) + 1 - rpar);\
1220 struct virtual_node *vn = tb->tb_vn;
1289 if (can_node_be_removed(vn->vn_mode, lfree, sfree, rfree, tb, h) ==
1312 if (h && (tb->rnum[h] + tb->lnum[h] >= vn->vn_nr_item + 1)) {
1323 vn->vn_nr_item + 1) / 2 - (MAX_NR_KEY(Sh) + 1 -
1325 set_parameters(tb, h, vn->vn_nr_item + 1 - to_r, to_r, 0, NULL,
1332 (tb->lnum[h] >= vn->vn_nr_item + 1 ||
1333 tb->rnum[h] >= vn->vn_nr_item + 1),
1335 RFALSE(!h && ((tb->lnum[h] >= vn->vn_nr_item && (tb->lbytes == -1)) ||
1336 (tb->rnum[h] >= vn->vn_nr_item && (tb->rbytes == -1))),
1350 tb->s0num = vn->vn_nr_item;
1386 nver = get_num_ver(vn->vn_mode, tb, h,
1387 0, -1, h ? vn->vn_nr_item : 0, -1,
1394 nver1 = get_num_ver(vn->vn_mode, tb, h,
1408 lnver = get_num_ver(vn->vn_mode, tb, h,
1410 -1, h ? vn->vn_nr_item : 0, -1,
1415 lnver1 = get_num_ver(vn->vn_mode, tb, h,
1431 rnver = get_num_ver(vn->vn_mode, tb, h,
1433 h ? (vn->vn_nr_item - rpar) : (rpar -
1442 rnver1 = get_num_ver(vn->vn_mode, tb, h,
1459 lrnver = get_num_ver(vn->vn_mode, tb, h,
1462 h ? (vn->vn_nr_item - rpar) : (rpar -
1471 lrnver1 = get_num_ver(vn->vn_mode, tb, h,
1563 struct virtual_node *vn = tb->tb_vn;
1582 if (vn->vn_nr_item > 0) {
1604 if (vn->vn_nr_item >= MIN_NR_KEY(Sh)) { /* Balance condition for the internal node is valid.
1606 if (vn->vn_nr_item == MIN_NR_KEY(Sh)) { /* Here we join S[h] with one of its neighbors,
1608 if (tb->lnum[h] >= vn->vn_nr_item + 1) {
1625 if (tb->rnum[h] >= vn->vn_nr_item + 1) {
1643 if (tb->rnum[h] + tb->lnum[h] >= vn->vn_nr_item + 1) {
1649 tb->rnum[h] + vn->vn_nr_item + 1) / 2 -
1651 set_parameters(tb, h, vn->vn_nr_item + 1 - to_r, to_r,
1663 if (tb->lnum[h] >= vn->vn_nr_item + 1)
1665 || tb->rnum[h] < vn->vn_nr_item + 1 || !tb->FR[h]) {
1681 if (tb->rnum[h] >= vn->vn_nr_item + 1) {
1696 if (tb->rnum[h] + tb->lnum[h] >= vn->vn_nr_item + 1) {
1701 vn->vn_nr_item + 1) / 2 - (MAX_NR_KEY(Sh) + 1 -
1703 set_parameters(tb, h, vn->vn_nr_item + 1 - to_r, to_r, 0, NULL,
1716 (MAX_NR_KEY(Sh) + 1 - tb->lnum[h] + vn->vn_nr_item +
1717 1) / 2 - (vn->vn_nr_item + 1);
1723 -((MAX_NR_KEY(Sh) + 1 - tb->rnum[h] + vn->vn_nr_item +
1724 1) / 2 - (vn->vn_nr_item + 1)), 1, NULL, -1, -1);
1743 struct virtual_node *vn = tb->tb_vn;
1794 if (tb->lnum[0] >= vn->vn_nr_item && tb->lbytes == -1)
1795 if (is_left_neighbor_in_cache(tb, h) || ((tb->rnum[0] - ((tb->rbytes == -1) ? 0 : 1)) < vn->vn_nr_item) || /* S can not be merged with R */
1807 if (tb->rnum[0] >= vn->vn_nr_item && tb->rbytes == -1) {
1817 tb->s0num = vn->vn_nr_item;
1871 struct virtual_node *vn;
1873 vn = tb->tb_vn = (struct virtual_node *)(tb->vn_buf);
1874 vn->vn_free_ptr = (char *)(tb->tb_vn + 1);
1875 vn->vn_mode = mode;
1876 vn->vn_affected_item_num = inum;
1877 vn->vn_pos_in_item = pos_in_item;
1878 vn->vn_ins_ih = ins_ih;
1879 vn->vn_data = data;
1881 RFALSE(mode == M_INSERT && !vn->vn_ins_ih,