Home
last modified time | relevance | path

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

12345678910>>...43

/openbmc/libbej/src/
H A Dbej_tree.c3 static void bejTreeInitParent(struct RedfishPropertyParent* node, in bejTreeInitParent() argument
6 node->nodeAttr.name = name; in bejTreeInitParent()
7 node->nodeAttr.format.principalDataType = type; in bejTreeInitParent()
8 node->nodeAttr.format.deferredBinding = 0; in bejTreeInitParent()
9 node->nodeAttr.format.readOnlyProperty = 0; in bejTreeInitParent()
10 node->nodeAttr.format.nullableProperty = 0; in bejTreeInitParent()
11 node->nodeAttr.format.reserved = 0; in bejTreeInitParent()
12 node->nodeAttr.sibling = NULL; in bejTreeInitParent()
13 node->nChildren = 0; in bejTreeInitParent()
14 node->firstChild = NULL; in bejTreeInitParent()
[all …]
H A Dbej_encoder_core.c17 RETURN_IF_IERROR(output->recvOutput(&nnintLengthByte, sizeof(uint8_t), in bejEncodeNnint()
18 output->handlerContext)); in bejEncodeNnint()
20 return output->recvOutput(&value, nnintLengthByte, output->handlerContext); in bejEncodeNnint()
29 return output->recvOutput(format, sizeof(struct BejTupleF), in bejEncodeFormat()
30 output->handlerContext); in bejEncodeFormat()
36 static int bejEncodeBejSetOrArray(struct RedfishPropertyParent* node, in bejEncodeBejSetOrArray() argument
40 RETURN_IF_IERROR(bejEncodeNnint(node->metaData.sequenceNumber, output)); in bejEncodeBejSetOrArray()
42 RETURN_IF_IERROR(bejEncodeFormat(&node->nodeAttr.format, output)); in bejEncodeBejSetOrArray()
44 RETURN_IF_IERROR(bejEncodeNnint(node->metaData.vSize, output)); in bejEncodeBejSetOrArray()
45 // Encode the child count in bejEncodeBejSetOrArray()
[all …]
H A Dbej_encoder_metadata.c21 * byte2: integer length [0-8]]
40 * @param[in] name - property name.
53 * @brief Get the dictionary for the provided node.
55 * @param[in] dictionaries - available dictionaries for encoding.
56 * @param[in] parentDictionary - dictionary used for the parent of this node.
57 * @param[in] nodeName - name of the interested node. Can be NULL if the node
65 // If the node name is NULL, we have to use parent dictionary. in bejGetRelatedDictionary()
72 // annotation. Therefore the child (this node) should be an annotation too in bejGetRelatedDictionary()
74 // for this node as well. in bejGetRelatedDictionary()
75 if (parentDictionary == dictionaries->annotationDictionary) in bejGetRelatedDictionary()
[all …]
/openbmc/linux/include/linux/
H A Dbootconfig.h1 /* SPDX-License-Identifier: GPL-2.0 */
27 #define BOOTCONFIG_ALIGN_MASK (BOOTCONFIG_ALIGN - 1)
30 * xbc_calc_checksum() - Calculate checksum of bootconfig
43 while (size--) in xbc_calc_checksum()
49 /* XBC tree node */
52 uint16_t child; member
59 /* Maximum size of boot config is 32KB - 1 */
60 #define XBC_DATA_MAX (XBC_VALUE - 1)
66 /* Node tree access raw APIs */
68 int __init xbc_node_index(struct xbc_node *node);
[all …]
H A 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 …]
H A 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 …]
/openbmc/libbej/test/
H A Dbej_tree_test.cpp3 #include <gmock/gmock-matchers.h>
13 struct RedfishPropertyParent node; in TEST() local
14 bejTreeInitSet(&node, name); in TEST()
16 EXPECT_THAT(node.nodeAttr.name, name); in TEST()
17 EXPECT_THAT(node.nodeAttr.format.principalDataType, bejSet); in TEST()
18 EXPECT_THAT(node.nodeAttr.format.deferredBinding, 0); in TEST()
19 EXPECT_THAT(node.nodeAttr.format.readOnlyProperty, 0); in TEST()
20 EXPECT_THAT(node.nodeAttr.format.nullableProperty, 0); in TEST()
21 EXPECT_THAT(node.nodeAttr.sibling, nullptr); in TEST()
22 EXPECT_THAT(node.nChildren, 0); in TEST()
[all …]
/openbmc/libbej/include/libbej/
H A Dbej_tree.h21 // Index of the child pointed by nextChild. Used to store the array
33 // Points to the next node which is need to process.
75 // Points to the first child.
77 // Points to the last child. Technically we only need the firstChild
80 // elements in the array. So we need a pointer to the first child and
101 * @brief bejNull type property node.
109 * @brief bejInteger type property node.
118 * @brief bejEnum type property node.
130 * @brief bejString type property node.
139 * @brief bejReal type property node.
[all …]
/openbmc/linux/kernel/bpf/
H A Dlpm_trie.c1 // SPDX-License-Identifier: GPL-2.0-only
19 /* Intermediate node */
26 struct lpm_trie_node __rcu *child[2]; member
49 * lead to more nodes containing more specific matches. Each node also stores
56 * [0xc0, 0xa8, 0x00, 0x00] in big-endian notation. This documentation will
57 * stick to IP-address notation for readability though.
59 * As the trie is empty initially, the new node (1) will be places as root
60 * node, denoted as (R) in the example below. As there are no other node, both
61 * child pointers are %NULL.
63 * +----------------+
[all …]
/openbmc/linux/drivers/firmware/efi/
H A Ddev-path-parser.c1 // SPDX-License-Identifier: GPL-2.0
3 * dev-path-parser.c - EFI Device Path parser
15 static long __init parse_acpi_path(const struct efi_dev_path *node, in parse_acpi_path() argument
16 struct device *parent, struct device **child) in parse_acpi_path() argument
24 if (node->header.length != 12) in parse_acpi_path()
25 return -EINVAL; in parse_acpi_path()
28 'A' + ((node->acpi.hid >> 10) & 0x1f) - 1, in parse_acpi_path()
29 'A' + ((node->acpi.hid >> 5) & 0x1f) - 1, in parse_acpi_path()
30 'A' + ((node->acpi.hid >> 0) & 0x1f) - 1, in parse_acpi_path()
31 node->acpi.hid >> 16); in parse_acpi_path()
[all …]
/openbmc/linux/tools/include/linux/
H A 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 …]
/openbmc/linux/drivers/net/ethernet/mellanox/mlx5/core/en/
H A Dhtb.c1 // SPDX-License-Identifier: GPL-2.0 OR Linux-OpenIB
16 u32 classid; /* 16-bit, except root. */
36 struct mlx5e_qos_node *node = NULL; in mlx5e_htb_enumerate_leaves() local
39 hash_for_each(htb->qos_tc2node, bkt, node, hnode) { in mlx5e_htb_enumerate_leaves()
40 if (node->qid == MLX5E_QOS_QID_INNER) in mlx5e_htb_enumerate_leaves()
42 err = callback(data, node->qid, node->hw_id); in mlx5e_htb_enumerate_leaves()
53 last = find_last_bit(htb->qos_used_qids, mlx5e_qos_max_leaf_nodes(htb->mdev)); in mlx5e_htb_cur_leaf_nodes()
54 return last == mlx5e_qos_max_leaf_nodes(htb->mdev) ? 0 : last + 1; in mlx5e_htb_cur_leaf_nodes()
59 int size = mlx5e_qos_max_leaf_nodes(htb->mdev); in mlx5e_htb_find_unused_qos_qid()
60 struct mlx5e_priv *priv = htb->priv; in mlx5e_htb_find_unused_qos_qid()
[all …]
/openbmc/linux/lib/
H A Dbootconfig.c1 // SPDX-License-Identifier: GPL-2.0
17 /* embedded_bootconfig_data is defined in bootconfig-data.S */
23 *size = embedded_bootconfig_data_end - embedded_bootconfig_data; in xbc_get_embedded_bootconfig()
40 * Extra Boot Config (XBC) is given as tree-structured ascii text of
41 * key-value pairs on memory.
42 * xbc_parse() parses the text to build a simple tree. Each tree node is
43 * simply a key word or a value. A key node may have a next key node or/and
44 * a child node (both key and value). A value node may have a next value
45 * node (for array).
85 * xbc_get_info() - Get the information of loaded boot config
[all …]
H A Dradix-tree.c1 // SPDX-License-Identifier: GPL-2.0-or-later
24 #include <linux/radix-tree.h>
30 #include "radix-tree.h"
33 * Radix tree node cache.
38 * The radix tree is variable-height, so an insert operation not only has
45 * of RADIX_TREE_MAX_PATH size to be created, with only the root node shared.
48 #define RADIX_TREE_PRELOAD_SIZE (RADIX_TREE_MAX_PATH * 2 - 1)
54 #define IDR_INDEX_BITS (8 /* CHAR_BIT */ * sizeof(int) - 1)
57 #define IDR_PRELOAD_SIZE (IDR_MAX_PATH * 2 - 1)
60 * Per-cpu pool of preloaded nodes
[all …]
/openbmc/u-boot/arch/arm/mach-socfpga/
H A Dpinmux_arria10.c1 // SPDX-License-Identifier: GPL-2.0
3 * Copyright (C) 2016-2017 Intel Corporation <www.intel.com>
11 static int do_pinctr_pin(const void *blob, int child, const char *node_name) in do_pinctr_pin() argument
19 base_addr = fdtdec_get_addr_size(blob, child, "reg", &size); in do_pinctr_pin()
21 cell = fdt_getprop(blob, child, "pinctrl-single,pins", &len); in do_pinctr_pin()
23 return -EFAULT; in do_pinctr_pin()
26 for (; len > 0; len -= (2 * sizeof(u32))) { in do_pinctr_pin()
34 return -EFAULT; in do_pinctr_pin()
37 static int do_pinctrl_pins(const void *blob, int node, const char *child_name) in do_pinctrl_pins() argument
39 int child, len; in do_pinctrl_pins() local
[all …]
/openbmc/linux/drivers/acpi/acpica/
H A 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 …]
/openbmc/u-boot/scripts/dtc/
H A Dlivetree.c17 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
33 if (streq(new->label, label)) { in add_label()
34 new->deleted = 0; in add_label()
40 new->label = label; in add_label()
41 new->next = *labels; in add_label()
50 label->deleted = 1; in delete_labels()
59 new->name = name; in build_property()
60 new->val = val; in build_property()
71 new->name = name; in build_property_delete()
72 new->deleted = 1; in build_property_delete()
[all …]
/openbmc/u-boot/include/linux/
H A Drbtree_augmented.h1 /* SPDX-License-Identifier: GPL-2.0+ */
18 * Please note - only struct rb_augment_callbacks and the prototypes for
26 void (*propagate)(struct rb_node *node, struct rb_node *stop);
31 extern void __rb_insert_augmented(struct rb_node *node, struct rb_root *root,
34 rb_insert_augmented(struct rb_node *node, struct rb_root *root, in rb_insert_augmented() argument
37 __rb_insert_augmented(node, root, augment->rotate); in rb_insert_augmented()
46 rbstruct *node = rb_entry(rb, rbstruct, rbfield); \
47 rbtype augmented = rbcompute(node); \
48 if (node->rbaugmented == augmented) \
50 node->rbaugmented = augmented; \
[all …]
/openbmc/phosphor-mrw-tools/
H A Dpatchxml.py27 This will add a new enumerationType element child to the root element.
54 4) Add child elements to a specific element. Useful when adding several
55 child elements at once.
57 Use a type attribute of 'add-child' and specify the target parent with
60 <enumerationType type="add-child" xpath="enumerationType/[id='TYPE']">
74 5) Replace a child element inside another element, useful when replacing
75 several child elements of the same parent at once.
77 Use a type attribute of 'replace-child' and the xpath attribute
81 <enumerationType type="replace-child"
117 parser.add_argument("-x", dest="xml", help="The input XML file")
[all …]
/openbmc/linux/scripts/dtc/
H A 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 …]
/openbmc/qemu/util/
H A Dinterval-tree.c1 /* SPDX-License-Identifier: GPL-2.0-or-later */
4 #include "qemu/interval-tree.h"
10 * For now, don't expose Linux Red-Black Trees separately, but retain the
18 * red-black trees properties: https://en.wikipedia.org/wiki/Rbtree
20 * 1) A node is either red or black
23 * 4) Both children of every red node are black
28 * consecutive red nodes in a path and every red node is therefore followed by
42 * These two requirements will allow lockless iteration of the tree -- not
47 * and that it will indeed complete -- does not get stuck in a loop.
60 void (*propagate)(RBNode *node, RBNode *stop);
[all …]
/openbmc/linux/drivers/firewire/
H A 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>
66 shift -= 2; in count_ports()
96 shift = 16 - ((port_index + 5) & 7) * 2; in get_port_type()
102 struct fw_node *node; in fw_node_create() local
104 node = kzalloc(struct_size(node, ports, port_count), GFP_ATOMIC); in fw_node_create()
105 if (node == NULL) in fw_node_create()
108 node->color = color; in fw_node_create()
109 node->node_id = LOCAL_BUS | SELF_ID_PHY_ID(sid); in fw_node_create()
[all …]
/openbmc/linux/tools/perf/util/
H A 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
53 * -e cycles/call-graph=dwarf/
61 /* Used for thread-local struct callchain_cursor. */
87 return -1; in parse_callchain_mode()
102 return -1; in parse_callchain_order()
123 return -1; in parse_callchain_sort_key()
140 return -1; in parse_callchain_value()
166 return -1; in get_stack_size()
[all …]
/openbmc/linux/drivers/base/
H A Dproperty.c1 // SPDX-License-Identifier: GPL-2.0
3 * property.c - Unified device property interface.
22 return IS_ENABLED(CONFIG_OF) && dev->of_node ? in __dev_fwnode()
23 of_fwnode_handle(dev->of_node) : dev->fwnode; in __dev_fwnode()
29 return IS_ENABLED(CONFIG_OF) && dev->of_node ? in __dev_fwnode_const()
30 of_fwnode_handle(dev->of_node) : dev->fwnode; in __dev_fwnode_const()
35 * device_property_present - check if a property of a device is present
50 * fwnode_property_present - check if a property of a firmware node is present
51 * @fwnode: Firmware node whose property to check
68 return fwnode_call_bool_op(fwnode->secondary, property_present, propname); in fwnode_property_present()
[all …]
/openbmc/linux/drivers/net/mdio/
H A Dof_mdio.c1 // SPDX-License-Identifier: GPL-2.0-only
30 * ethernet-phy-idAAAA.BBBB */
37 struct device_node *child, u32 addr) in of_mdiobus_phy_device_register() argument
40 of_fwnode_handle(child), in of_mdiobus_phy_device_register()
46 struct device_node *child, u32 addr) in of_mdiobus_register_phy() argument
48 return fwnode_mdiobus_register_phy(mdio, of_fwnode_handle(child), addr); in of_mdiobus_register_phy()
52 struct device_node *child, u32 addr) in of_mdiobus_register_device() argument
54 struct fwnode_handle *fwnode = of_fwnode_handle(child); in of_mdiobus_register_device()
62 /* Associate the OF node with the device structure so it in of_mdiobus_register_device()
66 device_set_node(&mdiodev->dev, fwnode); in of_mdiobus_register_device()
[all …]

12345678910>>...43