| /minix3/usr.bin/nbperf/ |
| H A D | graph3.c | 53 graph3_setup(struct graph3 *graph, uint32_t v, uint32_t e) in graph3_setup() argument
55 graph->v = v; in graph3_setup()
56 graph->e = e; in graph3_setup()
58 graph->verts = calloc(sizeof(struct vertex3), v); in graph3_setup()
59 graph->edges = calloc(sizeof(struct edge3), e); in graph3_setup()
60 graph->output_order = calloc(sizeof(uint32_t), e); in graph3_setup()
62 if (graph->verts == NULL || graph->edges == NULL || in graph3_setup()
63 graph->output_order == NULL) in graph3_setup()
68 graph3_free(struct graph3 *graph) in graph3_free() argument
70 free(graph->verts); in graph3_free()
[all …]
|
| H A D | graph2.c | 53 graph2_setup(struct graph2 *graph, uint32_t v, uint32_t e) in graph2_setup() argument
55 graph->v = v; in graph2_setup()
56 graph->e = e; in graph2_setup()
58 graph->verts = calloc(sizeof(struct vertex2), v); in graph2_setup()
59 graph->edges = calloc(sizeof(struct edge2), e); in graph2_setup()
60 graph->output_order = calloc(sizeof(uint32_t), e); in graph2_setup()
62 if (graph->verts == NULL || graph->edges == NULL || in graph2_setup()
63 graph->output_order == NULL) in graph2_setup()
68 graph2_free(struct graph2 *graph) in graph2_free() argument
70 free(graph->verts); in graph2_free()
[all …]
|
| H A D | nbperf-chm.c | 82 struct graph3 graph; member
84 struct graph2 graph;
101 for (i = 0; i < state->graph.e; ++i) { in assign_nodes()
102 e_idx = state->graph.output_order[i]; in assign_nodes()
103 e = &state->graph.edges[e_idx]; in assign_nodes()
107 state->g[e->left] = (2 * state->graph.e + e_idx in assign_nodes()
109 % state->graph.e; in assign_nodes()
111 state->g[e->middle] = (2 * state->graph.e + e_idx in assign_nodes()
113 % state->graph.e; in assign_nodes()
115 state->g[e->right] = (2 * state->graph.e + e_idx in assign_nodes()
[all …]
|
| H A D | nbperf-bdz.c | 72 struct graph3 graph; member
87 for (i = 0; i < state->graph.v; ++i) in assign_nodes()
90 for (i = 0; i < state->graph.e; ++i) { in assign_nodes()
91 j = state->graph.output_order[i]; in assign_nodes()
92 e = &state->graph.edges[j]; in assign_nodes()
119 for (i = 0; i < state->graph.v; ++i) { in assign_nodes()
154 (state->graph.v + 63) / 64); in print_hash()
156 for (i = 0; i < state->graph.v; ++i) { in print_hash()
176 (state->graph.v + 63) / 64); in print_hash()
178 for (i = 0; i < state->graph.v; ++i) { in print_hash()
[all …]
|
| /minix3/usr.bin/tsort/ |
| H A D | tsort.c | 101 static NODE *graph, **cycle_buf, **longest_cycle; variable
276 if ((n->n_next = graph) != NULL) in get_node()
277 graph->n_prevp = &n->n_next; in get_node()
278 n->n_prevp = &graph; in get_node()
279 graph = n; in get_node()
298 for (n = graph; n != NULL; n = n->n_next) in clear_cycle()
309 while (graph != NULL) { in tsort()
316 for (cnt = 0, n = graph; n != NULL; n = next) { in tsort()
323 } while (graph != NULL && cnt); in tsort()
325 if (graph == NULL) in tsort()
[all …]
|
| /minix3/external/bsd/libc++/dist/libcxx/test/std/localization/locale.categories/category.ctype/locale.ctype.byname/ |
| H A D | is_many.pass.cpp | 51 assert( (m[0] & F::graph)); in main()
65 assert(!(m[1] & F::graph)); in main()
79 assert( (m[2] & F::graph)); in main()
93 assert(!(m[3] & F::graph)); in main()
107 assert( (m[4] & F::graph)); in main()
121 assert( (m[5] & F::graph)); in main()
135 assert( (m[6] & F::graph)); in main()
160 assert(!(m[0] & F::graph)); in main()
174 assert(!(m[1] & F::graph)); in main()
188 assert( (m[2] & F::graph)); in main()
[all …]
|
| H A D | is_1.pass.cpp | 62 assert(f.is(F::graph, L'.')); in main()
63 assert(!f.is(F::graph, L'\x07')); in main()
105 assert(f.is(F::graph, L'.')); in main()
106 assert(!f.is(F::graph, L'\x07')); in main()
|
| /minix3/external/bsd/libc++/dist/libcxx/test/localization/locale.categories/category.ctype/locale.ctype.byname/ |
| H A D | is_many.pass.cpp | 49 assert( (m[0] & F::graph)); in main()
63 assert(!(m[1] & F::graph)); in main()
77 assert( (m[2] & F::graph)); in main()
91 assert(!(m[3] & F::graph)); in main()
105 assert( (m[4] & F::graph)); in main()
119 assert( (m[5] & F::graph)); in main()
133 assert( (m[6] & F::graph)); in main()
158 assert(!(m[0] & F::graph)); in main()
172 assert(!(m[1] & F::graph)); in main()
186 assert( (m[2] & F::graph)); in main()
[all …]
|
| H A D | is_1.pass.cpp | 60 assert(f.is(F::graph, L'.')); in main()
61 assert(!f.is(F::graph, L'\x07')); in main()
103 assert(f.is(F::graph, L'.')); in main()
104 assert(!f.is(F::graph, L'\x07')); in main()
|
| /minix3/external/bsd/file/dist/magic/magdir/ |
| H A D | graphviz | 7 # line matches a LaTeX file containing the word "graph" (with a {
9 #0 regex/100l [\r\n\t\ ]*graph[\r\n\t\ ]+.*\\{ graphviz graph text
|
| H A D | visx | 29 >2 byte 130 (graph)
30 >2 byte 131 (adjacency graph)
31 >2 byte 132 (adjacency graph library)
|
| /minix3/external/bsd/libc++/dist/libcxx/test/std/localization/locale.categories/category.ctype/facet.ctype.special/facet.ctype.char.members/ |
| H A D | is_many.pass.cpp | 46 assert(!(m[0] & F::graph)); in main()
60 assert( (m[1] & F::graph)); in main()
74 assert(!(m[2] & F::graph)); in main()
88 assert( (m[3] & F::graph)); in main()
102 assert( (m[4] & F::graph)); in main()
116 assert( (m[5] & F::graph)); in main()
|
| H A D | is_1.pass.cpp | 56 assert(f.is(F::graph, '.')); in main()
57 assert(!f.is(F::graph, '\x07')); in main()
|
| /minix3/external/bsd/libc++/dist/libcxx/test/localization/locale.categories/category.ctype/locale.ctype/locale.ctype.members/ |
| H A D | is_many.pass.cpp | 46 assert(!(m[0] & F::graph)); in main()
60 assert( (m[1] & F::graph)); in main()
74 assert(!(m[2] & F::graph)); in main()
88 assert( (m[3] & F::graph)); in main()
102 assert( (m[4] & F::graph)); in main()
116 assert( (m[5] & F::graph)); in main()
|
| /minix3/external/bsd/libc++/dist/libcxx/test/localization/locale.categories/category.ctype/facet.ctype.special/facet.ctype.char.members/ |
| H A D | is_many.pass.cpp | 46 assert(!(m[0] & F::graph)); in main()
60 assert( (m[1] & F::graph)); in main()
74 assert(!(m[2] & F::graph)); in main()
88 assert( (m[3] & F::graph)); in main()
102 assert( (m[4] & F::graph)); in main()
116 assert( (m[5] & F::graph)); in main()
|
| H A D | is_1.pass.cpp | 56 assert(f.is(F::graph, '.')); in main()
57 assert(!f.is(F::graph, '\x07')); in main()
|
| /minix3/external/bsd/libc++/dist/libcxx/test/std/localization/locale.categories/category.ctype/locale.ctype/locale.ctype.members/ |
| H A D | is_many.pass.cpp | 46 assert(!(m[0] & F::graph)); in main()
60 assert( (m[1] & F::graph)); in main()
74 assert(!(m[2] & F::graph)); in main()
88 assert( (m[3] & F::graph)); in main()
102 assert( (m[4] & F::graph)); in main()
116 assert( (m[5] & F::graph)); in main()
|
| /minix3/external/bsd/llvm/dist/llvm/test/Analysis/CallGraph/ |
| H A D | 2008-09-09-DirectCall.ll | 3 ; CHECK: Call graph node <<null function>>
5 ; CHECK: Call graph node for function: 'caller'
|
| H A D | no-intrinsics.ll | 3 ; Check that intrinsics aren't added to the call graph
12 ; CHECK: Call graph node for function: 'f'
|
| /minix3/external/bsd/byacc/dist/ |
| H A D | descrip.mms | 8 error.obj,graph.obj, \
42 graph.obj : graph.c
|
| /minix3/external/bsd/libc++/dist/libcxx/test/re/re.traits/ |
| H A D | lookup_classname.pass.cpp | 85 test("graph", std::ctype_base::graph); in main()
86 test("GRAPH", std::ctype_base::graph); in main()
87 test("graph", std::ctype_base::graph, true); in main()
88 test("Graph", std::ctype_base::graph, true); in main()
173 test(L"graph", std::ctype_base::graph); in main()
174 test(L"GRAPH", std::ctype_base::graph); in main()
175 test(L"graph", std::ctype_base::graph, true); in main()
176 test(L"Graph", std::ctype_base::graph, true); in main()
|
| /minix3/external/bsd/libc++/dist/libcxx/test/std/re/re.traits/ |
| H A D | lookup_classname.pass.cpp | 85 test("graph", std::ctype_base::graph); in main()
86 test("GRAPH", std::ctype_base::graph); in main()
87 test("graph", std::ctype_base::graph, true); in main()
88 test("Graph", std::ctype_base::graph, true); in main()
173 test(L"graph", std::ctype_base::graph); in main()
174 test(L"GRAPH", std::ctype_base::graph); in main()
175 test(L"graph", std::ctype_base::graph, true); in main()
176 test(L"Graph", std::ctype_base::graph, true); in main()
|
| /minix3/crypto/external/bsd/heimdal/dist/lib/hcrypto/libtommath/ |
| H A D | booker.pl | 15 $graph = "";
17 $graph = ".ps";
254 print OUT "\\begin{center}\n\\begin{figure}[here]\n\\includegraphics{pics/$m[1]$graph}\n";
|
| /minix3/external/bsd/libc++/dist/libcxx/test/localization/locale.categories/category.ctype/ |
| H A D | ctype_base.pass.cpp | 64 assert(std::ctype_base::graph == (std::ctype_base::alnum | std::ctype_base::punct)); in main()
77 test(std::ctype_base::graph); in main()
|
| /minix3/external/bsd/libc++/dist/libcxx/test/std/localization/locale.categories/category.ctype/ |
| H A D | ctype_base.pass.cpp | 64 assert(std::ctype_base::graph == (std::ctype_base::alnum | std::ctype_base::punct)); in main()
77 test(std::ctype_base::graph); in main()
|