#include #include #include #include #include #include #include #include #include "util.h" static int firsttime; static char *line; static size_t linesize; struct line { char *timestamp; char *id; struct line *next; }; /* ofcourse: bigger bucket size uses more memory, but has less collisions. */ #define BUCKET_SIZE 16384 struct bucket { struct line cols[BUCKET_SIZE]; }; static struct bucket *buckets; static struct bucket *bucket; static const uint32_t seed = 0x45931287; static void printfeed(FILE *fp, const char *feedname) { struct line *match; char *fields[FieldLast]; uint32_t hash; int uniq; ssize_t n; while ((n = getline(&line, &linesize, fp)) > 0) { if (line[n] == '\n') line[--n] = '\0'; hash = murmur3_32(line, n, seed) % BUCKET_SIZE; for (uniq = 1, match = &(bucket->cols[hash]); match; match = match->next) { /* check for collision, can still be unique. */ if (match->s && match->len == (size_t)n && !strcmp(line, match->s)) { uniq = 0; break; } /* nonexistent or no collision */ if (!match->next) { if (!(match = match->next = calloc(1, sizeof(struct line)))) err(1, "calloc"); if (!(match->s = strdup(line))) err(1, "strdup"); match->len = (size_t)n; break; } } if (!uniq || firsttime) continue; if (!parseline(line, fields)) break; if (feedname[0]) printf("%-15.15s %-30.30s", feedname, fields[FieldTimeFormatted]); printutf8pad(stdout, fields[FieldTitle], 70, ' '); printf(" %s\n", fields[FieldLink]); } } int main(int argc, char *argv[]) { char *name; FILE *fp; int i; if (pledge("stdio", NULL) == -1) err(1, "pledge"); if (!(bucket = buckets = calloc(argc, sizeof(struct bucket)))) err(1, "calloc"); for (firsttime = (argc > 1); ; firsttime = 0) { if (argc == 1) { printfeed(stdin, ""); } else { for (i = 1; i < argc; i++) { bucket = &buckets[i - 1]; if (!(fp = fopen(argv[i], "r"))) err(1, "fopen: %s", argv[i]); name = xbasename(argv[i]); printfeed(fp, name); free(name); if (ferror(fp)) err(1, "ferror: %s", argv[i]); fclose(fp); } } sleep(60); } return 0; }