Searched refs:bud (Results 1 - 8 of 8) sorted by relevance

/linux-master/fs/ubifs/
H A Dlog.c23 * ubifs_search_bud - search bud LEB.
27 * This function searches bud LEB @lnum. Returns bud description object in case
28 * of success and %NULL if there is no bud with this LEB number.
33 struct ubifs_bud *bud; local
38 bud = rb_entry(p, struct ubifs_bud, rb);
39 if (lnum < bud->lnum)
41 else if (lnum > bud->lnum)
45 return bud;
62 struct ubifs_bud *bud; local
112 ubifs_add_bud(struct ubifs_info *c, struct ubifs_bud *bud) argument
167 struct ubifs_bud *bud; local
307 struct ubifs_bud *bud; local
520 struct ubifs_bud *bud; local
743 struct ubifs_bud *bud; local
[all...]
H A Dreplay.c64 * @list: next bud in the list
65 * @bud: bud description object
67 * @free: free bytes in the bud
68 * @dirty: dirty bytes in the bud
72 struct ubifs_bud *bud; member in struct:bud_entry
79 * set_bud_lprops - set free and dirty space used by a bud.
81 * @b: bud entry which describes the bud
83 * This function makes sure the LEB properties of bud
515 is_last_bud(struct ubifs_info *c, struct ubifs_bud *bud) argument
893 struct ubifs_bud *bud; local
945 struct ubifs_bud *bud; 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.
915 * free_buds - free per-bud objects.
920 struct ubifs_bud *bud, *n; local
922 rbtree_postorder_for_each_entry_safe(bud, n, &c->buds, rb) {
923 kfree(bud->log_hash);
924 kfree(bud);
1190 struct ubifs_bud *bud; local
1192 bud
[all...]
H A Ddebug.c616 struct ubifs_bud *bud; local
658 bud = rb_entry(rb, struct ubifs_bud, rb);
659 pr_err("\tbud LEB %d\n", bud->lnum);
661 list_for_each_entry(bud, &c->old_buds, list)
662 pr_err("\told bud LEB %d\n", bud->lnum);
684 struct ubifs_bud *bud; local
746 bud = rb_entry(rb, struct ubifs_bud, rb);
747 if (bud->lnum == lp->lnum) {
762 pr_cont(", bud o
[all...]
H A Dubifs.h712 * struct ubifs_bud - bud logical eraseblock.
714 * @start: where the (uncommitted) bud data starts
715 * @jhead: journal head number this bud belongs to
718 * @log_hash: the log hash from the commit start node up to this bud
732 * @buds_list: list of bud LEBs belonging to this journal head
1040 * @buds: tree of all buds indexed by bud LEB number
1042 * @buds_lock: protects the @buds tree, @bud_bytes, and per-journal head bud
1047 * @bg_bud_bytes: number of bud bytes when background commit is initiated
1793 void ubifs_add_bud(struct ubifs_info *c, struct ubifs_bud *bud);
/linux-master/mm/
H A Dzbud.c155 static unsigned long encode_handle(struct zbud_header *zhdr, enum buddy bud) argument
166 if (bud == FIRST)
169 else /* bud == LAST */
251 enum buddy bud; local
268 bud = FIRST;
270 bud = LAST;
283 bud = FIRST;
286 if (bud == FIRST)
300 *handle = encode_handle(zhdr, bud);
H A Dz3fold.c361 static inline int __idx(struct z3fold_header *zhdr, enum buddy bud) argument
363 return (bud + zhdr->first_num) & BUDDY_MASK;
369 * if bud != HEADLESS.
373 enum buddy bud)
382 if (bud == HEADLESS)
386 idx = __idx(zhdr, bud);
388 if (bud == LAST)
397 static unsigned long encode_handle(struct z3fold_header *zhdr, enum buddy bud) argument
399 return __encode_handle(zhdr, zhdr->slots, bud);
402 /* only for LAST bud, return
371 __encode_handle(struct z3fold_header *zhdr, struct z3fold_buddy_slots *slots, enum buddy bud) argument
559 enum buddy bud = HEADLESS; local
1007 enum buddy bud; local
1097 enum buddy bud; local
[all...]
/linux-master/fs/jfs/
H A Djfs_dmap.c2691 int budsz, bud, w, bsz, size; local
2723 w = (w < bud) ? w : bud) {
2731 bud = w ^ bsz;
2735 if (leaf[bud] != NOFREE) {
2739 cursz = leaf[bud] - 1;
2740 dbSplit(tp, bud, cursz, cursz, is_ctl);

Completed in 178 milliseconds