height = root->height; if (index > radix_tree_maxindex(height)) return NULL;  shift = (height-1) * RADIX_TREE_MAP_SHIFT; slot = root->rnode;  while (height > 0) { if (slot == NULL) return NULL;  slot = slot->slots[(index >> shift) & RADIX_TREE_MAP_MASK]; shift -= RADIX_TREE_MAP_SHIFT; height--; }  return slot; 
slot = __lookup_slot(root, index); return slot != NULL ? *slot : NULL; 
void *radix_tree_lookup(struct radix_tree_root *root, unsigned long index){	unsigned int height, shift;	struct radix_tree_node *slot;	height = root->height;	if (index > radix_tree_maxindex(height))		return NULL;	shift = (height-1) * RADIX_TREE_MAP_SHIFT;	slot = root->rnode;	while (height > 0) {		if (slot == NULL)			return NULL;		slot = slot->slots[(index >> shift) & RADIX_TREE_MAP_MASK];		shift -= RADIX_TREE_MAP_SHIFT;		height--;	}	return slot;}
4520	/local/tlutelli/issta_data/temp/c/2005_temp/2005/4520/a43313668f62a06e14c915b8c8994fc8a1257394/radix-tree.c/buggy/lib/radix-tree.c