Home
last modified time | relevance | path

Searched refs:first_node (Results 1 - 25 of 48) sorted by relevance

12

/kernel/linux/linux-6.6/include/linux/
H A Dnodemask.h45 * unsigned int first_node(mask) Number lowest set bit, or MAX_NUMNODES
263 #define first_node(src) __first_node(&(src)) macro
387 for ((node) = first_node(mask); \
444 #define first_online_node first_node(node_states[N_ONLINE])
445 #define first_memory_node first_node(node_states[N_MEMORY])
516 bit = first_node(*maskp); in node_random()
/kernel/linux/linux-6.6/drivers/gpu/drm/etnaviv/
H A Detnaviv_drv.c590 struct device_node *first_node = NULL; in etnaviv_pdev_probe() local
600 if (!first_node) in etnaviv_pdev_probe()
601 first_node = core_node; in etnaviv_pdev_probe()
637 if (first_node) in etnaviv_pdev_probe()
638 of_dma_configure(&pdev->dev, first_node, true); in etnaviv_pdev_probe()
/kernel/linux/linux-5.10/include/linux/
H A Dnodemask.h45 * unsigned int first_node(mask) Number lowest set bit, or MAX_NUMNODES
262 #define first_node(src) __first_node(&(src)) macro
379 for ((node) = first_node(mask); \
436 #define first_online_node first_node(node_states[N_ONLINE])
437 #define first_memory_node first_node(node_states[N_MEMORY])
/kernel/linux/linux-5.10/tools/perf/ui/gtk/
H A Dhists.c510 bool first_node, first_col; in perf_gtk__show_hierarchy() local
543 first_node = true; in perf_gtk__show_hierarchy()
545 if (!first_node) in perf_gtk__show_hierarchy()
547 first_node = false; in perf_gtk__show_hierarchy()
/kernel/linux/linux-6.6/tools/perf/ui/gtk/
H A Dhists.c510 bool first_node, first_col; in perf_gtk__show_hierarchy() local
543 first_node = true; in perf_gtk__show_hierarchy()
545 if (!first_node) in perf_gtk__show_hierarchy()
547 first_node = false; in perf_gtk__show_hierarchy()
/kernel/linux/linux-6.6/tools/testing/selftests/mm/
H A Dksm_tests.c492 int first_node; in check_ksm_numa_merge() local
511 first_node = get_first_mem_node(); in check_ksm_numa_merge()
512 numa1_map_ptr = numa_alloc_onnode(page_size, first_node); in check_ksm_numa_merge()
513 numa2_map_ptr = numa_alloc_onnode(page_size, get_next_mem_node(first_node)); in check_ksm_numa_merge()
/kernel/linux/linux-5.10/tools/perf/ui/stdio/
H A Dhist.c635 bool first_node, first_col; in hists__fprintf_hierarchy_headers() local
659 first_node = true; in hists__fprintf_hierarchy_headers()
661 if (!first_node) in hists__fprintf_hierarchy_headers()
663 first_node = false; in hists__fprintf_hierarchy_headers()
/kernel/linux/linux-5.10/fs/jffs2/
H A Dnodelist.c510 this = c->blocks[i].first_node; in jffs2_free_raw_node_refs()
520 c->blocks[i].first_node = c->blocks[i].last_node = NULL; in jffs2_free_raw_node_refs()
612 if (!jeb->first_node) { in jffs2_link_node_ref()
613 jeb->first_node = ref; in jffs2_link_node_ref()
H A Derase.c295 block = ref = jeb->first_node; in jffs2_free_jeb_node_refs()
310 jeb->first_node = jeb->last_node = NULL; in jffs2_free_jeb_node_refs()
H A Ddebug.c316 struct jffs2_raw_node_ref *ref2 = jeb->first_node; in __jffs2_dbg_acct_paranoia_check_nolock()
408 if (!jeb->first_node) { in __jffs2_dbg_dump_node_refs_nolock()
414 for (ref = jeb->first_node; ; ref = ref_next(ref)) { in __jffs2_dbg_dump_node_refs_nolock()
H A Dscan.c313 && (!jeb->first_node || !ref_next(jeb->first_node)) ) in jffs2_scan_classify_jeb()
694 c->cleanmarker_size && !jeb->dirty_size && !ref_next(jeb->first_node)) { in jffs2_scan_eraseblock()
880 } else if (jeb->first_node) { in jffs2_scan_eraseblock()
/kernel/linux/linux-6.6/fs/jffs2/
H A Dnodelist.c510 this = c->blocks[i].first_node; in jffs2_free_raw_node_refs()
520 c->blocks[i].first_node = c->blocks[i].last_node = NULL; in jffs2_free_raw_node_refs()
612 if (!jeb->first_node) { in jffs2_link_node_ref()
613 jeb->first_node = ref; in jffs2_link_node_ref()
H A Derase.c293 block = ref = jeb->first_node; in jffs2_free_jeb_node_refs()
308 jeb->first_node = jeb->last_node = NULL; in jffs2_free_jeb_node_refs()
H A Ddebug.c316 struct jffs2_raw_node_ref *ref2 = jeb->first_node; in __jffs2_dbg_acct_paranoia_check_nolock()
408 if (!jeb->first_node) { in __jffs2_dbg_dump_node_refs_nolock()
414 for (ref = jeb->first_node; ; ref = ref_next(ref)) { in __jffs2_dbg_dump_node_refs_nolock()
H A Dscan.c313 && (!jeb->first_node || !ref_next(jeb->first_node)) ) in jffs2_scan_classify_jeb()
694 c->cleanmarker_size && !jeb->dirty_size && !ref_next(jeb->first_node)) { in jffs2_scan_eraseblock()
880 } else if (jeb->first_node) { in jffs2_scan_eraseblock()
/kernel/linux/linux-6.6/tools/perf/ui/stdio/
H A Dhist.c635 bool first_node, first_col; in hists__fprintf_hierarchy_headers() local
659 first_node = true; in hists__fprintf_hierarchy_headers()
661 if (!first_node) in hists__fprintf_hierarchy_headers()
663 first_node = false; in hists__fprintf_hierarchy_headers()
/kernel/linux/linux-5.10/kernel/bpf/
H A Dbpf_lru_list.c148 struct bpf_lru_node *node, *tmp_node, *first_node; in __bpf_lru_list_rotate_active() local
151 first_node = list_first_entry(active, struct bpf_lru_node, list); in __bpf_lru_list_rotate_active()
158 if (++i == lru->nr_scans || node == first_node) in __bpf_lru_list_rotate_active()
/kernel/linux/linux-6.6/kernel/bpf/
H A Dbpf_lru_list.c148 struct bpf_lru_node *node, *tmp_node, *first_node; in __bpf_lru_list_rotate_active() local
151 first_node = list_first_entry(active, struct bpf_lru_node, list); in __bpf_lru_list_rotate_active()
158 if (++i == lru->nr_scans || node == first_node) in __bpf_lru_list_rotate_active()
/kernel/linux/linux-6.6/mm/
H A Dmempolicy.c216 node_set(first_node(*nodes), pol->nodes); in mpol_new_preferred()
1889 nd = first_node(policy->nodes); in policy_node()
1937 return first_node(policy->nodes); in mempolicy_slab_node()
1981 * Between first_node() and next_node(), pol->nodes could be changed in offset_il_node()
1990 nid = first_node(nodemask); in offset_il_node()
2236 hpage_node = first_node(pol->nodes); in vma_alloc_folio()
2611 polnid = first_node(pol->nodes); in mpol_misplaced()
3036 * we use first_node(nodes) to grab a single node, so here in mpol_parse_str()
3105 node_set(first_node(nodes), new->nodes); in mpol_parse_str()
/kernel/linux/linux-5.10/mm/
H A Dmempolicy.c208 pol->v.preferred_node = first_node(*nodes); in mpol_new_preferred()
350 int node = first_node(pol->w.user_nodemask); in mpol_rebind_preferred()
359 pol->v.preferred_node = first_node(tmp); in mpol_rebind_preferred()
1970 nid = first_node(pol->v.nodes); in offset_il_node()
2901 * we use first_node(nodes) to grab a single node, so here in mpol_parse_str()
2969 new->v.preferred_node = first_node(nodes); in mpol_parse_str()
/kernel/linux/linux-5.10/arch/loongarch/kernel/
H A Dsmp.c236 rr_node = first_node(node_online_map); in smp_prepare_boot_cpu()
/kernel/linux/linux-5.10/arch/x86/kernel/cpu/
H A Dhygon.c50 return first_node(node_online_map); /* Shouldn't happen */ in nearby_node()
/kernel/linux/linux-6.6/arch/x86/kernel/cpu/
H A Dhygon.c48 return first_node(node_online_map); /* Shouldn't happen */ in nearby_node()
/kernel/linux/linux-5.10/drivers/block/
H A Dpktcdvd.c1108 struct pkt_rb_node *node, *first_node; in pkt_handle_queue() local
1123 first_node = pkt_rbtree_find(pd, pd->current_sector); in pkt_handle_queue()
1124 if (!first_node) { in pkt_handle_queue()
1127 first_node = rb_entry(n, struct pkt_rb_node, rb_node); in pkt_handle_queue()
1129 node = first_node; in pkt_handle_queue()
1147 if (node == first_node) in pkt_handle_queue()
/kernel/linux/linux-6.6/drivers/block/
H A Dpktcdvd.c1126 struct pkt_rb_node *node, *first_node; in pkt_handle_queue() local
1140 first_node = pkt_rbtree_find(pd, pd->current_sector); in pkt_handle_queue()
1141 if (!first_node) { in pkt_handle_queue()
1144 first_node = rb_entry(n, struct pkt_rb_node, rb_node); in pkt_handle_queue()
1146 node = first_node; in pkt_handle_queue()
1164 if (node == first_node) in pkt_handle_queue()

Completed in 37 milliseconds

12