Searched defs:bud (Results 1 - 5 of 5) sorted by relevance

/fs/ubifs/
H A Dlog.c35 * ubifs_search_bud - search bud LEB.
39 * This function searches bud LEB @lnum. Returns bud description object in case
40 * of success and %NULL if there is no bud with this LEB number.
45 struct ubifs_bud *bud; local
50 bud = rb_entry(p, struct ubifs_bud, rb);
51 if (lnum < bud->lnum)
53 else if (lnum > bud->lnum)
57 return bud;
74 struct ubifs_bud *bud; local
124 ubifs_add_bud(struct ubifs_info *c, struct ubifs_bud *bud) argument
179 struct ubifs_bud *bud; local
310 struct ubifs_bud *bud; local
512 struct ubifs_bud *bud; local
734 struct ubifs_bud *bud; local
[all...]
H A Dreplay.c74 * @list: next bud in the list
75 * @bud: bud description object
77 * @free: free bytes in the bud
78 * @dirty: dirty bytes in the bud
82 struct ubifs_bud *bud; member in struct:bud_entry
89 * set_bud_lprops - set free and dirty space used by a bud.
91 * @b: bud entry which describes the bud
93 * This function makes sure the LEB properties of bud
484 is_last_bud(struct ubifs_info *c, struct ubifs_bud *bud) argument
748 struct ubifs_bud *bud; local
788 struct ubifs_bud *bud; local
[all...]
H A Dsuper.c622 * bud_wbuf_callback - bud LEB write-buffer synchronization call-back.
630 * accounting in bud logical eraseblocks. This function returns zero in case of
707 * when number of bud bytes becomes above the limit defined below.
871 * free_buds - free per-bud objects.
876 struct ubifs_bud *bud, *n; local
878 rbtree_postorder_for_each_entry_safe(bud, n, &c->buds, rb)
879 kfree(bud);
1079 struct ubifs_bud *bud; local
1081 bud = list_entry(c->old_buds.next, struct ubifs_bud, list);
1082 list_del(&bud
[all...]
H A Ddebug.c581 struct ubifs_bud *bud; local
623 bud = rb_entry(rb, struct ubifs_bud, rb);
624 pr_err("\tbud LEB %d\n", bud->lnum);
626 list_for_each_entry(bud, &c->old_buds, list)
627 pr_err("\told bud LEB %d\n", bud->lnum);
649 struct ubifs_bud *bud; local
711 bud = rb_entry(rb, struct ubifs_bud, rb);
712 if (bud->lnum == lp->lnum) {
727 pr_cont(", bud o
[all...]
/fs/jfs/
H A Djfs_dmap.c2727 int budsz, bud, w, bsz, size; local
2759 w = (w < bud) ? w : bud) {
2767 bud = w ^ bsz;
2771 if (leaf[bud] != NOFREE) {
2775 cursz = leaf[bud] - 1;
2776 dbSplit(tp, bud, cursz, cursz);

Completed in 320 milliseconds