-/*
- * Copyright (C) 1994-1999, Index Data
- * All rights reserved.
- * Sebastian Hammer, Adam Dickmeiss
- *
- * $Log: lookupec.c,v $
- * Revision 1.7 1999-02-02 14:50:26 adam
- * Updated WIN32 code specific sections. Changed header.
- *
- * Revision 1.6 1996/02/02 13:43:51 adam
- * The public functions simply use char instead of Dict_char to represent
- * search strings. Dict_char is used internally only.
- *
- * Revision 1.5 1995/01/24 16:01:03 adam
- * Added -ansi to CFLAGS.
- * Use new API of dfa module.
- *
- * Revision 1.4 1994/10/05 12:16:51 adam
- * Pagesize is a resource now.
- *
- * Revision 1.3 1994/09/26 16:31:06 adam
- * Minor changes.
- *
- * Revision 1.2 1994/09/22 14:43:57 adam
- * First functional version of lookup with error correction. A 'range'
- * specified the maximum number of insertions+deletions+substitutions.
- *
- * Revision 1.1 1994/09/22 10:43:44 adam
- * Two versions of depend. Type 1 is the tail-type compatible with
- * all make programs. Type 2 is the GNU make with include facility.
- * Type 2 is default. depend rule chooses current rule.
- *
- */
+/* This file is part of the Zebra server.
+ Copyright (C) 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
+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
+
+*/
+
+#if HAVE_CONFIG_H
+#include <config.h>
+#endif
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <assert.h>
-#include <dict.h>
+#include "dict-p.h"
typedef unsigned MatchWord;
#define SH(x) (((x)<<1)+1)
-int dict_look_ec (Dict dict, Dict_ptr ptr, MatchInfo *mi, MatchWord *ri_base,
- int pos, int (*userfunc)(char *), int range,
- Dict_char *prefix)
+static int lookup_ec(Dict dict, Dict_ptr ptr,
+ MatchInfo *mi, MatchWord *ri_base,
+ int pos, int (*userfunc)(char *), int range,
+ Dict_char *prefix)
{
int lo, hi;
void *p;
char *info;
MatchWord match_mask = 1<<(mi->m-1);
- dict_bf_readp (dict->dbf, ptr, &p);
+ dict_bf_readp(dict->dbf, ptr, &p);
lo = 0;
hi = DICT_nodir(p)-1;
- indxp = (short*) ((char*) p+DICT_pagesize(dict)-sizeof(short));
+ indxp = (short*) ((char*) p+DICT_bsize(p)-sizeof(short));
while (lo <= hi)
{
if (indxp[-lo] > 0)
{
Dict_char ch;
- memcpy (&ch, info+j*sizeof(Dict_char), sizeof(Dict_char));
+ memcpy(&ch, info+j*sizeof(Dict_char), sizeof(Dict_char));
prefix[pos+j] = ch;
if (ch == DICT_EOS)
{
/* unsigned char length of information */
/* char * information */
info = (char*)p - indxp[-lo];
- memcpy (&ch, info+sizeof(Dict_ptr), sizeof(Dict_char));
+ memcpy(&ch, info+sizeof(Dict_ptr), sizeof(Dict_char));
prefix[pos] = ch;
-
+
sc = mi->s[ch & 255];
ri[1+range] = SH(ri[0]) & sc;
for (i=1; i<=range; i++)
prefix[pos+1] = DICT_EOS;
(*userfunc)((char*) prefix);
}
- memcpy (&subptr, info, sizeof(Dict_ptr));
+ memcpy(&subptr, info, sizeof(Dict_ptr));
if (subptr)
{
- dict_look_ec (dict, subptr, mi, ri, pos+1,
- userfunc, range, prefix);
- dict_bf_readp (dict->dbf, ptr, &p);
- indxp = (short*) ((char*) p +
- DICT_pagesize(dict)-sizeof(short));
+ lookup_ec(dict, subptr, mi, ri, pos+1,
+ userfunc, range, prefix);
+ dict_bf_readp(dict->dbf, ptr, &p);
+ indxp = (short*) ((char*) p +
+ DICT_bsize(p)-sizeof(short));
}
}
}
return 0;
}
-static MatchInfo *prepare_match (Dict_char *pattern)
+static MatchInfo *prepare_match(Dict_char *pattern)
{
int i;
MatchWord *s;
MatchInfo *mi;
- mi = xmalloc (sizeof(*mi));
- mi->m = dict_strlen (pattern);
- mi->s = s = xmalloc (sizeof(*s)*256); /* 256 !!! */
- for (i=0; i<256; i++)
+ mi = (MatchInfo *) xmalloc(sizeof(*mi));
+ mi->m = dict_strlen(pattern);
+ mi->s = s = (MatchWord *) xmalloc(sizeof(*s)*256); /* 256 !!! */
+ for (i = 0; i < 256; i++)
s[i] = 0;
- for (i=0; pattern[i]; i++)
+ for (i = 0; pattern[i]; i++)
s[pattern[i]&255] += 1<<i;
return mi;
}
-int dict_lookup_ec (Dict dict, char *pattern, int range,
- int (*userfunc)(char *name))
+int dict_lookup_ec(Dict dict, char *pattern, int range,
+ int (*userfunc)(char *name))
{
MatchInfo *mi;
MatchWord *ri;
- int i;
+ int ret, i;
Dict_char prefix[2048];
- if (dict->head.last == 1)
+ if (!dict->head.root)
return 0;
-
- mi = prepare_match ((Dict_char*) pattern);
- ri = xmalloc ((dict_strlen((Dict_char*) pattern)+range+2)
- * (range+1)*sizeof(*ri));
- for (i=0; i<=range; i++)
+ mi = prepare_match((Dict_char*) pattern);
+
+ ri = (MatchWord *) xmalloc((dict_strlen((Dict_char*) pattern)+range+2)
+ * (range+1)*sizeof(*ri));
+ for (i = 0; i <= range; i++)
ri[i] = (2<<i)-1;
-
- i = dict_look_ec (dict, 1, mi, ri, 0, userfunc, range, prefix);
- xfree (ri);
- return i;
+
+ ret = lookup_ec(dict, dict->head.root, mi, ri, 0, userfunc,
+ range, prefix);
+ xfree(ri);
+ return ret;
}
+/*
+ * Local variables:
+ * c-basic-offset: 4
+ * c-file-style: "Stroustrup"
+ * indent-tabs-mode: nil
+ * End:
+ * vim: shiftwidth=4 tabstop=8 expandtab
+ */
+
projects / idzebra-moved-to-github.git / blobdiff