1 /* This file is part of Pazpar2.
2 Copyright (C) 2006-2011 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;
41 struct reclist_bucket **last;
48 struct record_cluster *record;
49 struct reclist_bucket *hnext;
50 struct reclist_bucket *snext;
51 struct reclist_sortparms *sort_parms;
54 struct reclist_sortparms *reclist_parse_sortparms(NMEM nmem, const char *parms,
55 struct conf_service *service)
57 struct reclist_sortparms *res = 0;
58 struct reclist_sortparms **rp = &res;
60 if (strlen(parms) > 256)
70 enum conf_sortkey_type type;
71 struct reclist_sortparms *new;
73 if (!(cpp = strchr(parms, ',')))
74 cpp = parms + strlen(parms);
75 strncpy(parm, parms, cpp - parms);
76 parm[cpp-parms] = '\0';
78 if ((pp = strchr(parm, ':')))
80 increasing = pp[1] == '1' ? 1 : 0;
85 if (!strcmp(parm, "relevance"))
87 type = Metadata_sortkey_relevance;
89 else if (!strcmp(parm, "position"))
91 type = Metadata_sortkey_position;
95 for (i = 0; i < service->num_sortkeys; i++)
97 struct conf_sortkey *sk = &service->sortkeys[i];
98 if (!strcmp(sk->name, parm))
101 if (type == Metadata_sortkey_skiparticle)
102 type = Metadata_sortkey_string;
106 if (i >= service->num_sortkeys)
108 yaz_log(YLOG_FATAL, "Bad sortkey: %s", parm);
114 new = *rp = nmem_malloc(nmem, sizeof(struct reclist_sortparms));
116 new->offset = offset;
118 new->increasing = increasing;
119 new->name = nmem_strdup(nmem, parm);
127 static int reclist_cmp(const void *p1, const void *p2)
129 struct reclist_sortparms *sortparms =
130 (*(struct reclist_bucket **) p1)->sort_parms;
131 struct record_cluster *r1 = (*(struct reclist_bucket**) p1)->record;
132 struct record_cluster *r2 = (*(struct reclist_bucket**) p2)->record;
133 struct reclist_sortparms *s;
136 for (s = sortparms; s && res == 0; s = s->next)
138 union data_types *ut1 = r1->sortkeys[s->offset];
139 union data_types *ut2 = r2->sortkeys[s->offset];
143 case Metadata_sortkey_relevance:
144 res = r2->relevance_score - r1->relevance_score;
146 case Metadata_sortkey_string:
147 s1 = ut1 ? ut1->text.sort : "";
148 s2 = ut2 ? ut2->text.sort : "";
149 res = strcmp(s2, s1);
156 case Metadata_sortkey_numeric:
160 res = ut1->number.min - ut2->number.min;
162 res = ut2->number.max - ut1->number.max;
164 else if (ut1 && !ut2)
166 else if (!ut1 && ut2)
171 case Metadata_sortkey_position:
172 if (r1->records && r2->records)
174 int pos1 = 0, pos2 = 0;
176 for (rec = r1->records; rec; rec = rec->next)
177 if (pos1 == 0 || rec->position < pos1)
178 pos1 = rec->position;
179 for (rec = r2->records; rec; rec = rec->next)
180 if (pos2 == 0 || rec->position < pos2)
181 pos2 = rec->position;
189 yaz_log(YLOG_WARN, "Bad sort type: %d", s->type);
194 res = strcmp(r1->recid, r2->recid);
198 void reclist_sort(struct reclist *l, struct reclist_sortparms *parms)
200 struct reclist_bucket **flatlist = xmalloc(sizeof(*flatlist) * l->num_records);
201 struct reclist_bucket *ptr;
202 struct reclist_bucket **prev;
207 ptr = l->sorted_list;
208 prev = &l->sorted_list;
211 ptr->sort_parms = parms;
216 assert(i == l->num_records);
218 qsort(flatlist, l->num_records, sizeof(*flatlist), reclist_cmp);
219 for (i = 0; i < l->num_records; i++)
222 prev = &flatlist[i]->snext;
232 struct record_cluster *reclist_read_record(struct reclist *l)
234 if (l && l->sorted_ptr)
236 struct record_cluster *t = l->sorted_ptr->record;
237 l->sorted_ptr = l->sorted_ptr->snext;
244 void reclist_enter(struct reclist *l)
246 yaz_mutex_enter(l->mutex);
248 l->sorted_ptr = l->sorted_list;
252 void reclist_leave(struct reclist *l)
254 yaz_mutex_leave(l->mutex);
256 l->sorted_ptr = l->sorted_list;
260 struct reclist *reclist_create(NMEM nmem)
262 struct reclist *res = nmem_malloc(nmem, sizeof(struct reclist));
263 res->hash_size = 399;
265 = nmem_malloc(nmem, res->hash_size * sizeof(struct reclist_bucket*));
266 memset(res->hashtable, 0, res->hash_size * sizeof(struct reclist_bucket*));
270 res->sorted_list = 0;
271 res->last = &res->sorted_list;
273 res->num_records = 0;
275 pazpar2_mutex_create(&res->mutex, "reclist");
279 void reclist_destroy(struct reclist *l)
282 yaz_mutex_destroy(&l->mutex);
285 int reclist_get_num_records(struct reclist *l)
288 return l->num_records;
292 // Insert a record. Return record cluster (newly formed or pre-existing)
293 struct record_cluster *reclist_insert(struct reclist *l,
294 struct conf_service *service,
295 struct record *record,
296 const char *merge_key, int *total)
299 struct reclist_bucket **p;
300 struct record_cluster *cluster = 0;
308 bucket = jenkins_hash((unsigned char*) merge_key) % l->hash_size;
310 yaz_mutex_enter(l->mutex);
311 for (p = &l->hashtable[bucket]; *p; p = &(*p)->hnext)
313 // We found a matching record. Merge them
314 if (!strcmp(merge_key, (*p)->record->merge_key))
316 struct record_cluster *existing = (*p)->record;
317 struct record *re = existing->records;
319 for (; re; re = re->next)
321 if (re->client == record->client &&
322 record_compare(record, re, service))
324 yaz_mutex_leave(l->mutex);
328 record->next = existing->records;
329 existing->records = record;
336 struct reclist_bucket *new =
337 nmem_malloc(l->nmem, sizeof(*new));
339 cluster = nmem_malloc(l->nmem, sizeof(*cluster));
342 new->record = cluster;
344 cluster->records = record;
345 cluster->merge_key = nmem_strdup(l->nmem, merge_key);
346 cluster->relevance_score = 0;
347 cluster->term_frequency_vec = 0;
348 cluster->recid = nmem_strdup(l->nmem, merge_key);
352 sizeof(struct record_metadata*) * service->num_metadata);
353 memset(cluster->metadata, 0,
354 sizeof(struct record_metadata*) * service->num_metadata);
356 nmem_malloc(l->nmem, sizeof(struct record_metadata*) * service->num_sortkeys);
357 memset(cluster->sortkeys, 0,
358 sizeof(union data_types*) * service->num_sortkeys);
360 /* attach to hash list */
363 /* append to sorted_list */
365 l->last = &new->snext;
366 l->sorted_ptr = l->sorted_list;
371 yaz_mutex_leave(l->mutex);
378 * c-file-style: "Stroustrup"
379 * indent-tabs-mode: nil
381 * vim: shiftwidth=4 tabstop=8 expandtab