-/*
- * Copyright (C) 1994-1997, Index Data I/S
- * All rights reserved.
- * Sebastian Hammer, Adam Dickmeiss
- *
- * $Log: dfap.h,v $
- * Revision 1.7 1997-09-29 09:05:17 adam
- * Thread safe DFA module. We simply had to put a few static vars to
- * the DFA_parse structure.
- *
- * Revision 1.6 1997/09/18 08:59:17 adam
- * Extra generic handle for the character mapping routines.
- *
- * Revision 1.5 1997/09/05 15:29:58 adam
- * Changed prototype for chr_map_input - added const.
- * Added support for C++, headers uses extern "C" for public definitions.
- *
- * Revision 1.4 1996/06/04 10:20:03 adam
- * Added support for character mapping.
- *
- * Revision 1.3 1996/01/08 09:09:19 adam
- * Function dfa_parse got 'const' string argument.
- * New functions to define char mappings made public.
- *
- * Revision 1.2 1995/01/25 11:30:50 adam
- * Simple error reporting when parsing regular expressions.
- * Memory usage reduced.
- *
- * Revision 1.1 1995/01/24 16:02:53 adam
- * New private header file in dfa module (dfap.h).
- * Module no longer uses yacc to parse regular expressions.
- *
- */
+/* $Id: dfap.h,v 1.14 2006-08-14 10:40:08 adam Exp $
+ Copyright (C) 1995-2006
+ 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 this program; if not, write to the Free Software
+Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
+
+*/
+
+
#ifndef DFAP_H
#define DFAP_H
#include <dfa.h>
+#ifdef __cplusplus
+extern "C" {
+#endif
+
struct DFA_parse {
struct Tnode *root; /* root of regular syntax tree */
int position; /* no of positions so far */
struct Tnode **posar;
- SetType poset;
- Set *followpos;
+ DFASetType poset;
+ DFASet *followpos;
const char **(*cmap)(void *vp, const char **from, int len);
};
struct DFA_state *marked; /* chain of marked DFA states */
DFA_stateb *statemem; /* state memory */
int no; /* no of states (unmarked+marked) */
- SetType st; /* Position set type */
+ DFASetType st; /* Position set type */
int hash; /* no hash entries in hasharray */
struct DFA_state **hasharray; /* hash pointers */
struct DFA_state **sortarray; /* sorted DFA states */
struct DFA_trans *transmem; /* transition memory */
};
-int init_DFA_states (struct DFA_states **dfasp, SetType st, int hash);
+int init_DFA_states (struct DFA_states **dfasp, DFASetType st, int hash);
int rm_DFA_states (struct DFA_states **dfasp);
-int add_DFA_state (struct DFA_states *dfas, Set *s,
+int add_DFA_state (struct DFA_states *dfas, DFASet *s,
struct DFA_state **sp);
struct DFA_state *get_DFA_state (struct DFA_states *dfas);
void sort_DFA_states (struct DFA_states *dfas);
void add_DFA_tran (struct DFA_states *, struct DFA_state *,
int, int, int);
+#ifdef __cplusplus
+}
+#endif
#endif
+/*
+ * Local variables:
+ * c-basic-offset: 4
+ * indent-tabs-mode: nil
+ * End:
+ * vim: shiftwidth=4 tabstop=8 expandtab
+ */
+