| /linux-5.19.10/fs/ubifs/ |
| D | log.c | 33 struct ubifs_bud *bud; in ubifs_search_bud() local
38 bud = rb_entry(p, struct ubifs_bud, rb); in ubifs_search_bud()
39 if (lnum < bud->lnum) in ubifs_search_bud()
41 else if (lnum > bud->lnum) in ubifs_search_bud()
45 return bud; in ubifs_search_bud()
62 struct ubifs_bud *bud; in ubifs_get_wbuf() local
71 bud = rb_entry(p, struct ubifs_bud, rb); in ubifs_get_wbuf()
72 if (lnum < bud->lnum) in ubifs_get_wbuf()
74 else if (lnum > bud->lnum) in ubifs_get_wbuf()
77 jhead = bud->jhead; in ubifs_get_wbuf()
[all …]
|
| D | replay.c | 73 struct ubifs_bud *bud; member
95 lp = ubifs_lpt_lookup_dirty(c, b->bud->lnum); in set_bud_lprops()
102 if (b->bud->start == 0 && (lp->free != c->leb_size || lp->dirty != 0)) { in set_bud_lprops()
122 dbg_mnt("bud LEB %d was GC'd (%d free, %d dirty)", b->bud->lnum, in set_bud_lprops()
124 dbg_gc("bud LEB %d was GC'd (%d free, %d dirty)", b->bud->lnum, in set_bud_lprops()
136 b->bud->lnum, lp->free, lp->dirty, b->free, in set_bud_lprops()
147 err = ubifs_wbuf_seek_nolock(&c->jheads[b->bud->jhead].wbuf, in set_bud_lprops()
148 b->bud->lnum, c->leb_size - b->free); in set_bud_lprops()
514 static int is_last_bud(struct ubifs_info *c, struct ubifs_bud *bud) in is_last_bud() argument
516 struct ubifs_jhead *jh = &c->jheads[bud->jhead]; in is_last_bud()
[all …]
|
| D | debug.c | 616 struct ubifs_bud *bud; in ubifs_dump_budg() local
658 bud = rb_entry(rb, struct ubifs_bud, rb); in ubifs_dump_budg()
659 pr_err("\tbud LEB %d\n", bud->lnum); in ubifs_dump_budg()
661 list_for_each_entry(bud, &c->old_buds, list) in ubifs_dump_budg()
662 pr_err("\told bud LEB %d\n", bud->lnum); in ubifs_dump_budg()
684 struct ubifs_bud *bud; in ubifs_dump_lprop() local
746 bud = rb_entry(rb, struct ubifs_bud, rb); in ubifs_dump_lprop()
747 if (bud->lnum == lp->lnum) { in ubifs_dump_lprop()
763 dbg_jhead(bud->jhead)); in ubifs_dump_lprop()
|
| D | super.c | 915 struct ubifs_bud *bud, *n; in free_buds() local
917 rbtree_postorder_for_each_entry_safe(bud, n, &c->buds, rb) in free_buds()
918 kfree(bud); in free_buds()
1183 struct ubifs_bud *bud; in destroy_journal() local
1185 bud = list_entry(c->old_buds.next, struct ubifs_bud, list); in destroy_journal()
1186 list_del(&bud->list); in destroy_journal()
1187 kfree(bud); in destroy_journal()
|
| D | ubifs.h | 1784 void ubifs_add_bud(struct ubifs_info *c, struct ubifs_bud *bud);
|
| /linux-5.19.10/mm/ |
| D | z3fold.c | 429 static inline int __idx(struct z3fold_header *zhdr, enum buddy bud) in __idx() argument
431 return (bud + zhdr->first_num) & BUDDY_MASK; in __idx()
440 enum buddy bud) in __encode_handle() argument
449 if (bud == HEADLESS) in __encode_handle()
453 idx = __idx(zhdr, bud); in __encode_handle()
455 if (bud == LAST) in __encode_handle()
464 static unsigned long encode_handle(struct z3fold_header *zhdr, enum buddy bud) in encode_handle() argument
466 return __encode_handle(zhdr, zhdr->slots, bud); in encode_handle()
618 enum buddy bud = HEADLESS; in get_free_buddy() local
623 bud = FIRST; in get_free_buddy()
[all …]
|
| D | zbud.c | 174 static unsigned long encode_handle(struct zbud_header *zhdr, enum buddy bud) in encode_handle() argument
185 if (bud == FIRST) in encode_handle()
273 enum buddy bud; in zbud_alloc() local
290 bud = FIRST; in zbud_alloc()
292 bud = LAST; in zbud_alloc()
305 bud = FIRST; in zbud_alloc()
308 if (bud == FIRST) in zbud_alloc()
327 *handle = encode_handle(zhdr, bud); in zbud_alloc()
|
| /linux-5.19.10/Documentation/filesystems/ |
| D | ubifs-authentication.rst | 330 over the previous reference nodes, the current reference node, and the bud
332 between the bud nodes. This new node type contains a HMAC over the current state
344 ,.REF#0,-> bud -> bud -> bud.-> auth -> bud -> bud.-> auth ...
351 , REF#1 -> bud -> bud,-> auth ...
360 skip any journal heads for replay. An attacker can only remove bud nodes or
|
| /linux-5.19.10/fs/jfs/ |
| D | jfs_dmap.c | 2658 int budsz, bud, w, bsz, size; in dbBackSplit() local
2690 w = (w < bud) ? w : bud) { in dbBackSplit()
2698 bud = w ^ bsz; in dbBackSplit()
2702 if (leaf[bud] != NOFREE) { in dbBackSplit()
2706 cursz = leaf[bud] - 1; in dbBackSplit()
2707 dbSplit(tp, bud, cursz, cursz); in dbBackSplit()
|