Searched refs:bud (Results 1 – 6 of 6) sorted by relevance
| /linux-4.19.296/fs/ubifs/ |
| D | log.c | 45 struct ubifs_bud *bud; in ubifs_search_bud() local
50 bud = rb_entry(p, struct ubifs_bud, rb); in ubifs_search_bud()
51 if (lnum < bud->lnum) in ubifs_search_bud()
53 else if (lnum > bud->lnum) in ubifs_search_bud()
57 return bud; in ubifs_search_bud()
74 struct ubifs_bud *bud; in ubifs_get_wbuf() local
83 bud = rb_entry(p, struct ubifs_bud, rb); in ubifs_get_wbuf()
84 if (lnum < bud->lnum) in ubifs_get_wbuf()
86 else if (lnum > bud->lnum) in ubifs_get_wbuf()
89 jhead = bud->jhead; in ubifs_get_wbuf()
[all …]
|
| D | replay.c | 82 struct ubifs_bud *bud; member
104 lp = ubifs_lpt_lookup_dirty(c, b->bud->lnum); in set_bud_lprops()
111 if (b->bud->start == 0 && (lp->free != c->leb_size || lp->dirty != 0)) { in set_bud_lprops()
131 dbg_mnt("bud LEB %d was GC'd (%d free, %d dirty)", b->bud->lnum, in set_bud_lprops()
133 dbg_gc("bud LEB %d was GC'd (%d free, %d dirty)", b->bud->lnum, in set_bud_lprops()
145 b->bud->lnum, lp->free, lp->dirty, b->free, in set_bud_lprops()
156 err = ubifs_wbuf_seek_nolock(&c->jheads[b->bud->jhead].wbuf, in set_bud_lprops()
157 b->bud->lnum, c->leb_size - b->free); in set_bud_lprops()
520 static int is_last_bud(struct ubifs_info *c, struct ubifs_bud *bud) in is_last_bud() argument
522 struct ubifs_jhead *jh = &c->jheads[bud->jhead]; in is_last_bud()
[all …]
|
| D | debug.c | 585 struct ubifs_bud *bud; in ubifs_dump_budg() local
627 bud = rb_entry(rb, struct ubifs_bud, rb); in ubifs_dump_budg()
628 pr_err("\tbud LEB %d\n", bud->lnum); in ubifs_dump_budg()
630 list_for_each_entry(bud, &c->old_buds, list) in ubifs_dump_budg()
631 pr_err("\told bud LEB %d\n", bud->lnum); in ubifs_dump_budg()
653 struct ubifs_bud *bud; in ubifs_dump_lprop() local
715 bud = rb_entry(rb, struct ubifs_bud, rb); in ubifs_dump_lprop()
716 if (bud->lnum == lp->lnum) { in ubifs_dump_lprop()
732 dbg_jhead(bud->jhead)); in ubifs_dump_lprop()
|
| D | super.c | 881 struct ubifs_bud *bud, *n; in free_buds() local
883 rbtree_postorder_for_each_entry_safe(bud, n, &c->buds, rb) in free_buds()
884 kfree(bud); in free_buds()
1113 struct ubifs_bud *bud; in destroy_journal() local
1115 bud = list_entry(c->old_buds.next, struct ubifs_bud, list); in destroy_journal()
1116 list_del(&bud->list); in destroy_journal()
1117 kfree(bud); in destroy_journal()
|
| D | ubifs.h | 1520 void ubifs_add_bud(struct ubifs_info *c, struct ubifs_bud *bud);
|
| /linux-4.19.296/fs/jfs/ |
| D | jfs_dmap.c | 2761 int budsz, bud, w, bsz, size; in dbBackSplit() local
2793 w = (w < bud) ? w : bud) { in dbBackSplit()
2801 bud = w ^ bsz; in dbBackSplit()
2805 if (leaf[bud] != NOFREE) { in dbBackSplit()
2809 cursz = leaf[bud] - 1; in dbBackSplit()
2810 dbSplit(tp, bud, cursz, cursz); in dbBackSplit()
|