Lines Matching defs:node

203 static uint_t	ehci_lattice_parent(uint_t		node);
207 static uint_t ehci_leftmost_leaf(uint_t node,
2360 /* Find the leftmost leaf in the subtree specified by the node. */
2383 * All the leaves for this node must be updated with the bandwidth.
2411 * Deallocate bandwidth for the given node in the lattice and the length
2483 * Find the leftmost leaf in the subtree specified by the node
2564 /* Find the leftmost leaf in the subtree specified by the node */
2958 * Given a node in the lattice, find the index of the parent node
2961 ehci_lattice_parent(uint_t node)
2963 if ((node % 2) == 0) {
2965 return ((node/2) - 1);
2968 return ((node + 1)/2 - 1);
2976 * Based on the "real" array leaf node and interval, get the periodic node.
2988 /* Get the node in the lattice based on the height and leaf */
3001 * Find the leftmost leaf in the subtree specified by the node. Height refers
3002 * to number of nodes from the bottom of the tree to the node, including the
3003 * node.
3018 uint_t node,
3021 return ((ehci_pow_2(height) * (node + 1)) - EHCI_NUM_INTR_QH_LISTS);
3113 * hit the leftmost leaf of every possible node with this interval.
3123 * If this node cannot support our requirements skip to the
3132 * satisfied with one of smasks in this node.
3147 * o This is the node with the least amount of bandwidth
3160 * If we find node that can handle the bandwidth populate the
3212 * hit the leftmost leaf of every possible node with this interval.
3224 * If this node cannot support our requirements skip to the
3233 * satisfied with one of smasks in this node.
3251 * o This is the node with the least amount of bandwidth
3265 * If we find node that can handle the bandwidth populate the
3315 * hit the leftmost leaf of every possible node with this interval.
3353 * If this node cannot support our requirements skip to the
3373 * o This is the node with the least amount of bandwidth
3387 * If we find node that can handle the bandwidth populate the
3435 * hit the leftmost leaf of every possible node with this interval.
3457 * If this node cannot support our requirements skip to the
3477 * o This is the node with the least amount of bandwidth
3489 * If we find node that can handle the bandwidth populate the
3509 * Returns the "total bandwidth used" in this node.