HomeSort by: relevance | last modified time | path
    Searched refs:SIZED (Results 1 - 4 of 4) sorted by relevancy

  /src/usr.bin/nbperf/
graph2.h 61 #define SIZED(n) SIZED_(n, GRAPH_SIZE)
66 struct SIZED(vertex) {
70 struct SIZED(edge) {
74 struct SIZED(graph) {
75 struct SIZED(vertex) *verts;
76 struct SIZED(edge) *edges;
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...]
graph2.c 51 SIZED2(_setup)(struct SIZED(graph) *graph, uint32_t v, uint32_t e)
66 SIZED2(_free)(struct SIZED(graph) *graph)
78 static struct SIZED(graph) *sorting_graph;
85 const struct SIZED(edge) *ea = &sorting_graph->edges[*a],
105 SIZED2(_check_duplicates)(struct nbperf *nbperf, struct SIZED(graph) *graph)
135 SIZED2(_add_edge)(struct SIZED(graph) *graph, uint32_t edge)
137 struct SIZED(edge) *e = graph->edges + edge;
138 struct SIZED(vertex) *v;
149 SIZED2(_remove_edge)(struct SIZED(graph) *graph, uint32_t edge)
151 struct SIZED(edge) *e = graph->edges + edge
    [all...]
nbperf-chm.c 77 struct SIZED(graph) graph;
86 struct SIZED(edge) *e;
122 struct SIZED(edge) *e;
nbperf-bdz.c 73 struct SIZED(graph) graph;
84 struct SIZED(edge) *e;

Completed in 12 milliseconds