| /netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/fs/ubifs/ |
| H A D | scan.c | 138 struct ubifs_scan_leb *sleb; local
143 sleb = kzalloc(sizeof(struct ubifs_scan_leb), GFP_NOFS);
144 if (!sleb)
147 sleb->lnum = lnum;
148 INIT_LIST_HEAD(&sleb->nodes);
149 sleb->buf = sbuf;
155 kfree(sleb);
160 sleb->ecc = 1;
162 return sleb;
168 * @sleb
174 ubifs_end_scan(const struct ubifs_info *c, struct ubifs_scan_leb *sleb, int lnum, int offs) argument
193 ubifs_add_snod(const struct ubifs_info *c, struct ubifs_scan_leb *sleb, void *buf, int offs) argument
271 struct ubifs_scan_leb *sleb; local
366 ubifs_scan_destroy(struct ubifs_scan_leb *sleb) argument
[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 | 200 * @sleb: describes nodes to sort and contains the result on exit
206 * @sleb->nodes and @nondata lists correspondingly.
224 static int sort_nodes(struct ubifs_info *c, struct ubifs_scan_leb *sleb, argument
232 list_for_each_entry_safe(snod, tmp, &sleb->nodes, list) {
239 err = ubifs_tnc_has_node(c, &snod->key, 0, sleb->lnum,
259 list_sort(c, &sleb->nodes, &data_nodes_cmp);
267 * @sleb: describes the LEB to move nodes from
275 static int move_node(struct ubifs_info *c, struct ubifs_scan_leb *sleb, argument
285 err = ubifs_tnc_replace(c, &snod->key, sleb->lnum,
296 * @sleb
303 move_nodes(struct ubifs_info *c, struct ubifs_scan_leb *sleb) argument
425 struct ubifs_scan_leb *sleb; local
[all...] |
| H A D | recovery.c | 455 * @sleb: scanned LEB information
458 static int fix_unclean_leb(struct ubifs_info *c, struct ubifs_scan_leb *sleb, argument
461 int lnum = sleb->lnum, endpt = start;
464 if (!list_empty(&sleb->nodes)) {
467 snod = list_entry(sleb->nodes.prev,
477 lnum, start, sleb->endpt);
489 lnum, start, sleb->endpt);
498 err = ubi_read(c->ubi, lnum, sleb->buf, 0,
508 void *buf = sleb->buf + len - pad_len;
513 err = ubi_leb_change(c->ubi, lnum, sleb
529 drop_incomplete_group(struct ubifs_scan_leb *sleb, int *offs) argument
570 struct ubifs_scan_leb *sleb; local
782 struct ubifs_scan_leb *sleb; local
[all...] |
| H A D | replay.c | 501 struct ubifs_scan_leb *sleb; local
507 sleb = ubifs_recover_leb(c, lnum, offs, c->sbuf, jhead != GCHD);
509 sleb = ubifs_scan(c, lnum, offs, c->sbuf, 0);
510 if (IS_ERR(sleb))
511 return PTR_ERR(sleb);
524 * sleb->endpt', and the space in the 'lnum' LEB between 'offs' and
525 * 'sleb->endpt' is used by bud data. We have to correctly calculate
535 list_for_each_entry(snod, &sleb->nodes, list) {
627 ubifs_assert(sleb->endpt - offs >= used);
628 ubifs_assert(sleb
834 struct ubifs_scan_leb *sleb; local
[all...] |
| H A D | orphan.c | 549 * @sleb: scanned LEB
558 static int do_kill_orphans(struct ubifs_info *c, struct ubifs_scan_leb *sleb, argument
568 list_for_each_entry(snod, &sleb->nodes, list) {
571 "%d:%d", snod->type, sleb->lnum, snod->offs);
599 cmt_no, sleb->lnum, snod->offs);
603 dbg_rcvry("out of date LEB %d", sleb->lnum);
627 cmt_no, sleb->lnum, snod->offs);
670 struct ubifs_scan_leb *sleb; local
673 sleb = ubifs_scan(c, lnum, 0, c->sbuf, 1);
674 if (IS_ERR(sleb)) {
869 dbg_read_orphans(struct check_info *ci, struct ubifs_scan_leb *sleb) argument
901 struct ubifs_scan_leb *sleb; local
[all...] |
| H A D | log.c | 685 struct ubifs_scan_leb *sleb; local
699 sleb = ubifs_scan(c, lnum, 0, c->sbuf, 0);
700 if (IS_ERR(sleb)) {
701 err = PTR_ERR(sleb);
704 list_for_each_entry(snod, &sleb->nodes, list) {
732 ubifs_scan_destroy(sleb);
766 ubifs_scan_destroy(sleb);
|
| H A D | lprops.c | 1035 struct ubifs_scan_leb *sleb; local
1096 sleb = ubifs_scan(c, lnum, 0, c->dbg->buf, 0);
1097 if (IS_ERR(sleb)) {
1120 data->err = PTR_ERR(sleb);
1125 list_for_each_entry(snod, &sleb->nodes, list) {
1155 free = c->leb_size - sleb->endpt;
1156 dirty = sleb->endpt - used;
1238 ubifs_scan_destroy(sleb);
1247 ubifs_scan_destroy(sleb);
|
| H A D | tnc_commit.c | 228 struct ubifs_scan_leb *sleb; local
248 sleb = ubifs_scan(c, lnum, 0, c->ileb_buf, 0);
250 if (IS_ERR(sleb))
251 return PTR_ERR(sleb);
253 list_for_each_entry(snod, &sleb->nodes, list) {
265 ubifs_scan_destroy(sleb);
281 ubifs_scan_destroy(sleb);
288 ubifs_scan_destroy(sleb);
|
| H A D | debug.c | 811 struct ubifs_scan_leb *sleb; local
819 sleb = ubifs_scan(c, lnum, 0, c->dbg->buf, 0);
820 if (IS_ERR(sleb)) {
821 ubifs_err("scan error %d", (int)PTR_ERR(sleb));
826 sleb->nodes_cnt, sleb->endpt);
828 list_for_each_entry(snod, &sleb->nodes, list) {
837 ubifs_scan_destroy(sleb);
|
| H A D | ubifs.h | 1454 void ubifs_scan_destroy(struct ubifs_scan_leb *sleb);
1459 void ubifs_end_scan(const struct ubifs_info *c, struct ubifs_scan_leb *sleb,
1461 int ubifs_add_snod(const struct ubifs_info *c, struct ubifs_scan_leb *sleb,
|