Lines Matching full:nodes

50 .Em nodes ,
52 Nodes have
54 which are used to connect two nodes together, forming the edges in the graph.
55 Nodes communicate along the edges to process data, implement protocols, etc.
73 .Ss Nodes and Types
78 All nodes implement a number of predefined methods which allow them
79 to interact with other nodes in a well defined manner.
88 to other nodes.
90 In object-oriented language, types are classes, and nodes are instances
98 Nodes may be assigned a globally unique
119 Nodes are connected to other nodes by connecting a pair of
122 Data flows bidirectionally between nodes along
133 on that node (other hooks on other nodes may have the same name).
166 Two types of information flow between nodes: data messages and
179 Along with data, nodes can also receive control messages.
193 Nodes are not required to support these conversions.
196 If there is a sequence of edges connecting the two nodes, the message
243 are passed around between nodes.
306 provides internal synchronization between nodes.
317 .Dq edge nodes
324 .Em edge nodes ,
369 Socket nodes allow user processes to participate in
371 Other nodes communicate with socket nodes using the usual methods, and the
378 Nodes are notified of the following actions via function calls
387 For nodes that correspond to hardware, this is typically done during the
401 hooks, and the links have been made, the nodes get a chance to
430 Some nodes (usually associated with a piece of hardware) may be
446 Two other methods are also supported by all nodes:
577 Much use has been made of reference counts, so that nodes being
610 Also, nodes that have no global name may be addressed by their ID numbers,
625 The following set of nodes might be created for a site with
655 could be used by both nodes C and D to address a message to node A.
682 which might decide to send similar messages to both nodes
684 The nodes would use
694 (for kernel structures only of interest to nodes)
700 .Em nodes
910 a corresponding set of generic messages which all nodes understand.
1008 Persistent nodes such as those representing physical hardware
1015 Nodes can exist without having a name, and this
1016 is the default for nodes created using the
1019 Such nodes can only be addressed relatively or by their ID number.
1022 Both nodes will have their
1042 All named nodes will be described.
1046 except that all nodes are listed regardless of whether they have a name or not.
1100 In addition to the control messages that affect nodes with respect to the
1107 nodes need to handle them if they are going to be used in a graph utilising
1283 .It Various PPP related nodes
1302 This node, together with the Ethernet nodes, allows a very flexible
1314 Refer to the section at the end of this man page for more nodes types.
1329 Nodes are responsible for freeing what they allocate.
1357 nodes.
1366 type nodes.
1371 nodes, including the type cookie definition.