trie_bug("tnode_put_child_reorg bits"); 
BUG(); 
static void tnode_put_child_reorg(struct tnode *tn, int i, struct node *n, int wasfull){	struct node *chi;	int isfull;	if (i >= 1<<tn->bits) {		printk("bits=%d, i=%d\n", tn->bits, i);		trie_bug("tnode_put_child_reorg bits");	}	write_lock_bh(&fib_lock);	chi = tn->child[i];	/* update emptyChildren */	if (n == NULL && chi != NULL)		tn->empty_children++;	else if (n != NULL && chi == NULL)		tn->empty_children--;	/* update fullChildren */        if (wasfull == -1)		wasfull = tnode_full(tn, chi);	isfull = tnode_full(tn, n);	if (wasfull && !isfull)		tn->full_children--;	else if (!wasfull && isfull)		tn->full_children++;	if (n)		NODE_SET_PARENT(n, tn);	tn->child[i] = n;	write_unlock_bh(&fib_lock);}
4520	/local/tlutelli/issta_data/temp/c/2005_temp/2005/4520/91b9a277fc4d207249e459a455abf804ebb5499d/fib_trie.c/buggy/net/ipv4/fib_trie.c