cpython/Parser/acceler.c

145 lines
3.2 KiB
C
Raw Normal View History

1991-02-19 08:39:46 -04:00
1990-10-14 09:07:46 -03:00
/* Parser accelerator module */
1990-12-20 11:06:42 -04:00
/* The parser as originally conceived had disappointing performance.
This module does some precomputation that speeds up the selection
of a DFA based upon a token, turning a search through an array
into a simple indexing operation. The parser now cannot work
without the accelerators installed. Note that the accelerators
are installed dynamically when the parser is initialized, they
are not part of the static data structure written on graminit.[ch]
by the parser generator. */
1990-10-14 09:07:46 -03:00
1990-12-20 11:06:42 -04:00
#include "pgenheaders.h"
1990-10-14 09:07:46 -03:00
#include "grammar.h"
1994-08-30 05:27:36 -03:00
#include "node.h"
1990-10-14 09:07:46 -03:00
#include "token.h"
1990-12-20 11:06:42 -04:00
#include "parser.h"
/* Forward references */
static void fixdfa(grammar *, dfa *);
static void fixstate(grammar *, state *);
1990-12-20 11:06:42 -04:00
void
PyGrammar_AddAccelerators(grammar *g)
1990-12-20 11:06:42 -04:00
{
dfa *d;
int i;
1996-12-30 12:17:54 -04:00
#ifdef Py_DEBUG
fprintf(stderr, "Adding parser accelerators ...\n");
1990-12-20 11:06:42 -04:00
#endif
d = g->g_dfa;
for (i = g->g_ndfas; --i >= 0; d++)
fixdfa(g, d);
g->g_accel = 1;
1996-12-30 12:17:54 -04:00
#ifdef Py_DEBUG
fprintf(stderr, "Done.\n");
1990-12-20 11:06:42 -04:00
#endif
}
1997-08-02 00:02:27 -03:00
void
PyGrammar_RemoveAccelerators(grammar *g)
1997-08-02 00:02:27 -03:00
{
dfa *d;
int i;
g->g_accel = 0;
d = g->g_dfa;
for (i = g->g_ndfas; --i >= 0; d++) {
state *s;
int j;
s = d->d_state;
for (j = 0; j < d->d_nstates; j++, s++) {
if (s->s_accel)
PyMem_DEL(s->s_accel);
s->s_accel = NULL;
}
}
}
1990-12-20 11:06:42 -04:00
static void
fixdfa(grammar *g, dfa *d)
1990-12-20 11:06:42 -04:00
{
state *s;
int j;
s = d->d_state;
for (j = 0; j < d->d_nstates; j++, s++)
1992-03-27 13:24:37 -04:00
fixstate(g, s);
1990-12-20 11:06:42 -04:00
}
1990-10-14 09:07:46 -03:00
static void
fixstate(grammar *g, state *s)
1990-10-14 09:07:46 -03:00
{
arc *a;
int k;
int *accel;
int nl = g->g_ll.ll_nlabels;
s->s_accept = 0;
1997-04-29 18:03:06 -03:00
accel = PyMem_NEW(int, nl);
1990-10-14 09:07:46 -03:00
for (k = 0; k < nl; k++)
accel[k] = -1;
a = s->s_arc;
for (k = s->s_narcs; --k >= 0; a++) {
int lbl = a->a_lbl;
label *l = &g->g_ll.ll_label[lbl];
int type = l->lb_type;
if (a->a_arrow >= (1 << 7)) {
printf("XXX too many states!\n");
continue;
}
if (ISNONTERMINAL(type)) {
1997-04-29 18:03:06 -03:00
dfa *d1 = PyGrammar_FindDFA(g, type);
1990-10-14 09:07:46 -03:00
int ibit;
if (type - NT_OFFSET >= (1 << 7)) {
printf("XXX too high nonterminal number!\n");
continue;
}
for (ibit = 0; ibit < g->g_ll.ll_nlabels; ibit++) {
if (testbit(d1->d_first, ibit)) {
#ifdef applec
1994-08-30 05:27:36 -03:00
#define MPW_881_BUG /* Undefine if bug below is fixed */
#endif
#ifdef MPW_881_BUG
/* In 881 mode MPW 3.1 has a code
generation bug which seems to
set the upper bits; fix this by
explicitly masking them off */
int temp;
#endif
1990-10-14 09:07:46 -03:00
if (accel[ibit] != -1)
printf("XXX ambiguity!\n");
#ifdef MPW_881_BUG
temp = 0xFFFF &
(a->a_arrow | (1 << 7) |
((type - NT_OFFSET) << 8));
accel[ibit] = temp;
#else
1990-10-14 09:07:46 -03:00
accel[ibit] = a->a_arrow | (1 << 7) |
((type - NT_OFFSET) << 8);
#endif
1990-10-14 09:07:46 -03:00
}
}
}
else if (lbl == EMPTY)
s->s_accept = 1;
else if (lbl >= 0 && lbl < nl)
accel[lbl] = a->a_arrow;
}
while (nl > 0 && accel[nl-1] == -1)
nl--;
for (k = 0; k < nl && accel[k] == -1;)
k++;
if (k < nl) {
int i;
1997-04-29 18:03:06 -03:00
s->s_accel = PyMem_NEW(int, nl-k);
1990-10-14 09:07:46 -03:00
if (s->s_accel == NULL) {
fprintf(stderr, "no mem to add parser accelerators\n");
exit(1);
}
s->s_lower = k;
s->s_upper = nl;
for (i = 0; k < nl; i++, k++)
s->s_accel[i] = accel[k];
}
1997-04-29 18:03:06 -03:00
PyMem_DEL(accel);
1990-10-14 09:07:46 -03:00
}