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

graphviz: move constant computation out of a loop

Browse Source 
* src/graphviz.c (output_red): here.
This commit is contained in:
Akim Demaille
2019-03-31 14:30:44 +02:00
parent 79f7afb125
commit 341776b03b
1 changed files with 3 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
src/graphviz.c
View File

@@ -159,6 +159,9 @@ output_red (state const *s, reductions const *reds, FILE *fout)
bitset no_reduce_set; bitset no_reduce_set;
no_reduce_bitset_init (s, &no_reduce_set); no_reduce_bitset_init (s, &no_reduce_set);
rule *default_reduction
= yydefact[s->number] ? &rules[yydefact[s->number] - 1] : NULL;
/* Two obstacks are needed: one for the enabled reductions, and one /* Two obstacks are needed: one for the enabled reductions, and one
for the disabled reductions, because in the end we want two for the disabled reductions, because in the end we want two
separate edges, even though in most cases only one will actually separate edges, even though in most cases only one will actually
@@ -171,11 +174,6 @@ output_red (state const *s, reductions const *reds, FILE *fout)
const int source = s->number; const int source = s->number;
for (int j = 0; j < reds->num; ++j) for (int j = 0; j < reds->num; ++j)
{ {
rule *default_reduction =
yydefact[s->number]
? &rules[yydefact[s->number] - 1]
: NULL;
bool defaulted = default_reduction && default_reduction == reds->rules[j]; bool defaulted = default_reduction && default_reduction == reds->rules[j];
/* Build the lookahead tokens lists, one for enabled transitions /* Build the lookahead tokens lists, one for enabled transitions