Home
last modified time | relevance | path

Searched refs:last_node (Results 1 – 8 of 8) sorted by relevance

/fs/jffs2/
A Dnodelist.c595 ref = jeb->last_node; in jffs2_link_node_ref()
620 ref_offset(jeb->last_node), in jffs2_link_node_ref()
621 ref_offset(jeb->last_node)+last_len); in jffs2_link_node_ref()
624 jeb->last_node = ref; in jffs2_link_node_ref()
673 if (jeb->last_node && ref_obsolete(jeb->last_node)) { in jffs2_scan_dirty_space()
675 jeb->last_node->__totlen += size; in jffs2_scan_dirty_space()
706 if (unlikely(ref != jeb->last_node)) { in __ref_totlen()
708 ref, ref_offset(ref), jeb->last_node, in __ref_totlen()
709 jeb->last_node ? in __ref_totlen()
710 ref_offset(jeb->last_node) : 0); in __ref_totlen()
[all …]
A Dmalloc.c193 p = &jeb->last_node; in jffs2_prealloc_raw_node_refs()
220 nr, jeb->offset, jeb->last_node, jeb->last_node->flash_offset, in jffs2_prealloc_raw_node_refs()
221 jeb->last_node->next_in_ino); in jffs2_prealloc_raw_node_refs()
A Dwbuf.c294 BUG_ON(!ref_obsolete(jeb->last_node)); in jffs2_wbuf_recover()
325 end = ref_offset(jeb->last_node); in jffs2_wbuf_recover()
329 while ((raw = ref_next(raw)) != jeb->last_node) in jffs2_wbuf_recover()
463 for (raw = first_raw; raw != jeb->last_node; raw = ref_next(raw)) { in jffs2_wbuf_recover()
A Ddebug.c335 if ((!ref_next(ref2)) != (ref2 == jeb->last_node)) { in __jffs2_dbg_acct_paranoia_check_nolock()
338 ref_offset(jeb->last_node), jeb->last_node); in __jffs2_dbg_acct_paranoia_check_nolock()
A Derase.c308 jeb->first_node = jeb->last_node = NULL; in jffs2_free_jeb_node_refs()
A Dnodelist.h291 struct jffs2_raw_node_ref *last_node; member
/fs/bcachefs/
A Dprogress.c45 s->nodes_seen += b != s->last_node; in bch2_progress_update_iter()
46 s->last_node = b; in bch2_progress_update_iter()
A Dprogress.h20 struct btree *last_node; member

Completed in 14 milliseconds