1 /* This file is part of Pazpar2.
2 Copyright (C) 2006-2013 Index Data
4 Pazpar2 is free software; you can redistribute it and/or modify it under
5 the terms of the GNU General Public License as published by the Free
6 Software Foundation; either version 2, or (at your option) any later
9 Pazpar2 is distributed in the hope that it will be useful, but WITHOUT ANY
10 WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 You should have received a copy of the GNU General Public License
15 along with this program; if not, write to the Free Software
16 Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
26 #include <yaz/yaz-util.h>
31 #include "jenkins_hash.h"
35 struct reclist_bucket **hashtable;
39 struct reclist_bucket *sorted_list;
40 struct reclist_bucket *sorted_ptr;
47 struct record_cluster *record;
48 struct reclist_bucket *hash_next;
49 struct reclist_bucket *sorted_next;
50 struct reclist_sortparms *sort_parms;
53 struct reclist_sortparms *reclist_parse_sortparms(NMEM nmem, const char *parms,
54 struct conf_service *service)
56 struct reclist_sortparms *res = 0;
57 struct reclist_sortparms **rp = &res;
59 if (strlen(parms) > 256)
69 enum conf_sortkey_type type = Metadata_sortkey_string;
70 struct reclist_sortparms *new;
72 if (!(cpp = strchr(parms, ',')))
73 cpp = parms + strlen(parms);
74 strncpy(parm, parms, cpp - parms);
75 parm[cpp-parms] = '\0';
77 if ((pp = strchr(parm, ':')))
81 else if (pp[1] == '0')
85 yaz_log(YLOG_FATAL, "Bad sortkey modifier: %s", parm);
92 type = Metadata_sortkey_position;
94 yaz_log(YLOG_FATAL, "Bad sortkey modifier: %s", parm);
98 if (type != Metadata_sortkey_position)
100 if (!strcmp(parm, "relevance"))
102 type = Metadata_sortkey_relevance;
104 else if (!strcmp(parm, "relevance_h"))
106 type = Metadata_sortkey_relevance_h;
108 else if (!strcmp(parm, "position"))
110 type = Metadata_sortkey_position;
114 for (i = 0; i < service->num_sortkeys; i++)
116 struct conf_sortkey *sk = &service->sortkeys[i];
117 if (!strcmp(sk->name, parm))
120 if (type == Metadata_sortkey_skiparticle)
121 type = Metadata_sortkey_string;
125 if (i >= service->num_sortkeys)
127 yaz_log(YLOG_FATAL, "Sortkey not defined in service: %s",
134 new = *rp = nmem_malloc(nmem, sizeof(struct reclist_sortparms));
136 new->offset = offset;
138 new->increasing = increasing;
139 new->name = nmem_strdup(nmem, parm);
147 static int reclist_cmp(const void *p1, const void *p2)
149 struct reclist_sortparms *sortparms =
150 (*(struct reclist_bucket **) p1)->sort_parms;
151 struct record_cluster *r1 = (*(struct reclist_bucket**) p1)->record;
152 struct record_cluster *r2 = (*(struct reclist_bucket**) p2)->record;
153 struct reclist_sortparms *s;
156 for (s = sortparms; s && res == 0; s = s->next)
158 union data_types *ut1 = r1->sortkeys[s->offset];
159 union data_types *ut2 = r2->sortkeys[s->offset];
163 case Metadata_sortkey_relevance:
164 res = r2->relevance_score - r1->relevance_score;
166 case Metadata_sortkey_relevance_h:
167 res = r2->relevance_score - r1->relevance_score;
169 case Metadata_sortkey_string:
170 s1 = ut1 ? ut1->text.sort : "";
171 s2 = ut2 ? ut2->text.sort : "";
172 res = strcmp(s2, s1);
179 case Metadata_sortkey_numeric:
183 res = ut1->number.min - ut2->number.min;
185 res = ut2->number.max - ut1->number.max;
187 else if (ut1 && !ut2)
189 else if (!ut1 && ut2)
194 case Metadata_sortkey_position:
195 if (r1->records && r2->records)
197 int pos1 = 0, pos2 = 0;
199 for (rec = r1->records; rec; rec = rec->next)
200 if (pos1 == 0 || rec->position < pos1)
201 pos1 = rec->position;
202 for (rec = r2->records; rec; rec = rec->next)
203 if (pos2 == 0 || rec->position < pos2)
204 pos2 = rec->position;
209 yaz_log(YLOG_WARN, "Bad sort type: %d", s->type);
215 res = strcmp(r1->recid, r2->recid);
219 void reclist_limit(struct reclist *l, struct session *se, int lazy)
223 struct reclist_bucket **pp = &l->sorted_list;
229 for (i = 0; i < l->hash_size; i++)
231 struct reclist_bucket *p;
232 for (p = l->hashtable[i]; p; p = p->hash_next)
234 if (session_check_cluster_limit(se, p->record))
237 pp = &p->sorted_next;
244 l->num_records = num;
248 void reclist_sort(struct reclist *l, struct reclist_sortparms *parms)
250 struct reclist_bucket **flatlist = xmalloc(sizeof(*flatlist) * l->num_records);
251 struct reclist_bucket *ptr;
252 struct reclist_bucket **prev;
257 ptr = l->sorted_list;
258 prev = &l->sorted_list;
261 ptr->sort_parms = parms;
263 ptr = ptr->sorted_next;
266 assert(i == l->num_records);
268 qsort(flatlist, l->num_records, sizeof(*flatlist), reclist_cmp);
269 for (i = 0; i < l->num_records; i++)
272 prev = &flatlist[i]->sorted_next;
281 struct record_cluster *reclist_read_record(struct reclist *l)
283 if (l && l->sorted_ptr)
285 struct record_cluster *t = l->sorted_ptr->record;
286 l->sorted_ptr = l->sorted_ptr->sorted_next;
293 void reclist_enter(struct reclist *l)
295 yaz_mutex_enter(l->mutex);
297 l->sorted_ptr = l->sorted_list;
301 void reclist_leave(struct reclist *l)
303 yaz_mutex_leave(l->mutex);
305 l->sorted_ptr = l->sorted_list;
309 struct reclist *reclist_create(NMEM nmem)
311 struct reclist *res = nmem_malloc(nmem, sizeof(struct reclist));
312 res->hash_size = 399;
314 = nmem_malloc(nmem, res->hash_size * sizeof(struct reclist_bucket*));
315 memset(res->hashtable, 0, res->hash_size * sizeof(struct reclist_bucket*));
319 res->sorted_list = 0;
321 res->num_records = 0;
323 pazpar2_mutex_create(&res->mutex, "reclist");
327 void reclist_destroy(struct reclist *l)
332 for (i = 0; i < l->hash_size; i++)
334 struct reclist_bucket *p;
335 for (p = l->hashtable[i]; p; p = p->hash_next)
337 wrbuf_destroy(p->record->relevance_explain1);
338 wrbuf_destroy(p->record->relevance_explain2);
341 yaz_mutex_destroy(&l->mutex);
345 int reclist_get_num_records(struct reclist *l)
348 return l->num_records;
352 // Insert a record. Return record cluster (newly formed or pre-existing)
353 struct record_cluster *reclist_insert(struct reclist *l,
354 struct conf_service *service,
355 struct record *record,
356 const char *merge_key, int *total)
359 struct reclist_bucket **p;
360 struct record_cluster *cluster = 0;
368 bucket = jenkins_hash((unsigned char*) merge_key) % l->hash_size;
370 yaz_mutex_enter(l->mutex);
371 for (p = &l->hashtable[bucket]; *p; p = &(*p)->hash_next)
373 // We found a matching record. Merge them
374 if (!strcmp(merge_key, (*p)->record->merge_key))
378 cluster = (*p)->record;
379 for (re = &cluster->records; *re; re = &(*re)->next)
381 if ((*re)->client == record->client &&
382 record_compare(record, *re, service))
384 yaz_mutex_leave(l->mutex);
395 struct reclist_bucket *new =
396 nmem_malloc(l->nmem, sizeof(*new));
398 cluster = nmem_malloc(l->nmem, sizeof(*cluster));
401 new->record = cluster;
403 cluster->records = record;
404 cluster->merge_key = nmem_strdup(l->nmem, merge_key);
405 cluster->relevance_score = 0;
406 cluster->term_frequency_vec = 0;
407 cluster->recid = nmem_strdup(l->nmem, merge_key);
411 sizeof(struct record_metadata*) * service->num_metadata);
412 memset(cluster->metadata, 0,
413 sizeof(struct record_metadata*) * service->num_metadata);
415 nmem_malloc(l->nmem, sizeof(struct record_metadata*) * service->num_sortkeys);
416 memset(cluster->sortkeys, 0,
417 sizeof(union data_types*) * service->num_sortkeys);
419 cluster->relevance_explain1 = wrbuf_alloc();
420 cluster->relevance_explain2 = wrbuf_alloc();
421 /* attach to hash list */
424 l->sorted_list = l->sorted_ptr = 0;
426 yaz_mutex_leave(l->mutex);
430 int reclist_sortparms_cmp(struct reclist_sortparms *sort1, struct reclist_sortparms *sort2)
435 if (sort1 == 0 || sort2 == 0)
437 rc = strcmp(sort1->name, sort2->name) || sort1->increasing != sort2->increasing || sort1->type != sort2->type;
443 * c-file-style: "Stroustrup"
444 * indent-tabs-mode: nil
446 * vim: shiftwidth=4 tabstop=8 expandtab