Searched refs:last_node (Results 1 - 8 of 8) sorted by relevance
/linux-4.4.14/fs/jffs2/ |
H A D | malloc.c | 209 p = &jeb->last_node; jffs2_prealloc_raw_node_refs() 214 /* If jeb->last_node is really a valid node then skip over it */ jffs2_prealloc_raw_node_refs() 235 dbg_memalloc("Reserved %d refs for block @0x%08x, last_node is %p (%08x,%p)\n", jffs2_prealloc_raw_node_refs() 236 nr, jeb->offset, jeb->last_node, jeb->last_node->flash_offset, jffs2_prealloc_raw_node_refs() 237 jeb->last_node->next_in_ino); jffs2_prealloc_raw_node_refs()
|
H A D | nodelist.c | 520 c->blocks[i].first_node = c->blocks[i].last_node = NULL; jffs2_free_raw_node_refs() 595 ref = jeb->last_node; jffs2_link_node_ref() 616 uint32_t last_len = ref_totlen(c, jeb, jeb->last_node); jffs2_link_node_ref() 620 ref_offset(jeb->last_node), jffs2_link_node_ref() 621 ref_offset(jeb->last_node)+last_len); jffs2_link_node_ref() 624 jeb->last_node = ref; jffs2_link_node_ref() 673 if (jeb->last_node && ref_obsolete(jeb->last_node)) { jffs2_scan_dirty_space() 675 jeb->last_node->__totlen += size; jffs2_scan_dirty_space() 706 if (unlikely(ref != jeb->last_node)) { __ref_totlen() 707 pr_crit("ref %p @0x%08x is not jeb->last_node (%p @0x%08x)\n", __ref_totlen() 708 ref, ref_offset(ref), jeb->last_node, __ref_totlen() 709 jeb->last_node ? __ref_totlen() 710 ref_offset(jeb->last_node) : 0); __ref_totlen() 738 pr_crit("No next ref. jeb->last_node is %p\n", __jffs2_ref_totlen() 739 jeb->last_node); __jffs2_ref_totlen()
|
H A D | debug.c | 335 if ((!ref_next(ref2)) != (ref2 == jeb->last_node)) { __jffs2_dbg_acct_paranoia_check_nolock() 336 JFFS2_ERROR("node_ref for node at %#08x (mem %p) has next at %#08x (mem %p), last_node is at %#08x (mem %p).\n", __jffs2_dbg_acct_paranoia_check_nolock() 338 ref_offset(jeb->last_node), jeb->last_node); __jffs2_dbg_acct_paranoia_check_nolock()
|
H A D | wbuf.c | 294 BUG_ON(!ref_obsolete(jeb->last_node)); jffs2_wbuf_recover() 325 end = ref_offset(jeb->last_node); jffs2_wbuf_recover() 329 while ((raw = ref_next(raw)) != jeb->last_node) jffs2_wbuf_recover() 463 for (raw = first_raw; raw != jeb->last_node; raw = ref_next(raw)) { jffs2_wbuf_recover()
|
H A D | erase.c | 337 jeb->first_node = jeb->last_node = NULL; jffs2_free_jeb_node_refs()
|
H A D | nodelist.h | 291 struct jffs2_raw_node_ref *last_node; member in struct:jffs2_eraseblock
|
/linux-4.4.14/arch/sparc/kernel/ |
H A D | mdesc.c | 390 u64 last_node = hp->mdesc.node_sz / 16; mdesc_node_by_name() local 395 } else if (from_node >= last_node) { mdesc_node_by_name() 401 while (ret < last_node) { mdesc_node_by_name() 408 if (ret >= last_node) mdesc_node_by_name() 418 u64 last_node = hp->mdesc.node_sz / 16; mdesc_get_property() local 422 if (node == MDESC_NODE_NULL || node >= last_node) mdesc_get_property() 464 u64 last_node = hp->mdesc.node_sz / 16; mdesc_next_arc() local 466 if (from == MDESC_NODE_NULL || from >= last_node) mdesc_next_arc() 500 u64 last_node = hp->mdesc.node_sz / 16; mdesc_node_name() local 502 if (node == MDESC_NODE_NULL || node >= last_node) mdesc_node_name()
|
/linux-4.4.14/include/linux/ |
H A D | sched.h | 1844 extern void task_numa_fault(int last_node, int node, int pages, int flags); 1851 static inline void task_numa_fault(int last_node, int node, int pages, task_numa_fault() argument
|
Completed in 179 milliseconds