static
void do_free(struct pkgdir *pkgdir)
{
if (pkgdir->mod_data) {
struct idx *idx = pkgdir->mod_data;
idx_close(idx);
free(idx);
pkgdir->mod_data = NULL;
}
}
static
int do_open(struct pkgdir *pkgdir, unsigned flags)
{
struct vfile *vf;
char linebuf[PATH_MAX];
int nline, nerr = 0, nread, n;
struct pkgroup_idx *pkgroups = NULL;
struct idx idx;
unsigned vfmode = VFM_RO | VFM_CACHE | VFM_NOEMPTY;
char *path = pkgdir->path;
flags = flags; /* unused */
DBGF("idxpath %s\n", pkgdir->idxpath);
if (!idx_open(&idx, pkgdir->idxpath, vfmode, pkgdir->name))
return 0;
vf = idx.vf;
nline = 0;
nerr = 0;
while ((nread = n_stream_gets(vf->vf_tnstream, linebuf, sizeof(linebuf))) > 0) {
char *p, *q, *nvr, *fn, *ep, nevr[512];
const char *name, *ver, *rel;
int fn_len;
struct yum_entry *en;
int32_t epoch, dummy;
while (nread > 0 && isspace(linebuf[nread - 1]))
linebuf[--nread] = '\0';
p = linebuf;
nline++;
if (nread < 2 || !isdigit(*p) || (q = strchr(p, ':')) == NULL) {
logn(LOGERR, _("%s:%d syntax error"),
vf->vf_tmpath ? vf->vf_tmpath : path, nline);
continue;
}
ep = p;
*q = '\0';
q++;
nvr = q;
if ((q = strchr(q, '=')) == NULL) {
logn(LOGERR, _("%s:%d syntax error"),
vf->vf_tmpath ? vf->vf_tmpath : path, nline);
continue;
}
*q = '\0';
fn = q + 1;
epoch = (int32_t)strtol(ep, (char **)NULL, 10);
//printf("nvr = %s, fn = %s, %d\n", nvr, fn, nread);
if (!poldek_util_parse_nevr(nvr, &name, &dummy, &ver, &rel)) {
logn(LOGERR, _("%s:%d syntax error"),
vf->vf_tmpath ? vf->vf_tmpath : path, nline);
continue;
}
fn_len = strlen(fn);
n = n_snprintf(nevr, sizeof(nevr), "%s-%d-%s-%s", name, epoch, ver, rel);
en = n_malloc(sizeof(*en) + n + 1 + fn_len + 1);
n += 1;
memcpy(en->nvr, nevr, n);
memcpy(&en->nvr[n], fn, fn_len + 1);
en->fn = &en->nvr[n];
DBGF("en.nevr = %s, en.fn = %s, %s\n", en->nvr, en->fn, fn);
n_array_push(idx.ents, en);
//for testing if (n_array_size(idx.ents) > 60) break;
}
n_array_sort(idx.ents);
pkgdir->mod_data = n_malloc(sizeof(idx));
memcpy(pkgdir->mod_data, &idx, sizeof(idx));
pkgdir->pkgroups = pkgroups;
pkgdir->ts = poldek_util_mtime(vfile_localpath(idx.vf));
DBGF("%d entries\n", n_array_size(idx.ents));
if (nerr)
idx_close(&idx);
return nerr == 0;
}
int html_month_index(const char *list, unsigned int y, unsigned int m)
{
unsigned int d, n, aday, dp;
int fd;
idx_msgnum_t mn[32], mp, count, total;
struct buffer dst;
int first; /* first message of this month */
off_t size, size_n;
struct idx_message *msgp = NULL, *msg = NULL;
int prev = 0, next = 0;
if (y < MIN_YEAR || y > MAX_YEAR ||
m < 1 || m > 12)
return html_error("Invalid date");
aday = ((y - MIN_YEAR) * 12 + (m - 1)) * 31;
fd = idx_open(list);
if (fd < 0)
return html_error(errno == ENOENT ?
"No such mailing list" : NULL);
if (!idx_read_aday_ok(fd, aday, mn, sizeof(mn))) {
idx_close(fd);
return html_error("Index error");
}
/* quickly calculate how many messages we have in this month */
total = 0;
first = 0;
mp = mn[0];
for (d = 1; d <= 31; d++) {
if (!mn[d])
continue;
if (mp > 0) {
/* Remember index of first message */
if (first == 0)
first = mp;
count = (mn[d] > 0) ? mn[d] - mp : -mn[d];
if (count <= 0) {
buffer_free(&dst);
idx_close(fd);
return html_error(NULL);
}
total += count;
}
mp = mn[d];
}
/* have messages, allocate and read them */
if (total && first) {
off_t got;
off_t idx_offset;
first--;
size = total * sizeof(struct idx_message);
idx_offset = IDX2MSG(first);
/* we need to read prev and next messages too */
if (first) {
size += sizeof(struct idx_message);
idx_offset -= sizeof(struct idx_message);
prev = 1;
}
size_n = size + sizeof(struct idx_message);
if (!(msgp = malloc(size_n)) ||
(got = idx_read(fd, idx_offset, msgp, size_n)) == -1 ||
(got != size && got != size_n)) {
idx_close(fd);
free(msgp);
return html_error("Index error");
}
msg = msgp + prev;
next = (got == size_n) ? total + prev : 0;
}
if (idx_close(fd) || buffer_init(&dst, 0)) {
free(msgp);
return html_error(NULL);
}
buffer_appends(&dst, "\n");
if (html_flags & HTML_HEADER) {
buffer_appends(&dst, "<title>");
buffer_appends_html(&dst, list);
buffer_appendf(&dst, " mailing list - %u/%02u</title>\n", y, m);
}
if (html_flags & HTML_BODY) {
if (prev) {
buffer_appends(&dst, "<a href=\"");
buffer_appendf(&dst, "../../%u/%02u/\">[<prev month]</a> ",
MIN_YEAR + msgp[0].y, msgp[0].m);
}
if (next) {
buffer_appends(&dst, "<a href=\"");
buffer_appendf(&dst, "../../%u/%02u/\">[next month>]</a> ",
MIN_YEAR + msgp[next].y, msgp[next].m);
}
buffer_appends(&dst,
"<a href=\"..\">[year]</a>"
" <a href=\"../..\">[list]</a>\n");
buffer_appends(&dst, "<p><h2>");
buffer_appends_html(&dst, list);
buffer_appendf(&dst, " mailing list - %u/%02u</h2>\n", y, m);
if (!total || !msg) {
buffer_free(&dst);
free(msgp);
return html_error("No messages for this month");
}
html_output_month_cal(&dst, mn, y, m, L_DAILY);
total = 0;
dp = 0;
mp = mn[0];
for (d = 1; d <= 31; d++) {
if (!mn[d])
continue;
if (mp > 0) {
if (mn[d] > 0)
count = mn[d] - mp;
else
count = -mn[d];
if (count <= 0) {
buffer_free(&dst);
free(msgp);
return html_error(NULL);
}
if (!total)
buffer_appends(&dst, "<p>Messages by day:\n<p>\n");
total += count;
buffer_appendf(&dst, "<b>%s %u</b> "
"(<a href=\"%02u/\">%u message%s</a>)<br>\n"
"<ul>\n",
month_name[m - 1], dp + 1,
dp + 1, count, count == 1 ? "" : "s");
int maxn = count;
if (count >= MAX_SHORT_MSG_LIST)
maxn = MAX_SHORT_MSG_LIST;
if (count > MAX_SHORT_MSG_LIST)
maxn--;
for (n = 1; n <= maxn; n++) {
buffer_appendf(&dst, "<li><a href=\"%02u/%u\">", dp + 1, n);
output_strings(&dst, msg++, 1);
buffer_appends(&dst, "\n");
}
msg += count - maxn;
if (count > MAX_SHORT_MSG_LIST)
buffer_appendf(&dst, "<li><a href=\"%02u/\">%u more messages</a>\n", d, count - maxn);
buffer_appends(&dst, "</ul>\n");
}
mp = mn[d];
dp = d;
}
if (total)
buffer_appendf(&dst, "<p>%u message%s\n", total, total == 1 ? "" : "s");
else
buffer_appends(&dst, "<p>No messages\n");
}
free(msgp);
return html_send(&dst);
}
int html_day_index(const char *list, unsigned int y, unsigned int m, unsigned int d)
{
unsigned int aday;
off_t idx_offset;
off_t size, size_n;
int fd, error, got;
idx_msgnum_t mx[2]; /* today, next day */
struct buffer dst;
struct idx_message *mp;
int prev; /* have prev message = 1 */
int count; /* how many messages in this month */
int next; /* flag & index to next message */
if (y < MIN_YEAR || y > MAX_YEAR ||
m < 1 || m > 12 ||
d < 1 || d > 31)
return html_error("Invalid date");
aday = YMD2ADAY(y - MIN_YEAR, m, d);
fd = idx_open(list);
if (fd < 0)
return html_error(errno == ENOENT ?
"No such mailing list" : NULL);
/* read two consecutive aday entries
* will need them to determine message count for this day */
error = !idx_read_aday_ok(fd, aday, &mx, sizeof(mx));
if (error || mx[0] < 1 || mx[0] >= MAX_MAILBOX_MESSAGES) {
idx_close(fd);
return html_error((error || mx[0] > 0) ? NULL : "No messages"
" for this day");
}
if (mx[1] > 0)
count = mx[1] - mx[0];
else
count = -mx[1];
size = count * sizeof(struct idx_message);
idx_offset = IDX2MSG(mx[0] - 1);
if (mx[0] > 1) {
/* read one more entry for Prev day quick link */
size += sizeof(struct idx_message);
idx_offset -= sizeof(struct idx_message);
prev = 1;
} else {
prev = 0;
}
/* read one more entry for Next day quick link */
size_n = size + sizeof(struct idx_message);
if (!(mp = malloc(size_n)) ||
(got = idx_read(fd, idx_offset, mp, size_n)) == -1 ||
(got != size && got != size_n)) {
idx_close(fd);
free(mp);
return html_error("Index error");
}
next = (got == size_n) ? count + prev : 0;
if (idx_close(fd) || error || buffer_init(&dst, 0)) {
free(mp);
return html_error(NULL);
}
buffer_appends(&dst, "\n");
if (html_flags & HTML_HEADER) {
buffer_appends(&dst, "<title>");
buffer_appends_html(&dst, list);
buffer_appendf(&dst, " mailing list - %u/%02u/%02u</title>\n", y, m, d);
}
if (html_flags & HTML_BODY) {
int i;
if (prev) {
buffer_appends(&dst, "<a href=\"");
buffer_appendf(&dst, "../../../%u/%02u/%02u/\">[<prev day]</a> ",
MIN_YEAR + mp[0].y, mp[0].m, mp[0].d);
}
if (next) {
buffer_appends(&dst, "<a href=\"");
buffer_appendf(&dst, "../../../%u/%02u/%02u/\">[next day>]</a> ",
MIN_YEAR + mp[next].y, mp[next].m, mp[next].d);
}
buffer_appends(&dst,
"<a href=\"..\">[month]</a>"
" <a href=\"../..\">[year]</a>"
" <a href=\"../../..\">[list]</a>\n");
buffer_appends(&dst, "<p><h2>");
buffer_appends_html(&dst, list);
buffer_appendf(&dst, " mailing list - %u/%02u/%02u</h2>\n", y, m, d);
if (count)
buffer_appends(&dst, "<ul>\n");
for (i = 0; i < count; i++) {
struct idx_message *msg = mp + i + prev;
buffer_appendf(&dst, "<li><a href=\"%u\">", i + 1);
output_strings(&dst, msg, 1);
buffer_appends(&dst, "\n");
}
if (count)
buffer_appends(&dst, "</ul>\n");
buffer_appendf(&dst, "<p>%u message%s\n", count, count == 1 ? "" : "s");
}
free(mp);
return html_send(&dst);
}
int html_attachment(const char *list, unsigned int y, unsigned int m, unsigned int d, unsigned int n, unsigned int a)
{
unsigned int aday;
char *list_file;
off_t idx_offset;
int fd, error, got, trunc;
idx_msgnum_t m1, m1r;
struct idx_message idx_msg;
idx_off_t offset;
idx_size_t size;
struct buffer src, dst;
struct mime_ctx mime;
char *body, *bend;
if (y < MIN_YEAR || y > MAX_YEAR ||
m < 1 || m > 12 ||
d < 1 || d > 31 ||
n < 1 || n > 999999)
return html_error("Invalid date or message number");
aday = YMD2ADAY(y - MIN_YEAR, m, d);
list_file = concat(MAIL_SPOOL_PATH "/", list, NULL);
if (!list_file)
return html_error(NULL);
fd = idx_open(list);
if (fd < 0) {
error = errno;
free(list_file);
return html_error(error == ENOENT ?
"No such mailing list" : (error == ESRCH ?
"Index needs rebuild" : NULL));
}
error = !idx_read_aday_ok(fd, aday, &m1, sizeof(m1));
if (error || m1 < 1 || m1 >= MAX_MAILBOX_MESSAGES) {
idx_close(fd);
free(list_file);
return html_error((error || m1 > 0) ? NULL : "No such message");
}
m1r = m1 + n - 2; /* both m1 and n are 1-based; m1r is 0-based */
idx_offset = IDX2MSG(m1r);
got = idx_read(fd, idx_offset, &idx_msg, sizeof(idx_msg));
if (got != sizeof(idx_msg))
error = 1;
if (idx_close(fd) || error) {
free(list_file);
return html_error(got ? NULL : "No such message");
}
if (y - MIN_YEAR != idx_msg.y ||
m != idx_msg.m ||
d != idx_msg.d) {
free(list_file);
return html_error("No such message");
}
offset = idx_msg.offset;
size = idx_msg.size;
trunc = size > MAX_MESSAGE_SIZE;
if (trunc)
size = MAX_MESSAGE_SIZE;
if (buffer_init(&src, size)) {
free(list_file);
return html_error(NULL);
}
fd = open(list_file, O_RDONLY);
free(list_file);
if (fd < 0) {
buffer_free(&src);
return html_error("mbox open error");
}
error =
lseek(fd, offset, SEEK_SET) != offset ||
read_loop(fd, src.start, size) != size;
if (close(fd) || error || mime_init(&mime, &src)) {
buffer_free(&src);
return html_error("mbox read error");
}
if (buffer_init(&dst, size)) {
buffer_free(&src);
mime_free(&mime);
return html_error(NULL);
}
body = NULL;
while (src.end - src.ptr > 9 && *src.ptr != '\n') {
switch (*src.ptr) {
case 'C':
case 'c':
mime_decode_header(&mime);
continue;
}
mime_skip_header(&mime);
}
if (src.ptr >= src.end) {
buffer_free(&src);
buffer_free(&dst);
mime_free(&mime);
return html_error(NULL);
}
if (*src.ptr == '\n')
body = ++src.ptr;
const char *error_msg = "Attachment not found";
unsigned int attachment_count = 0;
if (a)
do {
if (mime.entities->boundary) {
body = mime_next_body_part(&mime);
if (!body || body >= src.end)
break;
body = mime_next_body(&mime);
}
if (mime.entities->boundary || !is_attachment(&mime) || ++attachment_count != a)
body = NULL;
if (!body) {
bend = mime_skip_body(&mime);
if (!bend)
break;
continue;
}
int text = !strncasecmp(mime.entities->type, "text/", 5);
if (text) {
buffer_appends(&dst, "Content-Type: text/plain");
if (mime.entities->charset && enc_allowed_charset(mime.entities->charset))
buffer_appendf(&dst, "; charset=%s", mime.entities->charset);
buffer_appendc(&dst, '\n');
} else {
buffer_appends(&dst, "Content-Type: application/octet-stream\n");
}
buffer_appendf(&dst, "Content-Disposition: %s; filename=\"", text ? "inline" : "attachment");
buffer_append_filename(&dst, mime.entities->filename, text);
buffer_appends(&dst, "\"\n");
body = mime_decode_body(&mime, RECODE_NO, &bend);
if (trunc && (!body || bend >= src.end)) {
error_msg = "Attachment is truncated";
break;
}
buffer_appendf(&dst, "Content-Length: %llu\n\n", (unsigned long long)(mime.dst.ptr - body));
buffer_append(&dst, body, mime.dst.ptr - body);
error_msg = NULL;
break;
} while (bend < src.end && mime.entities);
buffer_free(&src);
if (error_msg || mime.dst.error || dst.error) {
mime_free(&mime);
buffer_free(&dst);
return html_error(error_msg);
}
mime_free(&mime);
return html_send(&dst);
}
int html_message(const char *list, unsigned int y, unsigned int m, unsigned int d, unsigned int n)
{
unsigned int aday, n0, n2;
char *list_file;
off_t idx_offset;
int fd, error, got, trunc, prev, next;
idx_msgnum_t m0, m1, m1r;
struct idx_message idx_msg[3];
idx_off_t offset;
idx_size_t size;
struct buffer src, dst;
struct mime_ctx mime;
char *p, *q, *date, *from, *to, *cc, *subject, *body, *bend;
if (y < MIN_YEAR || y > MAX_YEAR ||
m < 1 || m > 12 ||
d < 1 || d > 31 ||
n < 1 || n > 999999)
return html_error("Invalid date or message number");
aday = YMD2ADAY(y - MIN_YEAR, m, d);
list_file = concat(MAIL_SPOOL_PATH "/", list, NULL);
if (!list_file)
return html_error(NULL);
fd = idx_open(list);
if (fd < 0) {
error = errno;
free(list_file);
return html_error(error == ENOENT ?
"No such mailing list" : (error == ESRCH ?
"Index needs rebuild" : NULL));
}
error = !idx_read_aday_ok(fd, aday, &m1, sizeof(m1));
if (error || m1 < 1 || m1 >= MAX_MAILBOX_MESSAGES) {
idx_close(fd);
free(list_file);
return html_error((error || m1 > 0) ? NULL : "No such message");
}
m1r = m1 + n - (1 + 1); /* both m1 and n are 1-based; m1r is 0-based */
idx_offset = IDX2MSG(m1r);
prev = next = 1;
if (m1r >= 1) {
idx_offset -= sizeof(idx_msg[0]);
got = idx_read(fd, idx_offset, &idx_msg, sizeof(idx_msg));
if (got != sizeof(idx_msg)) {
error = got != sizeof(idx_msg[0]) * 2;
idx_msg[2] = idx_msg[1];
next = 0;
}
} else {
prev = 0;
got = idx_read(fd, idx_offset, &idx_msg[1], sizeof(idx_msg[1]) * 2);
if (got != sizeof(idx_msg[1]) * 2) {
error = got != sizeof(idx_msg[1]);
idx_msg[2] = idx_msg[1];
next = 0;
}
idx_msg[0] = idx_msg[1];
}
n0 = n - 1;
if (!n0 && prev && !error) {
aday = YMD2ADAY(idx_msg[0].y, idx_msg[0].m, idx_msg[0].d);
error = !idx_read_aday_ok(fd, aday, &m0, sizeof(m0));
if (m1 > m0)
n0 = m1 - m0;
else
error = 1;
}
if (idx_close(fd) || error) {
free(list_file);
return html_error(got ? NULL : "No such message");
}
n2 = n + 1;
if (idx_msg[2].y != idx_msg[1].y ||
idx_msg[2].m != m || idx_msg[2].d != d)
n2 = 1;
if (y - MIN_YEAR != idx_msg[1].y ||
m != idx_msg[1].m || d != idx_msg[1].d) {
free(list_file);
return html_error("No such message");
}
offset = idx_msg[1].offset;
size = idx_msg[1].size;
trunc = size > MAX_MESSAGE_SIZE;
if (trunc)
size = MAX_MESSAGE_SIZE;
if (buffer_init(&src, size)) {
free(list_file);
return html_error(NULL);
}
fd = open(list_file, O_RDONLY);
free(list_file);
if (fd < 0) {
buffer_free(&src);
return html_error("mbox open error");
}
error =
lseek(fd, offset, SEEK_SET) != offset ||
read_loop(fd, src.start, size) != size;
if (close(fd) || error || mime_init(&mime, &src)) {
buffer_free(&src);
return html_error("mbox read error");
}
if (buffer_init(&dst, size)) {
buffer_free(&src);
mime_free(&mime);
return html_error(NULL);
}
date = from = to = cc = subject = body = NULL;
while (src.end - src.ptr > 9 && *src.ptr != '\n') {
switch (*src.ptr) {
case 'D':
case 'd':
if (!strncasecmp(src.ptr, "Date:", 5)) {
date = mime_decode_header(&mime);
continue;
}
break;
case 'F':
case 'f':
if (!strncasecmp(src.ptr, "From:", 5)) {
from = mime_decode_header(&mime);
continue;
}
break;
case 'T':
case 't':
if (!strncasecmp(src.ptr, "To:", 3)) {
to = mime_decode_header(&mime);
continue;
}
break;
case 'S':
case 's':
if (!strncasecmp(src.ptr, "Subject:", 8)) {
subject = mime_decode_header(&mime);
continue;
}
break;
case 'C':
case 'c':
if (!strncasecmp(src.ptr, "CC:", 3))
cc = mime_decode_header(&mime);
else
mime_decode_header(&mime);
continue;
}
mime_skip_header(&mime);
}
if (src.ptr >= src.end) {
buffer_free(&src);
buffer_free(&dst);
mime_free(&mime);
return html_error(NULL);
}
if (*src.ptr == '\n')
body = ++src.ptr;
if ((p = subject)) {
while ((p = strchr(p, '['))) {
if (strncasecmp(++p, list, strlen(list)))
continue;
q = p + strlen(list);
if (*q != ']')
continue;
if (*++q == ' ') q++;
memmove(--p, q, strlen(q) + 1);
}
}
buffer_appends(&dst, "\n");
if (html_flags & HTML_HEADER) {
buffer_appends(&dst, "<title>");
buffer_appends_html(&dst, list);
if (subject && strlen(subject) > 9) {
buffer_appends(&dst, " - ");
buffer_appends_html(&dst, subject + 9);
}
buffer_appends(&dst, "</title>\n");
if (html_flags & HTML_CENSOR)
buffer_appends(&dst, "<meta name=\"robots\" content=\"noindex\">\n");
}
if (html_flags & HTML_BODY) {
unsigned int attachment_count = 0;
if (prev) {
buffer_appends(&dst, "<a href=\"");
if (n == 1)
buffer_appendf(&dst, "../../../%u/%02u/%02u/",
MIN_YEAR + idx_msg[0].y, idx_msg[0].m, idx_msg[0].d);
buffer_appendf(&dst, "%u\">[<prev]</a> ", n0);
}
if (next) {
buffer_appends(&dst, "<a href=\"");
if (n2 == 1)
buffer_appendf(&dst, "../../../%u/%02u/%02u/",
MIN_YEAR + idx_msg[2].y, idx_msg[2].m, idx_msg[2].d);
buffer_appendf(&dst, "%u\">[next>]</a> ", n2);
}
if (idx_msg[1].t.pn) {
buffer_appends(&dst, "<a href=\"");
if (idx_msg[1].t.py != idx_msg[1].y ||
idx_msg[1].t.pm != idx_msg[1].m ||
idx_msg[1].t.pd != idx_msg[1].d)
buffer_appendf(&dst, "../../../%u/%02u/%02u/",
MIN_YEAR + idx_msg[1].t.py, idx_msg[1].t.pm, idx_msg[1].t.pd);
buffer_appendf(&dst, "%u\">[<thread-prev]</a> ", idx_msg[1].t.pn);
}
if (idx_msg[1].t.nn) {
buffer_appends(&dst, "<a href=\"");
if (idx_msg[1].t.ny != idx_msg[1].y ||
idx_msg[1].t.nm != idx_msg[1].m ||
idx_msg[1].t.nd != idx_msg[1].d)
buffer_appendf(&dst, "../../../%u/%02u/%02u/",
MIN_YEAR + idx_msg[1].t.ny, idx_msg[1].t.nm, idx_msg[1].t.nd);
buffer_appendf(&dst, "%u\">[thread-next>]</a> ", idx_msg[1].t.nn);
}
buffer_appends(&dst,
"<a href=\".\">[day]</a>"
" <a href=\"..\">[month]</a>"
" <a href=\"../..\">[year]</a>"
" <a href=\"../../..\">[list]</a>\n");
buffer_appends(&dst, "<pre style=\"white-space: pre-wrap\">\n");
if (date)
buffer_append_header(&dst, date);
if (from)
buffer_append_header(&dst, from);
if (to)
buffer_append_header(&dst, to);
if (cc)
buffer_append_header(&dst, cc);
if (subject)
buffer_append_header(&dst, subject);
if (!(html_flags & HTML_CENSOR))
do {
if (mime.entities->boundary) {
body = mime_next_body_part(&mime);
if (!body || body >= src.end)
break;
body = mime_next_body(&mime);
}
if (mime.entities->boundary)
body = NULL;
if (!body) {
bend = mime_skip_body(&mime);
if (!bend)
break;
continue;
}
/* mime_decode_body() will break mime vars, so,
* remember them now */
char *filename = mime.entities->filename;
char *type = mime.entities->type;
const int isattachment = is_attachment(&mime);
const int isinline = is_inline(&mime);
int skip = 0;
body = mime_decode_body(&mime, isattachment ? RECODE_NO : RECODE_YES, &bend);
if (!body)
break;
if (bend >= src.end)
skip = trunc;
bend = src.ptr;
if (!skip && isattachment) {
int text = !strncasecmp(type, "text/", 5);
attachment_count++;
buffer_appendf(&dst, "\n<span style=\"font-family: times;\"><strong>"
"%s attachment \"</strong><a href=\"%u/%u\"%s>",
text ? "View" : "Download", n, attachment_count,
text ? "" : " rel=\"nofollow\" download");
if (filename)
buffer_appends_html(&dst, filename);
buffer_appends(&dst, "</a><strong>\" of type \"</strong>");
buffer_appends_html(&dst, type);
buffer_appends(&dst, "<strong>\"");
if (body)
buffer_appendf(&dst, " (%llu bytes)", (unsigned long long)(mime.dst.ptr - body));
buffer_appends(&dst, "</strong></span>\n");
continue;
} else if (!isinline) {
skip = 1;
} else {
skip = 0; /* do not skip non-attachments */
}
if (skip) {
buffer_appends(&dst, "\n<span style=\"font-family: times;\"><strong>"
"Content of type \"</strong>");
buffer_appends_html(&dst, type);
buffer_appends(&dst, "<strong>\" skipped</strong></span>\n");
continue;
}
/* inline */
buffer_appendc(&dst, '\n');
buffer_append_html_generic(&dst, body, mime.dst.ptr - body, 0, 1);
mime.dst.ptr = body;
} while (bend < src.end && mime.entities);
if ((html_flags & HTML_CENSOR) || trunc)
buffer_appendf(&dst, "\n<span style=\"font-family: times;\"><strong>"
"Content %s</strong></span>\n", (html_flags & HTML_CENSOR) ? "removed" : "truncated");
buffer_appends(&dst, "</pre>\n");
}
buffer_free(&src);
if (mime.dst.error || dst.error) {
mime_free(&mime);
buffer_free(&dst);
return html_error(NULL);
}
mime_free(&mime);
return html_send(&dst);
}
int html_year_index(const char *list, unsigned int y)
{
unsigned int min_y, max_y, m, d, aday, rday;
int fd;
idx_msgnum_t *mn, count;
size_t mn_size;
struct buffer dst;
aday = 0;
mn_size = (N_ADAY + 1) * sizeof(idx_msgnum_t);
min_y = MIN_YEAR;
max_y = MAX_YEAR;
if (y) {
if (y < min_y || y > max_y)
return html_error("Invalid date");
aday = (y - min_y) * (12 * 31);
mn_size = (12 * 31 + 1) * sizeof(idx_msgnum_t);
min_y = max_y = y;
}
fd = idx_open(list);
if (fd < 0)
return html_error(errno == ENOENT ? "No such mailing list" : NULL);
if (!(mn = malloc(mn_size)) ||
!idx_read_aday_ok(fd, aday, mn, mn_size)) {
idx_close(fd);
free(mn);
return html_error(NULL);
}
/* find first and next index for Prev and Next year links */
int first = 0;
int lastn = 0;
rday = YMD2ADAY(min_y - MIN_YEAR, 1, 1) - aday;
unsigned int eday = YMD2ADAY(max_y - MIN_YEAR + 1, 1, 1) - aday;
int sanity = 0;
for (; rday < eday; rday++) {
if (mn[rday] > 0) {
if (!first)
first = mn[rday];
if (mn[rday + 1] <= 0)
lastn = mn[rday] + -mn[rday + 1];
else
lastn = mn[rday + 1];
/* sanity check of index */
if (lastn <= mn[rday] ||
((mn[rday] != sanity) && sanity)) {
buffer_free(&dst);
free(mn);
return html_error("Index corrupt");
}
sanity = lastn;
}
}
int prev = 0;
int next = 0;
if (first || lastn) {
struct idx_message msg;
off_t size = sizeof(struct idx_message);
if (first > 1) {
if (!idx_read_msg_ok(fd, first - 2, &msg, size)) {
free(mn);
return html_error("Index error");
}
prev = MIN_YEAR + msg.y;
}
if (lastn > 1) {
if (idx_read_msg_ok(fd, lastn, &msg, size))
next = MIN_YEAR + msg.y;
}
}
/* read Recent messages */
struct idx_message *msg = NULL;
int recent_count = 0;
int i;
if (min_y != max_y && lastn > 1) {
int recent_offset = 0;
recent_count = MAX_RECENT_MSG_LIST;
if ((lastn - 1) < recent_count)
recent_count = lastn - 1;
size_t size = recent_count * sizeof(struct idx_message);
recent_offset = lastn - recent_count;
if (!(msg = malloc(size)) ||
!idx_read_msg_ok(fd, recent_offset - 1, msg, size))
recent_count = 0;
/* resolve to message number in the day and cache in offset field */
rday = YMD2ADAY(min_y - MIN_YEAR, 1, 1) - aday;
i = 0;
for (; rday < eday; rday++) {
if (mn[rday] > 0 && recent_offset >= mn[rday]) {
count = aday_count(&mn[rday]);
while (recent_offset < (mn[rday] + count)) {
msg[i].offset = recent_offset - mn[rday] + 1;
recent_offset++;
i++;
if (i > recent_count)
break;
}
}
}
}
if (idx_close(fd) || buffer_init(&dst, 0)) {
free(msg);
free(mn);
return html_error(NULL);
}
buffer_appends(&dst, "\n");
if (html_flags & HTML_HEADER) {
buffer_appends(&dst, "<title>");
buffer_appends_html(&dst, list);
buffer_appends(&dst, " mailing list");
if (min_y == max_y)
buffer_appendf(&dst, " - %u", y);
buffer_appends(&dst, "</title>\n");
}
if (html_flags & HTML_BODY) {
if (prev)
buffer_appendf(&dst, "<a href=\"../%u/\">[prev year]</a>\n", prev);
if (next)
buffer_appendf(&dst, "<a href=\"../%u/\">[next year]</a>\n", next);
if (min_y == max_y)
buffer_appends(&dst, "<a href=\"..\">[list]</a>\n");
buffer_appends(&dst, "<p><h2>");
buffer_appends_html(&dst, list);
buffer_appends(&dst, " mailing list");
if (min_y == max_y)
buffer_appendf(&dst, " - %u", y);
buffer_appends(&dst, "</h2>\n");
idx_msgnum_t total = 0, monthly_total[12];
/* output short year-o-month index */
int o_header = 0;
int o_year = 0;
int o_month = -1;
for (y = max_y; y >= min_y; y--) {
rday = YMD2ADAY(y - MIN_YEAR, 1, 1) - aday;
for (m = 1; m <= 12; m++) {
monthly_total[m - 1] = 0;
for (d = 1; d <= 31; d++, rday++) {
if (mn[rday] <= 0)
continue;
if (mn[rday + 1] > 0)
count = mn[rday + 1] - mn[rday];
else
count = -mn[rday + 1];
monthly_total[m - 1] += count;
}
if (!monthly_total[m - 1])
continue;
if (!o_header) {
buffer_appends(&dst,
"\n<table border=0 "
"class=cal_brief><tr><th>"
"<th>Jan<th>Feb<th>Mar"
"<th>Apr<th>May<th>Jun"
"<th>Jul<th>Aug<th>Sep"
"<th>Oct<th>Nov<th>Dec\n");
o_header++;
}
if (o_year != y) {
if (o_month >= 0) {
for (o_month++; o_month <= 12; o_month++)
buffer_appends(&dst, "<td> ");
}
buffer_appendf(&dst, "\n<tr><td>");
if (min_y != max_y)
buffer_appendf(&dst, "<a href=\"%u/\">", y);
buffer_appendf(&dst, "<b>%4u</b>", y);
if (min_y != max_y)
buffer_appends(&dst, "</a>");
o_year = y;
o_month = 0;
}
for (o_month++; o_month < m; o_month++)
buffer_appends(&dst, "<td> ");
buffer_appendf(&dst, "<td><a href=\"");
if (min_y != max_y)
buffer_appendf(&dst, "%u/", y);
buffer_appendf(&dst, "%02u/\">%u</a>", m, monthly_total[m - 1]);
o_month = m;
total += monthly_total[m - 1];
}
}
if (o_header) {
if (o_year) {
for (o_month++; o_month <= 12; o_month++)
buffer_appends(&dst, "<td> ");
}
buffer_appends(&dst, "\n</table>\n");
}
/* output Recent messages */
if (msg && recent_count) {
buffer_appends(&dst, "<br>Recent messages:<br>\n<ul>\n");
for (i = recent_count - 1; i >= 0; i--) {
buffer_appendf(&dst,
"<li>%04u/%02u/%02u #%u: <a href=\"%04u/%02u/%02u/%u\">\n",
msg[i].y + MIN_YEAR, msg[i].m, msg[i].d, (int)msg[i].offset,
msg[i].y + MIN_YEAR, msg[i].m, msg[i].d, (int)msg[i].offset);
output_strings(&dst, &msg[i], 1);
buffer_appends(&dst, "\n");
}
buffer_appends(&dst, "</ul>\n");
}
free(msg); msg = NULL;
/* output monthly calendars */
if (min_y == max_y) {
y = min_y;
buffer_appends(&dst, "\n<p>\n<table border=0 class=cal_big>");
for (m = 1; m <= 12; m++) {
rday = YMD2ADAY(y - MIN_YEAR, m, 1) - aday;
if (m % 3 == 1) {
unsigned int n;
buffer_appends(&dst, "\n<tr>");
for (n = m; n < m + 3; n++) {
if (monthly_total[n - 1])
buffer_appendf(&dst, "<th><a href=\"%02u/\">%s</a>",
n, month_name[n - 1]);
else
buffer_appendf(&dst, "<th>%s", month_name[n - 1]);
}
buffer_appends(&dst, "\n<tr>");
}
buffer_appends(&dst, "<td valign=\"top\">");
html_output_month_cal(&dst, &mn[rday], y, m, L_MONTHLY);
}
buffer_appends(&dst, "</table>");
}
if (total)
buffer_appendf(&dst, "<p>%u message%s\n", total, total == 1 ? "" : "s");
else
buffer_appends(&dst, "<p>No messages\n");
} /* HTML_BODY */
free(msg);
free(mn);
return html_send(&dst);
}
