Lines Matching refs:parent

143 		      struct btree_node *parent,
150 	root = value64(parent, index);
162 	*((__le64 *) value_ptr(parent, index)) =
199 static void __rebalance2(struct dm_btree_info *info, struct btree_node *parent,
220 		delete_at(parent, r->index);
233 		*key_ptr(parent, r->index) = right->keys[0];
241 	struct btree_node *parent;
244 	parent = dm_block_data(shadow_current(s));
246 	r = init_child(info, vt, parent, left_index, &left);
250 	r = init_child(info, vt, parent, left_index + 1, &right);
256 	__rebalance2(info, parent, &left, &right);
269 static void delete_center_node(struct dm_btree_info *info, struct btree_node *parent,
288 	*key_ptr(parent, r->index) = right->keys[0];
290 	delete_at(parent, c->index);
294 	__rebalance2(info, parent, l, r);
300 static void redistribute3(struct dm_btree_info *info, struct btree_node *parent,
343 	*key_ptr(parent, c->index) = center->keys[0];
344 	*key_ptr(parent, r->index) = right->keys[0];
347 static void __rebalance3(struct dm_btree_info *info, struct btree_node *parent,
364 		delete_center_node(info, parent, l, c, r, left, center, right,
367 		redistribute3(info, parent, l, c, r, left, center, right,
375 	struct btree_node *parent = dm_block_data(shadow_current(s));
381 	r = init_child(info, vt, parent, left_index, &left);
385 	r = init_child(info, vt, parent, left_index + 1, &center);
391 	r = init_child(info, vt, parent, left_index + 2, &right);
398 	__rebalance3(info, parent, &left, &center, &right);
482 		 * We have to patch up the parent node, ugly, but I don't
575 		 * We have to patch up the parent node, ugly, but I don't