WebSVN – tendra.SVN – Diff – /trunk/src/installers/power/common/weights.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.
 */
   { 0.0	/* , ... */ },
   { 0.0	/* , ... */ }
 };
-weights weightsv PROTO_S ((double, exp));
+weights weightsv(double, exp);
-weights add_weights PROTO_N ((w1,w2)) PROTO_T (weights * w1 X weights * w2)
+weights add_weights(weights * w1, weights * w2)
+{
   /* sum of weights */
   weights r;
   long i;
   for (i = 0; i < wfixno; ++i)
+  {
-    (r.fix)[i] = (w1->fix)[i] + (w2->fix)[i];
+   (r.fix)[i] = (w1->fix)[i] + (w2->fix)[i];
+  }
   for (i = 0; i < wfloatno; ++i)
+  {
-    (r.floating)[i] = (w1->floating)[i] + (w2->floating)[i];
+   (r.floating)[i] = (w1->floating)[i] + (w2->floating)[i];
+  }
-  return (r);
+  return(r);
+}
-wp max_weights PROTO_N ((loc,ws,fix)) PROTO_T (double loc X weights * ws X bool fix)
+wp max_weights(double loc, weights * ws, bool fix)
+{
   /*
    * loc is the usage count of a tag, ws is the weights computed for the scope
    * of the tag and fix distinguishes between fix and float. This computes the
    * weights for the declaration and a break point for register allocation
    */
   long bk = wfixno + 1;
   long i;
   float *w = (ws->fix);		/* w[i] = greatest usage of (i+1) inner fixed tags  */
   wp res;
-  float *pw = &(((res.wp_weights).fix)[0]);
+  float *pw = & (((res.wp_weights).fix)[0]);
   if (fix)
+  {
     for (i = 0; i < wfixno; ++i)
+    {
   res.fix_break = bk;
   bk = wfloatno + 1;
   w = (ws->floating);
-  pw = &(((res.wp_weights).floating)[0]);
+  pw = & (((res.wp_weights).floating)[0]);
   if (!fix)
   {				/* same algorithm for float regs as fixed regs */
     for (i = 0; i < wfloatno; ++i)
+    {
       if (i == 0)
   res.float_break = bk;
   return res;
+}
-weights mult_weights PROTO_N ((m,ws)) PROTO_T (double m X weights * ws)
+weights mult_weights(double m, weights * ws)
+{
   /*
    * multiply weights by scalar - non overflowing
    */
   weights res;
-  float *r = &(res.fix)[0];
+  float *r = & (res.fix)[0];
   float *w = ws->fix;
   long i;
   for (i = 0; i < wfixno; ++i)
+  {
-    r[i] = w[i] * m;
+    r[i] = w[i]* m;
+  }
-  r = &(res.floating)[0];
+  r = & (res.floating)[0];
   w = ws->floating;
   for (i = 0; i < wfloatno; ++i)
+  {
-    r[i] = w[i] * m;
+    r[i] = w[i]* m;
+  }
-  return (res);
+  return(res);
+}
-weights add_wlist PROTO_N ((scale,re)) PROTO_T (double scale X exp re)
+weights add_wlist(double scale, exp re)
 {				/* sum of  weights of list re */
   weights w, w1;
   exp r = re;
   if (r == nilexp)
+  {
     return zeroweights;
+  }
   else if (last(r))
+  {
-    return (weightsv(scale, r));
+    return(weightsv(scale, r));
+  }
   else
+  {
     w = weightsv(scale, r);
     do
 inside 'for' loops for example. The procedure reg_alloc in reg_alloc.c
 finally determines the actual choice of s reg and recodes the number
 field of an ident.
 ******************************************************************/
-weights weightsv PROTO_N ((scale,e)) PROTO_T (double scale X exp e)
+weights weightsv(double scale, exp e)
+{
 tailrecurse:
   switch (name(e))
       return zeroweights;
+    }
   case ident_tag:
+    {
-      if (son(e) != nilexp)
+      if (son(e)!= nilexp)
+      {
 	weights wdef;
 	bool wdef_set;
 	weights wbody;
 	long noe = no(e) /* set by scan */ ;
 	  if (name(t) == val_tag || name(t) == real_tag)
+	  {
 	    return wbody;
+	  }
-	  while (name(t) != name_tag)
+	  while (name(t)!= name_tag)
+	  {
 	    t = son(t);
+	  }
 	  s = son(t);
       return zeroweights;
+    }
   case ncopies_tag:
+    {
-      scale = no(e) * scale;
+      scale = no(e)* scale;
       e = son(e);
       goto tailrecurse;
+    }
       if (last(son(e)))
+      {
 	e = son(e);
 	goto tailrecurse;
+      }
-      return (add_wlist(scale, son(e)));
+      return(add_wlist(scale, son(e)));
+    }
+  }
+}

Subversion Repositories tendra.SVN

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