-
Notifications
You must be signed in to change notification settings - Fork 12
/
two-event.c
1816 lines (1554 loc) · 60 KB
/
two-event.c
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
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
#include <unistd.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <linux/list.h>
#include <linux/zalloc.h>
#include <linux/rblist.h>
#include <linux/compiler.h>
#include <linux/err.h>
#include <monitor.h>
#include <tep.h>
#include <trace_helpers.h>
#include <stack_helpers.h>
#include <latency_helpers.h>
#include <two-event.h>
#define TASK_COMM_LEN 16
static int two_event_node_cmp(struct rb_node *rbn, const void *entry)
{
struct two_event *two = container_of(rbn, struct two_event, rbnode);
const struct two_event *e = entry;
if (two->tp1 > e->tp1)
return 1;
else if (two->tp1 < e->tp1)
return -1;
else {
// tp2 may be NULL
if (two->tp2 > e->tp2)
return 1;
else if (two->tp2 < e->tp2)
return -1;
return 0;
}
}
static struct rb_node *two_event_node_new(struct rblist *rlist, const void *new_entry)
{
struct two_event_class *class = container_of(rlist, struct two_event_class, two_events);
const struct two_event *e = new_entry;
struct two_event *two = malloc(class->impl->instance_size);
if (two) {
memset(two, 0, class->impl->instance_size);
RB_CLEAR_NODE(&two->rbnode);
two->class = class;
two->tp1 = e->tp1;
two->tp2 = e->tp2;
two->id = class->ids++;
rblist__findnew(&class->two_events_byid, two);
return &two->rbnode;
} else
return NULL;
}
static void two_event_node_delete(struct rblist *rblist, struct rb_node *rb_node)
{
struct two_event_class *class = container_of(rblist, struct two_event_class, two_events);
struct two_event *two = container_of(rb_node, struct two_event, rbnode);
if (!two->deleting) {
two->deleting = true;
/*
* In the two_event_class_delete function, all two_event objects are deleted.
* Therefore, the derived object is deleted here.
*/
class->impl->object_delete(class, two);
}
rblist__remove_node(&class->two_events_byid, &two->rbnode_byid);
free(two);
}
static int two_event_node_cmp_byid(struct rb_node *rbn, const void *entry)
{
struct two_event *two = container_of(rbn, struct two_event, rbnode_byid);
const struct two_event *e = entry;
if (two->id > e->id)
return 1;
else if (two->id < e->id)
return -1;
else
return 0;
}
static struct rb_node *two_event_node_new_byid(struct rblist *rlist, const void *new_entry)
{
struct two_event *two = (struct two_event *)new_entry;
RB_CLEAR_NODE(&two->rbnode_byid);
return &two->rbnode_byid;
}
static void two_event_node_delete_byid(struct rblist *rblist, struct rb_node *rb_node)
{
}
static struct two_event *two_event_new(struct two_event_class *class, struct tp *tp1, struct tp *tp2)
{
struct two_event entry = {
.tp1 = tp1,
.tp2 = tp2,
};
struct rb_node *rbn = rblist__findnew(&class->two_events, &entry);
struct two_event *two = NULL;
if (rbn) {
two = container_of(rbn, struct two_event, rbnode);
}
return two;
}
static void two_event_delete(struct two_event_class *class, struct two_event *two)
{
if (two && !two->deleting) {
two->deleting = true;
rblist__remove_node(&class->two_events, &two->rbnode);
}
}
static struct two_event *two_event_find(struct two_event_class *class, struct tp *tp1, struct tp *tp2)
{
struct two_event entry = {
.tp1 = tp1,
.tp2 = tp2,
};
struct rb_node *rbn = rblist__find(&class->two_events, &entry);
struct two_event *two = NULL;
if (rbn) {
two = container_of(rbn, struct two_event, rbnode);
}
return two;
}
static struct two_event *two_event_find_byid(struct two_event_class *class, unsigned int id)
{
struct two_event entry = {
.id = id,
};
struct rb_node *rbn = NULL;
struct two_event *two = NULL;
rbn = rblist__find(&class->two_events_byid, &entry);
if (rbn) {
two = container_of(rbn, struct two_event, rbnode_byid);
}
return two;
}
static void dummy_two(struct two_event *two, union perf_event *event1, union perf_event *event2, struct event_info *info, struct event_iter *iter) {}
static remaining_return dummy_remaining(struct two_event *two, union perf_event *event1, struct event_info *info, struct event_iter *iter) {return REMAINING_BREAK;}
static int dummy_print_header(struct two_event *two) {return 0;}
static void dummy_print(struct two_event *two) {}
static struct two_event_class *two_event_class_new(struct two_event_impl *impl, struct two_event_options *options)
{
struct two_event_class *class = malloc(impl->class_size);
if (!class)
return NULL;
memset(class, 0, impl->class_size);
class->ids = 0;
class->impl = impl;
class->opts = *options;
if (class->opts.keyname && class->opts.keylen == 0)
class->opts.keylen = strlen(class->opts.keyname);
rblist__init(&class->two_events);
class->two_events.node_cmp = two_event_node_cmp;
class->two_events.node_new = two_event_node_new;
class->two_events.node_delete = two_event_node_delete;
rblist__init(&class->two_events_byid);
class->two_events_byid.node_cmp = two_event_node_cmp_byid;
class->two_events_byid.node_new = two_event_node_new_byid;
class->two_events_byid.node_delete = two_event_node_delete_byid;
class->two = dummy_two;
class->remaining = dummy_remaining;
class->print_header = dummy_print_header;
class->print = dummy_print;
return class;
}
static void two_event_class_delete(struct two_event_class *class)
{
if (class) {
rblist__exit(&class->two_events);
free(class);
}
}
static void impl_init(struct two_event_impl *impl)
{
/* class */
if (!impl->class_size)
impl->class_size = sizeof(struct two_event_class);
if (!impl->class_new)
impl->class_new = two_event_class_new;
if (!impl->class_delete)
impl->class_delete = two_event_class_delete;
/* object */
if (!impl->instance_size)
impl->instance_size = sizeof(struct two_event);
if (!impl->object_new)
impl->object_new = two_event_new;
if (!impl->object_delete)
impl->object_delete = two_event_delete;
if (!impl->object_find)
impl->object_find = two_event_find;
}
/*
* Delay between two events
*
* Count the maximum, minimum, and average values of each instance.
* And can output delay heatmap.
**/
struct delay {
struct two_event base;
struct heatmap *heatmap;
};
struct delay_class {
struct two_event_class base;
int max_len1;
int max_len2;
struct latency_dist *lat_dist;
bool global_comm;
};
static struct two_event *delay_new(struct two_event_class *class, struct tp *tp1, struct tp *tp2)
{
struct two_event *two = two_event_new(class, tp1, tp2);
struct delay *delay = NULL;
struct delay_class *delay_class = NULL;
if (two) {
delay = container_of(two, struct delay, base);
delay_class = container_of(two->class, struct delay_class, base);
if (!tp2)
return two;
if (strlen(tp1->alias ?: tp1->name) > delay_class->max_len1)
delay_class->max_len1 = strlen(tp1->alias ?: tp1->name);
if (strlen(tp2->alias ?: tp2->name) > delay_class->max_len2)
delay_class->max_len2 = strlen(tp2->alias ?: tp2->name);
if (class->opts.heatmap) {
char buff[1024];
snprintf(buff, sizeof(buff), "%s-%s-%s", class->opts.heatmap, tp1->alias ?: tp1->name, tp2->alias ?: tp2->name);
delay->heatmap = heatmap_open("ns", "ns", buff);
}
}
return two;
}
static void delay_delete(struct two_event_class *class, struct two_event *two)
{
struct delay *delay = NULL;
if (two) {
delay = container_of(two, struct delay, base);
heatmap_close(delay->heatmap);
two_event_delete(class, two);
}
}
static inline void __make_buff(char *buff, int len, const char *debug_msg, s64 time, const char *reason)
{
*buff++ = '|';
if (unlikely(debug_msg)) {
char *end = buff + len - 1;
*buff++ = ' ';
while (*debug_msg && buff < end)
*buff++ = *debug_msg++;
} else if (reason) {
snprintf(buff, len - 1, " %12.3f %s", time/1000.0, reason);
return;
}
*buff++ = '\0';
}
static void delay_two(struct two_event *two, union perf_event *event1, union perf_event *event2, struct event_info *info, struct event_iter *iter)
{
struct delay *delay = NULL;
struct delay_class *delay_class = NULL;
struct two_event_options *opts;
struct multi_trace_type_header *e1 = (void *)event1->sample.array;
struct multi_trace_type_header *e2 = (void *)event2->sample.array;
u64 key = info->key;
u64 delta = 0;
const char *unit, *dummy;
void *raw;
int size;
int track_tid;
char buff[27];
if (two) {
delay = container_of(two, struct delay, base);
delay_class = container_of(two->class, struct delay_class, base);
opts = &two->class->opts;
if (e2->time > e1->time) {
delta = e2->time - e1->time;
latency_dist_input(delay_class->lat_dist, key, (u64)two->id, delta, opts->greater_than);
if (delay->heatmap)
heatmap_write(delay->heatmap, e2->time, delta);
if ((opts->greater_than && delta > opts->greater_than) ||
unlikely(opts->lower_than && delta < opts->lower_than)) {
unit = opts->env->tsc ? "kcyc" : "us";
if (iter)
iter->recent_cpu = opts->comm ? e1->cpu_entry.cpu : -1;
// print events before event1
if (iter && iter->start && iter->start != iter->event1) {
bool printed = false;
s64 neg;
event_iter_cmd(iter, CMD_RESET);
neg = iter->time - e1->time;
do {
if (event_need_to_print(event1, event2, info, iter)) {
if (!printed) printf("-Previous %.3f %s\n", neg/1000.0, unit);
printed = true;
__make_buff(buff, sizeof(buff), iter->debug_msg, iter->time - e1->time, iter->reason);
multi_trace_print_title(iter->event, iter->tp, buff);
}
if (!event_iter_cmd(iter, CMD_NEXT))
break;
} while (iter->curr != iter->event1);
}
// print event1
if (iter)
event_iter_cmd(iter, CMD_EVENT1);
multi_trace_print(event1, two->tp1);
if (iter) {
// cpu tracking for event1
// opts->comm: rundelay, syscalls. The key is pid.
track_tid = opts->comm ? (int)key : e1->tid_entry.tid;
if (track_tid > 0) {
multi_trace_raw_size(event1, &raw, &size, two->tp1);
tp_target_cpu(two->tp1, raw, size, e1->cpu_entry.cpu, track_tid, &iter->recent_cpu, &iter->reason);
}
// rundelay, tracking running time.
if (opts->rundelay) {
iter->curr_cpu[0] = e1->cpu_entry.cpu;
iter->curr_cpu[1] = e2->cpu_entry.cpu;
iter->curr_cpu[2] = iter->recent_cpu;
iter->curr_time[0] = iter->time;
if (!tp_oncpu(two->tp1, raw, size, &iter->curr_pid[0], &dummy))
iter->curr_pid[0] = e1->tid_entry.tid;
if (iter->curr_cpu[2] == iter->curr_cpu[0]) {
iter->curr_pid[2] = iter->curr_pid[0];
iter->curr_time[2] = iter->curr_time[0];
}
}
}
// print event1 to event2
if (iter) {
bool first = true;
int hide = 0;
struct {
u64 time;
union perf_event *event;
struct tp *tp;
const char *debug_msg;
const char *reason;
} prev = {0, NULL, NULL, NULL};
snprintf(buff, sizeof(buff), "|+%12.3f %s", delta/1000.0, unit);
while (event_iter_cmd(iter, CMD_NEXT)) {
if (iter->curr == iter->event2)
break;
if (event_need_to_print(event1, event2, info, iter)) {
if (!first && opts->hide_than) {
if (iter->time - prev.time < opts->hide_than) {
hide ++;
goto set_prev;
}
if (hide) {
if (--hide) printf("| %17d hidden\n", hide);
__make_buff(buff, sizeof(buff), prev.debug_msg, prev.time - e1->time, prev.reason);
multi_trace_print_title(prev.event, prev.tp, buff);
}
}
if (!first) {
if (iter->comm) __make_buff(buff, sizeof(buff), iter->debug_msg, iter->running_time, iter->comm);
else __make_buff(buff, sizeof(buff), iter->debug_msg, iter->time - e1->time, iter->reason);
}
multi_trace_print_title(iter->event, iter->tp, buff);
first = false;
hide = 0;
set_prev:
prev.time = iter->time;
prev.event = iter->event;
prev.tp = iter->tp;
prev.debug_msg = iter->debug_msg;
prev.reason = iter->reason;
}
}
if (first)
printf("%s\n", buff);
if (hide)
printf("| %17d hidden\n", hide);
}
// print event2
if (iter)
event_iter_cmd(iter, CMD_EVENT2);
multi_trace_print(event2, two->tp2);
if (iter) {
// cpu tracking for event2
track_tid = opts->comm ? (int)key : e1->tid_entry.tid;
if (track_tid > 0) {
multi_trace_raw_size(event2, &raw, &size, two->tp2);
tp_target_cpu(two->tp2, raw, size, e2->cpu_entry.cpu, track_tid, &iter->recent_cpu, &iter->reason);
}
}
// print events after event2
if (iter && opts->env->after_event2) {
union perf_event *last = NULL;
while (event_iter_cmd(iter, CMD_NEXT)) {
if (iter->time - e2->time > opts->env->after_event2)
break;
if (event_need_to_print(event1, event2, info, iter)) {
__make_buff(buff, sizeof(buff), iter->debug_msg, iter->time - e1->time, iter->reason);
multi_trace_print_title(iter->event, iter->tp, buff);
last = iter->event;
} else if (last)
last = iter->event;
}
if (last) {
struct multi_trace_type_header *e = (void *)last->sample.array;
printf("`After %.3f %s\n", (e->time - e2->time)/1000.0, unit);
}
}
}
}
}
}
static remaining_return delay_remaining(struct two_event *two, union perf_event *event1, struct event_info *info, struct event_iter *iter)
{
struct two_event_options *opts;
struct multi_trace_type_header *e1 = (void *)event1->sample.array;
const char *unit;
u64 delta = 0;
void *raw;
int size;
int track_tid;
if (info->rr != REMAINING_LOST)
return REMAINING_BREAK;
if (two) {
opts = &two->class->opts;
if (!opts->greater_than || !iter)
return REMAINING_BREAK;
delta = info->recent_time - e1->time;
if (delta > opts->greater_than) {
unit = opts->env->tsc ? "kcyc" : "us";
if (iter)
iter->recent_cpu = opts->comm ? e1->cpu_entry.cpu : -1;
// print events before event1
if (iter && iter->start && iter->start != iter->event1) {
struct multi_trace_type_header *e;
bool printed = false;
s64 neg;
event_iter_cmd(iter, CMD_RESET);
e = (void *)iter->event->sample.array;
neg = e->time - e1->time;
do {
if (event_need_to_print(event1, NULL, info, iter)) {
if (!printed) printf("-Previous %.3f %s\n", neg/1000.0, unit);
printed = true;
multi_trace_print_title(iter->event, iter->tp, "|");
}
if (!event_iter_cmd(iter, CMD_NEXT))
break;
} while (iter->curr != iter->event1);
}
// print event1
multi_trace_print(event1, two->tp1);
if (iter) {
track_tid = opts->comm ? (int)info->key : e1->tid_entry.tid;
if (track_tid > 0) {
multi_trace_raw_size(event1, &raw, &size, two->tp1);
tp_target_cpu(two->tp1, raw, size, e1->cpu_entry.cpu, track_tid, &iter->recent_cpu, &iter->reason);
}
}
// print event1 to event2
if (iter) {
bool first = true;
char buff[32];
snprintf(buff, sizeof(buff), "| >= %12.3f %s", delta/1000.0, unit);
event_iter_cmd(iter, CMD_EVENT1);
while (event_iter_cmd(iter, CMD_NEXT)) {
if (iter->curr == iter->event2)
break;
if (event_need_to_print(event1, NULL, info, iter)) {
multi_trace_print_title(iter->event, iter->tp, first ? buff : "|");
first = false;
}
}
printf("| >= %12.3f %s, event2 may be lost.\n", delta/1000.0, unit);
}
}
}
return REMAINING_CONTINUE;
}
static void delay_print_node(void *opaque, struct latency_node *node)
{
struct delay_class *delay_class = opaque;
struct two_event_options *opts = &delay_class->base.opts;
struct two_event *two = two_event_find_byid(&delay_class->base, node->key);
double p50 = tdigest_quantile(node->td, 0.50);
double p95 = tdigest_quantile(node->td, 0.95);
double p99 = tdigest_quantile(node->td, 0.99);
bool than = !!opts->greater_than;
if (opts->perins) {
printf("%-*lu ", opts->keylen, node->instance);
// if (comm) node->instance means pid.
if (opts->comm && delay_class->global_comm)
printf("%-*s ", TASK_COMM_LEN, tep__pid_to_comm((int)node->instance));
}
printf("%*s", delay_class->max_len1, two->tp1->alias ?: two->tp1->name);
printf(" => %-*s", delay_class->max_len2, two->tp2->alias ?: two->tp2->name);
printf(" %8lu %16.3f %12.3f %12.3f %12.3f %12.3f %12.3f",
node->n, node->sum/1000.0, node->min/1000.0, p50/1000.0, p95/1000.0, p99/1000.0, node->max/1000.0);
if (than)
if (node->than && isatty(1))
printf(" \033[31;1m%6lu (%3lu%s)\033[0m\n", node->than, node->than * 100 / (node->n ? : 1), "%");
else
printf(" %6lu (%3lu%s)\n", node->than, node->than * 100 / (node->n ? : 1), "%");
else
printf("\n");
}
static int delay_print_header(struct two_event *two)
{
struct delay_class *delay_class = NULL;
struct two_event_options *opts;
bool than;
int i;
if (two) {
delay_class = container_of(two->class, struct delay_class, base);
opts = &two->class->opts;
than = !!opts->greater_than;
if (latency_dist_empty(delay_class->lat_dist))
return 1;
if (opts->only_print_greater_than &&
!latency_dist_greater_than(delay_class->lat_dist, opts->greater_than))
return 1;
print_time(stdout);
printf("\n");
if (opts->perins) {
printf("%-*s ", opts->keylen, opts->keyname);
if (opts->comm && delay_class->global_comm)
printf("%-*s ", TASK_COMM_LEN, "comm");
}
printf("%*s => %-*s", delay_class->max_len1, "start", delay_class->max_len2, "end");
if (!opts->env->tsc)
printf(" %8s %16s %12s %12s %12s %12s %12s", "calls", "total(us)", "min(us)", "p50(us)",
"p95(us)", "p99(us)", "max(us)");
else
printf(" %8s %16s %12s %12s %12s %12s %12s", "calls", "total(kcyc)", "min(kcyc)", "p50(kcyc)",
"p95(kcyc)", "p99(kcyc)", "max(kcyc)");
if (than)
printf(" than(reqs)\n");
else
printf("\n");
if (opts->perins) {
for (i=0; i<opts->keylen; i++) printf("-");
printf(" ");
if (opts->comm && delay_class->global_comm) {
for (i=0; i<TASK_COMM_LEN; i++) printf("-");
printf(" ");
}
}
for (i=0; i<delay_class->max_len1; i++) printf("-");
printf(" ");
for (i=0; i<delay_class->max_len2; i++) printf("-");
printf(" %8s %16s %12s %12s %12s %12s %12s",
"--------", "----------------", "------------", "------------", "------------",
"------------", "------------");
if (than)
printf(" --------------\n");
else
printf("\n");
if (!opts->sort_print)
latency_dist_print(delay_class->lat_dist, delay_print_node, delay_class);
else
latency_dist_print_sorted(delay_class->lat_dist, delay_print_node, delay_class);
return 1;
}
return 0;
}
static void delay_print(struct two_event *two)
{
}
static struct two_event_class *delay_class_new(struct two_event_impl *impl, struct two_event_options *options)
{
struct two_event_class *class = two_event_class_new(impl, options);
struct delay_class *delay_class;
if (class) {
class->two = delay_two;
class->remaining = delay_remaining;
class->print_header = delay_print_header;
class->print = delay_print;
if (class->opts.keylen < 3)
class->opts.keylen = 3;
delay_class = container_of(class, struct delay_class, base);
delay_class->max_len1 = 5; // 5 is strlen("start")
delay_class->max_len2 = 3; // 5 is strlen("end")
delay_class->lat_dist = latency_dist_new_quantile(options->perins, true, 0);
delay_class->global_comm = global_comm_ref() == 0;
}
return class;
}
static void delay_class_delete(struct two_event_class *class)
{
struct delay_class *delay_class;
if (class) {
delay_class = container_of(class, struct delay_class, base);
latency_dist_free(delay_class->lat_dist);
if (delay_class->global_comm) global_comm_unref();
two_event_class_delete(class);
}
}
static struct two_event_impl delay_impl = {
.name = TWO_EVENT_DELAY_IMPL,
.class_size = sizeof(struct delay_class),
.class_new = delay_class_new,
.class_delete = delay_class_delete,
.instance_size = sizeof(struct delay),
.object_new = delay_new,
.object_delete = delay_delete,
};
/*
* syscall delay
*
* Count the maximum, minimum, and average values of each instance.
* Number of syscall errors
* And can output delay heatmap.
*
**/
struct sys_enter {
unsigned short common_type;// offset:0; size:2; signed:0;
unsigned char common_flags;// offset:2; size:1; signed:0;
unsigned char common_preempt_count;// offset:3; size:1; signed:0;
int common_pid;// offset:4; size:4; signed:1;
long id;// offset:8; size:8; signed:1;
unsigned long args[6];// offset:16; size:48; signed:0;
};
struct sys_exit {
unsigned short common_type;// offset:0; size:2; signed:0;
unsigned char common_flags;// offset:2; size:1; signed:0;
unsigned char common_preempt_count;// offset:3; size:1; signed:0;
int common_pid;// offset:4; size:4; signed:1;
long id;// offset:8; size:8; signed:1;
long ret;// offset:16; size:8; signed:1;
};
#undef __SYSCALL
#undef __SYSCALL_WITH_COMPAT
#define __SYSCALL(nr, sym) [nr] = #sym,
#define __SYSCALL_WITH_COMPAT(nr, sym, compat) [nr] = #sym,
const char *syscalls_table[] = {
#if defined(__i386__)
#include <asm/syscalls_32.h>
#elif defined(__x86_64__)
#include <asm/syscalls_64.h>
#else
#include <asm-generic/unistd.h>
#endif
};
static struct two_event *syscalls_new(struct two_event_class *class, struct tp *tp1, struct tp *tp2)
{
if (strcmp(tp1->sys, "raw_syscalls") ||
strcmp(tp1->name, "sys_enter") ||
(tp2 && strcmp(tp2->sys, "raw_syscalls")) ||
(tp2 && strcmp(tp2->name, "sys_exit"))) {
fprintf(stderr, "Please use -e raw_syscalls:sys_enter -e raw_syscalls:sys_exit\n");
return NULL;
}
return delay_new(class, tp1, tp2);
}
static void syscalls_two(struct two_event *two, union perf_event *event1, union perf_event *event2, struct event_info *info, struct event_iter *iter)
{
struct delay *delay = NULL;
struct delay_class *delay_class = NULL;
struct two_event_options *opts;
struct multi_trace_type_header *e1 = (void *)event1->sample.array;
struct multi_trace_type_header *e2 = (void *)event2->sample.array;
struct sys_enter *sys_enter;
int enter_size;
struct sys_exit *sys_exit;
int exit_size;
u64 delta = 0;
struct latency_node *node;
if (two) {
delay = container_of(two, struct delay, base);
delay_class = container_of(two->class, struct delay_class, base);
opts = &two->class->opts;
if (e2->time > e1->time) {
delta = e2->time - e1->time;
multi_trace_raw_size(event1, (void **)&sys_enter, &enter_size, two->tp1);
multi_trace_raw_size(event2, (void **)&sys_exit, &exit_size, two->tp2);
if (sys_enter->common_pid != sys_exit->common_pid ||
sys_enter->id != sys_exit->id)
return ;
node = latency_dist_input(delay_class->lat_dist, sys_enter->common_pid, sys_enter->id, delta, opts->greater_than);
node->extra[0] += IS_ERR_VALUE((unsigned long)sys_exit->ret); //error
if (delay->heatmap)
heatmap_write(delay->heatmap, e2->time, delta);
if (opts->greater_than && delta > opts->greater_than) {
multi_trace_print(event1, two->tp1);
multi_trace_print(event2, two->tp2);
}
}
}
}
static remaining_return syscalls_remaining(struct two_event *two, union perf_event *event1, struct event_info *info, struct event_iter *iter)
{
struct delay *delay = NULL;
struct delay_class *delay_class = NULL;
struct two_event_options *opts;
struct multi_trace_type_header *e1 = (void *)event1->sample.array;
struct sys_enter *sys_enter;
int enter_size;
u64 delta = 0;
if (info->rr != REMAINING_SYSCALLS)
return REMAINING_BREAK;
if (two) {
delay = container_of(two, struct delay, base);
delay_class = container_of(two->class, struct delay_class, base);
opts = &two->class->opts;
// info->recent_time is free_time, see syscalls_extra_sample().
if (info->recent_time > e1->time) {
delta = info->recent_time - e1->time;
multi_trace_raw_size(event1, (void **)&sys_enter, &enter_size, two->tp1);
/* node = */latency_dist_input(delay_class->lat_dist, sys_enter->common_pid, sys_enter->id, delta, opts->greater_than);
// node->extra[0] += 0; //error
if (delay->heatmap)
heatmap_write(delay->heatmap, info->recent_time, delta);
if (opts->greater_than && delta > opts->greater_than) {
multi_trace_print(event1, two->tp1);
prof_dev_print_time(two->tp1->dev, info->recent_time, stdout);
tp_print_marker(two->tp1);
printf("%16s %6u .... [%03d] %lu.%06lu: sched:sched_process_free: comm=%s pid=%d\n", tep__pid_to_comm(0), 0,
e1->cpu_entry.cpu, info->recent_time/NSEC_PER_SEC, (info->recent_time%NSEC_PER_SEC)/1000,
tep__pid_to_comm(e1->tid_entry.tid), e1->tid_entry.tid);
}
}
}
return REMAINING_CONTINUE;
}
static void syscalls_print_node(void *opaque, struct latency_node *node)
{
struct delay_class *delay_class = opaque;
struct two_event_options *opts = &delay_class->base.opts;
bool than = !!opts->greater_than;
char buf[64];
if (opts->perins) {
printf("%-6lu ", node->instance);
/*
* syscalls_two(): latency_dist_input(,sys_enter->common_pid,)
* The default instance is pid, there is no need to judge opts->comm.
**/
if (delay_class->global_comm)
printf("%-*s ", TASK_COMM_LEN, tep__pid_to_comm((int)node->instance));
}
if (node->key < sizeof(syscalls_table)/sizeof(syscalls_table[0])
&& syscalls_table[node->key]) {
snprintf(buf, sizeof(buf), "%s(%lu)", syscalls_table[node->key], node->key);
printf("%-20s", buf);
} else
printf("%-20lu", node->key);
printf(" %8lu %16.3f %12.3f %12.3f %12.3f %6lu",
node->n, node->sum/1000.0, node->min/1000.0, node->sum/node->n/1000.0, node->max/1000.0, node->extra[0]);
if (than)
if (node->than && isatty(1))
printf(" \033[31;1m%6lu (%3lu%s)\033[0m\n", node->than, node->than * 100 / (node->n ? : 1), "%");
else
printf(" %6lu (%3lu%s)\n", node->than, node->than * 100 / (node->n ? : 1), "%");
else
printf("\n");
}
static int syscalls_print_header(struct two_event *two)
{
struct delay_class *delay_class = NULL;
struct two_event_options *opts;
bool than;
int i;
if (two) {
delay_class = container_of(two->class, struct delay_class, base);
opts = &two->class->opts;
than = !!opts->greater_than;
if (latency_dist_empty(delay_class->lat_dist))
return 1;
print_time(stdout);
printf("\n");
if (opts->perins) {
printf("thread ");
if (delay_class->global_comm)
printf("%-*s ", TASK_COMM_LEN, "comm");
}
printf("%-20s", "syscalls");
if (!opts->env->tsc)
printf(" %8s %16s %12s %12s %12s %6s", "calls", "total(us)", "min(us)", "avg(us)", "max(us)", "err");
else
printf(" %8s %16s %12s %12s %12s %6s", "calls", "total(kcyc)", "min(kcyc)", "avg(kcyc)", "max(kcyc)", "err");
if (than)
printf(" than(reqs)\n");
else
printf("\n");
if (opts->perins) {
printf("------ ");
if (delay_class->global_comm) {
for (i=0; i<TASK_COMM_LEN; i++) printf("-");
printf(" ");
}
}
for (i=0; i<20; i++) printf("-");
printf(" %8s %16s %12s %12s %12s %6s",
"--------", "----------------", "------------", "------------", "------------", "------");
if (than)
printf(" --------------\n");
else
printf("\n");
if (!opts->sort_print)
latency_dist_print(delay_class->lat_dist, syscalls_print_node, delay_class);
else
latency_dist_print_sorted(delay_class->lat_dist, syscalls_print_node, delay_class);
return 1;
}
return 0;
}
static struct two_event_class *syscalls_class_new(struct two_event_impl *impl, struct two_event_options *options)
{
struct two_event_class *class = two_event_class_new(impl, options);
struct delay_class *delay_class;
if (class) {
class->two = syscalls_two;
class->remaining = syscalls_remaining;
class->print_header = syscalls_print_header;
class->print = delay_print;
delay_class = container_of(class, struct delay_class, base);
delay_class->lat_dist = latency_dist_new(options->perins, true, sizeof(u64));
delay_class->global_comm = global_comm_ref() == 0;
}
return class;
}
static struct two_event_impl syscalls_impl = {
.name = TWO_EVENT_SYSCALLS_IMPL,
.class_size = sizeof(struct delay_class),
.class_new = syscalls_class_new,
.class_delete = delay_class_delete,
.instance_size = sizeof(struct delay),
.object_new = syscalls_new,
.object_delete = delay_delete,
};
/*
* Determine if two events are paired
*
* Print unpaired events.
* Report the number of paired and unpaired events.
**/
struct pair {
struct two_event base;
union {
u64 paired;
u64 unpaired;
};
};
struct pair_class {
struct two_event_class base;
};
static void pair_two(struct two_event *two, union perf_event *event1, union perf_event *event2, struct event_info *info, struct event_iter *iter)
{
struct pair *pair;
if (two) {
pair = container_of(two, struct pair, base);
pair->paired ++;
}
}
static remaining_return pair_remaining(struct two_event *two, union perf_event *event1, struct event_info *info, struct event_iter *iter)
{
struct pair *pair;
if (two) {
pair = container_of(two, struct pair, base);
pair->unpaired ++;
multi_trace_print(event1, two->tp1);
}
return REMAINING_CONTINUE;
}
static int pair_print_header(struct two_event *two)
{
return 1;
}
static void pair_print(struct two_event *two)
{
struct pair *pair;
if (two) {
pair = container_of(two, struct pair, base);
print_time(stdout);