218 		struct ubi_ltree_entry *le;  in ltree_lookup()  local
220 		le = rb_entry(p, struct ubi_ltree_entry, rb);  in ltree_lookup()
222 		if (vol_id < le->vol_id)  in ltree_lookup()
224 		else if (vol_id > le->vol_id)  in ltree_lookup()
227 			if (lnum < le->lnum)  in ltree_lookup()
229 			else if (lnum > le->lnum)  in ltree_lookup()
232 				return le;  in ltree_lookup()
253 	struct ubi_ltree_entry *le, *le1, *le_free;  in ltree_add_entry()  local
255 	le = kmalloc(sizeof(struct ubi_ltree_entry), GFP_NOFS);  in ltree_add_entry()
256 	if (!le)  in ltree_add_entry()
259 	le->users = 0;  in ltree_add_entry()
260 	init_rwsem(&le->mutex);  in ltree_add_entry()
261 	le->vol_id = vol_id;  in ltree_add_entry()
262 	le->lnum = lnum;  in ltree_add_entry()
272 		le_free = le;  in ltree_add_entry()
273 		le = le1;  in ltree_add_entry()
301 		rb_link_node(&le->rb, parent, p);  in ltree_add_entry()
302 		rb_insert_color(&le->rb, &ubi->ltree);  in ltree_add_entry()
304 	le->users += 1;  in ltree_add_entry()
308 	return le;  in ltree_add_entry()
322 	struct ubi_ltree_entry *le;  in leb_read_lock()  local
324 	le = ltree_add_entry(ubi, vol_id, lnum);  in leb_read_lock()
325 	if (IS_ERR(le))  in leb_read_lock()
326 		return PTR_ERR(le);  in leb_read_lock()
327 	down_read(&le->mutex);  in leb_read_lock()
339 	struct ubi_ltree_entry *le;  in leb_read_unlock()  local
342 	le = ltree_lookup(ubi, vol_id, lnum);  in leb_read_unlock()
343 	le->users -= 1;  in leb_read_unlock()
344 	ubi_assert(le->users >= 0);  in leb_read_unlock()
345 	up_read(&le->mutex);  in leb_read_unlock()
346 	if (le->users == 0) {  in leb_read_unlock()
347 		rb_erase(&le->rb, &ubi->ltree);  in leb_read_unlock()
348 		kfree(le);  in leb_read_unlock()
364 	struct ubi_ltree_entry *le;  in leb_write_lock()  local
366 	le = ltree_add_entry(ubi, vol_id, lnum);  in leb_write_lock()
367 	if (IS_ERR(le))  in leb_write_lock()
368 		return PTR_ERR(le);  in leb_write_lock()
369 	down_write(&le->mutex);  in leb_write_lock()
386 	struct ubi_ltree_entry *le;  in leb_write_trylock()  local
388 	le = ltree_add_entry(ubi, vol_id, lnum);  in leb_write_trylock()
389 	if (IS_ERR(le))  in leb_write_trylock()
390 		return PTR_ERR(le);  in leb_write_trylock()
391 	if (down_write_trylock(&le->mutex))  in leb_write_trylock()
396 	le->users -= 1;  in leb_write_trylock()
397 	ubi_assert(le->users >= 0);  in leb_write_trylock()
398 	if (le->users == 0) {  in leb_write_trylock()
399 		rb_erase(&le->rb, &ubi->ltree);  in leb_write_trylock()
400 		kfree(le);  in leb_write_trylock()
415 	struct ubi_ltree_entry *le;  in leb_write_unlock()  local
418 	le = ltree_lookup(ubi, vol_id, lnum);  in leb_write_unlock()
419 	le->users -= 1;  in leb_write_unlock()
420 	ubi_assert(le->users >= 0);  in leb_write_unlock()
421 	up_write(&le->mutex);  in leb_write_unlock()
422 	if (le->users == 0) {  in leb_write_unlock()
423 		rb_erase(&le->rb, &ubi->ltree);  in leb_write_unlock()
424 		kfree(le);  in leb_write_unlock()