Lines Matching defs:cur
122 * Insert count node pointers into buffer cur before position to + 1.
123 * Insert count items into buffer cur before position to.
131 struct buffer_head *cur = cur_bi->bi_bh;
142 blkh = B_BLK_HEAD(cur);
146 RFALSE(B_FREE_SPACE(cur) < count * (KEY_SIZE + DC_SIZE),
148 B_FREE_SPACE(cur), count * (KEY_SIZE + DC_SIZE));
151 dc = B_N_CHILD(cur, to + 1);
164 ih = internal_key(cur, ((to == -1) ? 0 : to));
180 do_balance_mark_internal_dirty(cur_bi->tb, cur, 0);
183 check_internal(cur);
202 * Delete del_num items and node pointers from buffer cur starting from
209 struct buffer_head *cur = cur_bi->bi_bh;
215 RFALSE(cur == NULL, "buffer is 0");
218 RFALSE(first_p < 0 || first_p + del_num > B_NR_ITEMS(cur) + 1
223 B_NR_ITEMS(cur) + 1, first_i);
227 blkh = B_BLK_HEAD(cur);
237 RFALSE(first_i + del_num > B_NR_ITEMS(cur),
240 first_i, del_num, first_i + del_num, cur, cur);
243 dc = B_N_CHILD(cur, first_p);
246 key = internal_key(cur, first_i);
257 do_balance_mark_internal_dirty(cur_bi->tb, cur, 0);
259 check_internal(cur);