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,
57 for (; a; a = a->next)
59 struct record_metadata_attr **pi = p;
60 for (; *pi; pi = &(*pi)->next)
61 if (!strcmp((*pi)->value, a->value))
65 *pi = (struct record_metadata_attr *) nmem_malloc(nmem, sizeof(**p));
66 (*pi)->name = nmem_strdup_null(nmem, a->name);
67 (*pi)->value = nmem_strdup_null(nmem, a->value);
73 struct reclist_sortparms *reclist_parse_sortparms(NMEM nmem, const char *parms,
74 struct conf_service *service)
76 struct reclist_sortparms *res = 0;
77 struct reclist_sortparms **rp = &res;
79 if (strlen(parms) > 256)
89 enum conf_sortkey_type type = Metadata_sortkey_string;
90 struct reclist_sortparms *new;
92 if (!(cpp = strchr(parms, ',')))
93 cpp = parms + strlen(parms);
94 strncpy(parm, parms, cpp - parms);
95 parm[cpp-parms] = '\0';
97 if ((pp = strchr(parm, ':')))
101 else if (pp[1] == '0')
105 yaz_log(YLOG_FATAL, "Bad sortkey modifier: %s", parm);
112 type = Metadata_sortkey_position;
114 yaz_log(YLOG_FATAL, "Bad sortkey modifier: %s", parm);
118 if (type != Metadata_sortkey_position)
120 if (!strcmp(parm, "relevance"))
122 type = Metadata_sortkey_relevance;
124 else if (!strcmp(parm, "position"))
126 type = Metadata_sortkey_position;
130 for (i = 0; i < service->num_sortkeys; i++)
132 struct conf_sortkey *sk = &service->sortkeys[i];
133 if (!strcmp(sk->name, parm))
136 if (type == Metadata_sortkey_skiparticle)
137 type = Metadata_sortkey_string;
141 if (i >= service->num_sortkeys)
143 yaz_log(YLOG_FATAL, "Sortkey not defined in service: %s",
150 new = *rp = nmem_malloc(nmem, sizeof(struct reclist_sortparms));
152 new->offset = offset;
154 new->increasing = increasing;
155 new->name = nmem_strdup(nmem, parm);
163 static int reclist_cmp(const void *p1, const void *p2)
165 struct reclist_sortparms *sortparms =
166 (*(struct reclist_bucket **) p1)->sort_parms;
167 struct record_cluster *r1 = (*(struct reclist_bucket**) p1)->record;
168 struct record_cluster *r2 = (*(struct reclist_bucket**) p2)->record;
169 struct reclist_sortparms *s;
172 for (s = sortparms; s && res == 0; s = s->next)
174 union data_types *ut1 = r1->sortkeys[s->offset];
175 union data_types *ut2 = r2->sortkeys[s->offset];
179 case Metadata_sortkey_relevance:
180 res = r2->relevance_score - r1->relevance_score;
182 case Metadata_sortkey_string:
183 s1 = ut1 ? ut1->text.sort : "";
184 s2 = ut2 ? ut2->text.sort : "";
185 res = strcmp(s2, s1);
192 case Metadata_sortkey_numeric:
196 res = ut1->number.min - ut2->number.min;
198 res = ut2->number.max - ut1->number.max;
200 else if (ut1 && !ut2)
202 else if (!ut1 && ut2)
207 case Metadata_sortkey_position:
208 if (r1->records && r2->records)
210 int pos1 = 0, pos2 = 0;
212 for (rec = r1->records; rec; rec = rec->next)
213 if (pos1 == 0 || rec->position < pos1)
214 pos1 = rec->position;
215 for (rec = r2->records; rec; rec = rec->next)
216 if (pos2 == 0 || rec->position < pos2)
217 pos2 = rec->position;
222 yaz_log(YLOG_WARN, "Bad sort type: %d", s->type);
228 res = strcmp(r1->recid, r2->recid);
232 void reclist_limit(struct reclist *l, struct session *se, int lazy)
236 struct reclist_bucket **pp = &l->sorted_list;
242 for (i = 0; i < l->hash_size; i++)
244 struct reclist_bucket *p;
245 for (p = l->hashtable[i]; p; p = p->hash_next)
247 if (session_check_cluster_limit(se, p->record))
250 pp = &p->sorted_next;
257 l->num_records = num;
261 void reclist_sort(struct reclist *l, struct reclist_sortparms *parms)
263 struct reclist_bucket **flatlist = xmalloc(sizeof(*flatlist) * l->num_records);
264 struct reclist_bucket *ptr;
265 struct reclist_bucket **prev;
270 ptr = l->sorted_list;
271 prev = &l->sorted_list;
274 ptr->sort_parms = parms;
276 ptr = ptr->sorted_next;
279 assert(i == l->num_records);
281 qsort(flatlist, l->num_records, sizeof(*flatlist), reclist_cmp);
282 for (i = 0; i < l->num_records; i++)
285 prev = &flatlist[i]->sorted_next;
294 struct record_cluster *reclist_read_record(struct reclist *l)
296 if (l && l->sorted_ptr)
298 struct record_cluster *t = l->sorted_ptr->record;
299 l->sorted_ptr = l->sorted_ptr->sorted_next;
306 void reclist_enter(struct reclist *l)
308 yaz_mutex_enter(l->mutex);
310 l->sorted_ptr = l->sorted_list;
314 void reclist_leave(struct reclist *l)
316 yaz_mutex_leave(l->mutex);
318 l->sorted_ptr = l->sorted_list;
322 struct reclist *reclist_create(NMEM nmem)
324 struct reclist *res = nmem_malloc(nmem, sizeof(struct reclist));
325 res->hash_size = 399;
327 = nmem_malloc(nmem, res->hash_size * sizeof(struct reclist_bucket*));
328 memset(res->hashtable, 0, res->hash_size * sizeof(struct reclist_bucket*));
332 res->sorted_list = 0;
334 res->num_records = 0;
336 pazpar2_mutex_create(&res->mutex, "reclist");
340 void reclist_destroy(struct reclist *l)
345 for (i = 0; i < l->hash_size; i++)
347 struct reclist_bucket *p;
348 for (p = l->hashtable[i]; p; p = p->hash_next)
350 wrbuf_destroy(p->record->relevance_explain1);
351 wrbuf_destroy(p->record->relevance_explain2);
352 p->record->relevance_explain1 = 0;
353 p->record->relevance_explain2 = 0;
356 yaz_mutex_destroy(&l->mutex);
360 int reclist_get_num_records(struct reclist *l)
363 return l->num_records;
367 static void merge_cluster(struct reclist *l,
369 struct record_cluster *dst,
370 struct record_cluster *src)
372 struct record **rp = &dst->records;
373 for (; *rp; rp = &(*rp)->next)
377 /* not merging metadata and sortkeys yet */
379 relevance_mergerec(r, dst, src);
381 wrbuf_puts(dst->relevance_explain1, wrbuf_cstr(src->relevance_explain1));
382 wrbuf_puts(dst->relevance_explain2, wrbuf_cstr(src->relevance_explain2));
384 wrbuf_destroy(src->relevance_explain1);
385 src->relevance_explain1 = 0;
386 wrbuf_destroy(src->relevance_explain2);
387 src->relevance_explain2 = 0;
389 append_merge_keys(&dst->merge_keys, src->merge_keys, l->nmem);
392 static struct record_cluster *new_cluster(
395 struct conf_service *service,
396 struct record *record,
397 struct record_metadata_attr *merge_keys
400 struct record_cluster *cluster;
401 cluster = nmem_malloc(l->nmem, sizeof(*cluster));
404 cluster->records = record;
405 cluster->merge_keys = 0;
406 append_merge_keys(&cluster->merge_keys, merge_keys, l->nmem);
407 cluster->relevance_score = 0;
408 cluster->recid = cluster->merge_keys->value;
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);
418 relevance_newrec(r, cluster);
419 cluster->relevance_explain1 = wrbuf_alloc();
420 cluster->relevance_explain2 = wrbuf_alloc();
421 /* attach to hash list */
423 l->sorted_list = l->sorted_ptr = 0;
427 // Insert a record. Return record cluster (newly formed or pre-existing)
428 struct record_cluster *reclist_insert(struct reclist *l,
430 struct conf_service *service,
431 struct record *record,
432 struct record_metadata_attr *merge_keys,
435 struct record_cluster *cluster = 0;
436 struct record_metadata_attr *mkl = merge_keys;
444 yaz_mutex_enter(l->mutex);
446 for (; mkl; mkl = mkl->next)
448 const char *merge_key = mkl->value;
449 unsigned int bucket =
450 jenkins_hash((unsigned char*) merge_key) % l->hash_size;
451 struct reclist_bucket **p;
452 struct reclist_bucket *rb = 0;
454 for (p = &l->hashtable[bucket]; *p; p = &(*p)->hash_next)
456 struct record_metadata_attr *mkr = (*p)->record->merge_keys;
457 for (; mkr; mkr = mkr->next)
459 // We found a matching record. Merge them
460 if (!strcmp(merge_key, mkr->value))
465 for (re = &rb->record->records; *re; re = &(*re)->next)
467 if ((*re)->client == record->client &&
468 record_compare(record, *re, service))
470 yaz_mutex_leave(l->mutex);
477 cluster = rb->record;
483 if (cluster != rb->record)
485 if (!rb->record->records)
487 ; /* already merged */
491 merge_cluster(l, r, cluster, rb->record);
493 rb->record->records = 0; /* signal merged */
495 /* update the hash table */
496 rb->record = cluster;
505 cluster = new_cluster(l, r, service, record, merge_keys);
510 rb = nmem_malloc(l->nmem, sizeof(*rb));
511 rb->record = cluster;
517 yaz_mutex_leave(l->mutex);
521 int reclist_sortparms_cmp(struct reclist_sortparms *sort1, struct reclist_sortparms *sort2)
526 if (sort1 == 0 || sort2 == 0)
528 rc = strcmp(sort1->name, sort2->name) || sort1->increasing != sort2->increasing || sort1->type != sort2->type;
534 * c-file-style: "Stroustrup"
535 * indent-tabs-mode: nil
537 * vim: shiftwidth=4 tabstop=8 expandtab