1 /* This file is part of Metaproxy.
2 Copyright (C) 2005-2011 Index Data
4 Metaproxy 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 Metaproxy 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
23 #include <metaproxy/filter.hpp>
24 #include <metaproxy/package.hpp>
26 #include <boost/thread/thread.hpp>
27 #include <boost/thread/mutex.hpp>
28 #include <boost/thread/condition.hpp>
29 #include <boost/shared_ptr.hpp>
31 #include <metaproxy/util.hpp>
32 #include "filter_multi.hpp"
35 #include <yaz/otherinfo.h>
36 #include <yaz/diagbib1.h>
37 #include <yaz/match_glob.h>
44 namespace mp = metaproxy_1;
45 namespace yf = mp::filter;
47 namespace metaproxy_1 {
49 enum multi_merge_type {
53 struct Multi::BackendSet {
56 bool operator < (const BackendSet &k) const;
57 bool operator == (const BackendSet &k) const;
59 struct Multi::ScanTermInfo {
60 std::string m_norm_term;
61 std::string m_display_term;
63 bool operator < (const ScanTermInfo &) const;
64 bool operator == (const ScanTermInfo &) const;
65 Z_Entry *get_entry(ODR odr);
67 struct Multi::FrontendSet {
71 int m_pos; // position for backend (1=first, 2=second,..
72 int m_start; // present request start
73 PresentJob(BackendPtr ptr, int pos) :
74 m_backend(ptr), m_pos(pos), m_start(0) {};
76 FrontendSet(std::string setname);
80 void round_robin(int pos, int number, std::list<PresentJob> &job);
81 void serve_order(int pos, int number, std::list<PresentJob> &job);
83 std::list<BackendSet> m_backend_sets;
84 std::string m_setname;
86 struct Multi::Backend {
88 std::string m_backend_database;
91 void operator() (void); // thread operation
93 struct Multi::Frontend {
98 std::list<BackendPtr> m_backend_list;
99 std::map<std::string,Multi::FrontendSet> m_sets;
101 void multi_move(std::list<BackendPtr> &blist);
102 void init(Package &package, Z_GDU *gdu);
103 void close(Package &package);
104 void search(Package &package, Z_APDU *apdu);
105 void present(Package &package, Z_APDU *apdu);
106 void scan1(Package &package, Z_APDU *apdu);
107 void scan2(Package &package, Z_APDU *apdu);
111 std::string m_target_pattern;
114 Map(std::string pattern, std::string route) :
115 m_target_pattern(pattern), m_route(route) {};
116 bool match(const std::string target, std::string *ret) const {
117 if (yaz_match_glob(m_target_pattern.c_str(), target.c_str()))
127 friend struct Frontend;
130 FrontendPtr get_frontend(Package &package);
131 void release_frontend(Package &package);
133 std::list<Multi::Map> m_route_patterns;
134 boost::mutex m_mutex;
135 boost::condition m_cond_session_ready;
136 std::map<mp::Session, FrontendPtr> m_clients;
137 bool m_hide_unavailable;
138 multi_merge_type m_merge_type;
143 yf::Multi::Rep::Rep()
145 m_hide_unavailable = false;
146 m_merge_type = round_robin;
149 bool yf::Multi::BackendSet::operator < (const BackendSet &k) const
151 return m_count < k.m_count;
154 yf::Multi::Frontend::Frontend(Rep *rep)
160 yf::Multi::Frontend::~Frontend()
164 yf::Multi::FrontendPtr yf::Multi::Rep::get_frontend(mp::Package &package)
166 boost::mutex::scoped_lock lock(m_mutex);
168 std::map<mp::Session,yf::Multi::FrontendPtr>::iterator it;
172 it = m_clients.find(package.session());
173 if (it == m_clients.end())
176 if (!it->second->m_in_use)
178 it->second->m_in_use = true;
181 m_cond_session_ready.wait(lock);
183 FrontendPtr f(new Frontend(this));
184 m_clients[package.session()] = f;
189 void yf::Multi::Rep::release_frontend(mp::Package &package)
191 boost::mutex::scoped_lock lock(m_mutex);
192 std::map<mp::Session,yf::Multi::FrontendPtr>::iterator it;
194 it = m_clients.find(package.session());
195 if (it != m_clients.end())
197 if (package.session().is_closed())
199 it->second->close(package);
204 it->second->m_in_use = false;
206 m_cond_session_ready.notify_all();
210 yf::Multi::FrontendSet::FrontendSet(std::string setname)
216 yf::Multi::FrontendSet::FrontendSet()
221 yf::Multi::FrontendSet::~FrontendSet()
225 yf::Multi::Multi() : m_p(new Multi::Rep)
229 yf::Multi::~Multi() {
233 void yf::Multi::Backend::operator() (void)
235 m_package->move(m_route);
239 void yf::Multi::Frontend::close(mp::Package &package)
241 std::list<BackendPtr>::const_iterator bit;
242 for (bit = m_backend_list.begin(); bit != m_backend_list.end(); bit++)
246 b->m_package->copy_filter(package);
247 b->m_package->request() = (Z_GDU *) 0;
248 b->m_package->session().close();
249 b->m_package->move(b->m_route);
253 void yf::Multi::Frontend::multi_move(std::list<BackendPtr> &blist)
255 std::list<BackendPtr>::const_iterator bit;
256 boost::thread_group g;
257 for (bit = blist.begin(); bit != blist.end(); bit++)
259 g.add_thread(new boost::thread(**bit));
264 void yf::Multi::FrontendSet::serve_order(int start, int number,
265 std::list<PresentJob> &jobs)
268 for (i = 0; i < number; i++)
270 std::list<BackendSet>::const_iterator bsit;
272 int offset = start + i - 1;
273 for (bsit = m_backend_sets.begin(); bsit != m_backend_sets.end();
276 if (offset >= voffset && offset < voffset + bsit->m_count)
278 PresentJob job(bsit->m_backend, offset - voffset + 1);
282 voffset += bsit->m_count;
287 void yf::Multi::FrontendSet::round_robin(int start, int number,
288 std::list<PresentJob> &jobs)
291 std::list<BackendSet>::const_iterator bsit;
292 for (bsit = m_backend_sets.begin(); bsit != m_backend_sets.end(); bsit++)
299 // optimization step!
305 // find min count for each set which is > omin
306 for (bsit = m_backend_sets.begin(); bsit != m_backend_sets.end(); bsit++)
308 if (bsit->m_count > omin)
310 if (no_left == 0 || bsit->m_count < min)
315 if (no_left == 0) // if nothing greater than omin, bail out.
317 int skip = no_left * min;
318 if (p + skip > start) // step gets us "into" present range?
320 // Yes. skip until start.. Rounding off is deliberate!
321 min = (start-p) / no_left;
324 // update positions in each set..
325 std::list<int>::iterator psit = pos.begin();
326 for (psit = pos.begin(); psit != pos.end(); psit++)
330 // skip on each set.. before "present range"..
333 std::list<int>::iterator psit = pos.begin();
334 for (psit = pos.begin(); psit != pos.end(); psit++)
337 omin = min; // update so we consider next class (with higher count)
345 std::list<int>::iterator psit = pos.begin();
346 bsit = m_backend_sets.begin();
348 for (; bsit != m_backend_sets.end(); psit++,bsit++)
350 if (fetched >= number)
355 if (*psit <= bsit->m_count)
359 PresentJob job(bsit->m_backend, *psit);
371 void yf::Multi::Frontend::init(mp::Package &package, Z_GDU *gdu)
373 Z_InitRequest *req = gdu->u.z3950->u.initRequest;
375 std::list<std::string> targets;
377 mp::util::get_vhost_otherinfo(req->otherInfo, targets);
379 if (targets.size() < 1)
385 std::list<std::string>::const_iterator t_it = targets.begin();
386 for (; t_it != targets.end(); t_it++)
389 Backend *b = new Backend;
392 std::list<Multi::Map>::const_iterator it =
393 m_p->m_route_patterns.begin();
394 while (it != m_p->m_route_patterns.end()) {
395 if (it->match(*t_it, &b->m_route))
399 // b->m_route = m_p->m_target_route[*t_it];
401 b->m_package = PackagePtr(new Package(s, package.origin()));
403 m_backend_list.push_back(BackendPtr(b));
407 // create init request
408 std::list<BackendPtr>::iterator bit;
409 for (bit = m_backend_list.begin(); bit != m_backend_list.end(); bit++)
413 Z_APDU *init_apdu = zget_APDU(odr, Z_APDU_initRequest);
415 std::list<std::string>vhost_one;
416 vhost_one.push_back(b->m_vhost);
417 mp::util::set_vhost_otherinfo(&init_apdu->u.initRequest->otherInfo,
420 init_apdu->u.initRequest->idAuthentication = req->idAuthentication;
422 Z_InitRequest *breq = init_apdu->u.initRequest;
424 ODR_MASK_SET(breq->options, Z_Options_search);
425 ODR_MASK_SET(breq->options, Z_Options_present);
426 ODR_MASK_SET(breq->options, Z_Options_namedResultSets);
427 ODR_MASK_SET(breq->options, Z_Options_scan);
429 ODR_MASK_SET(breq->protocolVersion, Z_ProtocolVersion_1);
430 ODR_MASK_SET(breq->protocolVersion, Z_ProtocolVersion_2);
431 ODR_MASK_SET(breq->protocolVersion, Z_ProtocolVersion_3);
433 b->m_package->request() = init_apdu;
435 b->m_package->copy_filter(package);
437 multi_move(m_backend_list);
439 // create the frontend init response based on each backend init response
442 Z_APDU *f_apdu = odr.create_initResponse(gdu->u.z3950, 0, 0);
443 Z_InitResponse *f_resp = f_apdu->u.initResponse;
445 ODR_MASK_SET(f_resp->options, Z_Options_search);
446 ODR_MASK_SET(f_resp->options, Z_Options_present);
447 ODR_MASK_SET(f_resp->options, Z_Options_namedResultSets);
448 ODR_MASK_SET(f_resp->options, Z_Options_scan);
450 ODR_MASK_SET(f_resp->protocolVersion, Z_ProtocolVersion_1);
451 ODR_MASK_SET(f_resp->protocolVersion, Z_ProtocolVersion_2);
452 ODR_MASK_SET(f_resp->protocolVersion, Z_ProtocolVersion_3);
455 int no_succeeded = 0;
456 for (bit = m_backend_list.begin(); bit != m_backend_list.end(); )
458 PackagePtr p = (*bit)->m_package;
460 if (p->session().is_closed())
462 // failed. Remove from list and increment number of failed
464 bit = m_backend_list.erase(bit);
467 Z_GDU *gdu = p->response().get();
468 if (gdu && gdu->which == Z_GDU_Z3950 && gdu->u.z3950->which ==
472 Z_APDU *b_apdu = gdu->u.z3950;
473 Z_InitResponse *b_resp = b_apdu->u.initResponse;
475 // common options for all backends
476 for (i = 0; i <= Z_Options_stringSchema; i++)
478 if (!ODR_MASK_GET(b_resp->options, i))
479 ODR_MASK_CLEAR(f_resp->options, i);
481 // common protocol version
482 for (i = 0; i <= Z_ProtocolVersion_3; i++)
483 if (!ODR_MASK_GET(b_resp->protocolVersion, i))
484 ODR_MASK_CLEAR(f_resp->protocolVersion, i);
494 if (m_p->m_hide_unavailable)
496 if (no_succeeded == 0)
499 package.session().close();
507 package.session().close();
510 package.response() = f_apdu;
513 void yf::Multi::Frontend::search(mp::Package &package, Z_APDU *apdu_req)
515 // create search request
516 Z_SearchRequest *req = apdu_req->u.searchRequest;
518 // save these for later
519 int smallSetUpperBound = *req->smallSetUpperBound;
520 int largeSetLowerBound = *req->largeSetLowerBound;
521 int mediumSetPresentNumber = *req->mediumSetPresentNumber;
523 // they are altered now - to disable piggyback
524 *req->smallSetUpperBound = 0;
525 *req->largeSetLowerBound = 1;
526 *req->mediumSetPresentNumber = 1;
528 int default_num_db = req->num_databaseNames;
529 char **default_db = req->databaseNames;
531 std::list<BackendPtr>::const_iterator bit;
532 for (bit = m_backend_list.begin(); bit != m_backend_list.end(); bit++)
534 PackagePtr p = (*bit)->m_package;
537 if (!mp::util::set_databases_from_zurl(odr, (*bit)->m_vhost,
538 &req->num_databaseNames,
539 &req->databaseNames))
541 req->num_databaseNames = default_num_db;
542 req->databaseNames = default_db;
544 p->request() = apdu_req;
545 p->copy_filter(package);
547 multi_move(m_backend_list);
549 // look at each response
550 FrontendSet resultSet(std::string(req->resultSetName));
552 int result_set_size = 0;
553 Z_Records *z_records_diag = 0; // no diagnostics (yet)
554 for (bit = m_backend_list.begin(); bit != m_backend_list.end(); bit++)
556 PackagePtr p = (*bit)->m_package;
558 if (p->session().is_closed()) // if any backend closes, close frontend
559 package.session().close();
561 Z_GDU *gdu = p->response().get();
562 if (gdu && gdu->which == Z_GDU_Z3950 && gdu->u.z3950->which ==
563 Z_APDU_searchResponse)
565 Z_APDU *b_apdu = gdu->u.z3950;
566 Z_SearchResponse *b_resp = b_apdu->u.searchResponse;
568 // see we get any errors (AKA diagnstics)
571 if (b_resp->records->which == Z_Records_NSD
572 || b_resp->records->which == Z_Records_multipleNSD)
573 z_records_diag = b_resp->records;
574 // we may set this multiple times (TOO BAD!)
576 BackendSet backendSet;
577 backendSet.m_backend = *bit;
578 backendSet.m_count = *b_resp->resultCount;
579 result_set_size += *b_resp->resultCount;
580 resultSet.m_backend_sets.push_back(backendSet);
584 // if any target does not return search response - return that
585 package.response() = p->response();
591 Z_APDU *f_apdu = odr.create_searchResponse(apdu_req, 0, 0);
592 Z_SearchResponse *f_resp = f_apdu->u.searchResponse;
594 *f_resp->resultCount = result_set_size;
598 f_resp->records = z_records_diag;
599 package.response() = f_apdu;
603 m_sets[resultSet.m_setname] = resultSet;
606 mp::util::piggyback(smallSetUpperBound,
608 mediumSetPresentNumber,
611 Package pp(package.session(), package.origin());
614 pp.copy_filter(package);
615 Z_APDU *p_apdu = zget_APDU(odr, Z_APDU_presentRequest);
616 Z_PresentRequest *p_req = p_apdu->u.presentRequest;
617 p_req->preferredRecordSyntax = req->preferredRecordSyntax;
618 p_req->resultSetId = req->resultSetName;
619 *p_req->resultSetStartPoint = 1;
620 *p_req->numberOfRecordsRequested = number;
621 pp.request() = p_apdu;
624 if (pp.session().is_closed())
625 package.session().close();
627 Z_GDU *gdu = pp.response().get();
628 if (gdu && gdu->which == Z_GDU_Z3950 && gdu->u.z3950->which ==
629 Z_APDU_presentResponse)
631 Z_PresentResponse *p_res = gdu->u.z3950->u.presentResponse;
632 f_resp->records = p_res->records;
633 *f_resp->numberOfRecordsReturned =
634 *p_res->numberOfRecordsReturned;
635 *f_resp->nextResultSetPosition =
636 *p_res->nextResultSetPosition;
640 package.response() = pp.response();
644 package.response() = f_apdu; // in this scope because of p
647 void yf::Multi::Frontend::present(mp::Package &package, Z_APDU *apdu_req)
649 // create present request
650 Z_PresentRequest *req = apdu_req->u.presentRequest;
653 it = m_sets.find(std::string(req->resultSetId));
654 if (it == m_sets.end())
658 odr.create_presentResponse(
660 YAZ_BIB1_SPECIFIED_RESULT_SET_DOES_NOT_EXIST,
662 package.response() = apdu;
665 std::list<Multi::FrontendSet::PresentJob> jobs;
666 int start = *req->resultSetStartPoint;
667 int number = *req->numberOfRecordsRequested;
669 if (m_p->m_merge_type == round_robin)
670 it->second.round_robin(start, number, jobs);
671 else if (m_p->m_merge_type == serve_order)
672 it->second.serve_order(start, number, jobs);
676 std::list<Multi::FrontendSet::PresentJob>::const_iterator jit;
677 for (jit = jobs.begin(); jit != jobs.end(); jit++)
679 yaz_log(YLOG_LOG, "job pos=%d", jit->m_pos);
683 std::list<BackendPtr> present_backend_list;
685 std::list<BackendSet>::const_iterator bsit;
686 bsit = it->second.m_backend_sets.begin();
687 for (; bsit != it->second.m_backend_sets.end(); bsit++)
692 std::list<Multi::FrontendSet::PresentJob>::const_iterator jit;
693 for (jit = jobs.begin(); jit != jobs.end(); jit++)
695 if (jit->m_backend == bsit->m_backend)
697 if (start == -1 || jit->m_pos < start)
699 if (end == -1 || jit->m_pos > end)
706 std::list<Multi::FrontendSet::PresentJob>::iterator jit;
707 for (jit = jobs.begin(); jit != jobs.end(); jit++)
709 if (jit->m_backend == bsit->m_backend)
711 if (jit->m_pos >= start && jit->m_pos <= end)
712 jit->m_start = start;
716 PackagePtr p = bsit->m_backend->m_package;
718 *req->resultSetStartPoint = start;
719 *req->numberOfRecordsRequested = end - start + 1;
721 p->request() = apdu_req;
722 p->copy_filter(package);
724 present_backend_list.push_back(bsit->m_backend);
727 multi_move(present_backend_list);
729 // look at each response
730 Z_Records *z_records_diag = 0;
732 std::list<BackendPtr>::const_iterator pbit = present_backend_list.begin();
733 for (; pbit != present_backend_list.end(); pbit++)
735 PackagePtr p = (*pbit)->m_package;
737 if (p->session().is_closed()) // if any backend closes, close frontend
738 package.session().close();
740 Z_GDU *gdu = p->response().get();
741 if (gdu && gdu->which == Z_GDU_Z3950 && gdu->u.z3950->which ==
742 Z_APDU_presentResponse)
744 Z_APDU *b_apdu = gdu->u.z3950;
745 Z_PresentResponse *b_resp = b_apdu->u.presentResponse;
747 // see we get any errors (AKA diagnstics)
750 if (b_resp->records->which != Z_Records_DBOSD)
751 z_records_diag = b_resp->records;
752 // we may set this multiple times (TOO BAD!)
757 // if any target does not return present response - return that
758 package.response() = p->response();
764 Z_APDU *f_apdu = odr.create_presentResponse(apdu_req, 0, 0);
765 Z_PresentResponse *f_resp = f_apdu->u.presentResponse;
769 f_resp->records = z_records_diag;
770 *f_resp->presentStatus = Z_PresentStatus_failure;
772 else if (number < 0 || (size_t) number > jobs.size())
775 odr.create_presentResponse(
777 YAZ_BIB1_PRESENT_REQUEST_OUT_OF_RANGE,
782 f_resp->records = (Z_Records *) odr_malloc(odr, sizeof(Z_Records));
783 Z_Records * records = f_resp->records;
784 records->which = Z_Records_DBOSD;
785 records->u.databaseOrSurDiagnostics =
786 (Z_NamePlusRecordList *)
787 odr_malloc(odr, sizeof(Z_NamePlusRecordList));
788 Z_NamePlusRecordList *nprl = records->u.databaseOrSurDiagnostics;
789 nprl->num_records = jobs.size();
790 nprl->records = (Z_NamePlusRecord**)
791 odr_malloc(odr, sizeof(Z_NamePlusRecord *) * nprl->num_records);
793 std::list<Multi::FrontendSet::PresentJob>::const_iterator jit;
794 for (jit = jobs.begin(); jit != jobs.end(); jit++, i++)
796 PackagePtr p = jit->m_backend->m_package;
798 Z_GDU *gdu = p->response().get();
799 Z_APDU *b_apdu = gdu->u.z3950;
800 Z_PresentResponse *b_resp = b_apdu->u.presentResponse;
802 nprl->records[i] = (Z_NamePlusRecord*)
803 odr_malloc(odr, sizeof(Z_NamePlusRecord));
804 int inside_pos = jit->m_pos - jit->m_start;
805 if (inside_pos >= b_resp->records->
806 u.databaseOrSurDiagnostics->num_records)
808 *nprl->records[i] = *b_resp->records->
809 u.databaseOrSurDiagnostics->records[inside_pos];
810 nprl->records[i]->databaseName =
811 odr_strdup(odr, jit->m_backend->m_vhost.c_str());
813 nprl->num_records = i; // usually same as jobs.size();
814 *f_resp->nextResultSetPosition = start + i;
815 *f_resp->numberOfRecordsReturned = i;
817 package.response() = f_apdu;
820 void yf::Multi::Frontend::scan1(mp::Package &package, Z_APDU *apdu_req)
822 if (m_backend_list.size() > 1)
826 odr.create_scanResponse(
827 apdu_req, YAZ_BIB1_COMBI_OF_SPECIFIED_DATABASES_UNSUPP, 0);
828 package.response() = f_apdu;
831 Z_ScanRequest *req = apdu_req->u.scanRequest;
833 int default_num_db = req->num_databaseNames;
834 char **default_db = req->databaseNames;
836 std::list<BackendPtr>::const_iterator bit;
837 for (bit = m_backend_list.begin(); bit != m_backend_list.end(); bit++)
839 PackagePtr p = (*bit)->m_package;
842 if (!mp::util::set_databases_from_zurl(odr, (*bit)->m_vhost,
843 &req->num_databaseNames,
844 &req->databaseNames))
846 req->num_databaseNames = default_num_db;
847 req->databaseNames = default_db;
849 p->request() = apdu_req;
850 p->copy_filter(package);
852 multi_move(m_backend_list);
854 for (bit = m_backend_list.begin(); bit != m_backend_list.end(); bit++)
856 PackagePtr p = (*bit)->m_package;
858 if (p->session().is_closed()) // if any backend closes, close frontend
859 package.session().close();
861 Z_GDU *gdu = p->response().get();
862 if (gdu && gdu->which == Z_GDU_Z3950 && gdu->u.z3950->which ==
865 package.response() = p->response();
870 // if any target does not return scan response - return that
871 package.response() = p->response();
877 bool yf::Multi::ScanTermInfo::operator < (const ScanTermInfo &k) const
879 return m_norm_term < k.m_norm_term;
882 bool yf::Multi::ScanTermInfo::operator == (const ScanTermInfo &k) const
884 return m_norm_term == k.m_norm_term;
887 Z_Entry *yf::Multi::ScanTermInfo::get_entry(ODR odr)
889 Z_Entry *e = (Z_Entry *)odr_malloc(odr, sizeof(*e));
890 e->which = Z_Entry_termInfo;
892 t = e->u.termInfo = (Z_TermInfo *) odr_malloc(odr, sizeof(*t));
893 t->suggestedAttributes = 0;
895 t->alternativeTerm = 0;
897 t->otherTermInfo = 0;
898 t->globalOccurrences = odr_intdup(odr, m_count);
900 odr_malloc(odr, sizeof(*t->term));
901 t->term->which = Z_Term_general;
903 t->term->u.general = o = (Odr_oct *)odr_malloc(odr, sizeof(Odr_oct));
905 o->len = o->size = m_norm_term.size();
906 o->buf = (unsigned char *) odr_malloc(odr, o->len);
907 memcpy(o->buf, m_norm_term.c_str(), o->len);
911 void yf::Multi::Frontend::scan2(mp::Package &package, Z_APDU *apdu_req)
913 Z_ScanRequest *req = apdu_req->u.scanRequest;
915 int default_num_db = req->num_databaseNames;
916 char **default_db = req->databaseNames;
918 std::list<BackendPtr>::const_iterator bit;
919 for (bit = m_backend_list.begin(); bit != m_backend_list.end(); bit++)
921 PackagePtr p = (*bit)->m_package;
924 if (!mp::util::set_databases_from_zurl(odr, (*bit)->m_vhost,
925 &req->num_databaseNames,
926 &req->databaseNames))
928 req->num_databaseNames = default_num_db;
929 req->databaseNames = default_db;
931 p->request() = apdu_req;
932 p->copy_filter(package);
934 multi_move(m_backend_list);
936 ScanTermInfoList entries_before;
937 ScanTermInfoList entries_after;
941 for (bit = m_backend_list.begin(); bit != m_backend_list.end(); bit++)
943 PackagePtr p = (*bit)->m_package;
945 if (p->session().is_closed()) // if any backend closes, close frontend
946 package.session().close();
948 Z_GDU *gdu = p->response().get();
949 if (gdu && gdu->which == Z_GDU_Z3950 && gdu->u.z3950->which ==
952 Z_ScanResponse *res = gdu->u.z3950->u.scanResponse;
954 if (res->entries && res->entries->nonsurrogateDiagnostics)
958 Z_APDU *f_apdu = odr.create_scanResponse(apdu_req, 1, 0);
959 Z_ScanResponse *f_res = f_apdu->u.scanResponse;
961 f_res->entries->nonsurrogateDiagnostics =
962 res->entries->nonsurrogateDiagnostics;
963 f_res->entries->num_nonsurrogateDiagnostics =
964 res->entries->num_nonsurrogateDiagnostics;
966 package.response() = f_apdu;
970 if (res->entries && res->entries->entries)
972 Z_Entry **entries = res->entries->entries;
973 int num_entries = res->entries->num_entries;
975 if (req->preferredPositionInResponse)
976 position = *req->preferredPositionInResponse;
977 if (res->positionOfTerm)
978 position = *res->positionOfTerm;
982 for (i = 0; i<position-1 && i<num_entries; i++)
984 Z_Entry *ent = entries[i];
986 if (ent->which == Z_Entry_termInfo)
990 Odr_int *occur = ent->u.termInfo->globalOccurrences;
991 my.m_count = occur ? *occur : 0;
993 if (ent->u.termInfo->term->which == Z_Term_general)
995 my.m_norm_term = std::string(
997 ent->u.termInfo->term->u.general->buf,
998 ent->u.termInfo->term->u.general->len);
1000 if (my.m_norm_term.length())
1002 ScanTermInfoList::iterator it =
1003 entries_before.begin();
1004 while (it != entries_before.end() && my <*it)
1008 it->m_count += my.m_count;
1012 entries_before.insert(it, my);
1023 for ( ; i<num_entries; i++)
1025 Z_Entry *ent = entries[i];
1027 if (ent->which == Z_Entry_termInfo)
1031 Odr_int *occur = ent->u.termInfo->globalOccurrences;
1032 my.m_count = occur ? *occur : 0;
1034 if (ent->u.termInfo->term->which == Z_Term_general)
1036 my.m_norm_term = std::string(
1038 ent->u.termInfo->term->u.general->buf,
1039 ent->u.termInfo->term->u.general->len);
1041 if (my.m_norm_term.length())
1043 ScanTermInfoList::iterator it =
1044 entries_after.begin();
1045 while (it != entries_after.end() && *it < my)
1049 it->m_count += my.m_count;
1053 entries_after.insert(it, my);
1064 // if any target does not return scan response - return that
1065 package.response() = p->response();
1072 std::cout << "BEFORE\n";
1073 ScanTermInfoList::iterator it = entries_before.begin();
1074 for(; it != entries_before.end(); it++)
1076 std::cout << " " << it->m_norm_term << " " << it->m_count << "\n";
1079 std::cout << "AFTER\n";
1080 it = entries_after.begin();
1081 for(; it != entries_after.end(); it++)
1083 std::cout << " " << it->m_norm_term << " " << it->m_count << "\n";
1090 Z_APDU *f_apdu = odr.create_scanResponse(apdu_req, 1, "not implemented");
1091 package.response() = f_apdu;
1096 Z_APDU *f_apdu = odr.create_scanResponse(apdu_req, 0, 0);
1097 Z_ScanResponse *resp = f_apdu->u.scanResponse;
1099 int number_returned = *req->numberOfTermsRequested;
1100 int position_returned = *req->preferredPositionInResponse;
1102 resp->entries->num_entries = number_returned;
1103 resp->entries->entries = (Z_Entry**)
1104 odr_malloc(odr, sizeof(Z_Entry*) * number_returned);
1107 int lbefore = entries_before.size();
1108 if (lbefore < position_returned-1)
1109 position_returned = lbefore+1;
1111 ScanTermInfoList::iterator it = entries_before.begin();
1112 for (i = 0; i<position_returned-1 && it != entries_before.end(); i++, it++)
1114 resp->entries->entries[position_returned-2-i] = it->get_entry(odr);
1117 it = entries_after.begin();
1119 if (position_returned <= 0)
1122 i = position_returned-1;
1123 for (; i<number_returned && it != entries_after.end(); i++, it++)
1125 resp->entries->entries[i] = it->get_entry(odr);
1128 number_returned = i;
1130 resp->positionOfTerm = odr_intdup(odr, position_returned);
1131 resp->numberOfEntriesReturned = odr_intdup(odr, number_returned);
1132 resp->entries->num_entries = number_returned;
1134 package.response() = f_apdu;
1139 void yf::Multi::process(mp::Package &package) const
1141 FrontendPtr f = m_p->get_frontend(package);
1143 Z_GDU *gdu = package.request().get();
1145 if (gdu && gdu->which == Z_GDU_Z3950 && gdu->u.z3950->which ==
1146 Z_APDU_initRequest && !f->m_is_multi)
1148 f->init(package, gdu);
1150 else if (!f->m_is_multi)
1152 else if (gdu && gdu->which == Z_GDU_Z3950)
1154 Z_APDU *apdu = gdu->u.z3950;
1155 if (apdu->which == Z_APDU_initRequest)
1159 package.response() = odr.create_close(
1161 Z_Close_protocolError,
1164 package.session().close();
1166 else if (apdu->which == Z_APDU_searchRequest)
1168 f->search(package, apdu);
1170 else if (apdu->which == Z_APDU_presentRequest)
1172 f->present(package, apdu);
1174 else if (apdu->which == Z_APDU_scanRequest)
1176 f->scan2(package, apdu);
1182 package.response() = odr.create_close(
1183 apdu, Z_Close_protocolError,
1184 "unsupported APDU in filter multi");
1186 package.session().close();
1189 m_p->release_frontend(package);
1192 void mp::filter::Multi::configure(const xmlNode * ptr, bool test_only)
1194 for (ptr = ptr->children; ptr; ptr = ptr->next)
1196 if (ptr->type != XML_ELEMENT_NODE)
1198 if (!strcmp((const char *) ptr->name, "target"))
1200 std::string route = mp::xml::get_route(ptr);
1201 std::string target = mp::xml::get_text(ptr);
1202 m_p->m_route_patterns.push_back(Multi::Map(target, route));
1204 else if (!strcmp((const char *) ptr->name, "hideunavailable"))
1206 m_p->m_hide_unavailable = true;
1208 else if (!strcmp((const char *) ptr->name, "mergetype"))
1210 std::string mergetype = mp::xml::get_text(ptr);
1211 if (mergetype == "roundrobin")
1212 m_p->m_merge_type = round_robin;
1213 else if (mergetype == "serveorder")
1214 m_p->m_merge_type = serve_order;
1216 throw mp::filter::FilterException
1217 ("Bad mergetype " + mergetype + " in multi filter");
1222 throw mp::filter::FilterException
1224 + std::string((const char *) ptr->name)
1225 + " in multi filter");
1230 static mp::filter::Base* filter_creator()
1232 return new mp::filter::Multi;
1236 struct metaproxy_1_filter_struct metaproxy_1_filter_multi = {
1247 * c-file-style: "Stroustrup"
1248 * indent-tabs-mode: nil
1250 * vim: shiftwidth=4 tabstop=8 expandtab