|
|
Index Data > YAZ > YAZ User's Guide and Reference > The Backend Functions For each service of the protocol, the backend interface declares one or two functions. You are required to provide implementations of the functions representing the services that you wish to implement.
bend_initresult (*bend_init)(bend_initrequest *r);
This handler is called once for each new connection request, after
a new process/thread has been created, and an Initialize Request has
been received from the client. The pointer to the
This handler is also called when operating in SRU mode - when a connection has been made (even though SRU does not offer this service).
Unlike previous versions of YAZ, the The request - and result structures are defined as
typedef struct bend_initrequest
{
/** \brief user/name/password to be read */
Z_IdAuthentication *auth;
/** \brief encoding stream (for results) */
ODR stream;
/** \brief printing stream */
ODR print;
/** \brief decoding stream (use stream for results) */
ODR decode;
/** \brief reference ID */
Z_ReferenceId *referenceId;
/** \brief peer address of client */
char *peer_name;
/** \brief character set and language negotiation
see include/yaz/z-charneg.h
*/
Z_CharSetandLanguageNegotiation *charneg_request;
/** \brief character negotiation response */
Z_External *charneg_response;
/** \brief character set (encoding) for query terms
This is NULL by default. It should be set to the native character
set that the backend assumes for query terms */
char *query_charset;
/** \brief whehter query_charset also applies to recors
Is 0 (No) by default. Set to 1 (yes) if records is in the same
character set as queries. If in doubt, use 0 (No).
*/
int records_in_same_charset;
char *implementation_id;
char *implementation_name;
char *implementation_version;
/** \brief Z39.50 sort handler */
int (*bend_sort)(void *handle, bend_sort_rr *rr);
/** \brief SRU/Z39.50 search handler */
int (*bend_search)(void *handle, bend_search_rr *rr);
/** \brief SRU/Z39.50 fetch handler */
int (*bend_fetch)(void *handle, bend_fetch_rr *rr);
/** \brief SRU/Z39.50 present handler */
int (*bend_present)(void *handle, bend_present_rr *rr);
/** \brief Z39.50 extended services handler */
int (*bend_esrequest) (void *handle, bend_esrequest_rr *rr);
/** \brief Z39.50 delete result set handler */
int (*bend_delete)(void *handle, bend_delete_rr *rr);
/** \brief Z39.50 scan handler */
int (*bend_scan)(void *handle, bend_scan_rr *rr);
/** \brief Z39.50 segment facility handler */
int (*bend_segment)(void *handle, bend_segment_rr *rr);
/** \brief SRU explain handler */
int (*bend_explain)(void *handle, bend_explain_rr *rr);
/** \brief SRU scan handler */
int (*bend_srw_scan)(void *handle, bend_scan_rr *rr);
/** \brief SRU record update handler */
int (*bend_srw_update)(void *handle, bend_update_rr *rr);
} bend_initrequest;
typedef struct bend_initresult
{
int errcode; /* 0==OK */
char *errstring; /* system error string or NULL */
void *handle; /* private handle to the backend module */
} bend_initresult;
In general, the server frontend expects that the
The
The
The members
The We now describe the handlers that are required to support search - and retrieve. You must support two functions - one for search - and one for fetch (retrieval of one record). If desirable you can provide a third handler which is called when a present request is received which allows you to optimize retrieval of multiple-records.
int (*bend_search) (void *handle, bend_search_rr *rr);
typedef struct {
char *setname; /* name to give to this set */
int replace_set; /* replace set, if it already exists */
int num_bases; /* number of databases in list */
char **basenames; /* databases to search */
Z_ReferenceId *referenceId;/* reference ID */
Z_Query *query; /* query structure */
ODR stream; /* encode stream */
ODR decode; /* decode stream */
ODR print; /* print stream */
bend_request request;
bend_association association;
int *fd;
int hits; /* number of hits */
int errcode; /* 0==OK */
char *errstring; /* system error string or NULL */
Z_OtherInformation *search_info; /* additional search info */
char *srw_sortKeys; /* holds SRU/SRW sortKeys info */
char *srw_setname; /* holds SRU/SRW generated resultsetID */
int *srw_setnameIdleTime; /* holds SRU/SRW life-time */
int estimated_hit_count; /* if hit count is estimated */
int partial_resultset; /* if result set is partial */
} bend_search_rr;
The
The structure contains a number of hits, and an
The To maintain backwards compatibility, the frontend server of yaz always assume that error codes are BIB-1 diagnostics. For SRU operation, a Bib-1 diagnostic code is mapped to SRU diagnostic.
int (*bend_fetch) (void *handle, bend_fetch_rr *rr);
typedef struct bend_fetch_rr {
char *setname; /* set name */
int number; /* record number */
Z_ReferenceId *referenceId;/* reference ID */
Odr_oid *request_format; /* format, transfer syntax (OID) */
Z_RecordComposition *comp; /* Formatting instructions */
ODR stream; /* encoding stream - memory source if req */
ODR print; /* printing stream */
char *basename; /* name of database that provided record */
int len; /* length of record or -1 if structured */
char *record; /* record */
int last_in_set; /* is it? */
Odr_oid *output_format; /* response format/syntax (OID) */
int errcode; /* 0==success */
char *errstring; /* system error string or NULL */
int surrogate_flag; /* surrogate diagnostic */
char *schema; /* string record schema input/output */
} bend_fetch_rr;
The frontend server calls the
If a SRU SearchRetrieveRequest is received by the frontend server,
the
In the structure, the
If the Note
If your backend generates structured records, it should use
The NoteThe current version of YAZ only supports the direct reference mode.
int (*bend_present) (void *handle, bend_present_rr *rr);
typedef struct {
char *setname; /* set name */
int start;
int number; /* record number */
Odr_oid *format; /* format, transfer syntax (OID) */
Z_ReferenceId *referenceId;/* reference ID */
Z_RecordComposition *comp; /* Formatting instructions */
ODR stream; /* encoding stream - memory source if required */
ODR print; /* printing stream */
bend_request request;
bend_association association;
int hits; /* number of hits */
int errcode; /* 0==OK */
char *errstring; /* system error string or NULL */
} bend_present_rr;
The
Note that this is handler serves as a supplement for
For back-ends that supports delete of a result set only one handler must be defined.
int (*bend_delete)(void *handle, bend_delete_rr *rr);
typedef struct bend_delete_rr {
int function;
int num_setnames;
char **setnames;
Z_ReferenceId *referenceId;
int delete_status; /* status for the whole operation */
int *statuses; /* status each set - indexed as setnames */
ODR stream;
ODR print;
} bend_delete_rr;
NoteThe delete set function definition is rather primitive, mostly because we have had no practical need for it as of yet. If someone wants to provide a full delete service, we'd be happy to add the extra parameters that are required. Are there clients out there that will actually delete sets they no longer need? For servers that wish to offer the scan service one handler must be defined.
int (*bend_scan)(void *handle, bend_scan_rr *rr);
typedef enum {
BEND_SCAN_SUCCESS, /* ok */
BEND_SCAN_PARTIAL /* not all entries could be found */
} bend_scan_status;
typedef struct bend_scan_rr {
int num_bases; /* number of elements in databaselist */
char **basenames; /* databases to search */
Odr_oid *attributeset;
Z_ReferenceId *referenceId; /* reference ID */
Z_AttributesPlusTerm *term;
ODR stream; /* encoding stream - memory source if required */
ODR print; /* printing stream */
int *step_size; /* step size */
int term_position; /* desired index of term in result list/returned */
int num_entries; /* number of entries requested/returned */
/* scan term entries. The called handler does not have
to allocate this. Size of entries is num_entries (see above) */
struct scan_entry *entries;
bend_scan_status status;
int errcode;
char *errstring;
char *scanClause; /* CQL scan clause */
char *setname; /* Scan in result set (NULL if omitted) */
} bend_scan_rr;
This backend server handles both Z39.50 scan
and SRU scan. In order for a handler to distinguish between SRU (CQL) scan
Z39.50 Scan , it must check for a non-NULL value of
Noteif designed today, it would be a choice using a union or similar, but that would break binary compatibility with existing servers. |
|||
|
|
||||
| Copyright Index Data ApS 2008 | ||||