Lines Matching refs:item_pos
75 int item_pos = PATH_LAST_POSITION(tb->tb_path);
88 ih = B_N_PITEM_HEAD(tbS0, item_pos);
103 leaf_delete_items(&bi, 0, item_pos, 1, -1);
105 if (!item_pos && tb->CFL[0]) {
117 RFALSE(!item_pos && !tb->CFL[0],
133 leaf_cut_from_buffer(&bi, item_pos, pos_in_item,
136 RFALSE(!item_pos && !pos_in_item && !tb->CFL[0],
140 if (!item_pos && !pos_in_item && tb->CFL[0]) {
145 leaf_cut_from_buffer(&bi, item_pos, pos_in_item,
261 int item_pos = PATH_LAST_POSITION(tb->tb_path); /* index into the array of item headers in S[0]
293 && is_indirect_le_ih(B_N_PITEM_HEAD(tbS0, item_pos)))
298 if (item_pos < tb->lnum[0]) {
305 if (item_pos == tb->lnum[0] - 1
334 n + item_pos -
378 n + item_pos -
388 if (item_pos == tb->lnum[0] - 1
392 (B_N_PITEM_HEAD(tbS0, item_pos))) {
415 && !item_pos) {
441 n + item_pos -
455 item_pos
491 (tbS0, item_pos)),
495 (tbS0, item_pos)),
525 item_pos)));
536 n + item_pos -
541 n + item_pos -
566 item_pos
570 if (is_indirect_le_ih(B_N_PITEM_HEAD(tb->L[0], n + item_pos - ret_val))) {
665 if (!item_pos && op_is_left_mergeable(B_N_PKEY(tbS0, 0), tbS0->b_size)) { /* if we paste into first item of S[0] and it is left mergable */
690 n + item_pos -
699 n + item_pos -
704 item_pos -
743 item_pos -= (tb->lnum[0] - ((tb->lbytes != -1) ? 1 : 0));
751 if (n - tb->rnum[0] < item_pos) { /* new item or its part falls to R[0] */
752 if (item_pos == n - tb->rnum[0] + 1 && tb->rbytes != -1) { /* part of new item falls into R[0] */
826 item_pos - n +
831 if (item_pos - n + tb->rnum[0] - 1 == 0) {
847 if (n - tb->rnum[0] <= item_pos) { /* pasted item or part of it falls to R[0] */
848 if (item_pos == n - tb->rnum[0] && tb->rbytes != -1) { /* we must shift the part of the appended item */
849 if (is_direntry_le_ih(B_N_PITEM_HEAD(tbS0, item_pos))) { /* we append to directory item */
857 item_pos));
956 (tbS0, item_pos)),
961 (tbS0, item_pos)));
1077 item_pos -
1091 item_pos - n +
1096 item_pos -
1112 RFALSE(item_pos - n +
1201 if (n - snum[i] < item_pos) { /* new item or it's part falls to first new node S_new[i] */
1202 if (item_pos == n - snum[i] + 1 && sbytes[i] != -1) { /* part of new item falls into S_new[i] */
1271 item_pos - n +
1288 if (n - snum[i] <= item_pos) { /* pasted item or part if it falls to S_new[i] */
1289 if (item_pos == n - snum[i] && sbytes[i] != -1) { /* we must shift part of the appended item */
1296 B_N_PITEM_HEAD(tbS0, item_pos))) {
1377 (tbS0, item_pos))
1468 B_N_PITEM_HEAD(tbS0, item_pos);
1493 item_pos - n +
1501 item_pos - n +
1505 item_pos -
1554 if (0 <= item_pos && item_pos < tb->s0num) { /* if we must insert or append into buffer S[0] */
1562 leaf_insert_into_buf(&bi, item_pos, ih, body,
1566 if (item_pos == 0) {
1577 pasted = B_N_PITEM_HEAD(tbS0, item_pos);
1597 item_pos,
1606 item_pos,
1618 if (!item_pos && !pos_in_item) {
1652 item_pos,