-/*
- * Copyright (C) 1994, Index Data I/S
- * All rights reserved.
- * Sebastian Hammer, Adam Dickmeiss
- *
- * $Log: states.c,v $
- * Revision 1.4 1995-09-04 12:33:28 adam
- * Various cleanup. YAZ util used instead.
- *
- * Revision 1.3 1995/01/25 11:30:51 adam
- * Simple error reporting when parsing regular expressions.
- * Memory usage reduced.
- *
- * Revision 1.2 1995/01/24 16:00:23 adam
- * Added -ansi to CFLAGS.
- * Some changes to the dfa module.
- *
- * Revision 1.1 1994/09/26 10:16:58 adam
- * First version of dfa module in alex. This version uses yacc to parse
- * regular expressions. This should be hand-made instead.
- *
- */
+/* $Id: states.c,v 1.10 2006-05-10 08:13:18 adam Exp $
+ Copyright (C) 1995-2005
+ Index Data ApS
+
+This file is part of the Zebra server.
+
+Zebra 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.
+
+Zebra 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 Zebra; see the file LICENSE.zebra. If not, write to the
+Free Software Foundation, 59 Temple Place - Suite 330, Boston, MA
+02111-1307, USA.
+*/
+
+
#include <stdio.h>
#include <assert.h>
#include <stdlib.h>
#include <string.h>
-#include <alexutil.h>
#include "dfap.h"
#include "imalloc.h"
#define DFA_CHUNK 40
#define TRAN_CHUNK 100
-int init_DFA_states (struct DFA_states **dfasp, SetType st, int hash)
+int init_DFA_states (struct DFA_states **dfasp, DFASetType st, int hash)
{
struct DFA_states *dfas;
struct DFA_trans *tm;
return 0;
}
-int add_DFA_state (struct DFA_states *dfas, Set *s, struct DFA_state **sp)
+int add_DFA_state (struct DFA_states *dfas, DFASet *s, struct DFA_state **sp)
{
int i;
struct DFA_state *si, **sip;
assert (dfas);
assert (*s);
assert (dfas->hasharray);
- sip = dfas->hasharray + (hash_Set (dfas->st, *s) % dfas->hash);
+ sip = dfas->hasharray + (hash_DFASet (dfas->st, *s) % dfas->hash);
for (si = *sip; si; si=si->link)
- if (eq_Set (dfas->st, si->set, *s))
+ if (eq_DFASet (dfas->st, si->set, *s))
{
*sp = si;
- *s = rm_Set (dfas->st, *s);
+ *s = rm_DFASet (dfas->st, *s);
return 0;
}
if (!dfas->freelist)
ifree (dfas->hasharray);
dfas->hasharray = NULL;
}
+/*
+ * Local variables:
+ * c-basic-offset: 4
+ * indent-tabs-mode: nil
+ * End:
+ * vim: shiftwidth=4 tabstop=8 expandtab
+ */
+