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 static void append_merge_keys(struct record_metadata_attr **p,
54 const struct record_metadata_attr *a,
58 for (; a; a = a->next)
60 struct record_metadata_attr **pi = p;
61 for (; *pi; pi = &(*pi)->next)
62 if (!strcmp((*pi)->value, a->value))
66 *pi = (struct record_metadata_attr *) nmem_malloc(nmem, sizeof(**p));
67 (*pi)->name = nmem_strdup_null(nmem, a->name);
68 (*pi)->value = nmem_strdup_null(nmem, a->value);
75 for (; a; a = a->next)
77 *p = (struct record_metadata_attr *) nmem_malloc(nmem, sizeof(**p));
78 (*p)->name = nmem_strdup_null(nmem, a->name);
79 (*p)->value = nmem_strdup_null(nmem, a->value);
86 struct reclist_sortparms *reclist_parse_sortparms(NMEM nmem, const char *parms,
87 struct conf_service *service)
89 struct reclist_sortparms *res = 0;
90 struct reclist_sortparms **rp = &res;
92 if (strlen(parms) > 256)
102 enum conf_sortkey_type type = Metadata_sortkey_string;
103 struct reclist_sortparms *new;
105 if (!(cpp = strchr(parms, ',')))
106 cpp = parms + strlen(parms);
107 strncpy(parm, parms, cpp - parms);
108 parm[cpp-parms] = '\0';
110 if ((pp = strchr(parm, ':')))
114 else if (pp[1] == '0')
118 yaz_log(YLOG_FATAL, "Bad sortkey modifier: %s", parm);
125 type = Metadata_sortkey_position;
127 yaz_log(YLOG_FATAL, "Bad sortkey modifier: %s", parm);
131 if (type != Metadata_sortkey_position)
133 if (!strcmp(parm, "relevance"))
135 type = Metadata_sortkey_relevance;
137 else if (!strcmp(parm, "position"))
139 type = Metadata_sortkey_position;
143 for (i = 0; i < service->num_sortkeys; i++)
145 struct conf_sortkey *sk = &service->sortkeys[i];
146 if (!strcmp(sk->name, parm))
149 if (type == Metadata_sortkey_skiparticle)
150 type = Metadata_sortkey_string;
154 if (i >= service->num_sortkeys)
156 yaz_log(YLOG_FATAL, "Sortkey not defined in service: %s",
163 new = *rp = nmem_malloc(nmem, sizeof(struct reclist_sortparms));
165 new->offset = offset;
167 new->increasing = increasing;
168 new->name = nmem_strdup(nmem, parm);
176 static int reclist_cmp(const void *p1, const void *p2)
178 struct reclist_sortparms *sortparms =
179 (*(struct reclist_bucket **) p1)->sort_parms;
180 struct record_cluster *r1 = (*(struct reclist_bucket**) p1)->record;
181 struct record_cluster *r2 = (*(struct reclist_bucket**) p2)->record;
182 struct reclist_sortparms *s;
185 for (s = sortparms; s && res == 0; s = s->next)
187 union data_types *ut1 = r1->sortkeys[s->offset];
188 union data_types *ut2 = r2->sortkeys[s->offset];
192 case Metadata_sortkey_relevance:
193 res = r2->relevance_score - r1->relevance_score;
195 case Metadata_sortkey_string:
196 s1 = ut1 ? ut1->text.sort : "";
197 s2 = ut2 ? ut2->text.sort : "";
198 res = strcmp(s2, s1);
205 case Metadata_sortkey_numeric:
209 res = ut1->number.min - ut2->number.min;
211 res = ut2->number.max - ut1->number.max;
213 else if (ut1 && !ut2)
215 else if (!ut1 && ut2)
220 case Metadata_sortkey_position:
221 if (r1->records && r2->records)
223 int pos1 = 0, pos2 = 0;
225 for (rec = r1->records; rec; rec = rec->next)
226 if (pos1 == 0 || rec->position < pos1)
227 pos1 = rec->position;
228 for (rec = r2->records; rec; rec = rec->next)
229 if (pos2 == 0 || rec->position < pos2)
230 pos2 = rec->position;
235 yaz_log(YLOG_WARN, "Bad sort type: %d", s->type);
241 res = strcmp(r1->recid, r2->recid);
245 void reclist_limit(struct reclist *l, struct session *se, int lazy)
249 struct reclist_bucket **pp = &l->sorted_list;
255 for (i = 0; i < l->hash_size; i++)
257 struct reclist_bucket *p;
258 for (p = l->hashtable[i]; p; p = p->hash_next)
260 if (session_check_cluster_limit(se, p->record))
263 pp = &p->sorted_next;
270 l->num_records = num;
274 void reclist_sort(struct reclist *l, struct reclist_sortparms *parms)
276 struct reclist_bucket **flatlist = xmalloc(sizeof(*flatlist) * l->num_records);
277 struct reclist_bucket *ptr;
278 struct reclist_bucket **prev;
283 ptr = l->sorted_list;
284 prev = &l->sorted_list;
287 ptr->sort_parms = parms;
289 ptr = ptr->sorted_next;
292 assert(i == l->num_records);
294 qsort(flatlist, l->num_records, sizeof(*flatlist), reclist_cmp);
295 for (i = 0; i < l->num_records; i++)
298 prev = &flatlist[i]->sorted_next;
307 struct record_cluster *reclist_read_record(struct reclist *l)
309 if (l && l->sorted_ptr)
311 struct record_cluster *t = l->sorted_ptr->record;
312 l->sorted_ptr = l->sorted_ptr->sorted_next;
319 void reclist_enter(struct reclist *l)
321 yaz_mutex_enter(l->mutex);
323 l->sorted_ptr = l->sorted_list;
327 void reclist_leave(struct reclist *l)
329 yaz_mutex_leave(l->mutex);
331 l->sorted_ptr = l->sorted_list;
335 struct reclist *reclist_create(NMEM nmem)
337 struct reclist *res = nmem_malloc(nmem, sizeof(struct reclist));
338 res->hash_size = 399;
340 = nmem_malloc(nmem, res->hash_size * sizeof(struct reclist_bucket*));
341 memset(res->hashtable, 0, res->hash_size * sizeof(struct reclist_bucket*));
345 res->sorted_list = 0;
347 res->num_records = 0;
349 pazpar2_mutex_create(&res->mutex, "reclist");
353 void reclist_destroy(struct reclist *l)
358 for (i = 0; i < l->hash_size; i++)
360 struct reclist_bucket *p;
361 for (p = l->hashtable[i]; p; p = p->hash_next)
363 wrbuf_destroy(p->record->relevance_explain1);
364 wrbuf_destroy(p->record->relevance_explain2);
365 p->record->relevance_explain1 = 0;
366 p->record->relevance_explain2 = 0;
369 yaz_mutex_destroy(&l->mutex);
373 int reclist_get_num_records(struct reclist *l)
376 return l->num_records;
380 static void merge_cluster(struct reclist *l,
382 struct record_cluster *dst,
383 struct record_cluster *src)
385 struct record **rp = &dst->records;
386 for (; *rp; rp = &(*rp)->next)
390 /* not merging metadata and sortkeys yet */
392 relevance_mergerec(r, dst, src);
394 wrbuf_puts(dst->relevance_explain1, wrbuf_cstr(src->relevance_explain1));
395 wrbuf_puts(dst->relevance_explain2, wrbuf_cstr(src->relevance_explain2));
397 wrbuf_destroy(src->relevance_explain1);
398 src->relevance_explain1 = 0;
399 wrbuf_destroy(src->relevance_explain2);
400 src->relevance_explain2 = 0;
402 append_merge_keys(&dst->merge_keys, src->merge_keys, l->nmem);
405 static struct record_cluster *new_cluster(
408 struct conf_service *service,
409 struct record *record,
410 struct record_metadata_attr *merge_keys
413 struct record_cluster *cluster;
414 cluster = nmem_malloc(l->nmem, sizeof(*cluster));
417 cluster->records = record;
418 cluster->merge_keys = 0;
419 append_merge_keys(&cluster->merge_keys, merge_keys, l->nmem);
420 cluster->relevance_score = 0;
421 cluster->recid = cluster->merge_keys->value;
424 sizeof(struct record_metadata*) * service->num_metadata);
425 memset(cluster->metadata, 0,
426 sizeof(struct record_metadata*) * service->num_metadata);
428 nmem_malloc(l->nmem, sizeof(struct record_metadata*) * service->num_sortkeys);
429 memset(cluster->sortkeys, 0,
430 sizeof(union data_types*) * service->num_sortkeys);
431 relevance_newrec(r, cluster);
432 cluster->relevance_explain1 = wrbuf_alloc();
433 cluster->relevance_explain2 = wrbuf_alloc();
434 /* attach to hash list */
436 l->sorted_list = l->sorted_ptr = 0;
440 // Insert a record. Return record cluster (newly formed or pre-existing)
441 struct record_cluster *reclist_insert(struct reclist *l,
443 struct conf_service *service,
444 struct record *record,
445 struct record_metadata_attr *merge_keys,
448 struct record_cluster *cluster = 0;
449 struct record_metadata_attr *mkl = merge_keys;
457 yaz_mutex_enter(l->mutex);
459 for (; mkl; mkl = mkl->next)
461 const char *merge_key = mkl->value;
462 unsigned int bucket =
463 jenkins_hash((unsigned char*) merge_key) % l->hash_size;
464 struct reclist_bucket **p;
465 struct reclist_bucket *rb = 0;
467 for (p = &l->hashtable[bucket]; *p; p = &(*p)->hash_next)
469 struct record_metadata_attr *mkr = (*p)->record->merge_keys;
470 for (; mkr; mkr = mkr->next)
472 // We found a matching record. Merge them
473 if (!strcmp(merge_key, mkr->value))
478 for (re = &rb->record->records; *re; re = &(*re)->next)
480 if ((*re)->client == record->client &&
481 record_compare(record, *re, service))
483 yaz_mutex_leave(l->mutex);
490 cluster = rb->record;
496 if (cluster != rb->record)
498 if (!rb->record->records)
500 ; /* already merged */
504 merge_cluster(l, r, cluster, rb->record);
506 rb->record->records = 0; /* signal merged */
508 /* update the hash table */
509 rb->record = cluster;
518 cluster = new_cluster(l, r, service, record, merge_keys);
523 rb = nmem_malloc(l->nmem, sizeof(*rb));
524 rb->record = cluster;
530 yaz_mutex_leave(l->mutex);
534 int reclist_sortparms_cmp(struct reclist_sortparms *sort1, struct reclist_sortparms *sort2)
539 if (sort1 == 0 || sort2 == 0)
541 rc = strcmp(sort1->name, sort2->name) || sort1->increasing != sort2->increasing || sort1->type != sort2->type;
547 * c-file-style: "Stroustrup"
548 * indent-tabs-mode: nil
550 * vim: shiftwidth=4 tabstop=8 expandtab