1 /* backglue.c - backend glue */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
5 * Copyright 2001-2005 The OpenLDAP Foundation.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted only as authorized by the OpenLDAP
12 * A copy of this license is available in the file LICENSE in the
13 * top-level directory of the distribution or, alternatively, at
14 * <http://www.OpenLDAP.org/license.html>.
18 * Functions to glue a bunch of other backends into a single tree.
19 * All of the glued backends must share a common suffix. E.g., you
20 * can glue o=foo and ou=bar,o=foo but you can't glue o=foo and o=bar.
22 * The purpose of these functions is to allow you to split a single database
23 * into pieces (for load balancing purposes, whatever) but still be able
24 * to treat it as a single database after it's been split. As such, each
25 * of the glued backends should have identical rootdn.
33 #include <ac/string.h>
34 #include <ac/socket.h>
39 typedef struct gluenode {
44 typedef struct glueinfo {
50 static slap_overinst glue;
53 static BackendDB *glueBack;
55 static slap_response glue_op_response;
57 /* Just like select_backend, but only for our backends */
64 slap_overinst *on = (slap_overinst *)be->bd_info;
65 glueinfo *gi = (glueinfo *)on->on_bi.bi_private;
68 for (i = 0; i<gi->gi_nodes; i++) {
69 assert( gi->gi_n[i].gn_be->be_nsuffix != NULL );
71 if (dnIsSuffix(dn, &gi->gi_n[i].gn_be->be_nsuffix[0])) {
72 return gi->gi_n[i].gn_be;
75 be->bd_info = on->on_info->oi_orig;
80 typedef struct glue_state {
89 glue_op_response ( Operation *op, SlapReply *rs )
91 glue_state *gs = op->o_callback->sc_private;
96 return SLAP_CB_CONTINUE;
99 if (rs->sr_err == LDAP_SUCCESS ||
100 rs->sr_err == LDAP_SIZELIMIT_EXCEEDED ||
101 rs->sr_err == LDAP_TIMELIMIT_EXCEEDED ||
102 rs->sr_err == LDAP_ADMINLIMIT_EXCEEDED ||
103 rs->sr_err == LDAP_NO_SUCH_OBJECT ||
104 gs->err != LDAP_SUCCESS)
105 gs->err = rs->sr_err;
106 if (gs->err == LDAP_SUCCESS && gs->matched) {
107 ch_free (gs->matched);
111 if (gs->err != LDAP_SUCCESS && rs->sr_matched) {
113 len = strlen (rs->sr_matched);
114 if (len > gs->matchlen) {
116 ch_free (gs->matched);
117 gs->matched = ch_strdup (rs->sr_matched);
125 for (i=0; rs->sr_ref[i].bv_val; i++);
129 new = ch_malloc ((i+1)*sizeof(struct berval));
131 new = ch_realloc(gs->refs,
132 (j+i+1)*sizeof(struct berval));
134 for (k=0; k<i; j++,k++) {
135 ber_dupbv( &new[j], &rs->sr_ref[k] );
137 new[j].bv_val = NULL;
146 glue_op_func ( Operation *op, SlapReply *rs )
148 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
149 BackendDB *b0 = op->o_bd;
150 BackendInfo *bi0 = op->o_bd->bd_info;
152 slap_operation_t which = op_bind;
155 op->o_bd = glue_back_select (b0, &op->o_req_ndn);
156 b0->bd_info = on->on_info->oi_orig;
159 case LDAP_REQ_ADD: which = op_add; break;
160 case LDAP_REQ_DELETE: which = op_delete; break;
161 case LDAP_REQ_MODIFY: which = op_modify; break;
162 case LDAP_REQ_MODRDN: which = op_modrdn; break;
163 default: assert( 0 ); break;
166 func = &op->o_bd->bd_info->bi_op_bind;
168 rc = func[which]( op, rs );
170 rc = SLAP_CB_CONTINUE;
173 op->o_bd->bd_info = bi0;
178 glue_chk_referrals ( Operation *op, SlapReply *rs )
180 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
181 BackendDB *b0 = op->o_bd;
182 BackendInfo *bi0 = op->o_bd->bd_info;
185 op->o_bd = glue_back_select (b0, &op->o_req_ndn);
186 b0->bd_info = on->on_info->oi_orig;
188 if ( op->o_bd->bd_info->bi_chk_referrals )
189 rc = ( *op->o_bd->bd_info->bi_chk_referrals )( op, rs );
191 rc = SLAP_CB_CONTINUE;
194 op->o_bd->bd_info = bi0;
199 glue_chk_controls ( Operation *op, SlapReply *rs )
201 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
202 BackendDB *b0 = op->o_bd;
203 BackendInfo *bi0 = op->o_bd->bd_info;
204 int rc = SLAP_CB_CONTINUE;
206 op->o_bd = glue_back_select (b0, &op->o_req_ndn);
207 b0->bd_info = on->on_info->oi_orig;
209 /* if the subordinate database has overlays, the bi_chk_controls()
210 * hook is actually over_aux_chk_controls(); in case it actually
211 * wraps a missing hok, we need to mimic the behavior
212 * of the frontend applied to that database */
213 if ( op->o_bd->bd_info->bi_chk_controls ) {
214 rc = ( *op->o_bd->bd_info->bi_chk_controls )( op, rs );
218 if ( rc == SLAP_CB_CONTINUE ) {
219 rc = backend_check_controls( op, rs );
223 op->o_bd->bd_info = bi0;
228 glue_op_search ( Operation *op, SlapReply *rs )
230 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
231 glueinfo *gi = (glueinfo *)on->on_bi.bi_private;
232 BackendDB *b0 = op->o_bd;
233 BackendDB *b1 = NULL, *btmp;
234 BackendInfo *bi0 = op->o_bd->bd_info;
237 glue_state gs = {0, 0, NULL, 0, NULL};
238 slap_callback cb = { NULL, glue_op_response, NULL, NULL };
240 struct berval dn, ndn, *pdn;
244 cb.sc_next = op->o_callback;
246 stoptime = slap_get_time () + op->ors_tlimit;
248 op->o_bd = glue_back_select (b0, &op->o_req_ndn);
249 b0->bd_info = on->on_info->oi_orig;
251 switch (op->ors_scope) {
252 case LDAP_SCOPE_BASE:
253 rs->sr_err = LDAP_UNWILLING_TO_PERFORM;
254 if (op->o_bd && op->o_bd->be_search) {
255 rs->sr_err = op->o_bd->be_search( op, rs );
259 case LDAP_SCOPE_ONELEVEL:
260 case LDAP_SCOPE_SUBTREE:
261 case LDAP_SCOPE_SUBORDINATE: /* FIXME */
265 if (op->o_bd && op->o_bd->be_search) {
266 rs->sr_err = op->o_bd->be_search( op, rs );
268 send_ldap_error(op, rs, LDAP_UNWILLING_TO_PERFORM,
269 "No search target found");
275 op->o_callback = &cb;
276 rs->sr_err = gs.err = LDAP_UNWILLING_TO_PERFORM;
277 scope0 = op->ors_scope;
278 tlimit0 = op->ors_tlimit;
284 * Execute in reverse order, most general first
286 for (i = gi->gi_nodes; i >= 0; i--) {
287 if ( i == gi->gi_nodes ) {
291 btmp = gi->gi_n[i].gn_be;
292 pdn = &gi->gi_n[i].gn_pdn;
294 if (!btmp || !btmp->be_search)
296 if (!dnIsSuffix(&btmp->be_nsuffix[0], &b1->be_nsuffix[0]))
298 if (tlimit0 != SLAP_NO_LIMIT) {
299 op->ors_tlimit = stoptime - slap_get_time ();
300 if (op->ors_tlimit <= 0) {
301 rs->sr_err = gs.err = LDAP_TIMELIMIT_EXCEEDED;
314 assert( op->o_bd->be_suffix != NULL );
315 assert( op->o_bd->be_nsuffix != NULL );
317 if (scope0 == LDAP_SCOPE_ONELEVEL &&
320 op->ors_scope = LDAP_SCOPE_BASE;
321 op->o_req_dn = op->o_bd->be_suffix[0];
322 op->o_req_ndn = op->o_bd->be_nsuffix[0];
323 rs->sr_err = op->o_bd->be_search(op, rs);
325 } else if (scope0 == LDAP_SCOPE_SUBTREE &&
326 dn_match(&op->o_bd->be_nsuffix[0], &ndn))
328 rs->sr_err = op->o_bd->be_search( op, rs );
330 } else if (scope0 == LDAP_SCOPE_SUBTREE &&
331 dnIsSuffix(&op->o_bd->be_nsuffix[0], &ndn))
333 op->o_req_dn = op->o_bd->be_suffix[0];
334 op->o_req_ndn = op->o_bd->be_nsuffix[0];
335 rs->sr_err = op->o_bd->be_search( op, rs );
336 if ( rs->sr_err == LDAP_NO_SUCH_OBJECT ) {
337 gs.err = LDAP_SUCCESS;
340 } else if (dnIsSuffix(&ndn, &op->o_bd->be_nsuffix[0])) {
341 rs->sr_err = op->o_bd->be_search( op, rs );
347 * Add errors that should result in dropping
350 case LDAP_SIZELIMIT_EXCEEDED:
351 case LDAP_TIMELIMIT_EXCEEDED:
352 case LDAP_ADMINLIMIT_EXCEEDED:
353 case LDAP_NO_SUCH_OBJECT:
354 #ifdef LDAP_CONTROL_X_CHAINING_BEHAVIOR
355 case LDAP_X_CANNOT_CHAIN:
356 #endif /* LDAP_CONTROL_X_CHAINING_BEHAVIOR */
364 op->ors_scope = scope0;
365 op->ors_tlimit = tlimit0;
371 if ( op->o_abandon ) {
372 rs->sr_err = SLAPD_ABANDON;
374 op->o_callback = cb.sc_next;
376 rs->sr_matched = gs.matched;
377 rs->sr_ref = gs.refs;
379 send_ldap_result( op, rs );
383 op->o_bd->bd_info = bi0;
387 ber_bvarray_free(gs.refs);
391 static BackendDB toolDB;
394 glue_tool_entry_open (
399 slap_overinfo *oi = (slap_overinfo *)b0->bd_info;
401 /* We don't know which backend to talk to yet, so just
402 * remember the mode and move on...
408 toolDB.bd_info = oi->oi_orig;
414 glue_tool_entry_close (
421 if (!glueBack->be_entry_close)
423 rc = glueBack->be_entry_close (glueBack);
428 static slap_overinst *
433 slap_overinfo *oi = (slap_overinfo *)bi;
436 for ( on = oi->oi_list; on; on=on->on_next ) {
437 if ( !strcmp( on->on_bi.bi_type, glue.on_bi.bi_type ))
443 /* This function will only be called in tool mode */
449 slap_overinst *on = glue_tool_inst( bi );
450 glueinfo *gi = on->on_bi.bi_private;
451 static int glueOpened = 0;
452 int i, j, same, bsame = 0, rc = 0;
454 if (glueOpened) return 0;
458 /* If we were invoked in tool mode, open all the underlying backends */
459 if (slapMode & SLAP_TOOL_MODE) {
460 for (i = 0; i<gi->gi_nodes; i++) {
462 /* Same bi_open as our main backend? */
463 if ( gi->gi_n[i].gn_be->bd_info->bi_open ==
464 on->on_info->oi_orig->bi_open )
467 /* Loop thru the bd_info's and make sure we only
468 * invoke their bi_open functions once each.
470 for ( j = 0; j<i; j++ ) {
471 if ( gi->gi_n[i].gn_be->bd_info->bi_open ==
472 gi->gi_n[j].gn_be->bd_info->bi_open ) {
477 /* OK, it's unique and non-NULL, call it. */
478 if ( !same && gi->gi_n[i].gn_be->bd_info->bi_open )
479 rc = gi->gi_n[i].gn_be->bd_info->bi_open(
480 gi->gi_n[i].gn_be->bd_info );
481 /* Let backend.c take care of the rest of startup */
483 rc = backend_startup_one( gi->gi_n[i].gn_be );
486 if ( !rc && !bsame && on->on_info->oi_orig->bi_open )
487 rc = on->on_info->oi_orig->bi_open( on->on_info->oi_orig );
489 } /* other case is impossible */
493 /* This function will only be called in tool mode */
499 static int glueClosed = 0;
502 if (glueClosed) return 0;
506 if (slapMode & SLAP_TOOL_MODE) {
507 rc = backend_shutdown( NULL );
513 glue_entry_release_rw (
524 b2.bd_info = (BackendInfo *)glue_tool_inst( op->o_bd->bd_info );
525 op->o_bd = glue_back_select (&b2, &e->e_nname);
527 if ( op->o_bd->be_release ) {
528 rc = op->o_bd->be_release( op, e, rw );
531 /* FIXME: mimic be_entry_release_rw
532 * when no be_release() available */
542 glue_tool_entry_first (
546 slap_overinst *on = glue_tool_inst( b0->bd_info );
547 glueinfo *gi = on->on_bi.bi_private;
550 /* If we're starting from scratch, start at the most general */
552 if ( toolDB.be_entry_open && toolDB.be_entry_first ) {
555 for (i = gi->gi_nodes-1; i >= 0; i--) {
556 if (gi->gi_n[i].gn_be->be_entry_open &&
557 gi->gi_n[i].gn_be->be_entry_first) {
558 glueBack = gi->gi_n[i].gn_be;
564 if (!glueBack || !glueBack->be_entry_open || !glueBack->be_entry_first ||
565 glueBack->be_entry_open (glueBack, glueMode) != 0)
568 return glueBack->be_entry_first (glueBack);
572 glue_tool_entry_next (
576 slap_overinst *on = glue_tool_inst( b0->bd_info );
577 glueinfo *gi = on->on_bi.bi_private;
581 if (!glueBack || !glueBack->be_entry_next)
584 rc = glueBack->be_entry_next (glueBack);
586 /* If we ran out of entries in one database, move on to the next */
588 if ( glueBack && glueBack->be_entry_close )
589 glueBack->be_entry_close (glueBack);
590 for (i=0; i<gi->gi_nodes; i++) {
591 if (gi->gi_n[i].gn_be == glueBack)
598 glueBack = gi->gi_n[i-1].gn_be;
599 rc = glue_tool_entry_first (b0);
606 glue_tool_entry_get (
611 if (!glueBack || !glueBack->be_entry_get)
614 return glueBack->be_entry_get (glueBack, id);
618 glue_tool_entry_put (
628 b2.bd_info = (BackendInfo *)glue_tool_inst( b0->bd_info );
629 be = glue_back_select (&b2, &e->e_nname);
630 if ( be == &b2 ) be = &toolDB;
632 if (!be->be_entry_put)
636 if ( be->be_entry_open ) {
637 rc = be->be_entry_open (be, glueMode);
642 } else if (be != glueBack) {
643 /* If this entry belongs in a different branch than the
644 * previous one, close the current database and open the
647 if ( glueBack->be_entry_close ) {
648 glueBack->be_entry_close (glueBack);
650 if ( be->be_entry_open ) {
651 rc = be->be_entry_open (be, glueMode);
658 return be->be_entry_put (be, e, text);
662 glue_tool_entry_reindex (
667 if (!glueBack || !glueBack->be_entry_reindex)
670 return glueBack->be_entry_reindex (glueBack, id);
678 slap_overinst *on = glue_tool_inst( b0->bd_info );
679 glueinfo *gi = on->on_bi.bi_private;
680 BackendInfo *bi = b0->bd_info;
683 /* just sync everyone */
684 for (i = 0; i<gi->gi_nodes; i++)
685 if (gi->gi_n[i].gn_be->be_sync)
686 gi->gi_n[i].gn_be->be_sync (gi->gi_n[i].gn_be);
687 b0->bd_info = on->on_info->oi_orig;
699 slap_overinst *on = (slap_overinst *)be->bd_info;
700 slap_overinfo *oi = on->on_info;
701 BackendInfo *bi = oi->oi_orig;
704 gi = ch_calloc( 1, sizeof(glueinfo));
705 on->on_bi.bi_private = gi;
706 dnParent( be->be_nsuffix, &gi->gi_pdn );
708 /* Currently the overlay framework doesn't handle these entry points
709 * but we need them....
711 oi->oi_bi.bi_open = glue_open;
712 oi->oi_bi.bi_close = glue_close;
714 oi->oi_bi.bi_entry_release_rw = glue_entry_release_rw;
716 /* Only advertise these if the root DB supports them */
717 if ( bi->bi_tool_entry_open )
718 oi->oi_bi.bi_tool_entry_open = glue_tool_entry_open;
719 if ( bi->bi_tool_entry_close )
720 oi->oi_bi.bi_tool_entry_close = glue_tool_entry_close;
721 if ( bi->bi_tool_entry_first )
722 oi->oi_bi.bi_tool_entry_first = glue_tool_entry_first;
723 if ( bi->bi_tool_entry_next )
724 oi->oi_bi.bi_tool_entry_next = glue_tool_entry_next;
725 if ( bi->bi_tool_entry_get )
726 oi->oi_bi.bi_tool_entry_get = glue_tool_entry_get;
727 if ( bi->bi_tool_entry_put )
728 oi->oi_bi.bi_tool_entry_put = glue_tool_entry_put;
729 if ( bi->bi_tool_entry_reindex )
730 oi->oi_bi.bi_tool_entry_reindex = glue_tool_entry_reindex;
731 if ( bi->bi_tool_sync )
732 oi->oi_bi.bi_tool_sync = glue_tool_sync;
734 /*FIXME : need to add support */
735 oi->oi_bi.bi_tool_dn2id_get = 0;
736 oi->oi_bi.bi_tool_id2entry_get = 0;
737 oi->oi_bi.bi_tool_entry_modify = 0;
739 SLAP_DBFLAGS( be ) |= SLAP_DBFLAG_GLUE_INSTANCE;
749 slap_overinst *on = (slap_overinst *)be->bd_info;
750 glueinfo *gi = (glueinfo *)on->on_bi.bi_private;
753 return SLAP_CB_CONTINUE;
761 slap_overinst *on = (slap_overinst *)be->bd_info;
763 on->on_info->oi_bi.bi_db_close = NULL;
768 glue_sub_del( BackendDB *b0 )
773 /* Find the top backend for this subordinate */
775 while ( (be=LDAP_STAILQ_NEXT( be, be_next )) != NULL ) {
781 if ( SLAP_GLUE_SUBORDINATE( be ))
783 if ( !SLAP_GLUE_INSTANCE( be ))
785 if ( !dnIsSuffix( &b0->be_nsuffix[0], &be->be_nsuffix[0] ))
788 /* OK, got the right backend, find the overlay */
789 oi = (slap_overinfo *)be->bd_info;
790 for ( on=oi->oi_list; on; on=on->on_next ) {
791 if ( on->on_bi.bi_type == glue.on_bi.bi_type )
794 assert( on != NULL );
795 gi = on->on_bi.bi_private;
796 for ( i=0; i < gi->gi_nodes; i++ ) {
797 if ( gi->gi_n[i].gn_be == b0 ) {
800 for (j=i+1; j < gi->gi_nodes; j++)
801 gi->gi_n[j-1] = gi->gi_n[j];
808 rc = LDAP_NO_SUCH_OBJECT;
813 typedef struct glue_Addrec {
814 struct glue_Addrec *ga_next;
818 /* List of added subordinates */
819 static glue_Addrec *ga_list;
821 /* Attach all the subordinate backends to their superior */
825 glue_Addrec *ga, *gnext = NULL;
828 /* For all the subordinate backends */
829 for ( ga=ga_list; ga != NULL; ga = gnext ) {
834 /* Find the top backend for this subordinate */
836 while ( (be=LDAP_STAILQ_NEXT( be, be_next )) != NULL ) {
841 if ( SLAP_GLUE_SUBORDINATE( be ))
843 if ( !dnIsSuffix( &ga->ga_be->be_nsuffix[0], &be->be_nsuffix[0] ))
846 /* If it's not already configured, set up the overlay */
847 if ( !SLAP_GLUE_INSTANCE( be )) {
848 rc = overlay_config( be, glue.on_bi.bi_type );
852 /* Find the overlay instance */
853 oi = (slap_overinfo *)be->bd_info;
854 for ( on=oi->oi_list; on; on=on->on_next ) {
855 if ( on->on_bi.bi_type == glue.on_bi.bi_type )
858 assert( on != NULL );
859 gi = on->on_bi.bi_private;
860 gi = (glueinfo *)ch_realloc( gi, sizeof(glueinfo) +
861 gi->gi_nodes * sizeof(gluenode));
862 gi->gi_n[gi->gi_nodes].gn_be = ga->ga_be;
863 dnParent( &ga->ga_be->be_nsuffix[0],
864 &gi->gi_n[gi->gi_nodes].gn_pdn );
866 on->on_bi.bi_private = gi;
870 Debug( LDAP_DEBUG_ANY, "glue: no superior found for sub %s!\n",
871 ga->ga_be->be_suffix[0].bv_val, 0, 0 );
872 rc = LDAP_NO_SUCH_OBJECT;
884 glue_sub_add( BackendDB *be, int advert, int online )
889 SLAP_DBFLAGS( be ) |= SLAP_DBFLAG_GLUE_SUBORDINATE;
891 SLAP_DBFLAGS( be ) |= SLAP_DBFLAG_GLUE_ADVERTISE;
893 ga = ch_malloc( sizeof( glue_Addrec ));
894 ga->ga_next = ga_list;
899 rc = glue_sub_attach();
907 glue.on_bi.bi_type = "glue";
909 glue.on_bi.bi_db_init = glue_db_init;
910 glue.on_bi.bi_db_close = glue_db_close;
911 glue.on_bi.bi_db_destroy = glue_db_destroy;
913 glue.on_bi.bi_op_search = glue_op_search;
914 glue.on_bi.bi_op_modify = glue_op_func;
915 glue.on_bi.bi_op_modrdn = glue_op_func;
916 glue.on_bi.bi_op_add = glue_op_func;
917 glue.on_bi.bi_op_delete = glue_op_func;
919 glue.on_bi.bi_chk_referrals = glue_chk_referrals;
920 glue.on_bi.bi_chk_controls = glue_chk_controls;
922 return overlay_register( &glue );