Subversion Repositories tendra.SVN

/*

 * Copyright (c) 2002-2005 The TenDRA Project <http://www.tendra.org/>.

 * All rights reserved.

 *

 * Redistribution and use in source and binary forms, with or without

 * modification, are permitted provided that the following conditions are met:

 *

 * 1. Redistributions of source code must retain the above copyright notice,

 *    this list of conditions and the following disclaimer.

 * 2. Redistributions in binary form must reproduce the above copyright notice,

 *    this list of conditions and the following disclaimer in the documentation

 *    and/or other materials provided with the distribution.

 * 3. Neither the name of The TenDRA Project nor the names of its contributors

 *    may be used to endorse or promote products derived from this software

 *    without specific, prior written permission.

 *

 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ``AS

 * IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,

 * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR

 * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR

 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,

 * EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,

 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;

 * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,

 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR

 * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF

 * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

 *

 * $Id$

 */

/*

    		 Crown Copyright (c) 1996

    This TenDRA(r) Computer Program is subject to Copyright

    owned by the United Kingdom Secretary of State for Defence

    acting through the Defence Evaluation and Research Agency

    (DERA).  It is made available to Recipients with a

    royalty-free licence for its use, reproduction, transfer

    to other parties and amendment for any purpose not excluding

    product development provided that any such use et cetera

    shall be deemed to be acceptance of the following conditions:-

        (1) Its Recipients shall ensure that this Notice is

        reproduced upon any copies or amended versions of it;

        (2) Any amended version of it shall be clearly marked to

        show both the nature of and the organisation responsible

        for the relevant amendment or amendments;

        (3) Its onward transfer from a recipient to another

        party shall be deemed to be that party's acceptance of

        these conditions;

        (4) DERA gives no warranty or assurance as to its

        quality or suitability for any purpose and DERA accepts

        no liability whatsoever in relation to any use to which

        it may be put.

*/

/*

			    VERSION INFORMATION

			    ===================

--------------------------------------------------------------------------

$Header: /u/g/release/CVSROOT/Source/src/installers/680x0/common/ops_int.c,v 1.1.1.1 1998/01/17 15:55:49 release Exp $

--------------------------------------------------------------------------

$Log: ops_int.c,v $

 * Revision 1.1.1.1  1998/01/17  15:55:49  release

 * First version to be checked into rolling release.

 *

Revision 1.5  1997/11/13 08:27:15  ma

All avs test passed (except add_to_ptr).

Revision 1.4  1997/11/10 15:38:07  ma

.

Revision 1.3  1997/11/09 14:12:27  ma

Fixed max_min & splitted add_const into add_const and sub_const to make

error handling work.

Revision 1.2  1997/10/29 10:22:26  ma

Replaced use_alloca with has_alloca.

Revision 1.1.1.1  1997/10/13 12:42:56  ma

First version.

Revision 1.6  1997/10/13 08:49:47  ma

Made all pl_tests for general proc & exception handling pass.

Revision 1.5  1997/09/25 06:45:24  ma

All general_proc tests passed

Revision 1.4  1997/06/24 10:56:06  ma

Added changes for "Plumhall Patch"

Revision 1.3  1997/06/18 10:09:42  ma

Checking in before merging with Input Baseline changes.

Revision 1.2  1997/04/20 11:30:34  ma

Introduced gcproc.c & general_proc.[ch].

Added cases for apply_general_proc next to apply_proc in all files.

Revision 1.1.1.1  1997/03/14 07:50:16  ma

Imported from DRA

 * Revision 1.1.1.1  1996/09/20  10:56:57  john

 *

 * Revision 1.3  1996/07/30  16:31:23  john

 * Removed offset conversion

 *

 * Revision 1.2  1996/07/05  14:24:16  john

 * Changes for spec 3.1

 *

 * Revision 1.1.1.1  1996/03/26  15:45:15  john

 *

 * Revision 1.7  94/11/16  10:37:25  10:37:25  ra (Robert Andrews)

 * Added support for integer absolute.

 *

 * Revision 1.6  94/11/08  11:23:45  11:23:45  ra (Robert Andrews)

 * The operations addq and subq on A-registers do not set the condition

 * flags.

 *

 * Revision 1.5  94/06/29  14:23:27  14:23:27  ra (Robert Andrews)

 * Added maximum and minimum operations.

 *

 * Revision 1.4  94/02/21  16:01:29  16:01:29  ra (Robert Andrews)

 * Made a couple of integer literals into longs.

 *

 * Revision 1.3  93/04/19  13:35:28  13:35:28  ra (Robert Andrews)

 * Change_varieties in division routines were the wrong way round.

 *

 * Revision 1.2  93/03/03  14:49:05  14:49:05  ra (Robert Andrews)

 * Started adding support for error treatments.

 *

 * Revision 1.1  93/02/22  17:16:20  17:16:20  ra (Robert Andrews)

 * Initial revision

 *

--------------------------------------------------------------------------

*/

#include "config.h"

#include "common_types.h"

#include "assembler.h"

#include "basicread.h"

#include "check.h"

#include "exp.h"

#include "expmacs.h"

#include "externs.h"

#include "install_fns.h"

#include "shapemacs.h"

#include "tags.h"

#include "mach.h"

#include "mach_ins.h"

#include "where.h"

#include "mach_op.h"

#include "instr.h"

#include "codex.h"

#include "instrs.h"

#include "coder.h"

#include "tests.h"

#include "operations.h"

#include "evaluate.h"

#include "utility.h"

#include "translate.h"

#include "ops_shared.h"

extern void add_const(shape, long, where);

/*

    DO AN ADD BY A LOAD EFFECTIVE ADDRESS

    The m_lea instruction is used to add the constant offset to the value

    a and put the result into dest.  The flag psh is true to indicate

    that the result should be pushed onto the stack.

*/

void load_ea

(shape sha, long offset, where a, where dest, bool psh)

{

    if (have_overflow()) {

	move(sha, a, D0);

	add_const(sha, offset, D0);

	move(sha, D0, dest);

	have_cond = 0;

    } else {

	exp ra = simple_exp(dummy_tag);

	son(ra) = a.wh_exp;

	no(ra) = 8 * offset;

	if (psh) {

	    ins1(m_pea, L32, zw(ra), 0);

	    stack_size -= 32;

	} else {

	    ins2(m_lea, L32, L32, zw(ra), dest, 1);

	}

	retcell(ra);

	have_cond = 0;

    }

    return;

}

/*

    INCREASE BY A CONSTANT

    The value dest is increased or decreased by the constant n.

*/

void addsub_const

(shape sha, long n, where dest, bool use_sub)

{

    int instr;

    bool negate = 0, use_quick = 0;

    long sz = shape_size(sha);

    if (n == 0) return;

    /* If destination is a value we just have to test for overflow */

    if (whereis(dest) == Value) {

       long v = nw(dest);

       if (is_signed(sha)) {

          if (use_sub)

             n = -n;

          if (v>0 && n>0) {

             if (v > range_max(sha) - n)

                test_overflow(UNCONDITIONAL);

          }

          else if (v<0 && n<0) {

             if (v < range_min(sha) - n)

                test_overflow(UNCONDITIONAL);

          }

       }

       else { /* unsigned addition */

          if (use_sub) {

             /* will v - n underflow ? */

             if ((unsigned)v < (unsigned)range_min(sha) - (unsigned)n)

                test_overflow(UNCONDITIONAL);

          }

          else {

             if ((unsigned)v > (unsigned)range_max(sha) - (unsigned)n)

                test_overflow(UNCONDITIONAL);

          }

       }

       return;

    }

    /* Destination is not just a value */

    /* If we don't have to test for overflow, we can chose wheter to add/sub */

    /* Changeing add and sub might allow us to use quick add or sub */

    if (! have_overflow()) {

       /* But -(INT_MIN) can't be represented in signed shape */

       if (n != INT_MIN) {

          if (n < 0)

             negate = 1;

          if ((n < 8) && (n > -8))

             use_quick = 1;

       }

    }

    else {

       if ((unsigned long)n < 8)

          use_quick = 1;

    }

    /* Special handling for address regs. */

    if (whereis(dest) == Areg) {

       if (use_quick) {

          have_cond = 0;

       }

       else {

          if (use_sub)

             n = -n;

          load_ea(sha, n, dest, dest, 0);

          return;

       }

    }

    /* Find appropriate ADD/SUB */

    if (negate) {

       n = -n;

       use_sub = ! use_sub;

    }

    if (use_sub) {

       if (use_quick)

          instr = ins(sz, ml_subq);

       else

          instr = ins(sz, ml_sub);

    }

    else {

       if (use_quick)

          instr = ins(sz, ml_addq);

       else

          instr = ins(sz, ml_add);

    }

    ins2n(instr, n, sz, dest, 1);

    set_cond(dest, sz);

    test_overflow(ON_SHAPE(sha));

}

void add_const

(shape sha, long n, where dest)

{

   addsub_const(sha, n, dest, 0);

}

void sub_const

(shape sha, long n, where dest)

{

   addsub_const(sha, n, dest, 1);

}

/*

    AUXILIARY ADD ROUTINE

    The value inc (of shape sha and size sz) is added to dest.

*/

static void add_aux

(shape sha, long sz, where inc, where dest)

{

    int instr;

    long whi = whereis(inc);

    long whd = whereis(dest);

    if (whd == Freg) {

	move(sha, dest, D0);

	add_aux(sha, sz, inc, D0);

	move(sha, D0, dest);

	return;

    }

    if (whi == Value) {

	long v = nw(inc);

	if (is_offset(inc.wh_exp))v /= 8;

	add_const(sha, v, dest);

	return;

    }

    if (whi == Freg) {

	move(sha, inc, D0);

	add_aux(sha, sz, D0, dest);

	return;

    }

    if (have_overflow() && whd == Areg) {

	/* Skip to end */

    } else if (whi == Dreg || whd == Dreg || whd == Areg) {

	instr = ins(sz, ml_add);

	ins2(instr, sz, sz, inc, dest, 1);

	if (whd == Areg) {

	    have_cond = 0;

	} else {

	    set_cond(dest, sz);

	}

        test_overflow(ON_SHAPE(sha));

	return;

    }

    move(sha, inc, D0);

    add_aux(sha, sz, D0, dest);

    return;

}

/*

    ADD CONSTANT ROUTINE

    The constant c is added to the value inc, and the result is stored

    in dest.

*/

static void addsub_const_3_args

(shape sha, long sz, long c, where inc, where dest, bool use_sub)

{

    if (c == 0) {

	move(sha, inc, dest);

	return;

    }

    switch (whereis(dest)) {

	case Dreg: {

	    move(sha, inc, dest);

	    addsub_const(sha, c, dest, use_sub);

	    return;

	}

	case Areg: {

	    if (whereis(inc) == Areg) {

		load_ea(sha, c, inc, dest, 0);

		return;

	    }

	    move(sha, inc, dest);

	    addsub_const(sha, c, dest, use_sub);

	    return;

	}

	default : {

	    long whi = whereis(inc);

	    if (whi == Dreg && last_use(inc)) {

		addsub_const(sha, c, inc, use_sub);

		move(sha, inc, dest);

		set_cond(dest, sz);

		return;

	    }

	    if (whi == Areg && (  name(dest.wh_exp) == apply_tag

                                 || name(dest.wh_exp) == apply_general_tag

                                 || name(dest.wh_exp) == tail_call_tag)) {

		load_ea(sha, c, inc, dest, 1);

		return;

	    }

	    addsub_const_3_args(sha, sz, c, inc, D0, use_sub);

	    move(sha, D0, dest);

	    set_cond(dest, sz);

	    return;

	}

    }

}

/*

    MAIN ADD ROUTINE

    The values a1 and a2 of shape sha are added and the result stored in

    dest.

*/

void add

(shape sha, where a1, where a2, where dest)

{

    long sz = shape_size(sha);

    long rt = shtype(sha);

    long wh1, wh2, whd;

    if (rt == Freg) {

	fl_binop(fplus_tag, sha, a1, a2, dest);

	return;

    }

    if (eq_where(a1, dest)) {

	add_aux(sha, sz, a2, dest);

	return;

    }

    if (eq_where(a2, dest)) {

	add_aux(sha, sz, a1, dest);

	return;

    }

    wh1 = whereis(a1);

    wh2 = whereis(a2);

    whd = whereis(dest);

    if (wh1 == Value) {

	long v1 = nw(a1);

	if (is_offset(a1.wh_exp))v1 /= 8;

	if (wh2 == Value && !have_overflow()) {

	    long v2 = nw(a2);

	    if (is_offset(a2.wh_exp))v2 /= 8;

	    move(sha, mnw(v1 + v2), dest);

	    return;

	}

	addsub_const_3_args(sha, sz, v1, a2, dest, 0);

	return;

    }

    if (wh2 == Value) {

	long v2 = nw(a2);

	if (is_offset(a2.wh_exp))v2 /= 8;

	addsub_const_3_args(sha, sz, v2, a1, dest, 0);

	return;

    }

    if (whd == Dreg) {

	if (!interfere(a2, dest)) {

	    move(sha, a1, dest);

	    add_aux(sha, sz, a2, dest);

	    return;

	}

	if (!interfere(a1, dest)) {

	    move(sha, a2, dest);

	    add_aux(sha, sz, a1, dest);

	    return;

	}

    }

    if (wh1 == Dreg && last_use(a1)) {

	add_aux(sha, sz, a2, a1);

	move(sha, a1, dest);

	set_cond(dest, sz);

	return;

    }

    if (wh2 == Dreg && last_use(a2)) {

	add_aux(sha, sz, a1, a2);

	move(sha, a2, dest);

	set_cond(dest, sz);

	return;

    }

    if (wh1 == Dreg) {

	move(sha, a2, D0);

	add_aux(sha, sz, a1, D0);

    } else {

	move(sha, a1, D0);

	add_aux(sha, sz, a2, D0);

    }

    move(sha, D0, dest);

    set_cond(dest, sz);

    return;

}

/*

    AUXILIARY SUBTRACT ROUTINE

    The value a is subtracted from dest.

*/

static void sub_aux

(shape sha, long sz, where a, where dest)

{

    long wha = whereis(a);

    long whd = whereis(dest);

    if (whd == Freg) {

	move(sha, dest, D0);

	sub_aux(sha, sz, a, D0);

	move(sha, D0, dest);

	return;

    }

    if (wha == Value) {

	long v = nw(a);

	if (is_offset(a.wh_exp))v /= 8;

	sub_const(sha, v, dest);

	return;

    }

    if (wha != Freg) {

	if (have_overflow() && whd == Areg) {

	    /* Skip to end */

	} else if (whd == Dreg || whd == Areg || wha == Dreg) {

	    int instr = ins(sz, ml_sub);

	    ins2(instr, sz, sz, a, dest, 1);

	    if (whd == Areg) {

		have_cond = 0;

	    } else {

		set_cond(dest, sz);

	    }

            test_overflow(ON_SHAPE(sha));

	    return;

	}

    }

    move(sha, a, D0);

    sub_aux(sha, sz, D0, dest);

    set_cond(dest, sz);

    return;

}

/*

    MAIN SUBTRACT ROUTINE

    The value a2 of shape sha is subtracted from a1 and the result is

    stored in dest.

*/

void sub

(shape sha, where a1, where a2, where dest)

{

    long sz = shape_size(sha);

    long wh1, wh2, whd;

    if (eq_where(a1, a2)) {

	move(sha, zero, dest);

	return;

    }

    if (eq_where(a2, dest) && !eq_where(dest,zero)) {

	sub_aux(sha, sz, a1, dest);

	return;

    }

    wh1 = whereis(a1);

    wh2 = whereis(a2);

    whd = whereis(dest);

    if (wh1 == Value) {

	long v1 = nw(a1);

	if (is_offset(a1.wh_exp))v1 /= 8;

	if (wh2 == Value) {

	    long v2 = nw(a2);

	    if (is_offset(a2.wh_exp))v2 /= 8;

            if (is_signed(sha)) {

               if (v2>0 && v1<0) {

                  if (-v1 > range_max(sha) - v2)

                  test_overflow(UNCONDITIONAL);

               }

               else if (v2<0 && v1>0) {

                  if (v2 < range_min(sha) + v1)

                  test_overflow(UNCONDITIONAL);

               }

            }

            else {

               if ((unsigned)v1> (unsigned)v2)

               test_overflow(UNCONDITIONAL);

            }

	    move(sha, mnw(v2 - v1), dest);

	    return;

	}

	addsub_const_3_args(sha, sz, v1, a2, dest, 1);

	return;

    }

    if (wh2 == Value && nw(a2) == 0) {

	negate(sha, a1, dest);

	return;

    }

    if ((whd == Dreg || whd == Areg) && !interfere(a1, dest)) {

	move(sha, a2, dest);

	sub_aux(sha, sz, a1, dest);

	return;

    }

    move(sha, a2, D0);

    sub_aux(sha, sz, a1, D0);

    move(sha, D0, dest);

    set_cond(dest, sz);

    return;

}

/*

    NEGATE ROUTINE

    The value a of shape sha is negated and the result is stored in dest.

*/

void negate

(shape sha, where a, where dest)

{

    int instr;

    long sz = shape_size(sha);

    long rt = shtype(sha);

    long wha = whereis(a);

    long whd = whereis(dest);

    if (rt == Freg) {

	negate_float(sha, a, dest);

	return;

    }

    if (wha == Value) {

	long c = nw(a);

        bool overflow = 0;

	if (is_offset(a.wh_exp))c /= 8;

        if (is_signed(sha)) {

           if (c < - range_max(sha))

           overflow = 1;

        }

        else {

           if (c != 0) {

              make_comment("negation of unsigned shape");

              overflow = 1;

           }

        }

        /* If there is overflow and we have an error treatment, do it */

        if (overflow && have_overflow()) {

           test_overflow(UNCONDITIONAL);

        }

        /* No, so move the value in place */

        else {

           move(sha, mnw(-c), dest);

        }

	return;

    }

    if (eq_where(a, dest) && whd != Areg) {

	instr = ins(sz, ml_neg);

	ins1(instr, sz, dest, 1);

	set_cond(dest, sz);

        test_overflow(ON_SHAPE(sha));

	return;

    }

    if (whd == Dreg) {

	move(sha, a, dest);

	negate(sha, dest, dest);

	return;

    }

    if (wha == Dreg && last_use(a)) {

	negate(sha, a, a);

	move(sha, a, dest);

	return;

    }

    move(sha, a, D0);

    negate(sha, D0, D0);

    move(sha, D0, dest);

    return;

}

/*

    AUXILIARY MULTIPLY ROUTINE

    The value dest of shape sha is multiplied by a.

*/

static void mult_aux

(shape sha, where a, where dest)

{

    bool sg = is_signed(sha);

    long sz = shape_size(sha);

    int instr = (sg ? m_mulsl : m_mulul);

    shape lsha = (sg ? slongsh : ulongsh);

    if (whereis(a) == Freg) {

	move(sha, a, D0);

	mult_aux(sha, D0, dest);

	return;

    }

    if (sz == 8 || (have_overflow() && (sz == 16))) {

	change_var_sh(lsha, sha, dest, dest);

	change_var_sh(lsha, sha, a, D0);

	ins2(instr, L32, L32, dest, D0, 1);

        test_overflow(ON_OVERFLOW);

	change_var_sh(sha, lsha, D0, dest);

	set_cond(dest, sz);

	return;

    }

    if (sz == 16)instr = (sg ? m_mulsw : m_muluw);

    if (whereis(dest) == Dreg) {

	if (whereis(a) == Areg) {

	    if (eq_where(dest, D0)) {

		move(sha, a, D1);

		regsinproc |= regmsk(REG_D1);

		ins2(instr, sz, sz, D1, dest, 1);

	    } else {

		move(sha, a, D0);

		ins2(instr, sz, sz, D0, dest, 1);

	    }

	} else {

	    ins2(instr, sz, sz, a, dest, 1);

	}

        test_overflow(ON_OVERFLOW);

	set_cond(dest, sz);

	return;

    }

    move(sha, dest, D0);

    if (whereis(a) == Areg) {

	move(sha, a, D1);

	regsinproc |= regmsk(REG_D1);

	ins2(instr, sz, sz, D1, D0, 1);

    } else {

	ins2(instr, sz, sz, a, D0, 1);

    }

    test_overflow(ON_OVERFLOW);

    move(sha, D0, dest);

    set_cond(dest, sz);

    return;

}

/*

    MULTIPLY USING LOAD EFFECTIVE ADDRESS

    The m_lea instruction is used to multiply a by the constant sf + 1

    where sf is 1, 2, 4 or 8.  If d is true then a further add instruction

    is used to multiply further by 2.  The result is stored in dest.

    This routine only applies to values of size 32.

*/

static void mult_clever

(where a, where dest, long sf, bool d)

{

    int r;

    where ar;

    mach_op *op1, *op2;

    if (whereis(dest) == Areg) {

	ar = dest;

	r = reg(dest.wh_regs);

    } else {

	r = next_tmp_reg();

	regsinproc |= regmsk(r);

	ar = register(r);

    }

    move(slongsh, a, ar);

    op1 = make_reg_index(r, r, 0, sf);

    op2 = make_register(r);

    make_instr(m_lea, op1, op2, regmsk(r));

    have_cond = 0;

    if (d) {

	op1 = make_register(r);

	op2 = make_register(r);

	make_instr(m_addl, op1, op2, regmsk(r));

    }

    tmp_reg_status = 1;

    move(slongsh, ar, dest);

    return;

}

/*

    MULTIPLY A REGISTER BY A POWER OF 2

    The register r is multiplied by 2 to the power of p.  The flag

    D1_used is passed on to shift_aux if necessary.

*/

static void mult_power2

(long p, where r, bool D1_used)

{

    switch (p) {

	case 0: return;

	case 1: ins2(m_addl, L32, L32, r, r, 1); return;

	default : {

	    shift_aux(slongsh, mnw(p), r, r, 0, D1_used);

	    return;

	}

    }

}

/*

    MULTIPLICATION UTILITY ROUTINE

    This routine is used by mult_const.  The values r1 and r2 represent

    registers.  If P denotes 2 to the power of p and Q denotes 2 to the

    power of q then :

	(a)  If first_time is true, then q will be zero and r2 will hold

	     the same value as r1.  r1 is multiplied by P - 1.

	(b)  Otherwise, r1 is set equal to ( P * Q * r1 + ( P - 1 ) * r2 ).

    The flag D1_used is passed onto mult_power2 if necessary.

*/