2010-01-04 17:06:14 +00:00
|
|
|
/* -*- mode: c++; c-basic-offset: 4; tab-width: 4; indent-tabs-mode: t -*-
|
|
|
|
* vim: ts=4 sw=4 noet ai cindent syntax=cpp
|
2009-07-28 21:44:22 +00:00
|
|
|
*
|
2008-02-09 02:21:06 +00:00
|
|
|
* Conky, a system monitor, based on torsmo
|
|
|
|
*
|
|
|
|
* Any original torsmo code is licensed under the BSD license
|
|
|
|
*
|
|
|
|
* All code written since the fork of torsmo is licensed under the GPL
|
|
|
|
*
|
|
|
|
* Please see COPYING for details
|
|
|
|
*
|
|
|
|
* Copyright (c) 2004, Hannu Saransaari and Lauri Hakkarainen
|
2012-05-03 23:34:44 +00:00
|
|
|
* Copyright (c) 2005-2012 Brenden Matthews, Philip Kovacs, et. al.
|
2008-02-09 02:21:06 +00:00
|
|
|
* (see AUTHORS)
|
|
|
|
* 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 3 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.
|
|
|
|
* You should have received a copy of the GNU General Public License
|
|
|
|
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
2008-12-15 21:40:24 +00:00
|
|
|
#include "config.h"
|
|
|
|
#include "conky.h" /* text_buffer_size */
|
2009-10-07 20:44:17 +00:00
|
|
|
#include "core.h"
|
2008-12-15 21:40:24 +00:00
|
|
|
#include "logging.h"
|
|
|
|
#include "diskio.h"
|
|
|
|
#include "common.h"
|
2009-10-07 20:44:17 +00:00
|
|
|
#include "specials.h"
|
|
|
|
#include "text_object.h"
|
2008-12-15 21:40:24 +00:00
|
|
|
#include <stdlib.h>
|
2009-05-14 22:52:18 +00:00
|
|
|
#include <sys/stat.h>
|
2010-01-04 17:06:14 +00:00
|
|
|
#include <vector>
|
2008-02-09 02:21:06 +00:00
|
|
|
|
2008-12-25 15:36:29 +00:00
|
|
|
/* this is the root of all per disk stats,
|
|
|
|
* also containing the totals. */
|
2010-01-04 17:06:14 +00:00
|
|
|
struct diskio_stat stats;
|
2008-02-09 02:21:06 +00:00
|
|
|
|
2008-03-29 02:01:03 +00:00
|
|
|
void clear_diskio_stats(void)
|
2008-02-09 02:21:06 +00:00
|
|
|
{
|
2008-12-25 15:36:29 +00:00
|
|
|
struct diskio_stat *cur;
|
|
|
|
while (stats.next) {
|
|
|
|
cur = stats.next;
|
|
|
|
stats.next = stats.next->next;
|
2010-02-23 22:13:11 +00:00
|
|
|
free_and_zero(cur->dev);
|
2008-12-25 15:36:29 +00:00
|
|
|
free(cur);
|
2008-02-09 02:21:06 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
struct diskio_stat *prepare_diskio_stat(const char *s)
|
|
|
|
{
|
2009-05-14 22:52:18 +00:00
|
|
|
struct stat sb;
|
2015-02-19 19:42:50 +00:00
|
|
|
std::vector<char> stat_name(text_buffer_size.get(*state)), device_name(text_buffer_size.get(*state)), device_s(text_buffer_size.get(*state));
|
2008-12-25 15:36:29 +00:00
|
|
|
struct diskio_stat *cur = &stats;
|
2008-12-16 01:32:30 +00:00
|
|
|
|
2015-02-19 19:42:50 +00:00
|
|
|
if (!s) {
|
2008-12-25 15:36:29 +00:00
|
|
|
return &stats;
|
2015-02-19 19:42:50 +00:00
|
|
|
} else {
|
|
|
|
strncpy(&(device_s[0]), s, text_buffer_size.get(*state));
|
|
|
|
}
|
|
|
|
|
|
|
|
if (strncmp(&(device_s[0]), "label:", 6) == 0) {
|
|
|
|
snprintf(&(device_name[0]), text_buffer_size.get(*state), "/dev/disk/by-label/%s", &(device_s[6]));
|
|
|
|
|
|
|
|
char * rpbuf;
|
|
|
|
rpbuf = realpath(&device_name[0], NULL);
|
2015-03-01 05:03:37 +00:00
|
|
|
if (rpbuf) {
|
|
|
|
strncpy(&device_s[0], rpbuf, text_buffer_size.get(*state));
|
|
|
|
}
|
2015-02-19 19:42:50 +00:00
|
|
|
free(rpbuf);
|
2008-12-16 01:32:30 +00:00
|
|
|
|
2015-02-19 19:42:50 +00:00
|
|
|
} else {
|
|
|
|
strncpy(&device_s[0], s, text_buffer_size.get(*state));
|
|
|
|
}
|
|
|
|
|
|
|
|
#if defined(__FreeBSD__) || defined(__DragonFly__) || defined(__linux__)
|
|
|
|
if (strncmp(&device_s[0], "/dev/", 5) == 0) {
|
|
|
|
device_s.erase(device_s.begin(), device_s.begin()+5);
|
|
|
|
}
|
2009-05-14 22:52:18 +00:00
|
|
|
#endif
|
2015-02-19 19:42:50 +00:00
|
|
|
strncpy(&(device_name[0]), &device_s[0], text_buffer_size.get(*state));
|
2009-05-14 22:52:18 +00:00
|
|
|
|
2010-08-29 21:50:32 +00:00
|
|
|
snprintf(&(stat_name[0]), text_buffer_size.get(*state), "/dev/%s", &(device_name[0]));
|
2009-05-14 22:52:18 +00:00
|
|
|
|
2010-01-04 17:06:14 +00:00
|
|
|
if (stat(&(stat_name[0]), &sb)) {
|
2009-08-01 18:45:43 +00:00
|
|
|
NORM_ERR("diskio device '%s' does not exist", s);
|
2009-05-14 22:52:18 +00:00
|
|
|
}
|
|
|
|
|
2008-12-25 15:36:29 +00:00
|
|
|
/* lookup existing */
|
|
|
|
while (cur->next) {
|
|
|
|
cur = cur->next;
|
2010-01-04 17:06:14 +00:00
|
|
|
if (!strcmp(cur->dev, &(device_name[0]))) {
|
2008-12-25 15:36:29 +00:00
|
|
|
return cur;
|
2009-05-14 22:52:18 +00:00
|
|
|
}
|
2008-02-09 02:21:06 +00:00
|
|
|
}
|
2008-12-25 15:36:29 +00:00
|
|
|
|
|
|
|
/* no existing found, make a new one */
|
2010-01-04 17:06:14 +00:00
|
|
|
cur->next = new diskio_stat;
|
2008-12-25 15:36:29 +00:00
|
|
|
cur = cur->next;
|
2015-02-19 19:42:50 +00:00
|
|
|
cur->dev = strndup(&(device_s[0]), text_buffer_size.get(*state));
|
2008-12-25 15:36:29 +00:00
|
|
|
cur->last = UINT_MAX;
|
|
|
|
cur->last_read = UINT_MAX;
|
|
|
|
cur->last_write = UINT_MAX;
|
2009-05-14 22:52:18 +00:00
|
|
|
|
2008-12-25 15:36:29 +00:00
|
|
|
return cur;
|
|
|
|
}
|
|
|
|
|
2009-10-07 20:44:17 +00:00
|
|
|
void parse_diskio_arg(struct text_object *obj, const char *arg)
|
|
|
|
{
|
|
|
|
obj->data.opaque = prepare_diskio_stat(arg);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* dir indicates the direction:
|
|
|
|
* -1: read
|
|
|
|
* 0: read + write
|
|
|
|
* 1: write
|
|
|
|
*/
|
2009-11-08 12:54:42 +00:00
|
|
|
static void print_diskio_dir(struct text_object *obj, int dir, char *p, int p_max_size)
|
2009-10-07 20:44:17 +00:00
|
|
|
{
|
2010-01-04 17:06:14 +00:00
|
|
|
struct diskio_stat *diskio = (struct diskio_stat *)obj->data.opaque;
|
2009-10-07 20:44:17 +00:00
|
|
|
double val;
|
|
|
|
|
|
|
|
if (!diskio)
|
|
|
|
return;
|
|
|
|
|
|
|
|
if (dir < 0)
|
|
|
|
val = diskio->current_read;
|
2010-01-06 18:17:40 +00:00
|
|
|
else if (dir == 0)
|
2009-10-07 20:44:17 +00:00
|
|
|
val = diskio->current;
|
|
|
|
else
|
|
|
|
val = diskio->current_write;
|
|
|
|
|
|
|
|
/* TODO: move this correction from kB to kB/s elsewhere
|
|
|
|
* (or get rid of it??) */
|
2010-09-11 12:25:19 +00:00
|
|
|
human_readable((val / active_update_interval()) * 1024LL, p, p_max_size);
|
2009-10-07 20:44:17 +00:00
|
|
|
}
|
|
|
|
|
2009-11-08 12:54:42 +00:00
|
|
|
void print_diskio(struct text_object *obj, char *p, int p_max_size)
|
|
|
|
{
|
|
|
|
print_diskio_dir(obj, 0, p, p_max_size);
|
|
|
|
}
|
|
|
|
|
|
|
|
void print_diskio_read(struct text_object *obj, char *p, int p_max_size)
|
|
|
|
{
|
|
|
|
print_diskio_dir(obj, -1, p, p_max_size);
|
|
|
|
}
|
|
|
|
|
|
|
|
void print_diskio_write(struct text_object *obj, char *p, int p_max_size)
|
|
|
|
{
|
|
|
|
print_diskio_dir(obj, 1, p, p_max_size);
|
|
|
|
}
|
|
|
|
|
2010-01-07 02:38:12 +00:00
|
|
|
#ifdef BUILD_X11
|
2009-10-07 20:44:17 +00:00
|
|
|
void parse_diskiograph_arg(struct text_object *obj, const char *arg)
|
|
|
|
{
|
|
|
|
char *buf = 0;
|
2009-11-05 23:05:08 +00:00
|
|
|
buf = scan_graph(obj, arg, 0);
|
2009-10-07 20:44:17 +00:00
|
|
|
|
|
|
|
obj->data.opaque = prepare_diskio_stat(dev_name(buf));
|
2010-02-23 22:13:11 +00:00
|
|
|
free_and_zero(buf);
|
2009-10-07 20:44:17 +00:00
|
|
|
}
|
|
|
|
|
2009-12-04 00:51:41 +00:00
|
|
|
double diskiographval(struct text_object *obj)
|
2009-10-07 20:44:17 +00:00
|
|
|
{
|
2010-01-04 17:06:14 +00:00
|
|
|
struct diskio_stat *diskio = (struct diskio_stat *)obj->data.opaque;
|
2009-10-07 20:44:17 +00:00
|
|
|
|
2009-12-04 00:51:41 +00:00
|
|
|
return (diskio ? diskio->current : 0);
|
2009-10-07 20:44:17 +00:00
|
|
|
}
|
2009-11-08 12:54:42 +00:00
|
|
|
|
2009-12-04 00:51:41 +00:00
|
|
|
double diskiographval_read(struct text_object *obj)
|
2009-11-08 12:54:42 +00:00
|
|
|
{
|
2010-01-04 17:06:14 +00:00
|
|
|
struct diskio_stat *diskio = (struct diskio_stat *)obj->data.opaque;
|
2009-11-08 12:54:42 +00:00
|
|
|
|
2009-12-04 00:51:41 +00:00
|
|
|
return (diskio ? diskio->current_read : 0);
|
2009-11-08 12:54:42 +00:00
|
|
|
}
|
|
|
|
|
2009-12-04 00:51:41 +00:00
|
|
|
double diskiographval_write(struct text_object *obj)
|
2009-11-08 12:54:42 +00:00
|
|
|
{
|
2010-01-04 17:06:14 +00:00
|
|
|
struct diskio_stat *diskio = (struct diskio_stat *)obj->data.opaque;
|
2009-11-23 23:17:52 +00:00
|
|
|
|
2009-12-04 00:51:41 +00:00
|
|
|
return (diskio ? diskio->current_write : 0);
|
2009-11-08 12:54:42 +00:00
|
|
|
}
|
2010-01-07 02:38:12 +00:00
|
|
|
#endif /* BUILD_X11 */
|
2009-10-07 20:44:17 +00:00
|
|
|
|
2009-05-14 22:52:18 +00:00
|
|
|
void update_diskio_values(struct diskio_stat *ds,
|
2008-12-25 15:36:29 +00:00
|
|
|
unsigned int reads, unsigned int writes)
|
|
|
|
{
|
2009-05-01 23:03:59 +00:00
|
|
|
int i;
|
|
|
|
double sum=0, sum_r=0, sum_w=0;
|
|
|
|
|
2008-12-25 15:36:29 +00:00
|
|
|
if (reads < ds->last_read || writes < ds->last_write) {
|
|
|
|
/* counter overflow or reset - rebase to sane values */
|
2009-05-01 23:03:59 +00:00
|
|
|
ds->last = reads+writes;
|
|
|
|
ds->last_read = reads;
|
|
|
|
ds->last_write = writes;
|
2008-03-31 03:56:03 +00:00
|
|
|
}
|
2010-02-28 13:05:28 +00:00
|
|
|
/* since the values in /proc/diskstats are absolute, we have to subtract
|
2008-12-25 15:36:29 +00:00
|
|
|
* our last reading. The numbers stand for "sectors read", and we therefore
|
|
|
|
* have to divide by two to get KB */
|
2009-05-01 23:03:59 +00:00
|
|
|
ds->sample_read[0] = (reads - ds->last_read) / 2;
|
|
|
|
ds->sample_write[0] = (writes - ds->last_write) / 2;
|
|
|
|
ds->sample[0] = ds->sample_read[0] + ds->sample_write[0];
|
|
|
|
|
|
|
|
/* compute averages */
|
2010-08-22 10:31:11 +00:00
|
|
|
int samples = diskio_avg_samples.get(*state);
|
|
|
|
for (i = 0; i < samples; i++) {
|
2009-05-01 23:03:59 +00:00
|
|
|
sum += ds->sample[i];
|
|
|
|
sum_r += ds->sample_read[i];
|
|
|
|
sum_w += ds->sample_write[i];
|
|
|
|
}
|
2010-08-22 10:31:11 +00:00
|
|
|
ds->current = sum / (double) samples;
|
|
|
|
ds->current_read = sum_r / (double) samples;
|
|
|
|
ds->current_write = sum_w / (double) samples;
|
2009-05-01 23:03:59 +00:00
|
|
|
|
|
|
|
/* shift sample history */
|
2010-08-22 10:31:11 +00:00
|
|
|
for (i = samples-1; i > 0; i--) {
|
2009-05-01 23:03:59 +00:00
|
|
|
ds->sample[i] = ds->sample[i-1];
|
|
|
|
ds->sample_read[i] = ds->sample_read[i-1];
|
|
|
|
ds->sample_write[i] = ds->sample_write[i-1];
|
|
|
|
}
|
2008-12-25 15:36:29 +00:00
|
|
|
|
2009-05-01 23:03:59 +00:00
|
|
|
/* save last */
|
2008-12-25 15:36:29 +00:00
|
|
|
ds->last_read = reads;
|
|
|
|
ds->last_write = writes;
|
|
|
|
ds->last = ds->last_read + ds->last_write;
|
2008-02-09 02:21:06 +00:00
|
|
|
}
|
2008-04-10 22:45:45 +00:00
|
|
|
|