31 |
|
#include <sys/mnttab.h> |
32 |
|
#include <sys/statvfs.h> |
33 |
|
#include <kstat.h> |
34 |
+ |
#include <sys/types.h> |
35 |
+ |
#include <dirent.h> |
36 |
+ |
#include <limits.h> |
37 |
+ |
#include <unistd.h> |
38 |
|
#define VALID_FS_TYPES {"ufs", "tmpfs"} |
39 |
|
#endif |
40 |
|
|
55 |
|
#endif |
56 |
|
#define START_VAL 1 |
57 |
|
|
58 |
+ |
/* Solaris kernel stores the disk names in the old BSD format |
59 |
+ |
* and we would prefer it in th modern format. |
60 |
+ |
*/ |
61 |
+ |
#ifdef SOLARIS |
62 |
+ |
/* Lines from the path_to_inst file */ |
63 |
+ |
typedef struct { |
64 |
+ |
/* unlikely to get a line that long */ |
65 |
+ |
char line[256]; |
66 |
+ |
}file_line_t; |
67 |
+ |
|
68 |
+ |
/* Linked list of the mappings from the older bsd-based sunos names |
69 |
+ |
* to the modern solaris names |
70 |
+ |
*/ |
71 |
+ |
struct disk_mapping_ent_t{ |
72 |
+ |
char *sunos_name; |
73 |
+ |
char *solaris_name; |
74 |
+ |
struct disk_mapping_ent_t *next; |
75 |
+ |
}; |
76 |
+ |
typedef struct disk_mapping_ent_t disk_mapping_t; |
77 |
+ |
#endif |
78 |
+ |
|
79 |
|
char *copy_string(char *orig_ptr, const char *newtext){ |
80 |
|
|
81 |
|
/* Maybe free if not NULL, and strdup rather than realloc and strcpy? */ |
292 |
|
} |
293 |
|
} |
294 |
|
|
295 |
+ |
#ifdef SOLARIS |
296 |
+ |
char *drive_map(char *sunos_name){ |
297 |
+ |
file_line_t *file_lines = NULL; |
298 |
+ |
file_line_t *f_ptr; |
299 |
+ |
static disk_mapping_t *disk_mapping = NULL; |
300 |
+ |
disk_mapping_t *d_ptr; |
301 |
+ |
int x = 0; |
302 |
+ |
int y = 256; |
303 |
+ |
FILE *f; |
304 |
+ |
DIR *dsk; |
305 |
+ |
struct dirent *dsk_ent; |
306 |
+ |
char linkpointer[PATH_MAX]; |
307 |
+ |
char link_path[PATH_MAX]; |
308 |
+ |
char *p, *r, *q; |
309 |
+ |
|
310 |
+ |
int dev_num; |
311 |
+ |
char dev_name[51]; |
312 |
+ |
|
313 |
+ |
if(disk_mapping == NULL){ |
314 |
+ |
/* Read in the path_to_inst file into memory */ |
315 |
+ |
file_lines = malloc(sizeof(file_line_t) * y); |
316 |
+ |
f_ptr = file_lines; |
317 |
+ |
if(file_lines == NULL) return NULL; |
318 |
+ |
f = fopen("/etc/path_to_inst", "r"); |
319 |
+ |
if (f == NULL){ |
320 |
+ |
free(file_lines); |
321 |
+ |
return NULL; |
322 |
+ |
} |
323 |
+ |
for(x=0;fgets(f_ptr->line, sizeof(f_ptr->line), f);x++){ |
324 |
+ |
if ((x+1) >= y){ |
325 |
+ |
y = y*2; |
326 |
+ |
file_lines = realloc(file_lines, sizeof(file_line_t) * y); |
327 |
+ |
if (file_lines == NULL) return NULL; |
328 |
+ |
} |
329 |
+ |
f_ptr++; |
330 |
+ |
} |
331 |
+ |
f_ptr = NULL; |
332 |
+ |
fclose(f); |
333 |
+ |
|
334 |
+ |
dsk = opendir("/dev/dsk"); |
335 |
+ |
if (dsk == NULL){ |
336 |
+ |
free(file_lines); |
337 |
+ |
return NULL; |
338 |
+ |
} |
339 |
+ |
|
340 |
+ |
while((dsk_ent = readdir(dsk)) != NULL){ |
341 |
+ |
snprintf(link_path, sizeof(link_path), "/dev/dsk/%s", dsk_ent->d_name); |
342 |
+ |
/* Ignore the non symlinks, e.g. ".." and "." */ |
343 |
+ |
if((readlink(link_path, linkpointer, PATH_MAX)) == -1) continue; |
344 |
+ |
/* We are only intrested in the string past the ../../devices/ part */ |
345 |
+ |
p = strstr(linkpointer, "devices"); |
346 |
+ |
p+=8; |
347 |
+ |
|
348 |
+ |
/* We are not intrested in the :a etc slices */ |
349 |
+ |
q = strrchr(p, ':'); |
350 |
+ |
*q = '\0'; |
351 |
+ |
|
352 |
+ |
/* char *p should not contain the info we need to look up in the |
353 |
+ |
* path_to_inst file. |
354 |
+ |
*/ |
355 |
+ |
|
356 |
+ |
for(f_ptr = file_lines; f_ptr != NULL; f_ptr++){ |
357 |
+ |
r = strstr(f_ptr->line, p); |
358 |
+ |
if (r != NULL) break; |
359 |
+ |
} |
360 |
+ |
|
361 |
+ |
if(r == NULL){ |
362 |
+ |
free(file_lines); |
363 |
+ |
closedir(dsk); |
364 |
+ |
return NULL; |
365 |
+ |
} |
366 |
+ |
|
367 |
+ |
/* f_ptr should be pointing to the line of path_to_inst we are intrested in now */ |
368 |
+ |
|
369 |
+ |
sscanf(r, "%*s %d \"%50s", &dev_num, dev_name); |
370 |
+ |
q = strrchr(dev_name, '"'); |
371 |
+ |
if (q == NULL){ |
372 |
+ |
free(file_lines); |
373 |
+ |
closedir(dsk); |
374 |
+ |
return NULL; |
375 |
+ |
} |
376 |
+ |
*q = '\0'; |
377 |
+ |
|
378 |
+ |
/* Nasty... Add the number to the end of the string.. This means |
379 |
+ |
* dev_name now contains the sunos name.. E.g. ssd1 |
380 |
+ |
*/ |
381 |
+ |
snprintf(dev_name, 50, "%s%d", dev_name, dev_num); |
382 |
+ |
if (disk_mapping == NULL){ |
383 |
+ |
disk_mapping = malloc(sizeof(disk_mapping_t)); |
384 |
+ |
d_ptr = disk_mapping; |
385 |
+ |
}else{ |
386 |
+ |
d_ptr->next = malloc(sizeof(disk_mapping_t)); |
387 |
+ |
d_ptr = d_ptr->next; |
388 |
+ |
} |
389 |
+ |
|
390 |
+ |
if (d_ptr == NULL){ |
391 |
+ |
free(file_lines); |
392 |
+ |
closedir(dsk); |
393 |
+ |
return NULL; |
394 |
+ |
} |
395 |
+ |
|
396 |
+ |
if( ((d_ptr->sunos_name = strdup(dev_name)) == NULL) || |
397 |
+ |
((d_ptr->solaris_name = strdup(dsk_ent->d_name))==NULL) ){ |
398 |
+ |
free(file_lines); |
399 |
+ |
closedir(dsk); |
400 |
+ |
return NULL; |
401 |
+ |
} |
402 |
+ |
} |
403 |
+ |
free(file_lines); |
404 |
+ |
closedir(dsk); |
405 |
+ |
} |
406 |
+ |
|
407 |
+ |
for(d_ptr = disk_mapping; d_ptr !=NULL; d_ptr=d_ptr->next){ |
408 |
+ |
if(!strcmp(sunos_name, d_ptr->sunos_name)){ |
409 |
+ |
return (strdup(d_ptr->solaris_name)); |
410 |
+ |
} |
411 |
+ |
} |
412 |
+ |
|
413 |
+ |
/* If we really fail to find it.. Return the original name back */ |
414 |
+ |
return strdup(sunos_name); |
415 |
+ |
} |
416 |
+ |
|
417 |
+ |
#endif |
418 |
+ |
|
419 |
|
diskio_stat_t *diskio_stat_malloc(int needed_entries, int *cur_entries, diskio_stat_t *diskio_stats){ |
420 |
|
|
421 |
|
if(diskio_stats==NULL){ |
445 |
|
static diskio_stat_t *diskio_stats=NULL; |
446 |
|
static int num_diskio=0; |
447 |
|
|
448 |
+ |
#ifdef LINUX |
449 |
+ |
typedef struct { |
450 |
+ |
int major; |
451 |
+ |
int minor; |
452 |
+ |
} partition; |
453 |
+ |
#endif |
454 |
+ |
|
455 |
|
diskio_stat_t *get_diskio_stats(int *entries){ |
456 |
|
|
457 |
|
static int sizeof_diskio_stats=0; |
467 |
|
char *line_ptr; |
468 |
|
int major, minor; |
469 |
|
char dev_letter; |
470 |
+ |
int has_pp_stats = 1; |
471 |
+ |
static partition *parts = NULL; |
472 |
+ |
static int alloc_parts = 0; |
473 |
+ |
int i, n; |
474 |
+ |
time_t now; |
475 |
|
#endif |
476 |
|
#ifdef FREEBSD |
477 |
< |
struct statinfo stats; |
477 |
> |
static struct statinfo stats; |
478 |
> |
static int stats_init = 0; |
479 |
|
int counter; |
480 |
|
struct device_selection *dev_sel = NULL; |
481 |
|
int n_selected, n_selections; |
485 |
|
num_diskio=0; |
486 |
|
|
487 |
|
#ifdef FREEBSD |
488 |
< |
stats.dinfo=malloc(sizeof(struct devinfo)); |
489 |
< |
if(stats.dinfo==NULL) return NULL; |
488 |
> |
if (!stats_init) { |
489 |
> |
stats.dinfo=malloc(sizeof(struct devinfo)); |
490 |
> |
if(stats.dinfo==NULL) return NULL; |
491 |
> |
stats_init = 1; |
492 |
> |
} |
493 |
|
if ((getdevs(&stats)) < 0) return NULL; |
494 |
|
/* Not aware of a get all devices, so i said 999. If we ever |
495 |
|
* find a machine with more than 999 disks, then i'll change |
548 |
|
|
549 |
|
if(diskio_stats_ptr->disk_name!=NULL) free(diskio_stats_ptr->disk_name); |
550 |
|
|
551 |
< |
diskio_stats_ptr->disk_name=strdup(ksp->ks_name); |
551 |
> |
diskio_stats_ptr->disk_name=drive_map(ksp->ks_name); |
552 |
|
diskio_stats_ptr->systime=time(NULL); |
553 |
|
num_diskio++; |
554 |
|
} |
558 |
|
#endif |
559 |
|
|
560 |
|
#ifdef LINUX |
561 |
< |
f=fopen("/proc/stat", "r"); |
562 |
< |
if(f==NULL){ |
563 |
< |
*entries=0; |
564 |
< |
return NULL; |
565 |
< |
} |
566 |
< |
if((line_ptr=f_read_line(f, "disk_io:"))==NULL){ |
567 |
< |
*entries=0; |
568 |
< |
fclose(f); |
569 |
< |
return NULL; |
570 |
< |
} |
571 |
< |
while((line_ptr=strchr(line_ptr, ' '))!=NULL){ |
572 |
< |
line_ptr++; |
573 |
< |
if(*line_ptr=='\0'){ |
574 |
< |
break; |
561 |
> |
num_diskio = 0; |
562 |
> |
n = 0; |
563 |
> |
|
564 |
> |
/* Read /proc/partitions to find what devices exist. Recent 2.4 kernels |
565 |
> |
have statistics in here too, so we can use those directly. */ |
566 |
> |
|
567 |
> |
f = fopen("/proc/partitions", "r"); |
568 |
> |
if (f == NULL) goto out; |
569 |
> |
now = time(NULL); |
570 |
> |
|
571 |
> |
while ((line_ptr = f_read_line(f, "")) != NULL) { |
572 |
> |
char name[20]; |
573 |
> |
char *s; |
574 |
> |
long long rsect, wsect; |
575 |
> |
|
576 |
> |
int nr = sscanf(line_ptr, |
577 |
> |
" %d %d %*d %19s %*d %*d %lld %*d %*d %*d %lld", |
578 |
> |
&major, &minor, name, &rsect, &wsect); |
579 |
> |
if (nr < 3) continue; |
580 |
> |
if (nr < 5) { |
581 |
> |
has_pp_stats = 0; |
582 |
> |
rsect = 0; |
583 |
> |
wsect = 0; |
584 |
|
} |
411 |
– |
if((diskio_stats=diskio_stat_malloc(num_diskio+1, &sizeof_diskio_stats, diskio_stats))==NULL){ |
412 |
– |
fclose(f); |
413 |
– |
*entries=0; |
414 |
– |
return NULL; |
415 |
– |
} |
416 |
– |
diskio_stats_ptr=diskio_stats+num_diskio; |
585 |
|
|
586 |
+ |
/* Skip device names ending in numbers, since they're |
587 |
+ |
partitions. */ |
588 |
+ |
s = name; |
589 |
+ |
while (*s != '\0') s++; |
590 |
+ |
--s; |
591 |
+ |
if (*s >= '0' && *s <= '9') continue; |
592 |
|
|
593 |
< |
if((sscanf(line_ptr, "(%d,%d):(%*d, %*d, %lld, %*d, %lld)", \ |
594 |
< |
&major, \ |
595 |
< |
&minor, \ |
596 |
< |
&diskio_stats_ptr->read_bytes, \ |
597 |
< |
&diskio_stats_ptr->write_bytes))!=4) { |
598 |
< |
continue; |
593 |
> |
diskio_stats = diskio_stat_malloc(n + 1, &sizeof_diskio_stats, |
594 |
> |
diskio_stats); |
595 |
> |
if (diskio_stats == NULL) goto out; |
596 |
> |
if (n >= alloc_parts) { |
597 |
> |
alloc_parts += 16; |
598 |
> |
parts = realloc(parts, alloc_parts * sizeof *parts); |
599 |
> |
if (parts == NULL) { |
600 |
> |
alloc_parts = 0; |
601 |
> |
goto out; |
602 |
> |
} |
603 |
|
} |
604 |
|
|
605 |
< |
/* We read the number of blocks. Blocks are stored in 512 bytes */ |
606 |
< |
diskio_stats_ptr->read_bytes=diskio_stats_ptr->read_bytes*512; |
607 |
< |
diskio_stats_ptr->write_bytes=diskio_stats_ptr->write_bytes*512; |
605 |
> |
if (diskio_stats[n].disk_name != NULL) |
606 |
> |
free(diskio_stats[n].disk_name); |
607 |
> |
diskio_stats[n].disk_name = strdup(name); |
608 |
> |
diskio_stats[n].read_bytes = rsect * 512; |
609 |
> |
diskio_stats[n].write_bytes = wsect * 512; |
610 |
> |
diskio_stats[n].systime = now; |
611 |
> |
parts[n].major = major; |
612 |
> |
parts[n].minor = minor; |
613 |
|
|
614 |
< |
if(diskio_stats_ptr->disk_name!=NULL) free(diskio_stats_ptr->disk_name); |
614 |
> |
n++; |
615 |
> |
} |
616 |
|
|
617 |
< |
switch(major){ |
618 |
< |
case 2: |
619 |
< |
if(minor==0){ |
436 |
< |
diskio_stats_ptr->disk_name=strdup("fd0"); |
437 |
< |
} |
438 |
< |
break; |
617 |
> |
if (!has_pp_stats) { |
618 |
> |
/* This is an older kernel without stats in /proc/partitions. |
619 |
> |
Read what we can from /proc/stat instead. */ |
620 |
|
|
621 |
< |
case 3: |
622 |
< |
if(minor==0){ |
623 |
< |
diskio_stats_ptr->disk_name=strdup("hda"); |
624 |
< |
}else{ |
625 |
< |
diskio_stats_ptr->disk_name=strdup("hdb"); |
626 |
< |
} |
627 |
< |
break; |
621 |
> |
f = fopen("/proc/stat", "r"); |
622 |
> |
if (f == NULL) goto out; |
623 |
> |
now = time(NULL); |
624 |
> |
|
625 |
> |
line_ptr = f_read_line(f, "disk_io:"); |
626 |
> |
if (line_ptr == NULL) goto out; |
627 |
> |
|
628 |
> |
while((line_ptr=strchr(line_ptr, ' '))!=NULL){ |
629 |
> |
long long rsect, wsect; |
630 |
|
|
631 |
+ |
if (*++line_ptr == '\0') break; |
632 |
+ |
|
633 |
+ |
if((sscanf(line_ptr, |
634 |
+ |
"(%d,%d):(%*d, %*d, %lld, %*d, %lld)", |
635 |
+ |
&major, &minor, &rsect, &wsect)) != 4) { |
636 |
+ |
continue; |
637 |
+ |
} |
638 |
+ |
|
639 |
+ |
/* Find the corresponding device from earlier. |
640 |
+ |
Just to add to the fun, "minor" is actually the disk |
641 |
+ |
number, not the device minor, so we need to figure |
642 |
+ |
out the real minor number based on the major! |
643 |
+ |
This list is not exhaustive; if you're running |
644 |
+ |
an older kernel you probably don't have fancy |
645 |
+ |
I2O hardware anyway... */ |
646 |
+ |
switch (major) { |
647 |
+ |
case 3: |
648 |
+ |
case 21: |
649 |
|
case 22: |
650 |
< |
if(minor==0){ |
651 |
< |
diskio_stats_ptr->disk_name=strdup("hdc"); |
652 |
< |
}else{ |
653 |
< |
diskio_stats_ptr->disk_name=strdup("hdd"); |
654 |
< |
} |
650 |
> |
case 33: |
651 |
> |
case 34: |
652 |
> |
case 36: |
653 |
> |
case 56: |
654 |
> |
case 57: |
655 |
> |
case 88: |
656 |
> |
case 89: |
657 |
> |
case 90: |
658 |
> |
case 91: |
659 |
> |
minor *= 64; |
660 |
|
break; |
661 |
< |
case 8: |
662 |
< |
dev_letter='a'+(minor/16); |
457 |
< |
diskio_stats_ptr->disk_name=malloc(4); |
458 |
< |
snprintf(diskio_stats_ptr->disk_name, 4, "sd%c", dev_letter); |
661 |
> |
case 9: |
662 |
> |
case 43: |
663 |
|
break; |
664 |
|
default: |
665 |
< |
/* I have no idea what it is then :) */ |
462 |
< |
diskio_stats_ptr->disk_name=malloc(16); |
463 |
< |
snprintf(diskio_stats_ptr->disk_name, 16, "%d %d", major, minor); |
665 |
> |
minor *= 16; |
666 |
|
break; |
667 |
< |
} |
667 |
> |
} |
668 |
> |
for (i = 0; i < n; i++) { |
669 |
> |
if (major == parts[i].major |
670 |
> |
&& minor == parts[i].minor) |
671 |
> |
break; |
672 |
> |
} |
673 |
> |
if (i == n) continue; |
674 |
|
|
675 |
< |
diskio_stats_ptr->systime=time(NULL); |
676 |
< |
num_diskio++; |
675 |
> |
/* We read the number of blocks. Blocks are stored in |
676 |
> |
512 bytes */ |
677 |
> |
diskio_stats[i].read_bytes = rsect * 512; |
678 |
> |
diskio_stats[i].write_bytes = wsect * 512; |
679 |
> |
diskio_stats[i].systime = now; |
680 |
> |
} |
681 |
|
} |
682 |
|
|
683 |
< |
fclose(f); |
683 |
> |
num_diskio = n; |
684 |
> |
out: |
685 |
> |
if (f != NULL) fclose(f); |
686 |
|
|
687 |
|
#endif |
688 |
|
*entries=num_diskio; |