Lines Matching defs:item_pos
104 int item_pos = PATH_LAST_POSITION(tb->tb_path);
117 ih = B_N_PITEM_HEAD(tbS0, item_pos);
129 leaf_delete_items(&bi, 0, item_pos, 1, -1);
131 if (!item_pos && tb->CFL[0]) {
143 RFALSE(!item_pos && !tb->CFL[0],
155 leaf_cut_from_buffer(&bi, item_pos, pos_in_item,
158 RFALSE(!item_pos && !pos_in_item && !tb->CFL[0],
162 if (!item_pos && !pos_in_item && tb->CFL[0]) {
167 leaf_cut_from_buffer(&bi, item_pos, pos_in_item,
283 int item_pos = PATH_LAST_POSITION(tb->tb_path); /* index into the array of item headers in S[0]
315 && is_indirect_le_ih(B_N_PITEM_HEAD(tbS0, item_pos)))
320 if (item_pos < tb->lnum[0]) {
327 if (item_pos == tb->lnum[0] - 1
352 n + item_pos -
392 n + item_pos -
402 if (item_pos == tb->lnum[0] - 1
406 (B_N_PITEM_HEAD(tbS0, item_pos))) {
429 && !item_pos) {
449 n + item_pos -
462 item_pos
498 (tbS0, item_pos)),
502 (tbS0, item_pos)),
532 item_pos)));
537 n + item_pos -
542 n + item_pos -
567 item_pos
571 if (is_indirect_le_ih(B_N_PITEM_HEAD(tb->L[0], n + item_pos - ret_val))) {
666 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 */
687 n + item_pos -
696 n + item_pos -
701 item_pos -
741 item_pos -= (tb->lnum[0] - ((tb->lbytes != -1) ? 1 : 0));
749 if (n - tb->rnum[0] < item_pos) { /* new item or its part falls to R[0] */
750 if (item_pos == n - tb->rnum[0] + 1 && tb->rbytes != -1) { /* part of new item falls into R[0] */
816 item_pos - n +
821 if (item_pos - n + tb->rnum[0] - 1 == 0) {
837 if (n - tb->rnum[0] <= item_pos) { /* pasted item or part of it falls to R[0] */
838 if (item_pos == n - tb->rnum[0] && tb->rbytes != -1) { /* we must shift the part of the appended item */
839 if (is_direntry_le_ih(B_N_PITEM_HEAD(tbS0, item_pos))) { /* we append to directory item */
847 item_pos));
939 (tbS0, item_pos)),
944 (tbS0, item_pos)));
1050 item_pos -
1064 item_pos - n +
1069 item_pos -
1085 RFALSE(item_pos - n +
1174 if (n - snum[i] < item_pos) { /* new item or it's part falls to first new node S_new[i] */
1175 if (item_pos == n - snum[i] + 1 && sbytes[i] != -1) { /* part of new item falls into S_new[i] */
1238 item_pos - n +
1255 if (n - snum[i] <= item_pos) { /* pasted item or part if it falls to S_new[i] */
1256 if (item_pos == n - snum[i] && sbytes[i] != -1) { /* we must shift part of the appended item */
1261 aux_ih = B_N_PITEM_HEAD(tbS0, item_pos);
1339 (tbS0, item_pos))
1426 B_N_PITEM_HEAD(tbS0, item_pos);
1451 item_pos - n +
1459 item_pos - n +
1463 item_pos -
1512 if (0 <= item_pos && item_pos < tb->s0num) { /* if we must insert or append into buffer S[0] */
1517 leaf_insert_into_buf(&bi, item_pos, ih, body,
1521 if (item_pos == 0) {
1532 pasted = B_N_PITEM_HEAD(tbS0, item_pos);
1545 item_pos,
1554 item_pos,
1566 if (!item_pos && !pos_in_item) {
1593 item_pos,