Home
last modified time | relevance | path

Searched refs:bud (Results 1 – 6 of 6) sorted by relevance

/linux/fs/ubifs/
H A Dlog.c33 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 …]
H A Dreplay.c73 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()
516 static int is_last_bud(struct ubifs_info *c, struct ubifs_bud *bud) in is_last_bud() argument
518 struct ubifs_jhead *jh = &c->jheads[bud->jhead]; in is_last_bud()
[all …]
H A Dsuper.c920 struct ubifs_bud *bud, *n; in free_buds() local
922 rbtree_postorder_for_each_entry_safe(bud, n, &c->buds, rb) { in free_buds()
923 kfree(bud->log_hash); in free_buds()
924 kfree(bud); in free_buds()
1133 struct ubifs_bud *bud; in destroy_journal() local
1135 bud = list_entry(c->old_buds.next, struct ubifs_bud, list); in destroy_journal()
1136 list_del(&bud->list); in destroy_journal()
1137 kfree(bud->log_hash); in destroy_journal()
1138 kfree(bud); in destroy_journal()
H A Ddebug.c616 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()
H A Dubifs.h1778 void ubifs_add_bud(struct ubifs_info *c, struct ubifs_bud *bud);
/linux/Documentation/translations/zh_CN/filesystems/
H A Dubifs-authentication.rst119 数据节点等）在闪存上的位置，这些节点称为 *bud* ，描述包含数据的实际文件系
126 写入日志条目时，UBIFS 首先确保有足够空间写入引用节点和该条目的 bud。然后先
127 写引用节点，再写描述文件变更的 bud。在日志重放阶段，UBIFS 会记录每个参考节
150 bud 的主区
262 据量可控。方法是从提交起始节点开始，对先前引用节点、当前引用节点和 bud 节点
263 创建连续哈希链。适时地在bud节点间插入认证节点，这种新节点类型包含哈希链当前
274 ,.REF#0,-> bud -> bud -> bud.-> auth -> bud -> bud.-> auth ...
281 , REF#1 -> bud -> bud,-> auth ...
290 bud 节点或引用节点，最大限度将文件系统回退至上次提交。