1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
use crate::Tracer;
pub use rustracing::sampler::AllSampler;
use rustracing::span::{FinishedSpan as RtFinishedSpan, SpanReference::*};
use rustracing_jaeger::span::SpanContextState;
use std::collections::{BTreeMap, HashMap};
pub fn new_tracer_with_console_reporter() -> (Tracer, ConsoleReporter) {
let (span_tx, span_rx) = crossbeam_channel::bounded(1000);
let tracer = Tracer::with_sender(AllSampler, span_tx);
(tracer, ConsoleReporter::new(span_rx))
}
#[derive(Debug)]
pub struct ConsoleReporter {
span_rx: crossbeam_channel::Receiver<FinishedSpan>,
span_map: SpanMap,
}
impl ConsoleReporter {
pub fn new(span_rx: crossbeam_channel::Receiver<FinishedSpan>) -> Self {
ConsoleReporter {
span_rx,
span_map: HashMap::new(),
}
}
pub fn clear(&mut self) {
let _ = self.drain();
self.span_map.clear();
}
pub fn drain(&mut self) -> u32 {
let mut count = 0;
while let Ok(span) = self.span_rx.try_recv() {
count += 1;
self.span_map.insert(span.context().state().span_id(), span);
}
count
}
pub fn print(&self, only_events: bool) {
print_span_map(&self.span_map, only_events);
}
}
type FinishedSpan = RtFinishedSpan<SpanContextState>;
type SpanMap = std::collections::HashMap<u64, FinishedSpan>;
fn print_span_events(span: &FinishedSpan) {
for log in span.logs() {
for field in log.fields() {
println!("{}", field.value());
}
}
}
fn print_span(span_map: &SpanMap, span: &FinishedSpan, only_events: bool) {
if only_events {
print_span_events(span);
} else {
let span_id = span.context().state().span_id();
let (span_depth, _span_offset) =
get_span_position(span_map, span_id).expect("span not part of span_map");
let mut spacing = String::new();
for _ in 0..span_depth {
spacing.push_str("\t");
}
let mut tags = String::new();
for tag in span.tags() {
tags.push_str(&format!("{{{} = {:?}}} ", tag.name(), tag.value()));
}
println!("{}[{}] {}", spacing, span.operation_name(), tags);
for log in span.logs() {
for field in log.fields() {
println!("{}!{}! {}", spacing, field.name(), field.value());
}
}
}
}
fn _print_span_stack(span_map: &SpanMap, span_id: u64) {
let maybe_span = span_map.get(&span_id);
let span = match maybe_span {
None => return,
Some(s) => s,
};
for span_ref in span.references() {
match span_ref {
ChildOf(parent) => {
_print_span_stack(span_map, parent.span_id());
}
FollowsFrom(sibling) => {
_print_span_stack(span_map, sibling.span_id());
}
}
}
print_span(span_map, span, false);
}
fn print_span_map(span_map: &SpanMap, only_events: bool) {
let mut sibling_map = HashMap::new();
let mut children_map = HashMap::new();
let mut root_span_list = BTreeMap::new();
for (span_id, span) in span_map {
let (span_depth, span_offset) =
get_span_position(span_map, *span_id).expect("span not part of span_map");
let is_root = span_depth == 0 && span_offset == 0;
if is_root {
let maybe_entry = root_span_list.get(&span.start_time());
let mut span_id_list: Vec<u64> = maybe_entry.unwrap_or(&Vec::new()).to_vec();
span_id_list.push(*span_id);
root_span_list.insert(span.start_time(), span_id_list);
}
for span_ref in span.references() {
match span_ref {
ChildOf(parent) => {
let maybe_children_tree = children_map.remove(&parent.span_id());
let mut children_tree = maybe_children_tree.unwrap_or(BTreeMap::new());
let maybe_entry = children_tree.get(&span.start_time());
let mut span_id_list = maybe_entry.unwrap_or(&Vec::new()).to_vec();
span_id_list.push(*span_id);
children_tree.insert(span.start_time(), span_id_list);
children_map.insert(parent.span_id(), children_tree);
}
FollowsFrom(sibling) => {
let maybe_sibling_tree = sibling_map.remove(&sibling.span_id());
let mut sibling_tree = maybe_sibling_tree.unwrap_or(BTreeMap::new());
let maybe_entry = sibling_tree.get(&span_offset);
let mut span_id_list = maybe_entry.unwrap_or(&Vec::new()).to_vec();
span_id_list.push(*span_id);
sibling_tree.insert(span_offset, span_id_list);
sibling_map.insert(sibling.span_id(), sibling_tree);
}
}
}
}
for (_start_time, span_id_list) in root_span_list.iter() {
for span_id in span_id_list {
print_span_tree(&children_map, &sibling_map, span_map, *span_id, only_events);
}
}
}
fn print_span_tree(
children_map: &HashMap<u64, BTreeMap<std::time::SystemTime, Vec<u64>>>,
sibling_map: &HashMap<u64, BTreeMap<u32, Vec<u64>>>,
span_map: &SpanMap,
span_id: u64,
only_events: bool,
) {
let span = span_map.get(&span_id).expect("Span not found");
print_span(span_map, span, only_events);
let maybe_children_tree = children_map.get(&span_id);
if let Some(children_tree) = maybe_children_tree {
for (_start_time, child_span_id_list) in children_tree.iter() {
for child_span_id in child_span_id_list {
print_span_tree(
children_map,
sibling_map,
span_map,
*child_span_id,
only_events,
);
}
}
}
let maybe_siblings_tree = sibling_map.get(&span_id);
if let Some(sibling_tree) = maybe_siblings_tree {
for (_sibling_offset, sibling_span_id_list) in sibling_tree.iter() {
for sibling_span_id in sibling_span_id_list {
print_span_tree(
children_map,
sibling_map,
span_map,
*sibling_span_id,
only_events,
);
}
}
}
}
fn get_span_position(span_map: &SpanMap, span_id: u64) -> Option<(u32, u32)> {
let maybe_span = span_map.get(&span_id);
let span = match maybe_span {
None => return None,
Some(s) => s,
};
let mut depth = 0;
let mut offset = 0;
for span_ref in span.references() {
match span_ref {
ChildOf(parent) => {
if let Some((parent_depth, _parent_offset)) =
get_span_position(span_map, parent.span_id())
{
depth = parent_depth + 1;
}
}
FollowsFrom(sibling) => {
if let Some((sibling_depth, sibling_offset)) =
get_span_position(span_map, sibling.span_id())
{
depth = sibling_depth;
offset = sibling_offset + 1;
}
}
}
}
Some((depth, offset))
}