Home
last modified time | relevance | path

Searched refs:find_node (Results 1 – 11 of 11) sorted by relevance

/netbsd-src/usr.sbin/map-mbone/
H A Dmapper.c89 Node * find_node(u_int32_t addr, Node **ptr);
108 Node *find_node(u_int32_t addr, Node **ptr) in find_node() function
123 return find_node(addr, &(n->left)); in find_node()
125 return find_node(addr, &(n->right)); in find_node()
275 Node *node = find_node(src, &routers); in accept_neighbors()
329 ifc_node = find_node(ifc_addr, &routers); in accept_neighbors()
420 n_node = find_node(neighbor, &routers); in accept_neighbors()
434 Node *node = find_node(src, &routers); in accept_neighbors2()
470 ifc_node = find_node(ifc_addr, &routers); in accept_neighbors2()
564 n_node = find_node(neighbor, &routers); in accept_neighbors2()
[all …]
/netbsd-src/external/gpl2/texinfo/dist/makeinfo/
H A Dnode.c187 find_node (char *name) in find_node() function
279 TAG_ENTRY *tag = find_node (node); in remember_node()
1315 TAG_ENTRY *temp_node = find_node (node); in number_of_node()
1344 result = find_node (tag); in validate()
1431 temp_tag = find_node (tags->next); in validate_file()
1484 temp_tag = find_node (tags->prev); in validate_file()
1590 temp_tag = find_node (tags->up); in validate_file()
H A Dnode.h103 extern TAG_ENTRY *find_node (char *name);
/netbsd-src/external/gpl3/gcc/dist/gcc/
H A Dgenmatch.cc1722 static dt_node *find_node (vec<dt_node *>&, dt_node *);
1781 decision_tree::find_node (vec<dt_node *>& ops, dt_node *p) in find_node() function in decision_tree
1842 kid = decision_tree::find_node (kids, n); in append_node()
1978 elm = decision_tree::find_node (p->kids, &temp); in insert_operand()
1984 elm = decision_tree::find_node (p->kids, &match); in insert_operand()
1990 elm = decision_tree::find_node (p->kids, &temp); in insert_operand()
H A DChangeLog-201722343 (decision_tree::find_node): Relax order requirement when
H A DChangeLog-20143151 (decision_tree::find_node): Treat DT_TRUE as barrier for
/netbsd-src/external/gpl3/gcc.old/dist/gcc/
H A Dgenmatch.c1714 static dt_node *find_node (vec<dt_node *>&, dt_node *);
1773 decision_tree::find_node (vec<dt_node *>& ops, dt_node *p) in find_node() function
1834 kid = decision_tree::find_node (kids, n); in append_node()
1970 elm = decision_tree::find_node (p->kids, &temp); in insert_operand()
1976 elm = decision_tree::find_node (p->kids, &match); in insert_operand()
1982 elm = decision_tree::find_node (p->kids, &temp); in insert_operand()
/netbsd-src/external/gpl3/gcc/dist/libstdc++-v3/
H A DChangeLog-20051819 * include/tr1/hashtable (hashtable<>::find_node): Const-ify.
H A DChangeLog-20064505 * include/tr1/hashtable (hashtable<>::find_node,
/netbsd-src/external/gpl3/gdb/dist/sim/ppc/
H A DChangeLog-20215037 find_node function so that it behaves as specified in p1275.
/netbsd-src/external/gpl2/texinfo/dist/
H A DChangeLog.464009 * makeinfo/node.c (find_node): If NAME isn't found verbatim, try