n = t->trie; 
n = rcu_dereference(t->trie); 
fib_find_node(struct trie *t, u32 key){	int pos;	struct tnode *tn;	struct node *n;	pos = 0;	n = t->trie;	while (n != NULL &&  NODE_TYPE(n) == T_TNODE) {		tn = (struct tnode *) n;		check_tnode(tn);		if (tkey_sub_equals(tn->key, pos, tn->pos-pos, key)) {			pos = tn->pos + tn->bits;			n = tnode_get_child(tn, tkey_extract_bits(key, tn->pos, tn->bits));		} else			break;	}	/* Case we have found a leaf. Compare prefixes */	if (n != NULL && IS_LEAF(n) && tkey_equals(key, n->key))		return (struct leaf *)n;	return NULL;}
10457	/local/tlutelli/issta_data/temp/c/2005_temp/2005/10457/2373ce1ca04dd46bf2b8b0f9a799eb2a90da92fb/fib_trie.c/buggy/net/ipv4/fib_trie.c