write_lock_bh(&fib_lock); chi = tn->child[i]; 
static void tnode_put_child_reorg(struct tnode *tn, int i, struct node *n, int wasfull){	struct node *chi;	int isfull;	BUG_ON(i >= 1<<tn->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);}
10457	/local/tlutelli/issta_data/temp/c/2005_temp/2005/10457/2373ce1ca04dd46bf2b8b0f9a799eb2a90da92fb/fib_trie.c/buggy/net/ipv4/fib_trie.c