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.c65 * @list: next bud in the list
66 * @bud: bud description object
68 * @free: free bytes in the bud
69 * @dirty: dirty bytes in the bud
73 struct ubifs_bud *bud; member
80 * set_bud_lprops - set free and dirty space used by a bud.
82 * @b: bud entry which describes the bud
84 * This function makes sure the LEB properties of bud
516 is_last_bud(struct ubifs_info * c,struct ubifs_bud * bud) is_last_bud() argument
894 struct ubifs_bud *bud; add_replay_bud() local
946 struct ubifs_bud *bud; validate_ref() local
[all...]
H A Dsuper.c645 * bud_wbuf_callback - bud LEB write-buffer synchronization call-back.
653 * accounting in bud logical eraseblocks. This function returns zero in case of
730 * when number of bud bytes becomes above the limit defined below. in init_constants_sb()
914 * free_buds - free per-bud objects.
919 struct ubifs_bud *bud, *n; in free_buds() local
921 rbtree_postorder_for_each_entry_safe(bud, n, &c->buds, rb) { in free_buds()
922 kfree(bud->log_hash); in free_buds()
923 kfree(bud); in free_buds()
1132 struct ubifs_bud *bud; in destroy_journal() local
1134 bud in destroy_journal()
[all...]
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()
762 pr_cont(", bud o in ubifs_dump_lprop()
[all...]
/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 节点或引用节点，最大限度将文件系统回退至上次提交。
/linux/fs/jfs/
H A Djfs_dmap.c2780 int budsz, bud, w, bsz, size; in dbJoin()
2812 w = (w < bud) ? w : bud) { in dbJoin()
2820 bud = w ^ bsz; in dbJoin()
2824 if (leaf[bud] != NOFREE) { in dbJoin()
2828 cursz = leaf[bud] - 1; in dbJoin()
2829 dbSplit(tp, bud, cursz, cursz, is_ctl); in dbJoin()
2693 int budsz, bud, w, bsz, size; dbBackSplit() local