plugins/trash/trash-plugin.c

	trash-plugin.c revision 2731d9f2ca860ed3f343ea2eae42e3e76c42a96d
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen/* Copyright (C) 2005 Timo Sirainen */
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen#include "lib.h"
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen#include "array.h"
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen#include "istream.h"
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen#include "home-expand.h"
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen#include "mail-search.h"
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen#include "quota-private.h"
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen#include "quota-plugin.h"
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen#include "trash-plugin.h"
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen#include <stdlib.h>
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen#include <unistd.h>
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen#include <fcntl.h>
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen#define INIT_TRASH_MAILBOX_COUNT 4
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen#define MAX_RETRY_COUNT 3
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlenstruct trash_mailbox {
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen    const char *name;
01bfcfd168ac9fffe2d80a88093acccb88706ef6Knut Anders Hatlen    int priority; /* lower number = higher priority */
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen    struct mail_storage *storage;
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen    /* temporarily set while cleaning: */
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen    struct mailbox *box;
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen    struct mailbox_transaction_context *trans;
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen        struct mail_search_arg search_arg;
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen    struct mail_search_context *search_ctx;
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen    struct mail *mail;
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen    unsigned int mail_set:1;
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen};
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlenconst char *trash_plugin_version = PACKAGE_VERSION;
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlenstatic int (*trash_next_quota_test_alloc)(struct quota_transaction_context *,
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen                      uoff_t, bool *);
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlenstatic pool_t config_pool;
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen/* trash_boxes ordered by priority, highest first */
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlenstatic ARRAY_DEFINE(trash_boxes, struct trash_mailbox);
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlenstatic int sync_mailbox(struct mailbox *box)
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen{
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen    struct mailbox_sync_context *ctx;
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen        struct mailbox_sync_rec sync_rec;
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen    ctx = mailbox_sync_init(box, MAILBOX_SYNC_FLAG_FULL_READ);
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen    while (mailbox_sync_next(ctx, &sync_rec) > 0)
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen        ;
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen    return mailbox_sync_deinit(&ctx, 0, NULL);
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen}
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlenstatic int trash_clean_mailbox_open(struct trash_mailbox *trash)
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen{
edafc572181ae79d8a2d4587f82448656b573c02Trond Norbye    trash->box = mailbox_open(trash->storage, trash->name, NULL,
edafc572181ae79d8a2d4587f82448656b573c02Trond Norbye                  MAILBOX_OPEN_KEEP_RECENT);
edafc572181ae79d8a2d4587f82448656b573c02Trond Norbye    if (trash->box == NULL)
01bfcfd168ac9fffe2d80a88093acccb88706ef6Knut Anders Hatlen        return 0;
01bfcfd168ac9fffe2d80a88093acccb88706ef6Knut Anders Hatlen
01bfcfd168ac9fffe2d80a88093acccb88706ef6Knut Anders Hatlen    if (sync_mailbox(trash->box) < 0)
01bfcfd168ac9fffe2d80a88093acccb88706ef6Knut Anders Hatlen        return -1;
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen    trash->trans = mailbox_transaction_begin(trash->box, 0);
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen    trash->search_ctx = mailbox_search_init(trash->trans, NULL,
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen                        &trash->search_arg, NULL);
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen    trash->mail = mail_alloc(trash->trans, MAIL_FETCH_PHYSICAL_SIZE |
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen                 MAIL_FETCH_RECEIVED_DATE, NULL);
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen    return mailbox_search_next(trash->search_ctx, trash->mail);
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen}
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlenstatic int trash_clean_mailbox_get_next(struct trash_mailbox *trash,
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen                    time_t *received_time_r)
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen{
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen    int ret;
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen    if (!trash->mail_set) {
212b5e1a0422841260addc7e9878a6e99fc2f254Knut Anders Hatlen        if (trash->box == NULL)
            ret = trash_clean_mailbox_open(trash);
        else
            ret = mailbox_search_next(trash->search_ctx,
                          trash->mail);
        if (ret <= 0) {
            *received_time_r = 0;
            return ret;
        }
        trash->mail_set = TRUE;
    }

    *received_time_r = mail_get_received_date(trash->mail);
    return 1;
}

static int trash_try_clean_mails(struct quota_transaction_context *ctx,
                 uint64_t size_needed)
{
    struct trash_mailbox *trashes;
    unsigned int i, j, count, oldest_idx;
    time_t oldest, received = 0;
    uint64_t size, size_expunged = 0, expunged_count = 0;
    int ret = 0;

    trashes = array_get_modifiable(&trash_boxes, &count);
    for (i = 0; i < count; ) {
        /* expunge oldest mails first in all trash boxes with
           same priority */
        oldest_idx = count;
        oldest = (time_t)-1;
        for (j = i; j < count; j++) {
            if (trashes[j].priority != trashes[i].priority)
                break;

            if (trashes[j].storage == NULL) {
                /* FIXME: this is really ugly. it'll do however
                   until we get proper namespace support for
                   lib-storage. */
                struct mail_storage *const *storage;

                storage = array_idx(&quota_set->storages, 0);
                trashes[j].storage = *storage;
            }

            ret = trash_clean_mailbox_get_next(&trashes[j],
                               &received);
            if (ret < 0)
                goto __err;
            if (ret > 0) {
                if (oldest == (time_t)-1 || received < oldest) {
                    oldest = received;
                    oldest_idx = j;
                }
            }
        }

        if (oldest_idx < count) {
            size = mail_get_physical_size(trashes[oldest_idx].mail);
            if (size == (uoff_t)-1) {
                /* maybe expunged already? */
                trashes[oldest_idx].mail_set = FALSE;
                continue;
            }

            if (mail_expunge(trashes[oldest_idx].mail) < 0)
                break;

            expunged_count++;
            size_expunged += size;
            if (size_expunged >= size_needed)
                break;
            trashes[oldest_idx].mail_set = FALSE;
        } else {
            /* find more mails from next priority's mailbox */
            i = j;
        }
    }

__err:
    for (i = 0; i < count; i++) {
        struct trash_mailbox *trash = &trashes[i];

        if (trash->box == NULL)
            continue;

        trash->mail_set = FALSE;
        mail_free(&trash->mail);
        (void)mailbox_search_deinit(&trash->search_ctx);

        if (size_expunged >= size_needed) {
            (void)mailbox_transaction_commit(&trash->trans,
                MAILBOX_SYNC_FLAG_FULL_WRITE);
        } else {
            /* couldn't get enough space, don't expunge anything */
                        mailbox_transaction_rollback(&trash->trans);
        }

        mailbox_close(&trash->box);
    }

    if (size_expunged < size_needed)
        return FALSE;

    ctx->bytes_used = ctx->bytes_used > (int64_t)size_expunged ?
        ctx->bytes_used - size_expunged : 0;
    ctx->count_used = ctx->count_used > (int64_t)expunged_count ?
        ctx->count_used - expunged_count : 0;
    return TRUE;
}

static int
trash_quota_test_alloc(struct quota_transaction_context *ctx,
               uoff_t size, bool *too_large_r)
{
    int ret, i;

    for (i = 0; ; i++) {
        ret = trash_next_quota_test_alloc(ctx, size, too_large_r);
        if (ret != 0 || *too_large_r)
            return ret;

        if (i == MAX_RETRY_COUNT) {
            /* trash_try_clean_mails() should have returned 0 if
               it couldn't get enough space, but allow retrying
               it a couple of times if there was some extra space
               that was needed.. */
            break;
        }

        /* not enough space. try deleting some from mailbox. */
        ret = trash_try_clean_mails(ctx, size);
        if (ret <= 0)
            return 0;
    }

    return 0;
}

static int trash_mailbox_priority_cmp(const void *p1, const void *p2)
{
    const struct trash_mailbox *t1 = p1, *t2 = p2;

    return t1->priority - t2->priority;
}

static int read_configuration(const char *path)
{
    struct istream *input;
    const char *line, *name;
    struct trash_mailbox *trash;
    unsigned int count;
    int fd;

    fd = open(path, O_RDONLY);
    if (fd == -1) {
        i_error("open(%s) failed: %m", path);
        return -1;
    }

    p_clear(config_pool);
    p_array_init(&trash_boxes, config_pool, INIT_TRASH_MAILBOX_COUNT);

    input = i_stream_create_file(fd, default_pool, (size_t)-1, FALSE);
    while ((line = i_stream_read_next_line(input)) != NULL) {
        /* <priority> <mailbox name> */
        name = strchr(line, ' ');
        if (name == NULL || name[1] == '\0')
            continue;

        trash = array_append_space(&trash_boxes);
        trash->name = p_strdup(config_pool, name+1);
        trash->priority = atoi(t_strdup_until(line, name));
        trash->search_arg.type = SEARCH_ALL;
    }
    i_stream_destroy(&input);
    (void)close(fd);

    trash = array_get_modifiable(&trash_boxes, &count);
    qsort(trash, count, sizeof(*trash), trash_mailbox_priority_cmp);
    return 0;
}

void trash_plugin_init(void)
{
    const char *env;

    env = getenv("TRASH");
    if (env == NULL)
        return;

    if (quota_set == NULL) {
        i_error("trash plugin: quota plugin not initialized");
        return;
    }

    config_pool = pool_alloconly_create("trash config",
                    sizeof(trash_boxes) +
                    BUFFER_APPROX_SIZE +
                    INIT_TRASH_MAILBOX_COUNT *
                    (sizeof(struct trash_mailbox) + 32));
    if (read_configuration(env) < 0)
        return;

    trash_next_quota_test_alloc = quota_set->test_alloc;
    quota_set->test_alloc = trash_quota_test_alloc;
}

void trash_plugin_deinit(void)
{
    quota_set->test_alloc = trash_next_quota_test_alloc;

    if (config_pool != NULL)
        pool_unref(config_pool);
}