Home
last modified time | relevance | path

Searched refs:nodes (Results 1 – 25 of 193) sorted by relevance

12345678

/Zephyr-latest/doc/_extensions/zephyr/
Dmanifest_projects_table.py32 from docutils import nodes
69 def run(self) -> list[nodes.Element]:
88 table = nodes.table()
90 tgroup = nodes.tgroup(cols=2)
91 tgroup += nodes.colspec(colwidth=1)
92 tgroup += nodes.colspec(colwidth=1)
95 thead = nodes.thead()
98 row = nodes.row()
101 entry = nodes.entry()
102 entry += nodes.paragraph(text="Project")
[all …]
Dapi_overview.py9 from docutils import nodes
61 table = nodes.table()
62 tgroup = nodes.tgroup()
64 thead = nodes.thead()
65 thead_row = nodes.row()
67 colspec = nodes.colspec()
70 entry = nodes.entry()
71 entry += nodes.Text(header_name)
77 tbody = nodes.tbody()
102 since_url = nodes.inline()
[all …]
Dapplication.py9 from docutils import nodes
154 paragraph = nodes.paragraph()
155 paragraph += nodes.Text(tool_comment.format('west'))
164 paragraph = nodes.paragraph()
165 paragraph += nodes.Text(tool_comment.format(
181 literal = nodes.literal_block(content, content)
Ddoxybridge.py12 from docutils import nodes
57 group_xref += nodes.Text(self.arguments[0])
123 refnode = nodes.reference("", "", internal=True, refuri=rel_uri, reftitle="")
130 refnode[0] = nodes.Text(title)
/Zephyr-latest/doc/_extensions/zephyr/domain/
D__init__.py38 from docutils import nodes
50 from sphinx.util.nodes import NodeMatcher, make_refnode
77 result = nodes.inline()
83 result += nodes.Text(text[last_end : match.start()])
87 result += nodes.abbreviation(abbr, abbr, explanation=explanation)
92 result += nodes.Text(text[last_end:])
109 class CodeSampleNode(nodes.Element):
113 class RelatedCodeSamplesNode(nodes.Element):
117 class CodeSampleCategoryNode(nodes.Element):
121 class CodeSampleListingNode(nodes.Element):
[all …]
/Zephyr-latest/tests/unit/rbtree/
Dmain.c18 static struct rbnode nodes[MAX_NODES]; variable
48 return (int)(n - &nodes[0]); in node_index()
167 _CHECK(get_node_mask(i) == rb_contains(&test_rbtree, &nodes[i])); in _check_tree()
205 (void)memset(nodes, 0, sizeof(nodes)); in test_tree()
213 rb_insert(&test_rbtree, &nodes[node]); in test_tree()
216 rb_remove(&test_rbtree, &nodes[node]); in test_tree()
265 (void)memset(nodes, 0, sizeof(nodes)); in ZTEST()
270 rb_insert(&test_rbtree, &nodes[i]); in ZTEST()
276 zassert_true(rb_get_min(&test_rbtree) == &nodes[0], "the tree is invalid"); in ZTEST()
277 zassert_true(rb_get_max(&test_rbtree) == &nodes[7], "the tree is invalid"); in ZTEST()
/Zephyr-latest/scripts/pylint/checkers/
Dargparse-checker.py9 from astroid import nodes
29 def visit_call(self, node: nodes.Call) -> None:
30 if isinstance(node.func, astroid.nodes.node_classes.Attribute) and \
37 if not isinstance(keyword.value, astroid.nodes.node_classes.Const):
/Zephyr-latest/doc/connectivity/bluetooth/api/mesh/
Dblob_cli.rst7 sending BLOBs of any size to any number of Target nodes, in both Push BLOB Transfer Mode and Pull
66 Target nodes having the BLOB Transfer Server model subscribe to this group address.
69 BLOB Transfer Client sends each message to all Target nodes at the same time. However, sending
73 losing Target nodes. Using group addresses for BLOB transfers will generally only pay off if the
74 list of Target nodes is extensive, and the effectiveness of each addressing strategy will vary
88 * All Target nodes have responded.
89 * A node has been removed from the list of Target nodes.
98 procedure populates the transfer capabilities from all Target nodes with the most liberal set of
99 parameters that allows all Target nodes to participate in the transfer. Any Target nodes that fail
102 Target nodes are prioritized according to their order in the list of Target nodes. If a Target node
[all …]
Ddfu.rst31 The Bluetooth Mesh DFU subsystem defines three different roles the mesh nodes have to assume in the
37 Target nodes, and they will all be updated concurrently.
42 nodes as the Distributor. The Distributor does not select the parameters of the transfer, but
43 relies on an Initiator to give it a list of Target nodes and transfer parameters. The Distributor
47 image to the Target nodes.
53 Target nodes and their firmware, and will control (and initiate) all firmware updates. The
58 :alt: Graphic overview of the DFU roles mesh nodes can have during the process of image
92 Before starting the Distribution stage, the Initiator may optionally check if Target nodes can
97 Before the firmware image can be distributed, the Initiator transfers the list of Target nodes
101 nodes, the Distributor may ask them to apply the firmware image immediately and report back with
[all …]
/Zephyr-latest/doc/_extensions/zephyr/kconfig/
D__init__.py46 from docutils import nodes
56 from sphinx.util.nodes import make_refnode
178 class KconfigSearchNode(nodes.Element):
184 def kconfig_search_visit_html(self, node: nodes.Node) -> None:
186 raise nodes.SkipNode
189 def kconfig_search_visit_latex(self, node: nodes.Node) -> None:
191 raise nodes.SkipNode
220 class _FindKconfigSearchDirectiveVisitor(nodes.NodeVisitor):
225 def unknown_visit(self, node: nodes.Node) -> None:
260 contnode: nodes.Element,
[all …]
/Zephyr-latest/doc/build/dts/api/
Dapi.rst36 identifiers for other devicetree nodes using :c:macro:`DT_PATH`,
68 devicetree specification, these macros can be used even for nodes without
85 devicetree specification, these macros can be used even for nodes without
99 some of these macros can be used even for nodes without matching bindings. This
122 exists, how many nodes of a certain type exist, whether a node has certain
135 nodes. Dependency tracking relies on a binary "depends on" relation between
136 devicetree nodes, which is defined as the `transitive closure
141 - a node directly depends on any nodes its properties refer to by phandle
144 - a parent node inherits all dependencies from its child nodes
146 A *dependency ordering* of a devicetree is a list of its nodes, where each node
[all …]
/Zephyr-latest/tests/benchmarks/data_structure_perf/rbtree_perf/src/
Drbtree_perf.c21 static struct rbnode nodes[TREE_SIZE]; variable
112 rb_insert(tree, &nodes[i]); in init_tree()
206 test = &nodes[TREE_SIZE/2]; in ZTEST()
/Zephyr-latest/tests/bluetooth/controller/ctrl_api/src/
Dmain.c203 struct node_tx nodes[SIZE] = { 0 }; in ZTEST() local
212 ull_tx_q_enqueue_data(&conn.tx_q, &nodes[i]); in ZTEST()
218 zassert_equal_ptr(node, &nodes[i], NULL); in ZTEST()
237 ull_tx_q_enqueue_data(&conn.tx_q, &nodes[i]); in ZTEST()
250 zassert_equal_ptr(node, &nodes[i], NULL); in ZTEST()
270 ull_tx_q_enqueue_data(&conn.tx_q, &nodes[i]); in ZTEST()
290 zassert_equal_ptr(node, &nodes[i], NULL); in ZTEST()
309 ull_tx_q_enqueue_data(&conn.tx_q, &nodes[i]); in ZTEST()
329 zassert_equal_ptr(node, &nodes[i], NULL); in ZTEST()
/Zephyr-latest/doc/build/dts/
Dbindings.rst10 A devicetree binding declares requirements on the contents of nodes, and
11 provides semantic information about the contents of valid nodes. Zephyr
Dbindings-intro.rst10 Devicetree nodes are matched to bindings using their :ref:`compatible
52 The build system uses bindings both to validate devicetree nodes and to convert
75 Other ways nodes are matched to bindings
95 their parent nodes. These are called "child bindings". If a node describes
97 account when matching nodes to bindings. (See :ref:`dt-bindings-on-bus` for
125 subdirectories, when matching nodes to bindings. A file is considered YAML if
/Zephyr-latest/samples/drivers/soc_flash_nand/boards/
Dintel_socfpga_agilex5_socdk.overlay7 * dts nodes required by this application for this
/Zephyr-latest/samples/subsys/shell/shell_module/boards/
Dintel_socfpga_agilex_socdk.overlay8 * dts nodes required by this shell application for this
Dintel_socfpga_agilex5_socdk.overlay8 * dts nodes required by this shell application for this
/Zephyr-latest/subsys/bluetooth/mesh/
Dcdb.c85 .nodes = {
120 for (i = 0; i < ARRAY_SIZE(bt_mesh_cdb.nodes); i++) { in addr_is_free()
121 struct bt_mesh_cdb_node *node = &bt_mesh_cdb.nodes[i]; in addr_is_free()
162 for (i = 0; i < ARRAY_SIZE(bt_mesh_cdb.nodes) + 2; ++i) { in find_lowest_free_addr()
769 for (i = 0; i < ARRAY_SIZE(bt_mesh_cdb.nodes); ++i) { in bt_mesh_cdb_clear()
770 if (bt_mesh_cdb.nodes[i].addr != BT_MESH_ADDR_UNASSIGNED) { in bt_mesh_cdb_clear()
771 bt_mesh_cdb_node_del(&bt_mesh_cdb.nodes[i], true); in bt_mesh_cdb_clear()
913 for (i = 0; i < ARRAY_SIZE(bt_mesh_cdb.nodes); i++) { in bt_mesh_cdb_node_alloc()
914 struct bt_mesh_cdb_node *node = &bt_mesh_cdb.nodes[i]; in bt_mesh_cdb_node_alloc()
977 for (i = 0; i < ARRAY_SIZE(bt_mesh_cdb.nodes); i++) { in bt_mesh_cdb_node_get()
[all …]
/Zephyr-latest/samples/net/sockets/echo_client/boards/
Dintel_socfpga_agilex5_socdk.overlay7 * dts nodes required by this application for this
/Zephyr-latest/samples/net/sockets/echo_server/boards/
Dintel_socfpga_agilex5_socdk.overlay7 * dts nodes required by this application for this
/Zephyr-latest/boards/seagate/faze/
Dpre_dt_board.cmake4 # Suppress DTC warnings due to all GPIO nodes sharing the same register address.
/Zephyr-latest/doc/kernel/data_structures/
Drbtree.rst18 Unlike a list, where position is explicit, the ordering of nodes
25 not allowed, nodes within a tree must have a single fixed order for
28 As with the slist and dlist containers, nodes within an rbtree are
37 with :c:func:`rb_remove`. Access to the "first" and "last" nodes within a
80 nodes on any path to the root must be the same, and that no more than
81 that number of "extra" red nodes may be present). This rule is
91 nodes can be added underneath the rightmost node without
96 Typical implementations effect this by simply swapping the nodes
/Zephyr-latest/scripts/dts/
Dgen_dts_cmake.py110 for node in edt.nodes:
116 for node in edt.nodes:
/Zephyr-latest/tests/subsys/storage/flash_map/
Dapp.overlay7 * Test compilation with disabled flash nodes.

12345678