WebSVN – tendra.SVN – Diff – /trunk/src/installers/power/common/inlinechoice.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$
+ */
 /*
     Copyright (c) 1993 Open Software Foundation, Inc.
     All Rights Reserved
     Permission to use, copy, modify, and distribute this software
     and its documentation for any purpose and without fee is hereby
     granted, provided that the above copyright notice appears in all
     copies and that both the copyright notice and this permission
     notice appear in supporting documentation.
     OSF DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING
     ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
     PARTICULAR PURPOSE.
     IN NO EVENT SHALL OSF BE LIABLE FOR ANY SPECIAL, INDIRECT, OR
     CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
     LOSS OF USE, DATA OR PROFITS, WHETHER IN ACTION OF CONTRACT,
     NEGLIGENCE, OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION
     WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
 */
 /*
     		 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.
 */
 #define crit_inline 100
 #define decs_allowed 4
 #define decs_with_apply 0
-static int  complexity PROTO_S ((exp, int, int));
+static int  complexity(exp, int, int);
-static int sbl PROTO_N ((e, count, newdecs)) PROTO_T ( exp e X int count X int newdecs)
+static int sbl(exp e, int count, int newdecs)
 /* applies complexity to the members of a list */
+{
-  int  c = complexity (e, count,newdecs);
+  int  c = complexity(e, count,newdecs);
   if (c < 0)
-    return (c);
+    return(c);
-  if (last (e))
+  if (last(e))
-    return (c);
+    return(c);
-  return (sbl (bro (e), c, newdecs));
+  return(sbl(bro(e), c, newdecs));
 }
-static int complexity PROTO_N ((e, count, newdecs)) PROTO_T (exp e X int count X int newdecs)
+static int complexity(exp e, int count, int newdecs)
+{
-  unsigned char  n = name (e);
+  unsigned char  n = name(e);
   if (count < 0 || newdecs >= decs_allowed)
-    return (-1);
+    return(-1);
   if (son(e) == nilexp) return count;
   switch (n) {
   	case apply_tag: {
   	   if (newdecs > decs_with_apply)
 		 return -1;
   	   return(sbl(son(e), count-1, newdecs));
+  	}
   	case res_tag: return complexity(son(e), count-1, newdecs);
         case ident_tag:
 	  if (isloadparam(son(e)))
 	    return sbl(son(e), count-1, newdecs);
 	  else
 	    return sbl(son(e), count-1, newdecs+1);
         case top_tag: case clear_tag: case prof_tag: return count;
-	case case_tag: return (complexity (son (e), count - 1, newdecs));
+	case case_tag: return(complexity(son(e), count - 1, newdecs));
 	case name_tag: case string_tag: case env_offset_tag:
-               return (count - 1);
+               return(count - 1);
-	case labst_tag: return (complexity (bro (son (e)), count,
+	case labst_tag: return(complexity(bro(son(e)), count,
                         newdecs));
 	case solve_tag: case seq_tag: return sbl(son(e), count, newdecs);
-	default: return (sbl (son (e), count - 1, newdecs));
+	default: return(sbl(son(e), count - 1, newdecs));
+  }
+}
-int inlinechoice PROTO_N ((t, def, total)) PROTO_T (exp t X exp def X int total)
+int inlinechoice(exp t, exp def, int total)
 	/* delivers 0 if no uses of this proc can be inlined.
 	   delivers 1 if this use cannot be inlined
 	   delivers 2 if this use can be inlined.
 	*/
+{
   exp apars;
   exp fpars;
   int newdecs = 0;
   shape shdef = pt(def);
-  UNUSED (total);
+  UNUSED(total);
-  if (!eq_shape(sh(father(t)), shdef) )
+  if (!eq_shape(sh(father(t)), shdef))
+  {
     /* shape required by application is different from definition */
     return 1;
+  }
   apars = t; /* only uses are applications */
   fpars = son(def);
-  for(;;) {
+  for (;;) {
      if (name(fpars)!=ident_tag || !isparam(fpars)) {
 	if (!last(apars)) return 1;
       	break;
      }
      if (last(apars)) return 1;
      apars = bro(apars);
      switch (name(apars)) {
       case val_tag: case real_tag: case string_tag: case name_tag:
       	   break;
       case cont_tag: {
-      	   if (name(son(apars))==name_tag && isvar(son(son(apars))) &&
+      	   if (name(son(apars)) ==name_tag && isvar(son(son(apars))) &&
-      	        		!isvar(fpars) ) break;
+      	        		!isvar(fpars))break;
       	   } /* ... else continue */
       default: newdecs++;
+     }
      fpars = bro(son(fpars));
+  }
         /* newdecs is now the number of declarations (which will not be
       	     optimised out) arising from actual parameters */
   if (complexity(fpars, crit_inline, newdecs) >= 0)
     return 2;
   else if (newdecs == 0)
     return 0;
   return 1;
+}

Subversion Repositories tendra.SVN

(root)/trunk/src/installers/power/common/inlinechoice.c – Rev 2 → 7