/* Subroutines for bison
   Copyright (C) 1984, 1989, 2000, 2001, 2002 Free Software Foundation, Inc.

   This file is part of Bison, the GNU Compiler Compiler.

   Bison is free software; you can redistribute it and/or modify it
   under the terms of the GNU General Public License as published by
   the Free Software Foundation; either version 2, or (at your option)
   any later version.

   Bison is distributed in the hope that it will be useful, but
   WITHOUT ANY WARRANTY; without even the implied warranty of
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
   General Public License for more details.

   You should have received a copy of the GNU General Public License
   along with Bison; see the file COPYING.  If not, write to the Free
   Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
   02111-1307, USA.  */

#include "system.h"
#include "bitset.h"
#include "bitsetv.h"
#include "getargs.h"
#include "symtab.h"
#include "gram.h"
#include "reader.h"
#include "closure.h"
#include "derives.h"
#include "warshall.h"

/* NITEMSET is the size of the array ITEMSET.  */
short *itemset;
int nitemset;

static bitset ruleset;

/* internal data.  See comments before set_fderives and set_firsts.  */
static bitsetv fderives = NULL;
static bitsetv firsts = NULL;

/* Retrieve the FDERIVES/FIRSTS sets of the nonterminals numbered Var.  */
#define FDERIVES(Var)   fderives[(Var) - ntokens]
#define   FIRSTS(Var)   firsts[(Var) - ntokens]


/*-----------------.
| Debugging code.  |
`-----------------*/

static void
print_closure (const char *title, short *array, size_t size)
{
  size_t i;
  fprintf (stderr, "Closure: %s\n", title);
  for (i = 0; i < size; ++i)
    {
      short *rp;
      fprintf (stderr, "  %2d: .", array[i]);
      for (rp = &ritem[array[i]]; *rp >= 0; ++rp)
	fprintf (stderr, " %s", symbols[*rp]->tag);
      fprintf (stderr, "  (rule %d)\n", -*rp - 1);
    }
  fputs ("\n\n", stderr);
}


static void
print_firsts (void)
{
  int i, j;

  fprintf (stderr, "FIRSTS\n");
  for (i = ntokens; i < nsyms; i++)
    {
      fprintf (stderr, "\t%s firsts\n", symbols[i]->tag);
      for (j = 0; j < nvars; j++)
	if (bitset_test (FIRSTS (i), j))
	  fprintf (stderr, "\t\t%d (%s)\n",
		   j + ntokens, symbols[j + ntokens]->tag);
    }
  fprintf (stderr, "\n\n");
}


static void
print_fderives (void)
{
  int i, j;

  fprintf (stderr, "FDERIVES\n");
  for (i = ntokens; i < nsyms; i++)
    {
      fprintf (stderr, "\t%s derives\n", symbols[i]->tag);
      for (j = 0; j <= nrules; j++)
	if (bitset_test (FDERIVES (i), j))
	  {
	    short *rhsp;
	    fprintf (stderr, "\t\t%d:", j - 1);
	    for (rhsp = &ritem[rules[j].rhs]; *rhsp >= 0; ++rhsp)
	      fprintf (stderr, " %s", symbols[*rhsp]->tag);
	    fputc ('\n', stderr);
	  }
    }
  fprintf (stderr, "\n\n");
}

/*------------------------------------------------------------------.
| Set FIRSTS to be an NVARS array of NVARS bitsets indicating which |
| items can represent the beginning of the input corresponding to   |
| which other items.                                                |
|                                                                   |
| For example, if some rule expands symbol 5 into the sequence of   |
| symbols 8 3 20, the symbol 8 can be the beginning of the data for |
| symbol 5, so the bit [8 - ntokens] in first[5 - ntokens] (= FIRST |
| (5)) is set.                                                      |
`------------------------------------------------------------------*/

static void
set_firsts (void)
{
  int i, j;

  firsts = bitsetv_create (nvars, nvars, BITSET_FIXED);

  for (i = ntokens; i < nsyms; i++)
    for (j = 0; derives[i][j] >= 0; ++j)
      {
	int symbol = ritem[rules[derives[i][j]].rhs];
	if (ISVAR (symbol))
	  bitset_set (FIRSTS (i), symbol - ntokens);
      }

  RTC (firsts);

  if (trace_flag)
    print_firsts ();
}

/*-------------------------------------------------------------------.
| Set FDERIVES to an NVARS by NRULES matrix of bits indicating which |
| rules can help derive the beginning of the data for each           |
| nonterminal.                                                       |
|                                                                    |
| For example, if symbol 5 can be derived as the sequence of symbols |
| 8 3 20, and one of the rules for deriving symbol 8 is rule 4, then |
| the [5 - NTOKENS, 4] bit in FDERIVES is set.                       |
`-------------------------------------------------------------------*/

static void
set_fderives (void)
{
  int i, j, k;

  fderives = bitsetv_create (nvars, nrules + 1, BITSET_FIXED);

  set_firsts ();

  for (i = ntokens; i < nsyms; ++i)
    for (j = ntokens; j < nsyms; ++j)
      if (bitset_test (FIRSTS (i), j - ntokens))
	for (k = 0; derives[j][k] > 0; ++k)
	  bitset_set (FDERIVES (i), derives[j][k]);

  if (trace_flag)
    print_fderives ();

  bitsetv_free (firsts);
}


void
new_closure (int n)
{
  itemset = XCALLOC (short, n);

  ruleset = bitset_create (nrules + 1, BITSET_FIXED);

  set_fderives ();
}



void
closure (short *core, int n)
{
  /* Index over CORE. */
  int c;

  /* An index over RULESET. */
  int r;

  /* A bit index over RULESET. */
  int ruleno;

  if (trace_flag)
    print_closure ("input", core, n);

  if (n == 0)
    {
      bitset_copy (ruleset, FDERIVES (start_symbol));
    }
  else
    {
      bitset_zero (ruleset);

      for (c = 0; c < n; ++c)
	if (ISVAR (ritem[core[c]]))
	  bitset_or (ruleset, ruleset, FDERIVES (ritem[core[c]]));
    }

  nitemset = 0;
  c = 0;
  for (ruleno = 0; ruleno < nrules + 1; ++ruleno)
    if (bitset_test (ruleset, ruleno))
      {
	int itemno = rules[ruleno].rhs;
	while (c < n && core[c] < itemno)
	  {
	    itemset[nitemset] = core[c];
	    nitemset++;
	    c++;
	  }
	itemset[nitemset] = itemno;
	nitemset++;
      }

  while (c < n)
    {
      itemset[nitemset] = core[c];
      nitemset++;
      c++;
    }

  if (trace_flag)
    print_closure ("output", itemset, nitemset);
}


void
free_closure (void)
{
  XFREE (itemset);
  bitset_free (ruleset);
  bitsetv_free (fderives);
}