1*4882a593Smuzhiyun /*
2*4882a593Smuzhiyun * Copyright © 2018 Alexey Dobriyan <adobriyan@gmail.com>
3*4882a593Smuzhiyun *
4*4882a593Smuzhiyun * Permission to use, copy, modify, and distribute this software for any
5*4882a593Smuzhiyun * purpose with or without fee is hereby granted, provided that the above
6*4882a593Smuzhiyun * copyright notice and this permission notice appear in all copies.
7*4882a593Smuzhiyun *
8*4882a593Smuzhiyun * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
9*4882a593Smuzhiyun * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
10*4882a593Smuzhiyun * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
11*4882a593Smuzhiyun * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
12*4882a593Smuzhiyun * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
13*4882a593Smuzhiyun * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
14*4882a593Smuzhiyun * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
15*4882a593Smuzhiyun */
16*4882a593Smuzhiyun #undef NDEBUG
17*4882a593Smuzhiyun #include <assert.h>
18*4882a593Smuzhiyun #include <errno.h>
19*4882a593Smuzhiyun #include <string.h>
20*4882a593Smuzhiyun #include <stdlib.h>
21*4882a593Smuzhiyun #include <unistd.h>
22*4882a593Smuzhiyun
23*4882a593Smuzhiyun #include "proc.h"
24*4882a593Smuzhiyun
proc_uptime(int fd,uint64_t * uptime,uint64_t * idle)25*4882a593Smuzhiyun static void proc_uptime(int fd, uint64_t *uptime, uint64_t *idle)
26*4882a593Smuzhiyun {
27*4882a593Smuzhiyun uint64_t val1, val2;
28*4882a593Smuzhiyun char buf[64], *p;
29*4882a593Smuzhiyun ssize_t rv;
30*4882a593Smuzhiyun
31*4882a593Smuzhiyun /* save "p < end" checks */
32*4882a593Smuzhiyun memset(buf, 0, sizeof(buf));
33*4882a593Smuzhiyun rv = pread(fd, buf, sizeof(buf), 0);
34*4882a593Smuzhiyun assert(0 <= rv && rv <= sizeof(buf));
35*4882a593Smuzhiyun buf[sizeof(buf) - 1] = '\0';
36*4882a593Smuzhiyun
37*4882a593Smuzhiyun p = buf;
38*4882a593Smuzhiyun
39*4882a593Smuzhiyun val1 = xstrtoull(p, &p);
40*4882a593Smuzhiyun assert(p[0] == '.');
41*4882a593Smuzhiyun assert('0' <= p[1] && p[1] <= '9');
42*4882a593Smuzhiyun assert('0' <= p[2] && p[2] <= '9');
43*4882a593Smuzhiyun assert(p[3] == ' ');
44*4882a593Smuzhiyun
45*4882a593Smuzhiyun val2 = (p[1] - '0') * 10 + p[2] - '0';
46*4882a593Smuzhiyun *uptime = val1 * 100 + val2;
47*4882a593Smuzhiyun
48*4882a593Smuzhiyun p += 4;
49*4882a593Smuzhiyun
50*4882a593Smuzhiyun val1 = xstrtoull(p, &p);
51*4882a593Smuzhiyun assert(p[0] == '.');
52*4882a593Smuzhiyun assert('0' <= p[1] && p[1] <= '9');
53*4882a593Smuzhiyun assert('0' <= p[2] && p[2] <= '9');
54*4882a593Smuzhiyun assert(p[3] == '\n');
55*4882a593Smuzhiyun
56*4882a593Smuzhiyun val2 = (p[1] - '0') * 10 + p[2] - '0';
57*4882a593Smuzhiyun *idle = val1 * 100 + val2;
58*4882a593Smuzhiyun
59*4882a593Smuzhiyun assert(p + 4 == buf + rv);
60*4882a593Smuzhiyun }
61