1 /* $Id: zsets.c,v 1.91 2005-08-18 12:50:18 adam Exp $
2 Copyright (C) 1995-2005
5 This file is part of the Zebra server.
7 Zebra is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 Zebra is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with Zebra; see the file LICENSE.zebra. If not, write to the
19 Free Software Foundation, 59 Temple Place - Suite 330, Boston, MA
33 #include <yaz/diagbib1.h>
36 #define SORT_IDX_ENTRYSIZE 64
37 #define ZSET_SORT_MAX_LEVEL 3
39 struct zebra_set_term_entry {
51 NMEM rset_nmem; /* for creating the rsets in */
56 struct zset_sort_info *sort_info;
57 struct zebra_set_term_entry *term_entries;
59 struct zebra_set *next;
62 zint cache_position; /* last position */
63 RSFD cache_rfd; /* rfd (NULL if not existing) */
64 zint cache_psysno; /* sysno for last position */
65 zint approx_limit; /* limit before we do approx */
68 struct zset_sort_entry {
71 char buf[ZSET_SORT_MAX_LEVEL][SORT_IDX_ENTRYSIZE];
74 struct zset_sort_info {
77 struct zset_sort_entry *all_entries;
78 struct zset_sort_entry **entries;
81 static int log_level_set=0;
82 static int log_level_sort=0;
83 static int log_level_searchhits=0;
84 static int log_level_searchterms=0;
85 static int log_level_resultsets=0;
87 static void loglevels()
91 log_level_sort = yaz_log_module_level("sorting");
92 log_level_searchhits = yaz_log_module_level("searchhits");
93 log_level_searchterms = yaz_log_module_level("searchterms");
94 log_level_resultsets = yaz_log_module_level("resultsets");
98 ZEBRA_RES resultSetSearch(ZebraHandle zh, NMEM nmem, NMEM rset_nmem,
99 Z_RPNQuery *rpn, ZebraSet sset)
103 Z_SortKeySpecList *sort_sequence;
105 ZEBRA_RES res = ZEBRA_OK;
109 sort_sequence = (Z_SortKeySpecList *)
110 nmem_malloc(nmem, sizeof(*sort_sequence));
111 sort_sequence->num_specs = 10; /* FIXME - Hard-coded number */
112 sort_sequence->specs = (Z_SortKeySpec **)
113 nmem_malloc(nmem, sort_sequence->num_specs *
114 sizeof(*sort_sequence->specs));
115 for (i = 0; i<sort_sequence->num_specs; i++)
116 sort_sequence->specs[i] = 0;
118 attrset = oid_getentbyoid (rpn->attributeSetId);
119 res = rpn_search_top(zh, rpn->RPNStructure, attrset->value,
122 sset->num_bases, sset->basenames,
129 for (i = 0; sort_sequence->specs[i]; i++)
131 sort_sequence->num_specs = i;
132 rset->hits_limit = sset->approx_limit;
135 res = resultSetRank (zh, sset, rset, rset_nmem);
139 res = resultSetSortSingle (zh, nmem, sset, rset,
140 sort_sequence, &sort_status);
147 ZEBRA_RES resultSetAddRPN (ZebraHandle zh, NMEM m, Z_RPNQuery *rpn,
148 int num_bases, char **basenames,
157 zebraSet = resultSetAdd(zh, setname, 1);
160 zebraSet->locked = 1;
163 zebraSet->rset_nmem = nmem_create();
165 zebraSet->num_bases = num_bases;
166 zebraSet->basenames =
167 nmem_malloc (zebraSet->nmem, num_bases * sizeof(*zebraSet->basenames));
168 for (i = 0; i<num_bases; i++)
169 zebraSet->basenames[i] = nmem_strdup(zebraSet->nmem, basenames[i]);
171 res = resultSetSearch(zh, zebraSet->nmem, zebraSet->rset_nmem,
173 zh->hits = zebraSet->hits;
176 zebraSet->locked = 0;
182 void resultSetAddTerm (ZebraHandle zh, ZebraSet s, int reg_type,
183 const char *db, int set,
184 int use, const char *term)
186 assert(zh); /* compiler shut up */
188 s->nmem = nmem_create ();
189 if (!s->term_entries)
192 s->term_entries_max = 1000;
194 nmem_malloc (s->nmem, s->term_entries_max *
195 sizeof(*s->term_entries));
196 for (i = 0; i < s->term_entries_max; i++)
197 s->term_entries[i].term = 0;
199 if (s->hits < s->term_entries_max)
201 s->term_entries[s->hits].reg_type = reg_type;
202 s->term_entries[s->hits].db = nmem_strdup (s->nmem, db);
203 s->term_entries[s->hits].set = set;
204 s->term_entries[s->hits].use = use;
205 s->term_entries[s->hits].term = nmem_strdup (s->nmem, term);
210 ZebraSet resultSetAdd(ZebraHandle zh, const char *name, int ov)
215 for (s = zh->sets; s; s = s->next)
216 if (!strcmp (s->name, name))
223 yaz_log(log_level_resultsets, "updating result set %s", name);
224 if (!ov || s->locked)
229 rset_close(s->cache_rfd);
230 rset_delete (s->rset);
233 nmem_destroy (s->rset_nmem);
235 nmem_destroy (s->nmem);
239 const char *sort_max_str = zebra_get_resource(zh, "sortmax", "1000");
241 yaz_log(log_level_resultsets, "adding result set %s", name);
242 s = (ZebraSet) xmalloc (sizeof(*s));
245 s->name = (char *) xmalloc (strlen(name)+1);
246 strcpy (s->name, name);
248 s->sort_info = (struct zset_sort_info *)
249 xmalloc (sizeof(*s->sort_info));
250 s->sort_info->max_entries = atoi(sort_max_str);
251 if (s->sort_info->max_entries < 2)
252 s->sort_info->max_entries = 2;
254 s->sort_info->entries = (struct zset_sort_entry **)
255 xmalloc (sizeof(*s->sort_info->entries) *
256 s->sort_info->max_entries);
257 s->sort_info->all_entries = (struct zset_sort_entry *)
258 xmalloc (sizeof(*s->sort_info->all_entries) *
259 s->sort_info->max_entries);
260 for (i = 0; i < s->sort_info->max_entries; i++)
261 s->sort_info->entries[i] = s->sort_info->all_entries + i;
270 s->cache_position = 0;
272 s->approx_limit = zh->approx_limit;
276 ZebraSet resultSetGet(ZebraHandle zh, const char *name)
280 for (s = zh->sets; s; s = s->next)
281 if (!strcmp (s->name, name))
283 if (!s->term_entries && !s->rset && s->rpn)
285 NMEM nmem = nmem_create ();
286 yaz_log(log_level_resultsets, "research %s", name);
288 s->rset_nmem=nmem_create();
289 resultSetSearch(zh, nmem, s->rset_nmem, s->rpn, s);
297 void resultSetInvalidate (ZebraHandle zh)
299 ZebraSet s = zh->sets;
301 yaz_log(log_level_resultsets, "invalidating result sets");
302 for (; s; s = s->next)
307 rset_close(s->cache_rfd);
308 rset_delete (s->rset);
312 s->cache_position = 0;
314 nmem_destroy(s->rset_nmem);
319 void resultSetDestroy(ZebraHandle zh, int num, char **names,int *statuses)
321 ZebraSet * ss = &zh->sets;
325 for (i = 0; i<num; i++)
326 statuses[i] = Z_DeleteStatus_resultSetDidNotExist;
333 for (i = 0; i<num; i++)
334 if (!strcmp (s->name, names[i]))
337 statuses[i] = Z_DeleteStatus_success;
346 xfree (s->sort_info->all_entries);
347 xfree (s->sort_info->entries);
348 xfree (s->sort_info);
351 nmem_destroy (s->nmem);
355 rset_close(s->cache_rfd);
356 rset_delete (s->rset);
359 nmem_destroy(s->rset_nmem);
368 ZebraMetaRecord *zebra_meta_records_create_range(ZebraHandle zh,
373 zint *pos = pos_small;
377 if (num > 10000 || num <= 0)
381 pos = xmalloc(sizeof(*pos) * num);
383 for (i = 0; i<num; i++)
386 mr = zebra_meta_records_create(zh, name, num, pos);
393 ZebraMetaRecord *zebra_meta_records_create(ZebraHandle zh, const char *name,
394 int num, zint *positions)
397 ZebraMetaRecord *sr = 0;
400 struct zset_sort_info *sort_info;
401 size_t sysno_mem_index = 0;
403 if (zh->m_staticrank)
408 if (!(sset = resultSetGet (zh, name)))
410 if (!(rset = sset->rset))
412 if (!sset->term_entries)
414 sr = (ZebraMetaRecord *) xmalloc (sizeof(*sr) * num);
415 for (i = 0; i<num; i++)
422 if (positions[i] <= sset->term_entries_max)
424 sr[i].term = sset->term_entries[positions[i]-1].term;
425 sr[i].db = sset->term_entries[positions[i]-1].db;
431 sr = (ZebraMetaRecord *) xmalloc (sizeof(*sr) * num);
432 for (i = 0; i<num; i++)
439 sort_info = sset->sort_info;
444 for (i = 0; i<num; i++)
446 position = positions[i];
447 if (position > 0 && position <= sort_info->num_entries)
449 yaz_log(log_level_sort, "got pos=" ZINT_FORMAT
450 " (sorted)", position);
451 sr[i].sysno = sort_info->entries[position-1]->sysno;
452 sr[i].score = sort_info->entries[position-1]->score;
456 /* did we really get all entries using sort ? */
457 for (i = 0; i<num; i++)
462 if (i < num) /* nope, get the rest, unsorted - sorry */
471 position = sort_info->num_entries;
472 while (num_i < num && positions[num_i] <= position)
475 if (sset->cache_rfd &&
476 num_i < num && positions[num_i] > sset->cache_position)
478 position = sset->cache_position;
479 rfd = sset->cache_rfd;
480 psysno = sset->cache_psysno;
485 rset_close(sset->cache_rfd);
486 rfd = rset_open (rset, RSETF_READ);
488 while (num_i < num && rset_read (rfd, &key, 0))
490 zint this_sys = key.mem[sysno_mem_index];
491 if (this_sys != psysno)
496 /* determine we alreay have this in our set */
497 for (i = sort_info->num_entries; --i >= 0; )
498 if (psysno == sort_info->entries[i]->sysno)
504 assert (num_i < num);
505 if (position == positions[num_i])
507 sr[num_i].sysno = psysno;
508 yaz_log(log_level_sort, "got pos=" ZINT_FORMAT " (unsorted)", position);
509 sr[num_i].score = -1;
514 sset->cache_position = position;
515 sset->cache_psysno = psysno;
516 sset->cache_rfd = rfd;
522 void zebra_meta_records_destroy (ZebraHandle zh, ZebraMetaRecord *records,
525 assert(zh); /* compiler shut up about unused arg */
535 void resultSetInsertSort (ZebraHandle zh, ZebraSet sset,
536 struct sortKeyInfo *criteria, int num_criteria,
539 struct zset_sort_entry this_entry;
540 struct zset_sort_entry *new_entry = NULL;
541 struct zset_sort_info *sort_info = sset->sort_info;
544 sortIdx_sysno (zh->reg->sortIdx, sysno);
545 for (i = 0; i<num_criteria; i++)
547 sortIdx_type (zh->reg->sortIdx, criteria[i].attrUse);
548 sortIdx_read (zh->reg->sortIdx, this_entry.buf[i]);
550 i = sort_info->num_entries;
554 for (j = 0; j<num_criteria; j++)
556 if (criteria[j].numerical)
558 double diff = atof(this_entry.buf[j]) -
559 atof(sort_info->entries[i]->buf[j]);
568 rel = memcmp (this_entry.buf[j], sort_info->entries[i]->buf[j],
576 if (criteria[j].relation == 'A')
581 else if (criteria[j].relation == 'D')
588 j = sort_info->max_entries;
592 if (sort_info->num_entries == j)
595 j = (sort_info->num_entries)++;
596 new_entry = sort_info->entries[j];
599 sort_info->entries[j] = sort_info->entries[j-1];
602 sort_info->entries[i] = new_entry;
604 for (i = 0; i<num_criteria; i++)
605 memcpy (new_entry->buf[i], this_entry.buf[i], SORT_IDX_ENTRYSIZE);
606 new_entry->sysno = sysno;
607 new_entry->score = -1;
610 void resultSetInsertRank (ZebraHandle zh, struct zset_sort_info *sort_info,
611 zint sysno, int score, int relation)
613 struct zset_sort_entry *new_entry = NULL;
615 assert(zh); /* compiler shut up about unused arg */
617 i = sort_info->num_entries;
622 rel = score - sort_info->entries[i]->score;
629 else if (relation == 'A')
636 j = sort_info->max_entries;
640 if (sort_info->num_entries == j)
643 j = (sort_info->num_entries)++;
645 new_entry = sort_info->entries[j];
648 sort_info->entries[j] = sort_info->entries[j-1];
651 sort_info->entries[i] = new_entry;
653 new_entry->sysno = sysno;
654 new_entry->score = score;
657 ZEBRA_RES resultSetSort(ZebraHandle zh, NMEM nmem,
658 int num_input_setnames, const char **input_setnames,
659 const char *output_setname,
660 Z_SortKeySpecList *sort_sequence, int *sort_status)
665 if (num_input_setnames == 0)
667 zebra_setError(zh, YAZ_BIB1_NO_RESULT_SET_NAME_SUPPLIED_ON_SORT, 0);
670 if (num_input_setnames > 1)
672 zebra_setError(zh, YAZ_BIB1_SORT_TOO_MANY_INPUT_RESULTS, 0);
677 yaz_log(log_level_sort, "result set sort input=%s output=%s",
678 *input_setnames, output_setname);
679 sset = resultSetGet (zh, input_setnames[0]);
682 zebra_setError(zh, YAZ_BIB1_SPECIFIED_RESULT_SET_DOES_NOT_EXIST,
686 if (!(rset = sset->rset))
688 zebra_setError(zh, YAZ_BIB1_SPECIFIED_RESULT_SET_DOES_NOT_EXIST,
692 if (strcmp (output_setname, input_setnames[0]))
694 rset = rset_dup (rset);
695 sset = resultSetAdd (zh, output_setname, 1);
698 return resultSetSortSingle (zh, nmem, sset, rset, sort_sequence,
702 ZEBRA_RES resultSetSortSingle(ZebraHandle zh, NMEM nmem,
703 ZebraSet sset, RSET rset,
704 Z_SortKeySpecList *sort_sequence,
712 struct sortKeyInfo sort_criteria[3];
718 size_t sysno_mem_index = 0;
720 if (zh->m_staticrank)
724 assert(nmem); /* compiler shut up about unused param */
725 sset->sort_info->num_entries = 0;
727 rset_getterms(rset, 0, 0, &n);
728 terms = (TERMID *) nmem_malloc(nmem, sizeof(*terms)*n);
729 rset_getterms(rset, terms, n, &numTerms);
732 num_criteria = sort_sequence->num_specs;
733 if (num_criteria > 3)
735 for (i = 0; i < num_criteria; i++)
737 Z_SortKeySpec *sks = sort_sequence->specs[i];
740 if (*sks->sortRelation == Z_SortKeySpec_ascending)
741 sort_criteria[i].relation = 'A';
742 else if (*sks->sortRelation == Z_SortKeySpec_descending)
743 sort_criteria[i].relation = 'D';
746 zebra_setError(zh, YAZ_BIB1_ILLEGAL_SORT_RELATION, 0);
749 if (sks->sortElement->which == Z_SortElement_databaseSpecific)
751 zebra_setError(zh, YAZ_BIB1_DATABASE_SPECIFIC_SORT_UNSUPP, 0);
754 else if (sks->sortElement->which != Z_SortElement_generic)
756 zebra_setError(zh, YAZ_BIB1_SORT_ILLEGAL_SORT, 0);
759 sk = sks->sortElement->u.generic;
762 case Z_SortKey_sortField:
763 yaz_log(log_level_sort, "key %d is of type sortField",
765 zebra_setError(zh, YAZ_BIB1_CANNOT_SORT_ACCORDING_TO_SEQUENCE, 0);
767 case Z_SortKey_elementSpec:
768 yaz_log(log_level_sort, "key %d is of type elementSpec",
770 zebra_setError(zh, YAZ_BIB1_CANNOT_SORT_ACCORDING_TO_SEQUENCE, 0);
772 case Z_SortKey_sortAttributes:
773 yaz_log(log_level_sort, "key %d is of type sortAttributes", i+1);
774 sort_criteria[i].attrUse =
775 zebra_maps_sort (zh->reg->zebra_maps,
776 sk->u.sortAttributes,
777 &sort_criteria[i].numerical);
778 yaz_log(log_level_sort, "use value = %d", sort_criteria[i].attrUse);
779 if (sort_criteria[i].attrUse == -1)
782 zh, YAZ_BIB1_USE_ATTRIBUTE_REQUIRED_BUT_NOT_SUPPLIED, 0);
785 if (sortIdx_type (zh->reg->sortIdx, sort_criteria[i].attrUse))
788 zh, YAZ_BIB1_CANNOT_SORT_ACCORDING_TO_SEQUENCE, 0);
794 rfd = rset_open (rset, RSETF_READ);
795 while (rset_read (rfd, &key, &termid))
797 zint this_sys = key.mem[sysno_mem_index];
798 if (log_level_searchhits)
799 key_logdump_txt(log_level_searchhits, &key, termid->name);
801 if (this_sys != psysno)
805 resultSetInsertSort (zh, sset,
806 sort_criteria, num_criteria, psysno);
810 yaz_log(log_level_sort, ZINT_FORMAT " keys, " ZINT_FORMAT " sysnos, sort",
812 for (i = 0; i < numTerms; i++)
813 yaz_log(log_level_sort, "term=\"%s\" type=%s count=" ZINT_FORMAT,
814 terms[i]->name, terms[i]->flags, terms[i]->rset->hits_count);
815 *sort_status = Z_SortResponse_success;
819 RSET resultSetRef(ZebraHandle zh, const char *resultSetId)
823 if ((s = resultSetGet (zh, resultSetId)))
828 ZEBRA_RES resultSetRank(ZebraHandle zh, ZebraSet zebraSet,
829 RSET rset, NMEM nmem)
838 ZebraRankClass rank_class;
839 struct zset_sort_info *sort_info;
840 const char *rank_handler_name = res_get_def(zh->res, "rank", "rank-1");
844 sort_info = zebraSet->sort_info;
845 sort_info->num_entries = 0;
847 rset_getterms(rset, 0, 0, &n);
848 terms = (TERMID *) nmem_malloc(nmem, sizeof(*terms)*n);
849 rset_getterms(rset, terms, n, &numTerms);
850 size_t sysno_mem_index = 0;
852 if (zh->m_staticrank)
855 rank_class = zebraRankLookup(zh, rank_handler_name);
858 yaz_log(YLOG_WARN, "No such rank handler: %s", rank_handler_name);
859 zebra_setError(zh, YAZ_BIB1_UNSUPP_SEARCH, "Cannot find rank handler");
864 RSFD rfd = rset_open(rset, RSETF_READ);
865 struct rank_control *rc = rank_class->control;
870 (*rc->begin) (zh->reg, rank_class->class_handle, rset, nmem,
873 while (rset_read(rfd, &key, &termid))
875 zint this_sys = key.mem[sysno_mem_index];
876 zint seqno = key.mem[key.len-1];
878 if (log_level_searchhits)
879 key_logdump_txt(log_level_searchhits, &key, termid->name);
880 if (this_sys != psysno)
882 if (rfd->counted_items > rset->hits_limit)
886 score = (*rc->calc) (handle, psysno);
887 resultSetInsertRank (zh, sort_info, psysno, score, 'A');
892 (*rc->add) (handle, CAST_ZINT_TO_INT(seqno), termid);
896 score = (*rc->calc)(handle, psysno);
897 resultSetInsertRank(zh, sort_info, psysno, score, 'A');
900 (*rc->end) (zh->reg, handle);
903 zebraSet->hits = rset->hits_count;
905 yaz_log(log_level_searchterms, ZINT_FORMAT " keys, "
906 ZINT_FORMAT " sysnos, rank", kno, zebraSet->hits);
907 for (i = 0; i < numTerms; i++)
909 yaz_log(log_level_searchterms, "term=\"%s\" type=%s count="
911 terms[i]->name, terms[i]->flags, terms[i]->rset->hits_count);
916 ZebraRankClass zebraRankLookup(ZebraHandle zh, const char *name)
918 ZebraRankClass p = zh->reg->rank_classes;
919 while (p && strcmp (p->control->name, name))
921 if (p && !p->init_flag)
923 if (p->control->create)
924 p->class_handle = (*p->control->create)(zh);
930 void zebraRankInstall(struct zebra_register *reg, struct rank_control *ctrl)
932 ZebraRankClass p = (ZebraRankClass) xmalloc (sizeof(*p));
933 p->control = (struct rank_control *) xmalloc (sizeof(*p->control));
934 memcpy (p->control, ctrl, sizeof(*p->control));
935 p->control->name = xstrdup (ctrl->name);
937 p->next = reg->rank_classes;
938 reg->rank_classes = p;
941 void zebraRankDestroy(struct zebra_register *reg)
943 ZebraRankClass p = reg->rank_classes;
946 ZebraRankClass p_next = p->next;
947 if (p->init_flag && p->control->destroy)
948 (*p->control->destroy)(reg, p->class_handle);
949 xfree(p->control->name);
954 reg->rank_classes = NULL;
957 static int trav_rset_for_termids(RSET rset, TERMID *termid_array,
958 zint *hits_array, int *approx_array)
962 for (i = 0; i<rset->no_children; i++)
963 no += trav_rset_for_termids(rset->children[i],
964 (termid_array ? termid_array + no : 0),
965 (hits_array ? hits_array + no : 0),
966 (approx_array ? approx_array + no : 0));
970 termid_array[no] = rset->term;
972 hits_array[no] = rset->hits_count;
974 approx_array[no] = rset->hits_approx;
976 yaz_log(YLOG_LOG, "rset=%p term=%s limit=" ZINT_FORMAT
977 " count=" ZINT_FORMAT,
978 rset, rset->term->name, rset->hits_limit, rset->hits_count);
985 ZEBRA_RES zebra_result_set_term_no(ZebraHandle zh, const char *setname,
988 ZebraSet sset = resultSetGet(zh, setname);
992 *num_terms = trav_rset_for_termids(sset->rset, 0, 0, 0);
998 ZEBRA_RES zebra_result_set_term_info(ZebraHandle zh, const char *setname,
999 int no, zint *count, int *approx,
1000 char *termbuf, size_t *termlen,
1001 const char **term_ref_id)
1003 ZebraSet sset = resultSetGet(zh, setname);
1006 int num_terms = trav_rset_for_termids(sset->rset, 0, 0, 0);
1007 if (no >= 0 && no < num_terms)
1009 TERMID *term_array = xmalloc(num_terms * sizeof(*term_array));
1010 zint *hits_array = xmalloc(num_terms * sizeof(*hits_array));
1011 int *approx_array = xmalloc(num_terms * sizeof(*approx_array));
1013 trav_rset_for_termids(sset->rset, term_array,
1014 hits_array, approx_array);
1017 *count = hits_array[no];
1019 *approx = approx_array[no];
1022 char *inbuf = term_array[no]->name;
1023 size_t inleft = strlen(inbuf);
1024 size_t outleft = *termlen - 1;
1026 if (zh->iconv_from_utf8 != 0)
1028 char *outbuf = termbuf;
1031 ret = yaz_iconv(zh->iconv_from_utf8, &inbuf, &inleft,
1033 if (ret == (size_t)(-1))
1036 *termlen = outbuf - termbuf;
1040 if (inleft > outleft)
1043 memcpy(termbuf, inbuf, *termlen);
1045 termbuf[*termlen] = '\0';
1048 *term_ref_id = term_array[no]->ref_id;
1052 xfree(approx_array);
1059 ZEBRA_RES zebra_snippets_hit_vector(ZebraHandle zh, const char *setname,
1060 zint sysno, zebra_snippets *snippets)
1062 ZebraSet sset = resultSetGet(zh, setname);
1063 yaz_log(YLOG_LOG, "zebra_get_hit_vector setname=%s zysno=" ZINT_FORMAT,
1069 struct rset_key_control *kc = zebra_key_control_create(zh);
1070 NMEM nmem = nmem_create();
1072 RSET rsets[2], rset_comb;
1073 RSET rset_temp = rstemp_create(nmem, kc, kc->scope,
1074 res_get (zh->res, "setTmpDir"),0 );
1077 RSFD rsfd = rset_open(rset_temp, RSETF_WRITE);
1084 rset_write (rsfd, &key);
1087 rsets[0] = rset_temp;
1088 rsets[1] = rset_dup(sset->rset);
1090 rset_comb = rsmulti_and_create(nmem, kc, kc->scope, 2, rsets);
1092 rsfd = rset_open(rset_comb, RSETF_READ);
1094 while (rset_read(rsfd, &key, &termid))
1098 struct ord_list *ol;
1099 for (ol = termid->ol; ol; ol = ol->next)
1101 zebra_snippets_append(snippets, key.mem[key.len-1],
1103 ol->ord, termid->name);
1109 rset_delete(rset_comb);