| /linux/tools/perf/util/ |
| H A D | bpf-trace-summary.c | 96 * 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/drivers/net/ethernet/tehuti/ |
| H A D | tn40_mdio.c | 127 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/lib/ |
| H A D | interval_tree_test.c | 16 __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 D | rbtree_test.c | 14 __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/Documentation/driver-api/md/ |
| H A D | md-cluster.rst | 54 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/Documentation/devicetree/bindings/usb/ |
| H A D | usb-device.yaml | 17 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 D | mempolicy.c | 15 * 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);
[all …]
|
| H A D | numa_emulation.c | 81 * 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 …]
|
| /linux/security/selinux/ss/ |
| H A D | conditional.c | 33 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 D | dm-btree-spine.c | 128 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/include/linux/ |
| H A D | interconnect-provider.h | 31 * @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 …]
|
| H A D | maple_tree.h | 17 * Allocated nodes are mutable until they have been inserted into the tree,
21 * Removed nodes have their ->parent set to point to themselves. RCU readers
25 * Nodes in the tree point to their parent unless bit 0 is set.
48 * Internal non-root nodes can only have maple_range_* nodes as parents. The
49 * parent pointer is 256B aligned like all other tree nodes. When storing a 32
61 * 0b?00 = 16 bit nodes
62 * 0b010 = 32 bit nodes
63 * 0b110 = 64 bit nodes
83 * Leaf nodes do not store pointers to nodes, they store user data. Users may
93 * Non-leaf nodes store the type of the node pointed to (enum maple_type in bits
[all …]
|
| /linux/arch/arm/mach-sunxi/ |
| H A D | mc_smp.c | 689 * 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/tools/perf/tests/ |
| H A D | mem2node.c | 50 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 D | scan_handlers.rst | 19 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/arch/sparc/kernel/ |
| H A D | cpumap.c | 45 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/sound/hda/core/ |
| H A D | sysfs.c | 16 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 D | dtpm.rst | 39 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 D | icc-rpmh.h | 23 * @nodes: list of icc nodes that maps to the provider
24 * @num_nodes: number of @nodes
35 struct qcom_icc_node * const *nodes; member
82 * struct qcom_icc_node - Qualcomm specific interconnect nodes
110 * struct qcom_icc_bcm - Qualcomm specific hardware accelerator nodes
126 * @nodes: list of qcom_icc_nodes that this BCM encapsulates
142 struct qcom_icc_node *nodes[]; member
146 struct qcom_icc_node **nodes; member
152 struct qcom_icc_node * const *nodes; member
|
| H A D | sdx65.c | 600 .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 …]
|
| H A D | sdx55.c | 639 .nodes = { &ebi },
646 .nodes = { &qns_llcc },
653 .nodes = { &qxm_crypto },
660 .nodes = { &qhm_snoc_cfg },
667 .nodes = { &xm_apps_rdwr },
674 .nodes = { &qns_memnoc_snoc, &qns_sys_pcie },
681 .nodes = { &qns_snoc_memnoc },
688 .nodes = { &qxs_imem },
695 .nodes = { &xm_sdc1 },
702 .nodes = { &qhm_audio, &qhm_spmi_fetcher1 },
[all …]
|
| H A D | sdm670.c | 1039 .nodes = { &ebi },
1046 .nodes = { &ebi },
1053 .nodes = { &qns_llcc },
1060 .nodes = { &qns_mem_noc_hf },
1067 .nodes = { &qns_apps_io },
1074 .nodes = { &qxm_camnoc_hf0_uncomp,
1088 .nodes = { &qns_memnoc_snoc },
1095 .nodes = { &qns2_mem_noc },
1102 .nodes = { &acm_tcu },
1109 .nodes = { &qxm_camnoc_sf, &qxm_rot, &qxm_venus0, &qxm_venus1, &qxm_venus_arm9 },
[all …]
|
| H A D | sdm845.c | 1251 .nodes = { &ebi },
1258 .nodes = { &ebi },
1265 .nodes = { &qns_llcc },
1272 .nodes = { &qns_mem_noc_hf },
1279 .nodes = { &qns_apps_io },
1286 .nodes = { &qxm_camnoc_hf0_uncomp,
1300 .nodes = { &qns_memnoc_snoc },
1307 .nodes = { &qns2_mem_noc },
1314 .nodes = { &acm_tcu },
1321 .nodes = { &qxm_camnoc_sf, &qxm_rot, &qxm_venus0, &qxm_venus1, &qxm_venus_arm9 },
[all …]
|
| H A D | sc7180.c | 1230 .nodes = { &ebi },
1237 .nodes = { &ebi },
1244 .nodes = { &qns_llcc },
1251 .nodes = { &qns_mem_noc_hf },
1258 .nodes = { &qxm_crypto },
1265 .nodes = { &qnm_snoc,
1320 .nodes = { &qxm_camnoc_hf0_uncomp,
1335 .nodes = { &acm_sys_tcu },
1342 .nodes = { &qns_mem_noc_sf },
1349 .nodes = { &qup_core_master_1, &qup_core_master_2 },
[all …]
|
| /linux/Documentation/admin-guide/cgroup-v1/ |
| H A D | cpusets.rst | 44 Nodes to a set of tasks. In this document "Memory Node" refers to
58 set_mempolicy(2) system calls to include Memory Nodes in its memory
60 CPUs or Memory Nodes not in that cpuset. The scheduler will not
67 cpusets and which CPUs and Memory Nodes are assigned to each cpuset,
76 complex memory cache hierarchies and multiple Memory Nodes having
114 Memory Nodes are used by a process or set of processes.
118 Nodes it may obtain memory (mbind, set_mempolicy).
122 - Cpusets are sets of allowed CPUs and Memory Nodes, known to the
129 those Memory Nodes allowed in that task's cpuset.
131 Nodes.
[all …]
|