X-Git-Url: http://git.indexdata.com/?a=blobdiff_plain;f=index%2Fzrpn.c;h=2a45b7d90839feba3c49fef8c653f4bd2c16491c;hb=9cf5dedda26c0ebaf38daa6fa3f15a763d6b2fcb;hp=c647c83a7a70f68037016a1d439c5df5a4bf0b76;hpb=3f05d9800b0d3b0acc2fcf9b90b71e630d09a90d;p=idzebra-moved-to-github.git diff --git a/index/zrpn.c b/index/zrpn.c index c647c83..2a45b7d 100644 --- a/index/zrpn.c +++ b/index/zrpn.c @@ -4,7 +4,41 @@ * Sebastian Hammer, Adam Dickmeiss * * $Log: zrpn.c,v $ - * Revision 1.49 1996-06-04 10:18:11 adam + * Revision 1.59 1997-01-17 11:31:46 adam + * Bug fix: complete phrase search didn't work. + * + * Revision 1.58 1996/12/23 15:30:45 adam + * Work on truncation. + * Bug fix: result sets weren't deleted after server shut down. + * + * Revision 1.57 1996/11/11 13:38:02 adam + * Added proximity support in search. + * + * Revision 1.56 1996/11/08 11:10:32 adam + * Buffers used during file match got bigger. + * Compressed ISAM support everywhere. + * Bug fixes regarding masking characters in queries. + * Redesigned Regexp-2 queries. + * + * Revision 1.55 1996/11/04 14:07:44 adam + * Moved truncation code to trunc.c. + * + * Revision 1.54 1996/10/29 14:09:52 adam + * Use of cisam system - enabled if setting isamc is 1. + * + * Revision 1.53 1996/06/26 09:21:43 adam + * Bug fix: local attribute set wasn't obeyed in scan. + * + * Revision 1.52 1996/06/17 14:26:20 adam + * Function gen_regular_rel changed to handle negative numbers. + * + * Revision 1.51 1996/06/11 10:54:15 quinn + * Relevance work + * + * Revision 1.50 1996/06/07 08:51:53 adam + * Bug fix: Character mapping was broken (introducued by last revision). + * + * Revision 1.49 1996/06/04 10:18:11 adam * Search/scan uses character mapping module. * * Revision 1.48 1996/05/28 15:15:01 adam @@ -179,7 +213,6 @@ #include "attribute.h" #include -#include #include #include #include @@ -246,291 +279,223 @@ static void attr_init (AttrType *src, Z_AttributesPlusTerm *zapt, src->minor = 0; } -struct trunc_info { - int *ptr; - int *indx; - char **heap; - int heapnum; - int (*cmp)(const void *p1, const void *p2); - int keysize; - char *swapbuf; - char *tmpbuf; - char *buf; -}; +#define TERM_COUNT + +struct grep_info { +#ifdef TERM_COUNT + int *term_no; +#endif + ISAM_P *isam_p_buf; + int isam_p_size; + int isam_p_indx; +}; -static void heap_swap (struct trunc_info *ti, int i1, int i2) +static void add_isam_p (const char *info, struct grep_info *p) { - int swap; - - swap = ti->ptr[i1]; - ti->ptr[i1] = ti->ptr[i2]; - ti->ptr[i2] = swap; -} + if (p->isam_p_indx == p->isam_p_size) + { + ISAM_P *new_isam_p_buf; +#ifdef TERM_COUNT + int *new_term_no; +#endif + + p->isam_p_size = 2*p->isam_p_size + 100; + new_isam_p_buf = xmalloc (sizeof(*new_isam_p_buf) * + p->isam_p_size); + if (p->isam_p_buf) + { + memcpy (new_isam_p_buf, p->isam_p_buf, + p->isam_p_indx * sizeof(*p->isam_p_buf)); + xfree (p->isam_p_buf); + } + p->isam_p_buf = new_isam_p_buf; -static void heap_delete (struct trunc_info *ti) -{ - int cur = 1, child = 2; - - heap_swap (ti, 1, ti->heapnum--); - while (child <= ti->heapnum) { - if (child < ti->heapnum && - (*ti->cmp)(ti->heap[ti->ptr[child]], - ti->heap[ti->ptr[1+child]]) > 0) - child++; - if ((*ti->cmp)(ti->heap[ti->ptr[cur]], - ti->heap[ti->ptr[child]]) > 0) +#ifdef TERM_COUNT + new_term_no = xmalloc (sizeof(*new_term_no) * + p->isam_p_size); + if (p->term_no) { - heap_swap (ti, cur, child); - cur = child; - child = 2*cur; + memcpy (new_term_no, p->isam_p_buf, + p->isam_p_indx * sizeof(*p->term_no)); + xfree (p->term_no); } - else - break; + p->term_no = new_term_no; +#endif } + assert (*info == sizeof(*p->isam_p_buf)); + memcpy (p->isam_p_buf + p->isam_p_indx, info+1, sizeof(*p->isam_p_buf)); + (p->isam_p_indx)++; } -static void heap_insert (struct trunc_info *ti, const char *buf, int indx) +static int grep_handle (char *name, const char *info, void *p) { - int cur, parent; - - cur = ++(ti->heapnum); - memcpy (ti->heap[ti->ptr[cur]], buf, ti->keysize); - ti->indx[ti->ptr[cur]] = indx; - parent = cur/2; - while (parent && (*ti->cmp)(ti->heap[ti->ptr[parent]], - ti->heap[ti->ptr[cur]]) > 0) - { - heap_swap (ti, cur, parent); - cur = parent; - parent = cur/2; - } + add_isam_p (info, p); + return 0; } -static -struct trunc_info *heap_init (int size, int key_size, - int (*cmp)(const void *p1, const void *p2)) +static int term_pre (char **src, const char *ct1, const char *ct2) { - struct trunc_info *ti = xmalloc (sizeof(*ti)); - int i; + char *s1, *s0 = *src; + char **map; - ++size; - ti->heapnum = 0; - ti->keysize = key_size; - ti->cmp = cmp; - ti->indx = xmalloc (size * sizeof(*ti->indx)); - ti->heap = xmalloc (size * sizeof(*ti->heap)); - ti->ptr = xmalloc (size * sizeof(*ti->ptr)); - ti->swapbuf = xmalloc (ti->keysize); - ti->tmpbuf = xmalloc (ti->keysize); - ti->buf = xmalloc (size * ti->keysize); - for (i = size; --i >= 0; ) + /* skip white space */ + while (*s0) { - ti->ptr[i] = i; - ti->heap[i] = ti->buf + ti->keysize * i; + if (ct1 && strchr (ct1, *s0)) + break; + if (ct2 && strchr (ct2, *s0)) + break; + s1 = s0; + map = map_chrs_input (&s1, strlen(s1)); + if (**map != *CHR_SPACE) + break; + s0 = s1; } - return ti; -} - -static void heap_close (struct trunc_info *ti) -{ - xfree (ti->ptr); - xfree (ti->indx); - xfree (ti->heap); - xfree (ti->swapbuf); - xfree (ti->tmpbuf); - xfree (ti); + *src = s0; + return *s0; } -static RSET rset_trunc_r (ISAM isam, ISAM_P *isam_p, int from, int to, - int merge_chunk) +static int term_100 (char **src, char *dst, int space_split) { - RSET result; - RSFD result_rsfd; - rset_temp_parms parms; - - parms.key_size = sizeof(struct it_key); - result = rset_create (rset_kind_temp, &parms); - result_rsfd = rset_open (result, RSETF_WRITE|RSETF_SORT_SYSNO); + char *s0, *s1, **map; + int i = 0; - if (to - from > merge_chunk) + if (!term_pre (src, NULL, NULL)) + return 0; + s0 = *src; + while (*s0) { - RSFD *rsfd; - RSET *rset; - int i, i_add = (to-from)/merge_chunk + 1; - struct trunc_info *ti; - int rscur = 0; - int rsmax = (to-from)/i_add + 1; - - rset = xmalloc (sizeof(*rset) * rsmax); - rsfd = xmalloc (sizeof(*rsfd) * rsmax); - - for (i = from; i < to; i += i_add) - { - if (i_add <= to - i) - rset[rscur] = rset_trunc_r (isam, isam_p, i, i+i_add, - merge_chunk); - else - rset[rscur] = rset_trunc_r (isam, isam_p, i, to, - merge_chunk); - rscur++; - } - ti = heap_init (rscur, sizeof(struct it_key), key_compare); - for (i = rscur; --i >= 0; ) - { - rsfd[i] = rset_open (rset[i], RSETF_READ|RSETF_SORT_SYSNO); - if (rset_read (rset[i], rsfd[i], ti->tmpbuf)) - heap_insert (ti, ti->tmpbuf, i); - else - { - rset_close (rset[i], rsfd[i]); - rset_delete (rset[i]); - } - } - while (ti->heapnum) + s1 = s0; + map = map_chrs_input (&s0, strlen(s0)); + if (space_split && **map == *CHR_SPACE) + break; + while (s1 < s0) { - int n = ti->indx[ti->ptr[1]]; - - rset_write (result, result_rsfd, ti->heap[ti->ptr[1]]); - - while (1) - { - if (!rset_read (rset[n], rsfd[n], ti->tmpbuf)) - { - heap_delete (ti); - rset_close (rset[n], rsfd[n]); - rset_delete (rset[n]); - break; - } - if ((*ti->cmp)(ti->tmpbuf, ti->heap[ti->ptr[1]]) > 1) - { - heap_delete (ti); - heap_insert (ti, ti->tmpbuf, n); - break; - } - } + if (!isalnum (*s1)) + dst[i++] = '\\'; + dst[i++] = *s1++; } - xfree (rset); - xfree (rsfd); - heap_close (ti); } - else - { - ISPT *ispt; - int i; - struct trunc_info *ti; + dst[i] = '\0'; + *src = s0; + return i; +} - ispt = xmalloc (sizeof(*ispt) * (to-from)); +static int term_101 (char **src, char *dst, int space_split) +{ + char *s0, *s1, **map; + int i = 0; - ti = heap_init (to-from, sizeof(struct it_key), - key_compare); - for (i = to-from; --i >= 0; ) + if (!term_pre (src, "#", "#")) + return 0; + s0 = *src; + while (*s0) + { + if (*s0 == '#') { - ispt[i] = is_position (isam, isam_p[from+i]); - if (is_readkey (ispt[i], ti->tmpbuf)) - heap_insert (ti, ti->tmpbuf, i); - else - is_pt_free (ispt[i]); + dst[i++] = '.'; + dst[i++] = '*'; + s0++; } - while (ti->heapnum) + else { - int n = ti->indx[ti->ptr[1]]; - - rset_write (result, result_rsfd, ti->heap[ti->ptr[1]]); -#if 0 -/* section that preserve all keys */ - heap_delete (ti); - if (is_readkey (ispt[n], ti->tmpbuf)) - heap_insert (ti, ti->tmpbuf, n); - else - is_pt_free (ispt[n]); -#else -/* section that preserve all keys with unique sysnos */ - while (1) + s1 = s0; + map = map_chrs_input (&s0, strlen(s0)); + if (space_split && **map == *CHR_SPACE) + break; + while (s1 < s0) { - if (!is_readkey (ispt[n], ti->tmpbuf)) - { - heap_delete (ti); - is_pt_free (ispt[n]); - break; - } - if ((*ti->cmp)(ti->tmpbuf, ti->heap[ti->ptr[1]]) > 1) - { - heap_delete (ti); - heap_insert (ti, ti->tmpbuf, n); - break; - } + if (!isalnum (*s1)) + dst[i++] = '\\'; + dst[i++] = *s1++; } -#endif } - heap_close (ti); - xfree (ispt); } - rset_close (result, result_rsfd); - return result; + dst[i] = '\0'; + *src = s0; + return i; } -static int isam_trunc_cmp (const void *p1, const void *p2) -{ - ISAM_P i1 = *(ISAM_P*) p1; - ISAM_P i2 = *(ISAM_P*) p2; - int d; - - d = is_type (i1) - is_type (i2); - if (d) - return d; - return is_block (i1) - is_block (i2); -} -static RSET rset_trunc (ISAM isam, ISAM_P *isam_p, int no) +static int term_103 (char **src, char *dst, int *errors, int space_split) { + int i = 0; + char *s0, *s1, **map; - qsort (isam_p, no, sizeof(*isam_p), isam_trunc_cmp); - return rset_trunc_r (isam, isam_p, 0, no, 100); -} - -struct grep_info { - ISAM_P *isam_p_buf; - int isam_p_size; - int isam_p_indx; -}; - -static void add_isam_p (const char *info, struct grep_info *p) -{ - if (p->isam_p_indx == p->isam_p_size) + if (!term_pre (src, "\\()[].*+?|", "(")) + return 0; + s0 = *src; + if (errors && *s0 == '+' && s0[1] && s0[2] == '+' && s0[3] && + isdigit (s0[1])) { - ISAM_P *new_isam_p_buf; - - p->isam_p_size = 2*p->isam_p_size + 100; - new_isam_p_buf = xmalloc (sizeof(*new_isam_p_buf) * - p->isam_p_size); - if (p->isam_p_buf) + *errors = s0[1] - '0'; + s0 += 3; + if (*errors > 3) + *errors = 3; + } + while (*s0) + { + if (strchr ("\\()[].*+?|-", *s0)) + dst[i++] = *s0++; + else { - memcpy (new_isam_p_buf, p->isam_p_buf, - p->isam_p_indx * sizeof(*p->isam_p_buf)); - xfree (p->isam_p_buf); + s1 = s0; + map = map_chrs_input (&s0, strlen(s0)); + if (**map == *CHR_SPACE) + break; + while (s1 < s0) + { + if (!isalnum (*s1)) + dst[i++] = '\\'; + dst[i++] = *s1++; + } } - p->isam_p_buf = new_isam_p_buf; } - assert (*info == sizeof(*p->isam_p_buf)); - memcpy (p->isam_p_buf + p->isam_p_indx, info+1, sizeof(*p->isam_p_buf)); - (p->isam_p_indx)++; + dst[i] = '\0'; + *src = s0; + return i; } -static int grep_handle (char *name, const char *info, void *p) +static int term_102 (char **src, char *dst, int space_split) { - logf (LOG_DEBUG, "dict name: %s", name); - add_isam_p (info, p); - return 0; + return term_103 (src, dst, NULL, space_split); } +/* gen_regular_rel - generate regular expression from relation + * val: border value (inclusive) + * islt: 1 if <=; 0 if >=. + */ static void gen_regular_rel (char *dst, int val, int islt) { - int dst_p = 1; + int dst_p; int w, d, i; int pos = 0; char numstr[20]; - *dst = '('; + logf (LOG_DEBUG, "gen_regular_rel. val=%d, islt=%d", val, islt); + if (val >= 0) + { + if (islt) + strcpy (dst, "(-[0-9]+|"); + else + strcpy (dst, "("); + } + else + { + if (!islt) + { + strcpy (dst, "([0-9]+|-"); + dst_p = strlen (dst); + islt = 1; + } + else + { + strcpy (dst, "(-"); + islt = 0; + } + val = -val; + } + dst_p = strlen (dst); sprintf (numstr, "%d", val); for (w = strlen(numstr); --w >= 0; pos++) { @@ -606,7 +571,7 @@ static void gen_regular_rel (char *dst, int val, int islt) } static int relational_term (ZServerInfo *zi, Z_AttributesPlusTerm *zapt, - const char *term_sub, + char **term_sub, char *term_dict, oid_value attributeSet, struct grep_info *grep_info, @@ -619,29 +584,40 @@ static int relational_term (ZServerInfo *zi, Z_AttributesPlusTerm *zapt, attr_init (&relation, zapt, 2); relation_value = attr_find (&relation, NULL); - term_value = atoi (term_sub); switch (relation_value) { case 1: + if (!term_100 (term_sub, term_dict, 1)) + return 0; + term_value = atoi (term_dict); if (term_value <= 0) return 1; logf (LOG_DEBUG, "Relation <"); gen_regular_rel (term_dict + strlen(term_dict), term_value-1, 1); break; case 2: + if (!term_100 (term_sub, term_dict, 1)) + return 0; + term_value = atoi (term_dict); if (term_value < 0) return 1; logf (LOG_DEBUG, "Relation <="); gen_regular_rel (term_dict + strlen(term_dict), term_value, 1); break; case 4: + if (!term_100 (term_sub, term_dict, 1)) + return 0; + term_value = atoi (term_dict); if (term_value < 0) term_value = 0; logf (LOG_DEBUG, "Relation >="); gen_regular_rel (term_dict + strlen(term_dict), term_value, 0); break; case 5: + if (!term_100 (term_sub, term_dict, 1)) + return 0; + term_value = atoi (term_dict); if (term_value < 0) term_value = 0; logf (LOG_DEBUG, "Relation >"); @@ -651,7 +627,7 @@ static int relational_term (ZServerInfo *zi, Z_AttributesPlusTerm *zapt, return 0; } logf (LOG_DEBUG, "dict_lookup_grep: %s", term_dict); - r = dict_lookup_grep (zi->wordDict, term_dict, 0, grep_info, max_pos, + r = dict_lookup_grep (zi->dict, term_dict, 0, grep_info, max_pos, 0, grep_handle); if (r) logf (LOG_WARN, "dict_lookup_grep fail, rel=gt: %d", r); @@ -659,29 +635,23 @@ static int relational_term (ZServerInfo *zi, Z_AttributesPlusTerm *zapt, return 1; } -static void verbatim_char (int ch, int *indx, char *dst) -{ - if (!isalnum (ch)) - dst[(*indx)++] = '\\'; - dst[(*indx)++] = ch; -} - static int field_term (ZServerInfo *zi, Z_AttributesPlusTerm *zapt, - const char *term_sub, int regType, + char **term_sub, int regType, oid_value attributeSet, struct grep_info *grep_info, - int num_bases, char **basenames) + int num_bases, char **basenames, int space_split) { char term_dict[2*IT_MAX_WORD+2]; - int i, j, r, base_no; + int j, r, base_no; AttrType truncation; int truncation_value; AttrType use; int use_value; oid_value curAttributeSet = attributeSet; + char *termp; attr_init (&use, zapt, 1); use_value = attr_find (&use, &curAttributeSet); - logf (LOG_DEBUG, "use value %d", use_value); + logf (LOG_DEBUG, "field_term, use value %d", use_value); attr_init (&truncation, zapt, 5); truncation_value = attr_find (&truncation, NULL); logf (LOG_DEBUG, "truncation value %d", truncation_value); @@ -695,6 +665,7 @@ static int field_term (ZServerInfo *zi, Z_AttributesPlusTerm *zapt, data1_local_attribute *local_attr; int max_pos, prefix_len = 0; + termp = *term_sub; attp = att_getentbyatt (curAttributeSet, use_value); if (!attp) { @@ -734,31 +705,34 @@ static int field_term (ZServerInfo *zi, Z_AttributesPlusTerm *zapt, term_dict[prefix_len++] = 1; term_dict[prefix_len++] = regType; term_dict[prefix_len] = '\0'; - if (!relational_term (zi, zapt, term_sub, term_dict, + if (!relational_term (zi, zapt, &termp, term_dict, attributeSet, grep_info, &max_pos)) { - const char *cp; - j = prefix_len; + logf (LOG_LOG, "xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx"); switch (truncation_value) { case -1: /* not specified */ case 100: /* do not truncate */ - term_dict[j++] = '('; - for (i = 0; term_sub[i]; i++) - verbatim_char (term_sub[i], &j, term_dict); - strcpy (term_dict+j, ")"); - r = dict_lookup_grep (zi->wordDict, term_dict, 0, grep_info, + term_dict[j++] = '('; + logf (LOG_LOG, "termp=%s", termp); + if (!term_100 (&termp, term_dict + j, space_split)) + { + logf (LOG_LOG, "aaaaaaaaaaaaargh"); + return 0; + } + strcat (term_dict, ")"); + r = dict_lookup_grep (zi->dict, term_dict, 0, grep_info, &max_pos, 0, grep_handle); if (r) logf (LOG_WARN, "dict_lookup_grep err, trunc=none:%d", r); break; case 1: /* right truncation */ term_dict[j++] = '('; - for (i = 0; term_sub[i]; i++) - verbatim_char (term_sub[i], &j, term_dict); - strcpy (term_dict+j, ".*)"); - dict_lookup_grep (zi->wordDict, term_dict, 0, grep_info, + if (!term_100 (&termp, term_dict + j, space_split)) + return 0; + strcat (term_dict, ".*)"); + dict_lookup_grep (zi->dict, term_dict, 0, grep_info, &max_pos, 0, grep_handle); break; case 2: /* left truncation */ @@ -767,40 +741,35 @@ static int field_term (ZServerInfo *zi, Z_AttributesPlusTerm *zapt, return -1; case 101: /* process # in term */ term_dict[j++] = '('; - for (i=0; term_sub[i]; i++) - if (term_sub[i] == '#' && i > 2) - { - term_dict[j++] = '.'; - term_dict[j++] = '*'; - } - else - verbatim_char (term_sub[i], &j, term_dict); - strcpy (term_dict+j, ")"); - r = dict_lookup_grep (zi->wordDict, term_dict, 0, grep_info, + if (!term_101 (&termp, term_dict + j, space_split)) + return 0; + strcat (term_dict, ")"); + r = dict_lookup_grep (zi->dict, term_dict, 0, grep_info, &max_pos, 0, grep_handle); if (r) - logf (LOG_WARN, "dict_lookup_grep err, trunc=#: %d", - r); + logf (LOG_WARN, "dict_lookup_grep err, trunc=#: %d", r); break; - case 102: /* regular expression */ - sprintf (term_dict + j, "(%s)", term_sub); - r = dict_lookup_grep (zi->wordDict, term_dict, 0, grep_info, + case 102: /* Regexp-1 */ + term_dict[j++] = '('; + if (!term_102 (&termp, term_dict + j, space_split)) + return 0; + strcat (term_dict, ")"); + logf (LOG_DEBUG, "Regexp-1 tolerance=%d", r); + r = dict_lookup_grep (zi->dict, term_dict, 0, grep_info, &max_pos, 0, grep_handle); if (r) logf (LOG_WARN, "dict_lookup_grep err, trunc=regular: %d", r); break; - case 103: /* regular expression with error correction */ - cp = term_sub; - r = 0; - if (*cp == '*' && cp[1] && cp[2]) - { - r = atoi (cp+1); - cp += 2; - } - sprintf (term_dict + j, "(%s)", cp); - r = dict_lookup_grep (zi->wordDict, term_dict, r, grep_info, - &max_pos, j, grep_handle); + case 103: /* Regexp-1 */ + r = 1; + term_dict[j++] = '('; + if (!term_103 (&termp, term_dict + j, &r, space_split)) + return 0; + strcat (term_dict, ")"); + logf (LOG_DEBUG, "Regexp-2 tolerance=%d", r); + r = dict_lookup_grep (zi->dict, term_dict, r, grep_info, + &max_pos, 2, grep_handle); if (r) logf (LOG_WARN, "dict_lookup_grep err, trunc=eregular: %d", r); @@ -808,8 +777,9 @@ static int field_term (ZServerInfo *zi, Z_AttributesPlusTerm *zapt, } } } + *term_sub = termp; logf (LOG_DEBUG, "%d positions", grep_info->isam_p_indx); - return 0; + return 1; } static void trans_term (ZServerInfo *zi, Z_AttributesPlusTerm *zapt, @@ -830,7 +800,7 @@ static void trans_scan_term (ZServerInfo *zi, Z_AttributesPlusTerm *zapt, { Z_Term *term = zapt->term; char **map; - const char *cp = (const char *) term->u.general->buf; + char *cp = (char*) term->u.general->buf; const char *cp_end = cp + term->u.general->len; const char *src; int i = 0; @@ -861,15 +831,18 @@ static RSET rpn_search_APT_relevance (ZServerInfo *zi, { rset_relevance_parms parms; char termz[IT_MAX_WORD+1]; - char term_sub[IT_MAX_WORD+1]; + char *termp = termz; struct grep_info grep_info; - char *p0 = termz, *p1 = NULL; RSET result; + int term_index = 0; + int r; parms.key_size = sizeof(struct it_key); - parms.max_rec = 100; - parms.cmp = key_compare; - parms.is = zi->wordIsam; + parms.max_rec = 1000; + parms.cmp = key_compare_it; + parms.is = zi->isam; + parms.isc = zi->isamc; + parms.no_terms = 0; if (zapt->term->which != Z_Term_general) { @@ -878,44 +851,34 @@ static RSET rpn_search_APT_relevance (ZServerInfo *zi, } trans_term (zi, zapt, termz); +#ifdef TERM_COUNT + grep_info.term_no = 0; +#endif grep_info.isam_p_indx = 0; grep_info.isam_p_size = 0; grep_info.isam_p_buf = NULL; while (1) { - char **map; - char *p2 = NULL; - p1 = p0; - while (*p1) - { - map = map_chrs_input (&p1, strlen(p1)); - if (**map == *CHR_SPACE) - break; - p2 = p1; - } - if (p1 == p0) - break; - memcpy (term_sub, p0, p2-p0); - term_sub[p2-p0] = '\0'; - while (*p1) - { - map = map_chrs_input (&p1, strlen(p1)); - if (**map == *CHR_SPACE) - break; - } - if (field_term (zi, zapt, term_sub, 'w', attributeSet, &grep_info, - num_bases, basenames)) - return NULL; - if (!p1) + r = field_term (zi, zapt, &termp, 'w', attributeSet, &grep_info, + num_bases, basenames, 1); + if (r <= 0) break; - p0 = p1; +#ifdef TERM_COUNT + for (; term_index < grep_info.isam_p_indx; term_index++) + grep_info.term_no[term_index] = parms.no_terms; + parms.no_terms++; +#endif } + parms.term_no = grep_info.term_no; parms.isam_positions = grep_info.isam_p_buf; parms.no_isam_positions = grep_info.isam_p_indx; if (grep_info.isam_p_indx > 0) result = rset_create (rset_kind_relevance, &parms); else result = rset_create (rset_kind_null, NULL); +#ifdef TERM_COUNT + xfree(grep_info.term_no); +#endif xfree (grep_info.isam_p_buf); return result; } @@ -925,10 +888,11 @@ static RSET rpn_search_APT_cphrase (ZServerInfo *zi, oid_value attributeSet, int num_bases, char **basenames) { - rset_isam_parms parms; char termz[IT_MAX_WORD+1]; struct grep_info grep_info; RSET result; + char *termp = termz; + int r; if (zapt->term->which != Z_Term_general) { @@ -937,25 +901,109 @@ static RSET rpn_search_APT_cphrase (ZServerInfo *zi, } trans_term (zi, zapt, termz); +#ifdef TERM_COUNT + grep_info.term_no = 0; +#endif grep_info.isam_p_indx = 0; grep_info.isam_p_size = 0; grep_info.isam_p_buf = NULL; - if (field_term (zi, zapt, termz, 'p', attributeSet, &grep_info, - num_bases, basenames)) - return NULL; - if (grep_info.isam_p_indx < 1) - result = rset_create (rset_kind_null, NULL); - else if (grep_info.isam_p_indx == 1) + r = field_term (zi, zapt, &termp, 'p', attributeSet, &grep_info, + num_bases, basenames, 0); + result = rset_trunc (zi, grep_info.isam_p_buf, grep_info.isam_p_indx); +#ifdef TERM_COUNT + xfree(grep_info.term_no); +#endif + xfree (grep_info.isam_p_buf); + return result; +} + +static RSET rpn_proximity (RSET rset1, RSET rset2, int ordered, + int exclusion, int relation, int distance) +{ + int i; + RSFD rsfd1, rsfd2; + int more1, more2; + struct it_key buf1, buf2; + RSFD rsfd_result; + RSET result; + rset_temp_parms parms; + + rsfd1 = rset_open (rset1, RSETF_READ|RSETF_SORT_SYSNO); + more1 = rset_read (rset1, rsfd1, &buf1); + + rsfd2 = rset_open (rset2, RSETF_READ|RSETF_SORT_SYSNO); + more2 = rset_read (rset2, rsfd2, &buf2); + + parms.key_size = sizeof (struct it_key); + result = rset_create (rset_kind_temp, &parms); + rsfd_result = rset_open (result, RSETF_WRITE|RSETF_SORT_SYSNO); + + logf (LOG_DEBUG, "rpn_proximity excl=%d ord=%d rel=%d dis=%d", + exclusion, ordered, relation, distance); + while (more1 && more2) { - parms.is = zi->wordIsam; - parms.pos = *grep_info.isam_p_buf; - result = rset_create (rset_kind_isam, &parms); + int cmp = key_compare_it (&buf1, &buf2); + if (cmp < -1) + more1 = rset_read (rset1, rsfd1, &buf1); + else if (cmp > 1) + more2 = rset_read (rset2, rsfd2, &buf2); + else + { + int sysno = buf1.sysno; + int seqno[500]; + int n = 0; + + seqno[n++] = buf1.seqno; + while ((more1 = rset_read (rset1, rsfd1, &buf1)) && + sysno == buf1.sysno) + if (n < 500) + seqno[n++] = buf1.seqno; + do + { + for (i = 0; i= */ + if (diff >= distance) + excl = !excl; + break; + case 5: /* > */ + if (diff > distance) + excl = !excl; + break; + case 6: /* != */ + if (diff != distance) + excl = !excl; + break; + } + if (excl) + rset_write (result, rsfd_result, &buf2); + } + } while ((more2 = rset_read (rset2, rsfd2, &buf2)) && + sysno == buf2.sysno); + } } - else - result = rset_trunc (zi->wordIsam, grep_info.isam_p_buf, - grep_info.isam_p_indx); - xfree (grep_info.isam_p_buf); + rset_close (result, rsfd_result); + rset_close (rset1, rsfd1); + rset_close (rset2, rsfd2); return result; } @@ -1006,7 +1054,7 @@ static RSET rpn_prox (RSET *rset, int rset_no) *more = 0; break; } - cmp = key_compare (buf[i], buf[i-1]); + cmp = key_compare_it (buf[i], buf[i-1]); if (cmp > 1) { more[i-1] = rset_read (rset[i-1], rsfd[i-1], buf[i-1]); @@ -1051,10 +1099,9 @@ static RSET rpn_search_APT_phrase (ZServerInfo *zi, int num_bases, char **basenames) { char termz[IT_MAX_WORD+1]; - char term_sub[IT_MAX_WORD+1]; - char *p0 = termz, *p1 = NULL; + char *termp = termz; RSET rset[60], result; - int i, rset_no = 0; + int i, r, rset_no = 0; struct grep_info grep_info; if (zapt->term->which != Z_Term_general) @@ -1064,63 +1111,33 @@ static RSET rpn_search_APT_phrase (ZServerInfo *zi, } trans_term (zi, zapt, termz); +#ifdef TERM_COUNT + grep_info.term_no = 0; +#endif grep_info.isam_p_size = 0; grep_info.isam_p_buf = NULL; while (1) { - char **map; - char *p2 = NULL; - p1 = p0; - while (*p1) - { - map = map_chrs_input (&p1, strlen(p1)); - if (**map == *CHR_SPACE) - break; - p2 = p1; - } - if (p1 == p0) - break; - memcpy (term_sub, p0, p2-p0); - term_sub[p2-p0] = '\0'; - p0 = p1; - while (*p1) - { - map = map_chrs_input (&p1, strlen(p1)); - if (**map != *CHR_SPACE) - break; - p0 = p1; - } grep_info.isam_p_indx = 0; - if (field_term (zi, zapt, term_sub, 'w', attributeSet, &grep_info, - num_bases, basenames)) - return NULL; - if (grep_info.isam_p_indx == 0) - rset[rset_no] = rset_create (rset_kind_null, NULL); - else if (grep_info.isam_p_indx > 1) - rset[rset_no] = rset_trunc (zi->wordIsam, - grep_info.isam_p_buf, - grep_info.isam_p_indx); - else - { - rset_isam_parms parms; - - parms.is = zi->wordIsam; - parms.pos = *grep_info.isam_p_buf; - rset[rset_no] = rset_create (rset_kind_isam, &parms); - } + r = field_term (zi, zapt, &termp, 'w', attributeSet, &grep_info, + num_bases, basenames, 1); + if (r < 1) + break; + rset[rset_no] = rset_trunc (zi, grep_info.isam_p_buf, + grep_info.isam_p_indx); assert (rset[rset_no]); if (++rset_no >= sizeof(rset)/sizeof(*rset)) break; - if (!p1) - break; } +#ifdef TERM_COUNT + xfree(grep_info.term_no); +#endif xfree (grep_info.isam_p_buf); if (rset_no == 0) return rset_create (rset_kind_null, NULL); else if (rset_no == 1) return (rset[0]); - result = rpn_prox (rset, rset_no); for (i = 0; iwhich == Z_RPNStructure_complex) { + Z_Operator *zop = zs->u.complex->roperator; rset_bool_parms bool_parms; int soft = 0; + bool_parms.rset_l = rpn_search_structure (zi, zs->u.complex->s1, attributeSet, @@ -1275,9 +1294,9 @@ static RSET rpn_search_structure (ZServerInfo *zi, Z_RPNStructure *zs, if (rset_is_ranked(bool_parms.rset_r)) soft = 1; bool_parms.key_size = sizeof(struct it_key); - bool_parms.cmp = key_compare; + bool_parms.cmp = key_compare_it; - switch (zs->u.complex->roperator->which) + switch (zop->which) { case Z_Operator_and: r = rset_create (soft ? rset_kind_sand:rset_kind_and, &bool_parms); @@ -1288,8 +1307,30 @@ static RSET rpn_search_structure (ZServerInfo *zi, Z_RPNStructure *zs, case Z_Operator_and_not: r = rset_create (soft ? rset_kind_snot:rset_kind_not, &bool_parms); break; + case Z_Operator_prox: + if (zop->u.prox->which != Z_ProxCode_known) + { + zi->errCode = 132; + return NULL; + } + if (*zop->u.prox->proximityUnitCode != Z_ProxUnit_word) + { + static char val[16]; + zi->errCode = 132; + zi->errString = val; + sprintf (val, "%d", *zop->u.prox->proximityUnitCode); + return NULL; + } + r = rpn_proximity (bool_parms.rset_l, bool_parms.rset_r, + *zop->u.prox->ordered, + (!zop->u.prox->exclusion ? 0 : + *zop->u.prox->exclusion), + *zop->u.prox->relationType, + *zop->u.prox->distance); + break; default: - assert (0); + zi->errCode = 110; + return NULL; } } else if (zs->which == Z_RPNStructure_simple) @@ -1307,12 +1348,14 @@ static RSET rpn_search_structure (ZServerInfo *zi, Z_RPNStructure *zs, } else { - assert (0); + zi->errCode = 3; + return NULL; } } else { - assert (0); + zi->errCode = 3; + return NULL; } return r; } @@ -1336,9 +1379,10 @@ void count_set_save (RSET *r, int *count) { if (key.sysno != psysno) { - rset_write (w, wfd, &key); - psysno = key.sysno; + if (*count < 400) + rset_write (w, wfd, &key); (*count)++; + psysno = key.sysno; } kno++; } @@ -1380,7 +1424,7 @@ int rpn_search (ZServerInfo *zi, oident *attrset; oid_value attributeSet; - dict_grep_cmap (zi->wordDict, map_chrs_input); + dict_grep_cmap (zi->dict, map_chrs_input); zlog_rpn (rpn); zi->errCode = 0; @@ -1426,7 +1470,6 @@ static int scan_handle (char *name, const char *info, int pos, void *client) idx = scan_info->after - pos + scan_info->before; else idx = - pos - 1; - logf (LOG_DEBUG, "%-3d %s", idx, name+len_prefix); scan_info->list[idx].term = odr_malloc (scan_info->odr, strlen(name + len_prefix)+1); strcpy (scan_info->list[idx].term, name + len_prefix); @@ -1474,17 +1517,17 @@ int rpn_scan (ZServerInfo *zi, Z_AttributesPlusTerm *zapt, logf (LOG_DEBUG, "scan, position = %d, num = %d", pos, num); + if (attributeset == VAL_NONE) + attributeset = VAL_BIB1; + attr_init (&use, zapt, 1); - use_value = attr_find (&use, NULL); + use_value = attr_find (&use, &attributeset); logf (LOG_DEBUG, "use value %d", use_value); attr_init (&completeness, zapt, 6); completeness_value = attr_find (&completeness, NULL); logf (LOG_DEBUG, "completeness value %d", completeness_value); - if (attributeset == VAL_NONE) - attributeset = VAL_BIB1; - if (use_value == -1) use_value = 1016; for (base_no = 0; base_no < num_bases && ord_no < 32; base_no++) @@ -1542,7 +1585,7 @@ int rpn_scan (ZServerInfo *zi, Z_AttributesPlusTerm *zapt, trans_scan_term (zi, zapt, termz+prefix_len); - dict_scan (zi->wordDict, termz, &before_tmp, &after_tmp, scan_info, + dict_scan (zi->dict, termz, &before_tmp, &after_tmp, scan_info, scan_handle); } glist = odr_malloc (zi->odr, (before+after)*sizeof(*glist)); @@ -1556,7 +1599,6 @@ int rpn_scan (ZServerInfo *zi, Z_AttributesPlusTerm *zapt, const char *mterm = NULL; const char *tst; RSET rset; - rset_isam_parms parms; for (j = 0; j < ord_no; j++) { @@ -1571,9 +1613,7 @@ int rpn_scan (ZServerInfo *zi, Z_AttributesPlusTerm *zapt, if (j0 == -1) break; scan_term_untrans (zi->odr, &glist[i+before].term, mterm); - parms.is = zi->wordIsam; - parms.pos = scan_info_array[j0].list[ptr[j0]].isam_p; - rset = rset_create (rset_kind_isam, &parms); + rset = rset_trunc (zi, &scan_info_array[j0].list[ptr[j0]].isam_p, 1); ptr[j0]++; for (j = j0+1; jwordIsam; - parms.pos = scan_info_array[j].list[ptr[j]].isam_p; - rset2 = rset_create (rset_kind_isam, &parms); + rset2 = + rset_trunc (zi, &scan_info_array[j].list[ptr[j]].isam_p, 1); bool_parms.key_size = sizeof(struct it_key); - bool_parms.cmp = key_compare; + bool_parms.cmp = key_compare_it; bool_parms.rset_l = rset; bool_parms.rset_r = rset2; @@ -1618,7 +1656,6 @@ int rpn_scan (ZServerInfo *zi, Z_AttributesPlusTerm *zapt, const char *mterm = NULL; const char *tst; RSET rset; - rset_isam_parms parms; for (j = 0; j odr, &glist[before-1-i].term, mterm); - parms.is = zi->wordIsam; - parms.pos = scan_info_array[j0].list[before-1-ptr[j0]].isam_p; - rset = rset_create (rset_kind_isam, &parms); + rset = rset_trunc + (zi, &scan_info_array[j0].list[before-1-ptr[j0]].isam_p, 1); ptr[j0]++; @@ -1647,16 +1683,14 @@ int rpn_scan (ZServerInfo *zi, Z_AttributesPlusTerm *zapt, (tst=scan_info_array[j].list[before-1-ptr[j]].term) && !strcmp (tst, mterm)) { - rset_isam_parms parms; rset_bool_parms bool_parms; RSET rset2; - parms.is = zi->wordIsam; - parms.pos = scan_info_array[j].list[before-1-ptr[j]].isam_p; - rset2 = rset_create (rset_kind_isam, &parms); + rset2 = rset_trunc (zi, + &scan_info_array[j].list[before-1-ptr[j]].isam_p, 1); bool_parms.key_size = sizeof(struct it_key); - bool_parms.cmp = key_compare; + bool_parms.cmp = key_compare_it; bool_parms.rset_l = rset; bool_parms.rset_r = rset2;