Lines Matching refs:item_head
83 struct item_head *ih = item_head(tbS0, item_pos);
113 struct item_head *ih = item_head(tbS0, item_pos);
287 struct item_head *const ih,
352 struct item_head * const ih,
364 struct item_head *pasted;
373 pasted = item_head(tb->L[0], B_NR_ITEMS(tb->L[0]) - 1);
414 struct item_head * const ih,
422 if (is_direntry_le_ih(item_head(tbS0, tb->item_pos))) {
430 RFALSE(tb->pos_in_item != ih_item_len(item_head(tbS0, tb->item_pos)),
433 ih_item_len(item_head(tbS0, tb->item_pos)), tb->pos_in_item);
437 struct item_head *tbS0_pos_ih, *tbL0_ih;
438 struct item_head *tbS0_0_ih;
442 tbS0_pos_ih = item_head(tbS0, tb->item_pos);
443 tbS0_0_ih = item_head(tbS0, 0);
461 tbL0_ih = item_head(tb->L[0], n + tb->item_pos - ret);
533 struct item_head * const ih,
539 struct item_head *pasted;
549 pasted = item_head(tb->L[0], n - 1);
568 pasted = item_head(tb->L[0], n + tb->item_pos - ret);
587 struct item_head * const ih,
600 struct item_head * const ih,
622 struct item_head * const ih,
708 struct item_head * const ih,
717 entry_count = ih_entry_count(item_head(tbS0, tb->item_pos));
759 struct item_head * const ih,
769 if (is_direntry_le_ih(item_head(tbS0, tb->item_pos))) {
784 RFALSE(tb->pos_in_item != ih_item_len(item_head(tbS0, tb->item_pos)),
787 ih_item_len(item_head(tbS0, tb->item_pos)));
801 version = ih_version(item_head(tb->R[0], 0));
828 if (is_indirect_le_ih(item_head(tb->R[0], 0)))
829 set_ih_free_space(item_head(tb->R[0], 0), 0);
837 struct item_head * const ih,
842 struct item_head *pasted;
857 pasted = item_head(tb->R[0], tb->item_pos - n + tb->rnum[0]);
881 struct item_head * const ih,
905 struct item_head * const ih,
920 struct item_head * const ih,
922 struct item_head *insert_key,
1010 struct item_head * const ih,
1012 struct item_head *insert_key,
1017 struct item_head *aux_ih = item_head(tbS0, tb->item_pos);
1065 struct item_head * const ih,
1067 struct item_head *insert_key,
1072 struct item_head *aux_ih = item_head(tbS0, tb->item_pos);
1075 struct item_head *tmp;
1089 RFALSE(tb->pos_in_item != ih_item_len(item_head(tbS0, tb->item_pos)) ||
1124 tmp = item_head(tb->S_new[i], 0);
1138 struct item_head * const ih,
1140 struct item_head *insert_key,
1148 struct item_head *pasted;
1152 struct item_head *ih_check = item_head(tbS0, tb->item_pos);
1175 pasted = item_head(tb->S_new[i], tb->item_pos - n +
1191 struct item_head * const ih,
1193 struct item_head *insert_key,
1221 struct item_head * const ih,
1223 struct item_head *insert_key,
1261 struct item_head * const ih,
1278 struct item_head * const ih,
1282 struct item_head *pasted = item_head(tbS0, tb->item_pos);
1312 struct item_head * const ih,
1317 struct item_head *pasted = item_head(tbS0, tb->item_pos);
1356 struct item_head * const ih,
1382 static int balance_leaf(struct tree_balance *tb, struct item_head *ih,
1384 struct item_head *insert_key,
1406 && is_indirect_le_ih(item_head(tbS0, tb->item_pos)))
1570 memcpy(internal_key(dest, n_dest), item_head(src, n_src),
1847 void do_balance(struct tree_balance *tb, struct item_head *ih,
1859 struct item_head insert_key[2];