Archipelago » qemu

/*

 *  PPC emulation micro-operations for qemu.

 * 

 *  Copyright (c) 2003 Jocelyn Mayer

 *

 * This library is free software; you can redistribute it and/or

 * modify it under the terms of the GNU Lesser General Public

 * License as published by the Free Software Foundation; either

 * version 2 of the License, or (at your option) any later version.

 *

 * This library 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

 * Lesser General Public License for more details.

 *

 * You should have received a copy of the GNU Lesser General Public

 * License along with this library; if not, write to the Free Software

 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA

 */

#include "config.h"

#include "exec.h"

//#define DEBUG_OP

#define regs (env)

#define Ts0 (int32_t)T0

#define Ts1 (int32_t)T1

#define Ts2 (int32_t)T2

#define FT0 (env->ft0)

#define FT1 (env->ft1)

#define FT2 (env->ft2)

#define FTS0 ((float)env->ft0)

#define FTS1 ((float)env->ft1)

#define FTS2 ((float)env->ft2)

#define PPC_OP(name) void glue(op_, name)(void)

#define REG 0

#include "op_template.h"

#define REG 1

#include "op_template.h"

#define REG 2

#include "op_template.h"

#define REG 3

#include "op_template.h"

#define REG 4

#include "op_template.h"

#define REG 5

#include "op_template.h"

#define REG 6

#include "op_template.h"

#define REG 7

#include "op_template.h"

#define REG 8

#include "op_template.h"

#define REG 9

#include "op_template.h"

#define REG 10

#include "op_template.h"

#define REG 11

#include "op_template.h"

#define REG 12

#include "op_template.h"

#define REG 13

#include "op_template.h"

#define REG 14

#include "op_template.h"

#define REG 15

#include "op_template.h"

#define REG 16

#include "op_template.h"

#define REG 17

#include "op_template.h"

#define REG 18

#include "op_template.h"

#define REG 19

#include "op_template.h"

#define REG 20

#include "op_template.h"

#define REG 21

#include "op_template.h"

#define REG 22

#include "op_template.h"

#define REG 23

#include "op_template.h"

#define REG 24

#include "op_template.h"

#define REG 25

#include "op_template.h"

#define REG 26

#include "op_template.h"

#define REG 27

#include "op_template.h"

#define REG 28

#include "op_template.h"

#define REG 29

#include "op_template.h"

#define REG 30

#include "op_template.h"

#define REG 31

#include "op_template.h"

/* PPC state maintenance operations */

/* set_Rc0 */

PPC_OP(set_Rc0)

{

    uint32_t tmp;

    if (Ts0 < 0) {

        tmp = 0x08;

    } else if (Ts0 > 0) {

        tmp = 0x04;

    } else {

        tmp = 0x02;

    }

    env->crf[0] = tmp;

    RETURN();

}

PPC_OP(set_Rc0_ov)

{

    uint32_t tmp;

    if (Ts0 < 0) {

        tmp = 0x08;

    } else if (Ts0 > 0) {

        tmp = 0x04;

    } else {

        tmp = 0x02;

    }

    tmp |= xer_ov;

    env->crf[0] = tmp;

    RETURN();

}

/* reset_Rc0 */

PPC_OP(reset_Rc0)

{

    env->crf[0] = 0x02 | xer_ov;

    RETURN();

}

/* set_Rc0_1 */

PPC_OP(set_Rc0_1)

{

    env->crf[0] = 0x04 | xer_ov;

    RETURN();

}

/* Set Rc1 (for floating point arithmetic) */

PPC_OP(set_Rc1)

{

    env->crf[1] = regs->fpscr[7];

    RETURN();

}

/* Constants load */

PPC_OP(set_T0)

{

    T0 = PARAM(1);

    RETURN();

}

PPC_OP(set_T1)

{

    T1 = PARAM(1);

    RETURN();

}

PPC_OP(set_T2)

{

    T2 = PARAM(1);

    RETURN();

}

/* Generate exceptions */

PPC_OP(queue_exception_err)

{

    do_queue_exception_err(PARAM(1), PARAM(2));

}

PPC_OP(queue_exception)

{

    do_queue_exception(PARAM(1));

}

PPC_OP(process_exceptions)

{

    env->nip = PARAM(1);

    if (env->exceptions != 0) {

        do_check_exception_state();

    }

}

/* Segment registers load and store with immediate index */

PPC_OP(load_srin)

{

    T0 = regs->sr[T1 >> 28];

    RETURN();

}

PPC_OP(store_srin)

{

#if defined (DEBUG_OP)

    dump_store_sr(T1 >> 28);

#endif

    regs->sr[T1 >> 28] = T0;

    RETURN();

}

PPC_OP(load_sdr1)

{

    T0 = regs->sdr1;

    RETURN();

}

PPC_OP(store_sdr1)

{

    regs->sdr1 = T0;

    RETURN();

}

PPC_OP(exit_tb)

{

    EXIT_TB();

}

/* Load/store special registers */

PPC_OP(load_cr)

{

    do_load_cr();

    RETURN();

}

PPC_OP(store_cr)

{

    do_store_cr(PARAM(1));

    RETURN();

}

PPC_OP(load_xer_cr)

{

    T0 = (xer_so << 3) | (xer_ov << 2) | (xer_ca << 1);

    RETURN();

}

PPC_OP(clear_xer_cr)

{

    xer_so = 0;

    xer_ov = 0;

    xer_ca = 0;

    RETURN();

}

PPC_OP(load_xer_bc)

{

    T1 = xer_bc;

    RETURN();

}

PPC_OP(load_xer)

{

    do_load_xer();

    RETURN();

}

PPC_OP(store_xer)

{

    do_store_xer();

    RETURN();

}

PPC_OP(load_msr)

{

    do_load_msr();

    RETURN();

}

PPC_OP(store_msr)

{

    do_store_msr();

    RETURN();

}

/* SPR */

PPC_OP(load_spr)

{

    T0 = regs->spr[PARAM(1)];

    RETURN();

}

PPC_OP(store_spr)

{

    regs->spr[PARAM(1)] = T0;

    RETURN();

}

PPC_OP(load_lr)

{

    T0 = regs->lr;

    RETURN();

}

PPC_OP(store_lr)

{

    regs->lr = T0;

    RETURN();

}

PPC_OP(load_ctr)

{

    T0 = regs->ctr;

    RETURN();

}

PPC_OP(store_ctr)

{

    regs->ctr = T0;

    RETURN();

}

/* Update time base */

PPC_OP(update_tb)

{

    T0 = regs->tb[0];

    T1 = T0;

    T0 += PARAM(1);

#if defined (DEBUG_OP)

    dump_update_tb(PARAM(1));

#endif

    if (T0 < T1) {

        T1 = regs->tb[1] + 1;

        regs->tb[1] = T1;

    }

    regs->tb[0] = T0;

    RETURN();

}

PPC_OP(load_tb)

{

    T0 = regs->tb[PARAM(1)];

    RETURN();

}

PPC_OP(store_tb)

{

    regs->tb[PARAM(1)] = T0;

#if defined (DEBUG_OP)

    dump_store_tb(PARAM(1));

#endif

    RETURN();

}

/* Update decrementer */

PPC_OP(update_decr)

{

    T0 = regs->decr;

    T1 = T0;

    T0 -= PARAM(1);

    regs->decr = T0;

    if (PARAM(1) > T1) {

        do_queue_exception(EXCP_DECR);

    }

    RETURN();

}

PPC_OP(store_decr)

{

    T1 = regs->decr;

    regs->decr = T0;

    if (Ts0 < 0 && Ts1 > 0) {

        do_queue_exception(EXCP_DECR);

    }

    RETURN();

}

PPC_OP(load_ibat)

{

    T0 = regs->IBAT[PARAM(1)][PARAM(2)];

}

PPC_OP(store_ibat)

{

#if defined (DEBUG_OP)

    dump_store_ibat(PARAM(1), PARAM(2));

#endif

    regs->IBAT[PARAM(1)][PARAM(2)] = T0;

}

PPC_OP(load_dbat)

{

    T0 = regs->DBAT[PARAM(1)][PARAM(2)];

}

PPC_OP(store_dbat)

{

#if defined (DEBUG_OP)

    dump_store_dbat(PARAM(1), PARAM(2));

#endif

    regs->DBAT[PARAM(1)][PARAM(2)] = T0;

}

/* FPSCR */

PPC_OP(load_fpscr)

{

    do_load_fpscr();

    RETURN();

}

PPC_OP(store_fpscr)

{

    do_store_fpscr(PARAM(1));

    RETURN();

}

PPC_OP(reset_scrfx)

{

    regs->fpscr[7] &= ~0x8;

    RETURN();

}

/* crf operations */

PPC_OP(getbit_T0)

{

    T0 = (T0 >> PARAM(1)) & 1;

    RETURN();

}

PPC_OP(getbit_T1)

{

    T1 = (T1 >> PARAM(1)) & 1;

    RETURN();

}

PPC_OP(setcrfbit)

{

    T1 = (T1 & PARAM(1)) | (T0 << PARAM(2)); 

    RETURN();

}

/* Branch */

#define EIP regs->nip

PPC_OP(setlr)

{

    regs->lr = PARAM1;

}

PPC_OP(b)

{

    JUMP_TB(b1, PARAM1, 0, PARAM2);

}

PPC_OP(b_T1)

{

    regs->nip = T1;

}

PPC_OP(btest) 

{

    if (T0) {

        JUMP_TB(btest, PARAM1, 0, PARAM2);

    } else {

        JUMP_TB(btest, PARAM1, 1, PARAM3);

    }

    RETURN();

}

PPC_OP(btest_T1) 

{

    if (T0) {

        regs->nip = T1 & ~3;

    } else {

        regs->nip = PARAM1;

    }

    RETURN();

}

PPC_OP(movl_T1_ctr)

{

    T1 = regs->ctr;

}

PPC_OP(movl_T1_lr)

{

    T1 = regs->lr;

}

/* tests with result in T0 */

PPC_OP(test_ctr)

{

    T0 = regs->ctr;

}

PPC_OP(test_ctr_true)

{

    T0 = (regs->ctr != 0 && (T0 & PARAM(1)) != 0);

}

PPC_OP(test_ctr_false)

{

    T0 = (regs->ctr != 0 && (T0 & PARAM(1)) == 0);

}

PPC_OP(test_ctrz)

{

    T0 = (regs->ctr == 0);

}

PPC_OP(test_ctrz_true)

{

    T0 = (regs->ctr == 0 && (T0 & PARAM(1)) != 0);

}

PPC_OP(test_ctrz_false)

{

    T0 = (regs->ctr == 0 && (T0 & PARAM(1)) == 0);

}

PPC_OP(test_true)

{

    T0 = (T0 & PARAM(1));

}

PPC_OP(test_false)

{

    T0 = ((T0 & PARAM(1)) == 0);

}

/* CTR maintenance */

PPC_OP(dec_ctr)

{

    regs->ctr--;

    RETURN();

}

/***                           Integer arithmetic                          ***/

/* add */

PPC_OP(add)

{

    T0 += T1;

    RETURN();

}

PPC_OP(addo)

{

    T2 = T0;

    T0 += T1;

    if ((T2 ^ T1 ^ (-1)) & (T2 ^ T0) & (1 << 31)) {

        xer_so = 1;

        xer_ov = 1;

    } else {

        xer_ov = 0;

    }

    RETURN();

}

/* add carrying */

PPC_OP(addc)

{

    T2 = T0;

    T0 += T1;

    if (T0 < T2) {

        xer_ca = 1;

    } else {

        xer_ca = 0;

    }

    RETURN();

}

PPC_OP(addco)

{

    T2 = T0;

    T0 += T1;

    if (T0 < T2) {

        xer_ca = 1;

    } else {

        xer_ca = 0;

    }

    if ((T2 ^ T1 ^ (-1)) & (T2 ^ T0) & (1 << 31)) {

        xer_so = 1;

        xer_ov = 1;

    } else {

        xer_ov = 0;

    }

    RETURN();

}

/* add extended */

/* candidate for helper (too long) */

PPC_OP(adde)

{

    T2 = T0;

    T0 += T1 + xer_ca;

    if (T0 < T2 || (xer_ca == 1 && T0 == T2)) {

        xer_ca = 1;

    } else {

        xer_ca = 0;

    }

    RETURN();

}

PPC_OP(addeo)

{

    T2 = T0;

    T0 += T1 + xer_ca;

    if (T0 < T2 || (xer_ca == 1 && T0 == T2)) {

        xer_ca = 1;

    } else {

        xer_ca = 0;

    }

    if ((T2 ^ T1 ^ (-1)) & (T2 ^ T0) & (1 << 31)) {

        xer_so = 1;

        xer_ov = 1;

    } else {

        xer_ov = 0;

    }

    RETURN();

}

/* add immediate */

PPC_OP(addi)

{

    T0 += PARAM(1);

    RETURN();

}

/* add immediate carrying */

PPC_OP(addic)

{

    T1 = T0;

    T0 += PARAM(1);

    if (T0 < T1) {

        xer_ca = 1;

    } else {

        xer_ca = 0;

    }

    RETURN();

}

/* add to minus one extended */

PPC_OP(addme)

{

    T1 = T0;

    T0 += xer_ca + (-1);

    if (T1 != 0)

        xer_ca = 1;

    RETURN();

}

PPC_OP(addmeo)

{

    T1 = T0;

    T0 += xer_ca + (-1);

    if (T1 & (T1 ^ T0) & (1 << 31)) {

        xer_so = 1;

        xer_ov = 1;

    } else {

        xer_ov = 0;

    }

    if (T1 != 0)

        xer_ca = 1;

    RETURN();

}

/* add to zero extended */

PPC_OP(addze)

{

    T1 = T0;

    T0 += xer_ca;

    if (T0 < T1) {

        xer_ca = 1;

    } else {

        xer_ca = 0;

    }

    RETURN();

}

PPC_OP(addzeo)

{

    T1 = T0;

    T0 += xer_ca;

    if ((T1 ^ (-1)) & (T1 ^ T0) & (1 << 31)) {

        xer_so = 1;

        xer_ov = 1;

    } else {

        xer_ov = 0;

    }

    if (T0 < T1) {

        xer_ca = 1;

    } else {

        xer_ca = 0;

    }

    RETURN();

}

/* divide word */

/* candidate for helper (too long) */

PPC_OP(divw)

{

    if ((Ts0 == INT32_MIN && Ts1 == -1) || Ts1 == 0) {

        Ts0 = (-1) * (T0 >> 31);

    } else {

        Ts0 /= Ts1;

    }

    RETURN();

}

PPC_OP(divwo)

{

    if ((Ts0 == INT32_MIN && Ts1 == -1) || Ts1 == 0) {

        xer_so = 1;

        xer_ov = 1;

        T0 = (-1) * (T0 >> 31);

    } else {

        xer_ov = 0;

        Ts0 /= Ts1;

    }

    RETURN();

}

/* divide word unsigned */

PPC_OP(divwu)

{

    if (T1 == 0) {

        T0 = 0;

    } else {

        T0 /= T1;

    }

    RETURN();

}

PPC_OP(divwuo)

{

    if (T1 == 0) {

        xer_so = 1;

        xer_ov = 1;

        T0 = 0;

    } else {

        xer_ov = 0;

        T0 /= T1;

    }

    RETURN();

}

/* multiply high word */

PPC_OP(mulhw)

{

    Ts0 = ((int64_t)Ts0 * (int64_t)Ts1) >> 32;

    RETURN();

}

/* multiply high word unsigned */

PPC_OP(mulhwu)

{

    T0 = ((uint64_t)T0 * (uint64_t)T1) >> 32;

    RETURN();

}

/* multiply low immediate */

PPC_OP(mulli)

{

    Ts0 *= SPARAM(1);

    RETURN();

}

/* multiply low word */

PPC_OP(mullw)

{

    T0 *= T1;

    RETURN();

}

PPC_OP(mullwo)

{

    int64_t res = (int64_t)Ts0 * (int64_t)Ts1;

    if ((int32_t)res != res) {

        xer_ov = 1;

        xer_so = 1;

    } else {

        xer_ov = 0;

    }

    Ts0 = res;

    RETURN();

}

/* negate */

PPC_OP(neg)

{

    if (T0 != 0x80000000) {

        Ts0 = -Ts0;

    }

    RETURN();

}

PPC_OP(nego)

{

    if (T0 == 0x80000000) {

        xer_ov = 1;

        xer_so = 1;

    } else {

        xer_ov = 0;

        Ts0 = -Ts0;

    }

    RETURN();

}

/* substract from */

PPC_OP(subf)

{

    T0 = T1 - T0;

    RETURN();

}

PPC_OP(subfo)

{

    T2 = T0;

    T0 = T1 - T0;

    if (((~T2) ^ T1 ^ (-1)) & ((~T2) ^ T0) & (1 << 31)) {

        xer_so = 1;

        xer_ov = 1;

    } else {

        xer_ov = 0;

    }

    RETURN();

}

/* substract from carrying */

PPC_OP(subfc)

{

    T0 = T1 - T0;

    if (T0 <= T1) {

        xer_ca = 1;

    } else {

        xer_ca = 0;

    }

    RETURN();

}

PPC_OP(subfco)

{

    T2 = T0;

    T0 = T1 - T0;

    if (T0 <= T1) {

        xer_ca = 1;

    } else {

        xer_ca = 0;

    }

    if (((~T2) ^ T1 ^ (-1)) & ((~T2) ^ T0) & (1 << 31)) {

        xer_so = 1;

        xer_ov = 1;

    } else {

        xer_ov = 0;

    }

    RETURN();

}

/* substract from extended */

/* candidate for helper (too long) */

PPC_OP(subfe)

{

    T0 = T1 + ~T0 + xer_ca;

    if (T0 < T1 || (xer_ca == 1 && T0 == T1)) {

        xer_ca = 1;

    } else {

        xer_ca = 0;

    }

    RETURN();

}

PPC_OP(subfeo)

{

    T2 = T0;

    T0 = T1 + ~T0 + xer_ca;

    if ((~T2 ^ T1 ^ (-1)) & (~T2 ^ T0) & (1 << 31)) {

        xer_so = 1;

        xer_ov = 1;

    } else {

        xer_ov = 0;

    }

    if (T0 < T1 || (xer_ca == 1 && T0 == T1)) {

        xer_ca = 1;

    } else {

        xer_ca = 0;

    }

    RETURN();

}

/* substract from immediate carrying */

PPC_OP(subfic)

{

    T0 = PARAM(1) + ~T0 + 1;

    if (T0 <= PARAM(1)) {