Future/bison
1
0
Fork 0
mirror of https://git.savannah.gnu.org/git/bison.git synced 2026-03-17 16:23:04 +00:00
Code Issues Packages Projects Releases Wiki Activity

(relation_transpose): Rewrite to avoid bogus complaint

Browse Source 
from maintainer-distcheck about casting the argument of 'free'.
This commit is contained in:
Paul Eggert
2005-07-22 21:56:20 +00:00
parent a9401edbf5
commit 26a69b31fa
1 changed files with 11 additions and 13 deletions
Download Patch File Download Diff File Expand all files Collapse all files

24
src/relation.c
View File

@@ -1,5 +1,5 @@
/* 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.
@@ -123,6 +123,7 @@ relation_digraph (relation r, relation_node size, bitsetv *function)
void void
relation_transpose (relation *R_arg, relation_node n) relation_transpose (relation *R_arg, relation_node n)
{ {
relation r = *R_arg;
/* The result. */ /* The result. */
relation new_R = xnmalloc (n, sizeof *new_R); 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]. */
@@ -135,14 +136,14 @@ relation_transpose (relation *R_arg, relation_node n)
if (trace_flag & trace_sets) if (trace_flag & trace_sets)
{ {
fputs ("relation_transpose: input\n", stderr); fputs ("relation_transpose: input\n", stderr);
relation_print (*R_arg, n, stderr); relation_print (r, n, stderr);
} }
/* Count. */ /* Count. */
for (i = 0; i < n; i++) for (i = 0; i < n; i++)
if ((*R_arg)[i]) if (r[i])
for (j = 0; (*R_arg)[i][j] != END_NODE; ++j) for (j = 0; r[i][j] != END_NODE; ++j)
++nedges[(*R_arg)[i][j]]; ++nedges[r[i][j]];
/* Allocate. */ /* Allocate. */
for (i = 0; i < n; i++) for (i = 0; i < n; i++)
@@ -159,20 +160,17 @@ relation_transpose (relation *R_arg, relation_node n)
/* Store. */ /* Store. */
for (i = 0; i < n; i++) for (i = 0; i < n; i++)
if ((*R_arg)[i]) if (r[i])
for (j = 0; (*R_arg)[i][j] != END_NODE; ++j) for (j = 0; r[i][j] != END_NODE; ++j)
{ *end_R[r[i][j]]++ = i;
*end_R[(*R_arg)[i][j]] = i;
++end_R[(*R_arg)[i][j]];
}
free (nedges); free (nedges);
free (end_R); free (end_R);
/* Free the input: it is replaced with the result. */ /* Free the input: it is replaced with the result. */
for (i = 0; i < n; i++) for (i = 0; i < n; i++)
free ((*R_arg)[i]); free (r[i]);
free (*R_arg); free (r);
if (trace_flag & trace_sets) if (trace_flag & trace_sets)
{ {