projects
/
idzebra-moved-to-github.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
Added support for specification of staticrank for grs-class of filters.
[idzebra-moved-to-github.git]
/
dfa
/
states.c
diff --git
a/dfa/states.c
b/dfa/states.c
index
6492659
..
e006171
100644
(file)
--- a/
dfa/states.c
+++ b/
dfa/states.c
@@
-1,6
+1,6
@@
-/* $Id: states.c,v 1.7 2002-08-02 19:26:55 adam Exp $
- Copyright (C) 1995,1996,1997,1998,1999,2000,2001,2002
- Index Data Aps
+/* $Id: states.c,v 1.11 2006-08-14 10:40:08 adam Exp $
+ Copyright (C) 1995-2006
+ Index Data ApS
This file is part of the Zebra server.
This file is part of the Zebra server.
@@
-15,9
+15,9
@@
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
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.
+along with this program; if not, write to the Free Software
+Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
+
*/
*/
@@
-33,7
+33,7
@@
Free Software Foundation, 59 Temple Place - Suite 330, Boston, MA
#define DFA_CHUNK 40
#define TRAN_CHUNK 100
#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;
{
struct DFA_states *dfas;
struct DFA_trans *tm;
@@
-95,7
+95,7
@@
int rm_DFA_states (struct DFA_states **dfasp)
return 0;
}
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;
{
int i;
struct DFA_state *si, **sip;
@@
-104,12
+104,12
@@
int add_DFA_state (struct DFA_states *dfas, Set *s, struct DFA_state **sp)
assert (dfas);
assert (*s);
assert (dfas->hasharray);
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)
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;
{
*sp = si;
- *s = rm_Set (dfas->st, *s);
+ *s = rm_DFASet (dfas->st, *s);
return 0;
}
if (!dfas->freelist)
return 0;
}
if (!dfas->freelist)
@@
-196,3
+196,11
@@
void sort_DFA_states (struct DFA_states *dfas)
ifree (dfas->hasharray);
dfas->hasharray = NULL;
}
ifree (dfas->hasharray);
dfas->hasharray = NULL;
}
+/*
+ * Local variables:
+ * c-basic-offset: 4
+ * indent-tabs-mode: nil
+ * End:
+ * vim: shiftwidth=4 tabstop=8 expandtab
+ */
+