Home
last modified time | relevance | path

Searched +full:child +full:- +full:node (Results 1 – 25 of 1004) sorted by relevance

12345678910>>...41

/linux-5.10/kernel/bpf/
Dlpm_trie.c1 // SPDX-License-Identifier: GPL-2.0-only
18 /* Intermediate node */
25 struct lpm_trie_node __rcu *child[2]; member
48 * lead to more nodes containing more specific matches. Each node also stores
55 * [0xc0, 0xa8, 0x00, 0x00] in big-endian notation. This documentation will
56 * stick to IP-address notation for readability though.
58 * As the trie is empty initially, the new node (1) will be places as root
59 * node, denoted as (R) in the example below. As there are no other node, both
60 * child pointers are %NULL.
62 * +----------------+
[all …]
/linux-5.10/drivers/firmware/efi/
Ddev-path-parser.c1 // SPDX-License-Identifier: GPL-2.0
3 * dev-path-parser.c - EFI Device Path parser
28 if (adev->pnp.unique_id) in match_acpi_dev()
29 return !strcmp(adev->pnp.unique_id, hid_uid.uid); in match_acpi_dev()
34 static long __init parse_acpi_path(const struct efi_dev_path *node, in parse_acpi_path() argument
35 struct device *parent, struct device **child) in parse_acpi_path() argument
40 if (node->header.length != 12) in parse_acpi_path()
41 return -EINVAL; in parse_acpi_path()
44 'A' + ((node->acpi.hid >> 10) & 0x1f) - 1, in parse_acpi_path()
45 'A' + ((node->acpi.hid >> 5) & 0x1f) - 1, in parse_acpi_path()
[all …]
/linux-5.10/tools/include/linux/
Drbtree_augmented.h1 /* SPDX-License-Identifier: GPL-2.0-or-later */
22 * Please note - only struct rb_augment_callbacks and the prototypes for
26 * See Documentation/core-api/rbtree.rst for documentation and samples.
30 void (*propagate)(struct rb_node *node, struct rb_node *stop);
35 extern void __rb_insert_augmented(struct rb_node *node, struct rb_root *root,
42 * leading to the inserted node, then call rb_link_node() as usual and
49 rb_insert_augmented(struct rb_node *node, struct rb_root *root, in rb_insert_augmented() argument
52 __rb_insert_augmented(node, root, augment->rotate); in rb_insert_augmented()
56 rb_insert_augmented_cached(struct rb_node *node, in rb_insert_augmented_cached() argument
61 root->rb_leftmost = node; in rb_insert_augmented_cached()
[all …]
/linux-5.10/include/linux/
Drbtree_augmented.h1 /* SPDX-License-Identifier: GPL-2.0-or-later */
20 * Please note - only struct rb_augment_callbacks and the prototypes for
24 * See Documentation/core-api/rbtree.rst for documentation and samples.
28 void (*propagate)(struct rb_node *node, struct rb_node *stop);
33 extern void __rb_insert_augmented(struct rb_node *node, struct rb_root *root,
40 * leading to the inserted node, then call rb_link_node() as usual and
47 rb_insert_augmented(struct rb_node *node, struct rb_root *root, in rb_insert_augmented() argument
50 __rb_insert_augmented(node, root, augment->rotate); in rb_insert_augmented()
54 rb_insert_augmented_cached(struct rb_node *node, in rb_insert_augmented_cached() argument
59 root->rb_leftmost = node; in rb_insert_augmented_cached()
[all …]
Dbootconfig.h1 /* SPDX-License-Identifier: GPL-2.0 */
17 #define BOOTCONFIG_ALIGN_MASK (BOOTCONFIG_ALIGN - 1)
19 /* XBC tree node */
22 u16 child; member
29 /* Maximum size of boot config is 32KB - 1 */
30 #define XBC_DATA_MAX (XBC_VALUE - 1)
36 /* Node tree access raw APIs */
38 int __init xbc_node_index(struct xbc_node *node);
39 struct xbc_node * __init xbc_node_get_parent(struct xbc_node *node);
40 struct xbc_node * __init xbc_node_get_child(struct xbc_node *node);
[all …]
Dof_graph.h1 /* SPDX-License-Identifier: GPL-2.0 */
5 * Copyright (C) 2012 - 2013 Samsung Electronics Co., Ltd.
18 * struct of_endpoint - the OF graph endpoint data structure
30 * for_each_endpoint_of_node - iterate over every endpoint in a device node
31 * @parent: parent device node containing ports and endpoints
32 * @child: loop variable pointing to the current endpoint node
34 * When breaking out of the loop, of_node_put(child) has to be called manually.
36 #define for_each_endpoint_of_node(parent, child) \ argument
37 for (child = of_graph_get_next_endpoint(parent, NULL); child != NULL; \
38 child = of_graph_get_next_endpoint(parent, child))
[all …]
/linux-5.10/drivers/acpi/acpica/
Dnsalloc.c1 // SPDX-License-Identifier: BSD-3-Clause OR GPL-2.0
4 * Module Name: nsalloc - Namespace allocation and deletion utilities
19 * PARAMETERS: name - Name of the new node (4 char ACPI name)
21 * RETURN: New namespace node (Null on failure)
23 * DESCRIPTION: Create a namespace node
28 struct acpi_namespace_node *node; in acpi_ns_create_node() local
35 node = acpi_os_acquire_object(acpi_gbl_namespace_cache); in acpi_ns_create_node()
36 if (!node) { in acpi_ns_create_node()
40 ACPI_MEM_TRACKING(acpi_gbl_ns_node_list->total_allocated++); in acpi_ns_create_node()
43 temp = acpi_gbl_ns_node_list->total_allocated - in acpi_ns_create_node()
[all …]
Dnswalk.c1 // SPDX-License-Identifier: BSD-3-Clause OR GPL-2.0
4 * Module Name: nswalk - Functions for walking the ACPI namespace
6 * Copyright (C) 2000 - 2020, Intel Corp.
21 * PARAMETERS: parent_node - Parent node whose children we are
23 * child_node - Previous child that was found.
24 * The NEXT child will be returned
26 * RETURN: struct acpi_namespace_node - Pointer to the NEXT child or NULL if
29 * DESCRIPTION: Return the next peer node within the namespace. If Handle
30 * is valid, Scope is ignored. Otherwise, the first node
45 return (parent_node->child); in acpi_ns_get_next_node()
[all …]
/linux-5.10/lib/
Dradix-tree.c1 // SPDX-License-Identifier: GPL-2.0-or-later
24 #include <linux/radix-tree.h>
31 * Radix tree node cache.
36 * The radix tree is variable-height, so an insert operation not only has
43 * of RADIX_TREE_MAX_PATH size to be created, with only the root node shared.
46 #define RADIX_TREE_PRELOAD_SIZE (RADIX_TREE_MAX_PATH * 2 - 1)
52 #define IDR_INDEX_BITS (8 /* CHAR_BIT */ * sizeof(int) - 1)
55 #define IDR_PRELOAD_SIZE (IDR_MAX_PATH * 2 - 1)
58 * Per-cpu pool of preloaded nodes
80 return parent ? slot - parent->slots : 0; in get_slot_offset()
[all …]
Dbootconfig.c1 // SPDX-License-Identifier: GPL-2.0
19 * Extra Boot Config (XBC) is given as tree-structured ascii text of
20 * key-value pairs on memory.
21 * xbc_parse() parses the text to build a simple tree. Each tree node is
22 * simply a key word or a value. A key node may have a next key node or/and
23 * a child node (both key and value). A value node may have a next value
24 * node (for array).
40 xbc_err_pos = (int)(p - xbc_data); in xbc_parse_error()
42 return -EINVAL; in xbc_parse_error()
46 * xbc_root_node() - Get the root node of extended boot config
[all …]
/linux-5.10/scripts/dtc/
Dlivetree.c1 // SPDX-License-Identifier: GPL-2.0-or-later
19 if (streq(new->label, label)) { in add_label()
20 new->deleted = 0; in add_label()
26 new->label = label; in add_label()
27 new->next = *labels; in add_label()
36 label->deleted = 1; in delete_labels()
46 new->name = name; in build_property()
47 new->val = val; in build_property()
48 new->srcpos = srcpos_copy(srcpos); in build_property()
59 new->name = name; in build_property_delete()
[all …]
/linux-5.10/drivers/firewire/
Dcore-topology.c1 // SPDX-License-Identifier: GPL-2.0-or-later
5 * Copyright (C) 2004-2006 Kristian Hoegsberg <krh@bitplanet.net>
11 #include <linux/firewire-constants.h>
65 shift -= 2; in count_ports()
95 shift = 16 - ((port_index + 5) & 7) * 2; in get_port_type()
101 struct fw_node *node; in fw_node_create() local
103 node = kzalloc(struct_size(node, ports, port_count), GFP_ATOMIC); in fw_node_create()
104 if (node == NULL) in fw_node_create()
107 node->color = color; in fw_node_create()
108 node->node_id = LOCAL_BUS | SELF_ID_PHY_ID(sid); in fw_node_create()
[all …]
/linux-5.10/drivers/net/mdio/
Dof_mdio.c1 // SPDX-License-Identifier: GPL-2.0-only
29 * ethernet-phy-idAAAA.BBBB */
37 if (sscanf(cp, "ethernet-phy-id%4x.%4x", &upper, &lower) == 2) { in of_get_phy_id()
42 return -EINVAL; in of_get_phy_id()
45 static struct mii_timestamper *of_find_mii_timestamper(struct device_node *node) in of_find_mii_timestamper() argument
50 err = of_parse_phandle_with_fixed_args(node, "timestamper", 1, 0, &arg); in of_find_mii_timestamper()
52 if (err == -ENOENT) in of_find_mii_timestamper()
58 return ERR_PTR(-EINVAL); in of_find_mii_timestamper()
64 struct device_node *child, u32 addr) in of_mdiobus_phy_device_register() argument
68 rc = of_irq_get(child, 0); in of_mdiobus_phy_device_register()
[all …]
/linux-5.10/Documentation/devicetree/bindings/pinctrl/
Dsamsung-pinctrl.txt6 on-chip controllers onto these pads.
9 - compatible: should be one of the following.
10 - "samsung,s3c2412-pinctrl": for S3C2412-compatible pin-controller,
11 - "samsung,s3c2416-pinctrl": for S3C2416-compatible pin-controller,
12 - "samsung,s3c2440-pinctrl": for S3C2440-compatible pin-controller,
13 - "samsung,s3c2450-pinctrl": for S3C2450-compatible pin-controller,
14 - "samsung,s3c64xx-pinctrl": for S3C64xx-compatible pin-controller,
15 - "samsung,s5pv210-pinctrl": for S5PV210-compatible pin-controller,
16 - "samsung,exynos3250-pinctrl": for Exynos3250 compatible pin-controller.
17 - "samsung,exynos4210-pinctrl": for Exynos4210 compatible pin-controller.
[all …]
/linux-5.10/tools/perf/util/
Dcallchain.c1 // SPDX-License-Identifier: GPL-2.0
3 * Copyright (C) 2009-2011, Frederic Weisbecker <fweisbec@gmail.com>
5 * Handle the callchains from the stream in an ad-hoc radix tree and then
52 * -e cycles/call-graph=dwarf/
85 return -1; in parse_callchain_mode()
100 return -1; in parse_callchain_order()
121 return -1; in parse_callchain_sort_key()
138 return -1; in parse_callchain_value()
164 return -1; in get_stack_size()
194 /* parsing ok - move on to the next */ in __parse_callchain_report_opt()
[all …]
/linux-5.10/drivers/regulator/
Dof_regulator.c1 // SPDX-License-Identifier: GPL-2.0-or-later
19 [PM_SUSPEND_STANDBY] = "regulator-state-standby",
20 [PM_SUSPEND_MEM] = "regulator-state-mem",
21 [PM_SUSPEND_MAX] = "regulator-state-disk",
29 struct regulation_constraints *constraints = &(*init_data)->constraints; in of_get_regulation_constraints()
37 n_phandles = of_count_phandle_with_args(np, "regulator-coupled-with", in of_get_regulation_constraints()
41 constraints->name = of_get_property(np, "regulator-name", NULL); in of_get_regulation_constraints()
43 if (!of_property_read_u32(np, "regulator-min-microvolt", &pval)) in of_get_regulation_constraints()
44 constraints->min_uV = pval; in of_get_regulation_constraints()
46 if (!of_property_read_u32(np, "regulator-max-microvolt", &pval)) in of_get_regulation_constraints()
[all …]
/linux-5.10/Documentation/devicetree/bindings/i2c/
Di2c-mux.txt3 An i2c bus multiplexer/switch will have several child busses that are
5 multiplexer/switch will have one child node for each child bus.
8 - #address-cells = <1>;
9 This property is required if the i2c-mux child node does not exist.
11 - #size-cells = <0>;
12 This property is required if the i2c-mux child node does not exist.
14 - i2c-mux
15 For i2c multiplexers/switches that have child nodes that are a mixture
16 of both i2c child busses and other child nodes, the 'i2c-mux' subnode
17 can be used for populating the i2c child busses. If an 'i2c-mux'
[all …]
/linux-5.10/drivers/mtd/
Dmtdpart.c1 // SPDX-License-Identifier: GPL-2.0-or-later
7 * Copyright © 2000-2010 David Woodhouse <dwmw2@infradead.org>
30 kfree(mtd->name); in free_partition()
39 int wr_alignment = (parent->flags & MTD_NO_ERASE) ? in allocate_partition()
40 master->writesize : master->erasesize; in allocate_partition()
42 parent->part.size : parent->size; in allocate_partition()
43 struct mtd_info *child; in allocate_partition() local
49 child = kzalloc(sizeof(*child), GFP_KERNEL); in allocate_partition()
50 name = kstrdup(part->name, GFP_KERNEL); in allocate_partition()
51 if (!name || !child) { in allocate_partition()
[all …]
/linux-5.10/Documentation/networking/
Dfib_trie.rst1 .. SPDX-License-Identifier: GPL-2.0
4 LC-trie implementation notes
7 Node types
8 ----------
10 An end node with data. This has a copy of the relevant key, along
14 trie node or tnode
15 An internal node, holding an array of child (leaf or tnode) pointers,
19 ------------------------
22 child array - the "child index". See Level Compression.
26 the child array. See Path Compression.
[all …]
/linux-5.10/drivers/of/
Dresolver.c1 // SPDX-License-Identifier: GPL-2.0
5 * Copyright (C) 2012 Pantelis Antoniou <panto@antoniou-consulting.com>
24 struct device_node *node; in live_tree_max_phandle() local
30 for_each_of_allnodes(node) { in live_tree_max_phandle()
31 if (node->phandle != OF_PHANDLE_ILLEGAL && in live_tree_max_phandle()
32 node->phandle > phandle) in live_tree_max_phandle()
33 phandle = node->phandle; in live_tree_max_phandle()
43 struct device_node *child; in adjust_overlay_phandles() local
47 /* adjust node's phandle in node */ in adjust_overlay_phandles()
48 if (overlay->phandle != 0 && overlay->phandle != OF_PHANDLE_ILLEGAL) in adjust_overlay_phandles()
[all …]
/linux-5.10/tools/perf/scripts/python/
Dflamegraph.py1 # flamegraph.py - create flame graphs from perf samples
2 # SPDX-License-Identifier: GPL-2.0
6 # perf record -a -g -F 99 sleep 60
11 # perf script flamegraph -a -F 99 sleep 60
15 # Works in tandem with d3-flame-graph by Martin Spier <mspier@netflix.com>
25 class Node: class
44 self.stack = Node("root")
49 "the js-d3-flame-graph (RPM) or libjs-d3-flame-graph (deb) "
51 "(--template PATH) or another output format "
52 "(--format FORMAT).".format(self.args.template),
[all …]
/linux-5.10/drivers/base/
Dproperty.c1 // SPDX-License-Identifier: GPL-2.0
3 * property.c - Unified device property interface.
23 return IS_ENABLED(CONFIG_OF) && dev->of_node ? in dev_fwnode()
24 &dev->of_node->fwnode : dev->fwnode; in dev_fwnode()
29 * device_property_present - check if a property of a device is present
42 * fwnode_property_present - check if a property of a firmware node is present
43 * @fwnode: Firmware node whose property to check
53 !IS_ERR_OR_NULL(fwnode->secondary)) in fwnode_property_present()
54 ret = fwnode_call_bool_op(fwnode->secondary, property_present, in fwnode_property_present()
61 * device_property_read_u8_array - return a u8 array property of a device
[all …]
/linux-5.10/Documentation/devicetree/
Dof_unittest.rst1 .. SPDX-License-Identifier: GPL-2.0
18 (1) Documentation/devicetree/usage-model.rst
27 2. Test-data
30 The Device Tree Source file (drivers/of/unittest-data/testcases.dts) contains
35 drivers/of/unittest-data/tests-interrupts.dtsi
36 drivers/of/unittest-data/tests-platform.dtsi
37 drivers/of/unittest-data/tests-phandle.dtsi
38 drivers/of/unittest-data/tests-match.dtsi
60 -------------------------
62 Un-flattened device tree structure:
[all …]
/linux-5.10/drivers/gpu/drm/nouveau/nvkm/core/
Dobject.c35 struct rb_node *node = client->objroot.rb_node; in nvkm_object_search() local
36 while (node) { in nvkm_object_search()
37 object = rb_entry(node, typeof(*object), node); in nvkm_object_search()
38 if (handle < object->object) in nvkm_object_search()
39 node = node->rb_left; in nvkm_object_search()
41 if (handle > object->object) in nvkm_object_search()
42 node = node->rb_right; in nvkm_object_search()
46 return ERR_PTR(-ENOENT); in nvkm_object_search()
48 object = &client->object; in nvkm_object_search()
52 if (unlikely(func && object->func != func)) in nvkm_object_search()
[all …]
/linux-5.10/drivers/md/persistent-data/
Ddm-btree-remove.c7 #include "dm-btree.h"
8 #include "dm-btree-internal.h"
9 #include "dm-transaction-manager.h"
17 * A very important constraint for our btree is that no node, except the
25 * Each node may have a left or right sibling. When decending the spine,
26 * if a node contains only MIN_ENTRIES then we try and increase this to at
29 * [A] No siblings => this can only happen if the node is the root, in which
33 * ==> rebalance(node, right sibling)
36 * ==> rebalance(left sibling, node)
38 * [D] Both siblings, total_entries(left, node, right) <= DEL_THRESHOLD
[all …]

12345678910>>...41