WebSVN – tendra.SVN – Diff – /branches/tendra5/src/installers/680x0/common/trans.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) 1996
     This TenDRA(r) Computer Program is subject to Copyright
     owned by the United Kingdom Secretary of State for Defence
 #include "tags.h"
 #include "utility.h"
 #if have_diagnostics
 #include "xdb_basics.h"
 #endif
-extern dec *sort_decs PROTO_S ( ( dec * ) ) ;
+extern dec *sort_decs(dec *);
-static void output_all_exps PROTO_S ( ( void ) ) ;
+static void output_all_exps(void);
 /*
     INCLUDE DEBUGGING ROUTINES
     These are used to aid in debugging.
 */
 #ifdef EBUG
 /*
 #include <misc/debug>
 */
-void breakpoint PROTO_Z () {}
+void breakpoint(void) {}
 #endif
 #ifndef tdf3
 #include "general_proc.h"
 #include "68k_globals.h"
-int need_dummy_double = 0 ;
+int need_dummy_double = 0;
 #endif
 /*
     LOCAL AND GLOBAL NAME PREFIXES
 */
-char *local_prefix = "L" ;
+char *local_prefix = "L";
-char *name_prefix = "_" ;
+char *name_prefix = "_";
 /*
     EXTERNAL POSITIONS
 */
-static long crt_ext_off = 64 ;
+static long crt_ext_off = 64;
-static long crt_ext_pt = 10 ;
+static long crt_ext_pt = 10;
 /*
     MARK AN EXPRESSION AS BEING STATIC AND UNALIASED
 */
 static void mark_unaliased
-    PROTO_N ( ( e ) )
-    PROTO_T ( exp e )
+(exp e)
+{
-    exp p = pt ( e ) ;
+    exp p = pt(e);
-    bool ca = 1 ;
+    bool ca = 1;
-    while ( p != nilexp && ca ) {
+    while (p != nilexp && ca) {
-	exp q = bro ( p ) ;
+	exp q = bro(p);
-	if ( q == nilexp ) {
+	if (q == nilexp) {
-	    ca = 0 ;
+	    ca = 0;
-	} else if ( !( last ( p ) && name ( q ) == cont_tag ) &&
+	} else if (!(last(p) && name(q) == cont_tag) &&
-		    !( !last ( p ) && last ( q ) &&
+		    !(!last(p) && last(q) &&
-		       name ( bro ( q ) ) == ass_tag ) ) {
+		       name(bro(q)) == ass_tag)) {
-	    ca = 0 ;
+	    ca = 0;
+	}
-	p = pt ( p ) ;
+	p = pt(p);
+    }
-    if ( ca ) setcaonly ( e ) ;
+    if (ca)setcaonly(e);
-    return ;
+    return;
+}
 /*
     PROCESS THE TDF
     This routine gets all the TDF read into the correct operand form
     and applies the dead variable and register allocation analysis.
 */
 void translate_capsule
-    PROTO_Z ()
+(void)
+{
-    dec *d ;
+    dec *d;
     /* Fix procedure handling (copied from trans386) */
     d = top_def;
 #if 0
-    while (d != (dec *) 0) {
+    while (d != (dec *)0) {
     exp crt_exp = d -> dec_u.dec_val.dec_exp;
     exp idval;
-      if (!(d -> dec_u.dec_val.dec_var) && (name(sh(crt_exp)) != prokhd ||
+      if (!(d -> dec_u.dec_val.dec_var) && (name(sh(crt_exp))!= prokhd ||
-           ( idval = son(crt_exp) ,
+          (idval = son(crt_exp),
-             idval != nilexp && name(idval) != null_tag &&
+             idval != nilexp && name(idval)!= null_tag &&
-               name(idval) != proc_tag && name(idval) != general_proc_tag )) ){
+               name(idval)!= proc_tag && name(idval)!= general_proc_tag))) {
 	/* make variable, and change all uses to contents */
         exp p = pt(crt_exp);
         if (d -> dec_u.dec_val.extnamed)
           sh(crt_exp) = f_pointer(f_alignment(sh(crt_exp)));
 	else
           setvar(crt_exp);
         while (p != nilexp) {
           exp np = pt(p);
-          exp* ptr = refto (father(p), p);
+          exp* ptr = refto(father(p), p);
-          exp c = getexp (sh(p), bro(p), last(p), p, nilexp, 0, 0, cont_tag);
+          exp c = getexp(sh(p), bro(p), last(p), p, nilexp, 0, 0, cont_tag);
-          setfather (c, p);
+          setfather(c, p);
-          if (no(p) != 0) {
+          if (no(p)!= 0) {
-            exp r = getexp (sh(p), c, 1, p, nilexp, 0, no(p), reff_tag);
+            exp r = getexp(sh(p), c, 1, p, nilexp, 0, no(p), reff_tag);
             no(p) = 0;
             son(c) = r;
-            setfather (r, p);
+            setfather(r, p);
+          }
           *ptr = c;
           p = np;
+        }
+      }
       d = d->def_next;
+    }
 #endif
-    make_transformations () ;
+    make_transformations();
 #ifndef EBUG
-    opt_all_exps () ;
+    opt_all_exps();
 #endif
     /* Mark static unaliases declarations */
-    if ( !separate_units ) {
+    if (!separate_units) {
-	for ( d = top_def ; d ; d = d->def_next ) {
+	for (d = top_def; d; d = d->def_next) {
-	    exp c = d->dec_u.dec_val.dec_exp ;
+	    exp c = d->dec_u.dec_val.dec_exp;
-	    if ( son ( c ) != nilexp &&
+	    if (son(c)!= nilexp &&
-		 !( d->dec_u.dec_val.extnamed ) && isvar ( c ) ) {
+		 !(d->dec_u.dec_val.extnamed) && isvar(c)) {
-		mark_unaliased ( c ) ;
+		mark_unaliased(c);
+	    }
+	}
+    }
     /* Mark locations for all globals */
-    for ( d = top_def ; d ; d = d->def_next ) {
+    for (d = top_def; d; d = d->def_next) {
-	if ( d->dec_u.dec_val.processed ) {
+	if (d->dec_u.dec_val.processed) {
-	    exp c = d->dec_u.dec_val.dec_exp ;
+	    exp c = d->dec_u.dec_val.dec_exp;
-	    ptno ( c ) = crt_ext_pt++ ;
+	    ptno(c) = crt_ext_pt++;
-	    no ( c ) = crt_ext_off ;
+	    no(c) = crt_ext_off;
-	    crt_ext_off += shape_size ( d->dec_u.dec_val.dec_shape ) ;
+	    crt_ext_off += shape_size(d->dec_u.dec_val.dec_shape);
+	}
+    }
     /* Output all code */
-    output_all_exps () ;
+    output_all_exps();
-    return ;
+    return;
+}
 /*
     TRANSLATE A SINGLE TAG DEFINITION
 */
 void translate_tagdef
-    PROTO_Z ()
+(void)
+{
-    return ;
+    return;
+}
 /*
     TRANSLATE A SINGLE UNIT
 */
 void translate_unit
-    PROTO_Z ()
+(void)
+{
-    if ( separate_units ) {
+    if (separate_units) {
-	dec *d ;
+	dec *d;
-	translate_capsule () ;
+	translate_capsule();
-	d = top_def ;
+	d = top_def;
-	while ( d ) {
+	while (d) {
-	    exp c = d->dec_u.dec_val.dec_exp ;
+	    exp c = d->dec_u.dec_val.dec_exp;
-	    no ( c ) = 0 ;
+	    no(c) = 0;
-	    pt ( c ) = nilexp ;
+	    pt(c) = nilexp;
-	    d = d->def_next ;
+	    d = d->def_next;
+	}
-	crt_repeat = nilexp ;
+	crt_repeat = nilexp;
-	repeat_list = nilexp ;
+	repeat_list = nilexp;
+    }
-    return ;
+    return;
+}
 /*
     ENCODE A PROCEDURE
     The procedure with declaration d, name id, definition c and body s
     is encoded.
 */
 static void code_proc
-    PROTO_N ( ( d, id, c, s ) )
-    PROTO_T ( dec *d X char *id X exp c X exp s )
+(dec *d, char *id, exp c, exp s)
+{
-    diag_global *di = d->dec_u.dec_val.diag_info ;
+    diag_global *di = d->dec_u.dec_val.diag_info;
-    int reg_res = ( has_struct_res ( s ) ? 0 : 1 ) ;
+    int reg_res = (has_struct_res(s)? 0 : 1);
-    int is_ext = ( d->dec_u.dec_val.extnamed ? 1 : 0 ) ;
+    int is_ext = (d->dec_u.dec_val.extnamed ? 1 : 0);
-    area ( ptext ) ;
+    area(ptext);
-    cur_proc_dec = d ;
+    cur_proc_dec = d;
-    cur_proc_callees_size = 0 ;
+    cur_proc_callees_size = 0;
-    cur_proc_has_vcallees = 0 ;
+    cur_proc_has_vcallees = 0;
     /* Code procedure body */
 #if 0
-    if ( name ( s ) == proc_tag )
+    if (name(s) == proc_tag)
-    cproc ( s, id, -1, is_ext, reg_res, di ) ;
+    cproc(s, id, -1, is_ext, reg_res, di);
     else
 #endif
-    gcproc ( s, id, -1, is_ext, reg_res, di) ;
+    gcproc(s, id, -1, is_ext, reg_res, di);
     d -> dec_u.dec_val.index = cur_proc_env_size ; /* for use in constant evaluation */
     output_env_size(d, cur_proc_env_size);
     The constant with declaration d, name id, definition c and body s
     is encoded.
 */
 static void code_const
-    PROTO_N ( ( d ) )
-    PROTO_T ( dec *d )
+(dec *d)
+{
-   exp c = d->dec_u.dec_val.dec_exp ;
+   exp c = d->dec_u.dec_val.dec_exp;
-   exp s = son ( c ) ;
+   exp s = son(c);
-   char *id = d->dec_u.dec_val.dec_id ;
+   char *id = d->dec_u.dec_val.dec_id;
-   diag_global *di = d->dec_u.dec_val.diag_info ;
+   diag_global *di = d->dec_u.dec_val.diag_info;
-   area ( isvar ( c ) ? pdata : ptext ) ;
+   area(isvar(c)? pdata : ptext);
 #ifndef no_align_directives
-   make_instr ( m_as_align4, null, null, 0 ) ;
+   make_instr(m_as_align4, null, null, 0);
 #endif
-   evaluate ( s, L_1 , id, !isvar ( c ), 1, di ) ;
+   evaluate(s, L_1 , id, !isvar(c), 1, di);
+}
 /*
     ENCODE THE CONSTANTS IN const_list
     All auxiliary constants are formed into a list, const_list.  This
     routine applies evaluate to each element of this list.
 */
 static void code_const_list
-    PROTO_Z ()
+(void)
+{
-    while ( const_list != nilexp ) {
+    while (const_list != nilexp) {
-	exp t = const_list ;
+	exp t = const_list;
-	exp s = son ( t ) ;
+	exp s = son(t);
-	bool b = ( name ( s ) != res_tag ) ;
+	bool b = (name(s)!= res_tag);
-	const_list = bro ( const_list ) ;
+	const_list = bro(const_list);
-	if ( name ( s ) == proc_tag || name ( s ) == general_proc_tag ) {
+	if (name(s) == proc_tag || name(s) == general_proc_tag) {
-	    char *id = alloc_nof ( char, 30 ) ;
+	    char *id = alloc_nof(char, 30);
-	    sprintf ( id, "%s%ld", local_prefix, no ( t ) ) ;
+	    sprintf(id, "%s%ld", local_prefix, no(t));
-	    gcproc ( s, null, no ( t ), 0, 1, null ) ;
+	    gcproc(s, null, no(t), 0, 1, null);
 	} else {
-	    area ( b ? pdata : ptext ) ;
+	    area(b ? pdata : ptext);
-	    evaluate ( s, no ( t ), null, b, 0, null ) ;
+	    evaluate(s, no(t), null, b, 0, null);
+	}
+    }
-    return ;
+    return;
+}
 /*
    CONST_READY
    Returns TRUE if it is possible to evaluate the value of the constant now
 */
 static int const_ready
-    PROTO_N ( (e) )
-    PROTO_T ( exp e )
+(exp e)
+{
-  unsigned char  n = name (e);
+  unsigned char  n = name(e);
   if (n == env_size_tag)
-    return (brog(son(son(e))) -> dec_u.dec_val.processed);
+    return(brog(son(son(e))) -> dec_u.dec_val.processed);
   if (n == env_offset_tag)
-    return (ismarked(son(e)));
+    return(ismarked(son(e)));
   if (n == name_tag || son(e) == nilexp)
     return 1;
   e = son(e);
   while (!last(e)) {
     if (!const_ready(e))
       return 0;
     e = bro(e);
+  }
-  return (const_ready(e));
+  return(const_ready(e));
+}
 typedef struct delayedconst{
    dec* This;
    struct delayedconst* next;
-} delayed_const ;
+} delayed_const;
 static delayed_const* delayed_const_list = 0;
 static void eval_if_ready
-    PROTO_N ( ( d ) )
-    PROTO_T ( dec *d )
+(dec *d)
+{
-   exp c = d->dec_u.dec_val.dec_exp ;
+   exp c = d->dec_u.dec_val.dec_exp;
-   if ( const_ready( c ) ) {
+   if (const_ready(c)) {
-      code_const ( d ) ;
+      code_const(d);
+   }
    else {
-      delayed_const* p = (delayed_const*)xmalloc (sizeof(delayed_const));
+      delayed_const* p = (delayed_const*)xmalloc(sizeof(delayed_const));
       p->This = d;
       p->next = delayed_const_list;
       delayed_const_list = p;
+   }
+}
 void eval_delayed_const_list
-    PROTO_Z ()
+(void)
+{
    delayed_const* p;
    bool done = 0;
    while (! done) {
       done = 1;
       for (p = delayed_const_list; p; p = p->next) {
          dec* d = p->This;
-         if ( !d->dec_u.dec_val.processed ) {
+         if (!d->dec_u.dec_val.processed) {
-            exp c = d->dec_u.dec_val.dec_exp ;
+            exp c = d->dec_u.dec_val.dec_exp;
-            if ( const_ready( c ) ) {
+            if (const_ready(c)) {
-               code_const ( d ) ;
+               code_const(d);
-               d->dec_u.dec_val.processed = 1 ;
+               d->dec_u.dec_val.processed = 1;
+            }
             done = 0;
+         }
+      }
+   }
     This routine scans through all the declarations encoding suitably.
 */
 static void output_all_exps
-    PROTO_Z ()
+(void)
+{
-    dec *d = top_def ;
+    dec *d = top_def;
-    if ( diagnose ) d = sort_decs ( d ) ;
+    if (diagnose)d = sort_decs(d);
-    area ( ptext ) ;
+    area(ptext);
     /* Clear any existing output */
-    output_all () ;
+    output_all();
-    free_all_ins () ;
+    free_all_ins();
     /* Scan through the declarations */
-    while ( d ) {
+    while (d) {
-	if ( !d->dec_u.dec_val.processed ) {
+	if (!d->dec_u.dec_val.processed) {
-	    exp c = d->dec_u.dec_val.dec_exp ;
+	    exp c = d->dec_u.dec_val.dec_exp;
-	    exp s = son ( c ) ;
+	    exp s = son(c);
-	    char *id = d->dec_u.dec_val.dec_id ;
+	    char *id = d->dec_u.dec_val.dec_id;
-	    init_output () ;
+	    init_output();
-	    if ( s != nilexp ) {
+	    if (s != nilexp) {
-		if ( name ( s ) == proc_tag ||
+		if (name(s) == proc_tag ||
-                    name ( s ) == general_proc_tag) {
+                    name(s) == general_proc_tag) {
-		    code_proc ( d, id, c, s ) ;
+		    code_proc(d, id, c, s);
-		    code_const_list () ;
+		    code_const_list();
-                    d->dec_u.dec_val.processed = 1 ;
+                    d->dec_u.dec_val.processed = 1;
 		} else {
-		    eval_if_ready ( d ) ;
+		    eval_if_ready(d);
-		    code_const_list () ;
+		    code_const_list();
+		}
 	    } else {
-		shape sha = d->dec_u.dec_val.dec_shape ;
+		shape sha = d->dec_u.dec_val.dec_shape;
-		long sz = round ( shape_size ( sha ) / 8, 4 ) ;
+		long sz = round(shape_size(sha) / 8, 4);
-		area ( ptext ) ;
+		area(ptext);
-		if ( !is_local ( id ) && isvar ( c ) &&
+		if (!is_local(id) && isvar(c) &&
-		     varsize ( sha ) && !reserved ( id ) ) {
+		     varsize(sha) && !reserved(id)) {
-		    if ( sz ) {
+		    if (sz) {
-			mach_op *op1 = make_extern_data ( id, 0 ) ;
+			mach_op *op1 = make_extern_data(id, 0);
-			mach_op *op2 = make_int_data ( sz ) ;
+			mach_op *op2 = make_int_data(sz);
-			make_instr ( m_as_common, op1, op2, 0 ) ;
+			make_instr(m_as_common, op1, op2, 0);
+		    }
 		} else {
-		    if ( is_local ( id ) && no ( c ) ) {
+		    if (is_local(id) && no(c)) {
-			mach_op *op1 = make_extern_data ( id, 0 ) ;
+			mach_op *op1 = make_extern_data(id, 0);
-			mach_op *op2 = make_int_data ( sz ) ;
+			mach_op *op2 = make_int_data(sz);
-			make_instr ( m_as_local, op1, op2, 0 ) ;
+			make_instr(m_as_local, op1, op2, 0);
+		    }
+		}
-                d->dec_u.dec_val.processed = 1 ;
+                d->dec_u.dec_val.processed = 1;
+	    }
-	    output_all () ;
+	    output_all();
-	    free_all_ins () ;
+	    free_all_ins();
+	}
-	d = d->def_next ;
+	d = d->def_next;
+    }
     eval_delayed_const_list();
-    output_all () ;
+    output_all();
-    free_all_ins () ;
+    free_all_ins();
     /* Add final touches */
-    init_output () ;
+    init_output();
-    if ( need_dummy_double )  {
+    if (need_dummy_double) {
-       mach_op *op1 = make_extern_data ("___m68k_dummy_double", 0 ) ;
+       mach_op *op1 = make_extern_data("___m68k_dummy_double", 0);
-       mach_op *op2 = make_int_data ( 8 ) ;
+       mach_op *op2 = make_int_data(8);
-       make_instr ( m_as_common, op1, op2, 0 ) ;
+       make_instr(m_as_common, op1, op2, 0);
+    }
-    if ( do_profile ) profile_hack () ;
+    if (do_profile)profile_hack();
-    area ( pdata ) ;
+    area(pdata);
-    output_all () ;
+    output_all();
-    free_all_ins () ;
+    free_all_ins();
-    return ;
+    return;
+}

Subversion Repositories tendra.SVN

(root)/branches/tendra5/src/installers/680x0/common/trans.c – Rev 5 → 6