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
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
|
/* Copyright (C) 2019 C. McEnroe <june@causal.agency>
*
* 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 <https://www.gnu.org/licenses/>.
*/
#include <err.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/wait.h>
#include <sysexits.h>
#include <unistd.h>
#include "database.h"
struct Event {
const char *network;
const char *context;
const char *time;
enum Type type;
const char *nick;
const char *user;
const char *host;
const char *target;
const char *message;
};
typedef void Format(bool group, struct Event event);
static void formatPlain(bool group, struct Event e) {
(void)group;
printf("%s/%s: [%s] ", e.network, e.context, e.time);
switch (e.type) {
break; case Privmsg: {
printf("<%s> %s\n", e.nick, e.message);
}
break; case Notice: {
printf("-%s- %s\n", e.nick, e.message);
}
break; case Action: {
printf("* %s %s\n", e.nick, e.message);
}
break; case Join: {
printf("%s joined\n", e.nick);
}
break; case Part: {
printf("%s parted: %s\n", e.nick, e.message);
}
break; case Quit: {
printf("%s quit: %s\n", e.nick, e.message);
}
break; case Kick: {
printf("%s kicked %s: %s\n", e.nick, e.target, e.message);
}
break; case Nick: {
printf("%s changed nick to %s\n", e.nick, e.target);
}
break; case Topic: {
printf("%s set the topic: %s\n", e.nick, e.message);
}
}
}
static const int Colors[] = {
31, 32, 33, 34, 35, 36, 37,
90, 91, 92, 93, 94, 95, 96, 97,
};
static int color(const char *user) {
return Colors[hash(user) % ARRAY_LEN(Colors)];
}
static void formatColor(bool group, struct Event e) {
static char network[256];
static char context[256];
if (group && (strcmp(e.network, network) || strcmp(e.context, context))) {
printf("%s%s/%s:\n", (network[0] ? "\n" : ""), e.network, e.context);
snprintf(network, sizeof(network), "%s", e.network);
snprintf(context, sizeof(context), "%s", e.context);
} else if (!group) {
printf("%s/%s: ", e.network, e.context);
}
printf("[%s] ", e.time);
#define NICK "\33[%dm%s\33[m"
switch (e.type) {
break; case Privmsg: {
printf("<" NICK "> %s\n", color(e.user), e.nick, e.message);
}
break; case Notice: {
printf("-" NICK "- %s\n", color(e.user), e.nick, e.message);
}
break; case Action: {
printf("* " NICK " %s\n", color(e.user), e.nick, e.message);
}
break; case Join: {
printf(NICK " joined\n", color(e.user), e.nick);
}
break; case Part: {
printf(NICK " parted: %s\n", color(e.user), e.nick, e.message);
}
break; case Quit: {
printf(NICK " quit: %s\n", color(e.user), e.nick, e.message);
}
break; case Kick: {
printf(
NICK " kicked %s: %s\n",
color(e.user), e.nick, e.target, e.message
);
}
break; case Nick: {
printf(
NICK " changed nick to " NICK "\n",
color(e.user), e.nick, color(e.user), e.target
);
}
break; case Topic: {
printf(NICK "set the topic: %s\n", color(e.user), e.nick, e.message);
}
}
#undef NICK
}
static void formatIRC(bool group, struct Event e) {
(void)group;
if (!strcmp(e.host, e.nick)) {
printf("@time=%s :%s ", e.time, e.host);
} else {
printf("@time=%s :%s!%s@%s ", e.time, e.nick, e.user, e.host);
}
if (!strcmp(e.context, e.nick)) e.context = "*";
switch (e.type) {
break; case Privmsg: {
printf("PRIVMSG %s :%s\r\n", e.context, e.message);
}
break; case Notice: {
printf("NOTICE %s :%s\r\n", e.context, e.message);
}
break; case Action: {
printf("PRIVMSG %s :\1ACTION %s\1\r\n", e.context, e.message);
}
break; case Join: {
printf("JOIN %s\r\n", e.context);
}
break; case Part: {
printf("PART %s :%s\r\n", e.context, e.message);
}
break; case Quit: {
printf("QUIT :%s\r\n", e.message);
}
break; case Kick: {
printf("KICK %s %s :%s\r\n", e.context, e.target, e.message);
}
break; case Nick: {
printf("NICK %s\r\n", e.target);
}
break; case Topic: {
printf("TOPIC %s :%s\r\n", e.context, e.message);
}
}
}
static const char *Inner = SQL(
SELECT
contexts.network,
contexts.name AS context,
strftime(coalesce(:format, '%Y-%m-%dT%H:%M:%SZ'), events.time) AS time,
events.type,
names.nick,
names.user,
names.host,
events.target,
highlight(search, 6, :open, :close),
events.event
FROM events
JOIN contexts USING (context)
JOIN names USING (name)
JOIN search ON search.rowid = events.event
WHERE coalesce(contexts.network = :network, true)
AND coalesce(contexts.name = :context, true)
AND coalesce(contexts.query = :query, true)
AND coalesce(date(events.time) = date(:date), true)
AND coalesce(events.time >= datetime(:after), true)
AND coalesce(events.time <= datetime(:before), true)
AND coalesce(events.type = :type, true)
AND coalesce(names.nick = :nick, true)
AND coalesce(names.user = :user, true)
AND coalesce(names.host = :host, true)
AND coalesce(events.target = :target, true)
);
static const char *Search = SQL(search MATCH :search);
static const char *Limit = SQL(
ORDER BY time DESC, event DESC
LIMIT coalesce(:limit, -1)
);
static const char *Outer = SQL(
SELECT * FROM results
ORDER BY time, event
);
static const char *Group = SQL(
SELECT * FROM results
ORDER BY network, context, time, event
);
static const char *TypeNames[] = {
#define X(id, name) [id] = name,
ENUM_TYPE
#undef X
};
static enum Type parseType(const char *input) {
for (enum Type type = 0; type < ARRAY_LEN(TypeNames); ++type) {
if (!strcmp(input, TypeNames[type])) return type;
}
errx(EX_USAGE, "no such type %s", input);
}
static const struct {
const char *name;
Format *fn;
} Formats[] = {
{ "plain", formatPlain },
{ "color", formatColor },
{ "irc", formatIRC },
};
static Format *parseFormat(const char *name) {
for (size_t i = 0; i < ARRAY_LEN(Formats); ++i) {
if (!strcmp(name, Formats[i].name)) return Formats[i].fn;
}
errx(EX_USAGE, "no such format %s", name);
}
static struct Bind {
const char *param;
const char *text;
int value;
} Bind(const char *param, const char *text, int value) {
return (struct Bind) { param, text, value };
}
int main(int argc, char *argv[]) {
bool tty = isatty(STDOUT_FILENO);
char *path = NULL;
bool shell = false;
bool group = false;
Format *format = (tty ? formatColor : formatPlain);
int n = 0;
struct Bind binds[argc];
const char *search = NULL;
const char *where = NULL;
int opt;
while (0 < (opt = getopt(argc, argv, "D:F:N:T:a:b:c:d:f:gh:l:n:pqst:u:vw:"))) {
switch (opt) {
break; case 'D': binds[n++] = Bind(":date", optarg, 0);
break; case 'F': binds[n++] = Bind(":format", optarg, 0);
break; case 'N': binds[n++] = Bind(":network", optarg, 0);
break; case 'T': binds[n++] = Bind(":target", optarg, 0);
break; case 'a': binds[n++] = Bind(":after", optarg, 0);
break; case 'b': binds[n++] = Bind(":before", optarg, 0);
break; case 'c': binds[n++] = Bind(":context", optarg, 0);
break; case 'd': path = optarg;
break; case 'f': format = parseFormat(optarg);
break; case 'g': group = true;
break; case 'h': binds[n++] = Bind(":host", optarg, 0);
break; case 'l': binds[n++] = Bind(":limit", optarg, 0);
break; case 'n': binds[n++] = Bind(":nick", optarg, 0);
break; case 'p': binds[n++] = Bind(":query", NULL, 0);
break; case 'q': binds[n++] = Bind(":query", NULL, 1);
break; case 's': shell = true;
break; case 't': binds[n++] = Bind(":type", NULL, parseType(optarg));
break; case 'u': binds[n++] = Bind(":user", optarg, 0);
break; case 'v': verbose = true;
break; case 'w': where = optarg;
break; default: return EX_USAGE;
}
}
if (optind < argc) search = argv[optind];
if (shell) {
dbFind(path, SQLITE_OPEN_READONLY);
path = strdup(sqlite3_db_filename(db, "main"));
if (!path) err(EX_OSERR, "strdup");
dbClose();
execlp("sqlite3", "sqlite3", path, NULL);
err(EX_UNAVAILABLE, "sqlite3");
}
if (tty) {
const char *pager = getenv("PAGER");
if (!pager) pager = "less";
setenv("LESS", "FRX", 0);
int rw[2];
int error = pipe(rw);
if (error) err(EX_OSERR, "pipe");
pid_t pid = fork();
if (pid < 0) err(EX_OSERR, "fork");
if (!pid) {
dup2(rw[0], STDIN_FILENO);
close(rw[0]);
close(rw[1]);
execlp(pager, pager, NULL);
err(EX_CONFIG, "%s", pager);
}
dup2(rw[1], STDOUT_FILENO);
close(rw[0]);
close(rw[1]);
}
dbFind(path, SQLITE_OPEN_READONLY);
if (dbVersion() != DatabaseVersion) {
errx(EX_CONFIG, "database out of date; migrate with litterbox -m");
}
char sql[4096];
if (search) {
snprintf(
sql, sizeof(sql),
"WITH results AS (%s AND %s AND %s %s) %s;",
Inner, Search, (where ? where : "true"), Limit,
(group ? Group : Outer)
);
binds[n++] = Bind(":search", search, 0);
} else {
snprintf(
sql, sizeof(sql),
"WITH results AS (%s AND %s %s) %s;",
Inner, (where ? where : "true"), Limit, (group ? Group : Outer)
);
}
sqlite3_stmt *stmt = dbPrepare(sql);
for (int i = 0; i < n; ++i) {
if (binds[i].text) {
dbBindText(stmt, binds[i].param, binds[i].text);
} else {
dbBindInt(stmt, binds[i].param, binds[i].value);
}
}
if (format == formatColor) {
dbBindText(stmt, ":open", "\33[7m");
dbBindText(stmt, ":close", "\33[27m");
} else {
// XXX: If you leave these NULL fts5 segfaults...
dbBindText(stmt, ":open", "");
dbBindText(stmt, ":close", "");
}
if (verbose) {
char *expand = sqlite3_expanded_sql(stmt);
if (!expand) errx(EX_SOFTWARE, "sqlite3_expanded_sql");
fprintf(stderr, "%s\n", expand);
sqlite3_free(expand);
}
int result;
while (SQLITE_ROW == (result = sqlite3_step(stmt))) {
struct Event event = {
.network = (const char *)sqlite3_column_text(stmt, 0),
.context = (const char *)sqlite3_column_text(stmt, 1),
.time = (const char *)sqlite3_column_text(stmt, 2),
.type = sqlite3_column_int(stmt, 3),
.nick = (const char *)sqlite3_column_text(stmt, 4),
.user = (const char *)sqlite3_column_text(stmt, 5),
.host = (const char *)sqlite3_column_text(stmt, 6),
.target = (const char *)sqlite3_column_text(stmt, 7),
.message = (const char *)sqlite3_column_text(stmt, 8),
};
if (!event.target) event.target = "";
if (!event.message) event.message = "";
format(group, event);
}
if (result != SQLITE_DONE) warnx("%s", sqlite3_errmsg(db));
sqlite3_finalize(stmt);
dbClose();
if (tty) {
fclose(stdout);
int status;
wait(&status);
}
}
|