Home
last modified time | relevance | path

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

12345678910>>...47

/linux/drivers/gpu/drm/selftests/
A Dtest-drm_mm.c277 memset(nodes, 0, sizeof(nodes)); in igt_debug()
283 nodes[0].start, nodes[0].size); in igt_debug()
288 nodes[1].start = 4096 - 512 - nodes[1].size; in igt_debug()
292 nodes[1].start, nodes[1].size); in igt_debug()
394 nodes = vzalloc(array_size(count, sizeof(*nodes))); in __igt_reserve()
395 if (!nodes) in __igt_reserve()
584 nodes = vmalloc(array_size(count, sizeof(*nodes))); in __igt_insert()
624 nodes[n].start, nodes[n].size); in __igt_insert()
894 nodes = vzalloc(array_size(count, sizeof(*nodes))); in __igt_insert_range()
1537 nodes = vzalloc(array_size(size, sizeof(*nodes))); in igt_evict()
[all …]
/linux/mm/
A Dmempolicy.c199 pol->nodes = *nodes; in mpol_new_nodemask()
209 node_set(first_node(*nodes), pol->nodes); in mpol_new_preferred()
267 if (nodes && !nodes_empty(*nodes)) in mpol_new()
330 tmp = *nodes; in mpol_rebind_nodemask()
893 *nodes = p->nodes; in get_policy_nodemask()
2212 int nodes; in alloc_pages_bulk_array_interleave() local
2219 nodes = nodes_weight(pol->nodes); in alloc_pages_bulk_array_interleave()
2353 return !!nodes_equal(a->nodes, b->nodes); in __mpol_equal()
2985 new->nodes = nodes; in mpol_parse_str()
2988 node_set(first_node(nodes), new->nodes); in mpol_parse_str()
[all …]
/linux/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:]))
136 target_text = nodes.Text(match.group(0))
148 lit_text = nodes.literal(classes=['xref', 'c', class_s])
195 target_text = nodes.Text(match.group(0))
206 lit_text = nodes.literal(classes=['xref', 'c', class_str[match.re]])
260 return nodes.Text(match.group(0))
283 for para in doctree.traverse(nodes.paragraph):
284 for node in para.traverse(nodes.Text):
[all …]
A Dkfigure.py52 from docutils import nodes
57 from sphinx.util.nodes import clean_astext
92 node = nodes.literal_block(data, data)
334 class kernel_image(nodes.image):
371 class kernel_figure(nodes.figure):
437 img_node = nodes.image(node.rawsource, **node.attributes)
446 class kernel_render(nodes.General, nodes.Inline, nodes.Element):
493 literal_node = nodes.literal_block(code, code)
499 parsed = nodes.Element()
502 caption_node = nodes.caption(
[all …]
/linux/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/drivers/md/persistent-data/
A Ddm-btree-spine.c129 s->nodes[0] = NULL; in init_ro_spine()
130 s->nodes[1] = NULL; in init_ro_spine()
138 unlock_block(s->info, s->nodes[i]); in exit_ro_spine()
147 unlock_block(s->info, s->nodes[0]); in ro_step()
148 s->nodes[0] = s->nodes[1]; in ro_step()
163 unlock_block(s->info, s->nodes[s->count]); in ro_pop()
171 block = s->nodes[s->count - 1]; in ro_node()
189 unlock_block(s->info, s->nodes[i]); in exit_shadow_spine()
199 unlock_block(s->info, s->nodes[0]); in shadow_step()
200 s->nodes[0] = s->nodes[1]; in shadow_step()
[all …]
/linux/fs/btrfs/
A Dinode-item.c141 leaf = path->nodes[0]; in btrfs_del_inode_extref()
210 leaf = path->nodes[0]; in btrfs_del_inode_ref()
272 if (btrfs_find_name_in_ext_backref(path->nodes[0], in btrfs_insert_inode_extref()
284 leaf = path->nodes[0]; in btrfs_insert_inode_extref()
296 btrfs_mark_buffer_dirty(path->nodes[0]); in btrfs_insert_inode_extref()
337 ref = btrfs_item_ptr(path->nodes[0], path->slots[0], in btrfs_insert_inode_ref()
341 btrfs_set_inode_ref_index(path->nodes[0], ref, index); in btrfs_insert_inode_ref()
346 if (btrfs_find_name_in_backref(path->nodes[0], in btrfs_insert_inode_ref()
355 ref = btrfs_item_ptr(path->nodes[0], path->slots[0], in btrfs_insert_inode_ref()
362 btrfs_mark_buffer_dirty(path->nodes[0]); in btrfs_insert_inode_ref()
[all …]
A Dctree.c104 if (!p->nodes[i]) in btrfs_release_path()
111 p->nodes[i] = NULL; in btrfs_release_path()
1373 t = path->nodes[i]; in unlock_up()
1551 eb = path->nodes[0]; in btrfs_find_item()
1642 p->nodes[level] = b; in btrfs_search_slot_get_root()
2060 leaf = p->nodes[0]; in btrfs_search_slot_for_read()
2147 t = path->nodes[i]; in fixup_low_keys()
2172 eb = path->nodes[0]; in btrfs_set_item_key_safe()
2824 if (!path->nodes[1]) in push_leaf_right()
3270 l = path->nodes[0]; in split_leaf()
[all …]
A Dtree-log.c705 leaf = path->nodes[0]; in replay_one_extent()
936 leaf = path->nodes[0]; in drop_one_dir_item()
1086 leaf = path->nodes[0]; in __add_inode_ref()
1156 leaf = path->nodes[0]; in __add_inode_ref()
1319 eb = path->nodes[0]; in unlink_old_inode_refs()
1680 leaf = path->nodes[0]; in count_inode_extrefs()
2305 eb = path->nodes[0]; in check_item_in_log()
4618 leaf = path->nodes[0]; in log_one_extent()
4709 leaf = path->nodes[0]; in btrfs_log_prealloc_extents()
4729 leaf = path->nodes[0]; in btrfs_log_prealloc_extents()
[all …]
/linux/tools/perf/tests/
A Dmem2node.c49 struct memory_node nodes[3]; in test__mem2node() local
51 .memory_nodes = (struct memory_node *) &nodes[0], in test__mem2node()
52 .nr_memory_nodes = ARRAY_SIZE(nodes), in test__mem2node()
57 for (i = 0; i < ARRAY_SIZE(nodes); i++) { in test__mem2node()
58 nodes[i].node = test_nodes[i].node; in test__mem2node()
59 nodes[i].size = 10; in test__mem2node()
62 (nodes[i].set = get_bitmap(test_nodes[i].map, 10))); in test__mem2node()
74 for (i = 0; i < ARRAY_SIZE(nodes); i++) in test__mem2node()
75 zfree(&nodes[i].set); in test__mem2node()
/linux/security/selinux/ss/
A Dconditional.c142 kfree(node->expr.nodes); in cond_node_destroy()
339 list->nodes = kcalloc(len, sizeof(*list->nodes), GFP_KERNEL); in cond_read_av_list()
340 if (!list->nodes) in cond_read_av_list()
350 kfree(list->nodes); in cond_read_av_list()
351 list->nodes = NULL; in cond_read_av_list()
388 node->expr.nodes = kcalloc(len, sizeof(*node->expr.nodes), GFP_KERNEL); in cond_read_node()
389 if (!node->expr.nodes) in cond_read_node()
613 new->nodes = kcalloc(orig->len, sizeof(*new->nodes), GFP_KERNEL); in cond_dup_av_list()
614 if (!new->nodes) in cond_dup_av_list()
621 if (!new->nodes[i]) in cond_dup_av_list()
[all …]
/linux/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/lib/
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/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/drivers/interconnect/qcom/
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 …]
/linux/Documentation/devicetree/bindings/pinctrl/
A Dmeson,pinctrl.txt21 === GPIO sub-nodes ===
26 Required properties for sub-nodes are:
35 === Other sub-nodes ===
37 Child nodes without the "gpio-controller" represent some desired
38 configuration for a pin or a group. Those nodes can be pinmux nodes or
39 configuration nodes.
41 Required properties for pinmux nodes are:
48 Required properties for configuration nodes:
51 Configuration nodes support the following generic properties, as
/linux/Documentation/admin-guide/mm/
A Dnuma_memory_policy.rst190 does not use the optional set of nodes.
242 This will tend to spread the pages out over the nodes
260 nodes changes after the memory policy has been defined.
265 remapped to the new set of allowed nodes. This may result in nodes
291 be remapped relative to the new set of allowed nodes.
300 allowed nodes is restored to its original state.
304 nodes. In other words, if nodes 0, 2, and 4 are set in the user's
307 allowed nodes. The nodemask passed by the user represents nodes
308 relative to task or VMA's set of allowed nodes.
327 memory nodes 0 to N-1, where N is the number of memory nodes the
[all …]
/linux/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()
375 tree->nodes = kcalloc(codec->num_nodes + 1, sizeof(*tree->nodes), in widget_tree_create()
377 if (!tree->nodes) in widget_tree_create()
382 &tree->nodes[i]); in widget_tree_create()
437 tree->nodes = kcalloc(num_nodes + 1, sizeof(*tree->nodes), GFP_KERNEL); in hda_widget_sysfs_reinit()
438 if (!tree->nodes) { in hda_widget_sysfs_reinit()
454 &tree->nodes[i]); in hda_widget_sysfs_reinit()
456 tree->nodes[i] = in hda_widget_sysfs_reinit()
[all …]
/linux/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/Documentation/driver-api/md/
A Dmd-cluster.rst70 Normally all nodes hold a concurrent-read lock on this device.
87 informs other nodes that the metadata has
94 informs other nodes that a resync is initiated or
104 informs other nodes that a device is being added to
231 other nodes from writing anywhere on the array.
241 other nodes and other nodes remove the corresponding entry from the
253 acknowledged by all other nodes.
289 6.1 join(nodes) and leave()
295 Only the first 'nodes' nodes in the cluster can use the array.
301 Range is from 0 to nodes-1.
[all …]
/linux/drivers/dma/
A Duniphier-xdmac.c83 struct uniphier_xdmac_desc_node nodes[]; member
139 src_addr = xd->nodes[xd->cur_node].src; in uniphier_xdmac_chan_start()
140 dst_addr = xd->nodes[xd->cur_node].dst; in uniphier_xdmac_chan_start()
141 its = xd->nodes[xd->cur_node].burst_size; in uniphier_xdmac_chan_start()
142 tnum = xd->nodes[xd->cur_node].nr_burst; in uniphier_xdmac_chan_start()
300 xd->nodes[i].src = src; in uniphier_xdmac_prep_dma_memcpy()
301 xd->nodes[i].dst = dst; in uniphier_xdmac_prep_dma_memcpy()
302 xd->nodes[i].burst_size = burst_size; in uniphier_xdmac_prep_dma_memcpy()
303 xd->nodes[i].nr_burst = len / burst_size; in uniphier_xdmac_prep_dma_memcpy()
360 xd->nodes[i].nr_burst = in uniphier_xdmac_prep_slave_sg()
[all …]
/linux/Documentation/filesystems/
A Dubifs-authentication.rst80 - *Index*: an on-flash B+ tree where the leaf nodes contain filesystem data
99 of nodes. Eg. data nodes (``struct ubifs_data_node``) which store chunks of file
121 a dirty-flag which marks nodes that have to be persisted the next time the
135 any changes (in form of inode nodes, data nodes etc.) between commits
142 two types of nodes: *reference nodes* and *commit start nodes*. A commit start
143 node is written whenever an index commit is performed. Reference nodes are
145 other nodes (inode nodes, data nodes etc.) on the flash that are part of this
331 nodes. From time to time whenever it is suitable authentication nodes are added
361 reference nodes from the end of the journal, effectively rewinding the
378 no need to authenticate individual nodes of the tree. It suffices to
[all …]
/linux/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);

Completed in 70 milliseconds

12345678910>>...47