r_mesh_anim.c

Go to the documentation of this file.

/*
Copyright (C) 2002-2010 UFO: Alien Invasion.

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., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.

*/

#include "r_local.h"
#include "r_mesh_anim.h"

#define LNEXT(x) ((x + 1 < MAX_ANIMLIST) ? x + 1 : 0)

static const mAliasAnim_t *R_AnimGet (const model_t * mod, const char *name)
{
    mAliasAnim_t *anim;
    int i;

    if (!mod || !mod->alias.num_anims)
        return NULL;

    for (i = 0, anim = mod->alias.animdata; i < mod->alias.num_anims; i++, anim++)
        if (!strcmp(name, anim->name))
            return anim;

    Com_Printf("model \"%s\" doesn't have animation \"%s\"\n", mod->name, name);
    return NULL;
}


void R_AnimAppend (animState_t * as, const model_t * mod, const char *name)
{
    const mAliasAnim_t *anim;

    assert(as->ladd < MAX_ANIMLIST);

    if (!mod || !mod->alias.num_anims)
        return;

    /* get animation */
    anim = R_AnimGet(mod, name);
    if (!anim)
        return;

    if (as->lcur == as->ladd) {
        /* first animation */
        as->oldframe = anim->from;
        if (anim->to > anim->from)
            as->frame = anim->from + 1;
        else
            as->frame = anim->from;

        as->backlerp = 0.0;
        as->time = anim->time;
        as->dt = 0;

        as->list[as->ladd] = anim - mod->alias.animdata;
    } else {
        /* next animation */
        as->list[as->ladd] = anim - mod->alias.animdata;
    }

    /* advance in list (no overflow protection!) */
    as->ladd = LNEXT(as->ladd);
}


void R_AnimChange (animState_t * as, const model_t * mod, const char *name)
{
    const mAliasAnim_t *anim;

    assert(as->ladd < MAX_ANIMLIST);

    if (!mod || !mod->alias.num_anims)
        return;

    /* get animation */
    anim = R_AnimGet(mod, name);
    if (!anim) {
        Com_Printf("R_AnimChange: No such animation: %s (model: %s)\n", name, mod->name);
        return;
    }

    if (as->lcur == as->ladd) {
        /* first animation */
        as->oldframe = anim->from;
        if (anim->to > anim->from)
            as->frame = anim->from + 1;
        else
            as->frame = anim->from;

        as->backlerp = 1.0;
        as->time = anim->time;
        as->dt = 0;

        as->list[as->ladd] = anim - mod->alias.animdata;
        as->change = qtrue;
    } else {
        /* next animation */
        as->ladd = LNEXT(as->lcur);
        as->list[as->ladd] = anim - mod->alias.animdata;

        if (anim->time < as->time)
            as->time = anim->time;
        /* don't change to the same animation */
        if (anim != mod->alias.animdata + as->list[as->lcur])
            as->change = qtrue;
    }

    /* advance in list (no overflow protection!) */
    as->ladd = LNEXT(as->ladd);
}


void R_AnimRun (animState_t * as, const model_t * mod, int msec)
{
    assert(as->lcur < MAX_ANIMLIST);

    if (!mod || !mod->alias.num_anims)
        return;

    if (as->lcur == as->ladd)
        return;

    as->dt += msec;

    while (as->dt > as->time) {
        const mAliasAnim_t *anim = mod->alias.animdata + as->list[as->lcur];
        as->dt -= as->time;

        if (as->change || as->frame >= anim->to) {
            /* go to next animation if it isn't the last one */
            if (LNEXT(as->lcur) != as->ladd)
                as->lcur = LNEXT(as->lcur);

            anim = mod->alias.animdata + as->list[as->lcur];

            /* prepare next frame */
            as->dt = 0;
            as->time = anim->time;
            as->oldframe = as->frame;
            as->frame = anim->from;
            as->change = qfalse;
        } else {
            /* next frame of the same animation */
            as->time = anim->time;
            as->oldframe = as->frame;
            as->frame++;
        }
    }

    as->backlerp = 1.0 - (float) as->dt / as->time;
}


const char *R_AnimGetName (const animState_t * as, const model_t * mod)
{
    const mAliasAnim_t *anim;

    assert(as->lcur < MAX_ANIMLIST);

    if (!mod || !mod->alias.num_anims)
        return NULL;

    if (as->lcur == as->ladd)
        return NULL;

    anim = mod->alias.animdata + as->list[as->lcur];
    return anim->name;
}

void R_InterpolateTransform (animState_t * as, int numframes, const float *tag, float *interpolated)
{
    const float *current, *old;
    float bl, fl;
    int i;

    /* range check */
    if (as->frame >= numframes || as->frame < 0)
        as->frame = 0;
    if (as->oldframe >= numframes || as->oldframe < 0)
        as->oldframe = 0;

    /* calc relevant values */
    current = tag + as->frame * 16;
    old = tag + as->oldframe * 16;
    bl = as->backlerp;
    fl = 1.0 - as->backlerp;

    /* right on a frame? */
    if (bl == 0.0) {
        memcpy(interpolated, current, sizeof(float) * 16);
        return;
    }
    if (bl == 1.0) {
        memcpy(interpolated, old, sizeof(float) * 16);
        return;
    }

    /* interpolate */
    for (i = 0; i < 16; i++)
        interpolated[i] = fl * current[i] + bl * old[i];

    /* normalize */
    for (i = 0; i < 3; i++)
        VectorNormalize(interpolated + i * 4);
}