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) 1997

    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.

*/

/**********************************************************************

$Author: pwe $

$Date: 1998/03/17 16:34:54 $

$Revision: 1.6 $

$Log: dw2_extra.c,v $

 * Revision 1.6  1998/03/17  16:34:54  pwe

 * correction for non-NEWDIAGS

 *

 * Revision 1.5  1998/03/15  16:00:15  pwe

 * regtrack dwarf dagnostics added

 *

 * Revision 1.4  1998/03/11  11:03:04  pwe

 * DWARF optimisation info

 *

 * Revision 1.3  1998/02/18  11:22:01  pwe

 * test corrections

 *

 * Revision 1.2  1998/01/21  10:29:59  pwe

 * labdiff change

 *

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

 * First version to be checked into rolling release.

 *

 * Revision 1.1  1998/01/09  14:47:37  pwe

 * prep restructure

 *

 * Revision 1.10  1997/12/04  20:01:36  pwe

 * ANDF-DE V1.9

 *

 * Revision 1.9  1997/10/28  10:26:55  pwe

 * correct extra diags / locations

 *

 * Revision 1.8  1997/10/23  09:37:36  pwe

 * extra_diags

 *

 * Revision 1.7  1997/10/10  18:26:09  pwe

 * prep ANDF-DE revision

 *

 * Revision 1.6  1997/08/23  13:46:10  pwe

 * initial ANDF-DE

 *

 * Revision 1.5  1997/05/02  11:05:04  pwe

 * minor dwarf2 corrections

 *

 * Revision 1.4  1997/04/17  11:56:12  pwe

 * dwarf2 improvements

 *

 * Revision 1.3  1997/04/02  10:33:49  pwe

 * diagnose pl_tests

 *

 * Revision 1.2  1997/03/24  11:15:53  pwe

 * dwarf2 option/default

 *

 * Revision 1.1  1997/03/20  16:24:44  pwe

 * dwarf2

 *

**********************************************************************/

#include "config.h"

#include "common_types.h"

#ifdef NEWDWARF

#include "localtypes.h"

#include "dg_aux.h"

#include "dg_types.h"

#include "dw2_config.h"

#include "dw2_codes.h"

#include "dw2_entries.h"

#include "dw2_basic.h"

#include "dw2_info.h"

#include "codermacs.h"

#include "flags.h"

#include "operand.h"

#include "machine.h"

#include "instr386.h"

#include "expmacs.h"

#include "shapemacs.h"

#include "instr.h"

#include "basicread.h"

#include "szs_als.h"

#include "coder.h"

#include "tags.h"

#include "const.h"

#include "label_ops.h"

#include "flpttypes.h"

#include "f64.h"

#include "dw2_extra.h"

#include "operand.h"

#include "reg_record.h"

#include "dw2_locdata.h"

extern int locals_offset; /* declared in cproc.c */

static long dwarfreg[8] = {0, 2, 1, 3, 7, 6, 5, 4};

#define dw_sp 4

#define dw_fp 5

#define retaddr 8

static long cie_pointer;

static long fde_end;

static long proc_end;

static char * sp50 = "                                                  ";

enum loctype { L_INREG = 1, L_REGOFF, L_GLOB, L_INDIRECT };

typedef struct {

  enum loctype key;

  int reg;

  char* s;

  long off;

} loc_s;

static int extra_deref;

static int locate_param;

static int has_fp;

static int no_location;

static void outsep

(void)

{

  outs(", ");

}

int dw_is_const

(exp e)

{

  switch (name(e)) {

    case val_tag:

    case null_tag:

    case real_tag:

      return 1;

    case name_tag:

      return(!isdiscarded(e) && isvar(son(e)));

#if 0

    case cont_tag:

      return(name(son(e)) == name_tag && !isdiscarded(son(e)) &&

		!isvar(son(son(e))) && !isparam(son(son(e))));

#endif

    case reff_tag:

      return 1;

    default:

      return 0;

  }

}

exp dw_has_location

(exp e)

{

  switch (name(e)) {

    case name_tag: {

      if (isdiscarded(e) || isvar(son(e)))

	return nilexp;

      return(son(e));

    }

    case cont_tag: {

      do {

	e = son(e);

	if (name(e) == name_tag && isdiscarded(e))

	  return nilexp;

      }

      while (name(e)!= ident_tag);

      return e;

    }

    default:

      return nilexp;

  }

}

static loc_s name_to_loc(exp e);

static loc_s find_param

(exp e)

{

  switch (name(e)) {

    case name_tag:

      if (isvar(son(e)))

	extra_deref--;

      if (isparam(son(e)))

        return name_to_loc(e);

      return find_param(son(son(e)));

    case cont_tag:

      extra_deref++;	/* drop through */

    case chvar_tag:

    case chfl_tag:

      return find_param(son(e));

    default:

      break;

  }

  failer("parameter inconsistency");

  return find_param(e);

}

static loc_s name_to_loc

(exp e)

{

  loc_s l;

  exp id = son(e);

  long n_off = no(e) /8;

  if (locate_param && !isparam(id)) {

    return find_param(son(id));

#if 0

    if (name(son(id)) == name_tag && isloadparam(son(id)) && isparam(son(son(id))))

      return name_to_loc(son(id));

    if (name(son(id)) == cont_tag && name(son(son(id))) == name_tag &&

		isparam(son(son(son(id)))))

      return name_to_loc(son(son(id)));

    failer("parameter inconsistency");

#endif

  }

  if (isglob(id)) {

    l.key = L_GLOB;

    l.s = brog(id) -> dec_u.dec_val.dec_id;

    l.off = n_off;

  }

  else {

    switch (ptno(id)) {

      case local_pl: {

	l.key = L_REGOFF;

	l.reg = -1;

	l.off = (no(id) /8) + n_off;

	if (name(id))

	  l.off -= locals_offset;

	else {			/* env_off modification */

	  if (locate_param) {

	    l.reg = dw_sp;

	  }

	}

	if (has_fp && l.reg < 0)

	  l.off += 4;

	break;

      };

      case callstack_pl: {

	failer("callstack arg - location list needed");

	break;

      };

      case par_pl: {

	l.key = L_REGOFF;

	l.reg = (locate_param ? dw_sp : -1);

	l.off = (no(id) /8) +4 + n_off;

	break;

      };

      case reg_pl: {

	int z = get_reg_no(no(id));

	l.key = L_INREG;

	l.reg = (z >= first_fl_reg ? 100 + z - first_fl_reg :

					(int)dwarfreg[z]);

	break;

      };

      default:

	failer("no location for id");

	SET(l);

    }

    if (has_fp && l.reg < 0)

      l.off += 4;

  }

  return l;

}

static loc_s find_loc

(exp e)

{

  loc_s l;

  switch (name(e)) {

    case name_tag: {

      if (isdiscarded(e) || (isglob(son(e)) && no(son(e)) == 0 &&

				!(brog(son(e)) ->dec_u.dec_val.extnamed))) {

	l.key = L_INREG;

	l.reg = 0;

	no_location = 1;

	return l;

      }

      if (isvar(son(e)))

	extra_deref--;

      return name_to_loc(e);

    }

    case cont_tag:

    case contvol_tag: {

      if (name(son(e)) == name_tag) {

	if (isdiscarded(son(e)) ||

			(isglob(son(son(e))) && no(son(son(e))) == 0 &&

			 !(brog(son(son(e))) ->dec_u.dec_val.extnamed))) {

	  l.key = L_INREG;

	  l.reg = 0;

	  no_location = 1;

	  return l;

	}

	if (isvar(son(son(e))))

	  return name_to_loc(son(e));

      }

      l = find_loc(son(e));

      if (l.key == L_INREG) {

	l.key = L_REGOFF;

	l.off = 0;

      }

      else

	l.key = L_INDIRECT;

      break;

    }

    case reff_tag: {

      l = find_loc(son(e));

      if (l.key == L_GLOB || l.key == L_REGOFF)

	l.off += (no(e) /8);

      else

      if (l.key == L_INREG) {

	l.key = L_REGOFF;

	l.off = (no(e) /8);

	extra_deref--;

      }

      else

	l.key = L_INDIRECT;

      break;

    }

    case chvar_tag: {

      l = find_loc(son(e));

      break;

    }

    default:

      failer("unimplemented location condition");

      SET(l);

  }

  return l;

}

static int inreg_length

(int r, int more)

{

  int ans = 1 + more;

  if (r >= 32)

    ans += uleb128_length((unsigned long)r);

  return ans;

}

static void out_inreg

(int r, int more)

{

  if (!more) {

    if (r < 32)

      outn((long)(DW_OP_reg0 + r));

    else {

      outn((long)DW_OP_regx); outsep(); uleb128((unsigned long)r);

    }

  }

  else {

    if (r < 32)

      outn((long)(DW_OP_breg0 + r));

    else {

      outn((long)DW_OP_bregx); outsep(); uleb128((unsigned long)r);

    }

    outsep(); outn((long)0);

  }

  return;

}

static int regoff_length

(loc_s l)

{

  return(1 + sleb128_length(l.off));

}

static void out_regoff

(loc_s l)

{

  outn((long)(l.reg < 0 ? DW_OP_fbreg : DW_OP_breg0 + l.reg)); outsep();

  sleb128(l.off);

  return;

}

static int glob_length

(loc_s l)

{

  UNUSED(l);

  return 5;

}

static void out_glob

(loc_s l)

{

  outn((long)DW_OP_addr); d_outnl();

  out32(); outs(l.s);

  if (l.off) {

    outs(" + ");

    outn((long)l.off);

  }

  return;

}

static int indirect_length

(exp e)

{

  int length;

  loc_s l;

  switch (name(e)) {

    case cont_tag: {

      length = 1;

      break;

    }

    case reff_tag: {

      if (no(e) >= 0)

	length = 1 + uleb128_length((unsigned long)(no(e) /8));

      else

	length = 2 + uleb128_length((unsigned long)(-no(e) /8));

      break;

    }

    default: {

      failer("unimplemented dwarf locate");

      return 0;

    }

  }

  l = find_loc(son(e));

  switch (l.key) {

    case L_INREG: {

      length += inreg_length(l.reg, 1);

      break;

    }

    case L_REGOFF: {

      length += regoff_length(l);

      break;

    }

    case L_GLOB: {

      length += glob_length(l);

      break;

    }

    case L_INDIRECT: {

      length += indirect_length(son(e));

      break;

    }

  }

  return length;

}

static void out_indirect

(exp e)

{

  loc_s l;

  l = find_loc(e);

  switch (l.key) {

    case L_INREG: {

      out_inreg(l.reg, 1);

      outsep();

      break;

    }

    case L_REGOFF: {

      out_regoff(l);

      outsep();

      break;

    }

    case L_GLOB: {

      out_glob(l);

      d_outnl(); out8();

      break;

    }

    case L_INDIRECT: {

      out_indirect(son(e));

      outsep();

      break;

    }

  }

  switch (name(e)) {

    case cont_tag: {

      outn((long)DW_OP_deref);

      break;

    }

    case reff_tag: {

      if (no(e) >= 0) {

	outn((long)DW_OP_plus_uconst); outsep();

	uleb128((unsigned long)(no(e) /8));

      }

      else {

	outn((long)DW_OP_constu); outsep();

	uleb128((unsigned long)(-no(e) /8)); outsep();

	outn((long)DW_OP_minus);

      }

      break;

    }

  }

  return;

}

void dw2_locate_exp

(exp e, int locate_const, int cx)

{

  loc_s l;

  int length;

  int within_loclist = (cx & 1);

  locate_param = (cx & 2);

  extra_deref = locate_const;

  no_location = 0;

  l = find_loc (e);	/* may reduce extra_deref */

  length = extra_deref;

  switch (l.key) {

    case L_INREG: {

      length += inreg_length(l.reg, extra_deref);

      break;

    }

    case L_REGOFF: {

      length += regoff_length(l);

      break;

    }

    case L_GLOB: {

      length += glob_length(l);

      break;

    }

    case L_INDIRECT: {

      length += indirect_length(e);

      break;

    }

  }

  if (no_location)

    length = 0;

  if (within_loclist) {

    out16();

    outn((long)length); outnl();

    if (no_location)

      return;

    out8();

  }

  else {

    out8();

    outn((long)length);

    if (no_location) {

      outnl();

      return;

    }

    outsep();

  }

  switch (l.key) {

    case L_INREG: {

      out_inreg(l.reg, extra_deref);

      break;

    }

    case L_REGOFF: {

      out_regoff(l);

      break;

    }

    case L_GLOB: {

      out_glob(l);

      break;

    }

    case L_INDIRECT: {

      out_indirect(e);

      break;

    }

  }

  while (extra_deref) {

    if (extra_deref < 0) {

      failer("miscalculated location");

      break;

    }

#if 0

    if (locate_const)

      failer("constant location???");

#endif

    outsep();

    outn((long)DW_OP_deref);

    extra_deref--;

  }

  d_outnl();

  return;

}

void dw2_prepare_locate

(exp id)

{

			/* set local proc conditions for local locations */

  exp p = son(id);	/* proc or general proc */

  locals_offset = no(p);

  has_fp = proc_has_fp(p);

  return;

}

void dw_at_procdetails

(void)

{

			/* return address and frame base */

  out8(); outn((long)2); outsep(); outn((long)DW_OP_fbreg); outsep();

  if (has_fp) {

    outn((long)4); d_outnl();

    out8(); outn((long)1); outsep();

    outn((long)DW_OP_reg0+dw_fp); d_outnl();

  }

  else {

    outn((long)0); d_outnl();

    out8(); outn((long)0); d_outnl();

  }

  return;

}

void dw2_locate_result

(shape sha)

{

  long length = 1;

  int reg = 0;

  int indirect = 0;

  int multi = 0;

  if (is_floating(name(sha))) {

    reg = 100;

    length = inreg_length(reg, 0);

  }

  else

  if (!reg_result(sha)) {

    indirect = 1;

    length = 2;

  }

  else

  if (shape_size(sha) > 32) {

    multi = 1;

    length = 6;

  }

  out8(); outn(length); outsep();

  if (multi) {

    outn((long)DW_OP_reg0); outsep();

    outn((long)DW_OP_piece); outsep(); outn((long)4);

    outsep();

    outn((long)DW_OP_reg0+2); outsep();

    outn((long)DW_OP_piece); outsep(); outn((long)4);

  }

  else

  if (indirect) {

    outn((long)DW_OP_breg0); outsep(); outn((long)0);

  }

  else {

    out_inreg(reg, 0);

  }

  d_outnl();

  return;

}

void dw2_locate_val

(dg_where v)

{

  out8();

  switch (v.k) {

    case NO_WH: {

      outn((long)0);

      break;

    }

    case WH_STR: {

      loc_s l;

      l.key = L_GLOB;

      l.s = v.u.s;

      l.off = v.o;

      outn((long)glob_length(l)); outsep();

      out_glob(l);

      break;

    }

    case WH_REG: {

      int r = (int)dwarfreg[v.u.l];

      outn((long)inreg_length(r, 0)); outsep();

      out_inreg(r, 0);

      break;

    }

    case WH_REGOFF: {

      loc_s l;

      l.key = L_REGOFF;

      l.reg = (int)v.u.l;

      l.off = v.o;

      if (l.reg == -2) {

	l.reg = -1;

	l.off -= locals_offset;

      }

      outn((long)regoff_length(l)); outsep();

      out_regoff(l);

      break;

    }

    default:

      failer("unexpected locate val");

  }

  d_outnl();

  return;

}

static int dw_eval_exp

(exp e, int line_started)

{

  if (line_started)

    outsep();

  else {

    out8();

    line_started = 1;

  }

  switch (name(e)) {

    case name_tag:

    case cont_tag:

    case contvol_tag:

    case reff_tag: {

      loc_s l;

      locate_param = extra_deref = no_location = 0;

      l = find_loc(e);

      if (no_location || extra_deref)

	failer("value unobtainable by DWARF expression");

      switch (l.key) {

	case L_INREG: {

	  out_inreg(l.reg, extra_deref);

	  break;

	}

	case L_REGOFF: {

	  out_regoff(l);

	  break;

	}

	case L_GLOB: {

	  out_glob(l);

	  d_outnl();

	  line_started = 0;

	  break;

	}

	case L_INDIRECT: {

	  out_indirect(e);

	  break;

	}

      }

      break;

    }

    case val_tag:

    case null_tag: {

      if (isbigval(e)) {

	flt64 x;

	int ov;

	x = flt_to_f64(no(e), is_signed(sh(e)), &ov);

	outn((long)(is_signed(sh(e))? DW_OP_const8s : DW_OP_const8u)); d_outnl();

	out32(); outn((long)(x.small)); outsep(); outn((long)(x.big)); d_outnl();

	line_started = 0;

      }

      else

      if (no(e) >= 0 && no(e) < 32)

	outn((long)(DW_OP_lit0 + no(e)));

      else

      if (is_signed(sh(e))) {

	outn((long)DW_OP_consts); outsep();

	sleb128((long)no(e));

      }

      else {

	outn((long)DW_OP_constu); outsep();

	uleb128((unsigned long)no(e));

      }

      break;

    }

    case plus_tag:

    case offset_add_tag: {

      line_started = dw_eval_exp(son(e), line_started);

      if (name(bro(son(e))) == val_tag && !is_signed(sh(e)) && !isbigval(bro(son(e)))) {

	if (line_started)

	  outsep();

	else {

	  out8();

	  line_started = 1;

	}

	outn((long)DW_OP_plus_uconst); outsep();

	uleb128((unsigned long)no(e));

      }

      else {

	line_started = dw_eval_exp(bro(son(e)), line_started);

	if (line_started)

	  outsep();

	else {

	  out8();