WebSVN – tendra.SVN – Diff – /branches/tendra5/src/installers/hppa/common/locate.c

+/*
+ * 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.
 */
 /*
 $Log: locate.c,v $
  * Revision 1.1.1.1  1998/01/17  15:56:03  release
  * First version to be checked into rolling release.
+ *
  * Preperation for August 25 Glue release
+ *
  * Revision 3.4  1995/08/25  09:48:02  wfs
  * register synonyms changed. additional cases in "boff" to deal
  * with the offsets of callees
  *
  * Revision 3.4  1995/08/25  09:48:02  wfs
  * register synonyms changed. additional cases in "boff" to deal
  * with the offsets of callees
+ *
  * Revision 3.1  95/04/10  16:27:08  16:27:08  wfs (William Simmonds)
  * Apr95 tape version.
  *
  * Revision 3.0  95/03/30  11:18:03  11:18:03  wfs (William Simmonds)
  * Mar95 tape version with CRCR95_178 bug fix.
  *
  * Revision 2.0  95/03/15  15:27:51  15:27:51  wfs (William Simmonds)
  * spec 3.1 changes implemented, tests outstanding.
  *
  * Revision 1.2  95/01/17  17:26:13  17:26:13  wfs (William Simmonds)
  * Changed name of an included header file
  *
  * Revision 1.1  95/01/11  13:11:08  13:11:08  wfs (William Simmonds)
  * Initial revision
  *
 */
 #define HPPATRANS_CODE
 /* locate.c
 #include "locate.h"
 /* decodes x to give a baseoff suitable for xxxx_ins functions */
 baseoff boff
-    PROTO_N ( ( e ) )
-    PROTO_T ( exp e )
+(exp e)
+{
   int n = no(e);
   int b = n & 0x3f;
   baseoff an;
   if (isglob(e))
+  {
     /* bro() is index in main_globals */
     dec *gl = brog(e);
     long sno = gl->dec_u.dec_val.sym_number;
-    an.base = -(sno + 1);
+    an.base = - (sno + 1);
     an.offset = 0;
+  }
-  else if (name(son(e))==caller_name_tag)
+  else if (name(son(e)) ==caller_name_tag)
+  {
      int n = no(e);
      an.base = SP;
-     an.offset = -(n>>3);
+     an.offset = - (n>>3);
+  }
   else if (isparam(e))
+  {
      /* parameter */
      assert(name(son(e)) == clear_tag);
+     }
      else
+     {
 	an.base = EP;
+     }
-     if (name(son(e))==formal_callee_tag)
+     if (name(son(e)) ==formal_callee_tag)
+     {
 	an.offset=(no(son(e))-callees_offset)>>3;/* outermost ()'s for gcc */
+     }
      else
+     {
+     }
+  }
   else if (b == GR17)
+  {
      /* locally declared */
      an.base = EP;
-     an.offset = ((n-b)>>4)-(locals_offset>>3);
+     an.offset = ((n-b) >>4) - (locals_offset>>3);
+  }
   else if (b == EP)
+  {
     /* on stack temps (should not happen) */
     an.base = EP;
 #if 1
   /* +++ obsolete */
   else if (b == 32)
+  {
     /* global names */
-    an.base = -((n - b) >> 6);
+    an.base = - ((n - b) >> 6);
     an.offset = 0;
+  }
   else if (b == 33)
+  {
     /* local data label: LDNNNN */
  /*
   * locate differs from locate1 only in that it looks to see e has already
   * been evaluated somehow
   */
-where locate PROTO_S ( ( exp, space, shape, int ) ) ;
+where locate(exp, space, shape, int);
  /*
   * finds the address of e using shape s; sp gives available t-regs for any
   * inner evaluation. dreg is historical.
   */
 where locate1
-    PROTO_N ( ( e, sp, s, dreg ) )
-    PROTO_T ( exp e X space sp X shape s X int dreg )
+(exp e, space sp, shape s, int dreg)
+{
   ash a;
   ans aa;
   where wans;
 #if 0				/* causes core dump spec/espresso/set.c */
-  FULLCOMMENT3("locate1: %s, %s, dreg=%d", (int)tag_name(name(e)), (int)sh_name(name(s)), dreg);
+  FULLCOMMENT3("locate1: %s, %s, dreg=%d",(int)tag_name(name(e)), (int)sh_name(name(s)), dreg);
-  FULLCOMMENT4("        space=(%ld,%ld) no(e)=%d no(son(e))=%d", sp.fixed, sp.flt, no(e), no(son(e)));
+  FULLCOMMENT4("        space= (%ld,%ld) no(e) =%d no(son(e)) =%d", sp.fixed, sp.flt, no(e), no(son(e)));
 #endif
   a = ashof(s);
 /*
   while (name(e) == diag_tag || name(e) == fscope_tag || name(e) == cscope_tag)
   {
     e = son(e);
+  }
 */
   switch (name(e))
+  {
       bool var = isvar(dc);
       /* this a locally declared name ... */
       if (props(dc) & defer_bit)
+      {
 	/*
 	 * ... it has been identified with a simple expression which is better
 	 * evaluated every time
 	 */
 	where w;
+	}
 	else
+	{
 	  instore is;
-	  switch ( discrim ( w.answhere ) )
+	  switch (discrim(w.answhere))
+	  {
 	  case notinreg:
+	    {
 	      is = insalt(w.answhere);
 	      is.b.offset += (no(e) / 8);
+      }
       else if (props(dc) & inreg_bits)
+      {
 	/* ... it has been allocated in a fixed point reg */
-	FULLCOMMENT1("locate1: name_tag: fixed point reg%s", (int) (var?" var":""));
+	FULLCOMMENT1("locate1: name_tag: fixed point reg%s",(int)(var?" var":""));
 	if (var)
+	{
 	  setregalt(aa, no(dc));
+	}
 	freg fr;
 	FULLCOMMENT("locate1: name_tag: fixed point reg");
 	fr.fr = no(dc);
-	fr.dble = ( a.ashsize==64 ? 1 : 0 );
+	fr.dble = (a.ashsize==64 ? 1 : 0);
 	setfregalt(aa, fr);
+      }
       else
+      {
 	/* ... it is in memory */
 	instore is;
-	if ( var || (name(sh(e)) == prokhd &&
+	if (var || (name(sh(e)) == prokhd &&
-		    (son(dc) == nilexp || IS_A_PROC(son(dc)) )))
+		   (son(dc) == nilexp || IS_A_PROC(son(dc)))))
+	{
 	  is.adval = 1;
+	}
 	else
+	{
 	  is.adval = 0;
+	}
 	is.b = boff(dc);
 #if USE_BITAD
-	if (a.ashalign == 1 && (var || name(sh(e)) != ptrhd))
+	if (a.ashalign == 1 && (var || name(sh(e))!= ptrhd))
 	  /* some bit field */
+	{
 	  is.b.offset = (is.b.offset << 3) + no(e);
 	  setbitadalt(aa, is);
+	}
       /*
        * answer is going to be wsum displaced by integer result of evaluating
        * bro(sum)
        */
-      switch (discrim ( asum ) )
+      switch (discrim(asum))
+      {
       case notinreg:
+	{
 	  is = insalt(asum);
 	  if (is.adval)
+	    }
 	    nsp = guardreg(b.base, sp);
 	    shift=no(bro(son(bro(sum))));
-	    if ( name(bro(sum))==offset_mult_tag && name(bro(son(bro(sum))))==val_tag && ( shift==0 || shift==2 || shift==4 ) )
+	    if (name(bro(sum)) ==offset_mult_tag && name(bro(son(bro(sum)))) ==val_tag && (shift==0 || shift==2 || shift==4))
+	    {
 	       addend=reg_operand(son(bro(sum)),nsp);
 	       if (dreg == 0)
 		  dreg = getreg(nsp.fixed);
-	       rrr_ins(shift==0 ? i_add : (shift==2 ? i_sh1add : i_sh2add),                           c_,addend,b.base,dreg);
+	       rrr_ins(shift==0 ? i_add :(shift==2 ? i_sh1add : i_sh2add),                           c_,addend,b.base,dreg);
+	    }
 	    else
+	    {
 	       addend = reg_operand(bro(sum), nsp);
 	       /* evaluate the displacement ... */
       if (name(bro(sum)) == env_offset_tag ||
 	  name(bro(sum)) == general_env_offset_tag)
+      {
 	  is.b.base = ind;
 	  is.b.offset = frame_offset(son(bro(sum)));
       }
       else
+      {
 	 shift=no(bro(son(bro(sum))));
-	 if ( name(bro(sum))==offset_mult_tag && name(bro(son(bro(sum))))==val_tag && ( shift==0 || shift==2 || shift==4 ) )
+	 if (name(bro(sum)) ==offset_mult_tag && name(bro(son(bro(sum)))) ==val_tag && (shift==0 || shift==2 || shift==4))
+	 {
 	    addend=reg_operand(son(bro(sum)),nsp);
 	    if (dreg == 0)
 	       dreg = getreg(nsp.fixed);
-	    rrr_ins(shift==0 ? i_add : (shift==2 ? i_sh1add : i_sh2add),                           c_,addend,ind,dreg);
+	    rrr_ins(shift==0 ? i_add :(shift==2 ? i_sh1add : i_sh2add),                           c_,addend,ind,dreg);
 	 }
 	 else
+	 {
 	    addend = reg_operand(bro(sum), nsp);
 	    if (dreg == 0)
 	 is.b.base = dreg;
 	 is.b.offset = 0;
+      }
       is.adval = 1;
       setinsalt(aa, is);
       wans.answhere = aa;
       wans.ashwhere = a;
       /* ... and deliver literal base_offset */
       keepexp(e, aa);
       return wans;
     }				/* end add_ptr */
       instore isa;
       isa.adval = 1;
       sum = bro(sum);
       if (name(sum) == val_tag)
       {
 	instore isa;
 	isa.b.base = ind;
 	isa.b.offset = -no(e);
 	setinsalt(aa, isa);
+      }
       else
       {
 	if (dreg == 0)
 	   dreg = getreg(sp.fixed);
 	rrr_ins(i_sub,c_,ind,reg_operand(sum,guardreg(ind,sp)),dreg);
 	isa.b.base = dreg;
 	isa.b.offset = 0;
       wans = locate(son(e), sp, sh(son(e)), 0);
 #if USE_BITAD
       bitfield = ((name(sh(e)) == ptrhd) && (al1(sh(e)) == 1));
 #endif
-      switch ( discrim ( wans.answhere ) )
+      switch (discrim(wans.answhere))
+      {
       case notinreg:
+	{
 	  isa = insalt(wans.answhere);
 	  if (!isa.adval)
 	    ld_ins(i_lw,0,isa.b,reg);
 	    isa.b.offset = 0;
 	    isa.b.base = reg;
 	    isa.adval = 1;
 	  }
 	  /*  ... and add appropriate displacement to give result  */
 #if USE_BITAD
 	  if (bitfield)
+	  {
 	    isa.b.offset <<= 3;
 	    isa.b.offset += no(e);
 	    setbitadalt(wans.answhere, isa);
 	  }
 	  else
 #endif
 	  {
 	    isa.b.offset += no(e) / 8;
 	    setinsalt(wans.answhere, isa);
 	    keepexp(e, wans.answhere);
+	  }
-       	  break ;
+       	  break;
+	}
 #if USE_BITAD
       case bitad:
+	{
 	  isa = bitadalt(wans.answhere);
 	    fail("no var bit selection");
+	  }
 	  /* wans is a literal bit address */
 	  isa.b.offset += no(e);
 	  setbitadalt(wans.answhere, isa);
 	  break;
 	}
 #endif
       case inreg:
+	{
 	  /* wans is a pointer in a register */
 	  isa.b.base = regalt(wans.answhere);
 	  isa.adval = 1;
 #if USE_BITAD
 	  if (bitfield)
 	  {
 	    isa.b.offset = no(e);
 	    setbitadalt(wans.answhere, isa);
+	  }
 	  else
 #endif
       /*
        * answer is going to be the contents of address represented by fc
        */
-      FULLCOMMENT1("locate1: cont[vol]_tag: %s", (int)ANSDISCRIM_NAME( discrim ( ason ) ));
+      FULLCOMMENT1("locate1: cont[vol]_tag: %s",(int)ANSDISCRIM_NAME(discrim(ason)));
-      switch ( discrim ( ason ) )
+      switch (discrim(ason))
+      {
       case notinreg:
+	{
 	  isa = insalt(ason);
 	  if (isa.adval)
 	    reg = getreg(sp.fixed);
 	    ld_ins(i_lw,1,isa.b,reg);
 	    isa.b.base = reg;
 	    isa.b.offset = 0;
 	    setinsalt(aa, isa);
-	    if (name(e) != contvol_tag && fc.ashwhere.ashalign != 1)
+	    if (name(e)!= contvol_tag && fc.ashwhere.ashalign != 1)
 	      keepexp(e, aa);
+	  }
 #if USE_BITAD
 	  if (fc.ashwhere.ashalign == 1)	/* ... adjust for bit contents */
+	  {
       /*
        * answer is wans displace literally by no(e); it should always be a
        * literal store address
        */
-      switch ( discrim ( wans.answhere ) )
+      switch (discrim(wans.answhere))
+      {
       case notinreg:
+	{
 	  isa = insalt(wans.answhere);
 #if USE_BITAD
       return wans;
+    }
+  }
+}
 where locate
-    PROTO_N ( ( e, sp, s, dreg ) )
-    PROTO_T ( exp e X space sp X shape s X int dreg )
+(exp e, space sp, shape s, int dreg)
+{
   ans ak;
   where w;
   ak = iskept(e);
-  if ( discrim ( ak ) == inreg && (regalt(ak) == 0))
+  if (discrim(ak) == inreg && (regalt(ak) == 0))
+  {
     w = locate1(e, sp, s, dreg);
+  }
   else
+  {

Subversion Repositories tendra.SVN

(root)/branches/tendra5/src/installers/hppa/common/locate.c – Rev 5 → 6