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
Merge branch 'master' of ssh://git.indexdata.com/home/git/pub/idzebra
[idzebra-moved-to-github.git]
/
dfa
/
states.c
diff --git
a/dfa/states.c
b/dfa/states.c
index
ee68776
..
5981935
100644
(file)
--- a/
dfa/states.c
+++ b/
dfa/states.c
@@
-1,8
+1,5
@@
-/* $Id: states.c,v 1.12 2007-01-15 15:10:15 adam Exp $
- Copyright (C) 1995-2007
- Index Data ApS
-
-This file is part of the Zebra server.
+/* This file is part of the Zebra server.
+ Copyright (C) 1994-2011 Index Data
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
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
@@
-21,6
+18,9
@@
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
*/
+#if HAVE_CONFIG_H
+#include <config.h>
+#endif
#include <stdio.h>
#include <assert.h>
#include <stdio.h>
#include <assert.h>
@@
-38,7
+38,7
@@
int init_DFA_states (struct DFA_states **dfasp, DFASetType st, int hash)
struct DFA_states *dfas;
struct DFA_trans *tm;
int i;
struct DFA_states *dfas;
struct DFA_trans *tm;
int i;
-
+
dfas = (struct DFA_states *) imalloc (sizeof(struct DFA_states));
assert (dfas);
dfas->hasharray = (struct DFA_state **)
dfas = (struct DFA_states *) imalloc (sizeof(struct DFA_states));
assert (dfas);
dfas->hasharray = (struct DFA_state **)
@@
-117,7
+117,7
@@
int add_DFA_state (struct DFA_states *dfas, DFASet *s, struct DFA_state **sp)
sb = (DFA_stateb *) imalloc (sizeof(*sb));
sb->next = dfas->statemem;
dfas->statemem = sb;
sb = (DFA_stateb *) imalloc (sizeof(*sb));
sb->next = dfas->statemem;
dfas->statemem = sb;
- sb->state_block = si = dfas->freelist =
+ sb->state_block = si = dfas->freelist =
(struct DFA_state *) imalloc (sizeof(struct DFA_state)*DFA_CHUNK);
for (i = 0; i<DFA_CHUNK-1; i++, si++)
si->next = si+1;
(struct DFA_state *) imalloc (sizeof(struct DFA_state)*DFA_CHUNK);
for (i = 0; i<DFA_CHUNK-1; i++, si++)
si->next = si+1;
@@
-199,6
+199,7
@@
void sort_DFA_states (struct DFA_states *dfas)
/*
* Local variables:
* c-basic-offset: 4
/*
* Local variables:
* c-basic-offset: 4
+ * c-file-style: "Stroustrup"
* indent-tabs-mode: nil
* End:
* vim: shiftwidth=4 tabstop=8 expandtab
* indent-tabs-mode: nil
* End:
* vim: shiftwidth=4 tabstop=8 expandtab