Home
last modified time | relevance | path

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

/linux/fs/jffs2/
H 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 …]
H 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()
H 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()
H 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()
H A Derase.c308 jeb->first_node = jeb->last_node = NULL; in jffs2_free_jeb_node_refs()
H A Dnodelist.h291 struct jffs2_raw_node_ref *last_node; member
/linux/include/linux/sched/
H A Dnuma_balancing.h29 extern void task_numa_fault(int last_node, int node, int pages, int flags);
36 static inline void task_numa_fault(int last_node, int node, int pages, in task_numa_fault() argument
/linux/lib/
H A Dlist-test.c1211 static struct klist_node *last_node; variable
1216 last_node = node_ptr; in check_node()
1222 last_node = node_ptr; in check_delete_node()
1236 KUNIT_EXPECT_PTR_EQ(test, last_node, &a); in klist_test_add_tail()
1240 KUNIT_EXPECT_PTR_EQ(test, last_node, &b); in klist_test_add_tail()
1264 KUNIT_EXPECT_PTR_EQ(test, last_node, &a); in klist_test_add_head()
1268 KUNIT_EXPECT_PTR_EQ(test, last_node, &b); in klist_test_add_head()
1295 KUNIT_EXPECT_PTR_EQ(test, last_node, &c); in klist_test_add_behind()
1299 KUNIT_EXPECT_PTR_EQ(test, last_node, &d); in klist_test_add_behind()
1327 KUNIT_EXPECT_PTR_EQ(test, last_node, &c); in klist_test_add_before()
[all …]
/linux/arch/sparc/kernel/
H A Dmdesc.c634 u64 last_node = hp->mdesc.node_sz / 16; in mdesc_node_by_name() local
639 } else if (from_node >= last_node) { in mdesc_node_by_name()
645 while (ret < last_node) { in mdesc_node_by_name()
652 if (ret >= last_node) in mdesc_node_by_name()
662 u64 last_node = hp->mdesc.node_sz / 16; in mdesc_get_property() local
666 if (node == MDESC_NODE_NULL || node >= last_node) in mdesc_get_property()
708 u64 last_node = hp->mdesc.node_sz / 16; in mdesc_next_arc() local
710 if (from == MDESC_NODE_NULL || from >= last_node) in mdesc_next_arc()
744 u64 last_node = hp->mdesc.node_sz / 16; in mdesc_node_name() local
746 if (node == MDESC_NODE_NULL || node >= last_node) in mdesc_node_name()
/linux/drivers/net/ethernet/apm/xgene/
H A Dxgene_enet_cle.c78 SET_VAL(CLE_DN_LASTN, dn->last_node) | in xgene_cle_dn_to_hw()
200 .last_node = 0,
236 .last_node = 0,
284 .last_node = 0,
369 .last_node = 0,
454 .last_node = 0,
540 .last_node = 1,
H A Dxgene_enet_cle.h212 bool last_node; member
/linux/drivers/iommu/iommufd/
H A Dio_pagetable.h132 struct iopt_##name *last_node, unsigned long start, \
137 node = interval_tree_iter_next(&last_node->node, start, last); \
/linux/drivers/android/
H A Dbinder.c6130 struct binder_node *last_node = NULL; in print_binder_proc() local
6155 if (last_node) in print_binder_proc()
6156 binder_put_node(last_node); in print_binder_proc()
6160 last_node = node; in print_binder_proc()
6164 if (last_node) in print_binder_proc()
6165 binder_put_node(last_node); in print_binder_proc()
6372 if (last_node) in state_show()
6373 binder_put_node(last_node); in state_show()
6377 last_node = node; in state_show()
6381 if (last_node) in state_show()
[all …]