Home
last modified time | relevance | path

Searched refs:snod (Results 1 – 20 of 20) sorted by relevance

/OK3568_Linux_fs/kernel/fs/ubifs/
H A Dgc.c231 struct ubifs_scan_node *snod, *tmp; in sort_nodes() local
236 list_for_each_entry_safe(snod, tmp, &sleb->nodes, list) { in sort_nodes()
237 ubifs_assert(c, snod->type == UBIFS_INO_NODE || in sort_nodes()
238 snod->type == UBIFS_DATA_NODE || in sort_nodes()
239 snod->type == UBIFS_DENT_NODE || in sort_nodes()
240 snod->type == UBIFS_XENT_NODE || in sort_nodes()
241 snod->type == UBIFS_TRUN_NODE || in sort_nodes()
242 snod->type == UBIFS_AUTH_NODE); in sort_nodes()
244 if (snod->type != UBIFS_INO_NODE && in sort_nodes()
245 snod->type != UBIFS_DATA_NODE && in sort_nodes()
[all …]
H A Dreplay.c595 struct ubifs_scan_node *snod; in authenticate_sleb() local
604 list_for_each_entry(snod, &sleb->nodes, list) { in authenticate_sleb()
608 if (snod->type == UBIFS_AUTH_NODE) { in authenticate_sleb()
609 struct ubifs_auth_node *auth = snod->node; in authenticate_sleb()
627 err = crypto_shash_update(log_hash, snod->node, in authenticate_sleb()
628 snod->len); in authenticate_sleb()
672 struct ubifs_scan_node *snod; in replay_bud() local
721 list_for_each_entry(snod, &sleb->nodes, list) { in replay_bud()
727 if (snod->sqnum >= SQNUM_WATERMARK) { in replay_bud()
732 ubifs_node_calc_hash(c, snod->node, hash); in replay_bud()
[all …]
H A Dscan.c186 struct ubifs_scan_node *snod; in ubifs_add_snod() local
188 snod = kmalloc(sizeof(struct ubifs_scan_node), GFP_NOFS); in ubifs_add_snod()
189 if (!snod) in ubifs_add_snod()
192 snod->sqnum = le64_to_cpu(ch->sqnum); in ubifs_add_snod()
193 snod->type = ch->node_type; in ubifs_add_snod()
194 snod->offs = offs; in ubifs_add_snod()
195 snod->len = le32_to_cpu(ch->len); in ubifs_add_snod()
196 snod->node = buf; in ubifs_add_snod()
207 key_read(c, &ino->key, &snod->key); in ubifs_add_snod()
210 invalid_key_init(c, &snod->key); in ubifs_add_snod()
[all …]
H A Dmaster.c93 struct ubifs_scan_node *snod; in scan_for_master() local
103 snod = list_entry(sleb->nodes.prev, struct ubifs_scan_node, in scan_for_master()
105 if (snod->type != UBIFS_MST_NODE) in scan_for_master()
107 memcpy(c->mst_node, snod->node, snod->len); in scan_for_master()
108 offs = snod->offs; in scan_for_master()
121 snod = list_entry(sleb->nodes.prev, struct ubifs_scan_node, list); in scan_for_master()
122 if (snod->type != UBIFS_MST_NODE) in scan_for_master()
124 if (snod->offs != offs) in scan_for_master()
126 if (ubifs_compare_master_node(c, c->mst_node, snod->node)) in scan_for_master()
159 snod->type, lnum, snod->offs); in scan_for_master()
H A Drecovery.c498 struct ubifs_scan_node *snod; in fix_unclean_leb() local
500 snod = list_entry(sleb->nodes.prev, in fix_unclean_leb()
502 endpt = snod->offs + snod->len; in fix_unclean_leb()
565 struct ubifs_scan_node *snod; in drop_last_group() local
568 snod = list_entry(sleb->nodes.prev, struct ubifs_scan_node, in drop_last_group()
570 ch = snod->node; in drop_last_group()
575 sleb->lnum, snod->offs); in drop_last_group()
576 *offs = snod->offs; in drop_last_group()
577 list_del(&snod->list); in drop_last_group()
578 kfree(snod); in drop_last_group()
[all …]
H A Dorphan.c634 struct ubifs_scan_node *snod; in do_kill_orphans() local
645 list_for_each_entry(snod, &sleb->nodes, list) { in do_kill_orphans()
646 if (snod->type != UBIFS_ORPH_NODE) { in do_kill_orphans()
648 snod->type, sleb->lnum, snod->offs); in do_kill_orphans()
649 ubifs_dump_node(c, snod->node); in do_kill_orphans()
654 orph = snod->node; in do_kill_orphans()
676 cmt_no, sleb->lnum, snod->offs); in do_kill_orphans()
677 ubifs_dump_node(c, snod->node); in do_kill_orphans()
725 cmt_no, sleb->lnum, snod->offs); in do_kill_orphans()
952 struct ubifs_scan_node *snod; in dbg_read_orphans() local
[all …]
H A Dtnc_commit.c227 struct ubifs_scan_node *snod; in layout_leb_in_gaps() local
251 list_for_each_entry(snod, &sleb->nodes, list) { in layout_leb_in_gaps()
255 ubifs_assert(c, snod->type == UBIFS_IDX_NODE); in layout_leb_in_gaps()
256 idx = snod->node; in layout_leb_in_gaps()
257 key_read(c, ubifs_idx_key(c, idx), &snod->key); in layout_leb_in_gaps()
260 in_use = is_idx_node_in_use(c, &snod->key, level, lnum, in layout_leb_in_gaps()
261 snod->offs); in layout_leb_in_gaps()
268 dirt += ALIGN(snod->len, 8); in layout_leb_in_gaps()
275 gap_end = snod->offs; in layout_leb_in_gaps()
283 gap_start = ALIGN(snod->offs + snod->len, 8); in layout_leb_in_gaps()
H A Dauth.c197 struct ubifs_scan_node *snod; in ubifs_sb_verify_signature() local
212 snod = list_first_entry(&sleb->nodes, struct ubifs_scan_node, list); in ubifs_sb_verify_signature()
214 if (snod->type != UBIFS_SIG_NODE) { in ubifs_sb_verify_signature()
220 signode = snod->node; in ubifs_sb_verify_signature()
222 if (le32_to_cpu(signode->len) > snod->len + sizeof(struct ubifs_sig_node)) { in ubifs_sb_verify_signature()
H A Dlprops.c1020 struct ubifs_scan_node *snod; in scan_check_cb() local
1113 list_for_each_entry(snod, &sleb->nodes, list) { in scan_check_cb()
1119 is_idx = (snod->type == UBIFS_IDX_NODE) ? 1 : 0; in scan_check_cb()
1121 if (is_idx && snod->type != UBIFS_IDX_NODE) { in scan_check_cb()
1123 lnum, snod->offs); in scan_check_cb()
1127 if (snod->type == UBIFS_IDX_NODE) { in scan_check_cb()
1128 struct ubifs_idx_node *idx = snod->node; in scan_check_cb()
1130 key_read(c, ubifs_idx_key(c, idx), &snod->key); in scan_check_cb()
1134 found = ubifs_tnc_has_node(c, &snod->key, level, lnum, in scan_check_cb()
1135 snod->offs, is_idx); in scan_check_cb()
[all …]
H A Dlog.c645 struct ubifs_scan_node *snod; in ubifs_consolidate_log() local
663 list_for_each_entry(snod, &sleb->nodes, list) { in ubifs_consolidate_log()
664 switch (snod->type) { in ubifs_consolidate_log()
666 struct ubifs_ref_node *ref = snod->node; in ubifs_consolidate_log()
674 &offs, snod->node); in ubifs_consolidate_log()
684 snod->node); in ubifs_consolidate_log()
H A Ddebug.c797 struct ubifs_scan_node *snod; in ubifs_dump_sleb() local
802 list_for_each_entry(snod, &sleb->nodes, list) { in ubifs_dump_sleb()
805 sleb->lnum, snod->offs, snod->len); in ubifs_dump_sleb()
806 ubifs_dump_node(c, snod->node); in ubifs_dump_sleb()
813 struct ubifs_scan_node *snod; in ubifs_dump_leb() local
833 list_for_each_entry(snod, &sleb->nodes, list) { in ubifs_dump_leb()
836 snod->offs, snod->len); in ubifs_dump_leb()
837 ubifs_dump_node(c, snod->node); in ubifs_dump_leb()
/OK3568_Linux_fs/u-boot/fs/ubifs/
H A Dgc.c242 struct ubifs_scan_node *snod, *tmp; in sort_nodes() local
247 list_for_each_entry_safe(snod, tmp, &sleb->nodes, list) { in sort_nodes()
248 ubifs_assert(snod->type == UBIFS_INO_NODE || in sort_nodes()
249 snod->type == UBIFS_DATA_NODE || in sort_nodes()
250 snod->type == UBIFS_DENT_NODE || in sort_nodes()
251 snod->type == UBIFS_XENT_NODE || in sort_nodes()
252 snod->type == UBIFS_TRUN_NODE); in sort_nodes()
254 if (snod->type != UBIFS_INO_NODE && in sort_nodes()
255 snod->type != UBIFS_DATA_NODE && in sort_nodes()
256 snod->type != UBIFS_DENT_NODE && in sort_nodes()
[all …]
H A Dreplay.c540 struct ubifs_scan_node *snod; in replay_bud() local
580 list_for_each_entry(snod, &sleb->nodes, list) { in replay_bud()
585 if (snod->sqnum >= SQNUM_WATERMARK) { in replay_bud()
590 if (snod->sqnum > c->max_sqnum) in replay_bud()
591 c->max_sqnum = snod->sqnum; in replay_bud()
593 switch (snod->type) { in replay_bud()
596 struct ubifs_ino_node *ino = snod->node; in replay_bud()
601 err = insert_node(c, lnum, snod->offs, snod->len, in replay_bud()
602 &snod->key, snod->sqnum, deletion, in replay_bud()
608 struct ubifs_data_node *dn = snod->node; in replay_bud()
[all …]
H A Dscan.c192 struct ubifs_scan_node *snod; in ubifs_add_snod() local
194 snod = kmalloc(sizeof(struct ubifs_scan_node), GFP_NOFS); in ubifs_add_snod()
195 if (!snod) in ubifs_add_snod()
198 snod->sqnum = le64_to_cpu(ch->sqnum); in ubifs_add_snod()
199 snod->type = ch->node_type; in ubifs_add_snod()
200 snod->offs = offs; in ubifs_add_snod()
201 snod->len = le32_to_cpu(ch->len); in ubifs_add_snod()
202 snod->node = buf; in ubifs_add_snod()
213 key_read(c, &ino->key, &snod->key); in ubifs_add_snod()
216 invalid_key_init(c, &snod->key); in ubifs_add_snod()
[all …]
H A Dmaster.c33 struct ubifs_scan_node *snod; in scan_for_master() local
43 snod = list_entry(sleb->nodes.prev, struct ubifs_scan_node, in scan_for_master()
45 if (snod->type != UBIFS_MST_NODE) in scan_for_master()
47 memcpy(c->mst_node, snod->node, snod->len); in scan_for_master()
48 offs = snod->offs; in scan_for_master()
61 snod = list_entry(sleb->nodes.prev, struct ubifs_scan_node, list); in scan_for_master()
62 if (snod->type != UBIFS_MST_NODE) in scan_for_master()
64 if (snod->offs != offs) in scan_for_master()
67 (void *)snod->node + UBIFS_CH_SZ, in scan_for_master()
80 snod->type, lnum, snod->offs); in scan_for_master()
H A Drecovery.c505 struct ubifs_scan_node *snod; in fix_unclean_leb() local
507 snod = list_entry(sleb->nodes.prev, in fix_unclean_leb()
509 endpt = snod->offs + snod->len; in fix_unclean_leb()
574 struct ubifs_scan_node *snod; in drop_last_group() local
577 snod = list_entry(sleb->nodes.prev, struct ubifs_scan_node, in drop_last_group()
579 ch = snod->node; in drop_last_group()
584 sleb->lnum, snod->offs); in drop_last_group()
585 *offs = snod->offs; in drop_last_group()
586 list_del(&snod->list); in drop_last_group()
587 kfree(snod); in drop_last_group()
[all …]
H A Dorphan.c554 struct ubifs_scan_node *snod; in do_kill_orphans() local
560 list_for_each_entry(snod, &sleb->nodes, list) { in do_kill_orphans()
561 if (snod->type != UBIFS_ORPH_NODE) { in do_kill_orphans()
563 snod->type, sleb->lnum, snod->offs); in do_kill_orphans()
564 ubifs_dump_node(c, snod->node); in do_kill_orphans()
568 orph = snod->node; in do_kill_orphans()
590 cmt_no, sleb->lnum, snod->offs); in do_kill_orphans()
591 ubifs_dump_node(c, snod->node); in do_kill_orphans()
618 cmt_no, sleb->lnum, snod->offs); in do_kill_orphans()
848 struct ubifs_scan_node *snod; in dbg_read_orphans() local
[all …]
H A Dlprops.c1026 struct ubifs_scan_node *snod; in scan_check_cb() local
1119 list_for_each_entry(snod, &sleb->nodes, list) { in scan_check_cb()
1125 is_idx = (snod->type == UBIFS_IDX_NODE) ? 1 : 0; in scan_check_cb()
1127 if (is_idx && snod->type != UBIFS_IDX_NODE) { in scan_check_cb()
1129 lnum, snod->offs); in scan_check_cb()
1133 if (snod->type == UBIFS_IDX_NODE) { in scan_check_cb()
1134 struct ubifs_idx_node *idx = snod->node; in scan_check_cb()
1136 key_read(c, ubifs_idx_key(c, idx), &snod->key); in scan_check_cb()
1140 found = ubifs_tnc_has_node(c, &snod->key, level, lnum, in scan_check_cb()
1141 snod->offs, is_idx); in scan_check_cb()
[all …]
H A Dlog.c628 struct ubifs_scan_node *snod; in ubifs_consolidate_log() local
646 list_for_each_entry(snod, &sleb->nodes, list) { in ubifs_consolidate_log()
647 switch (snod->type) { in ubifs_consolidate_log()
649 struct ubifs_ref_node *ref = snod->node; in ubifs_consolidate_log()
657 &offs, snod->node); in ubifs_consolidate_log()
667 snod->node); in ubifs_consolidate_log()
H A Ddebug.c807 struct ubifs_scan_node *snod; in ubifs_dump_sleb() local
812 list_for_each_entry(snod, &sleb->nodes, list) { in ubifs_dump_sleb()
815 sleb->lnum, snod->offs, snod->len); in ubifs_dump_sleb()
816 ubifs_dump_node(c, snod->node); in ubifs_dump_sleb()
823 struct ubifs_scan_node *snod; in ubifs_dump_leb() local
843 list_for_each_entry(snod, &sleb->nodes, list) { in ubifs_dump_leb()
846 snod->offs, snod->len); in ubifs_dump_leb()
847 ubifs_dump_node(c, snod->node); in ubifs_dump_leb()