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
|
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <time.h>
#include <ctype.h>
#include "util.h"
static struct feed *feeds = NULL; /* start of feeds linked-list. */
static char *line = NULL;
static void
cleanup(void) {
free(line); /* free line */
line = NULL;
feedsfree(feeds); /* free feeds linked-list */
}
/* print error message to stderr */
static void
die(const char *s) {
fprintf(stderr, "sfeed_stats: %s\n", s);
exit(EXIT_FAILURE);
}
int
main(void) {
char *fields[FieldLast], timenewestformat[64] = "";
unsigned long totalfeeds = 0, totalnew = 0, totalitems = 0;
unsigned int isnew;
struct feed *f, *fcur = NULL;
time_t parsedtime, comparetime, timenewest = 0;
size_t size = 0;
atexit(cleanup);
comparetime = time(NULL) - (3600 * 24); /* 1 day is old news */
if(!(fcur = calloc(1, sizeof(struct feed))))
die("can't allocate enough memory");
feeds = fcur;
while(parseline(&line, &size, fields, FieldLast, '\t', stdin) > 0) {
parsedtime = (time_t)strtol(fields[FieldUnixTimestamp], NULL, 10);
isnew = (parsedtime >= comparetime) ? 1 : 0;
/* first of feed section or new feed section. */
if(!totalfeeds || (fcur && strcmp(fcur->name, fields[FieldFeedName]))) {
if(!(f = calloc(1, sizeof(struct feed))))
die("can't allocate enough memory");
if(totalfeeds) { /* end previous one. */
fcur->next = f;
fcur = f;
} else {
fcur = f;
feeds = fcur; /* first item. */
}
if(parsedtime > timenewest) {
timenewest = parsedtime;
strlcpy(timenewestformat, fields[FieldTimeFormatted],
sizeof(timenewestformat));
}
if(parsedtime > fcur->timenewest) {
fcur->timenewest = parsedtime;
strlcpy(fcur->timenewestformat, fields[FieldTimeFormatted],
sizeof(fcur->timenewestformat));
}
/* TODO: memcpy and make fcur->name static? */
if(!(fcur->name = strdup(fields[FieldFeedName])))
die("can't allocate enough memory");
totalfeeds++;
}
totalnew += isnew;
fcur->totalnew += isnew;
fcur->total++;
totalitems++;
}
for(fcur = feeds; fcur; fcur = fcur->next) {
if(!fcur->name || fcur->name[0] == '\0')
continue;
fprintf(stdout, "%c %-20.20s [%4lu/%-4lu]",
fcur->totalnew > 0 ? 'N' : ' ',
fcur->name, fcur->totalnew, fcur->total);
if(fcur->timenewestformat && fcur->timenewestformat[0])
fprintf(stdout, " %s", fcur->timenewestformat);
putchar('\n');
}
printf(" ================================\n");
printf("%c %-20.20s [%4lu/%-4lu] %s\n", totalnew > 0 ? 'N' : ' ', "Total:",
totalnew, totalitems, timenewestformat);
return EXIT_SUCCESS;
}
|
