| /openbmc/qemu/tests/unit/ |
| H A D | test-interval-tree.c | 12 static IntervalTreeNode nodes[20]; variable
41 nodes[0].start = 1; in test_find_one_point()
42 nodes[0].last = 1; in test_find_one_point()
44 interval_tree_insert(&nodes[0], &root); in test_find_one_point()
46 g_assert(interval_tree_iter_first(&root, 0, 9) == &nodes[0]); in test_find_one_point()
47 g_assert(interval_tree_iter_next(&nodes[0], 0, 9) == NULL); in test_find_one_point()
49 g_assert(interval_tree_iter_next(&nodes[0], 0, 0) == NULL); in test_find_one_point()
50 g_assert(interval_tree_iter_first(&root, 0, 1) == &nodes[0]); in test_find_one_point()
51 g_assert(interval_tree_iter_first(&root, 1, 1) == &nodes[0]); in test_find_one_point()
52 g_assert(interval_tree_iter_first(&root, 1, 2) == &nodes[0]); in test_find_one_point()
[all …]
|
| H A D | test-aio-multithread.c | 289 /* The nodes for the mutex reside in this structure (on which we try to avoid
295 } nodes[NUM_CONTEXTS] __attribute__((__aligned__(64))); variable
303 nodes[id].next = -1; in mcs_mutex_lock()
304 nodes[id].locked = 1; in mcs_mutex_lock()
307 qatomic_set(&nodes[prev].next, id); in mcs_mutex_lock()
308 while (qatomic_read(&nodes[id].locked) == 1) { in mcs_mutex_lock()
309 qemu_futex_wait(&nodes[id].locked, 1); in mcs_mutex_lock()
317 if (qatomic_read(&nodes[id].next) == -1) { in mcs_mutex_unlock()
323 while (qatomic_read(&nodes[id].next) == -1) { in mcs_mutex_unlock()
325 * nodes[prev].next yet. in mcs_mutex_unlock()
[all …]
|
| /openbmc/bmcweb/http/routing/ |
| H A D | trie.hpp | 44 Trie() : nodes(1) {} in Trie()
51 optimizeNode(nodes[node.stringParamChild]); in optimizeNode()
55 optimizeNode(nodes[node.pathParamChild]); in optimizeNode()
69 ContainedType& child = nodes[kv.second]; in optimizeNode()
94 optimizeNode(nodes[kv.second]); in optimizeNode()
117 const ContainedType& child = nodes[kv.second]; in findRouteIndexesHelper()
174 reqUrl.substr(epos), nodes[node.stringParamChild], params); in findHelper()
186 FindResult ret = findHelper("", nodes[node.pathParamChild], params); in findHelper()
198 const ContainedType& child = nodes[kv.second]; in findHelper()
243 if (nodes[idx].pathParamChild == 0U) in add()
[all …]
|
| /openbmc/openbmc-test-automation/xcat/ |
| H A D | test_xcat_group.robot | 21 Add BMC Nodes To XCAT
22 [Documentation] Connect and add BMC nodes.
25 # Add BMC nodes one by one and check whether it is successfully added.
27 Add Nodes To XCAT ${bmc}
51 Add Nodes To Group List
52 [Documentation] Add BMC nodes into group.
55 # Add BMC nodes to group and validate.
57 Add Nodes To Group ${bmc} ${GROUP}
70 ${nodes}= Get List Of Nodes In Group ${GROUP}
71 Should Not Be Empty ${nodes} msg=Group is empty.
[all …]
|
| /openbmc/bmcweb/redfish-core/include/ |
| H A D | sub_route_trie.hpp | 62 findHelper("", this->nodes[node.stringParamChild], params); in findHelper()
74 this->nodes[node.stringParamChild], params); in findHelper()
87 findHelper("", this->nodes[node.pathParamChild], params); in findHelper()
99 const ContainedType& child = this->nodes[kv.second]; in findHelper()
162 if (this->nodes[idx].pathParamChild == 0U) in add()
165 this->nodes[idx].pathParamChild = newNodeIdx; in add()
167 idx = this->nodes[idx].pathParamChild; in add()
171 if (this->nodes[idx].stringParamChild == 0U) in add()
174 this->nodes[idx].stringParamChild = newNodeIdx; in add()
176 idx = this->nodes[idx].stringParamChild; in add()
[all …]
|
| /openbmc/u-boot/fs/ubifs/ |
| H A 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
107 * data_nodes_cmp - compare 2 data nodes.
[all …]
|
| /openbmc/openbmc-test-automation/lib/xcat/ |
| H A D | xcat_utils.robot | 42 Get List Of BMC Nodes
43 [Documentation] Get list of BMC nodes.
46 # Get the list of BMC nodes to be added.
47 # node_cfg_file_path This keyword expects file having list of BMC nodes
49 # File should have IP addresses of BMC nodes.
58 Add Nodes To XCAT
59 [Documentation] Add nodes to XCAT configuration.
120 Add Nodes To Group
121 [Documentation] Add BMC nodes to group.
132 Get List Of Nodes In Group
[all …]
|
| /openbmc/u-boot/fs/btrfs/ |
| H A D | ctree.c | 90 p->nodes[i] = NULL; in clear_path()
100 if (p->nodes[i]) in btrfs_free_path()
101 free(p->nodes[i]); in btrfs_free_path()
186 p->nodes[lvl] = buf; in btrfs_search_tree()
211 if (!p.nodes[level]) in jump_leaf()
215 if ((dir > 0 && slot + dir >= p.nodes[level]->header.nritems) in jump_leaf()
233 logical = p.nodes[level + 1]->node.ptrs[slot].blockptr; in jump_leaf()
238 if (read_tree_node(physical, &p.nodes[level])) in jump_leaf()
244 p.slots[level] = p.nodes[level]->header.nritems - 1; in jump_leaf()
248 /* Free rewritten nodes in path */ in jump_leaf()
[all …]
|
| /openbmc/u-boot/lib/ |
| H A D | fdtdec_test.c | 62 /* maximum number of nodes / aliases to generate */
74 * @param nodes Specifies nodes to generate (a=0, b=1), upper case
78 const char *nodes) in make_fdt() argument
97 for (s = nodes; *s; s++) { in make_fdt()
122 static int run_test(const char *aliases, const char *nodes, const char *expect) in run_test() argument
135 printf("aliases=%s, nodes=%s, expect=%s: ", aliases, nodes, expect); in run_test()
136 CHECKVAL(make_fdt(blob, FDT_SIZE, aliases, nodes), 0); in run_test()
174 * ab : to create nodes 0 and 1 (a and b) in do_test_fdtdec()
175 * ab : we expect the function to return two nodes, in in do_test_fdtdec()
194 /* disabled nodes */ in do_test_fdtdec()
|
| /openbmc/qemu/docs/sphinx/ |
| H A D | dbusdomain.py | 21 from docutils import nodes
22 from docutils.nodes import Element, Node
30 from sphinx.util import nodes as node_utils
93 section = nodes.section(ids=[name + "-section"])
94 section += nodes.title(name, "%s interface" % name)
145 if isinstance(child, nodes.field_list):
212 fieldlist = nodes.field_list()
221 content = nodes.Text(access)
222 fieldname = nodes.field_name("", _("Access"))
223 fieldbody = nodes.field_body("", nodes.paragraph("", "", content))
[all …]
|
| H A D | qapi_domain.py | 21 from docutils import nodes
35 from sphinx.util.nodes import make_id, make_refnode
58 from docutils.nodes import Element, Node
70 field: nodes.Node,
71 ) -> Tuple[nodes.field_name, nodes.field_body]:
75 assert isinstance(field, nodes.field)
77 assert isinstance(field.children[0], nodes.field_name)
78 assert isinstance(field.children[1], nodes.field_body)
139 document: nodes.document,
143 ) -> Tuple[List[nodes.Node], List[nodes.system_message]]:
[all …]
|
| H A D | qapidoc.py | 40 from docutils import nodes
65 from sphinx.util.nodes import nested_parse_with_titles
455 def run(self) -> Sequence[nodes.Node]:
458 def do_parse(self, rstlist: StringList, node: nodes.Node) -> None:
463 rST, and add the resulting docutils nodes as children of node.
464 The nodes are parsed in a way that allows them to include
483 def transmogrify(self, schema: QAPISchema) -> nodes.Element:
508 contentnode = nodes.section()
515 node: nodes.Element = nodes.section()
519 node = nodes.paragraph()
[all …]
|
| /openbmc/u-boot/include/dm/ |
| H A D | util.h | 45 * Devicetree nodes can be marked as needed to be bound
48 * Before relocation this function can be used to check if nodes
58 * Existing platforms only use it to indicate nodes needed in
71 * Devicetree nodes can be marked as needed to be bound
74 * Before relocation this function can be used to check if nodes
84 * Existing platforms only use it to indicate nodes needed in
|
| /openbmc/u-boot/doc/device-tree-bindings/pinctrl/ |
| H A D | pinctrl-bindings.txt | 21 for client device device tree nodes to map those state names to the pin
28 nodes. The decision to do this or not somewhat rests with the author of
48 node. These referenced pin configuration nodes must be child
49 nodes of the pin controller that they configure. Multiple
52 from multiple nodes for a single pin controller, each
55 pin configuration nodes.
101 Pin controller devices should contain the pin configuration nodes that client
120 The contents of each of those pin configuration child nodes is defined
124 The pin configuration nodes need not be direct children of the pin controller
127 nodes, is again defined entirely by the binding for the individual pin
[all …]
|
| /openbmc/qemu/util/ |
| H A D | fdmon-poll.c | 25 static __thread AioHandler **nodes; variable
33 g_free(nodes); in pollfds_cleanup()
49 nodes = g_renew(AioHandler *, nodes, nalloc); in add_pollfd()
51 nodes[npfd] = node; in add_pollfd()
87 aio_add_ready_handler(ready_list, nodes[i], revents); in fdmon_poll_wait()
|
| /openbmc/libbej/src/ |
| H A D | bej_encoder_core.c | 237 * @brief Process all the child nodes of a parent.
252 // node before continuing to encode the child nodes of the current in bejProcessChildNodes()
276 // We need to encode a parent node before its child nodes. So encoding the in bejEncodeTree()
280 // nodes. We need to keep a parent in this stack until all the child nodes in bejEncodeTree()
290 // Encode all the child nodes of the current parent node. If one of in bejEncodeTree()
291 // these child nodes has its own child nodes, that child node will be in bejEncodeTree()
294 // (after processing all the nodes under the child node added to the in bejEncodeTree()
299 // bejProcessChildNodes(), we know that this parent's child nodes have in bejEncodeTree()
334 // First we need to encode a parent node before its child nodes. But before in bejEncode()
336 // need to encode the parent's child nodes. Therefore first the encoder need in bejEncode()
[all …]
|
| /openbmc/openbmc/meta-arm/meta-arm-bsp/recipes-bsp/u-boot/u-boot/corstone1000/ |
| H A D | 0033-dt-Provide-a-way-to-remove-non-compliant-nodes-and-p.patch | 4 Subject: [PATCH] dt: Provide a way to remove non-compliant nodes and
8 and removes the non upstreamed nodes and properties from the
11 This allows removing entire nodes, or specific properties under nodes
12 from the devicetree. The required nodes and properties can be
74 + * dt_non_compliant_purge() - Remove non-upstreamed nodes and properties
79 + * Iterate through an array of DT nodes and properties, and remove them
81 + * These are nodes and properties which do not have upstream bindings
|
| /openbmc/u-boot/Documentation/sphinx/ |
| H A D | rstFlatTable.py | 47 from docutils import nodes
106 class rowSpan(nodes.General, nodes.Element): pass # pylint: disable=C0103,C0321
107 class colSpan(nodes.General, nodes.Element): pass # pylint: disable=C0103,C0321
129 nodes.literal_block(self.block_text, self.block_text),
134 node = nodes.Element() # anonymous container for parsing
168 table = nodes.table()
169 tgroup = nodes.tgroup(cols=len(colwidths))
174 colspec = nodes.colspec(colwidth=colwidth)
188 thead = nodes.thead()
193 tbody = nodes.tbody()
[all …]
|
| /openbmc/qemu/include/system/ |
| H A D | numa.h | 80 /* Number of NUMA nodes */
83 /* Allow setting NUMA distance for different NUMA nodes */
89 /* NUMA nodes information */
90 NodeInfo nodes[MAX_NODES]; member
92 /* NUMA nodes HMAT Locality Latency and Bandwidth Information */
|
| /openbmc/u-boot/doc/device-tree-bindings/i2c/ |
| H A D | i2c-mux.txt | 4 numbered uniquely in a device dependent manner. The nodes for an i2c bus
12 Required properties for child nodes:
17 Optional properties for child nodes:
19 - Child nodes conforming to i2c bus binding
|
| /openbmc/u-boot/include/linux/ |
| H A D | libfdt.h | 51 /* We set a reasonable limit on the number of nested nodes */
62 /* Keeps track of the state at parent nodes */
92 * Given a list of nodes to include and properties to exclude, find
97 * for all nodes but exclude the property "data", then you will get the
103 * Nodes which are given in 'inc' are included in the region list, as
104 * are the names of the immediate subnodes nodes (but not the properties
151 * Given a nodes and properties to include and properties to exclude, find
157 * that node. Trees can be subsetted easily, by specifying the nodes that
166 * for all nodes but exclude the property "data", then you will get the
173 * from source, and nodes are reordered (the bytes-stream will be emitted
[all …]
|
| /openbmc/qemu/tests/vm/ |
| H A D | conf_example_x86.yml | 26 # 4 NUMA nodes and 2 different NUMA distances.
28 -object memory-backend-ram,size=4G,policy=bind,host-nodes=0,id=ram-node0
29 -object memory-backend-ram,size=4G,policy=bind,host-nodes=0,id=ram-node1
30 -object memory-backend-ram,size=4G,policy=bind,host-nodes=1,id=ram-node2
31 -object memory-backend-ram,size=4G,policy=bind,host-nodes=1,id=ram-node3
|
| /openbmc/u-boot/doc/device-tree-bindings/w1/ |
| H A D | w1-gpio.txt | 5 Child nodes are required in device tree. The driver will detect
6 the devices serial number and then search in the child nodes in the device tree
9 Also check doc/device-tree-bindings/w1-eeprom for possible child nodes drivers
|
| /openbmc/u-boot/doc/uImage.FIT/ |
| H A D | source_file_format.txt | 87 To identify FIT sub-nodes representing images, hashes, configurations (which
126 load addresses supplied within sub-image nodes. May be omitted when no
130 - images : This node contains a set of sub-nodes, each of them representing
135 - configurations : Contains a set of available configuration nodes and
142 This node is a container node for component sub-image nodes. Each sub-node of
187 Optional nodes:
192 5) Hash nodes
223 - default : Selects one of the configuration sub-nodes as a default
226 Mandatory nodes:
228 sub-nodes is required.
[all …]
|
| /openbmc/openbmc-build-scripts/ |
| H A D | README.md | 13 nodes[^1].
24 The collection of container builds across all worker nodes may not hold a
28 worker nodes.
|