Home
last modified time | relevance | path

Searched refs:le1 (Results 1 - 2 of 2) sorted by relevance

/kernel/linux/linux-5.10/drivers/mtd/ubi/
H A Deba.c253 struct ubi_ltree_entry *le, *le1, *le_free; in ltree_add_entry() local
265 le1 = ltree_lookup(ubi, vol_id, lnum); in ltree_add_entry()
267 if (le1) { in ltree_add_entry()
273 le = le1; in ltree_add_entry()
286 le1 = rb_entry(parent, struct ubi_ltree_entry, rb); in ltree_add_entry()
288 if (vol_id < le1->vol_id) in ltree_add_entry()
290 else if (vol_id > le1->vol_id) in ltree_add_entry()
293 ubi_assert(lnum != le1->lnum); in ltree_add_entry()
294 if (lnum < le1->lnum) in ltree_add_entry()
/kernel/linux/linux-6.6/drivers/mtd/ubi/
H A Deba.c252 struct ubi_ltree_entry *le, *le1, *le_free; in ltree_add_entry() local
264 le1 = ltree_lookup(ubi, vol_id, lnum); in ltree_add_entry()
266 if (le1) { in ltree_add_entry()
272 le = le1; in ltree_add_entry()
285 le1 = rb_entry(parent, struct ubi_ltree_entry, rb); in ltree_add_entry()
287 if (vol_id < le1->vol_id) in ltree_add_entry()
289 else if (vol_id > le1->vol_id) in ltree_add_entry()
292 ubi_assert(lnum != le1->lnum); in ltree_add_entry()
293 if (lnum < le1->lnum) in ltree_add_entry()

Completed in 5 milliseconds