Home
last modified time | relevance | path

Searched full:nodes (Results 1 – 25 of 1865) sorted by relevance

12345678910>>...75

/linux/Documentation/admin-guide/mm/
H A Dnuma_memory_policy.rst17 which is an administrative mechanism for restricting the nodes from which
40 allocations across all nodes with "sufficient" memory, so as
164 an optional set of nodes. The mode determines the behavior of the
166 and the optional set of nodes can be viewed as the arguments to the
188 does not use the optional set of nodes.
190 It is an error for the set of nodes specified for this policy to
195 nodes specified by the policy. Memory will be allocated from
202 allocation fails, the kernel will search other nodes, in order
222 page granularity, across the nodes specified in the policy.
227 Interleave mode indexes the set of nodes specifie
[all...]
/linux/tools/perf/util/
H A Dbpf-trace-summary.c96 * syscall_data is keyed by TID and has an array of nodes which
113 struct syscall_node *nodes; member
150 struct syscall_node *node = &data->nodes[i]; in print_common_stats()
176 struct syscall_node *nodes; in update_thread_stats() local
194 nodes = reallocarray(data->nodes, data->nr_nodes + 1, sizeof(*nodes)); in update_thread_stats()
195 if (nodes == NULL) in update_thread_stats()
198 data->nodes = nodes; in update_thread_stats()
199 nodes = &data->nodes[data->nr_nodes++]; in update_thread_stats()
200 nodes->syscall_nr = map_key->nr; in update_thread_stats()
203 memcpy(&nodes->stats, map_data, sizeof(*map_data)); in update_thread_stats()
[all …]
/linux/lib/
H A Dinterval_tree_test.c16 __param(int, nnodes, 100, "Number of nodes in the interval tree");
21 __param(bool, search_all, false, "Searches will iterate all nodes in the tree");
27 static struct interval_tree_node *nodes = NULL; variable
52 nodes[i].start = a; in init()
53 nodes[i].last = b; in init()
78 interval_tree_insert(nodes + j, &root); in basic_check()
80 interval_tree_remove(nodes + j, &root); in basic_check()
103 interval_tree_insert(nodes + j, &root); in search_check()
125 interval_tree_remove(nodes + j, &root); in search_check()
157 interval_tree_insert(nodes + j, &root); in intersection_range_check()
[all …]
H A Drbtree_test.c14 __param(int, nnodes, 100, "Number of nodes in the rb-tree");
29 static struct test_node *nodes = NULL; variable
154 nodes[i].key = prandom_u32_state(&rnd); in init()
155 nodes[i].val = prandom_u32_state(&rnd); in init()
257 insert(nodes + j, &root); in basic_check()
259 erase(nodes + j, &root); in basic_check()
273 insert_cached(nodes + j, &root); in basic_check()
275 erase_cached(nodes + j, &root); in basic_check()
286 insert(nodes + i, &root); in basic_check()
326 erase(nodes + i, &root); in basic_check()
[all …]
/linux/drivers/net/ethernet/tehuti/
H A Dtn40_mdio.c127 struct tn40_nodes *nodes = &priv->nodes; in tn40_swnodes_register() local
134 snprintf(nodes->phy_name, sizeof(nodes->phy_name), "ethernet-phy@1"); in tn40_swnodes_register()
135 snprintf(nodes->mdio_name, sizeof(nodes->mdio_name), "tn40_mdio-%x", in tn40_swnodes_register()
138 swnodes = nodes->swnodes; in tn40_swnodes_register()
140 swnodes[SWNODE_MDIO] = NODE_PROP(nodes->mdio_name, NULL); in tn40_swnodes_register()
142 nodes->phy_props[0] = PROPERTY_ENTRY_STRING("compatible", in tn40_swnodes_register()
144 nodes->phy_props[1] = PROPERTY_ENTRY_U32("reg", 1); in tn40_swnodes_register()
145 nodes->phy_props[2] = PROPERTY_ENTRY_STRING("firmware-name", in tn40_swnodes_register()
147 swnodes[SWNODE_PHY] = NODE_PAR_PROP(nodes->phy_name, in tn40_swnodes_register()
149 nodes->phy_props); in tn40_swnodes_register()
[all …]
/linux/fs/ubifs/
H A Dgc.c14 * nodes) or not. For non-index LEBs, garbage collection finds a LEB which
15 * contains a lot of dirty space (obsolete nodes), and copies the non-obsolete
16 * nodes to the journal, at which point the garbage-collected LEB is free to be
17 * reused. For index LEBs, garbage collection marks the non-obsolete index nodes
19 * to be reused. Garbage collection will cause the number of dirty index nodes
33 * the UBIFS nodes GC deals with. Large nodes make GC waste more space. Indeed,
34 * if GC move data from LEB A to LEB B and nodes in LEB A are large, GC would
35 * have to waste large pieces of free space at the end of LEB B, because nodes
36 * from LEB A would not fit. And the worst situation is when all nodes ar
[all...]
/linux/Documentation/mm/
H A Dnuma.rst47 abstractions called "nodes". Linux maps the nodes onto the physical cells
49 architectures. As with physical cells, software nodes may contain 0 or more
51 "closer" nodes--nodes that map to closer cells--will generally experience
62 the emulation of additional nodes. For NUMA emulation, linux will carve up
63 the existing nodes--or the system memory for non-NUMA platforms--into multiple
64 nodes. Each emulated node will manage a fraction of the underlying cells'
74 an ordered "zonelist". A zonelist specifies the zones/nodes to visit when a
79 Because some nodes contai
[all...]
/linux/Documentation/driver-api/md/
H A Dmd-cluster.rst54 node may write to those sectors. This is used when a new nodes
60 Each node has to communicate with other nodes when starting or ending
70 Normally all nodes hold a concurrent-read lock on this device.
75 Messages can be broadcast to all nodes, and the sender waits for all
76 other nodes to acknowledge the message before proceeding. Only one
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
128 The DLM LVB is used to communicate within nodes of the cluster. There
145 acknowledged by all nodes in the cluster. The BAST of the resource
[all …]
/linux/drivers/media/pci/intel/
H A Dipu-bridge.c381 struct software_node *nodes = sensor->swnodes; in ipu_bridge_create_fwnode_properties()
387 SOFTWARE_NODE_REFERENCE(&nodes[SWNODE_IVSC_SENSOR_ENDPOINT]); in ipu_bridge_create_fwnode_properties()
389 SOFTWARE_NODE_REFERENCE(&nodes[SWNODE_IVSC_IPU_ENDPOINT]); in ipu_bridge_create_fwnode_properties()
391 SOFTWARE_NODE_REFERENCE(&nodes[SWNODE_SENSOR_ENDPOINT]); in ipu_bridge_create_fwnode_properties()
393 SOFTWARE_NODE_REFERENCE(&nodes[SWNODE_IPU_ENDPOINT]); in ipu_bridge_create_fwnode_properties()
418 SOFTWARE_NODE_REFERENCE(&nodes[SWNODE_IPU_ENDPOINT]); in ipu_bridge_create_fwnode_properties()
420 SOFTWARE_NODE_REFERENCE(&nodes[SWNODE_SENSOR_ENDPOINT]); in ipu_bridge_create_fwnode_properties()
475 /* append link to distinguish nodes with same model VCM */ in ipu_bridge_init_swnode_group()
492 struct software_node *nodes = sensor->swnodes; in ipu_bridge_init_swnode_group()
494 sensor->group[SWNODE_SENSOR_HID] = &nodes[SWNODE_SENSOR_HI in ipu_bridge_init_swnode_group()
365 struct software_node *nodes = sensor->swnodes; ipu_bridge_create_fwnode_properties() local
476 struct software_node *nodes = sensor->swnodes; ipu_bridge_init_swnode_group() local
510 struct software_node *nodes = sensor->swnodes; ipu_bridge_create_connection_swnodes() local
[all...]
/linux/Documentation/devicetree/bindings/usb/
H 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"
33 description: Device nodes or combined nodes.
49 description: should be 1 for hub nodes with device nodes,
50 should be 2 for device nodes with interface nodes.
59 description: USB interface nodes.
66 description: Interface nodes.
/linux/mm/
H A Dmempolicy.c15 * interleave Allocate memory interleaved over a set of nodes,
23 * Allocate memory interleaved over a set of nodes based on
29 * bind Only allocate memory on a specific set of nodes,
33 * the allocation to memory nodes instead
41 * preferred many Try a set of nodes first before normal fallback. This is
146 * weightiness balances the tradeoff between small weights (cycles through nodes
314 * @mask: a pointer to a nodemask representing the allowed nodes.
316 * This function iterates over all nodes in @mask and calculates the
361 int (*create)(struct mempolicy *pol, const nodemask_t *nodes);
362 void (*rebind)(struct mempolicy *pol, const nodemask_t *nodes);
378 mpol_new_nodemask(struct mempolicy * pol,const nodemask_t * nodes) mpol_new_nodemask() argument
386 mpol_new_preferred(struct mempolicy * pol,const nodemask_t * nodes) mpol_new_preferred() argument
405 mpol_set_nodemask(struct mempolicy * pol,const nodemask_t * nodes,struct nodemask_scratch * nsc) mpol_set_nodemask() argument
442 mpol_new(unsigned short mode,unsigned short flags,nodemask_t * nodes) mpol_new() argument
500 mpol_rebind_default(struct mempolicy * pol,const nodemask_t * nodes) mpol_rebind_default() argument
504 mpol_rebind_nodemask(struct mempolicy * pol,const nodemask_t * nodes) mpol_rebind_nodemask() argument
525 mpol_rebind_preferred(struct mempolicy * pol,const nodemask_t * nodes) mpol_rebind_preferred() argument
981 queue_pages_range(struct mm_struct * mm,unsigned long start,unsigned long end,nodemask_t * nodes,unsigned long flags,struct list_head * pagelist) queue_pages_range() argument
1068 do_set_mempolicy(unsigned short mode,unsigned short flags,nodemask_t * nodes) do_set_mempolicy() argument
1111 get_policy_nodemask(struct mempolicy * pol,nodemask_t * nodes) get_policy_nodemask() argument
1658 get_nodes(nodemask_t * nodes,const unsigned long __user * nmask,unsigned long maxnode) get_nodes() argument
1695 copy_nodes_to_user(unsigned long __user * mask,unsigned long maxnode,nodemask_t * nodes) copy_nodes_to_user() argument
1744 nodemask_t nodes; kernel_mbind() local
1839 nodemask_t nodes; kernel_set_mempolicy() local
1962 nodemask_t nodes; kernel_get_mempolicy() local
2599 int nodes; alloc_pages_bulk_interleave() local
2644 nodemask_t nodes; alloc_pages_bulk_weighted_interleave() local
3423 nodemask_t nodes; mpol_parse_str() local
3558 nodemask_t nodes = NODE_MASK_NONE; mpol_to_str() local
[all...]
H A Dnuma_emulation.c81 * Sets up nr_nodes fake nodes interleaved over physical nodes ranging from addr
112 * Calculate the number of big nodes that can be allocated as a result in split_nodes_interleave()
126 * Continue to fill physical nodes with fake nodes until there is no in split_nodes_interleave()
214 * Sets up fake nodes of `size' interleaved over physical nodes ranging from
235 * physical block and try to create nodes of at least size in split_nodes_size_interleave_uniform()
238 * In the uniform case, split the nodes strictly by physical in split_nodes_size_interleave_uniform()
255 * The limit on emulated nodes is MAX_NUMNODES, so the in split_nodes_size_interleave_uniform()
259 * (but not necessarily over physical nodes). in split_nodes_size_interleave_uniform()
273 * Fill physical nodes with fake nodes of size until there is no memory in split_nodes_size_interleave_uniform()
348 * numa_emulation - Emulate NUMA nodes
[all …]
H A Dmemory-tiers.c25 /* All the nodes that are part of all the lower memory tiers. */
79 * Node 0 & 1 are CPU + DRAM nodes, node 2 & 3 are PMEM nodes.
98 * Node 0 & 1 are CPU + DRAM nodes, node 2 is memory-only DRAM node.
114 * Node 0 is CPU + DRAM nodes, Node 1 is HBM node, node 2 is PMEM node.
150 nodemask_t nodes = NODE_MASK_NONE; in get_memtier_nodemask() local
154 nodes_or(nodes, nodes, memtype->nodes); in get_memtier_nodemask()
156 return nodes; in get_memtier_nodemask()
[all...]
/linux/security/selinux/ss/
H A Dconditional.c33 struct cond_expr_node *node = &expr->nodes[i]; in cond_evaluate_expr()
104 avnode = node->true_list.nodes[i]; in evaluate_cond_node()
112 avnode = node->false_list.nodes[i]; in evaluate_cond_node()
141 kfree(node->expr.nodes); in cond_node_destroy()
142 /* the avtab_ptr_t nodes are destroyed by the avtab */ in cond_node_destroy()
143 kfree(node->true_list.nodes); in cond_node_destroy()
144 kfree(node->false_list.nodes); in cond_node_destroy()
292 if (other->nodes[i] == node_ptr) { in cond_insertf()
337 list->nodes = kzalloc_objs(*list->nodes, len); in cond_read_av_list()
338 if (!list->nodes) in cond_read_av_list()
[all …]
/linux/drivers/md/persistent-data/
H 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()
150 r = bn_read_lock(s->info, new_child, s->nodes + s->count); 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()
[all …]
/linux/arch/arm/mach-sunxi/
H A Dmc_smp.c689 * This holds any device nodes that we requested resources for,
702 int (*get_smp_nodes)(struct sunxi_mc_smp_nodes *nodes);
706 static void __init sunxi_mc_smp_put_nodes(struct sunxi_mc_smp_nodes *nodes) in sunxi_mc_smp_put_nodes() argument
708 of_node_put(nodes->prcm_node); in sunxi_mc_smp_put_nodes()
709 of_node_put(nodes->cpucfg_node); in sunxi_mc_smp_put_nodes()
710 of_node_put(nodes->sram_node); in sunxi_mc_smp_put_nodes()
711 of_node_put(nodes->r_cpucfg_node); in sunxi_mc_smp_put_nodes()
712 memset(nodes, 0, sizeof(*nodes)); in sunxi_mc_smp_put_nodes()
715 static int __init sun9i_a80_get_smp_nodes(struct sunxi_mc_smp_nodes *nodes) in sun9i_a80_get_smp_nodes() argument
717 nodes->prcm_node = of_find_compatible_node(NULL, NULL, in sun9i_a80_get_smp_nodes()
[all …]
/linux/include/linux/
H A Dinterconnect-provider.h31 * @num_nodes: number of nodes in this device
32 * @nodes: array of pointers to the nodes in this device
36 struct icc_node *nodes[] __counted_by(num_nodes);
47 * @nodes: internal list of the interconnect provider nodes
53 * @xlate: provider-specific callback for mapping nodes from phandle arguments
62 struct list_head nodes; member
83 * @num_links: number of links to other interconnect nodes
85 * @node_list: the list entry in the parent provider's "nodes" list
86 * @search_list: list used when walking the nodes graph
87 * @reverse: pointer to previous node when walking the nodes graph
[all …]
/linux/tools/perf/tests/
H 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/Documentation/driver-api/acpi/
H A Dscan_handlers.rst19 acpi_device objects are referred to as "device nodes" in what follows, but they
23 During ACPI-based device hot-remove device nodes representing pieces of hardware
27 initialization of device nodes, such as retrieving common configuration
48 where ids is the list of IDs of device nodes the given handler is supposed to
51 executed, respectively, after registration of new device nodes and before
52 unregistration of device nodes the handler attached to previously.
55 device nodes in the given namespace scope with the driver core. Then, it tries
72 callbacks from the scan handlers of all device nodes in the given namespace
74 nodes in that scope.
79 is the order in which they are matched against device nodes during namespace
/linux/drivers/gpu/drm/tests/
H A Ddrm_mm_test.c192 struct drm_mm_node nodes[2]; in drm_test_mm_debug()
194 /* Create a small drm_mm with a couple of nodes and a few holes, and in drm_test_mm_debug() local
199 memset(nodes, 0, sizeof(nodes)); in drm_test_mm_debug()
200 nodes[0].start = 512; in drm_test_mm_debug()
201 nodes[0].size = 1024; in drm_test_mm_debug()
202 KUNIT_ASSERT_FALSE_MSG(test, drm_mm_reserve_node(&mm, &nodes[0]), in drm_test_mm_debug()
204 nodes[0].start, nodes[0].size); in drm_test_mm_debug()
206 nodes[ in drm_test_mm_debug()
[all...]
/linux/arch/sparc/kernel/
H A Dcpumap.c45 int num_nodes; /* Number of nodes in a level in a cpuinfo tree */
51 /* Offsets into nodes[] for each level of the tree */
53 struct cpuinfo_node nodes[] __counted_by(total_nodes);
86 * nodes.
121 * end index, and number of nodes for each level in the cpuinfo tree. The
122 * total number of cpuinfo nodes required to build the tree is returned.
197 new_tree = kzalloc_flex(*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()
[all …]
/linux/Documentation/sphinx/
H A Dtranslations.py11 from docutils import nodes
32 class LanguagesNode(nodes.Element):
65 pxref += nodes.Text(lang_name)
78 # Iterate over the child nodes; any resolved links will have
79 # the type 'nodes.reference', while unresolved links will be
80 # type 'nodes.Text'.
82 isinstance(xref, nodes.reference), node.children))
90 node.replace_self(nodes.raw('', html_content, format='html'))
/linux/sound/hda/core/
H A Dsysfs.c16 struct kobject **nodes; member
328 if (tree->nodes) { in widget_tree_free()
329 for (p = tree->nodes; *p; p++) in widget_tree_free()
331 kfree(tree->nodes); in widget_tree_free()
377 tree->nodes = kzalloc_objs(*tree->nodes, codec->num_nodes + 1); in widget_tree_create()
378 if (!tree->nodes) in widget_tree_create()
383 &tree->nodes[i]); in widget_tree_create()
438 tree->nodes = kzalloc_objs(*tree->nodes, num_nodes + 1); in hda_widget_sysfs_reinit()
439 if (!tree->nodes) { in hda_widget_sysfs_reinit()
444 /* prune non-existing nodes */ in hda_widget_sysfs_reinit()
[all …]
/linux/Documentation/power/powercap/
H A Ddtpm.rst39 The nodes of the tree are a virtual description aggregating the power
40 characteristics of the children nodes and their power limitations.
64 When the nodes are inserted in the tree, their power characteristics are propagated to the parents::
106 A root node is created and it is the parent of all the nodes. This
115 hierarchically. There is one root node, all intermediate nodes are
116 grouping the child nodes which can be intermediate nodes also or real
119 The intermediate nodes aggregate the power information and allows to
120 set the power limit given the weight of the nodes.
137 if it is not recommended for the user space, several nodes can have
170 allocate and link the different nodes of the tree.
[all …]
/linux/drivers/interconnect/qcom/
H A Dsdx65.c600 .nodes = { &qxm_crypto },
607 .nodes = { &ebi },
614 .nodes = { &qhm_snoc_cfg,
647 .nodes = { &xm_sdc1 },
654 .nodes = { &qhm_audio, &qhm_spmi_fetcher1 },
661 .nodes = { &qhm_blsp1, &qhm_qpic },
668 .nodes = { &qxm_crypto },
675 .nodes = { &qns_llcc },
682 .nodes = { &qns_memnoc_snoc },
689 .nodes = { &xm_apps_rdwr },
[all …]

12345678910>>...75