| /src/sys/arch/hpc/hpc/platid_gen/ |
| platid_gen.h | 42 } node_t; typedef in typeref:struct:node_s
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 *);
|
| platid_gen.h | 42 } node_t; typedef in typeref:struct:node_s
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 *);
|
| platid_gen.h | 42 } node_t; typedef in typeref:struct:node_s
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 *);
|
| /src/crypto/external/bsd/heimdal/dist/lib/roken/ |
| tsearch.c | 7 * The node_t structure is for internal use only, lint doesn't grok it.
27 } node_t; typedef in typeref:struct:node
45 node_t *q;
46 node_t **rootp = (node_t **)vrootp;
62 q = malloc(sizeof(node_t)); /* T5: key not found */
79 trecurse(const node_t *root, void (*action)(const void *, VISIT, int),
121 node_t **rootp = (node_t **)vrootp;
122 node_t *q, *r
[all...] |
| tsearch.c | 7 * The node_t structure is for internal use only, lint doesn't grok it.
27 } node_t; typedef in typeref:struct:node
45 node_t *q;
46 node_t **rootp = (node_t **)vrootp;
62 q = malloc(sizeof(node_t)); /* T5: key not found */
79 trecurse(const node_t *root, void (*action)(const void *, VISIT, int),
121 node_t **rootp = (node_t **)vrootp;
122 node_t *q, *r
[all...] |
| tsearch.c | 7 * The node_t structure is for internal use only, lint doesn't grok it.
27 } node_t; typedef in typeref:struct:node
45 node_t *q;
46 node_t **rootp = (node_t **)vrootp;
62 q = malloc(sizeof(node_t)); /* T5: key not found */
79 trecurse(const node_t *root, void (*action)(const void *, VISIT, int),
121 node_t **rootp = (node_t **)vrootp;
122 node_t *q, *r
[all...] |
| /src/crypto/external/cpl/trousers/dist/src/include/daa/ |
| list.h | 20 typedef struct _list_t node_t; // each link is a list "node" typedef in typeref:struct:_list_t
23 node_t *head; // pointer to first node
24 node_t *current;
25 node_t *previous;
|
| list.h | 20 typedef struct _list_t node_t; // each link is a list "node" typedef in typeref:struct:_list_t
23 node_t *head; // pointer to first node
24 node_t *current;
25 node_t *previous;
|
| list.h | 20 typedef struct _list_t node_t; // each link is a list "node" typedef in typeref:struct:_list_t
23 node_t *head; // pointer to first node
24 node_t *current;
25 node_t *previous;
|
| /src/external/gpl3/gcc/dist/gcc/analyzer/ |
| reachability.h | 34 typedef typename GraphTraits::node_t node_t; typedef in class:ana::reachability
38 const node_t *target_node)
42 auto_vec<const node_t *> worklist;
48 const node_t *next = worklist.pop ();
62 bool reachable_from_p (const node_t *src_node) const
|
| reachability.h | 34 typedef typename GraphTraits::node_t node_t; typedef in class:ana::reachability
38 const node_t *target_node)
42 auto_vec<const node_t *> worklist;
48 const node_t *next = worklist.pop ();
62 bool reachable_from_p (const node_t *src_node) const
|
| reachability.h | 34 typedef typename GraphTraits::node_t node_t; typedef in class:ana::reachability
38 const node_t *target_node)
42 auto_vec<const node_t *> worklist;
48 const node_t *next = worklist.pop ();
62 bool reachable_from_p (const node_t *src_node) const
|
| trimmed-graph.h | 37 typedef trimmed_node node_t; typedef in struct:ana::tg_traits
|
| trimmed-graph.h | 37 typedef trimmed_node node_t; typedef in struct:ana::tg_traits
|
| /src/external/gpl3/gcc.old/dist/gcc/analyzer/ |
| reachability.h | 34 typedef typename GraphTraits::node_t node_t; typedef in class:ana::reachability
38 const node_t *target_node)
42 auto_vec<const node_t *> worklist;
48 const node_t *next = worklist.pop ();
62 bool reachable_from_p (const node_t *src_node) const
|
| reachability.h | 34 typedef typename GraphTraits::node_t node_t; typedef in class:ana::reachability
38 const node_t *target_node)
42 auto_vec<const node_t *> worklist;
48 const node_t *next = worklist.pop ();
62 bool reachable_from_p (const node_t *src_node) const
|
| reachability.h | 34 typedef typename GraphTraits::node_t node_t; typedef in class:ana::reachability
38 const node_t *target_node)
42 auto_vec<const node_t *> worklist;
48 const node_t *next = worklist.pop ();
62 bool reachable_from_p (const node_t *src_node) const
|
| trimmed-graph.h | 37 typedef trimmed_node node_t; typedef in struct:ana::tg_traits
|
| trimmed-graph.h | 37 typedef trimmed_node node_t; typedef in struct:ana::tg_traits
|
| /src/include/ |
| search.h | 49 } node_t; typedef in typeref:struct:node
|
| search.h | 49 } node_t; typedef in typeref:struct:node
|
| /src/external/gpl3/gcc/dist/gcc/ |
| shortest-paths.h | 52 typedef typename GraphTraits::node_t node_t; typedef in class:shortest_paths
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,
135 node_t *n
136 = static_cast <node_t *> (m_graph.m_nodes[idx_with_min_dist]);
145 node_t *dest = succ->m_dest;
161 node_t *src = pred->m_src
[all...] |
| shortest-paths.h | 52 typedef typename GraphTraits::node_t node_t; typedef in class:shortest_paths
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,
135 node_t *n
136 = static_cast <node_t *> (m_graph.m_nodes[idx_with_min_dist]);
145 node_t *dest = succ->m_dest;
161 node_t *src = pred->m_src
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| shortest-paths.h | 52 typedef typename GraphTraits::node_t node_t; typedef in class:shortest_paths
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,
135 node_t *n
136 = static_cast <node_t *> (m_graph.m_nodes[idx_with_min_dist]);
145 node_t *dest = succ->m_dest;
161 node_t *src = pred->m_src
[all...] |
| shortest-paths.h | 52 typedef typename GraphTraits::node_t node_t; typedef in class:shortest_paths
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,
135 node_t *n
136 = static_cast <node_t *> (m_graph.m_nodes[idx_with_min_dist]);
145 node_t *dest = succ->m_dest;
161 node_t *src = pred->m_src
[all...] |
