1 | #include "libtrace.h" |
---|
2 | #include "libtrace_int.h" |
---|
3 | #include "data-struct/vector.h" |
---|
4 | #include <assert.h> |
---|
5 | #include <stdlib.h> |
---|
6 | |
---|
7 | static int init_combiner(libtrace_t *t, libtrace_combine_t *c) { |
---|
8 | int i = 0; |
---|
9 | assert(trace_get_perpkt_threads(t) > 0); |
---|
10 | libtrace_vector_t *queues; |
---|
11 | c->queues = calloc(sizeof(libtrace_vector_t), trace_get_perpkt_threads(t)); |
---|
12 | queues = c->queues; |
---|
13 | for (i = 0; i < trace_get_perpkt_threads(t); ++i) { |
---|
14 | libtrace_vector_init(&queues[i], sizeof(libtrace_result_t)); |
---|
15 | } |
---|
16 | return 0; |
---|
17 | } |
---|
18 | |
---|
19 | static void publish(libtrace_t *trace UNUSED, int t_id, libtrace_combine_t *c, libtrace_result_t *res) { |
---|
20 | libtrace_vector_t *vec = &((libtrace_vector_t*)c->queues)[t_id]; |
---|
21 | libtrace_vector_push_back(vec, res); |
---|
22 | } |
---|
23 | |
---|
24 | static void read(libtrace_t *trace UNUSED, libtrace_combine_t *c UNUSED){ |
---|
25 | return; |
---|
26 | } |
---|
27 | |
---|
28 | static int compare_result(const void* p1, const void* p2) |
---|
29 | { |
---|
30 | const libtrace_result_t * r1 = p1; |
---|
31 | const libtrace_result_t * r2 = p2; |
---|
32 | if (r1->key < r2->key) |
---|
33 | return -1; |
---|
34 | if (r1->key == r2->key) |
---|
35 | return 0; |
---|
36 | else |
---|
37 | return 1; |
---|
38 | } |
---|
39 | |
---|
40 | static void pause(libtrace_t *trace, libtrace_combine_t *c) { |
---|
41 | libtrace_vector_t *queues = c->queues; |
---|
42 | int i; |
---|
43 | for (i = 0; i < trace_get_perpkt_threads(trace); ++i) { |
---|
44 | libtrace_vector_apply_function(&queues[i], (vector_data_fn) libtrace_make_result_safe); |
---|
45 | } |
---|
46 | } |
---|
47 | |
---|
48 | static void read_final(libtrace_t *trace, libtrace_combine_t *c) { |
---|
49 | libtrace_vector_t *queues = c->queues; |
---|
50 | int i; |
---|
51 | size_t a; |
---|
52 | // Combine all results into queue 1 |
---|
53 | for (i = 1; i < trace_get_perpkt_threads(trace); ++i) |
---|
54 | { |
---|
55 | libtrace_vector_append(&queues[0],&queues[i]); |
---|
56 | } |
---|
57 | // Sort them |
---|
58 | libtrace_vector_qsort(&queues[0], compare_result); |
---|
59 | |
---|
60 | for (a = 0; a < libtrace_vector_get_size(&queues[0]); ++a) { |
---|
61 | libtrace_result_t r; |
---|
62 | libtrace_generic_t gt = {.res = &r}; |
---|
63 | ASSERT_RET (libtrace_vector_get(&queues[0], a, (void *) &r), == 1); |
---|
64 | if (r.type == RESULT_TICK_INTERVAL || |
---|
65 | r.type == RESULT_TICK_COUNT) { |
---|
66 | /* Ticks are essentially useless for this combiner? */ |
---|
67 | continue; |
---|
68 | } |
---|
69 | send_message(trace, &trace->reporter_thread, MESSAGE_RESULT, |
---|
70 | gt, NULL); |
---|
71 | } |
---|
72 | libtrace_vector_empty(&queues[0]); |
---|
73 | } |
---|
74 | |
---|
75 | static void destroy(libtrace_t *trace, libtrace_combine_t *c) { |
---|
76 | int i; |
---|
77 | libtrace_vector_t *queues = c->queues; |
---|
78 | |
---|
79 | for (i = 0; i < trace_get_perpkt_threads(trace); i++) { |
---|
80 | assert(libtrace_vector_get_size(&queues[i]) == 0); |
---|
81 | libtrace_vector_destroy(&queues[i]); |
---|
82 | } |
---|
83 | free(queues); |
---|
84 | queues = NULL; |
---|
85 | } |
---|
86 | |
---|
87 | DLLEXPORT const libtrace_combine_t combiner_sorted = { |
---|
88 | init_combiner, /* initialise */ |
---|
89 | destroy, /* destroy */ |
---|
90 | publish, /* publish */ |
---|
91 | read, /* read */ |
---|
92 | read_final, /* read_final */ |
---|
93 | pause, /* pause */ |
---|
94 | NULL, /* queues */ |
---|
95 | 0, /* last_count_tick */ |
---|
96 | 0, /* last_ts_tick */ |
---|
97 | {0} /* opts */ |
---|
98 | }; |
---|