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
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
|
/*
* Copyright (c) 2014 Red Hat.
* Copyright (c) 1995-2001,2003 Silicon Graphics, Inc. All Rights Reserved.
*
* This program is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License as published by the
* Free Software Foundation; either version 2 of the License, or (at your
* option) any later version.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
* or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* for more details.
*/
#include <math.h>
#include <stdarg.h>
#include <limits.h>
#include "pmapi.h"
#include "impl.h"
static pmLongOptions longopts[] = {
PMAPI_OPTIONS_HEADER("Options"),
PMOPT_DEBUG,
{ "all", 0, 'a', 0, "print all information (equivalent to -blmMy)" },
{ "", 0, 'b', 0, "print both stochastic and time averages for counter metrics" },
{ "bins", 1, 'B', "N", "print value distribution across a number of bins" },
{ "", 0, 'f', 0, "print using \"spreadsheet\" format (tab delimited fields)" },
{ "", 0, 'F', 0, "print using \"spreadsheet\" format (comma separated values)" },
{ "header", 0, 'H', 0, "print one-line header at start showing each column" },
{ "mintime", 0, 'i', 0, "also print timestamp for minimum value" },
{ "maxtime", 0, 'I', 0, "also print timestamp for maximum value" },
{ "label", 0, 'l', 0, "also print the archive label and time window" },
{ "minimum", 0, 'm', 0, "also print minimum value" },
{ "maximum", 0, 'M', 0, "also print maximum value" },
PMOPT_NAMESPACE,
{ "", 0, 'N', 0, "suppress warnings from individual archive fetches (default)" },
{ "precision", 0, 'p', 0, "number of digits to display after the decimal point" },
PMOPT_START,
PMOPT_FINISH,
{ "verbose", 0, 'v', 0, "verbose, enable warnings from individual archive fetches" },
{ "", 0, 'x', 0, "print only stochastic averages for counter metrics" },
{ "samples", 0, 'y', "print sample count for each metric" },
PMOPT_TIMEZONE,
PMOPT_HOSTZONE,
PMOPT_HELP,
PMAPI_OPTIONS_END
};
static int override(int, pmOptions *);
static pmOptions opts = {
.flags = PM_OPTFLAG_DONE | PM_OPTFLAG_BOUNDARIES | PM_OPTFLAG_STDOUT_TZ,
.short_options = "abB:D:fFHiIlmMNn:p:rsS:T:vxyzZ:?",
.long_options = longopts,
.short_usage = "[options] archive [metricname ...]",
.override = override,
};
typedef struct {
int inst;
unsigned int count;
double stocave; /* stochastic average */
double timeave; /* time average */
double min; /* minimum value */
double max; /* maximum value */
double sum; /* sum of all values */
double lastval; /* value from previous sample */
struct timeval firsttime; /* time of first sample */
struct timeval lasttime; /* time of previous sample */
struct timeval mintime; /* time of minimum sample */
struct timeval maxtime; /* time of maximum sample */
int markcount; /* num mark records seen */
int marked; /* seen since last "mark" record? */
unsigned int bintotal; /* copy of count for 2nd pass */
unsigned int *bin; /* bins for value distribution */
} instData;
typedef struct {
pmDesc desc;
double scale;
instData **instlist;
unsigned int listsize;
} aveData;
/*
* Hash control for statistics & errors related to each metric
*/
static __pmHashCtl hashlist;
static __pmHashCtl errlist;
/* output format flags */
static unsigned int stocaveflag; /* no stochastic counter ave */
static unsigned int timeaveflag = 1;/* use time counter ave */
static unsigned int maxflag; /* no maximum */
static unsigned int minflag; /* no minimum */
static unsigned int sumflag; /* no sum */
static unsigned int maxtimeflag; /* no timestamp for maximum */
static unsigned int mintimeflag; /* no timestamp for minimum */
static unsigned int countflag; /* no count */
static unsigned int warnflag; /* warnings are off by default */
static unsigned int delimiter = ' ';/* output field separator */
static unsigned int nbins; /* number of distribution bins */
static unsigned int precision = 3; /* number of digits after "." */
/* time window stuff */
static int dayflag;
static char timebuf[32]; /* for pmCtime result + .xxx */
/* duration of log */
static double logspan;
/* optional metric specification, optionally with instances */
pmMetricSpec *msp;
/* time manipulation */
static int
tsub(struct timeval *a, struct timeval *b)
{
if ((a == NULL) || (b == NULL))
return -1;
a->tv_usec -= b->tv_usec;
if (a->tv_usec < 0) {
a->tv_usec += 1000000;
a->tv_sec--;
}
a->tv_sec -= b->tv_sec;
if (a->tv_sec < 0) {
/* clip negative values at zero */
a->tv_sec = 0;
a->tv_usec = 0;
}
return 0;
}
static int
tadd(struct timeval *a, struct timeval *b)
{
if ((a == NULL) || (b == NULL))
return -1;
a->tv_usec += b->tv_usec;
if (a->tv_usec > 1000000) {
a->tv_usec -= 1000000;
a->tv_sec++;
}
a->tv_sec += b->tv_sec;
return 0;
}
static double
tosec(struct timeval t)
{
return t.tv_sec + (t.tv_usec / 1000000.0);
}
static void
pmiderr(pmID pmid, const char *msg, ...)
{
if (warnflag && __pmHashSearch(pmid, &errlist) == NULL) {
va_list arg;
char *mname = NULL;
static char *unknown = "(cannot find metric name) ";
pmNameID(pmid, &mname);
if (!mname) mname = unknown;
fprintf(stderr, "%s: %s(%s) - ", pmProgname, mname, pmIDStr(pmid));
va_start(arg, msg);
vfprintf(stderr, msg, arg);
va_end(arg);
__pmHashAdd(pmid, NULL, &errlist);
if (mname && mname != unknown) free(mname);
}
}
static void
printstamp(struct timeval *stamp, int delimiter)
{
if (dayflag) {
char *ddmm;
char *yr;
ddmm = pmCtime(&stamp->tv_sec, timebuf);
ddmm[10] = ' ';
ddmm[11] = '\0';
yr = &ddmm[20];
printf("%c'%s", delimiter, ddmm);
__pmPrintStamp(stdout, stamp);
printf(" %4.4s\'", yr);
}
else {
printf("%c", delimiter);
__pmPrintStamp(stdout, stamp);
}
}
static void
printlabel(void)
{
pmLogLabel label;
char *ddmm;
char *yr;
int sts;
if ((sts = pmGetArchiveLabel(&label)) < 0) {
fprintf(stderr, "%s: Cannot get archive label record: %s\n",
pmProgname, pmErrStr(sts));
exit(1);
}
printf("Log Label (Log Format Version %d)\n", label.ll_magic & 0xff);
printf("Performance metrics from host %s\n", label.ll_hostname);
ddmm = pmCtime(&opts.start.tv_sec, timebuf);
ddmm[10] = '\0';
yr = &ddmm[20];
printf(" commencing %s ", ddmm);
__pmPrintStamp(stdout, &opts.start);
printf(" %4.4s\n", yr);
if (opts.finish.tv_sec == INT_MAX) {
/* pmGetArchiveEnd() failed! */
printf(" ending UNKNOWN\n");
}
else {
ddmm = pmCtime(&opts.finish.tv_sec, timebuf);
ddmm[10] = '\0';
yr = &ddmm[20];
printf(" ending %s ", ddmm);
__pmPrintStamp(stdout, &opts.finish);
printf(" %4.4s\n", yr);
}
}
static void
printheaders(void)
{
printf("metric");
if (stocaveflag)
printf("%cstochastic_average", delimiter);
if (timeaveflag)
printf("%ctime_average", delimiter);
if (sumflag)
printf("%csum", delimiter);
if (minflag)
printf("%cminimum", delimiter);
if (mintimeflag)
printf("%cminimum_time", delimiter);
if (maxflag)
printf("%cmaximum", delimiter);
if (maxtimeflag)
printf("%cmaximum_time", delimiter);
if (countflag)
printf("%ccount", delimiter);
if (nbins)
printf("%cbins", delimiter);
printf("%cunits\n", delimiter);
}
static void
printsummary(const char *name)
{
int sts;
int i, j;
int star;
pmID pmid;
char *str = NULL;
const char *u;
__pmHashNode *hptr;
aveData *avedata;
instData *instdata;
double metricspan = 0.0;
struct timeval metrictimespan;
/* cast away const, pmLookupName should never modify name */
if ((sts = pmLookupName(1, (char **)&name, &pmid)) < 0) {
fprintf(stderr, "%s: failed to lookup metric name (pmid=%s): %s\n",
pmProgname, name, pmErrStr(sts));
return;
}
/* lookup using pmid, print values according to set flags */
if ((hptr = __pmHashSearch(pmid, &hashlist)) != NULL) {
avedata = (aveData*)hptr->data;
for (i = 0; i < avedata->listsize; i++) {
if ((instdata = avedata->instlist[i]) == NULL)
break;
if (avedata->desc.sem == PM_SEM_DISCRETE) {
double val;
struct timeval timediff;
/* extend discrete metrics to the archive end */
timediff = opts.finish;
tsub(&timediff, &instdata->lasttime);
val = instdata->lastval;
instdata->stocave += val;
instdata->timeave += val*tosec(timediff);
instdata->lasttime = opts.finish;
instdata->count++;
}
metrictimespan = instdata->lasttime;
tsub(&metrictimespan, &instdata->firsttime);
metricspan = tosec(metrictimespan);
/* counter metric doesn't cover 90% of log */
star = (avedata->desc.sem == PM_SEM_COUNTER && metricspan / logspan <= 0.1);
if ((sts = pmNameInDom(avedata->desc.indom, instdata->inst, &str)) < 0) {
if (msp && msp->ninst > 0 && avedata->desc.indom == PM_INDOM_NULL)
break;
if (star)
putchar('*');
if (avedata->desc.indom == PM_INDOM_NULL)
printf("%s%c", name, delimiter);
else
printf("%s%c[%u]", name, delimiter, instdata->inst);
}
else { /* part of an instance domain */
if (msp && msp->ninst > 0) {
for (j = 0; j < msp->ninst; j++)
if (strcmp(msp->inst[j], str) == 0)
break;
if (j == msp->ninst)
continue;
}
if (star)
putchar('*');
printf("%s%c[\"%s\"]", name, delimiter, str);
}
if (str) free(str);
str = NULL;
/* complete the calculations, count is number of intervals */
if (avedata->desc.sem == PM_SEM_COUNTER) {
if (metricspan <= 0) {
printf("%c- insufficient archive data.\n", delimiter);
continue;
}
instdata->stocave /= (double)instdata->count;
instdata->timeave /= metricspan * avedata->scale;
}
else { /* non-counters, count is number of observations */
instdata->stocave /= (double)instdata->count;
if (metricspan == 0) /* happens for instantaneous metrics */
metricspan = 1; /* only - just report the one value */
instdata->timeave /= metricspan;
}
if (stocaveflag)
printf("%c%.*f", delimiter, (int)precision, instdata->stocave);
if (timeaveflag)
printf("%c%.*f", delimiter, (int)precision, instdata->timeave);
if (sumflag)
printf("%c%.*f", delimiter, (int)precision, instdata->sum);
if (minflag)
printf("%c%.*f", delimiter, (int)precision, instdata->min);
if (mintimeflag)
printstamp(&instdata->mintime, delimiter);
if (maxflag)
printf("%c%.*f", delimiter, (int)precision, instdata->max);
if (maxtimeflag)
printstamp(&instdata->maxtime, delimiter);
if (avedata->desc.sem == PM_SEM_DISCRETE) /* all added marks + added endpoint above */
instdata->count = instdata->count - instdata->markcount - 1;
if (countflag)
printf("%c%u", delimiter, instdata->count);
for (j=0; j < nbins; j++) { /* print value distribution summary */
if (j > 0 && instdata->min == instdata->max) /* all in 1st bin */
printf("%c[]%c%u", delimiter, delimiter, 0);
else
printf("%c[<=%.*f]%c%u", delimiter, (int)precision,
((instdata->max - instdata->min) / nbins * (j+1)) + instdata->min,
delimiter, instdata->bin[j]);
}
u = pmUnitsStr(&avedata->desc.units);
printf("%c%s\n", delimiter, *u == '\0' ? "none" : u);
if (instdata) {
if (instdata->bin)
free(instdata->bin);
free(instdata);
}
}
if (avedata->instlist) free(avedata->instlist);
__pmHashDel(avedata->desc.pmid, (void*)avedata, &hashlist);
free(avedata);
}
}
static double
unwrap(double current, double previous, int pmtype)
{
double outval = current;
static int dowrap = -1;
if ((current - previous) < 0.0) {
if (dowrap == -1) {
/* PCP_COUNTER_WRAP in environment enables "counter wrap" logic */
if (getenv("PCP_COUNTER_WRAP") == NULL)
dowrap = 0;
else
dowrap = 1;
}
if (dowrap) {
switch (pmtype) {
case PM_TYPE_32:
case PM_TYPE_U32:
outval += (double)UINT_MAX+1;
break;
case PM_TYPE_64:
case PM_TYPE_U64:
outval += (double)ULONGLONG_MAX+1;
break;
}
}
}
return outval;
}
static void
newHashInst(pmValue *vp,
aveData *avedata, /* updated by this function */
int valfmt,
struct timeval *timestamp, /* timestamp for this sample */
int pos) /* position of this inst in instlist */
{
int sts;
size_t size;
instData *instdata;
pmAtomValue av;
if ((sts = pmExtractValue(valfmt, vp, avedata->desc.type, &av, PM_TYPE_DOUBLE)) < 0) {
pmiderr(avedata->desc.pmid, "failed to extract value: %s\n", pmErrStr(sts));
fprintf(stderr, "%s: possibly corrupt archive?\n", pmProgname);
exit(1);
}
size = (pos+1) * sizeof(instData *);
avedata->instlist = (instData **) realloc(avedata->instlist, size);
if (avedata->instlist == NULL)
__pmNoMem("newHashInst.instlist", size, PM_FATAL_ERR);
size = sizeof(instData);
avedata->instlist[pos] = instdata = (instData *) malloc(size);
if (instdata == NULL)
__pmNoMem("newHashInst.instlist[inst]", size, PM_FATAL_ERR);
if (nbins == 0)
instdata->bin = NULL;
else { /* we are doing binning ... make space for the bins */
size = nbins * sizeof(unsigned int);
instdata->bin = (unsigned int *)malloc(size);
if (instdata->bin == NULL)
__pmNoMem("newHashInst.instlist[inst].bin", size, PM_FATAL_ERR);
memset(instdata->bin, 0, size);
}
instdata->inst = vp->inst;
if (avedata->desc.sem == PM_SEM_COUNTER) {
instdata->min = 0.0;
instdata->max = 0.0;
instdata->sum = 0.0;
instdata->mintime = *timestamp;
instdata->maxtime = *timestamp;
instdata->stocave = 0.0;
instdata->timeave = 0.0;
instdata->count = 0;
}
else { /* for the other semantics */
instdata->min = av.d;
instdata->max = av.d;
instdata->sum = av.d;
instdata->mintime = *timestamp;
instdata->maxtime = *timestamp;
instdata->stocave = av.d;
instdata->timeave = 0.0;
instdata->count = 1;
}
instdata->marked = 0;
instdata->bintotal = 0;
instdata->markcount = 0;
instdata->lastval = av.d;
instdata->firsttime = *timestamp;
instdata->lasttime = *timestamp;
avedata->listsize++;
#ifdef PCP_DEBUG
if (pmDebug & DBG_TRACE_APPL0) {
char *name = NULL;
pmNameID(avedata->desc.pmid, &name);
fprintf(stderr, "%s Initially - min/max=%f/%f\n", name,
instdata->min, instdata->max);
if (name) free(name);
}
#endif
}
static void
newHashItem(pmValueSet *vsp,
pmDesc *desc,
aveData *avedata, /* output from this function */
struct timeval *timestamp) /* timestamp for this sample */
{
int j;
avedata->desc = *desc;
avedata->scale = 0.0;
/* convert counter metric units to rate units & get time scale */
if (avedata->desc.sem == PM_SEM_COUNTER && !sumflag) {
if (avedata->desc.units.dimTime == 0)
avedata->scale = 1.0;
else {
if (avedata->desc.units.scaleTime > PM_TIME_SEC)
avedata->scale = pow(60.0, (double)(PM_TIME_SEC - avedata->desc.units.scaleTime));
else
avedata->scale = pow(1000.0, (double)(PM_TIME_SEC - avedata->desc.units.scaleTime));
}
if (avedata->desc.units.dimTime == 0)
avedata->desc.units.scaleTime = PM_TIME_SEC;
avedata->desc.units.dimTime--;
}
else if (avedata->desc.sem == PM_SEM_COUNTER && sumflag) {
avedata->scale = 1.0;
}
avedata->listsize = 0;
avedata->instlist = NULL;
for (j = 0; j < vsp->numval; j++)
newHashInst(&vsp->vlist[j], avedata, vsp->valfmt, timestamp, j);
}
/*
* find index to bin array for "val"
*/
unsigned int
findbin(pmID pmid, double val, double min, double max)
{
unsigned int index;
double bound, next;
double binsize;
binsize = (max - min) / (double)nbins;
bound = min;
for (index=0; index < nbins-1; index++) {
next = bound + binsize;
if (val >= bound && val <= next)
break;
bound = next;
}
#ifdef PCP_DEBUG
if (pmDebug & DBG_TRACE_APPL0) {
char *mname = NULL;
pmNameID(pmid, &mname);
fprintf(stderr, "%s selected bin %u/%u (val=%.*f, min=%.*f, max=%.*f)\n",
mname, index, nbins, (int)precision, val, (int)precision,
min, (int)precision, max);
if (mname) free(mname);
if (index >= nbins) exit(1);
}
#endif
return index;
}
/*
* must keep a note for every instance of every metric whenever a mark
* record has been seen between now & the last fetch for that instance
*/
static void
markrecord(pmResult *result)
{
int i, j;
__pmHashNode *hptr;
aveData *avedata;
instData *instdata;
double val;
struct timeval timediff;
#ifdef PCP_DEBUG
if (pmDebug & DBG_TRACE_APPL0) {
printstamp(&result->timestamp, '\n');
printf(" - mark record\n\n");
}
#endif
for (i = 0; i < hashlist.hsize; i++) {
for (hptr = hashlist.hash[i]; hptr != NULL; hptr = hptr->next) {
avedata = (aveData *)hptr->data;
for (j = 0; j < avedata->listsize; j++) {
instdata = avedata->instlist[j];
if (avedata->desc.sem == PM_SEM_DISCRETE) {
/* extend discrete metrics to the mark point */
timediff = result->timestamp;
tsub(&timediff, &instdata->lasttime);
val = instdata->lastval;
instdata->stocave += val;
instdata->timeave += val*tosec(timediff);
instdata->lasttime = result->timestamp;
instdata->count++;
}
instdata->marked = 1;
instdata->markcount++;
}
}
}
}
static void
calcbinning(pmResult *result)
{
int i, j, k;
int sts;
int wrap;
double val;
pmAtomValue av;
pmValue *vp;
pmValueSet *vsp;
__pmHashNode *hptr = NULL;
aveData *avedata = NULL;
instData *instdata;
double diff;
struct timeval timediff;
if (result->numpmid == 0) /* mark record */
markrecord(result);
for (i = 0; i < result->numpmid; i++) {
vsp = result->vset[i];
if (vsp->numval == 0)
continue;
else if (vsp->numval < 0) {
pmiderr(vsp->pmid, "failed in 2nd pass archive fetch: %s\n", pmErrStr(vsp->numval));
continue;
}
if ((hptr = __pmHashSearch(vsp->pmid, &hashlist)) != NULL) {
avedata = (aveData *)hptr->data;
for (j = 0; j < vsp->numval; j++) { /* iterate thro result values */
int fp_bad;
vp = &vsp->vlist[j];
k = j; /* index into stored inst list, result may differ */
if ((vsp->numval > 1) || (avedata->desc.indom != PM_INDOM_NULL)) {
if ((k < avedata->listsize) && (avedata->instlist[k]->inst != vp->inst)) {
for (k = 0; k < avedata->listsize; k++) {
if (vp->inst == avedata->instlist[k]->inst)
break; /* k now correct */
}
if (k == avedata->listsize) {
pmiderr(vsp->pmid, "ignoring new instance found on second pass\n");
continue;
}
}
else if (k >= avedata->listsize) {
k = avedata->listsize;
pmiderr(vsp->pmid, "ignoring new instance found on second pass\n");
continue;
}
}
instdata = avedata->instlist[k];
if ((sts = pmExtractValue(vsp->valfmt, vp, avedata->desc.type, &av, PM_TYPE_DOUBLE)) < 0) {
pmiderr(avedata->desc.pmid, "failed to extract value: %s\n", pmErrStr(sts));
continue;
}
fp_bad = 0;
#ifdef HAVE_FPCLASSIFY
fp_bad = fpclassify(av.d) == FP_NAN;
#else
#ifdef HAVE_ISNAN
fp_bad = isnan(av.d);
#endif
#endif
if (fp_bad)
continue;
/* reset values from first pass needed in this second pass */
if (instdata->bintotal == 0) { /* 1st time instance seen on 2nd pass */
instdata->bintotal = instdata->count;
instdata->lasttime = result->timestamp;
instdata->firsttime = result->timestamp;
instdata->lastval = av.d;
if (avedata->desc.sem == PM_SEM_COUNTER)
instdata->count = 0;
else {
unsigned int sts;
instdata->count = 1;
sts = findbin(avedata->desc.pmid, av.d, instdata->min, instdata->max);
instdata->bin[sts]++;
}
continue;
}
timediff = result->timestamp;
tsub(&timediff, &instdata->lasttime);
diff = tosec(timediff);
wrap = 0;
if (avedata->desc.sem == PM_SEM_COUNTER) {
diff *= avedata->scale;
if (diff == 0.0) continue;
if (instdata->marked)
val = av.d;
else
val = unwrap(av.d, instdata->lastval, avedata->desc.type);
if (instdata->marked || val < instdata->lastval) {
/* mark or not first one & counter not monotonic increasing */
wrap = 1;
instdata->marked = 0;
tadd(&instdata->firsttime, &result->timestamp);
tsub(&instdata->firsttime, &instdata->lasttime);
}
else {
unsigned int sts;
val = (val - instdata->lastval) / diff;
sts = findbin(avedata->desc.pmid, val, instdata->min, instdata->max);
instdata->bin[sts]++;
}
}
else { /* for the other semantics */
unsigned int sts;
val = av.d;
sts = findbin(avedata->desc.pmid, val, instdata->min, instdata->max);
instdata->bin[sts]++;
}
if (!wrap) {
instdata->count++;
}
instdata->lastval = av.d;
instdata->lasttime = result->timestamp;
}
}
}
}
static void
calcaverage(pmResult *result)
{
int i, j, k;
int sts;
int wrap;
double val;
pmDesc desc;
pmAtomValue av;
pmValue *vp;
pmValueSet *vsp;
__pmHashNode *hptr = NULL;
aveData *avedata = NULL;
instData *instdata;
double diff;
double rate = 0;
struct timeval timediff;
if (result->numpmid == 0) /* mark record */
markrecord(result);
for (i = 0; i < result->numpmid; i++) {
vsp = result->vset[i];
if (vsp->numval == 0)
continue;
else if (vsp->numval < 0) {
pmiderr(vsp->pmid, "failed in archive value fetch: %s\n", pmErrStr(vsp->numval));
continue;
}
/* check if pmid already in hash list */
if ((hptr = __pmHashSearch(vsp->pmid, &hashlist)) == NULL) {
if ((sts = pmLookupDesc(vsp->pmid, &desc)) < 0) {
pmiderr(vsp->pmid, "cannot find descriptor: %s\n", pmErrStr(sts));
continue;
}
if (desc.type != PM_TYPE_32 && desc.type != PM_TYPE_U32 &&
desc.type != PM_TYPE_64 && desc.type != PM_TYPE_U64 &&
desc.type != PM_TYPE_FLOAT && desc.type != PM_TYPE_DOUBLE) {
continue; /* cannot average non-numeric metrics */
}
/* create a new one & add to list */
avedata = (aveData*) malloc(sizeof(aveData));
newHashItem(vsp, &desc, avedata, &result->timestamp);
if (__pmHashAdd(avedata->desc.pmid, (void*)avedata, &hashlist) < 0) {
pmiderr(avedata->desc.pmid, "failed %s hash table insertion\n", pmProgname);
/* free memory allocated above on insert failure */
for (j = 0; j < vsp->numval; j++)
if (avedata->instlist[j]) free(avedata->instlist[j]);
if (avedata->instlist) free(avedata->instlist);
continue;
}
}
else { /* pmid exists - update statistics */
avedata = (aveData*)hptr->data;
for (j = 0; j < vsp->numval; j++) { /* iterate thro result values */
int fp_bad;
vp = &vsp->vlist[j];
k = j; /* index into stored inst list, result may differ */
if ((vsp->numval > 1) || (avedata->desc.indom != PM_INDOM_NULL)) {
/* must store values using correct inst - probably in correct order already */
if ((k < avedata->listsize) && (avedata->instlist[k]->inst != vp->inst)) {
for (k = 0; k < avedata->listsize; k++) {
if (vp->inst == avedata->instlist[k]->inst) {
break; /* k now correct */
}
}
if (k == avedata->listsize) { /* no matching inst was found */
newHashInst(vp, avedata, vsp->valfmt, &result->timestamp, k);
continue;
}
}
else if (k >= avedata->listsize) {
k = avedata->listsize;
newHashInst(vp, avedata, vsp->valfmt, &result->timestamp, k);
continue;
}
}
instdata = avedata->instlist[k];
if ((sts = pmExtractValue(vsp->valfmt, vp, avedata->desc.type, &av, PM_TYPE_DOUBLE)) < 0) {
pmiderr(avedata->desc.pmid, "failed to extract value: %s\n", pmErrStr(sts));
continue;
}
fp_bad = 0;
#ifdef HAVE_FPCLASSIFY
fp_bad = fpclassify(av.d) == FP_NAN;
#else
#ifdef HAVE_ISNAN
fp_bad = isnan(av.d);
#endif
#endif
if (fp_bad)
continue;
timediff = result->timestamp;
tsub(&timediff, &instdata->lasttime);
diff = tosec(timediff);
wrap = 0;
if (avedata->desc.sem == PM_SEM_COUNTER) {
diff *= avedata->scale;
if (diff == 0.0) continue;
if (instdata->marked)
val = av.d;
else
val = unwrap(av.d, instdata->lastval, avedata->desc.type);
#ifdef PCP_DEBUG
if (pmDebug & DBG_TRACE_APPL0) {
char *name = NULL;
pmNameID(avedata->desc.pmid, &name);
fprintf(stderr, "%s base value is %f, count %d\n",
name, val, instdata->count+1);
if (name) free(name);
}
#endif
if (instdata->marked || val < instdata->lastval) {
/* either previous record was a "mark", or this is not */
/* the first one, and counter not monotonic increasing */
#ifdef PCP_DEBUG
if (pmDebug & DBG_TRACE_APPL1) {
char *name = NULL;
pmNameID(avedata->desc.pmid, &name);
fprintf(stderr, "%s counter wrapped or <mark>\n", name);
if (name) free(name);
}
#endif
wrap = 1;
instdata->marked = 0;
tadd(&instdata->firsttime, &result->timestamp);
tsub(&instdata->firsttime, &instdata->lasttime);
}
else {
rate = (val - instdata->lastval) / diff;
instdata->stocave += rate;
if (!instdata->marked)
instdata->timeave += (val - instdata->lastval);
else {
instdata->marked = 0;
/* remove the timeslice in question from time-based calc */
tadd(&instdata->firsttime, &result->timestamp);
tsub(&instdata->firsttime, &instdata->lasttime);
}
if (instdata->count == 0) { /* 1st time */
instdata->min = instdata->max = rate;
instdata->sum = (val - instdata->lastval);
}
else {
#ifdef PCP_DEBUG
if (pmDebug & DBG_TRACE_APPL2) {
char *name = NULL;
char *istr = NULL;
pmNameID(avedata->desc.pmid, &name);
if (pmNameInDom(avedata->desc.indom,
instdata->inst, &istr) < 0)
istr = NULL;
if (rate < instdata->min) {
fprintf(stderr, "new min value for %s "
"(inst[%s]: %f) at ",
name, (istr == NULL ? "":istr), rate);
__pmPrintStamp(stderr, &result->timestamp);
fprintf(stderr, "\n");
}
if (rate > instdata->max) {
fprintf(stderr, "new max value for %s "
"(inst[%s]: %f) at ",
name, (istr == NULL ? "":istr), rate);
__pmPrintStamp(stderr, &result->timestamp);
fprintf(stderr, "\n");
}
if (name) free(name);
if (istr) free(istr);
}
#endif
if (rate < instdata->min) {
instdata->min = rate;
instdata->mintime = result->timestamp;
}
if (rate > instdata->max) {
instdata->max = rate;
instdata->maxtime = result->timestamp;
}
instdata->sum += (val - instdata->lastval);
}
}
}
else { /* for the other semantics - discrete & instantaneous */
val = av.d;
instdata->sum += val;
instdata->stocave += val;
if (val < instdata->min) {
instdata->min = val;
instdata->mintime = result->timestamp;
}
if (val > instdata->max) {
instdata->max = val;
instdata->maxtime = result->timestamp;
}
if (!instdata->marked)
instdata->timeave += instdata->lastval*diff;
else {
instdata->marked = 0;
/* remove the timeslice in question from time-based calc */
tadd(&instdata->firsttime, &result->timestamp);
tsub(&instdata->firsttime, &instdata->lasttime);
}
}
if (!wrap) {
instdata->count++;
#ifdef PCP_DEBUG
if ((pmDebug & DBG_TRACE_APPL1) &&
(avedata->desc.sem != PM_SEM_COUNTER || instdata->count > 0)) {
char *name = NULL;
double metricspan = 0.0;
struct timeval metrictimespan;
metrictimespan = result->timestamp;
tsub(&metrictimespan, &instdata->firsttime);
metricspan = tosec(metrictimespan);
pmNameID(avedata->desc.pmid, &name);
if (avedata->desc.sem == PM_SEM_COUNTER) {
fprintf(stderr, "++ %s timedelta=%f count=%d\n"
"sum=%f min=%f max=%f stocsum=%f\n"
"rate=%f timesum=%f (+%f) timespan=%f\n",
name, diff, instdata->count, instdata->sum,
instdata->min, instdata->max,
instdata->stocave, rate, instdata->timeave,
diff * (val - instdata->lastval) / 2,
metricspan);
}
else { /* non-counters */
fprintf(stderr, "++ %s timedelta=%f count=%d\n"
"sum=%f min=%f max=%f stocsum=%f\n"
"lastval=%f timesum=%f (+%f) timespan=%f\n",
name, diff, instdata->count, instdata->sum,
instdata->min, instdata->max,
instdata->stocave, instdata->lastval,
instdata->timeave, instdata->lastval*diff,
metricspan);
}
if (name)
free(name);
}
#endif
}
instdata->lastval = av.d;
instdata->lasttime = result->timestamp;
}
}
}
}
static int
override(int opt, pmOptions *opts)
{
if (opt == 'a' || opt == 'H' || opt == 'N' || opt == 'p' || opt == 's')
return 1;
return 0;
}
int
main(int argc, char *argv[])
{
int c, i, sts, trip, exitstatus = 0;
int lflag = 0; /* no label by default */
int Hflag = 0; /* no header by default */
pmResult *result;
struct timeval timespan = {0, 0};
char *endnum;
char *archive;
while ((c = pmGetOptions(argc, argv, &opts)) != EOF) {
switch (c) {
case 'a': /* provide all information */
stocaveflag = timeaveflag = lflag = countflag = minflag = maxflag = 1;
sumflag = 0;
break;
case 'b': /* use both averages */
stocaveflag = 1;
timeaveflag = 1;
sumflag = 0;
break;
case 'B': /* number of distribution bins */
sts = (int)strtol(opts.optarg, &endnum, 10);
if (*endnum != '\0' || sts < 0) {
pmprintf("%s: -B requires positive numeric argument\n",
pmProgname);
opts.errors++;
}
else
nbins = (unsigned int)sts;
break;
case 'f': /* spreadsheet format - use tab delimiters */
delimiter = '\t';
break;
case 'F': /* spreadsheet format - use comma delimiters */
delimiter = ',';
break;
case 'H': /* print columns headings */
Hflag = 1;
break;
case 'i': /* print timestamp for minimum */
mintimeflag = 1;
break;
case 'I': /* print timestamp for maximum */
maxtimeflag = 1;
break;
case 'l': /* display label */
lflag = 1;
break;
case 'm': /* print minimums */
minflag = 1;
break;
case 'M': /* print maximums */
maxflag = 1;
break;
case 'N': /* suppress fetch warnings */
warnflag = 0;
break;
case 'p': /* number of digits after decimal point */
precision = (unsigned int)strtol(opts.optarg, &endnum, 10);
if (*endnum != '\0') {
pmprintf("%s: -p requires numeric argument\n", pmProgname);
opts.errors++;
}
break;
case 's': /* print sums (and only sums) */
stocaveflag = timeaveflag = lflag = countflag = minflag = maxflag = 0;
sumflag = 1;
break;
case 'v': /* verbose "fetch" warnings reported */
warnflag = 1;
break;
case 'x': /* use only stochastic counter averages */
stocaveflag = 1;
timeaveflag = 0;
sumflag = 0;
break;
case 'y': /* print sample count */
countflag = 1;
break;
}
}
if (!opts.errors && opts.optind >= argc) {
pmprintf("Error: no archive specified\n\n");
opts.errors++;
}
if (opts.errors) {
pmUsageMessage(&opts);
exit(1);
}
archive = argv[opts.optind++];
__pmAddOptArchive(&opts, archive);
opts.flags &= ~PM_OPTFLAG_DONE;
__pmEndOptions(&opts);
if ((sts = c = pmNewContext(PM_CONTEXT_ARCHIVE, archive)) < 0) {
fprintf(stderr, "%s: Cannot open archive \"%s\": %s\n",
pmProgname, archive, pmErrStr(sts));
exit(1);
}
if (pmGetContextOptions(c, &opts) < 0) {
pmflush(); /* runtime errors only at this stage */
exit(EXIT_FAILURE);
}
if ((sts = pmSetMode(PM_MODE_FORW, &opts.start, 0)) < 0) {
fprintf(stderr, "%s: pmSetMode failed: %s\n", pmProgname, pmErrStr(sts));
exit(1);
}
if (lflag)
printlabel();
logspan = tosec(opts.finish) - tosec(opts.start);
/* check which timestamp print format we should be using */
timespan = opts.finish;
tsub(×pan, &opts.start);
if (timespan.tv_sec > 86400) /* seconds per day: 60*60*24 */
dayflag = 1;
for (trip = 0; trip < 2; trip++) { /* two passes if binning */
for ( ; ; ) {
if ((sts = pmFetchArchive(&result)) < 0)
break;
if (opts.finish.tv_sec > result->timestamp.tv_sec ||
(opts.finish.tv_sec == result->timestamp.tv_sec &&
opts.finish.tv_usec >= result->timestamp.tv_usec)) {
if (trip == 0)
calcaverage(result);
else
calcbinning(result);
pmFreeResult(result);
}
else {
pmFreeResult(result);
sts = PM_ERR_EOL;
break;
}
}
if (trip == 0 && nbins > 0) { /* distribute values into bins */
#ifdef PCP_DEBUG
if (pmDebug & DBG_TRACE_APPL0)
fprintf(stderr, "resetting for second iteration\n");
#endif
if ((sts = pmSetMode(PM_MODE_FORW, &opts.start, 0)) < 0) {
fprintf(stderr, "%s: pmSetMode reset failed: %s\n",
pmProgname, pmErrStr(sts));
exit(1);
}
}
else
break; /* two passes only when doing binning */
}
if (sts != PM_ERR_EOL) {
fprintf(stderr, "%s: fetch failed: %s\n", pmProgname, pmErrStr(sts));
exitstatus = 1;
}
if (Hflag)
printheaders();
if (opts.optind >= argc) { /* print all results */
if ((sts = pmTraversePMNS("", printsummary)) < 0) {
fprintf(stderr, "%s: PMNS traversal failed: %s\n", pmProgname, pmErrStr(sts));
exit(1);
}
}
else { /* print only selected results */
for (i = opts.optind; i < argc; i++) {
char *msg;
if (pmParseMetricSpec(argv[i], 1, archive, &msp, &msg) < 0) {
fputs(msg, stderr);
free(msg);
continue;
}
if ((sts = pmTraversePMNS(msp->metric, printsummary)) < 0)
fprintf(stderr, "%s: PMNS traversal failed for %s: %s\n",
pmProgname, msp->metric, pmErrStr(sts));
pmFreeMetricSpec(msp);
}
}
exit(exitstatus);
}
|