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
|
/* Copyright (C) 2020 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 <inttypes.h>
#include <limits.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <sys/stat.h>
#include <sysexits.h>
#include "archive.h"
#include "imap.h"
static uint32_t threadRoot(struct List thread) {
if (!thread.len) errx(EX_PROTOCOL, "empty thread");
while (thread.ptr[0].type == List) {
thread = thread.ptr[0].list;
if (!thread.len) errx(EX_PROTOCOL, "empty subthread");
}
return dataCheck(thread.ptr[0], Number).number;
}
static struct List threadFind(struct List threads, uint32_t root) {
for (size_t i = 0; i < threads.len; ++i) {
struct List thread = dataCheck(threads.ptr[i], List).list;
if (threadRoot(thread) == root) return thread;
}
errx(EX_TEMPFAIL, "no thread with root UID %" PRIu32, root);
}
void concatFetch(FILE *imap, enum Atom tag, struct List threads) {
fprintf(imap, "%s UID FETCH ", Atoms[tag]);
for (size_t i = 0; i < threads.len; ++i) {
uint32_t root = threadRoot(dataCheck(threads.ptr[i], List).list);
fprintf(imap, "%s%" PRIu32, (i ? "," : ""), root);
}
fprintf(imap, " (UID ENVELOPE)\r\n");
}
static time_t uidNewest(struct List uids, const char *type) {
time_t newest = 0;
for (size_t i = 0; i < uids.len; ++i) {
const char *path = pathUID(dataCheck(uids.ptr[i], Number).number, type);
struct stat status;
int error = stat(path, &status);
if (error) err(EX_DATAERR, "%s", path);
if (status.st_mtime > newest) newest = status.st_mtime;
}
return newest;
}
static int concatFile(FILE *dst, const char *path) {
char buf[4096];
FILE *src = fopen(path, "r");
if (!src) err(EX_DATAERR, "%s", path);
for (size_t len; (len = fread(buf, 1, sizeof(buf), src));) {
size_t n = fwrite(buf, len, 1, dst);
if (!n) return -1;
}
fclose(src);
return 0;
}
static int concatHTML(FILE *file, struct List thread) {
int error;
for (size_t i = 0; i < thread.len; ++i) {
if (thread.ptr[i].type == List) {
error = 0
|| htmlSubthreadOpen(file, thread.ptr[i].list)
|| concatHTML(file, thread.ptr[i].list)
|| htmlSubthreadClose(file);
} else {
uint32_t uid = dataCheck(thread.ptr[i], Number).number;
error = concatFile(file, pathUID(uid, "html"));
}
if (error) return error;
}
return 0;
}
const char *concatHead;
void concatData(struct List threads, struct List items) {
uint32_t uid = 0;
struct Envelope envelope = {0};
for (size_t i = 0; i + 1 < items.len; i += 2) {
enum Atom name = dataCheck(items.ptr[i], Atom).atom;
struct Data data = items.ptr[i + 1];
switch (name) {
break; case AtomUID:
uid = dataCheck(data, Number).number;
break; case AtomEnvelope:
parseEnvelope(&envelope, dataCheck(data, List).list);
break; default:;
}
}
if (!uid) errx(EX_PROTOCOL, "missing UID data item");
if (!envelope.subject) errx(EX_PROTOCOL, "missing ENVELOPE data item");
struct List thread = threadFind(threads, uid);
struct List flat = {0};
listFlatten(&flat, thread);
int error;
FILE *file;
const char *path;
struct stat status;
path = pathThread(envelope.messageID, "mbox");
error = stat(path, &status);
if (error || status.st_mtime < uidNewest(flat, "mbox")) {
file = fopen(path, "w");
if (!file) err(EX_CANTCREAT, "%s", path);
for (size_t i = 0; i < flat.len; ++i) {
uint32_t uid = dataCheck(flat.ptr[i], Number).number;
error = concatFile(file, pathUID(uid, "mbox"));
if (error) err(EX_IOERR, "%s", path);
}
error = fclose(file);
if (error) err(EX_IOERR, "%s", path);
}
path = pathThread(envelope.messageID, "atom");
error = stat(path, &status);
if (error || status.st_mtime < uidNewest(flat, "atom")) {
FILE *file = fopen(path, "w");
if (!file) err(EX_CANTCREAT, "%s", path);
error = atomFeedOpen(file, &envelope);
if (error) err(EX_IOERR, "%s", path);
for (size_t i = 0; i < flat.len; ++i) {
uint32_t uid = dataCheck(flat.ptr[i], Number).number;
error = concatFile(file, pathUID(uid, "atom"));
if (error) err(EX_IOERR, "%s", path);
}
error = atomFeedClose(file) || fclose(file);
if (error) err(EX_IOERR, "%s", path);
}
path = pathThread(envelope.messageID, "html");
error = stat(path, &status);
if (error || status.st_mtime < uidNewest(flat, "html")) {
FILE *file = fopen(path, "w");
if (!file) err(EX_CANTCREAT, "%s", path);
error = htmlThreadHead(file, &envelope);
if (error) err(EX_IOERR, "%s", path);
if (concatHead) {
error = concatFile(file, concatHead);
if (error) err(EX_IOERR, "%s", path);
}
error = 0
|| htmlThreadOpen(file, &envelope)
|| concatHTML(file, thread)
|| htmlThreadClose(file)
|| fclose(file);
if (error) err(EX_IOERR, "%s", path);
}
listFree(flat);
}
|