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

style: use lower case for variable names

Browse Source 
* src/relation.c (INDEX, VERTICES): Rename as...
(indexes, vertices): these.
This commit is contained in:
Akim Demaille
2019-02-09 08:54:24 +01:00
parent e18ad5a96b
commit f293345aa8
1 changed files with 15 additions and 15 deletions
Download Patch File Download Diff File Expand all files Collapse all files

30
src/relation.c
View File

@@ -49,8 +49,8 @@ relation_print (relation r, relation_node size, FILE *out)
`---------------------------------------------------------------*/ `---------------------------------------------------------------*/
static relation R; static relation R;
static relation_nodes INDEX; static relation_nodes indexes;
static relation_nodes VERTICES; static relation_nodes vertices;
static relation_node top; static relation_node top;
static relation_node infinity; static relation_node infinity;
static bitsetv F; static bitsetv F;
@@ -60,26 +60,26 @@ traverse (relation_node i)
{ {
relation_node height; relation_node height;
VERTICES[++top] = i; vertices[++top] = i;
INDEX[i] = height = top; indexes[i] = height = top;
if (R[i]) if (R[i])
for (relation_node j = 0; R[i][j] != END_NODE; ++j) for (relation_node j = 0; R[i][j] != END_NODE; ++j)
{ {
if (INDEX[R[i][j]] == 0) if (indexes[R[i][j]] == 0)
traverse (R[i][j]); traverse (R[i][j]);
if (INDEX[i] > INDEX[R[i][j]]) if (indexes[i] > indexes[R[i][j]])
INDEX[i] = INDEX[R[i][j]]; indexes[i] = indexes[R[i][j]];
bitset_or (F[i], F[i], F[R[i][j]]); bitset_or (F[i], F[i], F[R[i][j]]);
} }
if (INDEX[i] == height) if (indexes[i] == height)
for (;;) for (;;)
{ {
relation_node j = VERTICES[top--]; relation_node j = vertices[top--];
INDEX[j] = infinity; indexes[j] = infinity;
if (i == j) if (i == j)
break; break;
@@ -93,19 +93,19 @@ void
relation_digraph (relation r, relation_node size, bitsetv *function) relation_digraph (relation r, relation_node size, bitsetv *function)
{ {
infinity = size + 2; infinity = size + 2;
INDEX = xcalloc (size + 1, sizeof *INDEX); indexes = xcalloc (size + 1, sizeof *indexes);
VERTICES = xnmalloc (size + 1, sizeof *VERTICES); vertices = xnmalloc (size + 1, sizeof *vertices);
top = 0; top = 0;
R = r; R = r;
F = *function; F = *function;
for (relation_node i = 0; i < size; i++) for (relation_node i = 0; i < size; i++)
if (INDEX[i] == 0 && R[i]) if (indexes[i] == 0 && R[i])
traverse (i); traverse (i);
free (INDEX); free (indexes);
free (VERTICES); free (vertices);
*function = F; *function = F;
} }