* Search a node in the tree matching the key. */
| 142 | * Search a node in the tree matching the key. |
| 143 | */ |
| 144 | static struct radix_node * |
| 145 | rn_search(void *v_arg, struct radix_node *head) |
| 146 | { |
| 147 | struct radix_node *x; |
| 148 | caddr_t v; |
| 149 | |
| 150 | for (x = head, v = v_arg; x->rn_bit >= 0;) { |
| 151 | if (x->rn_bmask & v[x->rn_offset]) |
| 152 | x = x->rn_right; |
| 153 | else |
| 154 | x = x->rn_left; |
| 155 | } |
| 156 | return (x); |
| 157 | } |
| 158 | |
| 159 | /* |
| 160 | * Same as above, but with an additional mask. |
no outgoing calls
no test coverage detected