forked from clbr/radeontop
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathticks.c
106 lines (80 loc) · 2.91 KB
/
ticks.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
/*
Copyright (C) 2012 Lauri Kasanen
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, version 3 of the License.
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/>.
*/
#include "radeontop.h"
#include <pthread.h>
struct bits_t *results = NULL;
static void *collector(void *arg) {
const unsigned int ticks = * ((unsigned int *) arg);
struct bits_t res[2];
// Save one second's worth of history
struct bits_t *history = calloc(ticks, sizeof(struct bits_t));
unsigned int cur = 0, curres = 0;
const useconds_t sleeptime = 1e6 / ticks;
while (1) {
unsigned int stat = readgrbm();
memset(&history[cur], 0, sizeof(struct bits_t));
if (stat & bits.ee) history[cur].ee = 1;
if (stat & bits.vgt) history[cur].vgt = 1;
if (stat & bits.gui) history[cur].gui = 1;
if (stat & bits.ta) history[cur].ta = 1;
if (stat & bits.tc) history[cur].tc = 1;
if (stat & bits.sx) history[cur].sx = 1;
if (stat & bits.sh) history[cur].sh = 1;
if (stat & bits.spi) history[cur].spi = 1;
if (stat & bits.smx) history[cur].smx = 1;
if (stat & bits.sc) history[cur].sc = 1;
if (stat & bits.pa) history[cur].pa = 1;
if (stat & bits.db) history[cur].db = 1;
if (stat & bits.cr) history[cur].cr = 1;
if (stat & bits.cb) history[cur].cb = 1;
usleep(sleeptime);
cur++;
cur %= ticks;
// One second has passed, we have one sec's worth of data
if (cur == 0) {
unsigned int i;
memset(&res[curres], 0, sizeof(struct bits_t));
for (i = 0; i < ticks; i++) {
res[curres].ee += history[i].ee;
res[curres].vgt += history[i].vgt;
res[curres].gui += history[i].gui;
res[curres].ta += history[i].ta;
res[curres].tc += history[i].tc;
res[curres].sx += history[i].sx;
res[curres].sh += history[i].sh;
res[curres].spi += history[i].spi;
res[curres].smx += history[i].smx;
res[curres].sc += history[i].sc;
res[curres].pa += history[i].pa;
res[curres].db += history[i].db;
res[curres].cb += history[i].cb;
res[curres].cr += history[i].cr;
}
res[curres].vram = getvram();
// Atomically write it to the pointer
__sync_bool_compare_and_swap(&results, results, &res[curres]);
curres++;
curres %= 2;
}
}
return NULL;
}
void collect(unsigned int *ticks) {
// Start a thread collecting data
pthread_t tid;
pthread_attr_t attr;
// We don't care to join this thread
pthread_attr_init(&attr);
pthread_attr_setdetachstate(&attr, PTHREAD_CREATE_DETACHED);
pthread_create(&tid, &attr, collector, ticks);
}