} else if (IS_TNODE(n)) { 
} else { 
static void printnode_seq(struct seq_file *seq, int indent, struct node *n,		   int pend, int cindex, int bits){	putspace_seq(seq, indent);	if (IS_LEAF(n))		seq_printf(seq, "|");	else		seq_printf(seq, "+");	if (bits) {		seq_printf(seq, "%d/", cindex);		printbin_seq(seq, cindex, bits);		seq_printf(seq, ": ");	}	else		seq_printf(seq, "<root>: ");	seq_printf(seq, "%s:%p ", IS_LEAF(n)?"Leaf":"Internal node", n);	if (IS_LEAF(n))		seq_printf(seq, "key=%d.%d.%d.%d\n",			   n->key >> 24, (n->key >> 16) % 256, (n->key >> 8) % 256, n->key % 256);	else {		int plen = ((struct tnode *)n)->pos;		t_key prf=MASK_PFX(n->key, plen);		seq_printf(seq, "key=%d.%d.%d.%d/%d\n",			   prf >> 24, (prf >> 16) % 256, (prf >> 8) % 256, prf % 256, plen);	}	if (IS_LEAF(n)) {		struct leaf *l=(struct leaf *)n;		struct fib_alias *fa;		int i;		for (i=32; i>=0; i--)		  if (find_leaf_info(&l->list, i)) {						struct list_head *fa_head = get_fa_head(l, i);							if (!fa_head)					continue;				if (list_empty(fa_head))					continue;				putspace_seq(seq, indent+2);				seq_printf(seq, "{/%d...dumping}\n", i);				list_for_each_entry(fa, fa_head, fa_list) {					putspace_seq(seq, indent+2);					if (fa->fa_info->fib_nh == NULL) {						seq_printf(seq, "Error _fib_nh=NULL\n");						continue;					}					if (fa->fa_info == NULL) {						seq_printf(seq, "Error fa_info=NULL\n");						continue;					}					seq_printf(seq, "{type=%d scope=%d TOS=%d}\n",					      fa->fa_type,					      fa->fa_scope,					      fa->fa_tos);				}			}	}	else if (IS_TNODE(n)) {		struct tnode *tn = (struct tnode *)n;		putspace_seq(seq, indent); seq_printf(seq, "|    ");		seq_printf(seq, "{key prefix=%08x/", tn->key&TKEY_GET_MASK(0, tn->pos));		printbin_seq(seq, tkey_extract_bits(tn->key, 0, tn->pos), tn->pos);		seq_printf(seq, "}\n");		putspace_seq(seq, indent); seq_printf(seq, "|    ");		seq_printf(seq, "{pos=%d", tn->pos);		seq_printf(seq, " (skip=%d bits)", tn->pos - pend);		seq_printf(seq, " bits=%d (%u children)}\n", tn->bits, (1 << tn->bits));		putspace_seq(seq, indent); seq_printf(seq, "|    ");		seq_printf(seq, "{empty=%d full=%d}\n", tn->empty_children, tn->full_children);	}}
4520	/local/tlutelli/issta_data/temp/c/2005_temp/2005/4520/91b9a277fc4d207249e459a455abf804ebb5499d/fib_trie.c/buggy/net/ipv4/fib_trie.c