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

/linux-master/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);
H A Dmmzone.h1722 nid = first_node(*nodes);
/linux-master/drivers/gpu/drm/etnaviv/
H A Detnaviv_drv.c601 struct device_node *first_node = NULL; local
645 first_node = etnaviv_of_first_available_node();
646 if (first_node) {
647 of_dma_configure(&pdev->dev, first_node, true);
648 of_node_put(first_node);
/linux-master/tools/perf/ui/gtk/
H A Dhists.c510 bool first_node, first_col; local
543 first_node = true;
545 if (!first_node)
547 first_node = false;
/linux-master/arch/x86/kernel/cpu/
H A Dhygon.c40 return first_node(node_online_map); /* Shouldn't happen */
H A Damd.c293 return first_node(node_online_map); /* Shouldn't happen */
/linux-master/kernel/bpf/
H A Dbpf_lru_list.c148 struct bpf_lru_node *node, *tmp_node, *first_node; local
151 first_node = list_first_entry(active, struct bpf_lru_node, list);
158 if (++i == lru->nr_scans || node == first_node)
/linux-master/fs/jffs2/
H A Derase.c293 block = ref = jeb->first_node;
308 jeb->first_node = jeb->last_node = NULL;
H A Dnodelist.c510 this = c->blocks[i].first_node;
520 c->blocks[i].first_node = c->blocks[i].last_node = NULL;
612 if (!jeb->first_node) {
613 jeb->first_node = ref;
H A Dscan.c313 && (!jeb->first_node || !ref_next(jeb->first_node)) )
694 c->cleanmarker_size && !jeb->dirty_size && !ref_next(jeb->first_node)) {
880 } else if (jeb->first_node) {
H A Ddebug.c316 struct jffs2_raw_node_ref *ref2 = jeb->first_node;
408 if (!jeb->first_node) {
414 for (ref = jeb->first_node; ; ref = ref_next(ref)) {
H A Dwbuf.c150 if (jeb->first_node) {
298 for (next = raw = jeb->first_node; next; raw = next) {
550 if (first_raw == jeb->first_node) {
H A Dnodelist.h290 struct jffs2_raw_node_ref *first_node; member in struct:jffs2_eraseblock
H A Dnodemgmt.c470 !jeb->first_node->next_in_ino) {
478 jffs2_mark_node_obsolete(c, jeb->first_node);
H A Dsummary.c629 } else if (jeb->first_node) {
H A Dgc.c100 ret->gc_node = ret->first_node;
/linux-master/tools/perf/ui/stdio/
H A Dhist.c635 bool first_node, first_col; local
659 first_node = true;
661 if (!first_node)
663 first_node = false;
/linux-master/tools/testing/selftests/mm/
H A Dksm_tests.c492 int first_node; local
511 first_node = get_first_mem_node();
512 numa1_map_ptr = numa_alloc_onnode(page_size, first_node);
513 numa2_map_ptr = numa_alloc_onnode(page_size, get_next_mem_node(first_node));
/linux-master/mm/
H A Dmempolicy.c250 node_set(first_node(*nodes), pol->nodes);
1933 return first_node(policy->nodes);
2004 nid = first_node(nodemask);
2034 nid = first_node(nodemask);
2052 *nid = first_node(pol->nodes);
2759 polnid = first_node(pol->nodes);
3176 * we use first_node(nodes) to grab a single node, so here
3246 node_set(first_node(nodes), new->nodes);
/linux-master/drivers/block/
H A Dpktcdvd.c1134 struct pkt_rb_node *node, *first_node; local
1148 first_node = pkt_rbtree_find(pd, pd->current_sector);
1149 if (!first_node) {
1152 first_node = rb_entry(n, struct pkt_rb_node, rb_node);
1154 node = first_node;
1172 if (node == first_node)
/linux-master/arch/loongarch/kernel/
H A Dsmp.c460 rr_node = first_node(node_online_map);
/linux-master/tools/perf/ui/browsers/
H A Dhists.c1693 bool first_node, first_col; local
1699 first_node = true;
1715 first_node = false;
1718 if (!first_node) {
1725 first_node = true;
1727 if (!first_node) {
1732 first_node = false;
/linux-master/arch/x86/mm/
H A Dnuma.c595 rr = first_node(node_online_map);
/linux-master/arch/sparc/kernel/
H A Dhead_32.S379 or %g0, %g0, %o0 ! next_node(0) = first_node
/linux-master/drivers/clk/
H A Dclk.c3416 bool first_node = true; local
3430 if (!first_node)
3432 first_node = false;

Completed in 231 milliseconds