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

(relation_print, traverse, relation_transpose):

Browse Source 
Check for END_NODE rather than looking at sign.
This commit is contained in:
Paul Eggert
2004-10-22 23:10:07 +00:00
parent f55ec70868
commit 0859e438eb
1 changed files with 5 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
src/relation.c
View File

@@ -35,7 +35,7 @@ relation_print (relation r, size_t size, FILE *out)
{ {
fprintf (out, "%3d: ", i); fprintf (out, "%3d: ", i);
if (r[i]) if (r[i])
for (j = 0; r[i][j] != -1; ++j) for (j = 0; r[i][j] != END_NODE; ++j)
fprintf (out, "%3d ", r[i][j]); fprintf (out, "%3d ", r[i][j]);
fputc ('\n', out); fputc ('\n', out);
} }
@@ -67,7 +67,7 @@ traverse (int i)
INDEX[i] = height = top; INDEX[i] = height = top;
if (R[i]) if (R[i])
for (j = 0; R[i][j] >= 0; ++j) for (j = 0; R[i][j] != END_NODE; ++j)
{ {
if (INDEX[R[i][j]] == 0) if (INDEX[R[i][j]] == 0)
traverse (R[i][j]); traverse (R[i][j]);
@@ -143,7 +143,7 @@ relation_transpose (relation *R_arg, int n)
/* Count. */ /* Count. */
for (i = 0; i < n; i++) for (i = 0; i < n; i++)
if ((*R_arg)[i]) if ((*R_arg)[i])
for (j = 0; (*R_arg)[i][j] >= 0; ++j) for (j = 0; (*R_arg)[i][j] != END_NODE; ++j)
++nedges[(*R_arg)[i][j]]; ++nedges[(*R_arg)[i][j]];
/* Allocate. */ /* Allocate. */
@@ -151,7 +151,7 @@ relation_transpose (relation *R_arg, int n)
if (nedges[i] > 0) if (nedges[i] > 0)
{ {
relation_node *sp = CALLOC (sp, nedges[i] + 1); relation_node *sp = CALLOC (sp, nedges[i] + 1);
sp[nedges[i]] = -1; sp[nedges[i]] = END_NODE;
new_R[i] = sp; new_R[i] = sp;
end_R[i] = sp; end_R[i] = sp;
} }
@@ -159,7 +159,7 @@ relation_transpose (relation *R_arg, int n)
/* Store. */ /* Store. */
for (i = 0; i < n; i++) for (i = 0; i < n; i++)
if ((*R_arg)[i]) if ((*R_arg)[i])
for (j = 0; (*R_arg)[i][j] >= 0; ++j) for (j = 0; (*R_arg)[i][j] != END_NODE; ++j)
{ {
*end_R[(*R_arg)[i][j]] = i; *end_R[(*R_arg)[i][j]] = i;
++end_R[(*R_arg)[i][j]]; ++end_R[(*R_arg)[i][j]];