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 record_cluster *sorted_list;
40 struct record_cluster *sorted_ptr;
47 struct record_cluster *record;
48 struct reclist_bucket *hash_next;
51 static void append_merge_keys(struct record_metadata_attr **p,
52 const struct record_metadata_attr *a,
55 for (; a; a = a->next)
57 struct record_metadata_attr **pi = p;
58 for (; *pi; pi = &(*pi)->next)
59 if (!strcmp((*pi)->value, a->value))
63 *pi = (struct record_metadata_attr *) nmem_malloc(nmem, sizeof(**p));
64 (*pi)->name = nmem_strdup_null(nmem, a->name);
65 (*pi)->value = nmem_strdup_null(nmem, a->value);
71 struct reclist_sortparms *reclist_parse_sortparms(NMEM nmem, const char *parms,
72 struct conf_service *service)
74 struct reclist_sortparms *res = 0;
75 struct reclist_sortparms **rp = &res;
77 if (strlen(parms) > 256)
87 enum conf_metadata_type type = Metadata_type_generic;
88 struct reclist_sortparms *new;
90 if (!(cpp = strchr(parms, ',')))
91 cpp = parms + strlen(parms);
92 strncpy(parm, parms, cpp - parms);
93 parm[cpp-parms] = '\0';
95 if ((pp = strchr(parm, ':')))
99 else if (pp[1] == '0')
103 yaz_log(YLOG_FATAL, "Bad sortkey modifier: %s", parm);
110 type = Metadata_type_position;
112 yaz_log(YLOG_FATAL, "Bad sortkey modifier: %s", parm);
116 if (type != Metadata_type_position)
118 if (!strcmp(parm, "relevance"))
120 type = Metadata_type_relevance;
122 else if (!strcmp(parm, "position"))
124 type = Metadata_type_position;
128 for (i = 0; i < service->num_sortkeys; i++)
130 struct conf_sortkey *sk = &service->sortkeys[i];
131 if (!strcmp(sk->name, parm))
137 if (i >= service->num_sortkeys)
139 yaz_log(YLOG_FATAL, "Sortkey not defined in service: %s",
146 new = *rp = nmem_malloc(nmem, sizeof(struct reclist_sortparms));
148 new->offset = offset;
150 new->increasing = increasing;
151 new->name = nmem_strdup(nmem, parm);
159 static int reclist_cmp(const void *p1, const void *p2)
161 struct record_cluster *r1 = (*(struct record_cluster**) p1);
162 struct record_cluster *r2 = (*(struct record_cluster**) p2);
163 struct reclist_sortparms *sortparms = r1->sort_parms;
164 struct reclist_sortparms *s;
167 for (s = sortparms; s && res == 0; s = s->next)
169 union data_types *ut1 = r1->sortkeys[s->offset];
170 union data_types *ut2 = r2->sortkeys[s->offset];
174 case Metadata_type_relevance:
175 res = r1->relevance_score - r2->relevance_score;
177 case Metadata_type_generic:
178 case Metadata_type_skiparticle:
179 s1 = ut1 ? ut1->text.sort : "";
180 s2 = ut2 ? ut2->text.sort : "";
181 res = strcmp(s1, s2);
183 case Metadata_type_year:
184 case Metadata_type_date:
188 res = ut1->number.min - ut2->number.min;
190 res = ut1->number.max - ut2->number.max;
192 else if (ut1 && !ut2)
194 res = -1; /* without date/year: last! */
197 else if (!ut1 && ut2)
199 res = 1; /* without date/year: last! */
205 case Metadata_type_position:
206 if (r1->records && r2->records)
208 int pos1 = 0, pos2 = 0;
210 for (rec = r1->records; rec; rec = rec->next)
211 if (pos1 == 0 || rec->position < pos1)
212 pos1 = rec->position;
213 for (rec = r2->records; rec; rec = rec->next)
214 if (pos2 == 0 || rec->position < pos2)
215 pos2 = rec->position;
220 case Metadata_type_float:
223 if (ut1->fnumber == ut2->fnumber)
225 else if (ut1->fnumber > ut2->fnumber)
238 if (res && !s->increasing)
242 res = strcmp(r1->recid, r2->recid);
246 void reclist_limit(struct reclist *l, struct session *se, int lazy)
250 struct record_cluster **pp = &l->sorted_list;
256 for (i = 0; i < l->hash_size; i++)
258 struct reclist_bucket *p;
259 for (p = l->hashtable[i]; p; p = p->hash_next)
260 p->record->sorted_next = 0;
262 for (i = 0; i < l->hash_size; i++)
264 struct reclist_bucket *p;
265 for (p = l->hashtable[i]; p; p = p->hash_next)
267 if (session_check_cluster_limit(se, p->record))
269 if (!p->record->sorted_next)
272 pp = &p->record->sorted_next;
273 *pp = p->record; /* signal already in use */
281 l->num_records = num;
285 void reclist_sort(struct reclist *l, struct reclist_sortparms *parms)
287 struct record_cluster **flatlist = xmalloc(sizeof(*flatlist) * l->num_records);
288 struct record_cluster *ptr;
289 struct record_cluster **prev;
294 ptr = l->sorted_list;
295 prev = &l->sorted_list;
298 ptr->sort_parms = parms;
300 ptr = ptr->sorted_next;
303 assert(i == l->num_records);
305 qsort(flatlist, l->num_records, sizeof(*flatlist), reclist_cmp);
306 for (i = 0; i < l->num_records; i++)
309 prev = &flatlist[i]->sorted_next;
318 struct record_cluster *reclist_read_record(struct reclist *l)
320 if (l && l->sorted_ptr)
322 struct record_cluster *t = l->sorted_ptr;
323 l->sorted_ptr = l->sorted_ptr->sorted_next;
330 void reclist_enter(struct reclist *l)
332 yaz_mutex_enter(l->mutex);
334 l->sorted_ptr = l->sorted_list;
338 void reclist_leave(struct reclist *l)
340 yaz_mutex_leave(l->mutex);
342 l->sorted_ptr = l->sorted_list;
345 void reclist_rewind(struct reclist *l)
348 l->sorted_ptr = l->sorted_list;
352 struct reclist *reclist_create(NMEM nmem)
354 struct reclist *res = nmem_malloc(nmem, sizeof(struct reclist));
355 res->hash_size = 399;
357 = nmem_malloc(nmem, res->hash_size * sizeof(struct reclist_bucket*));
358 memset(res->hashtable, 0, res->hash_size * sizeof(struct reclist_bucket*));
362 res->sorted_list = 0;
364 res->num_records = 0;
366 pazpar2_mutex_create(&res->mutex, "reclist");
370 void reclist_destroy(struct reclist *l)
375 for (i = 0; i < l->hash_size; i++)
377 struct reclist_bucket *p;
378 for (p = l->hashtable[i]; p; p = p->hash_next)
380 wrbuf_destroy(p->record->relevance_explain1);
381 wrbuf_destroy(p->record->relevance_explain2);
382 p->record->relevance_explain1 = 0;
383 p->record->relevance_explain2 = 0;
386 yaz_mutex_destroy(&l->mutex);
390 int reclist_get_num_records(struct reclist *l)
393 return l->num_records;
397 static void merge_cluster(struct reclist *l,
399 struct record_cluster *dst,
400 struct record_cluster *src)
402 struct record_metadata_attr *mkl;
403 struct record **rp = &dst->records;
404 for (; *rp; rp = &(*rp)->next)
408 for (mkl = src->merge_keys; mkl; mkl = mkl->next)
410 const char *merge_key = mkl->value;
411 unsigned int bucket =
412 jenkins_hash((unsigned char*) merge_key) % l->hash_size;
413 struct reclist_bucket *p;
415 for (p = l->hashtable[bucket]; p; p = p->hash_next)
416 if (p->record == src)
420 /* not merging metadata and sortkeys yet */
422 relevance_mergerec(r, dst, src);
424 wrbuf_puts(dst->relevance_explain1, wrbuf_cstr(src->relevance_explain1));
425 wrbuf_puts(dst->relevance_explain2, wrbuf_cstr(src->relevance_explain2));
427 wrbuf_destroy(src->relevance_explain1);
428 src->relevance_explain1 = 0;
429 wrbuf_destroy(src->relevance_explain2);
430 src->relevance_explain2 = 0;
432 append_merge_keys(&dst->merge_keys, src->merge_keys, l->nmem);
435 static struct record_cluster *new_cluster(
438 struct conf_service *service,
439 struct record *record,
440 struct record_metadata_attr *merge_keys
443 struct record_cluster *cluster;
444 cluster = nmem_malloc(l->nmem, sizeof(*cluster));
447 cluster->records = record;
448 cluster->merge_keys = 0;
449 append_merge_keys(&cluster->merge_keys, merge_keys, l->nmem);
450 cluster->relevance_score = 0;
451 cluster->recid = cluster->merge_keys->value;
454 sizeof(struct record_metadata*) * service->num_metadata);
455 memset(cluster->metadata, 0,
456 sizeof(struct record_metadata*) * service->num_metadata);
458 nmem_malloc(l->nmem, sizeof(struct record_metadata*) * service->num_sortkeys);
459 memset(cluster->sortkeys, 0,
460 sizeof(union data_types*) * service->num_sortkeys);
461 relevance_newrec(r, cluster);
462 cluster->relevance_explain1 = wrbuf_alloc();
463 cluster->relevance_explain2 = wrbuf_alloc();
464 /* attach to hash list */
466 l->sorted_list = l->sorted_ptr = 0;
470 // Insert a record. Return record cluster (newly formed or pre-existing)
471 struct record_cluster *reclist_insert(struct reclist *l,
473 struct conf_service *service,
474 struct record *record,
475 struct record_metadata_attr *merge_keys,
478 struct record_cluster *cluster = 0;
479 struct record_metadata_attr *mkl = merge_keys;
487 yaz_mutex_enter(l->mutex);
489 for (; mkl; mkl = mkl->next)
491 const char *merge_key = mkl->value;
492 unsigned int bucket =
493 jenkins_hash((unsigned char*) merge_key) % l->hash_size;
494 struct reclist_bucket **p;
495 struct reclist_bucket *rb = 0;
497 for (p = &l->hashtable[bucket]; *p; p = &(*p)->hash_next)
499 struct record_metadata_attr *mkr = (*p)->record->merge_keys;
500 for (; mkr; mkr = mkr->next)
502 // We found a matching record. Merge them
503 if (!strcmp(merge_key, mkr->value))
509 for (re = &rb->record->records; *re; re = &(*re)->next)
511 if ((*re)->client == record->client &&
512 record_compare(record, *re, service))
514 yaz_mutex_leave(l->mutex);
518 cluster = rb->record;
524 if (cluster != rb->record)
526 assert(rb->record->relevance_explain1);
527 merge_cluster(l, r, cluster, rb->record);
537 cluster = new_cluster(l, r, service, record, merge_keys);
542 rb = nmem_malloc(l->nmem, sizeof(*rb));
543 rb->record = cluster;
549 yaz_mutex_leave(l->mutex);
553 int reclist_sortparms_cmp(struct reclist_sortparms *sort1, struct reclist_sortparms *sort2)
558 if (sort1 == 0 || sort2 == 0)
560 rc = strcmp(sort1->name, sort2->name) || sort1->increasing != sort2->increasing || sort1->type != sort2->type;
566 * c-file-style: "Stroustrup"
567 * indent-tabs-mode: nil
569 * vim: shiftwidth=4 tabstop=8 expandtab