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 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452
|
/**
* @file
* Mailbox helper functions
*
* @authors
* Copyright (C) 2019-2022 Pietro Cerutti <gahr@gahr.ch>
* Copyright (C) 2019-2023 Richard Russon <rich@flatcap.org>
* Copyright (C) 2021 Austin Ray <austin@austinray.io>
*
* @copyright
* 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 2 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 <http://www.gnu.org/licenses/>.
*/
/**
* @page neo_mutt_mailbox Mailbox helper functions
*
* Mailbox helper functions
*/
#include "config.h"
#include <string.h>
#include <sys/stat.h>
#include <sys/types.h>
#include <utime.h>
#include "mutt/lib.h"
#include "config/lib.h"
#include "core/lib.h"
#include "mutt_mailbox.h"
#include "postpone/lib.h"
#include "muttlib.h"
#include "mx.h"
static time_t MailboxTime = 0; ///< last time we started checking for mail
static time_t MailboxStatsTime = 0; ///< last time we check performed mail_check_stats
static short MailboxCount = 0; ///< how many boxes with new mail
static short MailboxNotify = 0; ///< # of unnotified new boxes
/**
* is_same_mailbox - Compare two Mailboxes to see if they're equal
* @param m1 First mailbox
* @param m2 Second mailbox
* @param st1 stat() info for first mailbox
* @param st2 stat() info for second mailbox
* @retval true Mailboxes are the same
* @retval false Mailboxes are different
*/
static bool is_same_mailbox(struct Mailbox *m1, struct Mailbox *m2,
struct stat *st1, struct stat *st2)
{
if (!m1 || buf_is_empty(&m1->pathbuf) || !m2 || buf_is_empty(&m2->pathbuf) ||
(m1->type != m2->type))
{
return false;
}
const bool uses_protocol = (m2->type == MUTT_IMAP) || (m2->type == MUTT_NNTP) ||
(m2->type == MUTT_NOTMUCH) || (m2->type == MUTT_POP);
if (uses_protocol)
return mutt_str_equal(mailbox_path(m1), mailbox_path(m2));
else
return ((st1->st_dev == st2->st_dev) && (st1->st_ino == st2->st_ino));
}
/**
* mailbox_check - Check a mailbox for new mail
* @param m_cur Current Mailbox
* @param m_check Mailbox to check
* @param st_cur stat() info for the current Mailbox
* @param flags Flags, e.g. #MUTT_MAILBOX_CHECK_POSTPONED
*/
static void mailbox_check(struct Mailbox *m_cur, struct Mailbox *m_check,
struct stat *st_cur, CheckStatsFlags flags)
{
struct stat st = { 0 };
enum MailboxType mb_type = mx_path_probe(mailbox_path(m_check));
const bool c_mail_check_recent = cs_subset_bool(NeoMutt->sub, "mail_check_recent");
if ((m_cur == m_check) && c_mail_check_recent)
m_check->has_new = false;
switch (mb_type)
{
case MUTT_POP:
case MUTT_NNTP:
case MUTT_NOTMUCH:
case MUTT_IMAP:
m_check->type = mb_type;
break;
default:
if ((stat(mailbox_path(m_check), &st) != 0) ||
((m_check->type == MUTT_UNKNOWN) && S_ISREG(st.st_mode) && (st.st_size == 0)) ||
((m_check->type == MUTT_UNKNOWN) &&
((m_check->type = mx_path_probe(mailbox_path(m_check))) <= 0)))
{
/* if the mailbox still doesn't exist, set the newly created flag to be
* ready for when it does. */
m_check->newly_created = true;
m_check->type = MUTT_UNKNOWN;
m_check->size = 0;
return;
}
break; // kept for consistency.
}
const bool c_check_mbox_size = cs_subset_bool(NeoMutt->sub, "check_mbox_size");
/* check to see if the folder is the currently selected folder before polling */
if (!is_same_mailbox(m_cur, m_check, st_cur, &st))
{
switch (m_check->type)
{
case MUTT_NOTMUCH:
// Remove this when non-notmuch backends only check unread, flagged,
// and total counts per 'mbox_check_stats' docs.
if ((flags & MUTT_MAILBOX_CHECK_STATS) == 0)
break;
FALLTHROUGH;
case MUTT_IMAP:
case MUTT_MBOX:
case MUTT_MMDF:
case MUTT_MAILDIR:
case MUTT_MH:
mx_mbox_check_stats(m_check, flags);
break;
default:; /* do nothing */
}
}
else if (c_check_mbox_size && m_cur && buf_is_empty(&m_cur->pathbuf))
{
m_check->size = (off_t) st.st_size; /* update the size of current folder */
}
if (!m_check->has_new)
{
m_check->notified = false;
}
else
{
// pretend that we've already notified for the mailbox
if (!m_check->notify_user)
m_check->notified = true;
else if (!m_check->notified)
MailboxNotify++;
}
}
/**
* mutt_mailbox_check - Check all all Mailboxes for new mail
* @param m_cur Current Mailbox
* @param flags Flags, e.g. #MUTT_MAILBOX_CHECK_STATS
* @retval num Number of mailboxes with new mail
*
* Check all all Mailboxes for new mail and total/new/flagged messages
*/
int mutt_mailbox_check(struct Mailbox *m_cur, CheckStatsFlags flags)
{
if (TAILQ_EMPTY(&NeoMutt->accounts)) // fast return if there are no mailboxes
return 0;
if (flags & MUTT_MAILBOX_CHECK_POSTPONED)
mutt_update_num_postponed();
const short c_mail_check = cs_subset_number(NeoMutt->sub, "mail_check");
const bool c_mail_check_stats = cs_subset_bool(NeoMutt->sub, "mail_check_stats");
const short c_mail_check_stats_interval = cs_subset_number(NeoMutt->sub, "mail_check_stats_interval");
time_t t = mutt_date_now();
if ((flags == MUTT_MAILBOX_CHECK_NO_FLAGS) && ((t - MailboxTime) < c_mail_check))
return MailboxCount;
if ((flags & MUTT_MAILBOX_CHECK_STATS) ||
(c_mail_check_stats && ((t - MailboxStatsTime) >= c_mail_check_stats_interval)))
{
flags |= MUTT_MAILBOX_CHECK_STATS;
MailboxStatsTime = t;
}
MailboxTime = t;
MailboxCount = 0;
MailboxNotify = 0;
/* check device ID and serial number instead of comparing paths */
struct stat st_cur = { 0 };
if (!m_cur || (m_cur->type == MUTT_IMAP) || (m_cur->type == MUTT_POP) ||
(m_cur->type == MUTT_NNTP) || stat(mailbox_path(m_cur), &st_cur) != 0)
{
st_cur.st_dev = 0;
st_cur.st_ino = 0;
}
struct MailboxList ml = STAILQ_HEAD_INITIALIZER(ml);
neomutt_mailboxlist_get_all(&ml, NeoMutt, MUTT_MAILBOX_ANY);
struct MailboxNode *np = NULL;
STAILQ_FOREACH(np, &ml, entries)
{
struct Mailbox *m = np->mailbox;
if (!m->visible || !m->poll_new_mail)
continue;
CheckStatsFlags m_flags = flags;
if (!m->first_check_stats_done && c_mail_check_stats)
{
m_flags |= MUTT_MAILBOX_CHECK_STATS;
}
mailbox_check(m_cur, m, &st_cur, m_flags);
if (m->has_new)
MailboxCount++;
m->first_check_stats_done = true;
}
neomutt_mailboxlist_clear(&ml);
return MailboxCount;
}
/**
* mutt_mailbox_notify - Notify the user if there's new mail
* @param m_cur Current Mailbox
* @retval true There is new mail
*/
bool mutt_mailbox_notify(struct Mailbox *m_cur)
{
if ((mutt_mailbox_check(m_cur, MUTT_MAILBOX_CHECK_NO_FLAGS) > 0) && (MailboxNotify != 0))
{
return mutt_mailbox_list();
}
return false;
}
/**
* mutt_mailbox_list - Show a message with the list of mailboxes with new mail
* @retval true There is new mail
*/
bool mutt_mailbox_list(void)
{
int have_unnotified = MailboxNotify;
struct Buffer *path = buf_pool_get();
struct Buffer *mailboxlist = buf_pool_get();
buf_addstr(mailboxlist, _("New mail in "));
struct MailboxList ml = STAILQ_HEAD_INITIALIZER(ml);
neomutt_mailboxlist_get_all(&ml, NeoMutt, MUTT_MAILBOX_ANY);
struct MailboxNode *np = NULL;
bool any_new = false;
STAILQ_FOREACH(np, &ml, entries)
{
/* Is there new mail in this mailbox? */
if (!np->mailbox->has_new || (have_unnotified && np->mailbox->notified))
continue;
buf_strcpy(path, mailbox_path(np->mailbox));
buf_pretty_mailbox(path);
if (any_new)
{
buf_addstr(mailboxlist, ", ");
}
if (!np->mailbox->notified)
{
np->mailbox->notified = true;
MailboxNotify--;
}
buf_addstr(mailboxlist, buf_string(path));
any_new = true;
}
neomutt_mailboxlist_clear(&ml);
buf_pool_release(&path);
if (any_new)
{
mutt_message("%s", buf_string(mailboxlist));
buf_pool_release(&mailboxlist);
return true;
}
/* there were no mailboxes needing to be notified, so clean up since
* MailboxNotify has somehow gotten out of sync */
MailboxNotify = 0;
buf_pool_release(&mailboxlist);
return false;
}
/**
* mutt_mailbox_set_notified - Note when the user was last notified of new mail
* @param m Mailbox
*/
void mutt_mailbox_set_notified(struct Mailbox *m)
{
if (!m)
return;
m->notified = true;
mutt_time_now(&m->last_visited);
}
/**
* find_next_mailbox - Find the next mailbox with new or unread mail
* @param s Buffer containing name of current mailbox
* @param find_new Boolean controlling new or unread check
* @retval ptr Mailbox
*
* Given a folder name, find the next incoming folder with new or unread mail.
* The Mailbox will be returned and a pretty version of the path put into s.
*/
static struct Mailbox *find_next_mailbox(struct Buffer *s, bool find_new)
{
bool found = false;
for (int pass = 0; pass < 2; pass++)
{
struct MailboxList ml = STAILQ_HEAD_INITIALIZER(ml);
neomutt_mailboxlist_get_all(&ml, NeoMutt, MUTT_MAILBOX_ANY);
struct MailboxNode *np = NULL;
STAILQ_FOREACH(np, &ml, entries)
{
buf_expand_path(&np->mailbox->pathbuf);
struct Mailbox *m_cur = np->mailbox;
if ((found || (pass > 0)) && (find_new ? m_cur->has_new : m_cur->msg_unread > 0))
{
buf_strcpy(s, mailbox_path(np->mailbox));
buf_pretty_mailbox(s);
struct Mailbox *m_result = np->mailbox;
neomutt_mailboxlist_clear(&ml);
return m_result;
}
if (mutt_str_equal(buf_string(s), mailbox_path(np->mailbox)))
found = true;
}
neomutt_mailboxlist_clear(&ml);
}
return NULL;
}
/**
* mutt_mailbox_next - Incoming folders completion routine
* @param m_cur Current Mailbox
* @param s Buffer containing name of current mailbox
* @retval ptr Mailbox
*
* Given a folder name, find the next incoming folder with new mail.
* The Mailbox will be returned and a pretty version of the path put into s.
*/
struct Mailbox *mutt_mailbox_next(struct Mailbox *m_cur, struct Buffer *s)
{
buf_expand_path(s);
if (mutt_mailbox_check(m_cur, MUTT_MAILBOX_CHECK_NO_FLAGS) > 0)
{
struct Mailbox *m_res = find_next_mailbox(s, true);
if (m_res)
return m_res;
mutt_mailbox_check(m_cur, MUTT_MAILBOX_CHECK_POSTPONED);
}
buf_reset(s); // no folders with new mail
return NULL;
}
/**
* mutt_mailbox_next_unread - Find next mailbox with unread mail
* @param m_cur Current Mailbox
* @param s Buffer containing name of current mailbox
* @retval ptr Mailbox
*
* Given a folder name, find the next mailbox with unread mail.
* The Mailbox will be returned and a pretty version of the path put into s.
*/
struct Mailbox *mutt_mailbox_next_unread(struct Mailbox *m_cur, struct Buffer *s)
{
buf_expand_path(s);
struct Mailbox *m_res = find_next_mailbox(s, false);
if (m_res)
return m_res;
buf_reset(s); // no folders with new mail
return NULL;
}
/**
* mailbox_restore_timestamp - Restore the timestamp of a mailbox
* @param path Path to the mailbox
* @param st Timestamp info from stat()
*
* Fix up the atime and mtime after mbox/mmdf mailbox was modified according to
* stat() info taken before a modification.
*/
void mailbox_restore_timestamp(const char *path, struct stat *st)
{
#ifdef HAVE_UTIMENSAT
struct timespec ts[2] = { { 0 }, { 0 } };
#else
struct utimbuf ut = { 0 };
#endif
const bool c_check_mbox_size = cs_subset_bool(NeoMutt->sub, "check_mbox_size");
if (c_check_mbox_size)
{
struct Mailbox *m = mailbox_find(path);
if (m && !m->has_new)
mailbox_update(m);
}
else
{
/* fix up the times so mailbox won't get confused */
if (st->st_mtime > st->st_atime)
{
#ifdef HAVE_UTIMENSAT
ts[0].tv_sec = 0;
ts[0].tv_nsec = UTIME_OMIT;
ts[1].tv_sec = 0;
ts[1].tv_nsec = UTIME_NOW;
utimensat(AT_FDCWD, buf, ts, 0);
#else
ut.actime = st->st_atime;
ut.modtime = mutt_date_now();
utime(path, &ut);
#endif
}
else
{
#ifdef HAVE_UTIMENSAT
ts[0].tv_sec = 0;
ts[0].tv_nsec = UTIME_NOW;
ts[1].tv_sec = 0;
ts[1].tv_nsec = UTIME_NOW;
utimensat(AT_FDCWD, buf, ts, 0);
#else
utime(path, NULL);
#endif
}
}
}
|