| /linux-3.4.99/fs/ubifs/ |
| D | gc.c | 251 struct ubifs_scan_node *snod, *tmp; in sort_nodes() local
256 list_for_each_entry_safe(snod, tmp, &sleb->nodes, list) { in sort_nodes()
257 ubifs_assert(snod->type == UBIFS_INO_NODE || in sort_nodes()
258 snod->type == UBIFS_DATA_NODE || in sort_nodes()
259 snod->type == UBIFS_DENT_NODE || in sort_nodes()
260 snod->type == UBIFS_XENT_NODE || in sort_nodes()
261 snod->type == UBIFS_TRUN_NODE); in sort_nodes()
263 if (snod->type != UBIFS_INO_NODE && in sort_nodes()
264 snod->type != UBIFS_DATA_NODE && in sort_nodes()
265 snod->type != UBIFS_DENT_NODE && in sort_nodes()
[all …]
|
| D | replay.c | 547 struct ubifs_scan_node *snod; in replay_bud() local
587 list_for_each_entry(snod, &sleb->nodes, list) { in replay_bud()
592 if (snod->sqnum >= SQNUM_WATERMARK) { in replay_bud()
597 if (snod->sqnum > c->max_sqnum) in replay_bud()
598 c->max_sqnum = snod->sqnum; in replay_bud()
600 switch (snod->type) { in replay_bud()
603 struct ubifs_ino_node *ino = snod->node; in replay_bud()
608 err = insert_node(c, lnum, snod->offs, snod->len, in replay_bud()
609 &snod->key, snod->sqnum, deletion, in replay_bud()
615 struct ubifs_data_node *dn = snod->node; in replay_bud()
[all …]
|
| D | scan.c | 198 struct ubifs_scan_node *snod; in ubifs_add_snod() local
200 snod = kmalloc(sizeof(struct ubifs_scan_node), GFP_NOFS); in ubifs_add_snod()
201 if (!snod) in ubifs_add_snod()
204 snod->sqnum = le64_to_cpu(ch->sqnum); in ubifs_add_snod()
205 snod->type = ch->node_type; in ubifs_add_snod()
206 snod->offs = offs; in ubifs_add_snod()
207 snod->len = le32_to_cpu(ch->len); in ubifs_add_snod()
208 snod->node = buf; in ubifs_add_snod()
219 key_read(c, &ino->key, &snod->key); in ubifs_add_snod()
222 invalid_key_init(c, &snod->key); in ubifs_add_snod()
[all …]
|
| D | master.c | 39 struct ubifs_scan_node *snod; in scan_for_master() local
49 snod = list_entry(sleb->nodes.prev, struct ubifs_scan_node, in scan_for_master()
51 if (snod->type != UBIFS_MST_NODE) in scan_for_master()
53 memcpy(c->mst_node, snod->node, snod->len); in scan_for_master()
54 offs = snod->offs; in scan_for_master()
67 snod = list_entry(sleb->nodes.prev, struct ubifs_scan_node, list); in scan_for_master()
68 if (snod->type != UBIFS_MST_NODE) in scan_for_master()
70 if (snod->offs != offs) in scan_for_master()
73 (void *)snod->node + UBIFS_CH_SZ, in scan_for_master()
86 snod->type, lnum, snod->offs); in scan_for_master()
|
| D | recovery.c | 510 struct ubifs_scan_node *snod; in fix_unclean_leb() local
512 snod = list_entry(sleb->nodes.prev, in fix_unclean_leb()
514 endpt = snod->offs + snod->len; in fix_unclean_leb()
578 struct ubifs_scan_node *snod; in drop_last_group() local
581 snod = list_entry(sleb->nodes.prev, struct ubifs_scan_node, in drop_last_group()
583 ch = snod->node; in drop_last_group()
588 sleb->lnum, snod->offs); in drop_last_group()
589 *offs = snod->offs; in drop_last_group()
590 list_del(&snod->list); in drop_last_group()
591 kfree(snod); in drop_last_group()
[all …]
|
| D | orphan.c | 565 struct ubifs_scan_node *snod; in do_kill_orphans() local
571 list_for_each_entry(snod, &sleb->nodes, list) { in do_kill_orphans()
572 if (snod->type != UBIFS_ORPH_NODE) { in do_kill_orphans()
574 "%d:%d", snod->type, sleb->lnum, snod->offs); in do_kill_orphans()
575 dbg_dump_node(c, snod->node); in do_kill_orphans()
579 orph = snod->node; in do_kill_orphans()
602 cmt_no, sleb->lnum, snod->offs); in do_kill_orphans()
603 dbg_dump_node(c, snod->node); in do_kill_orphans()
630 cmt_no, sleb->lnum, snod->offs); in do_kill_orphans()
875 struct ubifs_scan_node *snod; in dbg_read_orphans() local
[all …]
|
| D | tnc_commit.c | 234 struct ubifs_scan_node *snod; in layout_leb_in_gaps() local
258 list_for_each_entry(snod, &sleb->nodes, list) { in layout_leb_in_gaps()
262 ubifs_assert(snod->type == UBIFS_IDX_NODE); in layout_leb_in_gaps()
263 idx = snod->node; in layout_leb_in_gaps()
264 key_read(c, ubifs_idx_key(c, idx), &snod->key); in layout_leb_in_gaps()
267 in_use = is_idx_node_in_use(c, &snod->key, level, lnum, in layout_leb_in_gaps()
268 snod->offs); in layout_leb_in_gaps()
275 dirt += ALIGN(snod->len, 8); in layout_leb_in_gaps()
282 gap_end = snod->offs; in layout_leb_in_gaps()
290 gap_start = ALIGN(snod->offs + snod->len, 8); in layout_leb_in_gaps()
|
| D | lprops.c | 1032 struct ubifs_scan_node *snod; in scan_check_cb() local
1125 list_for_each_entry(snod, &sleb->nodes, list) { in scan_check_cb()
1131 is_idx = (snod->type == UBIFS_IDX_NODE) ? 1 : 0; in scan_check_cb()
1133 if (is_idx && snod->type != UBIFS_IDX_NODE) { in scan_check_cb()
1135 lnum, snod->offs); in scan_check_cb()
1139 if (snod->type == UBIFS_IDX_NODE) { in scan_check_cb()
1140 struct ubifs_idx_node *idx = snod->node; in scan_check_cb()
1142 key_read(c, ubifs_idx_key(c, idx), &snod->key); in scan_check_cb()
1146 found = ubifs_tnc_has_node(c, &snod->key, level, lnum, in scan_check_cb()
1147 snod->offs, is_idx); in scan_check_cb()
[all …]
|
| D | log.c | 650 struct ubifs_scan_node *snod; in ubifs_consolidate_log() local
668 list_for_each_entry(snod, &sleb->nodes, list) { in ubifs_consolidate_log()
669 switch (snod->type) { in ubifs_consolidate_log()
671 struct ubifs_ref_node *ref = snod->node; in ubifs_consolidate_log()
679 &offs, snod->node); in ubifs_consolidate_log()
689 snod->node); in ubifs_consolidate_log()
|
| D | debug.c | 868 struct ubifs_scan_node *snod; in dbg_dump_sleb() local
873 list_for_each_entry(snod, &sleb->nodes, list) { in dbg_dump_sleb()
876 snod->offs, snod->len); in dbg_dump_sleb()
877 dbg_dump_node(c, snod->node); in dbg_dump_sleb()
884 struct ubifs_scan_node *snod; in dbg_dump_leb() local
908 list_for_each_entry(snod, &sleb->nodes, list) { in dbg_dump_leb()
911 snod->offs, snod->len); in dbg_dump_leb()
912 dbg_dump_node(c, snod->node); in dbg_dump_leb()
|