1 /* backglue.c - backend glue routines */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
5 * Copyright 2001-2004 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 * This uses the backend structures and routines extensively, but is
23 * not an actual backend of its own. To use it you must add a "subordinate"
24 * keyword to the configuration of other backends. Subordinates will
25 * automatically be connected to their parent backend.
27 * The purpose of these functions is to allow you to split a single database
28 * into pieces (for load balancing purposes, whatever) but still be able
29 * to treat it as a single database after it's been split. As such, each
30 * of the glued backends should have identical rootdn and rootpw.
32 * If you need more elaborate configuration, you probably should be using
41 #include <ac/string.h>
42 #include <ac/socket.h>
47 typedef struct gluenode {
52 typedef struct glueinfo {
60 static BackendDB *glueBack;
62 static slap_response glue_back_response;
64 /* Just like select_backend, but only for our backends */
71 glueinfo *gi = (glueinfo *) be->bd_info;
75 bv.bv_len = strlen(dn);
76 bv.bv_val = (char *) dn;
78 for (i = 0; i<gi->gi_nodes; i++) {
79 assert( gi->gi_n[i].gn_be->be_nsuffix );
81 if (dnIsSuffix(&bv, &gi->gi_n[i].gn_be->be_nsuffix[0])) {
82 return gi->gi_n[i].gn_be;
88 /* This function will only be called in tool mode */
95 static int glueOpened = 0;
97 if (glueOpened) return 0;
101 /* If we were invoked in tool mode, open all the underlying backends */
102 if (slapMode & SLAP_TOOL_MODE) {
103 rc = backend_startup (NULL);
104 } /* other case is impossible */
108 /* This function will only be called in tool mode */
114 static int glueClosed = 0;
117 if (glueClosed) return 0;
121 if (slapMode & SLAP_TOOL_MODE) {
122 rc = backend_shutdown (NULL);
132 glueinfo *gi = (glueinfo *) be->bd_info;
133 static int glueOpened = 0;
136 if (glueOpened) return 0;
140 gi->gi_bd.be_acl = be->be_acl;
141 gi->gi_bd.be_pending_csn_list = be->be_pending_csn_list;
143 if (gi->gi_bd.bd_info->bi_db_open)
144 rc = gi->gi_bd.bd_info->bi_db_open(&gi->gi_bd);
154 glueinfo *gi = (glueinfo *) be->bd_info;
155 static int glueClosed = 0;
157 if (glueClosed) return 0;
161 /* Close the master */
162 if (gi->gi_bd.bd_info->bi_db_close)
163 gi->gi_bd.bd_info->bi_db_close( &gi->gi_bd );
169 glue_back_db_destroy (
173 glueinfo *gi = (glueinfo *) be->bd_info;
175 if (gi->gi_bd.bd_info->bi_db_destroy)
176 gi->gi_bd.bd_info->bi_db_destroy( &gi->gi_bd );
181 typedef struct glue_state {
191 glue_back_response ( Operation *op, SlapReply *rs )
193 glue_state *gs = op->o_callback->sc_private;
195 switch(rs->sr_type) {
197 if ( gs->slimit != SLAP_NO_LIMIT
198 && rs->sr_nentries >= gs->slimit )
200 rs->sr_err = gs->err = LDAP_SIZELIMIT_EXCEEDED;
205 return SLAP_CB_CONTINUE;
208 if (rs->sr_err == LDAP_SUCCESS ||
209 rs->sr_err == LDAP_SIZELIMIT_EXCEEDED ||
210 rs->sr_err == LDAP_TIMELIMIT_EXCEEDED ||
211 rs->sr_err == LDAP_ADMINLIMIT_EXCEEDED ||
212 rs->sr_err == LDAP_NO_SUCH_OBJECT ||
213 gs->err != LDAP_SUCCESS)
214 gs->err = rs->sr_err;
215 if (gs->err == LDAP_SUCCESS && gs->matched) {
216 ch_free (gs->matched);
220 if (gs->err != LDAP_SUCCESS && rs->sr_matched) {
222 len = strlen (rs->sr_matched);
223 if (len > gs->matchlen) {
225 ch_free (gs->matched);
226 gs->matched = ch_strdup (rs->sr_matched);
234 for (i=0; rs->sr_ref[i].bv_val; i++);
238 new = ch_malloc ((i+1)*sizeof(struct berval));
240 new = ch_realloc(gs->refs,
241 (j+i+1)*sizeof(struct berval));
243 for (k=0; k<i; j++,k++) {
244 ber_dupbv( &new[j], &rs->sr_ref[k] );
246 new[j].bv_val = NULL;
255 glue_back_search ( Operation *op, SlapReply *rs )
257 BackendDB *b0 = op->o_bd;
258 BackendDB *b1 = NULL;
259 glueinfo *gi = (glueinfo *) b0->bd_info;
262 glue_state gs = {0, 0, 0, NULL, 0, NULL};
263 slap_callback cb = { NULL, glue_back_response, NULL, NULL };
264 int scope0, slimit0, tlimit0;
265 struct berval dn, ndn;
269 cb.sc_next = op->o_callback;
271 stoptime = slap_get_time () + op->ors_tlimit;
273 op->o_bd = glue_back_select (b0, op->o_req_ndn.bv_val);
275 switch (op->ors_scope) {
276 case LDAP_SCOPE_BASE:
277 if (op->o_bd && op->o_bd->be_search) {
278 rs->sr_err = op->o_bd->be_search( op, rs );
280 send_ldap_error(op, rs, LDAP_UNWILLING_TO_PERFORM,
281 "No search target found");
285 case LDAP_SCOPE_ONELEVEL:
286 case LDAP_SCOPE_SUBTREE:
287 #ifdef LDAP_SCOPE_SUBORDINATE
288 case LDAP_SCOPE_SUBORDINATE: /* FIXME */
291 if ( op->o_sync_mode & SLAP_SYNC_REFRESH ) {
292 if (op->o_bd && op->o_bd->be_search) {
293 rs->sr_err = op->o_bd->be_search( op, rs );
295 send_ldap_error(op, rs, LDAP_UNWILLING_TO_PERFORM,
296 "No search target found");
301 op->o_callback = &cb;
302 rs->sr_err = gs.err = LDAP_UNWILLING_TO_PERFORM;
303 scope0 = op->ors_scope;
304 slimit0 = gs.slimit = op->ors_slimit;
305 tlimit0 = op->ors_tlimit;
311 * Execute in reverse order, most general first
313 for (i = gi->gi_nodes-1; i >= 0; i--) {
314 if (!gi->gi_n[i].gn_be || !gi->gi_n[i].gn_be->be_search)
316 if (!dnIsSuffix(&gi->gi_n[i].gn_be->be_nsuffix[0], &b1->be_nsuffix[0]))
318 if (tlimit0 != SLAP_NO_LIMIT) {
319 op->ors_tlimit = stoptime - slap_get_time ();
320 if (op->ors_tlimit <= 0) {
321 rs->sr_err = gs.err = LDAP_TIMELIMIT_EXCEEDED;
325 if (slimit0 != SLAP_NO_LIMIT) {
326 op->ors_slimit = slimit0 - rs->sr_nentries;
327 if (op->ors_slimit < 0) {
328 rs->sr_err = gs.err = LDAP_SIZELIMIT_EXCEEDED;
339 op->o_bd = gi->gi_n[i].gn_be;
341 assert( op->o_bd->be_suffix );
342 assert( op->o_bd->be_nsuffix );
344 if (scope0 == LDAP_SCOPE_ONELEVEL &&
345 dn_match(&gi->gi_n[i].gn_pdn, &ndn))
347 op->ors_scope = LDAP_SCOPE_BASE;
348 op->o_req_dn = op->o_bd->be_suffix[0];
349 op->o_req_ndn = op->o_bd->be_nsuffix[0];
350 rs->sr_err = op->o_bd->be_search(op, rs);
352 } else if (scope0 == LDAP_SCOPE_SUBTREE &&
353 dn_match(&op->o_bd->be_nsuffix[0], &ndn))
355 rs->sr_err = op->o_bd->be_search( op, rs );
357 } else if (scope0 == LDAP_SCOPE_SUBTREE &&
358 dnIsSuffix(&op->o_bd->be_nsuffix[0], &ndn))
360 op->o_req_dn = op->o_bd->be_suffix[0];
361 op->o_req_ndn = op->o_bd->be_nsuffix[0];
362 rs->sr_err = op->o_bd->be_search( op, rs );
363 if ( rs->sr_err == LDAP_NO_SUCH_OBJECT ) {
364 gs.err = LDAP_SUCCESS;
367 } else if (dnIsSuffix(&ndn, &op->o_bd->be_nsuffix[0])) {
368 rs->sr_err = op->o_bd->be_search( op, rs );
374 * Add errors that should result in dropping
377 case LDAP_SIZELIMIT_EXCEEDED:
378 case LDAP_TIMELIMIT_EXCEEDED:
379 case LDAP_ADMINLIMIT_EXCEEDED:
380 case LDAP_NO_SUCH_OBJECT:
388 op->ors_scope = scope0;
389 op->ors_slimit = slimit0;
390 op->ors_tlimit = tlimit0;
396 if ( !op->o_abandon ) {
397 op->o_callback = cb.sc_next;
399 rs->sr_matched = gs.matched;
400 rs->sr_ref = gs.refs;
402 send_ldap_result( op, rs );
409 ber_bvarray_free(gs.refs);
415 glue_tool_entry_open (
420 /* We don't know which backend to talk to yet, so just
421 * remember the mode and move on...
431 glue_tool_entry_close (
438 if (!glueBack->be_entry_close)
440 rc = glueBack->be_entry_close (glueBack);
446 glue_tool_entry_first (
450 glueinfo *gi = (glueinfo *) b0->bd_info;
453 /* If we're starting from scratch, start at the most general */
455 for (i = gi->gi_nodes-1; i >= 0; i--) {
456 if (gi->gi_n[i].gn_be->be_entry_open &&
457 gi->gi_n[i].gn_be->be_entry_first) {
458 glueBack = gi->gi_n[i].gn_be;
464 if (!glueBack || !glueBack->be_entry_open || !glueBack->be_entry_first ||
465 glueBack->be_entry_open (glueBack, glueMode) != 0)
468 return glueBack->be_entry_first (glueBack);
472 glue_tool_entry_next (
476 glueinfo *gi = (glueinfo *) b0->bd_info;
480 if (!glueBack || !glueBack->be_entry_next)
483 rc = glueBack->be_entry_next (glueBack);
485 /* If we ran out of entries in one database, move on to the next */
487 if ( glueBack && glueBack->be_entry_close )
488 glueBack->be_entry_close (glueBack);
489 for (i=0; i<gi->gi_nodes; i++) {
490 if (gi->gi_n[i].gn_be == glueBack)
497 glueBack = gi->gi_n[i-1].gn_be;
498 rc = glue_tool_entry_first (b0);
505 glue_tool_entry_get (
510 if (!glueBack || !glueBack->be_entry_get)
513 return glueBack->be_entry_get (glueBack, id);
517 glue_tool_entry_put (
526 be = glue_back_select (b0, e->e_ndn);
527 if (!be->be_entry_put)
531 rc = be->be_entry_open (be, glueMode);
534 } else if (be != glueBack) {
535 /* If this entry belongs in a different branch than the
536 * previous one, close the current database and open the
539 glueBack->be_entry_close (glueBack);
540 rc = be->be_entry_open (be, glueMode);
545 return be->be_entry_put (be, e, text);
549 glue_tool_entry_reindex (
554 if (!glueBack || !glueBack->be_entry_reindex)
557 return glueBack->be_entry_reindex (glueBack, id);
565 glueinfo *gi = (glueinfo *) b0->bd_info;
568 /* just sync everyone */
569 for (i = 0; i<gi->gi_nodes; i++)
570 if (gi->gi_n[i].gn_be->be_sync)
571 gi->gi_n[i].gn_be->be_sync (gi->gi_n[i].gn_be);
579 int cont = num_subordinates;
581 BackendInfo *bi = NULL;
584 /* While there are subordinate backends, search backwards through the
585 * backends and connect them to their superior.
587 for (i = nBackendDB - 1, b1=&backendDB[i]; cont && i>=0; b1--,i--) {
588 if (SLAP_GLUE_SUBORDINATE ( b1 ) ) {
589 /* The last database cannot be a subordinate of noone */
590 if (i == nBackendDB - 1) {
591 SLAP_DBFLAGS(b1) ^= SLAP_DBFLAG_GLUE_SUBORDINATE;
596 for (j = i-1, be=&backendDB[j]; j>=0; be--,j--) {
597 if ( ! SLAP_GLUE_SUBORDINATE( be ) ) {
600 /* We will only link it once */
601 if ( SLAP_GLUE_LINKED( be ) ) {
604 assert( be->be_nsuffix );
605 assert( b1->be_nsuffix );
606 if (!dnIsSuffix(&be->be_nsuffix[0], &b1->be_nsuffix[0])) {
610 SLAP_DBFLAGS(be) |= SLAP_DBFLAG_GLUE_LINKED;
612 /* We create a copy of the superior's be
613 * structure, pointing to all of its original
614 * information. Then we replace elements of
615 * the superior's info with our own. The copy
616 * is used whenever we have operations to pass
617 * down to the real database.
619 SLAP_DBFLAGS(b1) |= SLAP_DBFLAG_GLUE_INSTANCE;
620 gi = (glueinfo *)ch_malloc(sizeof(glueinfo));
623 gi->gi_bi = *b1->bd_info;
624 bi = (BackendInfo *)gi;
625 bi->bi_open = glue_back_open;
626 bi->bi_close = glue_back_close;
627 bi->bi_db_open = glue_back_db_open;
628 bi->bi_db_close = glue_back_db_close;
629 bi->bi_db_destroy = glue_back_db_destroy;
631 bi->bi_op_search = glue_back_search;
634 * hooks for slap tools
636 bi->bi_tool_entry_open = glue_tool_entry_open;
637 bi->bi_tool_entry_close = glue_tool_entry_close;
638 bi->bi_tool_entry_first = glue_tool_entry_first;
639 bi->bi_tool_entry_next = glue_tool_entry_next;
640 bi->bi_tool_entry_get = glue_tool_entry_get;
641 bi->bi_tool_entry_put = glue_tool_entry_put;
642 bi->bi_tool_entry_reindex = glue_tool_entry_reindex;
643 bi->bi_tool_sync = glue_tool_sync;
644 /* FIXME : will support later */
645 bi->bi_tool_dn2id_get = 0;
646 bi->bi_tool_id2entry_get = 0;
647 bi->bi_tool_entry_modify = 0;
649 gi = (glueinfo *)ch_realloc(gi,
651 gi->gi_nodes * sizeof(gluenode));
653 gi->gi_n[gi->gi_nodes].gn_be = be;
654 dnParent( &be->be_nsuffix[0], &gi->gi_n[gi->gi_nodes].gn_pdn );
658 /* One more node for the master */
659 gi = (glueinfo *)ch_realloc(gi,
660 sizeof(glueinfo) + gi->gi_nodes * sizeof(gluenode));
661 gi->gi_n[gi->gi_nodes].gn_be = &gi->gi_bd;
662 dnParent( &b1->be_nsuffix[0], &gi->gi_n[gi->gi_nodes].gn_pdn );
664 b1->bd_info = (BackendInfo *)gi;
667 /* If there are any unresolved subordinates left, something is wrong */