223 	struct jffs2_tmp_dnode_info *this, *ptn;  in jffs2_add_tn_to_tree()  local
250 	this = jffs2_lookup_tn(&rii->tn_root, tn->fn->ofs);  in jffs2_add_tn_to_tree()
251 	if (this) {  in jffs2_add_tn_to_tree()
254 		while (this->overlapped) {  in jffs2_add_tn_to_tree()
255 			ptn = tn_prev(this);  in jffs2_add_tn_to_tree()
261 				this->overlapped = 0;  in jffs2_add_tn_to_tree()
264 			this = ptn;  in jffs2_add_tn_to_tree()
266 …dbg_readinode("'this' found %#04x-%#04x (%s)\n", this->fn->ofs, this->fn->ofs + this->fn->size, th…  in jffs2_add_tn_to_tree()
269 	while (this) {  in jffs2_add_tn_to_tree()
270 		if (this->fn->ofs > fn_end)  in jffs2_add_tn_to_tree()
273 			      this->version, this->fn->ofs, this->fn->size);  in jffs2_add_tn_to_tree()
275 		if (this->version == tn->version) {  in jffs2_add_tn_to_tree()
278 			if (!check_tn_node(c, this)) {  in jffs2_add_tn_to_tree()
286 				rb_replace_node(&this->rb, &tn->rb, &rii->tn_root);  in jffs2_add_tn_to_tree()
287 				jffs2_kill_tn(c, this);  in jffs2_add_tn_to_tree()
292 		if (this->version < tn->version &&  in jffs2_add_tn_to_tree()
293 		    this->fn->ofs >= tn->fn->ofs &&  in jffs2_add_tn_to_tree()
294 		    this->fn->ofs + this->fn->size <= fn_end) {  in jffs2_add_tn_to_tree()
302 			while (this && this->fn->ofs + this->fn->size <= fn_end) {  in jffs2_add_tn_to_tree()
303 				struct jffs2_tmp_dnode_info *next = tn_next(this);  in jffs2_add_tn_to_tree()
304 				if (this->version < tn->version) {  in jffs2_add_tn_to_tree()
305 					tn_erase(this, &rii->tn_root);  in jffs2_add_tn_to_tree()
307 						      this->version, this->fn->ofs,  in jffs2_add_tn_to_tree()
308 						      this->fn->ofs+this->fn->size);  in jffs2_add_tn_to_tree()
309 					jffs2_kill_tn(c, this);  in jffs2_add_tn_to_tree()
311 				this = next;  in jffs2_add_tn_to_tree()
316 		if (this->version > tn->version &&  in jffs2_add_tn_to_tree()
317 		    this->fn->ofs <= tn->fn->ofs &&  in jffs2_add_tn_to_tree()
318 		    this->fn->ofs+this->fn->size >= fn_end) {  in jffs2_add_tn_to_tree()
320 			if (!check_tn_node(c, this)) {  in jffs2_add_tn_to_tree()
327 			tn_erase(this, &rii->tn_root);  in jffs2_add_tn_to_tree()
328 			jffs2_kill_tn(c, this);  in jffs2_add_tn_to_tree()
332 		this = tn_next(this);  in jffs2_add_tn_to_tree()
358 	this = tn_prev(tn);  in jffs2_add_tn_to_tree()
359 	if (this) {  in jffs2_add_tn_to_tree()
361 			if (this->fn->ofs + this->fn->size > tn->fn->ofs) {  in jffs2_add_tn_to_tree()
363 					      this, this->version, this->fn->ofs,  in jffs2_add_tn_to_tree()
364 					      this->fn->ofs+this->fn->size);  in jffs2_add_tn_to_tree()
368 			if (!this->overlapped)  in jffs2_add_tn_to_tree()
371 			ptn = tn_prev(this);  in jffs2_add_tn_to_tree()
377 				this->overlapped = 0;  in jffs2_add_tn_to_tree()
380 			this = ptn;  in jffs2_add_tn_to_tree()
385 	this = tn_next(tn);  in jffs2_add_tn_to_tree()
386 	while (this && this->fn->ofs < fn_end) {  in jffs2_add_tn_to_tree()
387 		this->overlapped = 1;  in jffs2_add_tn_to_tree()
389 			      this->version, this->fn->ofs,  in jffs2_add_tn_to_tree()
390 			      this->fn->ofs+this->fn->size);  in jffs2_add_tn_to_tree()
391 		this = tn_next(this);  in jffs2_add_tn_to_tree()
455 	struct jffs2_tmp_dnode_info *pen, *last, *this;  in jffs2_build_inode_fragtree()  local
465 	this = tn_last(&rii->tn_root);  in jffs2_build_inode_fragtree()
466 	while (this) {  in jffs2_build_inode_fragtree()
467 		dbg_readinode("tn %p ver %d range 0x%x-0x%x ov %d\n", this, this->version, this->fn->ofs,  in jffs2_build_inode_fragtree()
468 			      this->fn->ofs+this->fn->size, this->overlapped);  in jffs2_build_inode_fragtree()
469 		this = tn_prev(this);  in jffs2_build_inode_fragtree()
493 		this = tn_last(&ver_root);  in jffs2_build_inode_fragtree()
495 		while (this) {  in jffs2_build_inode_fragtree()
498 			vers_next = tn_prev(this);  in jffs2_build_inode_fragtree()
499 			eat_last(&ver_root, &this->rb);  in jffs2_build_inode_fragtree()
500 			if (check_tn_node(c, this)) {  in jffs2_build_inode_fragtree()
502 					     this->version, this->fn->ofs,  in jffs2_build_inode_fragtree()
503 					     this->fn->ofs+this->fn->size);  in jffs2_build_inode_fragtree()
504 				jffs2_kill_tn(c, this);  in jffs2_build_inode_fragtree()
506 				if (this->version > high_ver) {  in jffs2_build_inode_fragtree()
511 					high_ver = this->version;  in jffs2_build_inode_fragtree()
512 					rii->latest_ref = this->fn->raw;  in jffs2_build_inode_fragtree()
515 					     this, this->version, this->fn->ofs,  in jffs2_build_inode_fragtree()
516 					     this->fn->ofs+this->fn->size, this->overlapped);  in jffs2_build_inode_fragtree()
518 				ret = jffs2_add_full_dnode_to_inode(c, f, this->fn);  in jffs2_build_inode_fragtree()
524 						vers_next = tn_prev(this);  in jffs2_build_inode_fragtree()
525 						if (check_tn_node(c, this))  in jffs2_build_inode_fragtree()
526 							jffs2_mark_node_obsolete(c, this->fn->raw);  in jffs2_build_inode_fragtree()
527 						jffs2_free_full_dnode(this->fn);  in jffs2_build_inode_fragtree()
528 						jffs2_free_tmp_dnode_info(this);  in jffs2_build_inode_fragtree()
529 						this = vers_next;  in jffs2_build_inode_fragtree()
530 						if (!this)  in jffs2_build_inode_fragtree()
536 				jffs2_free_tmp_dnode_info(this);  in jffs2_build_inode_fragtree()
538 			this = vers_next;  in jffs2_build_inode_fragtree()