Home
last modified time | relevance | path

Searched refs:nodes (Results 1 – 25 of 1186) sorted by relevance

12345678910>>...48

/linux-6.3-rc2/lib/
A Dinterval_tree.c32 state->nodes[0] = cur; in interval_tree_span_iter_next_gap()
35 state->nodes[0] = cur; in interval_tree_span_iter_next_gap()
40 state->nodes[1] = cur; in interval_tree_span_iter_next_gap()
50 iter->nodes[0] = NULL; in interval_tree_span_iter_first()
51 iter->nodes[1] = in interval_tree_span_iter_first()
53 if (!iter->nodes[1]) { in interval_tree_span_iter_first()
76 iter->nodes[0] = NULL; in interval_tree_span_iter_first()
77 iter->nodes[1] = NULL; in interval_tree_span_iter_first()
84 if (!iter->nodes[0] && !iter->nodes[1]) { in interval_tree_span_iter_next()
101 if (!iter->nodes[1]) { in interval_tree_span_iter_next()
[all …]
A Dinterval_tree_test.c24 static struct interval_tree_node *nodes = NULL; variable
49 nodes[i].start = a; in init()
50 nodes[i].last = b; in init()
68 nodes = kmalloc_array(nnodes, sizeof(struct interval_tree_node), in interval_tree_test_init()
70 if (!nodes) in interval_tree_test_init()
75 kfree(nodes); in interval_tree_test_init()
88 interval_tree_insert(nodes + j, &root); in interval_tree_test_init()
90 interval_tree_remove(nodes + j, &root); in interval_tree_test_init()
102 interval_tree_insert(nodes + j, &root); in interval_tree_test_init()
124 kfree(nodes); in interval_tree_test_init()
A Drbtree_test.c28 static struct test_node *nodes = NULL; variable
248 nodes = kmalloc_array(nnodes, sizeof(*nodes), GFP_KERNEL); in rbtree_test_init()
249 if (!nodes) in rbtree_test_init()
261 insert(nodes + j, &root); in rbtree_test_init()
263 erase(nodes + j, &root); in rbtree_test_init()
279 erase_cached(nodes + j, &root); in rbtree_test_init()
290 insert(nodes + i, &root); in rbtree_test_init()
330 erase(nodes + i, &root); in rbtree_test_init()
337 insert(nodes + j, &root); in rbtree_test_init()
341 erase(nodes + j, &root); in rbtree_test_init()
[all …]
/linux-6.3-rc2/drivers/gpu/drm/tests/
A Ddrm_mm_test.c259 memset(nodes, 0, sizeof(nodes)); in drm_test_mm_debug()
264 nodes[0].start, nodes[0].size); in drm_test_mm_debug()
267 nodes[1].start = 4096 - 512 - nodes[1].size; in drm_test_mm_debug()
270 nodes[0].start, nodes[0].size); in drm_test_mm_debug()
366 nodes = vzalloc(array_size(count, sizeof(*nodes))); in __drm_test_mm_reserve()
542 nodes = vmalloc(array_size(count, sizeof(*nodes))); in __drm_test_mm_insert()
829 nodes = vzalloc(array_size(count, sizeof(*nodes))); in __drm_test_mm_insert_range()
1407 nodes = vzalloc(array_size(size, sizeof(*nodes))); in drm_test_mm_evict()
1498 nodes = vzalloc(array_size(size, sizeof(*nodes))); in drm_test_mm_evict_range()
1585 nodes = vzalloc(array_size(count, sizeof(*nodes))); in drm_test_mm_topdown()
[all …]
/linux-6.3-rc2/Documentation/sphinx/
A DrstFlatTable.py45 from docutils import nodes
94 class rowSpan(nodes.General, nodes.Element): pass # pylint: disable=C0103,C0321
95 class colSpan(nodes.General, nodes.Element): pass # pylint: disable=C0103,C0321
156 table = nodes.table()
157 tgroup = nodes.tgroup(cols=len(colwidths))
176 thead = nodes.thead()
181 tbody = nodes.tbody()
190 row = nodes.row()
201 entry = nodes.entry(**attributes)
323 if (isinstance(child , nodes.comment)
[all …]
A Dautomarkup.py7 from docutils import nodes
110 repl.append(nodes.Text(t[done:m.start()]))
120 repl.append(nodes.Text(t[done:]))
143 target_text = nodes.Text(match.group(0))
154 lit_text = nodes.literal(classes=['xref', 'c', 'c-func'])
203 target_text = nodes.Text(match.group(0))
214 lit_text = nodes.literal(classes=['xref', 'c', class_str[match.re]])
268 return nodes.Text(match.group(0))
286 if not isinstance(node, nodes.Text) or isinstance(node.parent, nodes.literal):
292 if isinstance(parent, nodes.Referential):
[all …]
/linux-6.3-rc2/drivers/md/persistent-data/
A Ddm-btree-spine.c128 s->nodes[0] = NULL; in init_ro_spine()
129 s->nodes[1] = NULL; in init_ro_spine()
137 unlock_block(s->info, s->nodes[i]); in exit_ro_spine()
145 unlock_block(s->info, s->nodes[0]); in ro_step()
146 s->nodes[0] = s->nodes[1]; in ro_step()
161 unlock_block(s->info, s->nodes[s->count]); in ro_pop()
169 block = s->nodes[s->count - 1]; in ro_node()
187 unlock_block(s->info, s->nodes[i]); in exit_shadow_spine()
196 unlock_block(s->info, s->nodes[0]); in shadow_step()
197 s->nodes[0] = s->nodes[1]; in shadow_step()
[all …]
/linux-6.3-rc2/mm/
A Dmempolicy.c202 pol->nodes = *nodes; in mpol_new_nodemask()
212 node_set(first_node(*nodes), pol->nodes); in mpol_new_preferred()
270 if (nodes && !nodes_empty(*nodes)) in mpol_new()
334 tmp = *nodes; in mpol_rebind_nodemask()
903 *nodes = p->nodes; in get_policy_nodemask()
2305 int nodes; in alloc_pages_bulk_array_interleave() local
2312 nodes = nodes_weight(pol->nodes); in alloc_pages_bulk_array_interleave()
2448 return !!nodes_equal(a->nodes, b->nodes); in __mpol_equal()
3081 new->nodes = nodes; in mpol_parse_str()
3084 node_set(first_node(nodes), new->nodes); in mpol_parse_str()
[all …]
/linux-6.3-rc2/tools/perf/tests/
A Dmem2node.c50 struct memory_node nodes[3]; in test__mem2node() local
52 .memory_nodes = (struct memory_node *) &nodes[0], in test__mem2node()
53 .nr_memory_nodes = ARRAY_SIZE(nodes), in test__mem2node()
58 for (i = 0; i < ARRAY_SIZE(nodes); i++) { in test__mem2node()
59 nodes[i].node = test_nodes[i].node; in test__mem2node()
60 nodes[i].size = 10; in test__mem2node()
63 (nodes[i].set = get_bitmap(test_nodes[i].map, 10))); in test__mem2node()
75 for (i = 0; i < ARRAY_SIZE(nodes); i++) in test__mem2node()
76 zfree(&nodes[i].set); in test__mem2node()
/linux-6.3-rc2/arch/arm/mach-sunxi/
A Dmc_smp.c709 of_node_put(nodes->prcm_node); in sunxi_mc_smp_put_nodes()
711 of_node_put(nodes->sram_node); in sunxi_mc_smp_put_nodes()
713 memset(nodes, 0, sizeof(*nodes)); in sunxi_mc_smp_put_nodes()
720 if (!nodes->prcm_node) { in sun9i_a80_get_smp_nodes()
727 if (!nodes->cpucfg_node) { in sun9i_a80_get_smp_nodes()
734 if (!nodes->sram_node) { in sun9i_a80_get_smp_nodes()
746 if (!nodes->prcm_node) { in sun8i_a83t_get_smp_nodes()
753 if (!nodes->cpucfg_node) { in sun8i_a83t_get_smp_nodes()
760 if (!nodes->r_cpucfg_node) { in sun8i_a83t_get_smp_nodes()
878 sunxi_mc_smp_put_nodes(&nodes); in sunxi_mc_smp_init()
[all …]
/linux-6.3-rc2/security/selinux/ss/
A Dconditional.c142 kfree(node->expr.nodes); in cond_node_destroy()
341 list->nodes = kcalloc(len, sizeof(*list->nodes), GFP_KERNEL); in cond_read_av_list()
342 if (!list->nodes) in cond_read_av_list()
352 kfree(list->nodes); in cond_read_av_list()
353 list->nodes = NULL; in cond_read_av_list()
390 node->expr.nodes = kcalloc(len, sizeof(*node->expr.nodes), GFP_KERNEL); in cond_read_node()
391 if (!node->expr.nodes) in cond_read_node()
612 new->nodes = kcalloc(orig->len, sizeof(*new->nodes), GFP_KERNEL); in cond_dup_av_list()
613 if (!new->nodes) in cond_dup_av_list()
620 if (!new->nodes[i]) in cond_dup_av_list()
[all …]
/linux-6.3-rc2/Documentation/devicetree/bindings/cpu/
A Dcpu-topology.txt27 tree nodes.
44 nodes are listed.
62 - one or more cluster nodes or
114 A socket node's child nodes must be one or more cluster nodes.
123 nodes can be contained in parent cluster nodes.
131 - one or more core nodes
139 nodes are leaf nodes, otherwise they become containers of
140 thread nodes.
146 Properties for core nodes that are leaf nodes:
155 child nodes can be:
[all …]
/linux-6.3-rc2/drivers/interconnect/qcom/
A Dsm8550.c1477 .nodes = { &ebi },
1541 .nodes = { &ebi },
1587 .nodes = { &qns_llcc },
1637 .nodes = { &ebi_disp },
1643 .nodes = { &ebi_disp },
1836 .nodes = clk_virt_nodes,
1973 .nodes = gem_noc_nodes,
2052 .nodes = mc_virt_nodes,
2120 .nodes = nsp_noc_nodes,
2183 qnodes = desc->nodes; in qnoc_probe()
[all …]
A Dsc7280.c1288 .nodes = { &ebi },
1349 .nodes = { &qxm_nsp },
1356 .nodes = { &ebi },
1403 .nodes = { &qns_llcc },
1421 .nodes = { &chm_apps },
1607 .nodes = cnoc2_nodes,
1639 .nodes = cnoc3_nodes,
1655 .nodes = dc_noc_nodes,
1691 .nodes = gem_noc_nodes,
1728 .nodes = mc_virt_nodes,
[all …]
A Dsm8450.c1341 .nodes = { &ebi },
1394 .nodes = { &ebi },
1443 .nodes = { &qns_llcc },
1496 .nodes = { &ebi_disp },
1502 .nodes = { &ebi_disp },
1594 .nodes = clk_virt_nodes,
1698 .nodes = gem_noc_nodes,
1741 .nodes = mc_virt_nodes,
1794 .nodes = nsp_noc_nodes,
1862 qnodes = desc->nodes; in qnoc_probe()
[all …]
/linux-6.3-rc2/Documentation/devicetree/bindings/usb/
A Dusb-device.yaml17 Four types of device-tree nodes are defined: "host-controller nodes"
18 representing USB host controllers, "device nodes" representing USB devices,
19 "interface nodes" representing USB interfaces and "combined nodes"
32 description: Device nodes or combined nodes.
46 description: should be 1 for hub nodes with device nodes,
47 should be 2 for device nodes with interface nodes.
56 description: USB interface nodes.
63 description: Interface nodes.
/linux-6.3-rc2/fs/btrfs/
A Dinode-item.c150 leaf = path->nodes[0]; in btrfs_del_inode_extref()
217 leaf = path->nodes[0]; in btrfs_del_inode_ref()
279 if (btrfs_find_name_in_ext_backref(path->nodes[0], in btrfs_insert_inode_extref()
291 leaf = path->nodes[0]; in btrfs_insert_inode_extref()
302 btrfs_mark_buffer_dirty(path->nodes[0]); in btrfs_insert_inode_extref()
342 ref = btrfs_item_ptr(path->nodes[0], path->slots[0], in btrfs_insert_inode_ref()
351 if (btrfs_find_name_in_backref(path->nodes[0], in btrfs_insert_inode_ref()
360 ref = btrfs_item_ptr(path->nodes[0], path->slots[0], in btrfs_insert_inode_ref()
367 btrfs_mark_buffer_dirty(path->nodes[0]); in btrfs_insert_inode_ref()
416 leaf = path->nodes[0]; in btrfs_lookup_inode()
[all …]
A Dctree.c213 if (!p->nodes[i]) in btrfs_release_path()
220 p->nodes[i] = NULL; in btrfs_release_path()
1714 eb = path->nodes[0]; in btrfs_find_item()
1803 p->nodes[level] = b; in btrfs_search_slot_get_root()
2404 leaf = p->nodes[0]; in btrfs_search_slot_for_read()
2528 t = path->nodes[i]; in fixup_low_keys()
2553 eb = path->nodes[0]; in btrfs_set_item_key_safe()
3190 if (!path->nodes[1]) in push_leaf_right()
3410 if (!path->nodes[1]) in push_leaf_left()
3604 l = path->nodes[0]; in split_leaf()
[all …]
/linux-6.3-rc2/drivers/media/pci/intel/ipu3/
A Dcio2-bridge.c200 struct software_node *nodes = sensor->swnodes; in cio2_bridge_init_swnode_group() local
205 sensor->group[SWNODE_CIO2_PORT] = &nodes[SWNODE_CIO2_PORT]; in cio2_bridge_init_swnode_group()
208 sensor->group[SWNODE_VCM] = &nodes[SWNODE_VCM]; in cio2_bridge_init_swnode_group()
214 struct software_node *nodes = sensor->swnodes; in cio2_bridge_create_connection_swnodes() local
218 nodes[SWNODE_SENSOR_HID] = NODE_SENSOR(sensor->name, in cio2_bridge_create_connection_swnodes()
221 &nodes[SWNODE_SENSOR_HID]); in cio2_bridge_create_connection_swnodes()
222 nodes[SWNODE_SENSOR_ENDPOINT] = NODE_ENDPOINT( in cio2_bridge_create_connection_swnodes()
224 &nodes[SWNODE_SENSOR_PORT], in cio2_bridge_create_connection_swnodes()
228 nodes[SWNODE_CIO2_ENDPOINT] = NODE_ENDPOINT( in cio2_bridge_create_connection_swnodes()
230 &nodes[SWNODE_CIO2_PORT], in cio2_bridge_create_connection_swnodes()
[all …]
/linux-6.3-rc2/Documentation/devicetree/bindings/pinctrl/
A Dmeson,pinctrl.txt22 === GPIO sub-nodes ===
27 Required properties for sub-nodes are:
36 === Other sub-nodes ===
38 Child nodes without the "gpio-controller" represent some desired
39 configuration for a pin or a group. Those nodes can be pinmux nodes or
40 configuration nodes.
42 Required properties for pinmux nodes are:
49 Required properties for configuration nodes:
52 Configuration nodes support the following generic properties, as
/linux-6.3-rc2/drivers/platform/surface/
A Dsurface_aggregator_registry.c379 const struct software_node **nodes; in ssam_platform_hub_probe() local
384 nodes = (const struct software_node **)acpi_device_get_match_data(&pdev->dev); in ssam_platform_hub_probe()
385 if (!nodes) in ssam_platform_hub_probe()
399 status = software_node_register_node_group(nodes); in ssam_platform_hub_probe()
405 software_node_unregister_node_group(nodes); in ssam_platform_hub_probe()
414 software_node_unregister_node_group(nodes); in ssam_platform_hub_probe()
417 platform_set_drvdata(pdev, nodes); in ssam_platform_hub_probe()
423 const struct software_node **nodes = platform_get_drvdata(pdev); in ssam_platform_hub_remove() local
427 software_node_unregister_node_group(nodes); in ssam_platform_hub_remove()
/linux-6.3-rc2/arch/sparc/kernel/
A Dcpumap.c53 struct cpuinfo_node nodes[]; member
197 new_tree = kzalloc(struct_size(new_tree, nodes, n), GFP_ATOMIC); in build_cpuinfo_tree()
211 node = &new_tree->nodes[n]; in build_cpuinfo_tree()
252 node = &new_tree->nodes[level_rover[level]]; in build_cpuinfo_tree()
277 node = &new_tree->nodes[n]; in build_cpuinfo_tree()
299 struct cpuinfo_node *node = &t->nodes[node_index]; in increment_rover()
302 top_level = t->nodes[root_index].level; in increment_rover()
314 node = &t->nodes[node->parent_index]; in increment_rover()
342 new_index = t->nodes[index].rover; in iterate_cpu()
368 for (i = 0; i < cpuinfo_tree->nodes[0].num_cpus; i++) in _cpu_map_rebuild()
[all …]
/linux-6.3-rc2/sound/hda/
A Dhdac_sysfs.c16 struct kobject **nodes; member
328 if (tree->nodes) { in widget_tree_free()
331 kfree(tree->nodes); in widget_tree_free()
377 tree->nodes = kcalloc(codec->num_nodes + 1, sizeof(*tree->nodes), in widget_tree_create()
379 if (!tree->nodes) in widget_tree_create()
384 &tree->nodes[i]); in widget_tree_create()
439 tree->nodes = kcalloc(num_nodes + 1, sizeof(*tree->nodes), GFP_KERNEL); in hda_widget_sysfs_reinit()
440 if (!tree->nodes) { in hda_widget_sysfs_reinit()
456 &tree->nodes[i]); in hda_widget_sysfs_reinit()
458 tree->nodes[i] = in hda_widget_sysfs_reinit()
[all …]
/linux-6.3-rc2/drivers/clk/zynqmp/
A Dclk-zynqmp.h73 const struct clock_topology *nodes);
78 const struct clock_topology *nodes);
84 const struct clock_topology *nodes);
89 const struct clock_topology *nodes);
95 const struct clock_topology *nodes);
/linux-6.3-rc2/Documentation/admin-guide/mm/
A Dnuma_memory_policy.rst188 does not use the optional set of nodes.
240 This will tend to spread the pages out over the nodes
258 nodes changes after the memory policy has been defined.
263 remapped to the new set of allowed nodes. This may result in nodes
289 be remapped relative to the new set of allowed nodes.
298 allowed nodes is restored to its original state.
302 nodes. In other words, if nodes 0, 2, and 4 are set in the user's
305 allowed nodes. The nodemask passed by the user represents nodes
306 relative to task or VMA's set of allowed nodes.
325 memory nodes 0 to N-1, where N is the number of memory nodes the
[all …]

Completed in 59 milliseconds

12345678910>>...48