Lines Matching defs:node
52 static uint_t uhci_lattice_parent(uint_t node);
53 static uint_t uhci_leftmost_leaf(uint_t node, uint_t height);
144 list_array[i].node = i;
989 uint_t *node)
1080 *node = uhci_tree_bottom_nodes[min_index];
1083 if (uhcip->uhci_isoc_q_tailp[*node]) {
1084 paddr = (uhcip->uhci_isoc_q_tailp[*node]->link_ptr &
1087 paddr = (uhcip->uhci_frame_lst_tablep[*node] &
1092 *node = tmp_qh->node;
1094 *node = uhci_lattice_parent(*node);
1098 "The real node is %d", *node);
1101 * Find the leftmost leaf in the subtree specified by the node.
1103 leftmost = uhci_leftmost_leaf(*node, height);
1123 * All the leaves for this node must be updated with the bandwidth.
1150 * Deallocate bandwidth for the given node in the lattice
1163 uint_t node, length;
1186 /* Obtain the node */
1187 node = pp->pp_node;
1199 * Find the leftmost leaf in the subtree specified by the node
1201 leftmost = uhci_leftmost_leaf(node, height);
1381 uhci_lattice_parent(uint_t node)
1383 return (((node % 2) == 0) ? ((node/2) - 1) : (node/2));
1389 * Find the leftmost leaf in the subtree specified by the node.
1391 * to the node, including the node.
1394 uhci_leftmost_leaf(uint_t node, uint_t height)
1396 node = pow_2(height + VIRTUAL_TREE_HEIGHT) * (node+1) -
1398 return (node);
1501 uint_t node = pp->pp_node; /* The appropriate node was */
1513 lattice_qh = &uhcip->uhci_qh_pool_addr[node];