/linux-6.12.1/fs/jffs2/ |
D | nodelist.c | 520 c->blocks[i].first_node = c->blocks[i].last_node = NULL; in jffs2_free_raw_node_refs() 595 ref = jeb->last_node; in jffs2_link_node_ref() 616 uint32_t last_len = ref_totlen(c, jeb, 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() [all …]
|
D | malloc.c | 193 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()
|
D | wbuf.c | 294 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()
|
D | debug.c | 335 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()
|
D | erase.c | 308 jeb->first_node = jeb->last_node = NULL; in jffs2_free_jeb_node_refs()
|
D | nodelist.h | 291 struct jffs2_raw_node_ref *last_node; member
|
/linux-6.12.1/include/linux/sched/ |
D | numa_balancing.h | 29 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-6.12.1/lib/ |
D | list-test.c | 1209 static struct klist_node *last_node; variable 1214 last_node = node_ptr; in check_node() 1220 last_node = node_ptr; in check_delete_node() 1234 KUNIT_EXPECT_PTR_EQ(test, last_node, &a); in klist_test_add_tail() 1238 KUNIT_EXPECT_PTR_EQ(test, last_node, &b); in klist_test_add_tail() 1262 KUNIT_EXPECT_PTR_EQ(test, last_node, &a); in klist_test_add_head() 1266 KUNIT_EXPECT_PTR_EQ(test, last_node, &b); in klist_test_add_head() 1293 KUNIT_EXPECT_PTR_EQ(test, last_node, &c); in klist_test_add_behind() 1297 KUNIT_EXPECT_PTR_EQ(test, last_node, &d); in klist_test_add_behind() 1325 KUNIT_EXPECT_PTR_EQ(test, last_node, &c); in klist_test_add_before() [all …]
|
/linux-6.12.1/arch/sparc/kernel/ |
D | mdesc.c | 634 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-6.12.1/drivers/net/ethernet/apm/xgene/ |
D | xgene_enet_cle.c | 78 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,
|
D | xgene_enet_cle.h | 212 bool last_node; member
|
/linux-6.12.1/drivers/iommu/iommufd/ |
D | io_pagetable.h | 132 struct iopt_##name *last_node, unsigned long start, \ 137 node = interval_tree_iter_next(&last_node->node, start, last); \
|
/linux-6.12.1/fs/bcachefs/ |
D | backpointers.c | 798 struct btree *last_node; member 841 s->nodes_seen += b != s->last_node; in progress_update_iter() 842 s->last_node = b; in progress_update_iter()
|
/linux-6.12.1/drivers/android/ |
D | binder.c | 6486 struct binder_node *last_node = NULL; in print_binder_proc() local 6511 if (last_node) in print_binder_proc() 6512 binder_put_node(last_node); in print_binder_proc() 6516 last_node = node; in print_binder_proc() 6520 if (last_node) in print_binder_proc() 6521 binder_put_node(last_node); in print_binder_proc() 6719 struct binder_node *last_node = NULL; in state_show() local 6734 if (last_node) in state_show() 6735 binder_put_node(last_node); in state_show() 6739 last_node = node; in state_show() [all …]
|