| /freebsd/sys/contrib/device-tree/Bindings/i2c/ |
| H A D | i2c-mux.txt | 3 An i2c bus multiplexer/switch will have several child busses that are
4 numbered uniquely in a device dependent manner. The nodes for an i2c bus
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
[all …]
|
| H A D | i2c-fsi.txt | 1 Device-tree bindings for FSI-attached I2C master and busses
2 -----------------------------------------------------------
5 - compatible = "ibm,i2c-fsi";
6 - reg = < address size >; : The FSI CFAM address and address
8 - #address-cells = <1>; : Number of address cells in child
9 nodes.
10 - #size-cells = <0>; : Number of size cells in child nodes.
11 - child nodes : Nodes to describe busses off the I2C
14 Child node required properties:
15 - reg = < port number > : The port number on the I2C master.
[all …]
|
| H A D | i2c-mux.yaml | 1 # SPDX-License-Identifier: GPL-2.0
3 ---
4 $id: http://devicetree.org/schemas/i2c/i2c-mux.yaml#
5 $schema: http://devicetree.org/meta-schemas/core.yaml#
10 - Peter Rosin <peda@axentia.se>
13 An i2c bus multiplexer/switch will have several child busses that are numbered
14 uniquely in a device dependent manner. The nodes for an i2c bus
15 multiplexer/switch will have one child node for each child bus.
17 For i2c multiplexers/switches that have child nodes that are a mixture of both
18 i2c child busses and other child nodes, the 'i2c-mux' subnode can be used for
[all …]
|
| /freebsd/sys/contrib/device-tree/Bindings/pwm/ |
| H A D | pwm-tipwmss.txt | 4 - compatible: Must be "ti,<soc>-pwmss".
5 for am33xx - compatible = "ti,am33xx-pwmss";
6 for am4372 - compatible = "ti,am4372-pwmss","ti,am33xx-pwmss";
7 for dra746 - compatible = "ti,dra746-pwmss", "ti,am33xx-pwmss"
9 - reg: physical base address and size of the registers map.
10 - address-cells: Specify the number of u32 entries needed in child nodes.
12 - size-cells: specify number of u32 entries needed to specify child nodes size
14 - ranges: describes the address mapping of a memory-mapped bus. Should set to
15 physical address map of child's base address, physical address within
17 3 set of child register maps present, ECAP register space, EQEP
[all …]
|
| /freebsd/usr.sbin/ppp/ |
| H A D | chap.c | 1 /*-
2 * SPDX-License-Identifier: BSD-2-Clause
4 * Copyright (c) 1996 - 2001 Brian Somers <brian@Awfulhak.org>
5 * based on work by Toshiharu OHNO <tony-o@iij.ad.jp>
41 #ifndef NODES
88 #ifndef NODES
97 #define MAXCHAPCODE (sizeof chapcodes / sizeof chapcodes[0] - 1)
120 link_PushPacket(&physical->link, bp, physical->dl->bundle, in ChapOutput()
121 LINK_QUEUES(&physical->link) - 1, PROTO_CHAP); in ChapOutput()
126 #ifndef NODES in chap_BuildAnswer()
[all …]
|
| /freebsd/sys/contrib/device-tree/Bindings/cpu/ |
| H A D | cpu-topology.txt | 6 1 - Introduction
12 - socket
13 - cluster
14 - core
15 - thread
18 symmetric multi-threading (SMT) is supported or not.
20 For instance in a system where CPUs support SMT, "cpu" nodes represent all
22 In systems where SMT is not supported "cpu" nodes represent all cores present
25 CPU topology bindings allow one to associate cpu nodes with hierarchical groups
27 tree nodes.
[all …]
|
| /freebsd/sys/contrib/device-tree/Bindings/pinctrl/ |
| H A D | samsung-pinctrl.txt | 6 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 …]
|
| H A D | pinctrl.yaml | 1 # SPDX-License-Identifier: GPL-2.0-only OR BSD-2-Clause
3 ---
5 $schema: http://devicetree.org/meta-schemas/core.yaml#
10 - Linus Walleij <linus.walleij@linaro.org>
11 - Rafał Miłecki <rafal@milecki.pl>
14 Pin controller devices should contain the pin configuration nodes that client
17 The contents of each of those pin configuration child nodes is defined
22 The pin configuration nodes need not be direct children of the pin controller
24 whether there is any interaction between the child and intermediate parent
25 nodes, is again defined entirely by the binding for the individual pin
[all …]
|
| /freebsd/contrib/llvm-project/clang/include/clang/Tooling/Syntax/ |
| H A D | Tree.h | 1 //===- Tree.h - structure of the syntax tree ------------------*- C++ -*-=====//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
8 // Defines the basic structure of the syntax tree. There are two kinds of nodes:
9 // - leaf nodes correspond to tokens,
10 // - tree nodes correspond to language grammar constructs.
14 // preprocessing), the specific tokens coverered are stored in the leaf nodes of
15 // a tree. A post-order traversal of a tree will visit leaf nodes in an order
20 //===----------------------------------------------------------------------===//
40 /// Keeps all the allocated nodes and their intermediate data structures.
[all …]
|
| /freebsd/sys/contrib/device-tree/Bindings/spmi/ |
| H A D | spmi.txt | 4 controller is modelled in device tree as a node with zero or more child nodes,
8 - #address-cells : must be set to 2
9 - #size-cells : must be set to 0
11 Child nodes:
13 An SPMI controller node can contain zero or more child nodes representing slave
14 devices on the bus. Child 'reg' properties are specified as an address, type
15 pair. The address must be in the range 0-15 (4 bits). The type must be one of
20 Each child node must have one and only one 'reg' entry of type SPMI_USID.
22 #include <dt-bindings/spmi/spmi.h>
28 #address-cells = <2>;
[all …]
|
| /freebsd/sys/contrib/device-tree/Bindings/memory-controllers/ |
| H A D | arm,pl172.txt | 5 - compatible: Must be "arm,primecell" and exactly one from
8 - reg: Must contains offset/length value for controller.
10 - #address-cells: Must be 2. The partition number has to be encoded in the
11 first address cell and it may accept values 0..N-1
12 (N - total number of partitions). The second cell is the
15 - #size-cells: Must be set to 1.
17 - ranges: Must contain one or more chip select memory regions.
19 - clocks: Must contain references to controller clocks.
21 - clock-names: Must contain "mpmcclk" and "apb_pclk".
23 - clock-ranges: Empty property indicating that child nodes can inherit
[all …]
|
| H A D | ti-aemif.txt | 4 provide a glue-less interface to a variety of asynchronous memory devices like
11 Davinci DM646x - http://www.ti.com/lit/ug/sprueq7c/sprueq7c.pdf
12 OMAP-L138 (DA850) - http://www.ti.com/lit/ug/spruh77a/spruh77a.pdf
13 Kestone - http://www.ti.com/lit/ug/sprugz3a/sprugz3a.pdf
17 - compatible: "ti,davinci-aemif"
18 "ti,keystone-aemif"
19 "ti,da850-aemif"
21 - reg: contains offset/length value for AEMIF control registers
24 - #address-cells: Must be 2. The partition number has to be encoded in the
25 first address cell and it may accept values 0..N-1
[all …]
|
| /freebsd/cddl/contrib/opensolaris/tools/ctf/cvt/ |
| H A D | merge.c | 29 * This file contains routines that merge one tdata_t tree, called the child,
34 * tdata_t structures contain two main elements - a hash of iidesc_t nodes, and
35 * a directed graph of tdesc_t nodes, pointed to by the iidesc_t nodes. Simply
36 * put, we merge the tdesc_t graphs, followed by the iidesc_t nodes, and then we
41 * 1. Mapping iidesc_t nodes
43 * For each child iidesc_t node, we first try to map its tdesc_t subgraph
44 * against the tdesc_t graph in the parent. For each node in the child subgraph
46 * is established. For the child nodes that cannot be mapped onto existing
47 * parent nodes, a mapping is established between the child node ID and a
48 * newly-allocated ID that the node will use when it is re-created in the
[all …]
|
| /freebsd/sys/contrib/openzfs/module/avl/ |
| H A D | avl.c | 1 // SPDX-License-Identifier: CDDL-1.0
10 * or https://opensource.org/licenses/CDDL-1.0.
33 * AVL - generic AVL tree implementation for kernel use
47 * rotations, which bring unbalanced subtrees back into the semi-balanced state.
51 * - The AVL specific data structures are physically embedded as fields
56 * - Since the AVL data is always embedded in other structures, there is
62 * - The implementation uses iteration instead of explicit recursion,
67 * - The left/right children pointers of a node are in an array.
77 * int left_heavy; // -1 when left subtree is taller at some node,
81 * int right_heavy;// will be the opposite of left_heavy (-1 or 1)
[all …]
|
| /freebsd/sys/contrib/device-tree/Bindings/slimbus/ |
| H A D | bus.txt | 3 SLIMbus is a 2-wire bus, and is used to communicate with peripheral
4 components like audio-codec.
7 - compatible - name of SLIMbus controller
9 Child nodes:
10 Every SLIMbus controller node can contain zero or more child nodes
15 If child node is not present and it is instantiated after device
18 In some cases it may be necessary to describe non-probeable device
19 details such as non-standard ways of powering up a device. In
20 such cases, child nodes for those devices will be present as
23 Required property for SLIMbus child node if it is present:
[all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | SCCIterator.h | 1 //===- ADT/SCCIterator.h - Strongly Connected Comp. Iter. -------*- C++ -*-===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
20 //===----------------------------------------------------------------------===//
44 /// build up a vector of nodes in a particular SCC. Note that it is a forward
45 /// iterator and thus you cannot backtrack or re-visit nodes.
58 ChildItTy NextChild; ///< The next child, modified inplace during DFS.
61 StackElement(NodeRef Node, const ChildItTy &Child, unsigned Min) in StackElement()
62 : Node(Node), NextChild(Child), MinVisited(Min) {} in StackElement()
74 /// nodeVisitNumbers are per-node visit numbers, also used as DFS flags.
[all …]
|
| /freebsd/sys/contrib/device-tree/Bindings/mtd/ |
| H A D | samsung-s3c2410.txt | 4 - compatible : The possible values are:
5 "samsung,s3c2410-nand"
6 "samsung,s3c2412-nand"
7 "samsung,s3c2440-nand"
8 - reg : register's location and length.
9 - #address-cells, #size-cells : see nand-controller.yaml
10 - clocks : phandle to the nand controller clock
11 - clock-names : must contain "nand"
13 Optional child nodes:
14 Child nodes representing the available nand chips.
[all …]
|
| /freebsd/contrib/googletest/googletest/test/ |
| H A D | gtest_xml_test_utils.py | 47 them are CDATA nodes and have the same value, or both are DOM
54 convertible to a floating-point number and any attribute named
55 "type_param" which only has to be non-empty.
56 * It has an equivalent set of child nodes (including elements and
112 'number of child elements differ in element ' + actual_node.tagName,
114 for child_id, child in expected_children.items():
120 self.AssertEquivalentNodes(child, actual_children[child_id])
132 """Fetches all of the child nodes of element, a DOM Element object.
139 CDATA sections and non-whitespace text nodes are concatenated into a single
141 than the above four is encountered, if two child elements with the same
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Support/ |
| H A D | SuffixTree.cpp | 1 //===- llvm/Support/SuffixTree.cpp - Implement Suffix Tree ------*- C++ -*-===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
11 //===----------------------------------------------------------------------===//
24 if (Internal->isRoot()) in numElementsInSubstring()
26 return N->getEndIdx() - N->getStartIdx() + 1; in numElementsInSubstring()
52 // Collect all leaf nodes of the suffix tree. And for each internal node, in SuffixTree()
53 // record the range of leaf nodes that are descendants of it. in SuffixTree()
73 "Non-root internal nodes must have parents!"); in insertInternalNode()
77 Parent->Children[Edge] = N; in insertInternalNode()
[all …]
|
| /freebsd/contrib/mandoc/ |
| H A D | tag.c | 18 * Functions to tag syntax tree nodes.
42 struct roff_node **nodes; member
57 * Set up the ohash table to collect nodes
58 * where various marked-up terms are documented.
76 free(entry->nodes); in tag_free()
108 if (n->flags & NODE_ID) in tag_put()
115 if (n->child == NULL || n->child->type != ROFFT_TEXT) in tag_put()
117 s = n->child->string; in tag_put()
119 case '-': in tag_put()
125 case '-': in tag_put()
[all …]
|
| H A D | mandoc.3 | 4 .\" Copyright (c) 2010-2017 Ingo Schwarze <schwarze@openbsd.org>
107 .Bl -enum
131 iterate over parse nodes with starting from the
153 .Bl -ohang
174 .Bl -ohang
176 Obtain a text-only representation of a
178 including text contained in its child nodes.
190 .Bl -tag -offset 5n -width inttype
280 Return a file descriptor open for reading or -1 on failure.
320 .Bl -ohang
[all …]
|
| /freebsd/contrib/kyua/utils/config/ |
| H A D | tree.cpp | 33 #include "utils/config/nodes.ipp"
48 /// Constructor with a non-empty root.
71 dynamic_cast< detail::static_inner_node* >(_root->deep_copy()); in deep_copy()
80 /// right-hand side (aka "other") tree.
82 /// Any nodes marked as dynamic "win" over non-dynamic nodes and the resulting
101 _root->combine(detail::tree_key(), other_root)); in combine()
113 /// tree-related issues. The reasons is that define() is a method that does not
114 /// depend on user input: it is intended to pre-populate the tree with a
123 _root->define(key, 0, detail::new_node< detail::dynamic_inner_node >); in define_dynamic()
144 const detail::base_node* raw_node = _root->lookup_ro(key, 0); in is_set()
[all …]
|
| H A D | nodes.cpp | 29 #include "utils/config/nodes.ipp"
73 node->_dynamic = _dynamic; in copy_into()
76 base_node* new_node = (*iter).second->deep_copy(); in copy_into()
78 node->_children[(*iter).first] = new_node; in copy_into()
98 /// \throw bad_combination_error If the two nodes cannot be combined.
109 if (node->_children.find(name) != node->_children.end()) { in combine_children_into()
117 new_node.reset((*iter1).second->deep_copy()); in combine_children_into()
121 new_node.reset((*iter1).second->combine(child_key, in combine_children_into()
125 node->_children[name] = new_node.release(); in combine_children_into()
133 /// nodes are dynamic.
[all …]
|
| /freebsd/sys/contrib/device-tree/Bindings/soc/qcom/ |
| H A D | qcom,gsbi.txt | 3 The GSBI controller is modeled as a node with zero or more child nodes, each
4 representing a serial sub-node device that is mux'd as part of the GSBI
9 - compatible: Should contain "qcom,gsbi-v1.0.0"
10 - cell-index: Should contain the GSBI index
11 - reg: Address range for GSBI registers
12 - clocks: required clock
13 - clock-names: must contain "iface" entry
14 - qcom,mode : indicates MUX value for configuration of the serial interface.
15 Please reference dt-bindings/soc/qcom,gsbi.h for valid mux values.
18 - qcom,crci : indicates CRCI MUX value for QUP CRCI ports. Please reference
[all …]
|
| /freebsd/sys/dts/ |
| H A D | bindings-localbus.txt | 5 1. Properties for localbus nodes
11 Value type: <prop-encoded-array> encoded as arbitrary number of localbus
12 nodes specifiers.
18 a) child node address-cells:
19 - first cell: number of bank (chip select)
20 - second cell: (Marvell devices) Target ID for decoding
24 - address offset: used with parent's node base address to
27 c) child node size-cells:
28 - size: defines amount of memory that should be reserved for
31 1.2 bank-count
[all …]
|