src/state.c

   1 /* Type definitions for nondeterministic finite state machine for bison,
   2    Copyright (C) 2001, 2002  Free Software Foundation, Inc.
   3
   4    This file is part of Bison, the GNU Compiler Compiler.
   5
   6    Bison is free software; you can redistribute it and/or modify
   7    it under the terms of the GNU General Public License as published by
   8    the Free Software Foundation; either version 2, or (at your option)
   9    any later version.
  10
  11    Bison is distributed in the hope that it will be useful,
  12    but WITHOUT ANY WARRANTY; without even the implied warranty of
  13    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  14    GNU General Public License for more details.
  15
  16    You should have received a copy of the GNU General Public License
  17    along with Bison; see the file COPYING.  If not, write to
  18    the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
  19    Boston, MA 02111-1307, USA.  */
  20
  21
  22 #include "system.h"
  23 #include "hash.h"
  24 #include "complain.h"
  25 #include "gram.h"
  26 #include "state.h"
  27
  28
  29                         /*-------------------.
  30                         | Shifts and Gotos.  |
  31                         `-------------------*/
  32
  33
  34 /*---------------------------------------.
  35 | Create a new array of N shifts/gotos.  |
  36 `---------------------------------------*/
  37
  38 #define TRANSITIONS_ALLOC(Num)                                          \
  39   (transitions_t *) xcalloc ((sizeof (transitions_t)                    \
  40                                   + (Num - 1) * sizeof (state_t *)), 1)
  41
  42 static transitions_t *
  43 transitions_new (int num, state_t **the_states)
  44 {
  45   transitions_t *res = TRANSITIONS_ALLOC (num);
  46   res->num = num;
  47   memcpy (res->states, the_states, num * sizeof (the_states[0]));
  48   return res;
  49 }
  50
  51
  52 /*-------------------------------------------------------------------.
  53 | Return the state such these TRANSITIONS contain a shift/goto to it |
  54 | on SYMBOL.  Aborts if none found.                                  |
  55 `-------------------------------------------------------------------*/
  56
  57 state_t *
  58 transitions_to (transitions_t *shifts, symbol_number_t s)
  59 {
  60   int j;
  61   for (j = 0; j < shifts->num; j++)
  62     if (TRANSITION_SYMBOL (shifts, j) == s)
  63       return shifts->states[j];
  64   abort ();
  65 }
  66
  67
  68                         /*--------------------.
  69                         | Error transitions.  |
  70                         `--------------------*/
  71
  72
  73 /*-------------------------------.
  74 | Create a new array of N errs.  |
  75 `-------------------------------*/
  76
  77 #define ERRS_ALLOC(Nerrs)                               \
  78   (errs_t *) xcalloc ((sizeof (errs_t)                  \
  79                       + (Nerrs - 1) * sizeof (symbol_t *)), 1)
  80
  81
  82 errs_t *
  83 errs_new (int num, symbol_t **tokens)
  84 {
  85   errs_t *res = ERRS_ALLOC (num);
  86   res->num = num;
  87   memcpy (res->symbols, tokens, num * sizeof (tokens[0]));
  88   return res;
  89 }
  90
  91
  92
  93
  94                         /*-------------.
  95                         | Reductions.  |
  96                         `-------------*/
  97
  98
  99 /*-------------------------------------.
 100 | Create a new array of N reductions.  |
 101 `-------------------------------------*/
 102
 103 #define REDUCTIONS_ALLOC(Nreductions)                          \
 104   (reductions_t *) xcalloc ((sizeof (reductions_t)             \
 105                             + (Nreductions - 1) * sizeof (rule_t *)), 1)
 106
 107 static reductions_t *
 108 reductions_new (int num, rule_t **reductions)
 109 {
 110   reductions_t *res = REDUCTIONS_ALLOC (num);
 111   res->num = num;
 112   memcpy (res->rules, reductions, num * sizeof (reductions[0]));
 113   res->lookaheads = NULL;
 114   return res;
 115 }
 116
 117
 118
 119                         /*---------.
 120                         | States.  |
 121                         `---------*/
 122
 123
 124 state_number_t nstates = 0;
 125 /* FINAL_STATE is properly set by new_state when it recognizes its
 126    accessing symbol: $end.  */
 127 state_t *final_state = NULL;
 128
 129 #define STATE_ALLOC(Nitems)                                             \
 130   (state_t *) xcalloc ((sizeof (state_t)                                \
 131                         + (Nitems - 1) * sizeof (item_number_t)), 1)
 132
 133 /*------------------------------------------------------------------.
 134 | Create a new state with ACCESSING_SYMBOL, for those items.  Store |
 135 | it in the state hash table.                                       |
 136 `------------------------------------------------------------------*/
 137
 138 state_t *
 139 state_new (symbol_number_t accessing_symbol,
 140            size_t core_size, item_number_t *core)
 141 {
 142   state_t *res;
 143
 144   if (nstates >= STATE_NUMBER_MAX)
 145     fatal (_("too many states (max %d)"), STATE_NUMBER_MAX);
 146
 147   res = STATE_ALLOC (core_size);
 148   res->accessing_symbol = accessing_symbol;
 149   res->number = nstates;
 150   ++nstates;
 151   res->solved_conflicts = NULL;
 152
 153   res->nitems = core_size;
 154   memcpy (res->items, core, core_size * sizeof (core[0]));
 155
 156   state_hash_insert (res);
 157
 158   return res;
 159 }
 160
 161
 162 /*-------------.
 163 | Free STATE.  |
 164 `-------------*/
 165
 166 static void
 167 state_free (state_t *state)
 168 {
 169   free (state->transitions);
 170   free (state->reductions);
 171   free (state->errs);
 172   free (state);
 173 }
 174
 175
 176 /*-------------------------------.
 177 | Set the transitions of STATE.  |
 178 `-------------------------------*/
 179
 180 void
 181 state_transitions_set (state_t *state, int num, state_t **transitions)
 182 {
 183   assert (!state->transitions);
 184   state->transitions = transitions_new (num, transitions);
 185 }
 186
 187
 188 /*------------------------------.
 189 | Set the reductions of STATE.  |
 190 `------------------------------*/
 191
 192 void
 193 state_reductions_set (state_t *state, int num, rule_t **reductions)
 194 {
 195   assert (!state->reductions);
 196   state->reductions = reductions_new (num, reductions);
 197 }
 198
 199
 200 int
 201 state_reduction_find (state_t *state, rule_t *rule)
 202 {
 203   int i;
 204   reductions_t *reds = state->reductions;
 205   for (i = 0; i < reds->num; ++i)
 206     if (reds->rules[i] == rule)
 207       return i;
 208   return -1;
 209 }
 210
 211
 212 /*------------------------.
 213 | Set the errs of STATE.  |
 214 `------------------------*/
 215
 216 void
 217 state_errs_set (state_t *state, int num, symbol_t **tokens)
 218 {
 219   assert (!state->errs);
 220   state->errs = errs_new (num, tokens);
 221 }
 222
 223
 224
 225 /*--------------------------------------------------------------.
 226 | Print on OUT all the lookaheads such that this STATE wants to |
 227 | reduce this RULE.                                             |
 228 `--------------------------------------------------------------*/
 229
 230 void
 231 state_rule_lookaheads_print (state_t *state, rule_t *rule, FILE *out)
 232 {
 233   /* Find the reduction we are handling.  */
 234   reductions_t *reds = state->reductions;
 235   int red = state_reduction_find (state, rule);
 236
 237   /* Print them if there are.  */
 238   if (reds->lookaheads && red != -1)
 239     {
 240       bitset_iterator biter;
 241       int k;
 242       int not_first = 0;
 243       fprintf (out, "  [");
 244       BITSET_FOR_EACH (biter, reds->lookaheads[red], k, 0)
 245         fprintf (out, "%s%s",
 246                  not_first++ ? ", " : "",
 247                  symbols[k]->tag);
 248       fprintf (out, "]");
 249     }
 250 }
 251
 252
 253 /*----------------------.
 254 | A state hash table.  |
 255 `----------------------*/
 256
 257 /* Initial capacity of states hash table.  */
 258 #define HT_INITIAL_CAPACITY 257
 259
 260 static struct hash_table *state_table = NULL;
 261
 262 /* Two states are equal if they have the same core items.  */
 263 static bool
 264 state_compare (const state_t *s1, const state_t *s2)
 265 {
 266   int i;
 267
 268   if (s1->nitems != s2->nitems)
 269     return FALSE;
 270
 271   for (i = 0; i < s1->nitems; ++i)
 272     if (s1->items[i] != s2->items[i])
 273       return FALSE;
 274
 275   return TRUE;
 276 }
 277
 278 static unsigned int
 279 state_hash (const state_t *state, unsigned int tablesize)
 280 {
 281   /* Add up the state's item numbers to get a hash key.  */
 282   int key = 0;
 283   int i;
 284   for (i = 0; i < state->nitems; ++i)
 285     key += state->items[i];
 286   return key % tablesize;
 287 }
 288
 289
 290 /*-------------------------------.
 291 | Create the states hash table.  |
 292 `-------------------------------*/
 293
 294 void
 295 state_hash_new (void)
 296 {
 297   state_table = hash_initialize (HT_INITIAL_CAPACITY,
 298                                  NULL,
 299                                  (Hash_hasher) state_hash,
 300                                  (Hash_comparator) state_compare,
 301                                  (Hash_data_freer) NULL);
 302 }
 303
 304
 305 /*---------------------------------------------.
 306 | Free the states hash table, not the states.  |
 307 `---------------------------------------------*/
 308
 309 void
 310 state_hash_free (void)
 311 {
 312   hash_free (state_table);
 313 }
 314
 315
 316 /*---------------------------------------.
 317 | Insert STATE in the state hash table.  |
 318 `---------------------------------------*/
 319
 320 void
 321 state_hash_insert (state_t *state)
 322 {
 323   hash_insert (state_table, state);
 324 }
 325
 326
 327 /*------------------------------------------------------------------.
 328 | Find the state associated to the CORE, and return it.  If it does |
 329 | not exist yet, return NULL.                                       |
 330 `------------------------------------------------------------------*/
 331
 332 state_t *
 333 state_hash_lookup (size_t core_size, item_number_t *core)
 334 {
 335   state_t *probe = STATE_ALLOC (core_size);
 336   state_t *entry;
 337
 338   probe->nitems = core_size;
 339   memcpy (probe->items, core, core_size * sizeof (core[0]));
 340   entry = hash_lookup (state_table, probe);
 341   free (probe);
 342   return entry;
 343 }
 344
 345 /* All the decorated states, indexed by the state number.  */
 346 state_t **states = NULL;
 347
 348
 349 /*----------------------.
 350 | Free all the states.  |
 351 `----------------------*/
 352
 353 void
 354 states_free (void)
 355 {
 356   state_number_t i;
 357   for (i = 0; i < nstates; ++i)
 358     state_free (states[i]);
 359   free (states);
 360 }