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.

*/

/*

translat.c,v

 * Revision 1.8  1996/09/06  10:38:21  wfs

 * bug fixes to "offset.pl" and cosmetic changes to the dynamic initialization

 * code.

 *

 * Revision 1.7  1996/09/05  11:05:13  wfs

 * "dynamic_init" boolean variable removed - must always be considered true.

 *

 * Revision 1.6  1996/08/30  09:02:35  wfs

 * Various fixes of bugs arising from avs and pl_tdf tests.

 *

 * Revision 1.5  1996/03/22  13:34:14  wfs

 * Corrections to the dynamic initialization stuff in translat.c + bad

 * needscan.c code deleted.

 *

 * Revision 1.4  1996/01/30  15:36:32  wfs

 * Added the dynamic initialization files "dyn_begin.s" and "dyn_end.s" to

 * the hppatrans repository. The bl_install and bl_update scripts were

 * expanded to deal with these new "initcode" files.

 *

 * Revision 1.3  1995/12/19  16:52:54  wfs

 * Reinstated the "__main" call and a ".CODE" directive when producing gdb

 * diagnostic code.

 *

 * Revision 1.2  1995/12/18  13:12:42  wfs

 * Put hppatrans uder cvs control. Major Changes made since last release

 * include:

 * (i) PIC code generation.

 * (ii) Profiling.

 * (iii) Dynamic Initialization.

 * (iv) Debugging of Exception Handling and Diagnostics.

 *

 * Revision 5.10  1995/10/25  14:37:12  wfs

 * Removed references to nonexistant diag_info of unused static procs.

 *

 * Revision 5.9  1995/10/20  14:15:44  wfs

 * gcc compilation changes.

 *

 * Revision 5.8  1995/10/16  14:43:24  wfs

 * *** empty log message ***

 *

 * Revision 5.7  1995/10/09  12:54:58  wfs

 * Cosmetic changes.

 *

 * Revision 5.6  1995/10/05  09:03:06  wfs

 * Refinements to procedure translation ordering - can now translate

 * according to source file ordering (for XDB) or can translate global

 * procedures first (aids compilation and linking of large programs such

 * as tdfc's "trans_unit.c").

 *

 * Revision 5.5  1995/09/27  13:42:43  wfs

 * Changes to "translate_capsule()". Can now more easily choose the order

 * of procedure translation - necessary for XDB diagnostics. Tidied up.

 *

 * Revision 5.4  1995/09/26  12:52:00  wfs

 * Removal of some temporary code related to XDB diagnostics.

 *

 * Revision 5.3  1995/09/25  10:59:21  wfs

 * Added "#ifdef _SYMTAB_INCLUDED" provisios around any code which refers

 * to "hpux-symtab.h". We cannot legally distribute this header file.

 *

 * Revision 5.2  1995/09/21  14:13:36  wfs

 * Removed a superfluous printf.

 *

 * Revision 5.1  1995/09/15  13:20:41  wfs

 * Minor name changes to avoid conflict with variables in system

 * headers during gcc compilation.

 *

 * Revision 5.0  1995/08/25  13:42:58  wfs

 * Preperation for August 25 Glue release

 *

 * Revision 3.3  1995/08/25  10:37:30  wfs

 * "find_tg" added. Changes to the diagnostics interface. Cosmetic

 * changes. Register allocation is done differently now.

 *

 * Revision 3.3  1995/08/25  10:37:30  wfs

 * "find_tg" added. Changes to the diagnostics interface. Cosmetic

 * changes. Register allocation is done differently now.

 *

 * Revision 3.1  95/04/10  16:28:36  16:28:36  wfs (William Simmonds)

 * Apr95 tape version.

 *

 * Revision 3.0  95/03/30  11:19:09  11:19:09  wfs (William Simmonds)

 * Mar95 tape version with CRCR95_178 bug fix.

 *

 * Revision 2.0  95/03/15  15:29:03  15:29:03  wfs (William Simmonds)

 * spec 3.1 changes implemented, tests outstanding.

 *

 * Revision 1.3  95/02/10  11:38:54  11:38:54  wfs (William Simmonds)

 * Rewrote the inner level initializations previously handled by calls

 * to evaluated().

 *

 * Revision 1.2  95/01/17  17:31:02  17:31:02  wfs (William Simmonds)

 * Changed name of an included header file.

 *

 * Revision 1.1  95/01/11  12:59:09  12:59:09  wfs (William Simmonds)

 * Initial revision

 *

*/

#define HPPATRANS_CODE

/*

 *  Translation is controlled by translate() in this module. *  Code generation follows the following phases:

 *

 *  1. The TDF is read in, applying bottom-up optimisations.

 *  2. Top-down optimisations are performed.

 *  3. Register allocation is performed, and TDF idents introduced

 *     so code generation can be performed with no register spills.

 *  4. Code is generated for each procedure, and global declarations processed.

 *  5. Currently assembler source is generated directly, and the

 *     assembler optimiser (as -O) used for delay slot filling,

 *     instruction scheduling and peep-hole optimisation.

 *

 *  In a little more detail:

 *

 *  1) During the TDF reading process for tag declarations and tag

 *  definitions, applications of tokens are expanded as they are

 *  encountered, using the token definitions.  Every token used must have

 *  been previously defined in the bitstream.

 *

 *  The reading of the tag definitions creates a data structure in memory

 *  which directly represents the TDF.  At present, all the tag definitions

 *  are read into memory in this way before any further translation is

 *  performed.  This will shortly be changed, so that translation is

 *  performed in smaller units.  The translator is set up already so that

 *  the change to translate in units of single global definitions (or

 *  groups of these) can easily be made.

 *

 *  During the creation of the data structure bottom-up optimisations

 *  are performed.  These are the optimisations which can be done when a

 *  complete sub-tree of TDF is present, and are independent of the context

 *  in which the sub-tree is used.  They are defined in check.c and

 *  check_id.c.  These optimisation do such things as use the commutative

 *  and associative laws for plus to collect together and evaluate

 *  constants.  More ambitious examples of these bottom-up optimisations

 *  include all constant evaluation, elimination of inaccessible code, and

 *  forward propagation of assignments of constants.

 *

 *  2) After reading in the TDF various optimisations are performed which

 *  cannot be done until the whole context is present.  For example,

 *  constants cannot be extracted from a loop when we just have the loop

 *  itself, because we cannot tell whether the variables used in it are

 *  aliased.

 *

 *  These optimisations are invoked by opt_all_exps which is defined in

 *  indep.c.  They include extraction of constants from loops, common

 *  expression elimination on them and strength reduction for indexing.

 *

 *  3) Allocatable registers are partitioned into two sets, the s regs

 *  which are preserved over calls, and the t regs which are not.

 *

 *  The TDF is scanned introducing TDF idents so that expressions can be

 *  evaluated within the available t regs with no spills.  These new idents

 *  may be later allocated to a s reg later, if the weighting algorithm

 *  (below) considers this worth while.  Otherwise they will be on the stack.

 *

 *  Information is collected to help in global register allocation.  During

 *  a forward recursive scan of the TDF the number of accesses to each

 *  variable is computed (making assumptions about the frequency of

 *  execution of loops).  Then on the return scan of this recursion, for

 *  each declaration, the number of registers which must be free for it to

 *  be worthwhile to use a register is computed, and put into the TDF as

 *  the"break" point.  The procedures to do this are defined in weights.c.

 *

 *  Suitable idents not alive over a procedure call are allocated to a t reg,

 *  and others to s regs.  At the same time stack space requirements are

 *  calculated, so this is known before code for a procedure is generated.

 *

 *  4) Finally the code is generated without register spills.  The code is

 *  generated by make_code() in makecode.c, and make_XXX_code() in proc.c.

 *

 *  Note that procedure inlining and loop unrolling optimisations are not

 *  currently implemented.  Library procedures such as memcpy() and

 *  strcpy() are not treated specially.  Integer multiply, divide and

 *  remainder use the standard support procedures .mul, .div, .rem and

 *  unsigned variants.

 */

#include "config.h"

#include "myassert.h"

#include "flpt.h"

#include "frames.h"

#include "expmacs.h"

#include "tags.h"

#include "exptypes.h"

#include "exp.h"

#include "shapemacs.h"

#include "tempdecs.h"

#include "weights.h"

#include "proctypes.h"

#include "procrec.h"

#include "regalloc.h"

#include "codehere.h"

#include "makecode.h"

#include "eval.h"

#include "toktypes.h"

#include "flags.h"

#include "basicread.h"

#include "tags.h"

#include "bitsmacs.h"

#include "needscan.h"

#include "getregs.h"

#include "regmacs.h"

#include "labels.h"

#include "xalloc.h"

#include "comment.h"

#include "hppadiags.h"

#include "installglob.h"

#include "externs.h"

#include "out.h"

#include "translat.h"

#include "version.h"

#include "inst_fmt.h"

#include "optimise.h"

#include "getregs.h"

#include "special.h"

#include "oprators.h"

#include "time.h"

extern dec *diag_def;

int optim_level;		/* optimisation level from -O# option */

int maxfix_tregs;		/* the number of t regs allocatable */

char *proc_name;

char export[128];

labexp current,first;

int nexps;

extern baseoff boff(exp);

extern int res_label;

FILE *outf = NULL;/* assembler output file */

dec **main_globals;

int main_globals_index;

procrec *procrecs,*cpr;

dec *diag_def = NULL ;	/* diagnostics definition */

#define is_zero(e)is_comm(e)

#define TRANSLATE_GLOBALS_FIRST 1

ash ashof

(shape s)

{

  ash a;

  a.ashsize = shape_size(s);

  a.ashalign = shape_align(s);

  return a;

}

/* is shape 'sha' of unknown size? */

static bool varsize

(shape sha)

{

  switch (name(sha))

  {

    case cpdhd:

    {

      shape t = son(sha);

      if (t == nilexp)

	return 1;

      if (varsize(sh(t)))

	return 1;

      while (!last(t))

      {

	t = bro(t);

	if (varsize(sh(t)))

	  return 1;

      }

      return 0;

    }

  case nofhd:

    return 1;

  default:

    return 0;

  }

}

void insection

(enum section s)

{

  static enum section current_section = no_section;

  if (s == current_section)

    return;

  current_section = s;

    switch (s)

    {

       case shortdata_section:

       {

	 outs("\t.SHORTDATA\n");

	 return;

       }

       case data_section:

       {

	 outs("\t.DATA\n");

	 return;

       }

       case text_section:

       {

	 outs("\t.CODE\n");

	 return;

       }

       case bss_section:

       case shortbss_section:

       {

	  if (gcc_assembler)

	  {

	     /* gcc does not recognise .BSS directive */

	     outs("\t.SPACE\t$PRIVATE$\n");

	     outs("\t.SUBSPA\t$BSS$\n");

	  }

	  else

	     outs("\t.BSS\n");

	  return;

       }

       case no_section:

       {

	  current_section = no_section;

	  return;

       }

       case rodata_section:

       default: {}

    }

    failer("bad \".section\" name");

}

void mark_unaliased

(exp e)

{

  exp p = pt(e);

  bool ca = 1;

  assert(!separate_units);	/* don't know about aliases in other units */

  while (p != nilexp && ca)

  {

     if (bro(p) == nilexp)

     {

	ca = 0;

     }

     else

     {

	if (!(last(p) && name(bro(p)) == cont_tag) &&

  	    !(!last(p) && last(bro(p)) && name(bro(bro(p))) == ass_tag))

	   ca = 0;

     }

     p = pt(p);

  };

  if (ca)

    setcaonly(e);

  return;

}

baseoff find_tg

(char *n)

{

   int i;

   for (i=0;i<main_globals_index;i++)

   {

      exp tg = main_globals[i] -> dec_u.dec_val.dec_exp;

      char *id = main_globals[i] -> dec_u.dec_val.dec_id;

      if (strcmp(id,n) ==0)

      {

	 return boff(tg);

      }

   }

   failer("Extension name not declared ");

   exit(EXIT_FAILURE);

}

/* translate the TDF */

void translate_capsule

(void)

{

  int noprocs;

  int procno;

  int i;

  dec *crt_def,**proc_def_trans_order;

  int *src_line=0,next_proc_def;

  space tempregs;

  int r;

  static int capn=0;

  capn++;

  /* mark the as output as TDF compiled */

  outs("\t;  Produced by the DERA TDF->HP PA-RISC translator ");

  fprintf(outf,"%d.%d",MAJOR,MINOR);

  outnl();

  outnl();

  outnl();

  outs("\t.SPACE  $TEXT$,SORT=8\n");

  outs("\t.SUBSPA $CODE$,QUAD=0,ALIGN=8,ACCESS=44,CODE_ONLY,SORT=24\n");

  outnl();

  outs("\t.SPACE  $PRIVATE$,SORT=16\n");

  outs("\t.SUBSPA $DATA$,QUAD=1,ALIGN=8,ACCESS=31,SORT=16\n\n");

  outs("\t.IMPORT\t$$dyncall,CODE\n");

  if (do_profile)

     outs("\t.IMPORT\t_mcount,CODE\n");

  outs("\t.IMPORT\t$global$,DATA\n");

  outnl();

#if 0

  outs("LB\t.MACRO\tTARGET\n");

  outs("\tldil\tL'TARGET,%r1\n");

  outs("\tldo\tR'TARGET(%r1),%r1\n");

  outs("\tbv\t0(%r1)\n");

  outs("\tnop\n");

  outnl();

#endif

  /* Begin diagnostics if necessary. */

  if (diagnose)

  {

     outs("\t.CODE\n");

     outnl();

     init_stab_aux();

     outnl();

     outnl();

  }

  setregalt(nowhere.answhere, 0);

  nowhere.ashwhere.ashsize = 0;

  nowhere.ashwhere.ashsize = 0;

  if (!diagnose)

     opt_all_exps();  /* optimise */

  /* mark static unaliased; count procs */

  noprocs = 0;

  for (crt_def = top_def; crt_def != (dec *)0; crt_def = crt_def->def_next)

  {

    exp crt_exp = crt_def->dec_u.dec_val.dec_exp;

    exp scexp = son(crt_exp);

    if (scexp != nilexp)

    {

      if (!diagnose && !separate_units &&

	  !crt_def->dec_u.dec_val.extnamed && isvar(crt_exp))

	mark_unaliased(crt_exp);

      if (name(scexp) == proc_tag || name(scexp) == general_proc_tag)

      {

	noprocs++;

	if (!strncmp("__I.TDF",crt_def->dec_u.dec_val.dec_id,7))

	{

	   char *s;

	   static char dyn = 0;

	   if (!dyn)

	   {

	      outs("\t.SPACE  $PRIVATE$,SORT=16\n");

	      outs("\t.SUBSPA $DYNDATA$,QUAD=1,ALIGN=4,ACCESS=31,SORT=16\n");

	      outnl();

	      dyn = 1;

	   }

	   s = (char*)xcalloc(64,sizeof(char));

	   sprintf(s,"_GLOBAL_$I%d",capn);

	   strcat(s,crt_def->dec_u.dec_val.dec_id+7);

	   crt_def->dec_u.dec_val.dec_id = s;

	   if (!gcc_assembler)

	      fprintf(outf,"\t.WORD\t%s\n",s);

	}

      }

    }

  };

  outnl();

  /* alloc memory */

  procrecs = (procrec *)xcalloc(noprocs, sizeof(procrec));

  proc_def_trans_order = (dec**)xcalloc(noprocs, sizeof(dec*));

  if (xdb)

  {

     src_line = (int*)xcalloc(noprocs,sizeof(int));

  }

  /* number proc defs */

  procno = 0;

  for (crt_def = top_def; crt_def != (dec *)0; crt_def = crt_def->def_next)

  {

    exp crt_exp = crt_def->dec_u.dec_val.dec_exp;

    if (son(crt_exp)!= nilexp && (name(son(crt_exp)) == proc_tag ||

				    name(son(crt_exp)) == general_proc_tag))

    {

      procrec *pr = &procrecs[procno];

      proc_def_trans_order[procno] = crt_def;

      if (xdb)

      {

	 /* Retrieve diagnostic info neccessary to comply with xdb's

	    requirement that procedures be compiled in source file order. */

	 diag_descriptor * dd =  crt_def -> dec_u.dec_val.diag_info;

	 if (dd != (diag_descriptor*)0)

	 {

	    sourcemark *sm = &dd -> data.id.whence;

	    src_line[procno] = sm->line_no.nat_val.small_nat;

	 }

	 else

	    src_line[procno] = 0;

      }

      pr->nameproc = bro(crt_exp);

      no(son(crt_exp)) = procno++;/* index into procrecs in no(proc) */

    }

  }

  /*

   * Scan to put everything in HP_PA form, and calculate register and stack

   * space needs.

   */

  /*

   *      First work out which fixed point t-regs, i.e. those not preserved

   *  over calls, can be used. This needs to be done before scan() which

   *  adds idents so temp reg needs are within available temp reg set.

   *

   */

  /* initial reg sets */

  tempregs.fixed = PROC_TREGS;

  tempregs.flt = PROC_FLT_TREGS;

  /* GR0,GR1,SP,DP are NEVER allocatable */

  tempregs.fixed |= RMASK(GR0);

  tempregs.fixed |= RMASK(GR1);

  tempregs.fixed |= RMASK(SP);

  tempregs.fixed |= RMASK(DP);

  if (PIC_code)

  {

     tempregs.fixed |= RMASK(GR19); /* %r19 is reserved in PIC mode */

  }

  /* count t fixed point regs we can use, and set the global maxfix_tregs */

  maxfix_tregs = 0;

  for (r = R_FIRST; r <= R_LAST; r++)

  {

    /* bit clear means allocatable */

    if (IS_TREG(r) && (tempregs.fixed & RMASK(r)) == 0)

      maxfix_tregs++;

  }

  comment4("maxfix_tregs=%d(%#x) maxfloat_tregs=%d(%#x)",

	   maxfix_tregs, tempregs.fixed, MAXFLOAT_TREGS, tempregs.flt);

  /* scan all the procs, to put everything in HP_PA form */

  nexps = 0;

  for (crt_def = top_def; crt_def != (dec *)0; crt_def = crt_def->def_next)

  {

    exp crt_exp = crt_def->dec_u.dec_val.dec_exp;

    if (son(crt_exp)!= nilexp && (name(son(crt_exp)) == proc_tag ||

				    name(son(crt_exp)) == general_proc_tag))

    {

      procrec *pr = &procrecs[no(son(crt_exp))];

      exp *st = &son(crt_exp);

      cpr = pr;

      cpr->Has_ll = 0;

      cpr->Has_checkalloc = 0;

      builtin=0;

      pr->needsproc = scan(st, &st);

      pr->callee_sz = callee_sz;

      pr->needsproc.builtin=builtin;

    }

  }

  /* calculate the break points for register allocation */

  for (crt_def = top_def; crt_def != (dec *)0; crt_def = crt_def->def_next)

  {

    exp crt_exp = crt_def->dec_u.dec_val.dec_exp;

    if (son(crt_exp)!= nilexp && (name(son(crt_exp)) == proc_tag ||

				    name(son(crt_exp)) == general_proc_tag))

    {

      procrec *pr = &procrecs[no(son(crt_exp))];

      needs * ndpr = & pr->needsproc;

      long pprops = (ndpr->propsneeds);

      bool leaf = (pprops & anyproccall) == 0;

      weights w;

      spacereq forrest;

      int freefixed, freefloat;

      int No_S = (!leaf && proc_uses_crt_env(son(crt_exp)) && proc_has_lv(son(crt_exp)));

      proc_name = crt_def->dec_u.dec_val.dec_id;

      setframe_flags(son(crt_exp),leaf);

      /* free s registers = GR3,GR4,..,GR18 */

      freefixed = 16;

      if (Has_fp) /* Has frame pointer */

      {

	 freefixed--;

	 /* reserve GR3 as frame pointer (i.e. points to bottom of stack) */

      }

      if (Has_vsp) /* Has variable stack pointer */

      {

	 freefixed--;

	 /* reserve GR4 for use as copy of the original stack pointer */

      }

      if (is_PIC_and_calls)

      {

	 freefixed--;

	 /* best reserve GR5 for use as a copy of GR19 */

      }

      if (Has_vcallees)

      {

	 pr->callee_sz = 0; /*  Don't know callee_sz  */

      }

      real_reg[1] = GR4;

      real_reg[2] = GR5;

      if (Has_fp)

      {

	 if (is_PIC_and_calls && !Has_vsp)

	    real_reg[2] = GR4;

      }

      else

      {

	 if (Has_vsp)

	 {

	    if (is_PIC_and_calls)

	       real_reg[2] = GR3;

	    else

	       real_reg[1] = GR3;

	 }

	 else

	 if (is_PIC_and_calls)

	 {

	    real_reg[1] = GR3;

	    real_reg[2] = GR4;

	 }

      }

      /* +++ create float s regs for leaf? */

      freefloat = 0;		/* none, always the same */

      /* estimate usage of tags in body of proc */

      if (!No_S)

	 w = weightsv(UNITWEIGHT, bro(son(son(crt_exp))));

      /* reg and stack allocation for tags */

      forrest = regalloc(bro(son(son(crt_exp))), freefixed, freefloat, 0);

      /* reg and stack allocation for tags */

      pr->spacereqproc = forrest;

      set_up_frame(son(crt_exp));

    }

  }

  /*  Set up main_globals and output global definitions. */

  i = 0;

  for (crt_def=top_def; crt_def!= (dec*)0; crt_def=crt_def->def_next)

  {

     i++;

  }

  main_globals_index = i;

  main_globals = (dec**)xcalloc(main_globals_index,sizeof(dec*));

  i = 0;

  for (crt_def = top_def; crt_def != (dec *)0; crt_def = crt_def->def_next)

  {

     main_globals[i] = crt_def;

     main_globals[i] ->dec_u.dec_val.sym_number = i;

     i++;

  }

  for (crt_def = top_def; crt_def != (dec *)0; crt_def = crt_def->def_next)

  {

     exp tg = crt_def->dec_u.dec_val.dec_exp;

     char *id = crt_def->dec_u.dec_val.dec_id;

     bool extnamed = (bool)crt_def->dec_u.dec_val.extnamed;

     if (son(tg) ==nilexp && no(tg)!=0 && extnamed)

     {

	outs("\t.IMPORT\t");

	outs(id);

	outs(name(sh(tg)) ==prokhd ?(isvar(tg)? ",DATA\n" : ",CODE\n"): ",DATA\n");

     }

     else

     if (son(tg)!= nilexp && (extnamed || no(tg)!= 0))

     {

	if (name(son(tg))!= proc_tag && name(son(tg))!= general_proc_tag)

	{

	   /* evaluate all outer level constants */

	   instore is;

	   long symdef = crt_def->dec_u.dec_val.sym_number + 1;

	   if (isvar(tg))

	      symdef = -symdef;

	   if (extnamed && !(is_zero(son(tg))))

	   {

     	      outs("\t.EXPORT\t");

	      outs(id);

	      outs(",DATA\n");

	   }

	   is = evaluated(son(tg),symdef);

	   if (diagnose)

	   {

	      diag_def = crt_def;

	      stab_global(son(tg), id, extnamed);

	   }

	   if (is.adval)

	   {

	      setvar(tg);

	   }

	}

     }

  }

  /* Uninitialized data local to module. */

  for (crt_def=top_def; crt_def != (dec *)0; crt_def=crt_def->def_next)

  {

     exp tg = crt_def->dec_u.dec_val.dec_exp;

     char *id = crt_def->dec_u.dec_val.dec_id;

     bool extnamed = (bool)crt_def->dec_u.dec_val.extnamed;

     if (son(tg) == nilexp && no(tg)!=0 && !extnamed)

     {

	shape s = crt_def->dec_u.dec_val.dec_shape;

	ash a;

	long size;

	int align;

	a = ashof(s);

	size = (a.ashsize + 7) >> 3;

	align = ((a.ashalign > 32 || a.ashsize > 32)? 8 : 4);

	if (size>8)

	   insection(bss_section);

	else

	   insection(shortbss_section);

	outs("\t.ALIGN\t");

	outn(align);

	outs(id);

	outs("\t.BLOCKZ\t");

	outn(size);

     }

  }

  /* Translate the procedures. */

  if (xdb)

  {

     /*  XDB requires the procedures to be translated in the order

	 that they appear in the c source file.  */

     int n,j;

     for (n=0; n<noprocs; n++)

	for (j=n+1; j<noprocs; j++)

	{

	   if (src_line[n] > src_line[j])

	   {

	      int srcl = src_line[n];

	      dec *pdef;

	      src_line[n] = src_line[j];

	      src_line[j] = srcl;

	      pdef = proc_def_trans_order[n];

	      proc_def_trans_order[n] = proc_def_trans_order[j];

	      proc_def_trans_order[j] = pdef;

	   }

	}

   }

   else

   {

#if TRANSLATE_GLOBALS_FIRST

      /*  Translate the global procedures first.  */

      int fstat = 0, lglob = noprocs-1;

      while (fstat<lglob)

      {