Lines Matching defs:node
196 * takes the selfid_ptrs[] in the HAL struct and sorts them by node number,
277 * and returns the node's speed capabilities.
295 * on this node. This will need to be done to support P1394b
328 * determines what type of node the specified port connects to.
340 "Invalid port number requested for node",
373 s1394_node_t *node;
396 /* Free any cfgrom alloced and zap the node */
398 node = &hal->topology_tree[i];
399 config_rom = node->cfgrom;
401 if (CFGROM_NEW_ALLOC(node) == B_TRUE) {
429 * the node numbers (the order in which the nodes responded to SelfID).
431 * s1394_selfid_packet_t pointer in each node.
447 * nodes which have yet to find their Parent node.
460 /* For each node on the bus initialize its topology_tree entry */
462 /* Make sure that node numbers are correct */
466 "SelfIDs - Invalid node numbering");
483 /* Current node has no parent yet */
486 /* Current node has no connections yet */
489 /* Initialize all ports on this node */
493 /* For each port on the node - highest to lowest */
549 /* If current node has no parents or children - Invalid */
715 * checks that the node_number_list is not full and puts the node number
745 * It resets the "visited" flag for each node in the tree.
769 * resets the "visited" flag for each node in the tree.
793 * resets the "matched" flag for each node in the tree.
849 * nodes correspond to old nodes. Starting with the local node, we
850 * compare both old and new node's ports. Assuming that only one bus
851 * reset has occurred, any node that was connected to another in the old
853 * (physically) to the same node. Using this information, we can rebuild
882 /* Put the node on the queue */
885 /* While the queue is not empty, remove a node */
902 /* Move the target list over to the new node and update */
903 /* the node info. */
980 /* Start at the root node */
1057 * the 1394 bus. If the gap_counts differ from node to node, it initiates
1103 * nodes can communicate. The speed of each node as well as the speed of
1111 * the subgraphs, we visit every node, keeping a list of the nodes we've
1196 /* If the node's speed == min_spd and it hasn't been visited */
1210 /* Add node number to the list */
1292 /* If it's not a valid node, then return slowest_node_speed */
1306 * with the remote node to work.
1364 * Manager's node ID. The IRM is the highest numbered node with both
1379 /* Highest numbered node with L=1 and C=1 */
1398 * registered physical space allocations, then the corresponding node's
1447 * registered physical space allocations, then the corresponding node's
1480 * Set the bit corresponding to this node. This call
1500 * node's bit is cleared. This is done for one target.
1532 * Set the bit corresponding to this node. This call
1552 * root node.