| /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 *);
|
| 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) {
|
| platid_gen.c | 72 void gen_list(node_t *);
85 node_t* def_tree;
183 gen_list((node_t*)def_tree->ptr1);
279 gen_list(node_t* np)
330 gen_list((node_t*)np->ptr1);
|
| /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
|
| trimmed-graph.h | 37 typedef trimmed_node node_t; typedef in struct:ana::tg_traits
|
| feasible-graph.h | 41 typedef base_feasible_node node_t; typedef in struct:ana::fg_traits
|
| supergraph.h | 65 typedef supernode node_t; typedef in struct:ana::supergraph_traits
|
| exploded-graph.h | 156 typedef exploded_node node_t; typedef in struct:ana::eg_traits
|
| engine.cc | 5227 typedef viz_callgraph_node node_t;
|
| /src/external/bsd/jemalloc.old/dist/test/unit/ |
| ph.c | 5 typedef struct node_s node_t; typedef in typeref:struct:node_s
10 phn(node_t) link;
15 node_cmp(const node_t *a, const node_t *b) {
31 node_cmp_magic(const node_t *a, const node_t *b) {
39 typedef ph(node_t) heap_t;
40 ph_gen(static, heap_, heap_t, node_t, link, node_cmp_magic);
43 node_print(const node_t *node, unsigned depth) {
45 node_t *leftmost_child, *sibling
[all...] |
| rb.c | 16 typedef struct node_s node_t; typedef in typeref:struct:node_s
21 rb_node(node_t) link;
26 node_cmp(const node_t *a, const node_t *b) {
44 typedef rb_tree(node_t) tree_t;
45 rb_gen(static, tree_, tree_t, node_t, link, node_cmp);
49 node_t key;
72 tree_recurse(node_t *node, unsigned black_height, unsigned black_depth) {
74 node_t *left_node;
75 node_t *right_node
[all...] |
| /src/external/bsd/jemalloc/dist/test/unit/ |
| ph.c | 5 typedef struct node_s node_t; typedef in typeref:struct:node_s
6 ph_structs(heap, node_t);
16 node_cmp(const node_t *a, const node_t *b) {
32 node_cmp_magic(const node_t *a, const node_t *b) {
40 ph_gen(static, heap, node_t, link, node_cmp_magic);
42 static node_t *
43 node_next_get(const node_t *node) {
44 return phn_next_get((node_t *)node, offsetof(node_t, link))
[all...] |
| rb.c | 20 typedef struct node_s node_t; typedef in typeref:struct:node_s
24 rb_node(node_t) link;
56 const node_t *summary_lchild;
57 const node_t *summary_rchild;
62 node_cmp(const node_t *a, const node_t *b) {
83 node_subtree_specialness(node_t *n, const node_t *lchild,
84 const node_t *rchild) {
98 node_summarize(node_t *a, const node_t *lchild, const node_t *rchild)
[all...] |
| /src/lib/libc/stdlib/ |
| tsearch.c | 7 * The node_t structure is for internal use only, lint doesn't grok it.
29 node_t *q;
30 node_t **rootp = (node_t **)vrootp;
49 q = malloc(sizeof(node_t)); /* T5: key not found */
|
| tfind.c | 7 * The node_t structure is for internal use only, lint doesn't grok it.
29 node_t * const *rootp = (node_t * const*)vrootp;
|
| tdelete.c | 7 * The node_t structure is for internal use only, lint doesn't grok it.
30 node_t **rootp = (node_t **)vrootp;
31 node_t *p, *q, *r;
|
| twalk.c | 7 * The node_t structure is for internal use only, lint doesn't grok it.
28 trecurse(const node_t *root, /* Root of the tree to be walked */
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| digraph.h | 30 node_t: the node class
61 typedef typename GraphTraits::node_t node_t; typedef in class:dedge
64 dedge (node_t *src, node_t *dest)
71 node_t *const m_src;
72 node_t *const m_dest;
83 typedef typename GraphTraits::node_t node_t; typedef in class:digraph
101 void add_node (node_t *node)
129 typedef typename GraphTraits::node_t node_t; typedef in class:cluster
[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...] |
| digraph.cc | 44 typedef test_node node_t; typedef in struct:selftest::test_graph_traits
64 test_edge (node_t *src, node_t *dest)
|
| /src/include/ |
| search.h | 49 } node_t; typedef in typeref:struct:node
|
