Lines Matching defs:leaf
205 uint_t leaf,
243 int leaf,
2360 /* Find the leftmost leaf in the subtree specified by the node. */
2390 /* Find the leaf with the smallest allocated bandwidth */
2483 * Find the leftmost leaf in the subtree specified by the node
2564 /* Find the leftmost leaf in the subtree specified by the node */
2575 /* Find the leaf with the smallest allocated bandwidth */
2945 * nodes from the leaf to the level specified by bandwidth The root of the
2976 * Based on the "real" array leaf node and interval, get the periodic node.
2979 ehci_find_periodic_node(uint_t leaf, int interval) {
2985 /* Get the leaf number in the lattice */
2986 lattice_leaf = leaf + EHCI_NUM_INTR_QH_LISTS - 1;
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
3007 * The leaf of the tree is an array, convert the number for the array.
3113 * hit the leftmost leaf of every possible node with this interval.
3124 * next leaf.
3212 * hit the leftmost leaf of every possible node with this interval.
3225 * next leaf.
3315 * hit the leftmost leaf of every possible node with this interval.
3354 * next leaf.
3435 * hit the leftmost leaf of every possible node with this interval.
3458 * next leaf.
3519 int leaf,
3530 "ehci_calculate_bw_availability_mask: leaf %d leaf count %d",
3531 leaf, leaf_count);
3537 fbp = &ehcip->ehci_frame_bandwidth[leaf + i];
3568 * The leftmost leaf needs to be in terms of array position and
3585 "leaf %d count %d bandwidth 0x%x mask 0x%x",