/* backglue.c - backend glue routines */
/* $OpenLDAP$ */
-/*
- * Copyright 2001 The OpenLDAP Foundation, All Rights Reserved.
- * COPYING RESTRICTIONS APPLY, see COPYRIGHT file
+/* This work is part of OpenLDAP Software <http://www.openldap.org/>.
+ *
+ * Copyright 2001-2003 The OpenLDAP Foundation.
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted only as authorized by the OpenLDAP
+ * Public License.
+ *
+ * A copy of this license is available in the file LICENSE in the
+ * top-level directory of the distribution or, alternatively, at
+ * <http://www.OpenLDAP.org/license.html>.
*/
/*
* All of the glued backends must share a common suffix. E.g., you
* can glue o=foo and ou=bar,o=foo but you can't glue o=foo and o=bar.
*
- * The only configuration items that are needed for this backend are
- * the suffixes, and they should be identical to suffixes of other
- * backends that are being configured. The suffixes must be listed
- * in order from longest to shortest, (most-specific to least-specific)
- * in order for the selection to work. Every backend that is being glued
- * must be fully configured as usual.
+ * This uses the backend structures and routines extensively, but is
+ * not an actual backend of its own. To use it you must add a "subordinate"
+ * keyword to the configuration of other backends. Subordinates will
+ * automatically be connected to their parent backend.
*
- * The purpose of this backend is to allow you to split a single database
+ * The purpose of these functions is to allow you to split a single database
* into pieces (for load balancing purposes, whatever) but still be able
* to treat it as a single database after it's been split. As such, each
* of the glued backends should have identical rootdn and rootpw.
#include <stdio.h>
+#include <ac/string.h>
#include <ac/socket.h>
#define SLAPD_TOOLS
typedef struct gluenode {
BackendDB *be;
- char *pdn;
+ struct berval pdn;
} gluenode;
typedef struct glueinfo {
+ BackendInfo bi;
+ BackendDB bd;
int nodes;
gluenode n[1];
} glueinfo;
+static int glueMode;
+static BackendDB *glueBack;
+
+static slap_response glue_back_response;
+
/* Just like select_backend, but only for our backends */
static BackendDB *
glue_back_select (
const char *dn
)
{
- glueinfo *gi = (glueinfo *) be->be_private;
+ glueinfo *gi = (glueinfo *) be->bd_info;
+ struct berval bv;
int i;
- for (i = 0; be->be_nsuffix[i]; i++) {
- if (dn_issuffix (dn, be->be_nsuffix[i]->bv_val))
+ bv.bv_len = strlen(dn);
+ bv.bv_val = (char *) dn;
+
+ for (i = 0; i<gi->nodes; i++) {
+ if (dnIsSuffix(&bv, &gi->n[i].be->be_nsuffix[0])) {
return gi->n[i].be;
+ }
}
return NULL;
}
+/* This function will only be called in tool mode */
static int
-glue_back_db_open (
- BackendDB *be
+glue_back_open (
+ BackendInfo *bi
)
{
- glueinfo *gi;
- int i, j, k;
- int ok;
+ int rc = 0;
+ static int glueOpened = 0;
- /*
- * Done already?
- */
- if (be->be_private)
- return 0;
-
- for (i = 0; be->be_nsuffix[i]; i++);
+ if (glueOpened) return 0;
- gi = (struct glueinfo *) ch_calloc (1, sizeof (glueinfo) +
- (i-1) * sizeof (gluenode) );
+ glueOpened = 1;
- be->be_private = gi;
+ /* If we were invoked in tool mode, open all the underlying backends */
+ if (slapMode & SLAP_TOOL_MODE) {
+ rc = backend_startup (NULL);
+ } /* other case is impossible */
+ return rc;
+}
- if (!gi)
- return 1;
+/* This function will only be called in tool mode */
+static int
+glue_back_close (
+ BackendInfo *bi
+)
+{
+ static int glueClosed = 0;
+ int rc = 0;
- gi->nodes = i;
- be->be_glueflags = SLAP_GLUE_INSTANCE;
+ if (glueClosed) return 0;
- /*
- * For each of our suffixes, find the real backend that handles this
- * suffix.
- */
- for (i = 0; be->be_nsuffix[i]; i++) {
- for (j = 0; j < nbackends; j++) {
- if (be == &backends[j])
- continue;
- ok = 0;
- for (k = 0; backends[j].be_nsuffix &&
- backends[j].be_nsuffix[k]; k++) {
- if (be->be_nsuffix[i]->bv_len !=
- backends[j].be_nsuffix[k]->bv_len)
- continue;
- if (!strcmp (backends[j].be_nsuffix[k]->bv_val,
- be->be_nsuffix[i]->bv_val)) {
- ok = 1;
- break;
- }
- }
- if (ok) {
- gi->n[i].be = &backends[j];
- gi->n[i].pdn = dn_parent (NULL,
- be->be_nsuffix[i]->bv_val);
- if (i < gi->nodes - 1)
- gi->n[i].be->be_glueflags =
- SLAP_GLUE_SUBORDINATE;
- break;
- }
- }
- }
+ glueClosed = 1;
- /* If we were invoked in tool mode, open all the underlying backends */
if (slapMode & SLAP_TOOL_MODE) {
- for (i = 0; be->be_nsuffix[i]; i++) {
- backend_startup (gi->n[i].be);
- }
+ rc = backend_shutdown (NULL);
}
- return 0;
+ return rc;
}
static int
-glue_back_db_close (
+glue_back_db_open (
BackendDB *be
)
{
- glueinfo *gi = (glueinfo *) be->be_private;
+ glueinfo *gi = (glueinfo *) be->bd_info;
+ static int glueOpened = 0;
+ int rc = 0;
- if (slapMode & SLAP_TOOL_MODE) {
- int i;
- for (i = 0; be->be_nsuffix[i]; i++) {
- backend_shutdown (gi->n[i].be);
- }
- }
- return 0;
+ if (glueOpened) return 0;
+
+ glueOpened = 1;
+
+ gi->bd.be_acl = be->be_acl;
+
+ if (gi->bd.bd_info->bi_db_open)
+ rc = gi->bd.bd_info->bi_db_open(&gi->bd);
+
+ return rc;
}
-int
-glue_back_db_destroy (
+
+static int
+glue_back_db_close (
BackendDB *be
)
{
- free (be->be_private);
+ glueinfo *gi = (glueinfo *) be->bd_info;
+ static int glueClosed = 0;
+
+ if (glueClosed) return 0;
+
+ glueClosed = 1;
+
+ /* Close the master */
+ if (gi->bd.bd_info->bi_db_close)
+ gi->bd.bd_info->bi_db_close( &gi->bd );
+
return 0;
}
-int
-glue_back_bind (
- BackendDB *b0,
- Connection *conn,
- Operation *op,
- const char *dn,
- const char *ndn,
- int method,
- struct berval *cred,
- char **edn
+static int
+glue_back_db_destroy (
+ BackendDB *be
)
{
- BackendDB *be;
- int rc;
+ glueinfo *gi = (glueinfo *) be->bd_info;
- be = glue_back_select (b0, ndn);
-
- if (be && be->be_bind) {
- conn->c_authz_backend = be;
- rc = be->be_bind (be, conn, op, dn, ndn, method, cred, edn);
- } else {
- rc = LDAP_UNWILLING_TO_PERFORM;
- send_ldap_result (conn, op, rc, NULL, "No bind target found",
- NULL, NULL);
- }
- return rc;
+ if (gi->bd.bd_info->bi_db_destroy)
+ gi->bd.bd_info->bi_db_destroy( &gi->bd );
+ free (gi);
+ return 0;
}
typedef struct glue_state {
int err;
- int nentries;
+ int is_slimit;
+ int slimit;
int matchlen;
char *matched;
+ int nrefs;
+ BerVarray refs;
} glue_state;
-void
-glue_back_response (
- Connection *conn,
- Operation *op,
- ber_tag_t tag,
- ber_int_t msgid,
- ber_int_t err,
- const char *matched,
- const char *text,
- struct berval **ref,
- const char *resoid,
- struct berval *resdata,
- struct berval *sasldata,
- LDAPControl **ctrls
-)
+static int
+glue_back_response ( Operation *op, SlapReply *rs )
{
- glue_state *gs = op->o_glue;
+ glue_state *gs = op->o_callback->sc_private;
- if (err == LDAP_SUCCESS || gs->err != LDAP_SUCCESS)
- gs->err = err;
- if (gs->err == LDAP_SUCCESS && gs->matched) {
- free (gs->matched);
- gs->matchlen = 0;
- }
- if (gs->err != LDAP_SUCCESS && matched) {
- int len;
- len = strlen (matched);
- if (len > gs->matchlen) {
- if (gs->matched)
- free (gs->matched);
- gs->matched = ch_strdup (matched);
- gs->matchlen = len;
+ switch(rs->sr_type) {
+ case REP_SEARCH:
+ if ( gs->is_slimit && rs->sr_nentries >= gs->slimit ) {
+ gs->err = LDAP_SIZELIMIT_EXCEEDED;
+ return -1;
+ }
+ /* fallthru */
+ case REP_SEARCHREF:
+ return SLAP_CB_CONTINUE;
+
+ default:
+ if ( gs->is_slimit && rs->sr_err == LDAP_SIZELIMIT_EXCEEDED
+ && rs->sr_nentries >= gs->slimit ) {
+ gs->err = LDAP_SIZELIMIT_EXCEEDED;
+ return -1;
+ }
+ if (rs->sr_err == LDAP_SUCCESS || gs->err != LDAP_SUCCESS) {
+ gs->err = rs->sr_err;
+ }
+ if (gs->err == LDAP_SUCCESS && gs->matched) {
+ ch_free (gs->matched);
+ gs->matched = NULL;
+ gs->matchlen = 0;
+ }
+ if (gs->err != LDAP_SUCCESS && rs->sr_matched) {
+ int len;
+ len = strlen (rs->sr_matched);
+ if (len > gs->matchlen) {
+ if (gs->matched)
+ ch_free (gs->matched);
+ gs->matched = ch_strdup (rs->sr_matched);
+ gs->matchlen = len;
+ }
+ }
+ if (rs->sr_ref) {
+ int i, j, k;
+ BerVarray new;
+
+ for (i=0; rs->sr_ref[i].bv_val; i++);
+
+ j = gs->nrefs;
+ if (!j) {
+ new = ch_malloc ((i+1)*sizeof(struct berval));
+ } else {
+ new = ch_realloc(gs->refs,
+ (j+i+1)*sizeof(struct berval));
+ }
+ for (k=0; k<i; j++,k++) {
+ ber_dupbv( &new[j], &rs->sr_ref[k] );
+ }
+ new[j].bv_val = NULL;
+ gs->nrefs = j;
+ gs->refs = new;
}
}
+ return 0;
}
-void
-glue_back_sresult (
- Connection *c,
- Operation *op,
- ber_int_t err,
- const char *matched,
- const char *text,
- struct berval **refs,
- LDAPControl **ctrls,
- int nentries
-)
+static int
+glue_back_search ( Operation *op, SlapReply *rs )
{
- glue_state *gs = op->o_glue;
+ BackendDB *b0 = op->o_bd;
+ glueinfo *gi = (glueinfo *) b0->bd_info;
+ int i;
+ long stoptime = 0;
+ glue_state gs = {0, 0, 0, 0, NULL, 0, NULL};
+ slap_callback cb = { NULL, glue_back_response, NULL, NULL };
+ int scope0, slimit0, tlimit0;
+ struct berval dn, ndn;
- gs->nentries += nentries;
- glue_back_response (c, op, 0, 0, err, matched, text, refs,
- NULL, NULL, NULL, ctrls);
-}
+ gs.is_slimit = ( op->ors_slimit > 0 );
-int
-glue_back_search (
- BackendDB *b0,
- Connection *conn,
- Operation *op,
- const char *dn,
- const char *ndn,
- int scope,
- int deref,
- int slimit,
- int tlimit,
- Filter *filter,
- const char *filterstr,
- char **attrs,
- int attrsonly
-)
-{
- glueinfo *gi = (glueinfo *) b0->be_private;
- BackendDB *be;
- int i, rc, t2limit = 0, s2limit = 0;
- long stoptime = 0;
- glue_state gs =
- {0};
+ cb.sc_private = &gs;
+ cb.sc_next = op->o_callback;
- if (tlimit)
- stoptime = slap_get_time () + tlimit;
+ if (op->ors_tlimit) {
+ stoptime = slap_get_time () + op->ors_tlimit;
+ }
- switch (scope) {
+ switch (op->ors_scope) {
case LDAP_SCOPE_BASE:
- be = glue_back_select (b0, ndn);
+ op->o_bd = glue_back_select (b0, op->o_req_ndn.bv_val);
- if (be && be->be_search) {
- rc = be->be_search (be, conn, op, dn, ndn, scope,
- deref, slimit, tlimit, filter, filterstr,
- attrs, attrsonly);
+ if (op->o_bd && op->o_bd->be_search) {
+ rs->sr_err = op->o_bd->be_search( op, rs );
} else {
- rc = LDAP_UNWILLING_TO_PERFORM;
- send_ldap_result (conn, op, rc, NULL,
- "No search target found", NULL, NULL);
+ send_ldap_error(op, rs, LDAP_UNWILLING_TO_PERFORM,
+ "No search target found");
}
- return rc;
+ return rs->sr_err;
case LDAP_SCOPE_ONELEVEL:
- op->o_glue = &gs;
- op->o_sresult = glue_back_sresult;
- op->o_response = glue_back_response;
+ case LDAP_SCOPE_SUBTREE:
+ case LDAP_SCOPE_SUBORDINATE: /* FIXME */
+ op->o_callback = &cb;
+ rs->sr_err = gs.err = LDAP_UNWILLING_TO_PERFORM;
+ scope0 = op->ors_scope;
+ if ( gs.is_slimit ) {
+ slimit0 = gs.slimit = op->ors_slimit;
+ }
+ tlimit0 = op->ors_tlimit;
+ dn = op->o_req_dn;
+ ndn = op->o_req_ndn;
/*
* Execute in reverse order, most general first
*/
for (i = gi->nodes-1; i >= 0; i--) {
- if (!gi->n[i].be->be_search)
+ if (!gi->n[i].be || !gi->n[i].be->be_search)
continue;
- if (tlimit) {
- t2limit = stoptime - slap_get_time ();
- if (t2limit <= 0)
+ if (tlimit0) {
+ op->ors_tlimit = stoptime - slap_get_time ();
+ if (op->ors_tlimit <= 0) {
+ rs->sr_err = gs.err = LDAP_TIMELIMIT_EXCEEDED;
break;
+ }
}
- if (slimit) {
- s2limit = slimit - gs.nentries;
- if (s2limit <= 0)
+ if ( gs.is_slimit ) {
+ op->ors_slimit = slimit0 - rs->sr_nentries;
+ if (op->ors_slimit < 0) {
+ rs->sr_err = gs.err = LDAP_SIZELIMIT_EXCEEDED;
break;
+ }
}
+ rs->sr_err = 0;
/*
* check for abandon
*/
- ldap_pvt_thread_mutex_lock (&op->o_abandonmutex);
- rc = op->o_abandon;
- ldap_pvt_thread_mutex_unlock (&op->o_abandonmutex);
- if (rc) {
- rc = 0;
+ if (op->o_abandon) {
goto done;
}
- if (!strcmp (gi->n[i].pdn, ndn)) {
- be = gi->n[i].be;
- rc = be->be_search (be, conn, op,
- b0->be_suffix[i],
- b0->be_nsuffix[i]->bv_val,
- LDAP_SCOPE_BASE, deref,
- s2limit, t2limit, filter, filterstr,
- attrs, attrsonly);
- } else if (dn_issuffix (ndn, b0->be_nsuffix[i]->bv_val)) {
- be = gi->n[i].be;
- rc = be->be_search (be, conn, op,
- dn, ndn, scope, deref,
- s2limit, t2limit, filter, filterstr,
- attrs, attrsonly);
+ op->o_bd = gi->n[i].be;
+ if (scope0 == LDAP_SCOPE_ONELEVEL &&
+ dn_match(&gi->n[i].pdn, &ndn))
+ {
+ op->ors_scope = LDAP_SCOPE_BASE;
+ op->o_req_dn = op->o_bd->be_suffix[0];
+ op->o_req_ndn = op->o_bd->be_nsuffix[0];
+ rs->sr_err = op->o_bd->be_search(op, rs);
+
+ } else if (scope0 == LDAP_SCOPE_SUBTREE &&
+ dnIsSuffix(&op->o_bd->be_nsuffix[0], &ndn))
+ {
+ op->o_req_dn = op->o_bd->be_suffix[0];
+ op->o_req_ndn = op->o_bd->be_nsuffix[0];
+ rs->sr_err = op->o_bd->be_search( op, rs );
+
+ } else if (dnIsSuffix(&ndn, &op->o_bd->be_nsuffix[0])) {
+ rs->sr_err = op->o_bd->be_search( op, rs );
}
- }
- break;
- case LDAP_SCOPE_SUBTREE:
- op->o_glue = &gs;
- op->o_sresult = glue_back_sresult;
- op->o_response = glue_back_response;
+ switch ( gs.err ) {
- /*
- * Execute in reverse order, most general first
- */
- for (i = gi->nodes-1; i >= 0; i--) {
- if (!gi->n[i].be->be_search)
- continue;
- if (tlimit) {
- t2limit = stoptime - slap_get_time ();
- if (t2limit <= 0)
- break;
- }
- if (slimit) {
- s2limit = slimit - gs.nentries;
- if (s2limit <= 0)
- break;
- }
/*
- * check for abandon
+ * Add errors that should result in dropping
+ * the search
*/
- ldap_pvt_thread_mutex_lock (&op->o_abandonmutex);
- rc = op->o_abandon;
- ldap_pvt_thread_mutex_unlock (&op->o_abandonmutex);
- if (rc) {
- rc = 0;
- goto done;
- }
- if (dn_issuffix (ndn, b0->be_nsuffix[i]->bv_val)) {
- be = gi->n[i].be;
- rc = be->be_search (be, conn, op,
- dn, ndn, scope, deref,
- s2limit, t2limit, filter, filterstr,
- attrs, attrsonly);
- } else if (dn_issuffix (b0->be_nsuffix[i]->bv_val, ndn)) {
- be = gi->n[i].be;
- rc = be->be_search (be, conn, op,
- b0->be_suffix[i],
- b0->be_nsuffix[i]->bv_val,
- scope, deref,
- s2limit, t2limit, filter, filterstr,
- attrs, attrsonly);
+ case LDAP_SIZELIMIT_EXCEEDED:
+ case LDAP_TIMELIMIT_EXCEEDED:
+ case LDAP_ADMINLIMIT_EXCEEDED:
+ goto end_of_loop;
+
+ default:
+ break;
}
}
+end_of_loop:;
+ op->ors_scope = scope0;
+ if ( gs.is_slimit ) {
+ op->ors_slimit = slimit0;
+ }
+ op->ors_tlimit = tlimit0;
+ op->o_req_dn = dn;
+ op->o_req_ndn = ndn;
+
break;
}
- op->o_sresult = NULL;
- op->o_response = NULL;
- op->o_glue = NULL;
+ op->o_callback = cb.sc_next;
+ rs->sr_err = gs.err;
+ rs->sr_matched = gs.matched;
+ rs->sr_ref = gs.refs;
+
+ send_ldap_result( op, rs );
- send_search_result (conn, op, gs.err, gs.matched, NULL, NULL,
- NULL, gs.nentries);
- done:
+done:
+ op->o_bd = b0;
if (gs.matched)
free (gs.matched);
- return rc;
+ if (gs.refs)
+ ber_bvarray_free(gs.refs);
+ return rs->sr_err;
}
-int
-glue_back_compare (
- BackendDB *b0,
- Connection *conn,
- Operation *op,
- const char *dn,
- const char *ndn,
- AttributeAssertion *ava
-)
-{
- BackendDB *be;
- int rc;
-
- be = glue_back_select (b0, ndn);
-
- if (be && be->be_compare) {
- rc = be->be_compare (be, conn, op, dn, ndn, ava);
- } else {
- rc = LDAP_UNWILLING_TO_PERFORM;
- send_ldap_result (conn, op, rc, NULL, "No compare target found",
- NULL, NULL);
- }
- return rc;
-}
-
-int
-glue_back_modify (
- BackendDB *b0,
- Connection *conn,
- Operation *op,
- const char *dn,
- const char *ndn,
- Modifications *mod
-)
-{
- BackendDB *be;
- int rc;
-
- be = glue_back_select (b0, ndn);
- if (be && be->be_modify) {
- rc = be->be_modify (be, conn, op, dn, ndn, mod);
- } else {
- rc = LDAP_UNWILLING_TO_PERFORM;
- send_ldap_result (conn, op, rc, NULL, "No modify target found",
- NULL, NULL);
- }
- return rc;
-}
-
-int
-glue_back_modrdn (
- BackendDB *b0,
- Connection *conn,
- Operation *op,
- const char *dn,
- const char *ndn,
- const char *newrdn,
- int del,
- const char *newsup
-)
-{
- BackendDB *be;
- int rc;
-
- be = glue_back_select (b0, ndn);
-
- if (be && be->be_modrdn) {
- rc = be->be_modrdn (be, conn, op, dn, ndn, newrdn, del, newsup);
- } else {
- rc = LDAP_UNWILLING_TO_PERFORM;
- send_ldap_result (conn, op, rc, NULL, "No modrdn target found",
- NULL, NULL);
- }
- return rc;
-}
-
-int
-glue_back_add (
- BackendDB *b0,
- Connection *conn,
- Operation *op,
- Entry *e
-)
-{
- BackendDB *be;
- int rc;
-
- be = glue_back_select (b0, e->e_ndn);
-
- if (be && be->be_add) {
- rc = be->be_add (be, conn, op, e);
- } else {
- rc = LDAP_UNWILLING_TO_PERFORM;
- send_ldap_result (conn, op, rc, NULL, "No add target found",
- NULL, NULL);
- }
- return rc;
-}
-
-int
-glue_back_delete (
- BackendDB *b0,
- Connection *conn,
- Operation *op,
- const char *dn,
- const char *ndn
-)
-{
- BackendDB *be;
- int rc;
-
- be = glue_back_select (b0, ndn);
-
- if (be && be->be_delete) {
- rc = be->be_delete (be, conn, op, dn, ndn);
- } else {
- rc = LDAP_UNWILLING_TO_PERFORM;
- send_ldap_result (conn, op, rc, NULL, "No delete target found",
- NULL, NULL);
- }
- return rc;
-}
-
-int
-glue_back_release_rw (
- BackendDB *b0,
- Connection *conn,
- Operation *op,
- Entry *e,
- int rw
-)
-{
- BackendDB *be;
- int rc;
-
- be = glue_back_select (b0, e->e_ndn);
-
- if (be && be->be_release) {
- rc = be->be_release (be, conn, op, e, rw);
- } else {
- entry_free (e);
- rc = 0;
- }
- return rc;
-}
-
-int
-glue_back_group (
- BackendDB *b0,
- Connection *conn,
- Operation *op,
- Entry *target,
- const char *ndn,
- const char *ondn,
- ObjectClass *oc,
- AttributeDescription * ad
-)
-{
- BackendDB *be;
- int rc;
-
- be = glue_back_select (b0, ndn);
-
- if (be && be->be_group) {
- rc = be->be_group (be, conn, op, target, ndn, ondn, oc, ad);
- } else {
- rc = LDAP_UNWILLING_TO_PERFORM;
- }
- return rc;
-}
-
-int
-glue_back_attribute (
- BackendDB *b0,
- Connection *conn,
- Operation *op,
- Entry *target,
- const char *ndn,
- AttributeDescription *ad,
- struct berval ***vals
-)
-{
- BackendDB *be;
- int rc;
-
- be = glue_back_select (b0, ndn);
-
- if (be && be->be_attribute) {
- rc = be->be_attribute (be, conn, op, target, ndn, ad, vals);
- } else {
- rc = LDAP_UNWILLING_TO_PERFORM;
- }
- return rc;
-}
-
-int
-glue_back_referrals (
- BackendDB *b0,
- Connection *conn,
- Operation *op,
- const char *dn,
- const char *ndn,
- const char **text
-)
-{
- BackendDB *be;
- int rc;
-
- be = glue_back_select (b0, ndn);
-
- if (be && be->be_chk_referrals) {
- rc = be->be_chk_referrals (be, conn, op, dn, ndn, text);
- } else {
- rc = LDAP_SUCCESS;;
- }
- return rc;
-}
-
-static int glueMode;
-static int glueBack;
-
-int
+static int
glue_tool_entry_open (
BackendDB *b0,
int mode
)
{
- int i, rc;
-
/* We don't know which backend to talk to yet, so just
* remember the mode and move on...
*/
glueMode = mode;
- glueBack = -1;
+ glueBack = NULL;
return 0;
}
-int
+static int
glue_tool_entry_close (
BackendDB *b0
)
{
- glueinfo *gi = (glueinfo *) b0->be_private;
- int i, rc = 0;
+ int rc = 0;
- i = glueBack;
- if (i >= 0) {
- if (!gi->n[i].be->be_entry_close)
+ if (glueBack) {
+ if (!glueBack->be_entry_close)
return 0;
- rc = gi->n[i].be->be_entry_close (gi->n[i].be);
- glueBack = -1;
+ rc = glueBack->be_entry_close (glueBack);
}
return rc;
}
-ID
+static ID
glue_tool_entry_first (
BackendDB *b0
)
{
- glueinfo *gi = (glueinfo *) b0->be_private;
+ glueinfo *gi = (glueinfo *) b0->bd_info;
int i;
/* If we're starting from scratch, start at the most general */
- if (glueBack == -1) {
+ if (!glueBack) {
for (i = gi->nodes-1; i >= 0; i--) {
if (gi->n[i].be->be_entry_open &&
- gi->n[i].be->be_entry_first)
+ gi->n[i].be->be_entry_first) {
+ glueBack = gi->n[i].be;
break;
+ }
}
- } else {
- i = glueBack;
+
}
- if (gi->n[i].be->be_entry_open (gi->n[i].be, glueMode) != 0)
+ if (!glueBack || glueBack->be_entry_open (glueBack, glueMode) != 0)
return NOID;
- glueBack = i;
- return gi->n[i].be->be_entry_first (gi->n[i].be);
+ return glueBack->be_entry_first (glueBack);
}
-ID
+static ID
glue_tool_entry_next (
BackendDB *b0
)
{
- glueinfo *gi = (glueinfo *) b0->be_private;
- int i, rc;
+ glueinfo *gi = (glueinfo *) b0->bd_info;
+ int i;
+ ID rc;
+
+ if (!glueBack || !glueBack->be_entry_next)
+ return NOID;
- i = glueBack;
- rc = gi->n[i].be->be_entry_next (gi->n[i].be);
+ rc = glueBack->be_entry_next (glueBack);
/* If we ran out of entries in one database, move on to the next */
if (rc == NOID) {
- gi->n[i].be->be_entry_close (gi->n[i].be);
- i--;
- glueBack = i;
- if (i < 0)
+ glueBack->be_entry_close (glueBack);
+ for (i=0; i<gi->nodes; i++) {
+ if (gi->n[i].be == glueBack)
+ break;
+ }
+ if (i == 0) {
+ glueBack = NULL;
rc = NOID;
- else
+ } else {
+ glueBack = gi->n[i-1].be;
rc = glue_tool_entry_first (b0);
+ }
}
return rc;
}
-Entry *
+static Entry *
glue_tool_entry_get (
BackendDB *b0,
ID id
)
{
- glueinfo *gi = (glueinfo *) b0->be_private;
- int i = glueBack;
+ if (!glueBack || !glueBack->be_entry_get)
+ return NULL;
- return gi->n[i].be->be_entry_get (gi->n[i].be, id);
+ return glueBack->be_entry_get (glueBack, id);
}
-ID
+static ID
glue_tool_entry_put (
BackendDB *b0,
- Entry *e
+ Entry *e,
+ struct berval *text
)
{
- glueinfo *gi = (glueinfo *) b0->be_private;
BackendDB *be;
- int i, rc;
+ int rc;
be = glue_back_select (b0, e->e_ndn);
if (!be->be_entry_put)
return NOID;
- i = glueBack;
- if (i < 0) {
+ if (!glueBack) {
rc = be->be_entry_open (be, glueMode);
if (rc != 0)
return NOID;
- glueBack = i;
- } else if (be != gi->n[i].be) {
+ } else if (be != glueBack) {
/* If this entry belongs in a different branch than the
* previous one, close the current database and open the
* new one.
*/
- gi->n[i].be->be_entry_close (gi->n[i].be);
- glueBack = -1;
- for (i = 0; b0->be_nsuffix[i]; i++)
- if (gi->n[i].be == be)
- break;
+ glueBack->be_entry_close (glueBack);
rc = be->be_entry_open (be, glueMode);
if (rc != 0)
return NOID;
- glueBack = i;
}
- return be->be_entry_put (be, e);
+ glueBack = be;
+ return be->be_entry_put (be, e, text);
}
-int
+static int
glue_tool_entry_reindex (
BackendDB *b0,
ID id
)
{
- glueinfo *gi = (glueinfo *) b0->be_private;
- int i = glueBack;
-
- if (!gi->n[i].be->be_entry_reindex)
+ if (!glueBack || !glueBack->be_entry_reindex)
return -1;
- return gi->n[i].be->be_entry_reindex (gi->n[i].be, id);
+ return glueBack->be_entry_reindex (glueBack, id);
}
-int
+static int
glue_tool_sync (
BackendDB *b0
)
{
- glueinfo *gi = (glueinfo *) b0->be_private;
+ glueinfo *gi = (glueinfo *) b0->bd_info;
int i;
/* just sync everyone */
- for (i = 0; b0->be_nsuffix[i]; i++)
+ for (i = 0; i<gi->nodes; i++)
if (gi->n[i].be->be_sync)
gi->n[i].be->be_sync (gi->n[i].be);
return 0;
}
int
-glue_back_initialize (
- BackendInfo *bi
-)
+glue_sub_init( )
{
- bi->bi_open = 0;
- bi->bi_config = 0;
- bi->bi_close = 0;
- bi->bi_destroy = 0;
-
- bi->bi_db_init = 0;
- bi->bi_db_config = 0;
- bi->bi_db_open = glue_back_db_open;
- bi->bi_db_close = glue_back_db_close;
- bi->bi_db_destroy = glue_back_db_destroy;
-
- bi->bi_op_bind = glue_back_bind;
- bi->bi_op_unbind = 0;
- bi->bi_op_search = glue_back_search;
- bi->bi_op_compare = glue_back_compare;
- bi->bi_op_modify = glue_back_modify;
- bi->bi_op_modrdn = glue_back_modrdn;
- bi->bi_op_add = glue_back_add;
- bi->bi_op_delete = glue_back_delete;
- bi->bi_op_abandon = 0;
-
- bi->bi_extended = 0;
-
- bi->bi_entry_release_rw = glue_back_release_rw;
- bi->bi_acl_group = glue_back_group;
- bi->bi_acl_attribute = glue_back_attribute;
- bi->bi_chk_referrals = glue_back_referrals;
-
- /*
- * hooks for slap tools
- */
- bi->bi_tool_entry_open = glue_tool_entry_open;
- bi->bi_tool_entry_close = glue_tool_entry_close;
- bi->bi_tool_entry_first = glue_tool_entry_first;
- bi->bi_tool_entry_next = glue_tool_entry_next;
- bi->bi_tool_entry_get = glue_tool_entry_get;
- bi->bi_tool_entry_put = glue_tool_entry_put;
- bi->bi_tool_entry_reindex = glue_tool_entry_reindex;
- bi->bi_tool_sync = glue_tool_sync;
-
- bi->bi_connection_init = 0;
- bi->bi_connection_destroy = 0;
+ int i, j;
+ int cont = num_subordinates;
+ BackendDB *b1, *be;
+ BackendInfo *bi = NULL;
+ glueinfo *gi;
- return 0;
+ /* While there are subordinate backends, search backwards through the
+ * backends and connect them to their superior.
+ */
+ for (i = nBackendDB - 1, b1=&backendDB[i]; cont && i>=0; b1--,i--) {
+ if (SLAP_GLUE_SUBORDINATE ( b1 ) ) {
+ /* The last database cannot be a subordinate of noone */
+ if (i == nBackendDB - 1) {
+ b1->be_flags ^= SLAP_BFLAG_GLUE_SUBORDINATE;
+ }
+ continue;
+ }
+ gi = NULL;
+ for (j = i-1, be=&backendDB[j]; j>=0; be--,j--) {
+ if ( ! SLAP_GLUE_SUBORDINATE( be ) ) {
+ continue;
+ }
+ /* We will only link it once */
+ if ( SLAP_GLUE_LINKED( be ) ) {
+ continue;
+ }
+ if (!dnIsSuffix(&be->be_nsuffix[0], &b1->be_nsuffix[0])) {
+ continue;
+ }
+ cont--;
+ be->be_flags |= SLAP_BFLAG_GLUE_LINKED;
+ if (gi == NULL) {
+ /* We create a copy of the superior's be
+ * structure, pointing to all of its original
+ * information. Then we replace elements of
+ * the superior's info with our own. The copy
+ * is used whenever we have operations to pass
+ * down to the real database.
+ */
+ b1->be_flags |= SLAP_BFLAG_GLUE_INSTANCE;
+ gi = (glueinfo *)ch_malloc(sizeof(glueinfo));
+ gi->nodes = 0;
+ gi->bd = *b1;
+ gi->bi = *b1->bd_info;
+ bi = (BackendInfo *)gi;
+ bi->bi_open = glue_back_open;
+ bi->bi_close = glue_back_close;
+ bi->bi_db_open = glue_back_db_open;
+ bi->bi_db_close = glue_back_db_close;
+ bi->bi_db_destroy = glue_back_db_destroy;
+
+ bi->bi_op_search = glue_back_search;
+
+ /*
+ * hooks for slap tools
+ */
+ bi->bi_tool_entry_open = glue_tool_entry_open;
+ bi->bi_tool_entry_close = glue_tool_entry_close;
+ bi->bi_tool_entry_first = glue_tool_entry_first;
+ bi->bi_tool_entry_next = glue_tool_entry_next;
+ bi->bi_tool_entry_get = glue_tool_entry_get;
+ bi->bi_tool_entry_put = glue_tool_entry_put;
+ bi->bi_tool_entry_reindex = glue_tool_entry_reindex;
+ bi->bi_tool_sync = glue_tool_sync;
+ /* FIXME : will support later */
+ bi->bi_tool_dn2id_get = 0;
+ bi->bi_tool_id2entry_get = 0;
+ bi->bi_tool_entry_modify = 0;
+ } else {
+ gi = (glueinfo *)ch_realloc(gi,
+ sizeof(glueinfo) +
+ gi->nodes * sizeof(gluenode));
+ }
+ gi->n[gi->nodes].be = be;
+ dnParent( &be->be_nsuffix[0], &gi->n[gi->nodes].pdn );
+ gi->nodes++;
+ }
+ if (gi) {
+ /* One more node for the master */
+ gi = (glueinfo *)ch_realloc(gi,
+ sizeof(glueinfo) + gi->nodes * sizeof(gluenode));
+ gi->n[gi->nodes].be = &gi->bd;
+ dnParent( &b1->be_nsuffix[0], &gi->n[gi->nodes].pdn );
+ gi->nodes++;
+ b1->bd_info = (BackendInfo *)gi;
+ }
+ }
+ /* If there are any unresolved subordinates left, something is wrong */
+ return cont;
}
projects / openldap / blobdiff