Home
last modified time | relevance | path

Searched full:leaf (Results 1 – 25 of 314) sorted by relevance

12345678910>>...13

/openbmc/libbej/test/
H A Dbej_tree_test.cpp83 EXPECT_THAT(child1.leaf.nodeAttr.sibling, &child2); in TEST()
95 EXPECT_THAT(child.leaf.nodeAttr.name, name); in TEST()
96 EXPECT_THAT(child.leaf.nodeAttr.format.principalDataType, bejInteger); in TEST()
97 EXPECT_THAT(child.leaf.nodeAttr.format.deferredBinding, 0); in TEST()
98 EXPECT_THAT(child.leaf.nodeAttr.format.readOnlyProperty, 0); in TEST()
99 EXPECT_THAT(child.leaf.nodeAttr.format.nullableProperty, 0); in TEST()
100 EXPECT_THAT(child.leaf.nodeAttr.sibling, nullptr); in TEST()
128 EXPECT_THAT(child.leaf.nodeAttr.name, name); in TEST()
129 EXPECT_THAT(child.leaf.nodeAttr.format.principalDataType, bejEnum); in TEST()
130 EXPECT_THAT(child.leaf.nodeAttr.format.deferredBinding, 0); in TEST()
[all …]
/openbmc/linux/arch/loongarch/mm/
Dcache.c
/openbmc/linux/drivers/gpu/drm/nouveau/nvkm/subdev/mc/
Dnv04.c
/openbmc/linux/drivers/gpu/drm/nouveau/nvkm/core/
Dintr.c
/openbmc/qemu/include/hw/xen/interface/arch-x86/
H A Dcpuid.h29 * Leaf 1 (0x40000x00)
30 * EAX: Largest Xen-information leaf. All leaves up to an including @EAX
40 * Leaf 2 (0x40000x01)
47 * Leaf 3 (0x40000x02)
60 * Leaf 4 (0x40000x03)
61 * Sub-leaf 0: EAX: bit 0: emulated tsc
68 * Sub-leaf 1: EAX: tsc offset low part
72 * Sub-leaf 2: EAX: host tsc frequency in kHz
76 * Leaf 5 (0x40000x04)
78 * Sub-leaf 0: EAX: Features
[all …]
/openbmc/libbej/src/
H A Dbej_encoder_metadata.c192 dictionaries, parentDictionary, &node->leaf.nodeAttr, nodeIndex, in bejUpdateIntMetaData()
194 node->leaf.metaData.sequenceNumber = sequenceNumber; in bejUpdateIntMetaData()
198 node->leaf.metaData.sflSize = bejNnintEncodingSizeOfUInt(sequenceNumber); in bejUpdateIntMetaData()
200 node->leaf.metaData.sflSize += BEJ_TUPLE_F_SIZE; in bejUpdateIntMetaData()
202 node->leaf.metaData.sflSize += BEJ_TUPLE_L_SIZE_FOR_BEJ_INTEGER; in bejUpdateIntMetaData()
204 node->leaf.metaData.vSize = bejIntLengthOfValue(node->value); in bejUpdateIntMetaData()
215 dictionaries, parentDictionary, &(node->leaf.nodeAttr), nodeIndex, in bejUpdateStringMetaData()
217 node->leaf.metaData.sequenceNumber = sequenceNumber; in bejUpdateStringMetaData()
221 node->leaf.metaData.sflSize = bejNnintEncodingSizeOfUInt(sequenceNumber); in bejUpdateStringMetaData()
223 node->leaf.metaData.sflSize += BEJ_TUPLE_F_SIZE; in bejUpdateStringMetaData()
[all …]
H A Dbej_encoder_core.c67 bejEncodeNnint(node->leaf.metaData.sequenceNumber, output)); in bejEncodeBejInteger()
69 RETURN_IF_IERROR(bejEncodeFormat(&node->leaf.nodeAttr.format, output)); in bejEncodeBejInteger()
71 RETURN_IF_IERROR(bejEncodeNnint(node->leaf.metaData.vSize, output)); in bejEncodeBejInteger()
84 bejEncodeNnint(node->leaf.metaData.sequenceNumber, output)); in bejEncodeBejEnum()
86 RETURN_IF_IERROR(bejEncodeFormat(&node->leaf.nodeAttr.format, output)); in bejEncodeBejEnum()
88 RETURN_IF_IERROR(bejEncodeNnint(node->leaf.metaData.vSize, output)); in bejEncodeBejEnum()
98 bejEncodeNnint(node->leaf.metaData.sequenceNumber, output)); in bejEncodeBejString()
100 RETURN_IF_IERROR(bejEncodeFormat(&node->leaf.nodeAttr.format, output)); in bejEncodeBejString()
102 RETURN_IF_IERROR(bejEncodeNnint(node->leaf.metaData.vSize, output)); in bejEncodeBejString()
104 return output->recvOutput((void*)node->value, node->leaf.metaData.vSize, in bejEncodeBejString()
[all …]
/openbmc/linux/arch/x86/include/asm/xen/
Dcpuid.h
/openbmc/linux/arch/mips/kernel/
Dcacheinfo.c
/openbmc/linux/fs/unicode/
Dutf8-norm.c
/openbmc/linux/tools/testing/selftests/cgroup/
Dtest_cpu.c
/openbmc/linux/tools/testing/selftests/bpf/progs/
Dxdpwall.c
/openbmc/qemu/include/qemu/
H A Dcpuid.h19 /* Leaf 1, %edx */
27 /* Leaf 1, %ecx */
44 /* Leaf 7, %ebx */
67 /* Leaf 7, %ecx */
72 /* Leaf 0x80000001, %ecx */
78 * Signatures for different CPU implementations as returned from Leaf 0.
/openbmc/u-boot/fs/btrfs/
H A Dctree.h73 * every tree block (leaf or node) starts with this header.
218 * A leaf is full of items. offset and size tell us where to find
219 * the item in the leaf (relative to the start of the data area)
240 * all non-leaf blocks are nodes, they hold only keys and pointers to
256 struct btrfs_leaf leaf; member
286 return &p->nodes[0]->leaf.items[p->slots[0]].key; in btrfs_path_leaf_key()
313 return p->nodes[0]->leaf.items[p->slots[0]].size; in btrfs_path_item_size()
316 static inline void *btrfs_leaf_data(struct btrfs_leaf *leaf, u32 slot) in btrfs_leaf_data() argument
318 return ((u8 *) leaf) + sizeof(struct btrfs_header) in btrfs_leaf_data()
319 + leaf->items[slot].offset; in btrfs_leaf_data()
[all …]
/openbmc/linux/drivers/gpu/drm/nouveau/include/nvkm/core/
Dintr.h
/openbmc/linux/arch/mips/mm/
Dtlb-funcs.S
/openbmc/linux/tools/testing/selftests/drivers/net/mlxsw/
Dsch_offload.sh
/openbmc/linux/fs/jfs/
Djfs_dmap.c
Djfs_btree.h
Djfs_dtree.c
/openbmc/phosphor-user-manager/test/
H A Djson_serializer_test.cpp93 auto leaf = s.getLeafNode("foo/bar/baz"); in TEST_F() local
94 EXPECT_TRUE(leaf.has_value()); in TEST_F()
95 if (leaf.has_value()) in TEST_F()
97 EXPECT_EQ(*leaf, "value"); in TEST_F()
100 leaf = s.getLeafNode("foo/bar/nonexistent"); in TEST_F()
101 EXPECT_FALSE(leaf.has_value()); in TEST_F()
/openbmc/libbej/include/libbej/
H A Dbej_tree.h38 * @brief Holds info needed to encode a leaf type in the JSON tree.
88 * @brief Used to store leaf type property info.
90 * Every type that doesn't belong to parent type are considered as a leaf
91 * property within a JSON tree. Each specific leaf type has its own struct.
105 struct RedfishPropertyLeaf leaf; member
113 struct RedfishPropertyLeaf leaf; member
122 struct RedfishPropertyLeaf leaf; member
134 struct RedfishPropertyLeaf leaf; member
143 struct RedfishPropertyLeaf leaf; member
154 struct RedfishPropertyLeaf leaf; member
/openbmc/linux/Documentation/networking/
Dfib_trie.rst
/openbmc/u-boot/test/py/tests/
H A Dtest_bind.py10 leaf = ' ' * 4 * depth;
12 leaf = leaf + '\|'
14 leaf = leaf + '`'
15 leaf = leaf + '-- ' + name
17 .format(uclass, drv, leaf))
/openbmc/linux/tools/perf/tests/workloads/
Dleafloop.c

12345678910>>...13