-/*
- * Copyright (C) 1994, Index Data I/S
- * All rights reserved.
- * Sebastian Hammer, Adam Dickmeiss
- *
- * $Log: dfap.h,v $
- * 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.12 2005-01-15 21:45:42 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.
+*/
+
+
#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 Tblock *end; /* end block of Tnodes */
int *charMap;
int charMapSize;
+ void *cmap_data;
+
+ unsigned look_ch;
+ int lookahead;
+ BSet look_chars;
+ int err_code;
+ int inside_string;
+ const unsigned char *expr_ptr;
+
+ struct Tnode **posar;
+
+ DFASetType poset;
+ DFASet *followpos;
+
+ const char **(*cmap)(void *vp, const char **from, int len);
};
typedef struct DFA_stateb_ {
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