| /src/usr.bin/nbperf/ |
| graph2.c | 51 SIZED2(_setup)(struct SIZED(graph) *graph, uint32_t v, uint32_t e)
53 graph->v = v;
54 graph->e = e;
56 graph->verts = calloc(sizeof(*graph->verts), v);
57 graph->edges = calloc(sizeof(*graph->edges), e);
58 graph->output_order = calloc(sizeof(uint32_t), e);
60 if (graph->verts == NULL || graph->edges == NULL |
[all...] |
| nbperf-chm.c | 62 * of finding an acyclic graph is very low (for 2-graphs). The constant
65 * After the hashing phase, the graph is checked for cycles.
66 * A cycle-free graph is either empty or has a vertex of degree 1.
68 * so applying this recursively reduces the size of the graph.
69 * If the graph is empty at the end of the process, it was acyclic.
77 struct SIZED(graph) graph;
90 for (i = 0; i < state->graph.e; ++i) {
91 e_idx = state->graph.output_order[i];
92 e = &state->graph.edges[e_idx]
[all...] |
| graph2.h | 35 * Implementation of common 2/3-graph routines:
36 * - build a 2/3-graph with hash-pairs as edges
37 * - check a 2/3-graph for acyclicness and compute an output order
39 * For each vertex in the 2/3-graph, the incidence lists need to kept.
64 #define SIZED2(n) SIZED2_(graph, GRAPH_SIZE, n)
74 struct SIZED(graph) {
84 void SIZED2(_setup)(struct SIZED(graph) *, uint32_t, uint32_t);
85 void SIZED2(_free)(struct SIZED(graph) *);
87 int SIZED2(_hash)(struct nbperf *, struct SIZED(graph) *);
88 int SIZED2(_output_order)(struct SIZED(graph) *graph)
[all...] |
| nbperf-bdz.c | 60 * an acyclic graph can be found with a very high probality.
62 * An acyclic graph has an edge order, where at least one vertex of
73 struct SIZED(graph) graph;
88 for (i = 0; i < state->graph.v; ++i)
91 for (i = 0; i < state->graph.e; ++i) {
92 j = state->graph.output_order[i];
93 e = &state->graph.edges[j];
120 for (i = 0; i < state->graph.v; ++i) {
155 (state->graph.v + 63) / 64)
[all...] |
| /src/usr.sbin/hdaudioctl/ |
| Makefile | 5 SRCS+= graph.c
|
| /src/usr.bin/tsort/ |
| tsort.c | 89 NODE *n_next; /* next node in graph */
104 static NODE *graph, **cycle_buf, **longest_cycle; variable in typeref:typename:NODE *
163 /* parse input and build the graph */
200 * add an arc from node s1 to node s2 in the graph. If s1 or s2 are not in
201 * the graph, then add them.
237 /* Find a node in the graph (insert if not found) and return a pointer to it. */
272 if ((n->n_next = graph) != NULL)
273 graph->n_prevp = &n->n_next;
274 n->n_prevp = &graph;
275 graph = n
[all...] |
| /src/usr.bin/make/unit-tests/ |
| opt-debug-graph1.mk | 4 # graph before making anything.
|
| opt-debug-graph3.mk | 4 # graph before exiting on error.
|
| opt-debug-graph2.mk | 4 # graph after making everything, or before exiting on error.
|
| /src/sys/external/gpl2/dts/dist/arch/arm/boot/dts/ |
| uniphier-pxs2-gentil.dts | 38 compatible = "audio-graph-card";
|
| uniphier-pxs2-vodka.dts | 36 compatible = "audio-graph-card";
|
| mmp2-olpc-xo-1-75.dts | 109 compatible = "audio-graph-card";
|
| stm32mp15xx-dhcom-pdk2.dtsi | 139 compatible = "audio-graph-card";
|
| stm32mp15xx-dhcor-avenger96.dtsi | 90 compatible = "audio-graph-card";
|
| /src/lib/libc/gen/ |
| isctype.c | 96 _ISCTYPE_FUNC(graph, _CTYPE_G)
|
| /src/distrib/utils/libhack/ |
| multibyte.c | 183 MAPSINGLE(graph)
210 WCTENTRY(graph)
|
| /src/sys/external/gpl2/dts/dist/arch/arm64/boot/dts/socionext/ |
| uniphier-ld11-global.dts | 56 compatible = "audio-graph-card";
|
| uniphier-ld20-akebi96.dts | 67 compatible = "audio-graph-card";
|
| uniphier-ld20-global.dts | 56 compatible = "audio-graph-card";
|
| /src/lib/libc/locale/ |
| iswctype_mb.c | 75 _ISWCTYPE_FUNC(graph, _WCTYPE_INDEX_GRAPH)
|
| /src/sys/external/gpl2/dts/dist/arch/arm64/boot/dts/nvidia/ |
| tegra210-p2371-2180.dts | 411 compatible = "nvidia,tegra210-audio-graph-card";
|
| /src/sys/external/gpl2/dts/dist/arch/arm64/boot/dts/renesas/ |
| hihope-common.dtsi | 75 compatible = "audio-graph-card";
|
| ulcb.dtsi | 97 compatible = "audio-graph-card";
|
| /src/usr.sbin/map-mbone/ |
| mapper.c | 765 printf("GRAPH \"Multicast Router Connectivity: %s\" = UNDIRECTED\n",
814 int flood = FALSE, graph = FALSE; local in function:main
835 graph = TRUE;
859 fprintf(stderr, "\t-f Flood the routing graph with queries\n");
939 if (graph)
|
| /src/sys/external/gpl2/dts/dist/arch/arm64/boot/dts/rockchip/ |
| rk3399-rockpro64.dtsi | 87 compatible = "audio-graph-card";
93 compatible = "audio-graph-card";
|
