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 struct record_metadata_attr *a,
59 for (; a; a = a->next)
61 *p = (struct record_metadata_attr *) nmem_malloc(nmem, sizeof(**p));
62 (*p)->name = nmem_strdup_null(nmem, a->name);
63 (*p)->value = nmem_strdup_null(nmem, a->value);
69 struct reclist_sortparms *reclist_parse_sortparms(NMEM nmem, const char *parms,
70 struct conf_service *service)
72 struct reclist_sortparms *res = 0;
73 struct reclist_sortparms **rp = &res;
75 if (strlen(parms) > 256)
85 enum conf_sortkey_type type = Metadata_sortkey_string;
86 struct reclist_sortparms *new;
88 if (!(cpp = strchr(parms, ',')))
89 cpp = parms + strlen(parms);
90 strncpy(parm, parms, cpp - parms);
91 parm[cpp-parms] = '\0';
93 if ((pp = strchr(parm, ':')))
97 else if (pp[1] == '0')
101 yaz_log(YLOG_FATAL, "Bad sortkey modifier: %s", parm);
108 type = Metadata_sortkey_position;
110 yaz_log(YLOG_FATAL, "Bad sortkey modifier: %s", parm);
114 if (type != Metadata_sortkey_position)
116 if (!strcmp(parm, "relevance"))
118 type = Metadata_sortkey_relevance;
120 else if (!strcmp(parm, "position"))
122 type = Metadata_sortkey_position;
126 for (i = 0; i < service->num_sortkeys; i++)
128 struct conf_sortkey *sk = &service->sortkeys[i];
129 if (!strcmp(sk->name, parm))
132 if (type == Metadata_sortkey_skiparticle)
133 type = Metadata_sortkey_string;
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 reclist_sortparms *sortparms =
162 (*(struct reclist_bucket **) p1)->sort_parms;
163 struct record_cluster *r1 = (*(struct reclist_bucket**) p1)->record;
164 struct record_cluster *r2 = (*(struct reclist_bucket**) p2)->record;
165 struct reclist_sortparms *s;
168 for (s = sortparms; s && res == 0; s = s->next)
170 union data_types *ut1 = r1->sortkeys[s->offset];
171 union data_types *ut2 = r2->sortkeys[s->offset];
175 case Metadata_sortkey_relevance:
176 res = r2->relevance_score - r1->relevance_score;
178 case Metadata_sortkey_string:
179 s1 = ut1 ? ut1->text.sort : "";
180 s2 = ut2 ? ut2->text.sort : "";
181 res = strcmp(s2, s1);
188 case Metadata_sortkey_numeric:
192 res = ut1->number.min - ut2->number.min;
194 res = ut2->number.max - ut1->number.max;
196 else if (ut1 && !ut2)
198 else if (!ut1 && ut2)
203 case Metadata_sortkey_position:
204 if (r1->records && r2->records)
206 int pos1 = 0, pos2 = 0;
208 for (rec = r1->records; rec; rec = rec->next)
209 if (pos1 == 0 || rec->position < pos1)
210 pos1 = rec->position;
211 for (rec = r2->records; rec; rec = rec->next)
212 if (pos2 == 0 || rec->position < pos2)
213 pos2 = rec->position;
218 yaz_log(YLOG_WARN, "Bad sort type: %d", s->type);
224 res = strcmp(r1->recid, r2->recid);
228 void reclist_limit(struct reclist *l, struct session *se, int lazy)
232 struct reclist_bucket **pp = &l->sorted_list;
238 for (i = 0; i < l->hash_size; i++)
240 struct reclist_bucket *p;
241 for (p = l->hashtable[i]; p; p = p->hash_next)
243 if (session_check_cluster_limit(se, p->record))
246 pp = &p->sorted_next;
253 l->num_records = num;
257 void reclist_sort(struct reclist *l, struct reclist_sortparms *parms)
259 struct reclist_bucket **flatlist = xmalloc(sizeof(*flatlist) * l->num_records);
260 struct reclist_bucket *ptr;
261 struct reclist_bucket **prev;
266 ptr = l->sorted_list;
267 prev = &l->sorted_list;
270 ptr->sort_parms = parms;
272 ptr = ptr->sorted_next;
275 assert(i == l->num_records);
277 qsort(flatlist, l->num_records, sizeof(*flatlist), reclist_cmp);
278 for (i = 0; i < l->num_records; i++)
281 prev = &flatlist[i]->sorted_next;
290 struct record_cluster *reclist_read_record(struct reclist *l)
292 if (l && l->sorted_ptr)
294 struct record_cluster *t = l->sorted_ptr->record;
295 l->sorted_ptr = l->sorted_ptr->sorted_next;
302 void reclist_enter(struct reclist *l)
304 yaz_mutex_enter(l->mutex);
306 l->sorted_ptr = l->sorted_list;
310 void reclist_leave(struct reclist *l)
312 yaz_mutex_leave(l->mutex);
314 l->sorted_ptr = l->sorted_list;
318 struct reclist *reclist_create(NMEM nmem)
320 struct reclist *res = nmem_malloc(nmem, sizeof(struct reclist));
321 res->hash_size = 399;
323 = nmem_malloc(nmem, res->hash_size * sizeof(struct reclist_bucket*));
324 memset(res->hashtable, 0, res->hash_size * sizeof(struct reclist_bucket*));
328 res->sorted_list = 0;
330 res->num_records = 0;
332 pazpar2_mutex_create(&res->mutex, "reclist");
336 void reclist_destroy(struct reclist *l)
341 for (i = 0; i < l->hash_size; i++)
343 struct reclist_bucket *p;
344 for (p = l->hashtable[i]; p; p = p->hash_next)
346 wrbuf_destroy(p->record->relevance_explain1);
347 wrbuf_destroy(p->record->relevance_explain2);
350 yaz_mutex_destroy(&l->mutex);
354 int reclist_get_num_records(struct reclist *l)
357 return l->num_records;
361 // Insert a record. Return record cluster (newly formed or pre-existing)
362 struct record_cluster *reclist_insert(struct reclist *l,
363 struct conf_service *service,
364 struct record *record,
365 struct record_metadata_attr *merge_keys,
368 struct record_cluster *cluster = 0;
369 struct record_metadata_attr *mkl = merge_keys;
370 struct reclist_bucket **p;
378 yaz_mutex_enter(l->mutex);
380 for (; mkl; mkl = mkl->next)
382 const char *merge_key = mkl->value;
383 unsigned int bucket =
384 jenkins_hash((unsigned char*) merge_key) % l->hash_size;
386 for (p = &l->hashtable[bucket]; *p; p = &(*p)->hash_next)
388 struct record_metadata_attr *mkr = (*p)->record->merge_keys;
389 for (; mkr; mkr = mkr->next)
391 // We found a matching record. Merge them
392 if (!strcmp(merge_key, mkr->value))
396 cluster = (*p)->record;
397 for (re = &cluster->records; *re; re = &(*re)->next)
399 if ((*re)->client == record->client &&
400 record_compare(record, *re, service))
402 yaz_mutex_leave(l->mutex);
416 struct reclist_bucket *new =
417 nmem_malloc(l->nmem, sizeof(*new));
419 cluster = nmem_malloc(l->nmem, sizeof(*cluster));
422 new->record = cluster;
424 cluster->records = record;
426 cluster->merge_keys = 0;
427 append_merge_keys(&cluster->merge_keys, merge_keys, l->nmem);
429 cluster->relevance_score = 0;
430 cluster->term_frequency_vec = 0;
431 cluster->recid = merge_keys->value;
435 sizeof(struct record_metadata*) * service->num_metadata);
436 memset(cluster->metadata, 0,
437 sizeof(struct record_metadata*) * service->num_metadata);
439 nmem_malloc(l->nmem, sizeof(struct record_metadata*) * service->num_sortkeys);
440 memset(cluster->sortkeys, 0,
441 sizeof(union data_types*) * service->num_sortkeys);
443 cluster->relevance_explain1 = wrbuf_alloc();
444 cluster->relevance_explain2 = wrbuf_alloc();
445 /* attach to hash list */
448 l->sorted_list = l->sorted_ptr = 0;
450 yaz_mutex_leave(l->mutex);
454 int reclist_sortparms_cmp(struct reclist_sortparms *sort1, struct reclist_sortparms *sort2)
459 if (sort1 == 0 || sort2 == 0)
461 rc = strcmp(sort1->name, sort2->name) || sort1->increasing != sort2->increasing || sort1->type != sort2->type;
467 * c-file-style: "Stroustrup"
468 * indent-tabs-mode: nil
470 * vim: shiftwidth=4 tabstop=8 expandtab