Home
last modified time | relevance | path

Searched refs:v_arg (Results 1 – 3 of 3) sorted by relevance

/titanic_44/usr/src/common/net/patricia/
H A Dradix.c176 rn_search(v_arg, head) in rn_search() argument
177 void *v_arg; in rn_search()
183 for (x = head, v = v_arg; x->rn_bit >= 0; ) {
196 rn_search_m(v_arg, head, m_arg) in rn_search_m() argument
198 void *v_arg, *m_arg;
201 caddr_t v = v_arg, m = m_arg;
247 rn_lookup(v_arg, m_arg, head) in rn_lookup() argument
248 void *v_arg, *m_arg; in rn_lookup()
260 x = rn_match(v_arg, head);
304 rn_match(v_arg, head) in rn_match() argument
[all …]
/titanic_44/usr/src/cmd/cmd-inet/usr.sbin/in.routed/
H A Dradix.c115 rn_search(void *v_arg, struct radix_node *head) in rn_search() argument
120 for (x = head, v = v_arg; x->rn_b >= 0; ) { in rn_search()
130 rn_search_m(void *v_arg, struct radix_node *head, void *m_arg) in rn_search_m() argument
133 uint8_t *v = v_arg, *m = m_arg; in rn_search_m()
169 rn_lookup(void *v_arg, void *m_arg, struct radix_node_head *head) in rn_lookup() argument
182 x = rn_match(v_arg, head); in rn_lookup()
218 rn_match(void *v_arg, struct radix_node_head *head) in rn_match() argument
220 uint8_t *v = v_arg; in rn_match()
358 rn_insert(void* v_arg, struct radix_node_head *head, boolean_t *dupentry, in rn_insert() argument
361 uint8_t *v = v_arg; in rn_insert()
[all …]
/titanic_44/usr/src/lib/libscf/common/
H A Dlowlevel.c4775 scf_value_get_as_string_common(const scf_value_t *v_arg, in scf_value_get_as_string_common() argument
4778 scf_handle_t *h = v_arg->value_handle; in scf_value_get_as_string_common()
4785 if (t != REP_PROTOCOL_TYPE_INVALID && !scf_value_check_type(v_arg, t)) { in scf_value_get_as_string_common()
4790 v_s = *v_arg; /* copy locally so we can unlock */ in scf_value_get_as_string_common()