seqcache.c

Go to the documentation of this file.

/*
 * ***** BEGIN GPL LICENSE BLOCK *****
 *
 * 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, write to the Free Software Foundation,
 * Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
 *
 * Peter Schlaile <peter [at] schlaile [dot] de> 2010
 *
 * Contributor(s): Sergey Sharybin
 *
 * ***** END GPL LICENSE BLOCK *****
 */

#include <stddef.h>

#include "BLO_sys_types.h"  /* for intptr_t */

#include "MEM_guardedalloc.h"

#include "DNA_sequence_types.h"
#include "BKE_sequencer.h"

#include "IMB_moviecache.h"

typedef struct seqCacheKey 
{
    struct Sequence * seq;
    SeqRenderData context;
    float cfra;
    seq_stripelem_ibuf_t type;
} seqCacheKey;

static struct MovieCache *moviecache = NULL;

static unsigned int seqcache_hashhash(const void *key_)
{
    const seqCacheKey *key = (seqCacheKey*) key_;
    unsigned int rval = seq_hash_render_data(&key->context);

    rval ^= *(unsigned int*) &key->cfra;
    rval += key->type;
    rval ^= ((intptr_t) key->seq) << 6;

    return rval;
}

static int seqcache_hashcmp(const void *a_, const void *b_)
{
    const seqCacheKey * a = (seqCacheKey*) a_;
    const seqCacheKey * b = (seqCacheKey*) b_;

    if (a->seq < b->seq) {
        return -1;      
    }
    if (a->seq > b->seq) {
        return 1;
    }

    if (a->cfra < b->cfra) {
        return -1;
    }
    if (a->cfra > b->cfra) {
        return 1;
    }

    if (a->type < b->type) {
        return -1;
    }
    if (a->type > b->type) {
        return 1;
    }

    return seq_cmp_render_data(&a->context, &b->context);
}

void seq_stripelem_cache_destruct(void)
{
    if(moviecache)
        IMB_moviecache_free(moviecache);
}

void seq_stripelem_cache_cleanup(void)
{
    if(moviecache) {
        IMB_moviecache_free(moviecache);
        moviecache = IMB_moviecache_create(sizeof(seqCacheKey), seqcache_hashhash,
                seqcache_hashcmp, NULL);
    }
}

struct ImBuf * seq_stripelem_cache_get(
    SeqRenderData context, struct Sequence * seq, 
    float cfra, seq_stripelem_ibuf_t type)
{

    if(moviecache && seq) {
        seqCacheKey key;

        key.seq = seq;
        key.context = context;
        key.cfra = cfra - seq->start;
        key.type = type;

        return IMB_moviecache_get(moviecache, &key);
    }

    return NULL;
}

void seq_stripelem_cache_put(
    SeqRenderData context, struct Sequence * seq, 
    float cfra, seq_stripelem_ibuf_t type, struct ImBuf * i)
{
    seqCacheKey key;

    if (!i) {
        return;
    }

    if(!moviecache) {
        moviecache = IMB_moviecache_create(sizeof(seqCacheKey), seqcache_hashhash,
                seqcache_hashcmp, NULL);
    }

    key.seq = seq;
    key.context = context;
    key.cfra = cfra - seq->start;
    key.type = type;

    IMB_moviecache_put(moviecache, &key, i);
}