Couple of srvx updates.

[irc/evilnet/x3.git] / rx / rxunfa.c

/* classes: src_files */

/*	Copyright (C) 1995, 1996 Tom Lord
 * 
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU Library General Public License as published by
 * the Free Software Foundation; either version 2, or (at your option)
 * any later version.
 * 
 * This program 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 Library General Public License for more details.
 * 
 * You should have received a copy of the GNU Library General Public License
 * along with this software; see the file COPYING.  If not, write to
 * the Free Software Foundation, 59 Temple Place - Suite 330, 
 * Boston, MA 02111-1307, USA. 
 */


\f
#include "rxall.h"
#include "rx.h"
#include "rxunfa.h"
#include "rxnfa.h"
\f

#ifdef __STDC__
static int
unfa_equal (void * va, void * vb)
#else
static int
unfa_equal (va, vb)
     void * va;
     void * vb;
#endif
{
  return rx_rexp_equal ((struct rexp_node *)va, (struct rexp_node *)vb);
}


struct rx_hash_rules unfa_rules = { unfa_equal, 0, 0, 0, 0 };


#ifdef __STDC__
static struct rx_cached_rexp *
canonical_unfa (struct rx_hash * table, struct rexp_node * rexp, int cset_size)
#else
static struct rx_cached_rexp *
canonical_unfa (table, rexp, cset_size)
     struct rx_hash * table;
     struct rexp_node * rexp;
     int cset_size;
#endif
{
  struct rx_hash_item * it;
  it = rx_hash_store (table, rx_rexp_hash (rexp, 0), rexp, &unfa_rules);

  if (it->binding == 0)
    {
      struct rx_cached_rexp * cr;

      if (it->data == (void *)rexp)
	rx_save_rexp (rexp);
      
      cr = (struct rx_cached_rexp *)malloc (sizeof (*cr));
      rx_bzero ((char *)cr, sizeof (*cr));
      if (!cr)
	return 0;
      it->binding = (void *)cr;
      cr->unfa.nfa = 0;
      cr->unfa.exp = rexp;
      cr->hash_item = it;
      rx_save_rexp (rexp);
    }
  return (struct rx_cached_rexp *)it->binding;
}


#ifdef __STDC__
static struct rx *
rx_unfa_rx (struct rx_cached_rexp * cr, struct rexp_node * exp, int cset_size)
#else
static struct rx *
rx_unfa_rx (cr, exp, cset_size)
     struct rx_cached_rexp * cr;
     struct rexp_node * exp;
     int cset_size;
#endif
{
  struct rx * new_rx;

  if (cr->unfa.nfa)
    return cr->unfa.nfa;

  new_rx = rx_make_rx (cset_size);
  if (!new_rx)
    return 0;
  {
    struct rx_nfa_state * start;
    struct rx_nfa_state * end;
    start = end = 0;
    if (!rx_build_nfa (new_rx, exp, &start, &end))
      {
	free (new_rx);
	return 0;
      }
    new_rx->start_nfa_states = start;
    end->is_final = 1;
    start->is_start = 1;
    {
      struct rx_nfa_state * s;
      int x;
      x = 0;
      for (s = new_rx->nfa_states; s; s = s->next)
	s->id = x++;
    }
  }
  cr->unfa.nfa = new_rx;
  return new_rx;
}


\f

#ifdef __STDC__
struct rx_unfaniverse *
rx_make_unfaniverse (int delay)
#else
struct rx_unfaniverse *
rx_make_unfaniverse (delay)
     int delay;
#endif
{
  struct rx_unfaniverse * it;
  it = (struct rx_unfaniverse *)malloc (sizeof (*it));
  if (!it) return 0;
  rx_bzero ((char *)it, sizeof (*it));
  it->delay = delay;
  return it;
}


#ifdef __STDC__
void
rx_free_unfaniverse (struct rx_unfaniverse * it)
#else
void
rx_free_unfaniverse (it)
     struct rx_unfaniverse * it;
#endif
{
}



\f

#ifdef __STDC__
struct rx_unfa *
rx_unfa (struct rx_unfaniverse * unfaniverse, struct rexp_node * exp, int cset_size)
#else
struct rx_unfa *
rx_unfa (unfaniverse, exp, cset_size)
     struct rx_unfaniverse * unfaniverse;
     struct rexp_node * exp;
     int cset_size;
#endif
{
  struct rx_cached_rexp * cr;
  if (exp && exp->cr)
    cr = exp->cr;
  else
    {
      cr = canonical_unfa (&unfaniverse->table, exp, cset_size);
      if (exp)
	exp->cr = cr;
    }
  if (!cr)
    return 0;
  if (cr->next)
    {
      if (unfaniverse->free_queue == cr)
	{
	  unfaniverse->free_queue = cr->next;
	  if (unfaniverse->free_queue == cr)
	    unfaniverse->free_queue = 0;
	}
      cr->next->prev = cr->prev;
      cr->prev->next = cr->next;
      cr->next = 0;
      cr->prev = 0;
      --unfaniverse->delayed;
    }
  ++cr->unfa.refs;
  cr->unfa.cset_size = cset_size;
  cr->unfa.verse = unfaniverse;
  rx_unfa_rx (cr, exp, cset_size);
  return &cr->unfa;
}


#ifdef __STDC__
void
rx_free_unfa (struct rx_unfa * unfa)
#else
void
rx_free_unfa (unfa)
     struct rx_unfa * unfa;
#endif
{
  struct rx_cached_rexp * cr;
  cr = (struct rx_cached_rexp *)unfa;
  if (!cr)
    return;
  if (!--cr->unfa.refs)
    {
      if (!unfa->verse->free_queue)
	{
	  unfa->verse->free_queue = cr;
	  cr->next = cr->prev = cr;
	}
      else
	{
	  cr->next = unfa->verse->free_queue;
	  cr->prev = unfa->verse->free_queue->prev;
	  cr->next->prev = cr;
	  cr->prev->next = cr;
	}

      ++unfa->verse->delayed;
      while (unfa->verse->delayed > unfa->verse->delay)
	{
	  struct rx_cached_rexp * it;
	  it = unfa->verse->free_queue;
	  unfa->verse->free_queue = it->next;
	  if (!--unfa->verse->delayed)
	    unfa->verse->free_queue = 0;
	  it->prev->next = it->next;
	  it->next->prev = it->prev;
	  if (it->unfa.exp)
	    it->unfa.exp->cr = 0;
	  rx_free_rexp ((struct rexp_node *)it->hash_item->data);
	  rx_hash_free (it->hash_item, &unfa_rules);
	  rx_free_rx (it->unfa.nfa);
	  rx_free_rexp (it->unfa.exp);
	  free (it);
	  if (it == cr)
	    break;
	}
    }
  else
    return;
}


#ifdef __STDC__
void
rx_save_unfa (struct rx_unfa * unfa)
#else
void
rx_save_unfa (unfa)
     struct rx_unfa * unfa;
#endif
{
  ++(unfa->refs);
}