* data/Makefile.am (dist_pkgdata_DATA): Remove push.c.

[bison.git] / src / relation.c

diff --git a/src/relation.c b/src/relation.c
index 92d090ef1e49ce27c4e9362e4c7fff2e732517f8..c5bf05bffdf2f36e6bc43286a67e6341fb4f2e2d 100644 (file)
--- a/src/relation.c
+++ b/src/relation.c
@@ -1,23 +1,22 @@
 /* Binary relations.
 /* Binary relations.

-   Copyright (C) 2002, 2004 Free Software Foundation, Inc.
+   Copyright (C) 2002, 2004, 2005 Free Software Foundation, Inc.

 
    This file is part of Bison, the GNU Compiler Compiler.
 
 
    This file is part of Bison, the GNU Compiler Compiler.
 

-   Bison is free software; you can redistribute it and/or modify
+   This program is free software: you can redistribute it and/or modify

    it under the terms of the GNU General Public License as published by
    it under the terms of the GNU General Public License as published by

-   the Free Software Foundation; either version 2, or (at your option)
-   any later version.
+   the Free Software Foundation, either version 3 of the License, or
+   (at your option) any later version.

 
 

-   Bison is distributed in the hope that it will be useful,
+   This program is distributed in the hope that it will be useful,

    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.
 
    You should have received a copy of the GNU General Public License
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.
 
    You should have received a copy of the GNU General Public License

-   along with Bison; see the file COPYING.  If not, write to
-   the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
-   Boston, MA 02111-1307, USA.  */
+   along with this program.  If not, see <http://www.gnu.org/licenses/>.  */

 
 

+#include <config.h>

 #include "system.h"
 
 #include <bitsetv.h>
 #include "system.h"
 
 #include <bitsetv.h>


@@ -26,17 +25,17 @@
 #include "relation.h"
 
 void
 #include "relation.h"
 
 void

-relation_print (relation r, size_t size, FILE *out)
+relation_print (relation r, relation_node size, FILE *out)

 {
 {

-  unsigned int i;
-  unsigned int j;
+  relation_node i;
+  relation_node j;

 
   for (i = 0; i < size; ++i)
     {
 
   for (i = 0; i < size; ++i)
     {

-      fprintf (out, "%3d: ", i);
+      fprintf (out, "%3lu: ", (unsigned long int) i);

       if (r[i])
        for (j = 0; r[i][j] != END_NODE; ++j)
       if (r[i])
        for (j = 0; r[i][j] != END_NODE; ++j)

-         fprintf (out, "%3d ", r[i][j]);
+         fprintf (out, "%3lu ", (unsigned long int) r[i][j]);

       fputc ('\n', out);
     }
   fputc ('\n', out);
       fputc ('\n', out);
     }
   fputc ('\n', out);


@@ -53,15 +52,15 @@ relation_print (relation r, size_t size, FILE *out)
 static relation R;
 static relation_nodes INDEX;
 static relation_nodes VERTICES;
 static relation R;
 static relation_nodes INDEX;
 static relation_nodes VERTICES;

-static int top;
-static int infinity;
+static relation_node top;
+static relation_node infinity;

 static bitsetv F;
 
 static void
 static bitsetv F;
 
 static void

-traverse (int i)
+traverse (relation_node i)

 {
 {

-  int j;
-  int height;
+  relation_node j;
+  relation_node height;

 
   VERTICES[++top] = i;
   INDEX[i] = height = top;
 
   VERTICES[++top] = i;
   INDEX[i] = height = top;


@@ -93,21 +92,18 @@ traverse (int i)
 
 
 void
 
 
 void

-relation_digraph (relation r, size_t size, bitsetv *function)
+relation_digraph (relation r, relation_node size, bitsetv *function)

 {
 {

-  unsigned int i;
+  relation_node i;

 
   infinity = size + 2;
 
   infinity = size + 2;

-  CALLOC (INDEX, size + 1);
-  CALLOC (VERTICES, size + 1);
+  INDEX = xcalloc (size + 1, sizeof *INDEX);
+  VERTICES = xnmalloc (size + 1, sizeof *VERTICES);

   top = 0;
 
   R = r;
   F = *function;
 
   top = 0;
 
   R = r;
   F = *function;
 

-  for (i = 0; i < size; i++)
-    INDEX[i] = 0;
-

   for (i = 0; i < size; i++)
     if (INDEX[i] == 0 && R[i])
       traverse (i);
   for (i = 0; i < size; i++)
     if (INDEX[i] == 0 && R[i])
       traverse (i);


@@ -124,54 +120,56 @@ relation_digraph (relation r, size_t size, bitsetv *function)
 `-------------------------------------------*/
 
 void
 `-------------------------------------------*/
 
 void

-relation_transpose (relation *R_arg, int n)
+relation_transpose (relation *R_arg, relation_node n)

 {
 {

+  relation r = *R_arg;

   /* The result. */
   /* The result. */

-  relation new_R = CALLOC (new_R, n);
+  relation new_R = xnmalloc (n, sizeof *new_R);

   /* END_R[I] -- next entry of NEW_R[I]. */
   /* END_R[I] -- next entry of NEW_R[I]. */

-  relation end_R = CALLOC (end_R, n);
+  relation end_R = xnmalloc (n, sizeof *end_R);

   /* NEDGES[I] -- total size of NEW_R[I]. */
   /* NEDGES[I] -- total size of NEW_R[I]. */

-  int *nedges = CALLOC (nedges, n);
-  int i, j;
+  size_t *nedges = xcalloc (n, sizeof *nedges);
+  relation_node i;
+  relation_node j;

 
   if (trace_flag & trace_sets)
     {
       fputs ("relation_transpose: input\n", stderr);
 
   if (trace_flag & trace_sets)
     {
       fputs ("relation_transpose: input\n", stderr);

-      relation_print (*R_arg, n, stderr);
+      relation_print (r, n, stderr);

     }
 
   /* Count. */
   for (i = 0; i < n; i++)
     }
 
   /* Count. */
   for (i = 0; i < n; i++)

-    if ((*R_arg)[i])
-      for (j = 0; (*R_arg)[i][j] != END_NODE; ++j)
-       ++nedges[(*R_arg)[i][j]];
+    if (r[i])
+      for (j = 0; r[i][j] != END_NODE; ++j)
+       ++nedges[r[i][j]];

 
   /* Allocate. */
   for (i = 0; i < n; i++)
 
   /* Allocate. */
   for (i = 0; i < n; i++)

-    if (nedges[i] > 0)
-      {
-       relation_node *sp = CALLOC (sp, nedges[i] + 1);
-       sp[nedges[i]] = END_NODE;
-       new_R[i] = sp;
-       end_R[i] = sp;
-      }
+    {
+      relation_node *sp = NULL;
+      if (nedges[i] > 0)
+       {
+         sp = xnmalloc (nedges[i] + 1, sizeof *sp);
+         sp[nedges[i]] = END_NODE;
+       }
+      new_R[i] = sp;
+      end_R[i] = sp;
+    }

 
   /* Store. */
   for (i = 0; i < n; i++)
 
   /* Store. */
   for (i = 0; i < n; i++)

-    if ((*R_arg)[i])
-      for (j = 0; (*R_arg)[i][j] != END_NODE; ++j)
-       {
-         *end_R[(*R_arg)[i][j]] = i;
-         ++end_R[(*R_arg)[i][j]];
-       }
+    if (r[i])
+      for (j = 0; r[i][j] != END_NODE; ++j)
+       *end_R[r[i][j]]++ = i;

 
   free (nedges);
   free (end_R);
 
   /* Free the input: it is replaced with the result. */
   for (i = 0; i < n; i++)
 
   free (nedges);
   free (end_R);
 
   /* Free the input: it is replaced with the result. */
   for (i = 0; i < n; i++)

-    free ((*R_arg)[i]);
-  free (*R_arg);
+    free (r[i]);
+  free (r);

 
   if (trace_flag & trace_sets)
     {
 
   if (trace_flag & trace_sets)
     {