md/persistent-data/dm-btree.c

177 	struct frame spine[MAX_SPINE_DEPTH];
187 	*f = s->spine + s->top;
234 		struct frame *f = s->spine + ++s->top;
257 	struct frame *f = s->spine + s->top--;
268 		f = s->spine + s->top--;
381 	struct ro_spine spine;
383 	init_ro_spine(&spine, info);
397 		r = btree_lookup_raw(&spine, root, keys[level],
403 				exit_ro_spine(&spine);
407 			exit_ro_spine(&spine);
413 	exit_ro_spine(&spine);
476 	struct ro_spine spine;
478 	init_ro_spine(&spine, info);
480 		r = btree_lookup_raw(&spine, root, keys[level],
496 	exit_ro_spine(&spine);
690 	/* patch up the spine */
797 	/* patch up the spine */
1075  * node on the spine when doing an insert.  But we can avoid that with
1108 		 * see a way to do this automatically as part of the spine
1172 		 * see a way to do this automatically as part of the spine
1207 	struct shadow_spine spine;
1210 	init_shadow_spine(&spine, info);
1211 	r = __btree_get_overwrite_leaf(&spine, root, key, index);
1213 		*new_root = shadow_root(&spine);
1214 		*leaf = shadow_current(&spine);
1220 		spine.count--;
1222 	exit_shadow_spine(&spine);
1242 	struct shadow_spine spine;
1247 	init_shadow_spine(&spine, info);
1250 		r = btree_insert_raw(&spine, block, &le64_type, keys[level], &index);
1254 		n = dm_block_data(shadow_current(&spine));
1277 	r = btree_insert_raw(&spine, block, &info->value_type,
1282 	n = dm_block_data(shadow_current(&spine));
1309 	*new_root = shadow_root(&spine);
1310 	exit_shadow_spine(&spine);
1317 	exit_shadow_spine(&spine);
1381 	struct ro_spine spine;
1383 	init_ro_spine(&spine, info);
1385 		r = find_key(&spine, root, find_highest, result_keys + level,
1396 	exit_ro_spine(&spine);