X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/c7ca99d4b03860bb258914fbc228272031eec77c..d257636504fc23c24be818a34f55a226bb29b719:/src/state.c

diff --git a/src/state.c b/src/state.c
index 874c5863..37add6d1 100644
--- a/src/state.c
+++ b/src/state.c
@@ -35,19 +35,34 @@
 | Create a new array of N shifts/gotos.  |
 `---------------------------------------*/
 
-#define SHIFTS_ALLOC(Nshifts)						\
-  (shifts *) xcalloc ((unsigned) (sizeof (shifts) 			\
-                                  + (Nshifts - 1) * sizeof (short)), 1)
+#define TRANSITIONS_ALLOC(Nshifts)						\
+  (transitions_t *) xcalloc ((unsigned) (sizeof (transitions_t) 			\
+                                  + (Nshifts - 1) * sizeof (state_number_t)), 1)
 
-shifts *
-shifts_new (int n)
+static transitions_t *
+transitions_new (int num, state_number_t *the_states)
 {
-  shifts *res = SHIFTS_ALLOC (n);
-  res->nshifts = n;
+  transitions_t *res = TRANSITIONS_ALLOC (num);
+  res->num = num;
+  memcpy (res->states, the_states, num * sizeof (the_states[0]));
   return res;
 }
 
 
+/*-------------------------------------------------------------------.
+| Return the state such these TRANSITIONS contain a shift/goto to it |
+| on SYMBOL.  Aborts if none found.                                  |
+`-------------------------------------------------------------------*/
+
+state_t *
+transitions_to (transitions_t *shifts, symbol_number_t s)
+{
+  int j;
+  for (j = 0; j < shifts->num; j++)
+    if (TRANSITION_SYMBOL (shifts, j) == s)
+      return states[shifts->states[j]];
+  abort ();
+}
 
 
 			/*--------------------.
@@ -60,24 +75,24 @@ shifts_new (int n)
 `-------------------------------*/
 
 #define ERRS_ALLOC(Nerrs)						\
-  (errs *) xcalloc ((unsigned) (sizeof (errs) 				\
-                                  + (Nerrs - 1) * sizeof (short)), 1)
+  (errs_t *) xcalloc ((unsigned) (sizeof (errs_t)			\
+                                  + (Nerrs - 1) * sizeof (symbol_number_t)), 1)
 
 
-errs *
+errs_t *
 errs_new (int n)
 {
-  errs *res = ERRS_ALLOC (n);
-  res->nerrs = n;
+  errs_t *res = ERRS_ALLOC (n);
+  res->num = n;
   return res;
 }
 
 
-errs *
-errs_dup (errs *src)
+errs_t *
+errs_dup (errs_t *src)
 {
-  errs *res = errs_new (src->nerrs);
-  memcpy (res->errs, src->errs, src->nerrs * sizeof (src->errs[0]));
+  errs_t *res = errs_new (src->num);
+  memcpy (res->symbols, src->symbols, src->num * sizeof (src->symbols[0]));
   return res;
 }
 
@@ -94,14 +109,15 @@ errs_dup (errs *src)
 `-------------------------------------*/
 
 #define REDUCTIONS_ALLOC(Nreductions)					\
-  (reductions *) xcalloc ((unsigned) (sizeof (reductions)		\
-                                  + (Nreductions - 1) * sizeof (short)), 1)
+  (reductions_t *) xcalloc ((unsigned) (sizeof (reductions_t)		\
+                                  + (Nreductions - 1) * sizeof (rule_number_t)), 1)
 
-reductions *
-reductions_new (int n)
+static reductions_t *
+reductions_new (int nreductions, short *reductions)
 {
-  reductions *res = REDUCTIONS_ALLOC (n);
-  res->nreds = n;
+  reductions_t *res = REDUCTIONS_ALLOC (nreductions);
+  res->num = nreductions;
+  memcpy (res->rules, reductions, nreductions * sizeof (reductions[0]));
   return res;
 }
 
@@ -147,6 +163,29 @@ state_new (symbol_number_t accessing_symbol,
 }
 
 
+/*--------------------------.
+| Set the shifts of STATE.  |
+`--------------------------*/
+
+void
+state_transitions_set (state_t *state, int nshifts, state_number_t *shifts)
+{
+  state->shifts = transitions_new (nshifts, shifts);
+}
+
+
+/*------------------------------.
+| Set the reductions of STATE.  |
+`------------------------------*/
+
+void
+state_reductions_set (state_t *state, int nreductions, short *reductions)
+{
+  state->reductions = reductions_new (nreductions, reductions);
+}
+
+
+
 /*--------------------------------------------------------------.
 | Print on OUT all the lookaheads such that this STATE wants to |
 | reduce this RULE.                                             |
@@ -159,22 +198,24 @@ state_rule_lookaheads_print (state_t *state, rule_t *rule, FILE *out)
   int nlookaheads = 0;
   /* Count the number of lookaheads corresponding to this rule.  */
   for (j = 0; j < state->nlookaheads; ++j)
-    for (k = 0; k < ntokens; ++k)
-      if (bitset_test (state->lookaheads[j], k)
-	  && state->lookaheads_rule[j]->number == rule->number)
+    BITSET_EXECUTE (state->lookaheads[j], 0, k,
+    {
+      if (state->lookaheads_rule[j]->number == rule->number)
 	nlookaheads++;
+    });
 
   /* Print them if there are.  */
   if (nlookaheads)
     {
       fprintf (out, "  [");
       for (j = 0; j < state->nlookaheads; ++j)
-	for (k = 0; k < ntokens; ++k)
-	  if (bitset_test (state->lookaheads[j], k)
-	      && state->lookaheads_rule[j]->number == rule->number)
+	BITSET_EXECUTE (state->lookaheads[j], 0, k,
+	{
+	  if (state->lookaheads_rule[j]->number == rule->number)
 	    fprintf (out, "%s%s",
 		     symbol_tag_get (symbols[k]),
 		     --nlookaheads ? ", " : "");
+	});
       fprintf (out, "]");
     }
 }