| /fs/ubifs/ |
| H A D | scan.c | 140 struct ubifs_scan_leb *sleb; local
145 sleb = kzalloc(sizeof(struct ubifs_scan_leb), GFP_NOFS);
146 if (!sleb)
149 sleb->lnum = lnum;
150 INIT_LIST_HEAD(&sleb->nodes);
151 sleb->buf = sbuf;
157 kfree(sleb);
165 return sleb;
171 * @sleb: scanning information
175 void ubifs_end_scan(const struct ubifs_info *c, struct ubifs_scan_leb *sleb, argument
194 ubifs_add_snod(const struct ubifs_info *c, struct ubifs_scan_leb *sleb, void *buf, int offs) argument
272 struct ubifs_scan_leb *sleb; local
367 ubifs_scan_destroy(struct ubifs_scan_leb *sleb) argument
[all...] |
| H A D | recovery.c | 500 * @sleb: scanned LEB information
503 static int fix_unclean_leb(struct ubifs_info *c, struct ubifs_scan_leb *sleb, argument
506 int lnum = sleb->lnum, endpt = start;
509 if (!list_empty(&sleb->nodes)) {
512 snod = list_entry(sleb->nodes.prev,
522 lnum, start, sleb->endpt);
534 lnum, start, sleb->endpt);
543 err = ubifs_leb_read(c, lnum, sleb->buf, 0,
553 void *buf = sleb->buf + len - pad_len;
558 err = ubifs_leb_change(c, lnum, sleb
574 drop_last_group(struct ubifs_scan_leb *sleb, int *offs) argument
603 drop_last_node(struct ubifs_scan_leb *sleb, int *offs) argument
639 struct ubifs_scan_leb *sleb; local
871 struct ubifs_scan_leb *sleb; local
[all...] |
| H A D | master.c | 38 struct ubifs_scan_leb *sleb; local
44 sleb = ubifs_scan(c, lnum, 0, c->sbuf, 1);
45 if (IS_ERR(sleb))
46 return PTR_ERR(sleb);
47 nodes_cnt = sleb->nodes_cnt;
49 snod = list_entry(sleb->nodes.prev, struct ubifs_scan_node,
56 ubifs_scan_destroy(sleb);
60 sleb = ubifs_scan(c, lnum, 0, c->sbuf, 1);
61 if (IS_ERR(sleb))
62 return PTR_ERR(sleb);
[all...] |
| H A D | gc.c | 223 * @sleb: describes nodes to sort and contains the result on exit
229 * @sleb->nodes and @nondata lists correspondingly.
247 static int sort_nodes(struct ubifs_info *c, struct ubifs_scan_leb *sleb, argument
256 list_for_each_entry_safe(snod, tmp, &sleb->nodes, list) {
278 err = ubifs_tnc_has_node(c, &snod->key, 0, sleb->lnum,
298 list_sort(c, &sleb->nodes, &data_nodes_cmp);
301 err = dbg_check_data_nodes_order(c, &sleb->nodes);
313 * @sleb: describes the LEB to move nodes from
321 static int move_node(struct ubifs_info *c, struct ubifs_scan_leb *sleb, argument
331 err = ubifs_tnc_replace(c, &snod->key, sleb
349 move_nodes(struct ubifs_info *c, struct ubifs_scan_leb *sleb) argument
471 struct ubifs_scan_leb *sleb; local
[all...] |
| H A D | replay.c | 545 struct ubifs_scan_leb *sleb; local
558 sleb = ubifs_recover_leb(c, lnum, offs, c->sbuf, b->bud->jhead);
560 sleb = ubifs_scan(c, lnum, offs, c->sbuf, 0);
561 if (IS_ERR(sleb))
562 return PTR_ERR(sleb);
575 * sleb->endpt', and the space in the 'lnum' LEB between 'offs' and
576 * 'sleb->endpt' is used by bud data. We have to correctly calculate
586 list_for_each_entry(snod, &sleb->nodes, list) {
675 ubifs_assert(sleb->endpt - offs >= used);
676 ubifs_assert(sleb
829 struct ubifs_scan_leb *sleb; local
[all...] |
| H A D | orphan.c | 551 * @sleb: scanned LEB
560 static int do_kill_orphans(struct ubifs_info *c, struct ubifs_scan_leb *sleb, argument
570 list_for_each_entry(snod, &sleb->nodes, list) {
573 snod->type, sleb->lnum, snod->offs);
600 cmt_no, sleb->lnum, snod->offs);
604 dbg_rcvry("out of date LEB %d", sleb->lnum);
628 cmt_no, sleb->lnum, snod->offs);
671 struct ubifs_scan_leb *sleb; local
674 sleb = ubifs_scan(c, lnum, 0, c->sbuf, 1);
675 if (IS_ERR(sleb)) {
856 dbg_read_orphans(struct check_info *ci, struct ubifs_scan_leb *sleb) argument
895 struct ubifs_scan_leb *sleb; local
[all...] |
| H A D | log.c | 635 struct ubifs_scan_leb *sleb; local
649 sleb = ubifs_scan(c, lnum, 0, c->sbuf, 0);
650 if (IS_ERR(sleb)) {
651 err = PTR_ERR(sleb);
654 list_for_each_entry(snod, &sleb->nodes, list) {
682 ubifs_scan_destroy(sleb);
716 ubifs_scan_destroy(sleb);
|
| H A D | lprops.c | 1033 struct ubifs_scan_leb *sleb; local
1116 sleb = ubifs_scan(c, lnum, 0, buf, 0);
1117 if (IS_ERR(sleb)) {
1118 ret = PTR_ERR(sleb);
1127 list_for_each_entry(snod, &sleb->nodes, list) {
1157 free = c->leb_size - sleb->endpt;
1158 dirty = sleb->endpt - used;
1239 ubifs_scan_destroy(sleb);
1248 ubifs_scan_destroy(sleb);
|
| H A D | tnc_commit.c | 231 struct ubifs_scan_leb *sleb; local
251 sleb = ubifs_scan(c, lnum, 0, c->ileb_buf, 0);
253 if (IS_ERR(sleb))
254 return PTR_ERR(sleb);
256 list_for_each_entry(snod, &sleb->nodes, list) {
268 ubifs_scan_destroy(sleb);
284 ubifs_scan_destroy(sleb);
291 ubifs_scan_destroy(sleb);
|
| H A D | debug.c | 797 const struct ubifs_scan_leb *sleb, int offs)
802 current->pid, sleb->lnum, offs);
804 list_for_each_entry(snod, &sleb->nodes, list) {
807 sleb->lnum, snod->offs, snod->len);
814 struct ubifs_scan_leb *sleb; local
826 sleb = ubifs_scan(c, lnum, 0, buf, 0);
827 if (IS_ERR(sleb)) {
828 ubifs_err("scan error %d", (int)PTR_ERR(sleb));
833 sleb->nodes_cnt, sleb
796 ubifs_dump_sleb(const struct ubifs_info *c, const struct ubifs_scan_leb *sleb, int offs) argument
[all...] |
| H A D | debug.h | 265 const struct ubifs_scan_leb *sleb, int offs);
|
| H A D | ubifs.h | 1510 void ubifs_scan_destroy(struct ubifs_scan_leb *sleb);
1515 void ubifs_end_scan(const struct ubifs_info *c, struct ubifs_scan_leb *sleb,
1517 int ubifs_add_snod(const struct ubifs_info *c, struct ubifs_scan_leb *sleb,
|