| /kernel/linux/linux-6.6/lib/ |
| D | interval_tree.c | 21 * Roll nodes[1] into nodes[0] by advancing nodes[1] to the end of a contiguous
22 * span of nodes. This makes nodes[0]->last the end of that contiguous used span
23 * indexes that started at the original nodes[1]->start. nodes[1] is now the
24 * first node starting the next used span. A hole span is between nodes[0]->last
25 * and nodes[1]->start. nodes[1] must be !NULL.
30 struct interval_tree_node *cur = state->nodes[1]; in interval_tree_span_iter_next_gap()
32 state->nodes[0] = cur; in interval_tree_span_iter_next_gap()
34 if (cur->last > state->nodes[0]->last) in interval_tree_span_iter_next_gap()
35 state->nodes[0] = cur; in interval_tree_span_iter_next_gap()
38 } while (cur && (state->nodes[0]->last >= cur->start || in interval_tree_span_iter_next_gap()
[all …]
|
| D | interval_tree_test.c | 14 __param(int, nnodes, 100, "Number of nodes in the interval tree");
19 __param(bool, search_all, false, "Searches will iterate all nodes in the tree");
24 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()
[all …]
|
| /kernel/linux/linux-6.6/drivers/net/ethernet/wangxun/txgbe/ |
| D | txgbe_phy.c | 25 struct txgbe_nodes *nodes = &txgbe->nodes; in txgbe_swnodes_register() local
32 snprintf(nodes->gpio_name, sizeof(nodes->gpio_name), "txgbe_gpio-%x", id); in txgbe_swnodes_register()
33 snprintf(nodes->i2c_name, sizeof(nodes->i2c_name), "txgbe_i2c-%x", id); in txgbe_swnodes_register()
34 snprintf(nodes->sfp_name, sizeof(nodes->sfp_name), "txgbe_sfp-%x", id); in txgbe_swnodes_register()
35 snprintf(nodes->phylink_name, sizeof(nodes->phylink_name), "txgbe_phylink-%x", id); in txgbe_swnodes_register()
37 swnodes = nodes->swnodes; in txgbe_swnodes_register()
46 nodes->gpio_props[0] = PROPERTY_ENTRY_STRING("pinctrl-names", "default"); in txgbe_swnodes_register()
47 swnodes[SWNODE_GPIO] = NODE_PROP(nodes->gpio_name, nodes->gpio_props); in txgbe_swnodes_register()
48 nodes->gpio0_ref[0] = SOFTWARE_NODE_REFERENCE(&swnodes[SWNODE_GPIO], 0, GPIO_ACTIVE_HIGH); in txgbe_swnodes_register()
49 nodes->gpio1_ref[0] = SOFTWARE_NODE_REFERENCE(&swnodes[SWNODE_GPIO], 1, GPIO_ACTIVE_HIGH); in txgbe_swnodes_register()
[all …]
|
| /kernel/linux/linux-5.10/drivers/gpu/drm/selftests/ |
| D | test-drm_mm.c | 268 struct drm_mm_node nodes[2]; in igt_debug() local
271 /* Create a small drm_mm with a couple of nodes and a few holes, and in igt_debug()
277 memset(nodes, 0, sizeof(nodes)); in igt_debug()
278 nodes[0].start = 512; in igt_debug()
279 nodes[0].size = 1024; in igt_debug()
280 ret = drm_mm_reserve_node(&mm, &nodes[0]); in igt_debug()
283 nodes[0].start, nodes[0].size); in igt_debug()
287 nodes[1].size = 1024; in igt_debug()
288 nodes[1].start = 4096 - 512 - nodes[1].size; in igt_debug()
289 ret = drm_mm_reserve_node(&mm, &nodes[1]); in igt_debug()
[all …]
|
| /kernel/linux/linux-6.6/drivers/gpu/drm/tests/ |
| D | drm_mm_test.c | 251 struct drm_mm_node nodes[2]; in drm_test_mm_debug() local
253 /* Create a small drm_mm with a couple of nodes and a few holes, and in drm_test_mm_debug()
259 memset(nodes, 0, sizeof(nodes)); in drm_test_mm_debug()
260 nodes[0].start = 512; in drm_test_mm_debug()
261 nodes[0].size = 1024; in drm_test_mm_debug()
262 KUNIT_ASSERT_FALSE_MSG(test, drm_mm_reserve_node(&mm, &nodes[0]), in drm_test_mm_debug()
264 nodes[0].start, nodes[0].size); in drm_test_mm_debug()
266 nodes[1].size = 1024; in drm_test_mm_debug()
267 nodes[1].start = 4096 - 512 - nodes[1].size; in drm_test_mm_debug()
268 KUNIT_ASSERT_FALSE_MSG(test, drm_mm_reserve_node(&mm, &nodes[1]), in drm_test_mm_debug()
[all …]
|
| /kernel/linux/linux-6.6/Documentation/admin-guide/mm/ |
| D | numa_memory_policy.rst | 17 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 specified by the
[all …]
|
| /kernel/linux/linux-5.10/Documentation/admin-guide/mm/ |
| D | numa_memory_policy.rst | 19 which is an administrative mechanism for restricting the nodes from which
42 allocations across all nodes with "sufficient" memory, so as
166 an optional set of nodes. The mode determines the behavior of the
168 and the optional set of nodes can be viewed as the arguments to the
190 does not use the optional set of nodes.
192 It is an error for the set of nodes specified for this policy to
197 nodes specified by the policy. Memory will be allocated from
204 allocation fails, the kernel will search other nodes, in order
224 page granularity, across the nodes specified in the policy.
229 Interleave mode indexes the set of nodes specified by the
[all …]
|
| /kernel/linux/linux-5.10/Documentation/devicetree/bindings/usb/ |
| D | usb-device.txt | 7 Four types of device-tree nodes are defined: "host-controller nodes"
8 representing USB host controllers, "device nodes" representing USB devices,
9 "interface nodes" representing USB interfaces and "combined nodes"
20 Required properties for device nodes:
30 Required properties for device nodes with interface nodes:
35 Required properties for interface nodes:
49 Required properties for combined nodes:
59 Required properties for hub nodes with device nodes:
64 Required properties for host-controller nodes with device nodes:
|
| /kernel/linux/linux-6.6/Documentation/devicetree/bindings/cpu/ |
| D | cpu-topology.txt | 20 For instance in a system where CPUs support SMT, "cpu" nodes represent all
22 In systems where SMT is not supported "cpu" nodes represent all cores present
25 CPU topology bindings allow one to associate cpu nodes with hierarchical groups
27 tree nodes.
32 The cpu nodes, as per bindings defined in [4], represent the devices that
35 A topology description containing phandles to cpu nodes that are not compliant
44 nodes are listed.
60 The cpu-map node's child nodes can be:
62 - one or more cluster nodes or
63 - one or more socket nodes in a multi-socket system
[all …]
|
| /kernel/linux/linux-5.10/Documentation/devicetree/bindings/cpu/ |
| D | cpu-topology.txt | 20 For instance in a system where CPUs support SMT, "cpu" nodes represent all
22 In systems where SMT is not supported "cpu" nodes represent all cores present
25 CPU topology bindings allow one to associate cpu nodes with hierarchical groups
27 tree nodes.
32 The cpu nodes, as per bindings defined in [4], represent the devices that
35 A topology description containing phandles to cpu nodes that are not compliant
44 nodes are listed.
60 The cpu-map node's child nodes can be:
62 - one or more cluster nodes or
63 - one or more socket nodes in a multi-socket system
[all …]
|
| /kernel/linux/linux-5.10/mm/ |
| D | mempolicy.c | 15 * interleave Allocate memory interleaved over a set of nodes,
22 * bind Only allocate memory on a specific set of nodes,
26 * the allocation to memory nodes instead
176 int (*create)(struct mempolicy *pol, const nodemask_t *nodes);
177 void (*rebind)(struct mempolicy *pol, const nodemask_t *nodes);
193 static int mpol_new_interleave(struct mempolicy *pol, const nodemask_t *nodes) in mpol_new_interleave() argument
195 if (nodes_empty(*nodes)) in mpol_new_interleave()
197 pol->v.nodes = *nodes; in mpol_new_interleave()
201 static int mpol_new_preferred(struct mempolicy *pol, const nodemask_t *nodes) in mpol_new_preferred() argument
203 if (!nodes) in mpol_new_preferred()
[all …]
|
| /kernel/linux/linux-5.10/Documentation/vm/ |
| D | numa.rst | 49 abstractions called "nodes". Linux maps the nodes onto the physical cells
51 architectures. As with physical cells, software nodes may contain 0 or more
53 "closer" nodes--nodes that map to closer cells--will generally experience
64 the emulation of additional nodes. For NUMA emulation, linux will carve up
65 the existing nodes--or the system memory for non-NUMA platforms--into multiple
66 nodes. Each emulated node will manage a fraction of the underlying cells'
76 an ordered "zonelist". A zonelist specifies the zones/nodes to visit when a
81 Because some nodes contain multiple zones containing different types of
87 from the same node before using remote nodes which are ordered by NUMA distance.
94 nodes' zones in the selected zonelist looking for the first zone in the list
[all …]
|
| /kernel/linux/linux-6.6/Documentation/mm/ |
| D | numa.rst | 47 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 contain multiple zones containing different types of
85 from the same node before using remote nodes which are ordered by NUMA distance.
92 nodes' zones in the selected zonelist looking for the first zone in the list
[all …]
|
| /kernel/linux/linux-5.10/fs/ubifs/ |
| D | gc.c | 14 * 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 are of
97 * data_nodes_cmp - compare 2 data nodes.
[all …]
|
| /kernel/linux/linux-6.6/fs/ubifs/ |
| D | gc.c | 14 * 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 are of
97 * data_nodes_cmp - compare 2 data nodes.
[all …]
|
| /kernel/linux/linux-6.6/drivers/media/pci/intel/ |
| D | ipu-bridge.c | 313 struct software_node *nodes = sensor->swnodes; in ipu_bridge_create_fwnode_properties() local
319 SOFTWARE_NODE_REFERENCE(&nodes[SWNODE_IVSC_SENSOR_ENDPOINT]); in ipu_bridge_create_fwnode_properties()
321 SOFTWARE_NODE_REFERENCE(&nodes[SWNODE_IVSC_IPU_ENDPOINT]); in ipu_bridge_create_fwnode_properties()
323 SOFTWARE_NODE_REFERENCE(&nodes[SWNODE_SENSOR_ENDPOINT]); in ipu_bridge_create_fwnode_properties()
325 SOFTWARE_NODE_REFERENCE(&nodes[SWNODE_IPU_ENDPOINT]); in ipu_bridge_create_fwnode_properties()
350 SOFTWARE_NODE_REFERENCE(&nodes[SWNODE_IPU_ENDPOINT]); in ipu_bridge_create_fwnode_properties()
352 SOFTWARE_NODE_REFERENCE(&nodes[SWNODE_SENSOR_ENDPOINT]); in ipu_bridge_create_fwnode_properties()
407 /* append link to distinguish nodes with same model VCM */ in ipu_bridge_init_swnode_names()
424 struct software_node *nodes = sensor->swnodes; in ipu_bridge_init_swnode_group() local
426 sensor->group[SWNODE_SENSOR_HID] = &nodes[SWNODE_SENSOR_HID]; in ipu_bridge_init_swnode_group()
[all …]
|
| /kernel/linux/linux-6.6/mm/ |
| D | mempolicy.c | 15 * interleave Allocate memory interleaved over a set of nodes,
22 * bind Only allocate memory on a specific set of nodes,
26 * the allocation to memory nodes instead
34 * preferred many Try a set of nodes first before normal fallback. This is
186 int (*create)(struct mempolicy *pol, const nodemask_t *nodes);
187 void (*rebind)(struct mempolicy *pol, const nodemask_t *nodes);
203 static int mpol_new_nodemask(struct mempolicy *pol, const nodemask_t *nodes) in mpol_new_nodemask() argument
205 if (nodes_empty(*nodes)) in mpol_new_nodemask()
207 pol->nodes = *nodes; in mpol_new_nodemask()
211 static int mpol_new_preferred(struct mempolicy *pol, const nodemask_t *nodes) in mpol_new_preferred() argument
[all …]
|
| /kernel/linux/linux-6.6/Documentation/devicetree/bindings/usb/ |
| 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"
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.
|
| /kernel/linux/linux-6.6/Documentation/driver-api/md/ |
| 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 …]
|
| /kernel/linux/linux-5.10/Documentation/driver-api/md/ |
| 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 …]
|
| /kernel/linux/linux-5.10/Documentation/filesystems/ |
| D | ubifs-authentication.rst | 80 - *Index*: an on-flash B+ tree where the leaf nodes contain filesystem data
98 Basic on-flash UBIFS entities are called *nodes*. UBIFS knows different types
99 of nodes. Eg. data nodes (``struct ubifs_data_node``) which store chunks of file
100 contents or inode nodes (``struct ubifs_ino_node``) which represent VFS inodes.
101 Almost all types of nodes share a common header (``ubifs_ch``) containing basic
104 and some less important node types like padding nodes which are used to pad
108 as *wandering tree*, where only the changed nodes are re-written and previous
121 a dirty-flag which marks nodes that have to be persisted the next time the
126 on-flash filesystem structures like the index. On every commit, the TNC nodes
135 any changes (in form of inode nodes, data nodes etc.) between commits
[all …]
|
| /kernel/linux/linux-6.6/Documentation/filesystems/ |
| D | ubifs-authentication.rst | 80 - *Index*: an on-flash B+ tree where the leaf nodes contain filesystem data
98 Basic on-flash UBIFS entities are called *nodes*. UBIFS knows different types
99 of nodes. Eg. data nodes (``struct ubifs_data_node``) which store chunks of file
100 contents or inode nodes (``struct ubifs_ino_node``) which represent VFS inodes.
101 Almost all types of nodes share a common header (``ubifs_ch``) containing basic
104 and some less important node types like padding nodes which are used to pad
108 as *wandering tree*, where only the changed nodes are re-written and previous
121 a dirty-flag which marks nodes that have to be persisted the next time the
126 on-flash filesystem structures like the index. On every commit, the TNC nodes
135 any changes (in form of inode nodes, data nodes etc.) between commits
[all …]
|
| /kernel/linux/linux-5.10/fs/btrfs/ |
| D | inode-item.c | 93 return btrfs_find_name_in_ext_backref(path->nodes[0], path->slots[0], in btrfs_lookup_inode_extref()
135 extref = btrfs_find_name_in_ext_backref(path->nodes[0], path->slots[0], in btrfs_del_inode_extref()
143 leaf = path->nodes[0]; in btrfs_del_inode_extref()
207 ref = btrfs_find_name_in_backref(path->nodes[0], path->slots[0], name, in btrfs_del_inode_ref()
214 leaf = path->nodes[0]; in btrfs_del_inode_ref()
277 if (btrfs_find_name_in_ext_backref(path->nodes[0], in btrfs_insert_inode_extref()
289 leaf = path->nodes[0]; in btrfs_insert_inode_extref()
295 btrfs_set_inode_extref_name_len(path->nodes[0], extref, name_len); in btrfs_insert_inode_extref()
296 btrfs_set_inode_extref_index(path->nodes[0], extref, index); in btrfs_insert_inode_extref()
297 btrfs_set_inode_extref_parent(path->nodes[0], extref, ref_objectid); in btrfs_insert_inode_extref()
[all …]
|
| /kernel/linux/linux-5.10/lib/ |
| D | interval_tree_test.c | 14 __param(int, nnodes, 100, "Number of nodes in the interval tree");
19 __param(bool, search_all, false, "Searches will iterate all nodes in the tree");
24 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()
[all …]
|
| /kernel/linux/linux-5.10/Documentation/devicetree/bindings/pinctrl/ |
| D | meson,pinctrl.txt | 21 === 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
|