3 struct btree_head128 { struct btree_head h; };  member
8 	btree_init_mempool(&head->h, mempool);  in btree_init_mempool128()
13 	return btree_init(&head->h);  in btree_init128()
18 	btree_destroy(&head->h);  in btree_destroy128()
24 	return btree_lookup(&head->h, &btree_geo128, (unsigned long *)&key);  in btree_lookup128()
33 	val = btree_get_prev(&head->h, &btree_geo128,  in btree_get_prev128()
44 	return btree_insert(&head->h, &btree_geo128,  in btree_insert128()
52 	return btree_update(&head->h, &btree_geo128,  in btree_update128()
59 	return btree_remove(&head->h, &btree_geo128, (unsigned long *)&key);  in btree_remove128()
67 	val = btree_last(&head->h, &btree_geo128, (unsigned long *)&key[0]);  in btree_last128()
80 	return btree_merge(&target->h, &victim->h, &btree_geo128, gfp);  in btree_merge128()
93 	return btree_visitor(&head->h, &btree_geo128, opaque,  in btree_visitor128()
101 	return btree_grim_visitor(&head->h, &btree_geo128, opaque,  in btree_grim_visitor128()