JFFS2_DBG_FRAGTREE2("root %p, offset %d\n", fragtree, offset); 
dbg_fragtree2("root %p, offset %d\n", fragtree, offset); 
struct jffs2_node_frag *jffs2_lookup_node_frag(struct rb_root *fragtree, uint32_t offset){	/* The common case in lookup is that there will be a node 	   which precisely matches. So we go looking for that first */	struct rb_node *next;	struct jffs2_node_frag *prev = NULL;	struct jffs2_node_frag *frag = NULL;	JFFS2_DBG_FRAGTREE2("root %p, offset %d\n", fragtree, offset);	next = fragtree->rb_node;	while(next) {		frag = rb_entry(next, struct jffs2_node_frag, rb);		if (frag->ofs + frag->size <= offset) {			/* Remember the closest smaller match on the way down */			if (!prev || frag->ofs > prev->ofs)				prev = frag;			next = frag->rb.rb_right;		} else if (frag->ofs > offset) {			next = frag->rb.rb_left;		} else {			return frag;		}	}	/* Exact match not found. Go back up looking at each parent,	   and return the closest smaller one */	if (prev)		JFFS2_DBG_FRAGTREE2("no match. Returning frag %#04x-%#04x, closest previous\n",			  prev->ofs, prev->ofs+prev->size);	else 		JFFS2_DBG_FRAGTREE2("returning NULL, empty fragtree\n");		return prev;}
10457	/local/tlutelli/issta_data/temp/c/2005_temp/2005/10457/733802d974e5af42acb7cd61b16c0ce6dd03b7ed/nodelist.c/clean/fs/jffs2/nodelist.c