-
Notifications
You must be signed in to change notification settings - Fork 5
/
sa_common.c
1581 lines (1420 loc) · 41.9 KB
/
sa_common.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
/*
* sar and sadf common routines.
* (C) 1999-2011 by Sebastien GODARD (sysstat <at> orange.fr)
*
***************************************************************************
* 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 the implied warranty of MERCHANTABILITY *
* or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License *
* for more details. *
* *
* You should have received a copy of the GNU General Public License along *
* with this program; if not, write to the Free Software Foundation, Inc., *
* 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA *
***************************************************************************
*/
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <time.h>
#include <errno.h>
#include <unistd.h> /* For STDOUT_FILENO, among others */
#include <dirent.h>
#include <fcntl.h>
#include <sys/types.h>
#include <sys/ioctl.h>
#include "sa.h"
#include "common.h"
#include "ioconf.h"
#include "rd_stats.h"
#ifdef USE_NLS
#include <locale.h>
#include <libintl.h>
#define _(string) gettext(string)
#else
#define _(string) (string)
#endif
extern struct act_bitmap cpu_bitmap;
/*
***************************************************************************
* Init a bitmap (CPU, IRQ, etc.).
*
* IN:
* @value Value used to init bitmap.
* @sz Size of the bitmap in bytes.
*
* OUT:
* @bitmap Bitmap initialized.
***************************************************************************
*/
void set_bitmap(unsigned char bitmap[], unsigned char value, unsigned int sz)
{
register int i;
for (i = 0; i < sz; i++) {
bitmap[i] = value;
}
}
/*
***************************************************************************
* Allocate structures.
*
* IN:
* @act Array of activities.
***************************************************************************
*/
void allocate_structures(struct activity *act[])
{
int i, j;
for (i = 0; i < NR_ACT; i++) {
if (act[i]->nr > 0) {
for (j = 0; j < 3; j++) {
SREALLOC(act[i]->buf[j], void, act[i]->msize * act[i]->nr * act[i]->nr2);
}
}
}
}
/*
***************************************************************************
* Free structures.
*
* IN:
* @act Array of activities.
***************************************************************************
*/
void free_structures(struct activity *act[])
{
int i, j;
for (i = 0; i < NR_ACT; i++) {
if (act[i]->nr > 0) {
for (j = 0; j < 3; j++) {
if (act[i]->buf[j]) {
free(act[i]->buf[j]);
act[i]->buf[j] = NULL;
}
}
}
}
}
/*
***************************************************************************
* Get device real name if possible.
* Warning: This routine may return a bad name on 2.4 kernels where
* disk activities are read from /proc/stat.
*
* IN:
* @major Major number of the device.
* @minor Minor number of the device.
* @pretty TRUE if the real name of the device (as it appears in /dev)
* should be returned.
*
* RETURNS:
* The name of the device, which may be the real name (as it appears in /dev)
* or a string with the following format devM-n.
***************************************************************************
*/
char *get_devname(unsigned int major, unsigned int minor, int pretty)
{
static char buf[32];
char *name;
snprintf(buf, 32, "dev%d-%d", major, minor);
if (!pretty)
return (buf);
name = ioc_name(major, minor);
if ((name == NULL) || !strcmp(name, K_NODEV))
return (buf);
return (name);
}
/*
***************************************************************************
* Check if we are close enough to desired interval.
*
* IN:
* @uptime_ref Uptime used as reference. This is the system uptime for the
* first sample statistics, or the first system uptime after a
* LINUX RESTART.
* @uptime Current system uptime.
* @reset TRUE if @last_uptime should be reset with @uptime_ref.
* @interval Interval of time.
*
* RETURNS:
* 1 if we are actually close enough to desired interval, 0 otherwise.
***************************************************************************
*/
int next_slice(unsigned long long uptime_ref, unsigned long long uptime,
int reset, long interval)
{
unsigned long file_interval, entry;
static unsigned long long last_uptime = 0;
int min, max, pt1, pt2;
double f;
/* uptime is expressed in jiffies (basis of 1 processor) */
if (!last_uptime || reset) {
last_uptime = uptime_ref;
}
/* Interval cannot be greater than 0xffffffff here */
f = ((double) ((uptime - last_uptime) & 0xffffffff)) / HZ;
file_interval = (unsigned long) f;
if ((f * 10) - (file_interval * 10) >= 5) {
file_interval++; /* Rounding to correct value */
}
last_uptime = uptime;
/*
* A few notes about the "algorithm" used here to display selected entries
* from the system activity file (option -f with -i flag):
* Let 'Iu' be the interval value given by the user on the command line,
* 'If' the interval between current and previous line in the system
* activity file,
* and 'En' the nth entry (identified by its time stamp) of the file.
* We choose In = [ En - If/2, En + If/2 [ if If is even,
* or In = [ En - If/2, En + If/2 ] if not.
* En will be displayed if
* (Pn * Iu) or (P'n * Iu) belongs to In
* with Pn = En / Iu and P'n = En / Iu + 1
*/
f = ((double) ((uptime - uptime_ref) & 0xffffffff)) / HZ;
entry = (unsigned long) f;
if ((f * 10) - (entry * 10) >= 5) {
entry++;
}
min = entry - (file_interval / 2);
max = entry + (file_interval / 2) + (file_interval & 0x1);
pt1 = (entry / interval) * interval;
pt2 = ((entry / interval) + 1) * interval;
return (((pt1 >= min) && (pt1 < max)) || ((pt2 >= min) && (pt2 < max)));
}
/*
***************************************************************************
* Use time stamp to fill tstamp structure.
*
* IN:
* @timestamp Timestamp to decode (format: HH:MM:SS).
*
* OUT:
* @tse Structure containing the decoded timestamp.
*
* RETURNS:
* 0 if the timestamp has been successfully decoded, 1 otherwise.
***************************************************************************
*/
int decode_timestamp(char timestamp[], struct tstamp *tse)
{
timestamp[2] = timestamp[5] = '\0';
tse->tm_sec = atoi(×tamp[6]);
tse->tm_min = atoi(×tamp[3]);
tse->tm_hour = atoi(timestamp);
if ((tse->tm_sec < 0) || (tse->tm_sec > 59) ||
(tse->tm_min < 0) || (tse->tm_min > 59) ||
(tse->tm_hour < 0) || (tse->tm_hour > 23))
return 1;
tse->use = TRUE;
return 0;
}
/*
***************************************************************************
* Compare two timestamps.
*
* IN:
* @rectime Date and time for current sample.
* @tse Timestamp used as reference.
*
* RETURNS:
* A positive value if @rectime is greater than @tse,
* a negative one otherwise.
***************************************************************************
*/
int datecmp(struct tm *rectime, struct tstamp *tse)
{
if (rectime->tm_hour == tse->tm_hour) {
if (rectime->tm_min == tse->tm_min)
return (rectime->tm_sec - tse->tm_sec);
else
return (rectime->tm_min - tse->tm_min);
}
else
return (rectime->tm_hour - tse->tm_hour);
}
/*
***************************************************************************
* Parse a time stamp entered on the command line (hh:mm:ss) and decode it.
*
* IN:
* @argv Arguments list.
* @opt Index in the arguments list.
* @def_timestamp Default timestamp to use.
*
* OUT:
* @tse Structure containing the decoded timestamp.
*
* RETURNS:
* 0 if the timestamp has been successfully decoded, 1 otherwise.
***************************************************************************
*/
int parse_timestamp(char *argv[], int *opt, struct tstamp *tse,
const char *def_timestamp)
{
char timestamp[9];
if ((argv[++(*opt)]) && (strlen(argv[*opt]) == 8)) {
strcpy(timestamp, argv[(*opt)++]);
}
else {
strcpy(timestamp, def_timestamp);
}
return decode_timestamp(timestamp, tse);
}
/*
***************************************************************************
* Set current daily data file name.
*
* OUT:
* @rectime Current date and time.
* @datafile Name of daily data file.
***************************************************************************
*/
void set_default_file(struct tm *rectime, char *datafile)
{
get_time(rectime);
snprintf(datafile, MAX_FILE_LEN,
"%s/sa%02d", SA_DIR, rectime->tm_mday);
datafile[MAX_FILE_LEN - 1] = '\0';
}
/*
***************************************************************************
* Set interval value.
*
* IN:
* @record_hdr_curr Record with current sample statistics.
* @record_hdr_prev Record with previous sample statistics.
* @nr_proc Number of CPU, including CPU "all".
*
* OUT:
* @itv Interval in jiffies.
* @g_itv Interval in jiffies multiplied by the # of proc.
***************************************************************************
*/
void get_itv_value(struct record_header *record_hdr_curr,
struct record_header *record_hdr_prev,
unsigned int nr_proc,
unsigned long long *itv, unsigned long long *g_itv)
{
/* Interval value in jiffies */
*g_itv = get_interval(record_hdr_prev->uptime,
record_hdr_curr->uptime);
if (nr_proc > 2) {
*itv = get_interval(record_hdr_prev->uptime0,
record_hdr_curr->uptime0);
}
else {
*itv = *g_itv;
}
}
/*
***************************************************************************
* Fill the rectime structure with the file's creation date, based on file's
* time data saved in file header.
* The resulting timestamp is expressed in the locale of the file creator or
* in the user's own locale, depending on whether option -t has been used
* or not.
*
* IN:
* @flags Flags for common options and system state.
* @file_hdr System activity file standard header.
*
* OUT:
* @rectime Date and time from file header.
***************************************************************************
*/
void get_file_timestamp_struct(unsigned int flags, struct tm *rectime,
struct file_header *file_hdr)
{
struct tm *loc_t;
if (PRINT_TRUE_TIME(flags)) {
/* Get local time. This is just to fill HH:MM:SS fields */
get_time(rectime);
rectime->tm_mday = file_hdr->sa_day;
rectime->tm_mon = file_hdr->sa_month;
rectime->tm_year = file_hdr->sa_year;
/*
* Call mktime() to set DST (Daylight Saving Time) flag.
* Has anyone a better way to do it?
*/
rectime->tm_hour = rectime->tm_min = rectime->tm_sec = 0;
mktime(rectime);
}
else {
if ((loc_t = localtime((const time_t *) &file_hdr->sa_ust_time)) != NULL) {
*rectime = *loc_t;
}
}
}
/*
***************************************************************************
* Print report header.
*
* IN:
* @flags Flags for common options and system state.
* @file_hdr System activity file standard header.
* @cpu_nr Number of CPU (value in [1, NR_CPUS + 1]).
* 1 means that there is only one proc and non SMP kernel.
* 2 means one proc and SMP kernel.
* Etc.
*
* OUT:
* @rectime Date and time from file header.
***************************************************************************
*/
void print_report_hdr(unsigned int flags, struct tm *rectime,
struct file_header *file_hdr, int cpu_nr)
{
/* Get date of file creation */
get_file_timestamp_struct(flags, rectime, file_hdr);
/* Display the header */
print_gal_header(rectime, file_hdr->sa_sysname, file_hdr->sa_release,
file_hdr->sa_nodename, file_hdr->sa_machine,
cpu_nr > 1 ? cpu_nr - 1 : 1);
}
/*
***************************************************************************
* Network interfaces may now be registered (and unregistered) dynamically.
* This is what we try to guess here.
*
* IN:
* @a Activity structure with statistics.
* @curr Index in array for current sample statistics.
* @ref Index in array for sample statistics used as reference.
* @pos Index on current network interface.
*
* RETURNS:
* Position of current network interface in array of sample statistics used
* as reference.
***************************************************************************
*/
unsigned int check_net_dev_reg(struct activity *a, int curr, int ref,
unsigned int pos)
{
struct stats_net_dev *sndc, *sndp;
unsigned int index = 0;
sndc = (struct stats_net_dev *) a->buf[curr] + pos;
while (index < a->nr) {
sndp = (struct stats_net_dev *) a->buf[ref] + index;
if (!strcmp(sndc->interface, sndp->interface)) {
/*
* Network interface found.
* If a counter has decreased, then we may assume that the
* corresponding interface was unregistered, then registered again.
*/
if ((sndc->rx_packets < sndp->rx_packets) ||
(sndc->tx_packets < sndp->tx_packets) ||
(sndc->rx_bytes < sndp->rx_bytes) ||
(sndc->tx_bytes < sndp->tx_bytes) ||
(sndc->rx_compressed < sndp->rx_compressed) ||
(sndc->tx_compressed < sndp->tx_compressed) ||
(sndc->multicast < sndp->multicast)) {
/*
* Special processing for rx_bytes (_packets) and
* tx_bytes (_packets) counters: If the number of
* bytes (packets) has decreased, whereas the number of
* packets (bytes) has increased, then assume that the
* relevant counter has met an overflow condition, and that
* the interface was not unregistered, which is all the
* more plausible that the previous value for the counter
* was > ULONG_MAX/2.
* NB: the average value displayed will be wrong in this case...
*
* If such an overflow is detected, just set the flag. There is no
* need to handle this in a special way: the difference is still
* properly calculated if the result is of the same type (i.e.
* unsigned long) as the two values.
*/
int ovfw = FALSE;
if ((sndc->rx_bytes < sndp->rx_bytes) &&
(sndc->rx_packets > sndp->rx_packets) &&
(sndp->rx_bytes > (~0UL >> 1))) {
ovfw = TRUE;
}
if ((sndc->tx_bytes < sndp->tx_bytes) &&
(sndc->tx_packets > sndp->tx_packets) &&
(sndp->tx_bytes > (~0UL >> 1))) {
ovfw = TRUE;
}
if ((sndc->rx_packets < sndp->rx_packets) &&
(sndc->rx_bytes > sndp->rx_bytes) &&
(sndp->rx_packets > (~0UL >> 1))) {
ovfw = TRUE;
}
if ((sndc->tx_packets < sndp->tx_packets) &&
(sndc->tx_bytes > sndp->tx_bytes) &&
(sndp->tx_packets > (~0UL >> 1))) {
ovfw = TRUE;
}
if (!ovfw) {
/*
* OK: assume here that the device was
* actually unregistered.
*/
memset(sndp, 0, STATS_NET_DEV_SIZE);
strcpy(sndp->interface, sndc->interface);
}
}
return index;
}
index++;
}
/* Network interface not found: Look for the first free structure */
for (index = 0; index < a->nr; index++) {
sndp = (struct stats_net_dev *) a->buf[ref] + index;
if (!strcmp(sndp->interface, "?")) {
memset(sndp, 0, STATS_NET_DEV_SIZE);
strcpy(sndp->interface, sndc->interface);
break;
}
}
if (index >= a->nr) {
/* No free structure: Default is structure of same rank */
index = pos;
}
sndp = (struct stats_net_dev *) a->buf[ref] + index;
/* Since the name is not the same, reset all the structure */
memset(sndp, 0, STATS_NET_DEV_SIZE);
strcpy(sndp->interface, sndc->interface);
return index;
}
/*
***************************************************************************
* Network interfaces may now be registered (and unregistered) dynamically.
* This is what we try to guess here.
*
* IN:
* @a Activity structure with statistics.
* @curr Index in array for current sample statistics.
* @ref Index in array for sample statistics used as reference.
* @pos Index on current network interface.
*
* RETURNS:
* Position of current network interface in array of sample statistics used
* as reference.
***************************************************************************
*/
unsigned int check_net_edev_reg(struct activity *a, int curr, int ref,
unsigned int pos)
{
struct stats_net_edev *snedc, *snedp;
unsigned int index = 0;
snedc = (struct stats_net_edev *) a->buf[curr] + pos;
while (index < a->nr) {
snedp = (struct stats_net_edev *) a->buf[ref] + index;
if (!strcmp(snedc->interface, snedp->interface)) {
/*
* Network interface found.
* If a counter has decreased, then we may assume that the
* corresponding interface was unregistered, then registered again.
*/
if ((snedc->tx_errors < snedp->tx_errors) ||
(snedc->collisions < snedp->collisions) ||
(snedc->rx_dropped < snedp->rx_dropped) ||
(snedc->tx_dropped < snedp->tx_dropped) ||
(snedc->tx_carrier_errors < snedp->tx_carrier_errors) ||
(snedc->rx_frame_errors < snedp->rx_frame_errors) ||
(snedc->rx_fifo_errors < snedp->rx_fifo_errors) ||
(snedc->tx_fifo_errors < snedp->tx_fifo_errors)) {
/*
* OK: assume here that the device was
* actually unregistered.
*/
memset(snedp, 0, STATS_NET_EDEV_SIZE);
strcpy(snedp->interface, snedc->interface);
}
return index;
}
index++;
}
/* Network interface not found: Look for the first free structure */
for (index = 0; index < a->nr; index++) {
snedp = (struct stats_net_edev *) a->buf[ref] + index;
if (!strcmp(snedp->interface, "?")) {
memset(snedp, 0, STATS_NET_EDEV_SIZE);
strcpy(snedp->interface, snedc->interface);
break;
}
}
if (index >= a->nr) {
/* No free structure: Default is structure of same rank */
index = pos;
}
snedp = (struct stats_net_edev *) a->buf[ref] + index;
/* Since the name is not the same, reset all the structure */
memset(snedp, 0, STATS_NET_EDEV_SIZE);
strcpy(snedp->interface, snedc->interface);
return index;
}
/*
***************************************************************************
* Disks may be registered dynamically (true in /proc/stat file).
* This is what we try to guess here.
*
* IN:
* @a Activity structure with statistics.
* @curr Index in array for current sample statistics.
* @ref Index in array for sample statistics used as reference.
* @pos Index on current disk.
*
* RETURNS:
* Position of current disk in array of sample statistics used as reference.
***************************************************************************
*/
int check_disk_reg(struct activity *a, int curr, int ref, int pos)
{
struct stats_disk *sdc, *sdp;
int index = 0;
sdc = (struct stats_disk *) a->buf[curr] + pos;
while (index < a->nr) {
sdp = (struct stats_disk *) a->buf[ref] + index;
if ((sdc->major == sdp->major) &&
(sdc->minor == sdp->minor)) {
/*
* Disk found.
* If all the counters have decreased then the likelyhood
* is that the disk has been unregistered and a new disk inserted.
* If only one or two have decreased then the likelyhood
* is that the counter has simply wrapped.
*/
if ((sdc->nr_ios < sdp->nr_ios) &&
(sdc->rd_sect < sdp->rd_sect) &&
(sdc->wr_sect < sdp->wr_sect)) {
memset(sdp, 0, STATS_DISK_SIZE);
sdp->major = sdc->major;
sdp->minor = sdc->minor;
}
return index;
}
index++;
}
/* Disk not found: Look for the first free structure */
for (index = 0; index < a->nr; index++) {
sdp = (struct stats_disk *) a->buf[ref] + index;
if (!(sdp->major + sdp->minor)) {
memset(sdp, 0, STATS_DISK_SIZE);
sdp->major = sdc->major;
sdp->minor = sdc->minor;
break;
}
}
if (index >= a->nr) {
/* No free structure found: Default is structure of same rank */
index = pos;
}
sdp = (struct stats_disk *) a->buf[ref] + index;
/* Since the device is not the same, reset all the structure */
memset(sdp, 0, STATS_DISK_SIZE);
sdp->major = sdc->major;
sdp->minor = sdc->minor;
return index;
}
/*
***************************************************************************
* Allocate bitmaps for activities that have one.
*
* IN:
* @act Array of activities.
***************************************************************************
*/
void allocate_bitmaps(struct activity *act[])
{
int i;
for (i = 0; i < NR_ACT; i++) {
/*
* If current activity has a bitmap which has not already
* been allocated, then allocate it.
* Note that a same bitmap may be used by several activities.
*/
if (act[i]->bitmap && !act[i]->bitmap->b_array) {
SREALLOC(act[i]->bitmap->b_array, unsigned char,
BITMAP_SIZE(act[i]->bitmap->b_size));
}
}
}
/*
***************************************************************************
* Free bitmaps for activities that have one.
*
* IN:
* @act Array of activities.
***************************************************************************
*/
void free_bitmaps(struct activity *act[])
{
int i;
for (i = 0; i < NR_ACT; i++) {
if (act[i]->bitmap && act[i]->bitmap->b_array) {
free(act[i]->bitmap->b_array);
/* Set pointer to NULL to prevent it from being freed again */
act[i]->bitmap->b_array = NULL;
}
}
}
/*
***************************************************************************
* Look for activity in array.
*
* IN:
* @act Array of activities.
* @act_flag Activity flag to look for.
*
* RETURNS:
* Position of activity in array, or -1 if not found (this may happen when
* reading data from a system activity file created by another version of
* sysstat).
***************************************************************************
*/
int get_activity_position(struct activity *act[], unsigned int act_flag)
{
int i;
for (i = 0; i < NR_ACT; i++) {
if (act[i]->id == act_flag)
break;
}
if (i == NR_ACT)
return -1;
return i;
}
/*
***************************************************************************
* Count number of activities with given option.
*
* IN:
* @act Array of activities.
* @option Option that activities should have to be counted
* (eg. AO_COLLECTED...)
* @count_outputs TRUE if each output should be counted for activities with
* multiple outputs.
*
* RETURNS:
* Number of selected activities
***************************************************************************
*/
int get_activity_nr(struct activity *act[], unsigned int option, int count_outputs)
{
int i, n = 0;
unsigned int msk;
for (i = 0; i < NR_ACT; i++) {
if ((act[i]->options & option) == option) {
if (HAS_MULTIPLE_OUTPUTS(act[i]->options) && count_outputs) {
for (msk = 1; msk < 0x10; msk <<= 1) {
if (act[i]->opt_flags & msk) {
n++;
}
}
}
else {
n++;
}
}
}
return n;
}
/*
***************************************************************************
* Select all activities, even if they have no associated items.
*
* IN:
* @act Array of activities.
*
* OUT:
* @act Array of activities, all of the being selected.
***************************************************************************
*/
void select_all_activities(struct activity *act[])
{
int i;
for (i = 0; i < NR_ACT; i++) {
act[i]->options |= AO_SELECTED;
}
}
/*
***************************************************************************
* Select CPU activity if no other activities have been explicitly selected.
* Also select CPU "all" if no other CPU has been selected.
*
* IN:
* @act Array of activities.
*
* OUT:
* @act Array of activities with CPU activity selected if needed.
***************************************************************************
*/
void select_default_activity(struct activity *act[])
{
int p;
p = get_activity_position(act, A_CPU);
/* Default is CPU activity... */
if (!get_activity_nr(act, AO_SELECTED, COUNT_ACTIVITIES)) {
/*
* Still OK even when reading stats from a file
* since A_CPU activity is always recorded.
*/
act[p]->options |= AO_SELECTED;
}
/*
* If no CPU's have been selected then select CPU "all".
* cpu_bitmap bitmap may be used by several activities (A_CPU, A_PWR_CPUFREQ...)
*/
if (!count_bits(cpu_bitmap.b_array, BITMAP_SIZE(cpu_bitmap.b_size))) {
cpu_bitmap.b_array[0] |= 0x01;
}
}
/*
***************************************************************************
* Read data from a system activity data file.
*
* IN:
* @ifd Input file descriptor.
* @buffer Buffer where data are read.
* @size Number of bytes to read.
* @mode If set to HARD_SIZE, indicate that an EOF should be considered
* as an error.
*
* RETURNS:
* 1 if EOF has been reached, 0 otherwise.
***************************************************************************
*/
int sa_fread(int ifd, void *buffer, int size, int mode)
{
int n;
if ((n = read(ifd, buffer, size)) < 0) {
fprintf(stderr, _("Error while reading system activity file: %s\n"),
strerror(errno));
close(ifd);
exit(2);
}
if (!n && (mode == SOFT_SIZE))
return 1; /* EOF */
if (n < size) {
fprintf(stderr, _("End of system activity file unexpected\n"));
close(ifd);
exit(2);
}
return 0;
}
/*
***************************************************************************
* Display sysstat version used to create system activity data file.
*
* IN:
* @file_magic File magic header
***************************************************************************
*/
void display_sa_file_version(struct file_magic *file_magic)
{
fprintf(stderr, _("File created using sar/sadc from sysstat version %d.%d.%d"),
file_magic->sysstat_version,
file_magic->sysstat_patchlevel,
file_magic->sysstat_sublevel);
if (file_magic->sysstat_extraversion) {
fprintf(stderr, ".%d", file_magic->sysstat_extraversion);
}
fprintf(stderr, "\n");
}
/*
***************************************************************************
* An invalid system activity file has been opened for reading.
* If this file was created by an old version of sysstat, tell it to the
* user...
*
* IN:
* @fd Descriptor of the file that has been opened.
* @file_magic file_magic structure filled with file magic header data.
* May contain invalid data.
* @file Name of the file being read.
* @n Number of bytes read while reading file magic header.
* This function may also be called after failing to read file
* standard header, or if CPU activity has not been found in
* file. In this case, n is set to 0.
***************************************************************************
*/
void handle_invalid_sa_file(int *fd, struct file_magic *file_magic, char *file,
int n)
{
fprintf(stderr, _("Invalid system activity file: %s\n"), file);
if ((n == FILE_MAGIC_SIZE) && (file_magic->sysstat_magic == SYSSTAT_MAGIC)) {
/* This is a sysstat file, but this file has an old format */
display_sa_file_version(file_magic);
fprintf(stderr,
_("Current sysstat version can no longer read the format of this file (%#x)\n"),
file_magic->format_magic);
}
close (*fd);
exit(3);
}
/*
***************************************************************************
* Move structures data.
*
* IN:
* @act Array of activities.
* @id_seq Activity sequence in file.
* @record_hdr Current record header.
* @dest Index in array where stats have to be copied to.
* @src Index in array where stats to copy are.
***************************************************************************
*/
void copy_structures(struct activity *act[], unsigned int id_seq[],
struct record_header record_hdr[], int dest, int src)
{
int i, p;
memcpy(&record_hdr[dest], &record_hdr[src], RECORD_HEADER_SIZE);
for (i = 0; i < NR_ACT; i++) {
if (!id_seq[i])
continue;
if (((p = get_activity_position(act, id_seq[i])) < 0) ||
(act[p]->nr < 1) || (act[p]->nr2 < 1)) {
PANIC(1);
}
memcpy(act[p]->buf[dest], act[p]->buf[src], act[p]->msize * act[p]->nr * act[p]->nr2);
}
}
/*
***************************************************************************
* Read varying part of the statistics from a daily data file.
*
* IN:
* @act Array of activities.
* @curr Index in array for current sample statistics.
* @ifd Input file descriptor.
* @act_nr Number of activities in file.
* @file_actlst Activity list in file.
***************************************************************************
*/
void read_file_stat_bunch(struct activity *act[], int curr, int ifd, int act_nr,
struct file_activity *file_actlst)
{
int i, j, k, p;
struct file_activity *fal = file_actlst;
for (i = 0; i < act_nr; i++, fal++) {
if (((p = get_activity_position(act, fal->id)) < 0) ||
(act[p]->magic != fal->magic)) {
/*
* Ignore current activity in file, which is unknown to