| /netbsd-src/external/gpl3/gcc/dist/gcc/ |
| H A D | digraph.h | 61 typedef typename GraphTraits::node_t node_t; typedef
64 dedge (node_t *src, node_t *dest) in dedge()
71 node_t *const m_src;
72 node_t *const m_dest;
83 typedef typename GraphTraits::node_t node_t; typedef
101 void add_node (node_t *node);
104 auto_delete_vec<node_t> m_nodes;
129 typedef typename GraphTraits::node_t node_t; typedef
134 virtual void add_node (node_t *node) = 0;
165 node_t *n; in dump_dot_to_pp()
[all …]
|
| H A D | shortest-paths.h | 52 typedef typename GraphTraits::node_t node_t; typedef
56 shortest_paths (const graph_t &graph, const node_t *given_node,
59 path_t get_shortest_path (const node_t *other_node) const;
60 int get_shortest_distance (const node_t *other_node) const;
91 const node_t *given_node, in shortest_paths()
135 node_t *n in shortest_paths()
136 = static_cast <node_t *> (m_graph.m_nodes[idx_with_min_dist]); in shortest_paths()
145 node_t *dest = succ->m_dest; in shortest_paths()
161 node_t *src = pred->m_src; in shortest_paths()
184 get_shortest_path (const node_t *other_node) const in get_shortest_path()
[all …]
|
| H A D | digraph.cc | 44 typedef test_node node_t; typedef
64 test_edge (node_t *src, node_t *dest) in test_edge()
|
| /netbsd-src/external/gpl3/gcc.old/dist/gcc/ |
| H A D | digraph.h | 61 typedef typename GraphTraits::node_t node_t; typedef
64 dedge (node_t *src, node_t *dest) in dedge()
71 node_t *const m_src;
72 node_t *const m_dest;
83 typedef typename GraphTraits::node_t node_t; typedef
101 void add_node (node_t *node);
104 auto_delete_vec<node_t> m_nodes;
129 typedef typename GraphTraits::node_t node_t; typedef
134 virtual void add_node (node_t *node) = 0;
165 node_t *n; in dump_dot_to_pp()
[all …]
|
| H A D | shortest-paths.h | 36 typedef typename GraphTraits::node_t node_t; typedef
40 shortest_paths (const graph_t &graph, const node_t *origin);
42 path_t get_shortest_path (const node_t *to) const;
65 const node_t *origin) in shortest_paths()
106 node_t *n in shortest_paths()
107 = static_cast <node_t *> (m_graph.m_nodes[idx_with_min_dist]); in shortest_paths()
114 node_t *dest = succ->m_dest; in shortest_paths()
130 shortest_paths<GraphTraits, Path_t>::get_shortest_path (const node_t *to) const in get_shortest_path()
|
| H A D | digraph.cc | 44 typedef test_node node_t; typedef
64 test_edge (node_t *src, node_t *dest) in test_edge()
|
| /netbsd-src/crypto/external/bsd/heimdal/dist/lib/roken/ |
| H A D | tsearch.c | 27 } node_t; typedef
45 node_t *q; in rk_tsearch()
46 node_t **rootp = (node_t **)vrootp; in rk_tsearch()
62 q = malloc(sizeof(node_t)); /* T5: key not found */ in rk_tsearch()
79 trecurse(const node_t *root, void (*action)(const void *, VISIT, int), in trecurse()
121 node_t **rootp = (node_t **)vrootp; in rk_tdelete()
122 node_t *q, *r; in rk_tdelete()
166 node_t **rootp = (node_t **)vrootp; in rk_tfind()
|
| /netbsd-src/external/gpl3/gcc.old/dist/gcc/analyzer/ |
| H A D | reachability.h | 34 typedef typename GraphTraits::node_t node_t; typedef
38 const node_t *target_node) in reachability()
42 auto_vec<const node_t *> worklist; in reachability()
48 const node_t *next = worklist.pop (); in reachability()
62 bool reachable_from_p (const node_t *src_node) const in reachable_from_p()
|
| H A D | supergraph.h | 65 typedef supernode node_t; typedef
|
| /netbsd-src/external/gpl3/gcc/dist/gcc/analyzer/ |
| H A D | reachability.h | 34 typedef typename GraphTraits::node_t node_t; typedef
38 const node_t *target_node) in reachability()
42 auto_vec<const node_t *> worklist; in reachability()
48 const node_t *next = worklist.pop (); in reachability()
62 bool reachable_from_p (const node_t *src_node) const in reachable_from_p()
|
| H A D | trimmed-graph.h | 37 typedef trimmed_node node_t; typedef
|
| H A D | feasible-graph.h | 41 typedef base_feasible_node node_t; typedef
|
| /netbsd-src/sys/arch/hpc/hpc/platid_gen/ |
| H A D | platid_gen.h | 42 } node_t; typedef
44 extern node_t* def_tree;
46 node_t *new_node(int, int, const void *, const void *, node_t *);
48 void dump_node(char *, node_t *);
|
| H A D | gram.y | 53 ((node_t*)(l)->ptr2)->link = (i); \
161 node_t*
166 node_t *link;
168 node_t *res;
170 res = mem_alloc(sizeof(node_t));
182 node_t* n;
185 node_t *np;
205 for (np = (node_t*)n->ptr1; np; np = np->link) {
|
| H A D | platid_gen.c | 72 void gen_list(node_t *);
85 node_t* def_tree;
183 gen_list((node_t*)def_tree->ptr1); in main()
279 gen_list(node_t* np) in gen_list()
330 gen_list((node_t*)np->ptr1); in gen_list()
|
| /netbsd-src/crypto/external/cpl/trousers/dist/src/include/daa/ |
| H A D | list.h | 20 typedef struct _list_t node_t; // each link is a list "node" typedef
23 node_t *head; // pointer to first node
24 node_t *current;
25 node_t *previous;
|
| /netbsd-src/lib/libc/stdlib/ |
| H A D | tsearch.c | 29 node_t *q; in tsearch()
30 node_t **rootp = (node_t **)vrootp; in tsearch()
49 q = malloc(sizeof(node_t)); /* T5: key not found */ in tsearch()
|
| H A D | tdelete.c | 30 node_t **rootp = (node_t **)vrootp; in tdelete()
31 node_t *p, *q, *r; in tdelete()
|
| H A D | tfind.c | 29 node_t * const *rootp = (node_t * const*)vrootp; in tfind()
|
| H A D | twalk.c | 28 trecurse(const node_t *root, /* Root of the tree to be walked */ in trecurse()
|
| /netbsd-src/crypto/external/cpl/trousers/dist/src/tspi/daa/utils/ |
| H A D | list.c | 26 list->current = (node_t *) malloc (sizeof(struct _list_t)); in list_add()
41 node_t *current; in list_dump()
55 node_t *current = list->head; // go to first node in list_freeall()
56 node_t *next; in list_freeall()
|
| /netbsd-src/include/ |
| H A D | search.h | 49 } node_t; typedef
|
| /netbsd-src/crypto/external/cpl/trousers/dist/src/tspi/daa/big_integer/ |
| H A D | bi_openssl.c | 157 node_t *current; in bi_flush_memory()
|
| H A D | bi_gmp.c | 236 node_t *current; in bi_flush_memory()
|
| /netbsd-src/crypto/external/cpl/trousers/dist/src/tspi/daa/daa_issuer/ |
| H A D | prime_gen.c | 55 node_t *current; in generate_small_primes()
|