git.sur5r.net Git - openldap/blob - servers/slapd/backglue.c

   1 /* backglue.c - backend glue */
   2 /* $OpenLDAP$ */
   3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
   4  *
   5  * Copyright 2001-2010 The OpenLDAP Foundation.
   6  * All rights reserved.
   7  *
   8  * Redistribution and use in source and binary forms, with or without
   9  * modification, are permitted only as authorized by the OpenLDAP
  10  * Public License.
  11  *
  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>.
  15  */
  16
  17 /*
  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.
  21  *
  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.
  26  *  -- Howard Chu
  27  */
  28
  29 #include "portable.h"
  30
  31 #include <stdio.h>
  32
  33 #include <ac/string.h>
  34 #include <ac/socket.h>
  35
  36 #define SLAPD_TOOLS
  37 #include "slap.h"
  38 #include "lutil.h"
  39 #include "config.h"
  40
  41 typedef struct gluenode {
  42         BackendDB *gn_be;
  43         struct berval gn_pdn;
  44 } gluenode;
  45
  46 typedef struct glueinfo {
  47         int gi_nodes;
  48         struct berval gi_pdn;
  49         gluenode gi_n[1];
  50 } glueinfo;
  51
  52 static slap_overinst    glue;
  53
  54 static int glueMode;
  55 static BackendDB *glueBack;
  56 static BackendDB glueBackDone;
  57 #define GLUEBACK_DONE (&glueBackDone)
  58
  59 static slap_overinst * glue_tool_inst( BackendInfo *bi);
  60
  61 static slap_response glue_op_response;
  62
  63 /* Just like select_backend, but only for our backends */
  64 static BackendDB *
  65 glue_back_select (
  66         BackendDB *be,
  67         struct berval *dn
  68 )
  69 {
  70         slap_overinst   *on = (slap_overinst *)be->bd_info;
  71         glueinfo                *gi = (glueinfo *)on->on_bi.bi_private;
  72         int i;
  73
  74         for (i = gi->gi_nodes-1; i >= 0; i--) {
  75                 assert( gi->gi_n[i].gn_be->be_nsuffix != NULL );
  76
  77                 if (dnIsSuffix(dn, &gi->gi_n[i].gn_be->be_nsuffix[0])) {
  78                         return gi->gi_n[i].gn_be;
  79                 }
  80         }
  81         be->bd_info = on->on_info->oi_orig;
  82         return be;
  83 }
  84
  85
  86 typedef struct glue_state {
  87         char *matched;
  88         BerVarray refs;
  89         LDAPControl **ctrls;
  90         int err;
  91         int matchlen;
  92         int nrefs;
  93         int nctrls;
  94 } glue_state;
  95
  96 static int
  97 glue_op_cleanup( Operation *op, SlapReply *rs )
  98 {
  99         /* This is not a final result */
 100         if (rs->sr_type == REP_RESULT )
 101                 rs->sr_type = REP_GLUE_RESULT;
 102         return SLAP_CB_CONTINUE;
 103 }
 104
 105 static int
 106 glue_op_response ( Operation *op, SlapReply *rs )
 107 {
 108         glue_state *gs = op->o_callback->sc_private;
 109
 110         switch(rs->sr_type) {
 111         case REP_SEARCH:
 112         case REP_SEARCHREF:
 113         case REP_INTERMEDIATE:
 114                 return SLAP_CB_CONTINUE;
 115
 116         default:
 117                 if (rs->sr_err == LDAP_SUCCESS ||
 118                         rs->sr_err == LDAP_SIZELIMIT_EXCEEDED ||
 119                         rs->sr_err == LDAP_TIMELIMIT_EXCEEDED ||
 120                         rs->sr_err == LDAP_ADMINLIMIT_EXCEEDED ||
 121                         rs->sr_err == LDAP_NO_SUCH_OBJECT ||
 122                         gs->err != LDAP_SUCCESS)
 123                         gs->err = rs->sr_err;
 124                 if (gs->err == LDAP_SUCCESS && gs->matched) {
 125                         ch_free (gs->matched);
 126                         gs->matched = NULL;
 127                         gs->matchlen = 0;
 128                 }
 129                 if (gs->err != LDAP_SUCCESS && rs->sr_matched) {
 130                         int len;
 131                         len = strlen (rs->sr_matched);
 132                         if (len > gs->matchlen) {
 133                                 if (gs->matched)
 134                                         ch_free (gs->matched);
 135                                 gs->matched = ch_strdup (rs->sr_matched);
 136                                 gs->matchlen = len;
 137                         }
 138                 }
 139                 if (rs->sr_ref) {
 140                         int i, j, k;
 141                         BerVarray new;
 142
 143                         for (i=0; rs->sr_ref[i].bv_val; i++);
 144
 145                         j = gs->nrefs;
 146                         if (!j) {
 147                                 new = ch_malloc ((i+1)*sizeof(struct berval));
 148                         } else {
 149                                 new = ch_realloc(gs->refs,
 150                                         (j+i+1)*sizeof(struct berval));
 151                         }
 152                         for (k=0; k<i; j++,k++) {
 153                                 ber_dupbv( &new[j], &rs->sr_ref[k] );
 154                         }
 155                         new[j].bv_val = NULL;
 156                         gs->nrefs = j;
 157                         gs->refs = new;
 158                 }
 159                 if (rs->sr_ctrls) {
 160                         int i, j, k;
 161                         LDAPControl **newctrls;
 162
 163                         for (i=0; rs->sr_ctrls[i]; i++);
 164
 165                         j = gs->nctrls;
 166                         if (!j) {
 167                                 newctrls = op->o_tmpalloc((i+1)*sizeof(LDAPControl *),
 168                                         op->o_tmpmemctx);
 169                         } else {
 170                                 /* Forget old pagedResults response if we're sending
 171                                  * a new one now
 172                                  */
 173                                 if ( get_pagedresults( op ) > SLAP_CONTROL_IGNORED ) {
 174                                         int newpage = 0;
 175                                         for ( k=0; k<i; k++ ) {
 176                                                 if ( !strcmp(rs->sr_ctrls[k]->ldctl_oid,
 177                                                         LDAP_CONTROL_PAGEDRESULTS )) {
 178                                                         newpage = 1;
 179                                                         break;
 180                                                 }
 181                                         }
 182                                         if ( newpage ) {
 183                                                 for ( k=0; k<j; k++ ) {
 184                                                         if ( !strcmp(gs->ctrls[k]->ldctl_oid,
 185                                                                 LDAP_CONTROL_PAGEDRESULTS ))
 186                                                         {
 187                                                                 op->o_tmpfree(gs->ctrls[k], op->o_tmpmemctx);
 188                                                                 gs->ctrls[k] = gs->ctrls[--j];
 189                                                                 gs->ctrls[j] = NULL;
 190                                                                 break;
 191                                                         }
 192                                                 }
 193                                         }
 194                                 }
 195                                 newctrls = op->o_tmprealloc(gs->ctrls,
 196                                         (j+i+1)*sizeof(LDAPControl *), op->o_tmpmemctx);
 197                         }
 198                         for (k=0; k<i; j++,k++) {
 199                                 ber_len_t oidlen = strlen( rs->sr_ctrls[k]->ldctl_oid );
 200                                 newctrls[j] = op->o_tmpalloc(sizeof(LDAPControl) + oidlen + 1 + rs->sr_ctrls[k]->ldctl_value.bv_len + 1,
 201                                         op->o_tmpmemctx);
 202                                 newctrls[j]->ldctl_iscritical = rs->sr_ctrls[k]->ldctl_iscritical;
 203                                 newctrls[j]->ldctl_oid = (char *)&newctrls[j][1];
 204                                 lutil_strcopy( newctrls[j]->ldctl_oid, rs->sr_ctrls[k]->ldctl_oid );
 205                                 if ( !BER_BVISNULL( &rs->sr_ctrls[k]->ldctl_value ) ) {
 206                                         newctrls[j]->ldctl_value.bv_val = &newctrls[j]->ldctl_oid[oidlen + 1];
 207                                         newctrls[j]->ldctl_value.bv_len = rs->sr_ctrls[k]->ldctl_value.bv_len;
 208                                         lutil_memcopy( newctrls[j]->ldctl_value.bv_val,
 209                                                 rs->sr_ctrls[k]->ldctl_value.bv_val,
 210                                                 rs->sr_ctrls[k]->ldctl_value.bv_len + 1 );
 211                                 } else {
 212                                         BER_BVZERO( &newctrls[j]->ldctl_value );
 213                                 }
 214                         }
 215                         newctrls[j] = NULL;
 216                         gs->nctrls = j;
 217                         gs->ctrls = newctrls;
 218                 }
 219         }
 220         return 0;
 221 }
 222
 223 static int
 224 glue_op_func ( Operation *op, SlapReply *rs )
 225 {
 226         slap_overinst   *on = (slap_overinst *)op->o_bd->bd_info;
 227         BackendDB *b0 = op->o_bd;
 228         BackendInfo *bi0 = op->o_bd->bd_info;
 229         BI_op_modify **func;
 230         slap_operation_t which = op_bind;
 231         int rc;
 232
 233         op->o_bd = glue_back_select (b0, &op->o_req_ndn);
 234
 235         /* If we're on the master backend, let overlay framework handle it */
 236         if ( op->o_bd == b0 )
 237                 return SLAP_CB_CONTINUE;
 238
 239         b0->bd_info = on->on_info->oi_orig;
 240
 241         switch(op->o_tag) {
 242         case LDAP_REQ_ADD: which = op_add; break;
 243         case LDAP_REQ_DELETE: which = op_delete; break;
 244         case LDAP_REQ_MODIFY: which = op_modify; break;
 245         case LDAP_REQ_MODRDN: which = op_modrdn; break;
 246         case LDAP_REQ_EXTENDED: which = op_extended; break;
 247         default: assert( 0 ); break;
 248         }
 249
 250         func = &op->o_bd->bd_info->bi_op_bind;
 251         if ( func[which] )
 252                 rc = func[which]( op, rs );
 253         else
 254                 rc = SLAP_CB_BYPASS;
 255
 256         op->o_bd = b0;
 257         op->o_bd->bd_info = bi0;
 258         return rc;
 259 }
 260
 261 static int
 262 glue_response ( Operation *op, SlapReply *rs )
 263 {
 264         BackendDB *be = op->o_bd;
 265         be = glue_back_select (op->o_bd, &op->o_req_ndn);
 266
 267         /* If we're on the master backend, let overlay framework handle it.
 268          * Otherwise, bail out.
 269          */
 270         return ( op->o_bd == be ) ? SLAP_CB_CONTINUE : SLAP_CB_BYPASS;
 271 }
 272
 273 static int
 274 glue_chk_referrals ( Operation *op, SlapReply *rs )
 275 {
 276         slap_overinst   *on = (slap_overinst *)op->o_bd->bd_info;
 277         BackendDB *b0 = op->o_bd;
 278         BackendInfo *bi0 = op->o_bd->bd_info;
 279         int rc;
 280
 281         op->o_bd = glue_back_select (b0, &op->o_req_ndn);
 282         if ( op->o_bd == b0 )
 283                 return SLAP_CB_CONTINUE;
 284
 285         b0->bd_info = on->on_info->oi_orig;
 286
 287         if ( op->o_bd->bd_info->bi_chk_referrals )
 288                 rc = ( *op->o_bd->bd_info->bi_chk_referrals )( op, rs );
 289         else
 290                 rc = SLAP_CB_CONTINUE;
 291
 292         op->o_bd = b0;
 293         op->o_bd->bd_info = bi0;
 294         return rc;
 295 }
 296
 297 static int
 298 glue_chk_controls ( Operation *op, SlapReply *rs )
 299 {
 300         slap_overinst   *on = (slap_overinst *)op->o_bd->bd_info;
 301         BackendDB *b0 = op->o_bd;
 302         BackendInfo *bi0 = op->o_bd->bd_info;
 303         int rc = SLAP_CB_CONTINUE;
 304
 305         op->o_bd = glue_back_select (b0, &op->o_req_ndn);
 306         if ( op->o_bd == b0 )
 307                 return SLAP_CB_CONTINUE;
 308
 309         b0->bd_info = on->on_info->oi_orig;
 310
 311         /* if the subordinate database has overlays, the bi_chk_controls()
 312          * hook is actually over_aux_chk_controls(); in case it actually
 313          * wraps a missing hok, we need to mimic the behavior
 314          * of the frontend applied to that database */
 315         if ( op->o_bd->bd_info->bi_chk_controls ) {
 316                 rc = ( *op->o_bd->bd_info->bi_chk_controls )( op, rs );
 317         }
 318
 319
 320         if ( rc == SLAP_CB_CONTINUE ) {
 321                 rc = backend_check_controls( op, rs );
 322         }
 323
 324         op->o_bd = b0;
 325         op->o_bd->bd_info = bi0;
 326         return rc;
 327 }
 328
 329 /* ITS#4615 - overlays configured above the glue overlay should be
 330  * invoked for the entire glued tree. Overlays configured below the
 331  * glue overlay should only be invoked on the master backend.
 332  * So, if we're searching on any subordinates, we need to force the
 333  * current overlay chain to stop processing, without stopping the
 334  * overall callback flow.
 335  */
 336 static int
 337 glue_sub_search( Operation *op, SlapReply *rs, BackendDB *b0,
 338         slap_overinst *on )
 339 {
 340         /* Process any overlays on the master backend */
 341         if ( op->o_bd == b0 && on->on_next ) {
 342                 BackendInfo *bi = op->o_bd->bd_info;
 343                 int rc = SLAP_CB_CONTINUE;
 344                 for ( on=on->on_next; on; on=on->on_next ) {
 345                         op->o_bd->bd_info = (BackendInfo *)on;
 346                         if ( on->on_bi.bi_op_search ) {
 347                                 rc = on->on_bi.bi_op_search( op, rs );
 348                                 if ( rc != SLAP_CB_CONTINUE )
 349                                         break;
 350                         }
 351                 }
 352                 op->o_bd->bd_info = bi;
 353                 if ( rc != SLAP_CB_CONTINUE )
 354                         return rc;
 355         }
 356         return op->o_bd->be_search( op, rs );
 357 }
 358
 359 static const ID glueID = NOID;
 360 static const struct berval gluecookie = { sizeof( glueID ), (char *)&glueID };
 361
 362 static int
 363 glue_op_search ( Operation *op, SlapReply *rs )
 364 {
 365         slap_overinst   *on = (slap_overinst *)op->o_bd->bd_info;
 366         glueinfo                *gi = (glueinfo *)on->on_bi.bi_private;
 367         BackendDB *b0 = op->o_bd;
 368         BackendDB *b1 = NULL, *btmp;
 369         BackendInfo *bi0 = op->o_bd->bd_info;
 370         int i;
 371         long stoptime = 0, starttime;
 372         glue_state gs = {NULL, NULL, NULL, 0, 0, 0, 0};
 373         slap_callback cb = { NULL, glue_op_response, glue_op_cleanup, NULL };
 374         int scope0, tlimit0;
 375         struct berval dn, ndn, *pdn;
 376
 377         cb.sc_private = &gs;
 378
 379         cb.sc_next = op->o_callback;
 380
 381         starttime = op->o_time;
 382         stoptime = slap_get_time () + op->ors_tlimit;
 383
 384         /* reset dummy cookie used to keep paged results going across databases */
 385         if ( get_pagedresults( op ) > SLAP_CONTROL_IGNORED
 386                 && bvmatch( &((PagedResultsState *)op->o_pagedresults_state)->ps_cookieval, &gluecookie ) )
 387         {
 388                 PagedResultsState *ps = op->o_pagedresults_state;
 389                 BerElementBuffer berbuf;
 390                 BerElement *ber = (BerElement *)&berbuf;
 391                 struct berval cookie = BER_BVC(""), value;
 392                 int c;
 393
 394                 for (c = 0; op->o_ctrls[c] != NULL; c++) {
 395                         if (strcmp(op->o_ctrls[c]->ldctl_oid, LDAP_CONTROL_PAGEDRESULTS) == 0)
 396                                 break;
 397                 }
 398
 399                 assert( op->o_ctrls[c] != NULL );
 400
 401                 ber_init2( ber, NULL, LBER_USE_DER );
 402                 ber_printf( ber, "{iO}", ps->ps_size, &cookie );
 403                 ber_flatten2( ber, &value, 0 );
 404                 assert( op->o_ctrls[c]->ldctl_value.bv_len >= value.bv_len );
 405                 op->o_ctrls[c]->ldctl_value.bv_len = value.bv_len;
 406                 lutil_memcopy( op->o_ctrls[c]->ldctl_value.bv_val,
 407                         value.bv_val, value.bv_len );
 408                 ber_free_buf( ber );
 409
 410                 ps->ps_cookie = (PagedResultsCookie)0;
 411                 BER_BVZERO( &ps->ps_cookieval );
 412         }
 413
 414         op->o_bd = glue_back_select (b0, &op->o_req_ndn);
 415         b0->bd_info = on->on_info->oi_orig;
 416
 417         switch (op->ors_scope) {
 418         case LDAP_SCOPE_BASE:
 419                 if ( op->o_bd == b0 )
 420                         return SLAP_CB_CONTINUE;
 421
 422                 rs->sr_err = LDAP_UNWILLING_TO_PERFORM;
 423                 if (op->o_bd && op->o_bd->be_search) {
 424                         rs->sr_err = op->o_bd->be_search( op, rs );
 425                 }
 426                 return rs->sr_err;
 427
 428         case LDAP_SCOPE_ONELEVEL:
 429         case LDAP_SCOPE_SUBTREE:
 430         case LDAP_SCOPE_SUBORDINATE: /* FIXME */
 431                 op->o_callback = &cb;
 432                 rs->sr_err = gs.err = LDAP_UNWILLING_TO_PERFORM;
 433                 scope0 = op->ors_scope;
 434                 tlimit0 = op->ors_tlimit;
 435                 dn = op->o_req_dn;
 436                 ndn = op->o_req_ndn;
 437                 b1 = op->o_bd;
 438
 439                 /*
 440                  * Execute in reverse order, most specific first
 441                  */
 442                 for (i = gi->gi_nodes; i >= 0; i--) {
 443                         if ( i == gi->gi_nodes ) {
 444                                 btmp = b0;
 445                                 pdn = &gi->gi_pdn;
 446                         } else {
 447                                 btmp = gi->gi_n[i].gn_be;
 448                                 pdn = &gi->gi_n[i].gn_pdn;
 449                         }
 450                         if (!btmp || !btmp->be_search)
 451                                 continue;
 452                         if (!dnIsSuffix(&btmp->be_nsuffix[0], &b1->be_nsuffix[0]))
 453                                 continue;
 454                         if (get_no_subordinate_glue(op) && btmp != b1)
 455                                 continue;
 456                         /* If we remembered which backend we were on before,
 457                          * skip down to it now
 458                          */
 459                         if ( get_pagedresults( op ) > SLAP_CONTROL_IGNORED &&
 460                                 op->o_conn->c_pagedresults_state.ps_be &&
 461                                 op->o_conn->c_pagedresults_state.ps_be != btmp )
 462                                 continue;
 463
 464                         if (tlimit0 != SLAP_NO_LIMIT) {
 465                                 op->o_time = slap_get_time();
 466                                 op->ors_tlimit = stoptime - op->o_time;
 467                                 if (op->ors_tlimit <= 0) {
 468                                         rs->sr_err = gs.err = LDAP_TIMELIMIT_EXCEEDED;
 469                                         break;
 470                                 }
 471                         }
 472                         rs->sr_err = 0;
 473                         /*
 474                          * check for abandon
 475                          */
 476                         if (op->o_abandon) {
 477                                 goto end_of_loop;
 478                         }
 479                         op->o_bd = btmp;
 480
 481                         assert( op->o_bd->be_suffix != NULL );
 482                         assert( op->o_bd->be_nsuffix != NULL );
 483
 484                         if (scope0 == LDAP_SCOPE_ONELEVEL &&
 485                                 dn_match(pdn, &ndn))
 486                         {
 487                                 struct berval mdn, mndn;
 488                                 op->ors_scope = LDAP_SCOPE_BASE;
 489                                 mdn = op->o_req_dn = op->o_bd->be_suffix[0];
 490                                 mndn = op->o_req_ndn = op->o_bd->be_nsuffix[0];
 491                                 rs->sr_err = op->o_bd->be_search(op, rs);
 492                                 if ( rs->sr_err == LDAP_NO_SUCH_OBJECT ) {
 493                                         gs.err = LDAP_SUCCESS;
 494                                 }
 495                                 op->ors_scope = LDAP_SCOPE_ONELEVEL;
 496                                 if ( op->o_req_dn.bv_val == mdn.bv_val )
 497                                         op->o_req_dn = dn;
 498                                 if ( op->o_req_ndn.bv_val == mndn.bv_val )
 499                                         op->o_req_ndn = ndn;
 500
 501                         } else if (scope0 == LDAP_SCOPE_SUBTREE &&
 502                                 dn_match(&op->o_bd->be_nsuffix[0], &ndn))
 503                         {
 504                                 rs->sr_err = glue_sub_search( op, rs, b0, on );
 505
 506                         } else if (scope0 == LDAP_SCOPE_SUBTREE &&
 507                                 dnIsSuffix(&op->o_bd->be_nsuffix[0], &ndn))
 508                         {
 509                                 struct berval mdn, mndn;
 510                                 mdn = op->o_req_dn = op->o_bd->be_suffix[0];
 511                                 mndn = op->o_req_ndn = op->o_bd->be_nsuffix[0];
 512                                 rs->sr_err = glue_sub_search( op, rs, b0, on );
 513                                 if ( rs->sr_err == LDAP_NO_SUCH_OBJECT ) {
 514                                         gs.err = LDAP_SUCCESS;
 515                                 }
 516                                 if ( op->o_req_dn.bv_val == mdn.bv_val )
 517                                         op->o_req_dn = dn;
 518                                 if ( op->o_req_ndn.bv_val == mndn.bv_val )
 519                                         op->o_req_ndn = ndn;
 520
 521                         } else if (dnIsSuffix(&ndn, &op->o_bd->be_nsuffix[0])) {
 522                                 rs->sr_err = glue_sub_search( op, rs, b0, on );
 523                         }
 524
 525                         switch ( gs.err ) {
 526
 527                         /*
 528                          * Add errors that should result in dropping
 529                          * the search
 530                          */
 531                         case LDAP_SIZELIMIT_EXCEEDED:
 532                         case LDAP_TIMELIMIT_EXCEEDED:
 533                         case LDAP_ADMINLIMIT_EXCEEDED:
 534                         case LDAP_NO_SUCH_OBJECT:
 535 #ifdef LDAP_CONTROL_X_CHAINING_BEHAVIOR
 536                         case LDAP_X_CANNOT_CHAIN:
 537 #endif /* LDAP_CONTROL_X_CHAINING_BEHAVIOR */
 538                                 goto end_of_loop;
 539
 540                         case LDAP_SUCCESS:
 541                                 if ( get_pagedresults( op ) > SLAP_CONTROL_IGNORED ) {
 542                                         PagedResultsState *ps = op->o_pagedresults_state;
 543
 544                                         /* Assume this backend can be forgotten now */
 545                                         op->o_conn->c_pagedresults_state.ps_be = NULL;
 546
 547                                         /* If we have a full page, exit the loop. We may
 548                                          * need to remember this backend so we can continue
 549                                          * from here on a subsequent request.
 550                                          */
 551                                         if ( rs->sr_nentries >= ps->ps_size ) {
 552                                                 PagedResultsState *cps = &op->o_conn->c_pagedresults_state;
 553
 554                                                 /* Don't bother to remember the first backend.
 555                                                  * Only remember the last one if there's more state left.
 556                                                  */
 557                                                 if ( op->o_bd != b0 &&
 558                                                         ( cps->ps_cookie != NOID
 559                                                                 || !BER_BVISNULL( &cps->ps_cookieval )
 560                                                                 || op->o_bd != gi->gi_n[0].gn_be ) )
 561                                                 {
 562                                                         op->o_conn->c_pagedresults_state.ps_be = op->o_bd;
 563                                                 }
 564
 565                                                 /* Check whether the cookie is empty,
 566                                                  * and give remaining databases a chance
 567                                                  */
 568                                                 if ( op->o_bd != gi->gi_n[0].gn_be || cps->ps_cookie == NOID ) {
 569                                                         int             c;
 570
 571                                                         for ( c = 0; gs.ctrls[c] != NULL; c++ ) {
 572                                                                 if ( strcmp( gs.ctrls[c]->ldctl_oid, LDAP_CONTROL_PAGEDRESULTS ) == 0 ) {
 573                                                                         break;
 574                                                                 }
 575                                                         }
 576
 577                                                         if ( gs.ctrls[c] != NULL ) {
 578                                                                 BerElementBuffer berbuf;
 579                                                                 BerElement      *ber = (BerElement *)&berbuf;
 580                                                                 ber_tag_t       tag;
 581                                                                 ber_int_t       size;
 582                                                                 struct berval   cookie, value;
 583
 584                                                                 ber_init2( ber, &gs.ctrls[c]->ldctl_value, LBER_USE_DER );
 585
 586                                                                 tag = ber_scanf( ber, "{im}", &size, &cookie );
 587                                                                 assert( tag != LBER_ERROR );
 588
 589                                                                 if ( BER_BVISEMPTY( &cookie ) && op->o_bd != gi->gi_n[0].gn_be ) {
 590                                                                         /* delete old, create new cookie with NOID */
 591                                                                         PagedResultsCookie respcookie = (PagedResultsCookie)NOID;
 592                                                                         ber_len_t oidlen = strlen( gs.ctrls[c]->ldctl_oid );
 593                                                                         LDAPControl *newctrl;
 594
 595                                                                         /* it's next database's turn */
 596                                                                         if ( btmp == b0 ) {
 597                                                                                 op->o_conn->c_pagedresults_state.ps_be = gi->gi_n[gi->gi_nodes - 1].gn_be;
 598
 599                                                                         } else {
 600                                                                                 op->o_conn->c_pagedresults_state.ps_be = gi->gi_n[(i > 0 ? i - 1: 0)].gn_be;
 601                                                                         }
 602
 603                                                                         cookie.bv_val = (char *)&respcookie;
 604                                                                         cookie.bv_len = sizeof( PagedResultsCookie );
 605
 606                                                                         ber_init2( ber, NULL, LBER_USE_DER );
 607                                                                         ber_printf( ber, "{iO}", 0, &cookie );
 608                                                                         ber_flatten2( ber, &value, 0 );
 609
 610                                                                         newctrl = op->o_tmprealloc( gs.ctrls[c],
 611                                                                                 sizeof(LDAPControl) + oidlen + 1 + value.bv_len + 1,
 612                                                                                 op->o_tmpmemctx);
 613                                                                         newctrl->ldctl_iscritical = gs.ctrls[c]->ldctl_iscritical;
 614                                                                         newctrl->ldctl_oid = (char *)&newctrl[1];
 615                                                                         lutil_strcopy( newctrl->ldctl_oid, gs.ctrls[c]->ldctl_oid );
 616                                                                         newctrl->ldctl_value.bv_len = value.bv_len;
 617                                                                         lutil_memcopy( newctrl->ldctl_value.bv_val,
 618                                                                                 value.bv_val, value.bv_len );
 619
 620                                                                         gs.ctrls[c] = newctrl;
 621
 622                                                                         ber_free_buf( ber );
 623
 624                                                                 } else if ( !BER_BVISEMPTY( &cookie ) && op->o_bd != b0 ) {
 625                                                                         /* if cookie not empty, it's again this database's turn */
 626                                                                         op->o_conn->c_pagedresults_state.ps_be = op->o_bd;
 627                                                                 }
 628                                                         }
 629                                                 }
 630
 631                                                 goto end_of_loop;
 632                                         }
 633
 634                                         /* This backend has run out of entries, but more responses
 635                                          * can fit in the page. Fake a reset of the state so the
 636                                          * next backend will start up properly. Only back-[bh]db
 637                                          * and back-sql look at this state info.
 638                                          */
 639                                         ps->ps_cookie = (PagedResultsCookie)0;
 640                                         BER_BVZERO( &ps->ps_cookieval );
 641
 642                                         {
 643                                                 /* change the size of the page in the request
 644                                                  * that will be propagated, and reset the cookie */
 645                                                 BerElementBuffer berbuf;
 646                                                 BerElement *ber = (BerElement *)&berbuf;
 647                                                 int size = ps->ps_size - rs->sr_nentries;
 648                                                 struct berval cookie = BER_BVC(""), value;
 649                                                 int c;
 650
 651                                                 for (c = 0; op->o_ctrls[c] != NULL; c++) {
 652                                                         if (strcmp(op->o_ctrls[c]->ldctl_oid, LDAP_CONTROL_PAGEDRESULTS) == 0)
 653                                                                 break;
 654                                                 }
 655
 656                                                 assert( op->o_ctrls[c] != NULL );
 657
 658                                                 ber_init2( ber, NULL, LBER_USE_DER );
 659                                                 ber_printf( ber, "{iO}", size, &cookie );
 660                                                 ber_flatten2( ber, &value, 0 );
 661                                                 assert( op->o_ctrls[c]->ldctl_value.bv_len >= value.bv_len );
 662                                                 op->o_ctrls[c]->ldctl_value.bv_len = value.bv_len;
 663                                                 lutil_memcopy( op->o_ctrls[c]->ldctl_value.bv_val,
 664                                                         value.bv_val, value.bv_len );
 665                                                 ber_free_buf( ber );
 666                                         }
 667                                 }
 668
 669                         default:
 670                                 break;
 671                         }
 672                 }
 673 end_of_loop:;
 674                 op->ors_scope = scope0;
 675                 op->ors_tlimit = tlimit0;
 676                 op->o_time = starttime;
 677
 678                 break;
 679         }
 680
 681         op->o_callback = cb.sc_next;
 682         if ( op->o_abandon ) {
 683                 rs->sr_err = SLAPD_ABANDON;
 684         } else {
 685                 rs->sr_err = gs.err;
 686                 rs->sr_matched = gs.matched;
 687                 rs->sr_ref = gs.refs;
 688         }
 689         rs->sr_ctrls = gs.ctrls;
 690
 691         send_ldap_result( op, rs );
 692
 693         op->o_bd = b0;
 694         op->o_bd->bd_info = bi0;
 695         if (gs.matched)
 696                 free (gs.matched);
 697         if (gs.refs)
 698                 ber_bvarray_free(gs.refs);
 699         if (gs.ctrls) {
 700                 for (i = gs.nctrls; --i >= 0; ) {
 701                         op->o_tmpfree(gs.ctrls[i], op->o_tmpmemctx);
 702                 }
 703                 op->o_tmpfree(gs.ctrls, op->o_tmpmemctx);
 704         }
 705         return rs->sr_err;
 706 }
 707
 708 static BackendDB toolDB;
 709
 710 static int
 711 glue_tool_entry_open (
 712         BackendDB *b0,
 713         int mode
 714 )
 715 {
 716         slap_overinfo   *oi = (slap_overinfo *)b0->bd_info;
 717
 718         /* We don't know which backend to talk to yet, so just
 719          * remember the mode and move on...
 720          */
 721
 722         glueMode = mode;
 723         glueBack = NULL;
 724         toolDB = *b0;
 725         toolDB.bd_info = oi->oi_orig;
 726
 727         /* Sanity checks */
 728         {
 729                 slap_overinst *on = glue_tool_inst( b0->bd_info );
 730                 glueinfo        *gi = on->on_bi.bi_private;
 731
 732                 int i;
 733                 for (i = 0; i < gi->gi_nodes; i++) {
 734                         BackendDB *bd;
 735                         struct berval pdn;
 736
 737                         dnParent( &gi->gi_n[i].gn_be->be_nsuffix[0], &pdn );
 738                         bd = select_backend( &pdn, 0 );
 739                         if ( bd ) {
 740                                 ID id;
 741                                 BackendDB db;
 742
 743                                 if ( overlay_is_over( bd ) ) {
 744                                         slap_overinfo *oi = (slap_overinfo *)bd->bd_info;
 745                                         db = *bd;
 746                                         db.bd_info = oi->oi_orig;
 747                                         bd = &db;
 748                                 }
 749
 750                                 if ( !bd->bd_info->bi_tool_dn2id_get
 751                                         || !bd->bd_info->bi_tool_entry_open
 752                                         || !bd->bd_info->bi_tool_entry_close )
 753                                 {
 754                                         continue;
 755                                 }
 756
 757                                 bd->bd_info->bi_tool_entry_open( bd, 0 );
 758                                 id = bd->bd_info->bi_tool_dn2id_get( bd, &gi->gi_n[i].gn_be->be_nsuffix[0] );
 759                                 bd->bd_info->bi_tool_entry_close( bd );
 760                                 if ( id != NOID ) {
 761                                         Debug( LDAP_DEBUG_ANY,
 762                                                 "glue_tool_entry_open: subordinate database suffix entry DN=\"%s\" also present in superior database rooted at DN=\"%s\"\n",
 763                                                 gi->gi_n[i].gn_be->be_suffix[0].bv_val, bd->be_suffix[0].bv_val, 0 );
 764                                         return LDAP_OTHER;
 765                                 }
 766                         }
 767                 }
 768         }
 769
 770         return 0;
 771 }
 772
 773 static int
 774 glue_tool_entry_close (
 775         BackendDB *b0
 776 )
 777 {
 778         int rc = 0;
 779
 780         if (glueBack && glueBack != GLUEBACK_DONE) {
 781                 if (!glueBack->be_entry_close)
 782                         return 0;
 783                 rc = glueBack->be_entry_close (glueBack);
 784         }
 785         return rc;
 786 }
 787
 788 static slap_overinst *
 789 glue_tool_inst(
 790         BackendInfo *bi
 791 )
 792 {
 793         slap_overinfo   *oi = (slap_overinfo *)bi;
 794         slap_overinst   *on;
 795
 796         for ( on = oi->oi_list; on; on=on->on_next ) {
 797                 if ( !strcmp( on->on_bi.bi_type, glue.on_bi.bi_type ))
 798                         return on;
 799         }
 800         return NULL;
 801 }
 802
 803 /* This function will only be called in tool mode */
 804 static int
 805 glue_open (
 806         BackendInfo *bi
 807 )
 808 {
 809         slap_overinst *on = glue_tool_inst( bi );
 810         glueinfo                *gi = on->on_bi.bi_private;
 811         static int glueOpened = 0;
 812         int i, j, same, bsame = 0, rc = 0;
 813         ConfigReply cr = {0};
 814
 815         if (glueOpened) return 0;
 816
 817         glueOpened = 1;
 818
 819         /* If we were invoked in tool mode, open all the underlying backends */
 820         if (slapMode & SLAP_TOOL_MODE) {
 821                 for (i = 0; i<gi->gi_nodes; i++) {
 822                         same = 0;
 823                         /* Same bi_open as our main backend? */
 824                         if ( gi->gi_n[i].gn_be->bd_info->bi_open ==
 825                                 on->on_info->oi_orig->bi_open )
 826                                 bsame = 1;
 827
 828                         /* Loop thru the bd_info's and make sure we only
 829                          * invoke their bi_open functions once each.
 830                          */
 831                         for ( j = 0; j<i; j++ ) {
 832                                 if ( gi->gi_n[i].gn_be->bd_info->bi_open ==
 833                                         gi->gi_n[j].gn_be->bd_info->bi_open ) {
 834                                         same = 1;
 835                                         break;
 836                                 }
 837                         }
 838                         /* OK, it's unique and non-NULL, call it. */
 839                         if ( !same && gi->gi_n[i].gn_be->bd_info->bi_open )
 840                                 rc = gi->gi_n[i].gn_be->bd_info->bi_open(
 841                                         gi->gi_n[i].gn_be->bd_info );
 842                         /* Let backend.c take care of the rest of startup */
 843                         if ( !rc )
 844                                 rc = backend_startup_one( gi->gi_n[i].gn_be, &cr );
 845                         if ( rc ) break;
 846                 }
 847                 if ( !rc && !bsame && on->on_info->oi_orig->bi_open )
 848                         rc = on->on_info->oi_orig->bi_open( on->on_info->oi_orig );
 849
 850         } /* other case is impossible */
 851         return rc;
 852 }
 853
 854 /* This function will only be called in tool mode */
 855 static int
 856 glue_close (
 857         BackendInfo *bi
 858 )
 859 {
 860         static int glueClosed = 0;
 861         int rc = 0;
 862
 863         if (glueClosed) return 0;
 864
 865         glueClosed = 1;
 866
 867         if (slapMode & SLAP_TOOL_MODE) {
 868                 rc = backend_shutdown( NULL );
 869         }
 870         return rc;
 871 }
 872
 873 static int
 874 glue_entry_get_rw (
 875         Operation               *op,
 876         struct berval   *dn,
 877         ObjectClass             *oc,
 878         AttributeDescription    *ad,
 879         int     rw,
 880         Entry   **e )
 881 {
 882         int rc;
 883         BackendDB *b0 = op->o_bd;
 884         op->o_bd = glue_back_select( b0, dn );
 885
 886         if ( op->o_bd->be_fetch ) {
 887                 rc = op->o_bd->be_fetch( op, dn, oc, ad, rw, e );
 888         } else {
 889                 rc = LDAP_UNWILLING_TO_PERFORM;
 890         }
 891         op->o_bd =b0;
 892         return rc;
 893 }
 894
 895 static int
 896 glue_entry_release_rw (
 897         Operation *op,
 898         Entry *e,
 899         int rw
 900 )
 901 {
 902         BackendDB *b0 = op->o_bd;
 903         int rc = -1;
 904
 905         op->o_bd = glue_back_select (b0, &e->e_nname);
 906
 907         if ( op->o_bd->be_release ) {
 908                 rc = op->o_bd->be_release( op, e, rw );
 909
 910         } else {
 911                 /* FIXME: mimic be_entry_release_rw
 912                  * when no be_release() available */
 913                 /* free entry */
 914                 entry_free( e );
 915                 rc = 0;
 916         }
 917         op->o_bd = b0;
 918         return rc;
 919 }
 920
 921 static struct berval *glue_base;
 922 static int glue_scope;
 923 static Filter *glue_filter;
 924
 925 static ID
 926 glue_tool_entry_first (
 927         BackendDB *b0
 928 )
 929 {
 930         slap_overinst   *on = glue_tool_inst( b0->bd_info );
 931         glueinfo                *gi = on->on_bi.bi_private;
 932         int i;
 933         ID rc;
 934
 935         /* If we're starting from scratch, start at the most general */
 936         if (!glueBack) {
 937                 if ( toolDB.be_entry_open && toolDB.be_entry_first ) {
 938                         glueBack = &toolDB;
 939                 } else {
 940                         for (i = gi->gi_nodes-1; i >= 0; i--) {
 941                                 if (gi->gi_n[i].gn_be->be_entry_open &&
 942                                         gi->gi_n[i].gn_be->be_entry_first) {
 943                                                 glueBack = gi->gi_n[i].gn_be;
 944                                         break;
 945                                 }
 946                         }
 947                 }
 948         }
 949         if (!glueBack || !glueBack->be_entry_open || !glueBack->be_entry_first ||
 950                 glueBack->be_entry_open (glueBack, glueMode) != 0)
 951                 return NOID;
 952
 953         rc = glueBack->be_entry_first (glueBack);
 954         while ( rc == NOID ) {
 955                 if ( glueBack && glueBack->be_entry_close )
 956                         glueBack->be_entry_close (glueBack);
 957                 for (i=0; i<gi->gi_nodes; i++) {
 958                         if (gi->gi_n[i].gn_be == glueBack)
 959                                 break;
 960                 }
 961                 if (i == 0) {
 962                         glueBack = GLUEBACK_DONE;
 963                         break;
 964                 } else {
 965                         glueBack = gi->gi_n[i-1].gn_be;
 966                         rc = glue_tool_entry_first (b0);
 967                         if ( glueBack == GLUEBACK_DONE ) {
 968                                 break;
 969                         }
 970                 }
 971         }
 972         return rc;
 973 }
 974
 975 static ID
 976 glue_tool_entry_first_x (
 977         BackendDB *b0,
 978         struct berval *base,
 979         int scope,
 980         Filter *f
 981 )
 982 {
 983         slap_overinst   *on = glue_tool_inst( b0->bd_info );
 984         glueinfo                *gi = on->on_bi.bi_private;
 985         int i;
 986         ID rc;
 987
 988         glue_base = base;
 989         glue_scope = scope;
 990         glue_filter = f;
 991
 992         /* If we're starting from scratch, start at the most general */
 993         if (!glueBack) {
 994                 if ( toolDB.be_entry_open && toolDB.be_entry_first_x ) {
 995                         glueBack = &toolDB;
 996                 } else {
 997                         for (i = gi->gi_nodes-1; i >= 0; i--) {
 998                                 if (gi->gi_n[i].gn_be->be_entry_open &&
 999                                         gi->gi_n[i].gn_be->be_entry_first_x)
1000                                 {
1001                                         glueBack = gi->gi_n[i].gn_be;
1002                                         break;
1003                                 }
1004                         }
1005                 }
1006         }
1007         if (!glueBack || !glueBack->be_entry_open || !glueBack->be_entry_first_x ||
1008                 glueBack->be_entry_open (glueBack, glueMode) != 0)
1009                 return NOID;
1010
1011         rc = glueBack->be_entry_first_x (glueBack,
1012                 glue_base, glue_scope, glue_filter);
1013         while ( rc == NOID ) {
1014                 if ( glueBack && glueBack->be_entry_close )
1015                         glueBack->be_entry_close (glueBack);
1016                 for (i=0; i<gi->gi_nodes; i++) {
1017                         if (gi->gi_n[i].gn_be == glueBack)
1018                                 break;
1019                 }
1020                 if (i == 0) {
1021                         glueBack = GLUEBACK_DONE;
1022                         break;
1023                 } else {
1024                         glueBack = gi->gi_n[i-1].gn_be;
1025                         rc = glue_tool_entry_first_x (b0,
1026                                 glue_base, glue_scope, glue_filter);
1027                         if ( glueBack == GLUEBACK_DONE ) {
1028                                 break;
1029                         }
1030                 }
1031         }
1032         return rc;
1033 }
1034
1035 static ID
1036 glue_tool_entry_next (
1037         BackendDB *b0
1038 )
1039 {
1040         slap_overinst   *on = glue_tool_inst( b0->bd_info );
1041         glueinfo                *gi = on->on_bi.bi_private;
1042         int i;
1043         ID rc;
1044
1045         if (!glueBack || !glueBack->be_entry_next)
1046                 return NOID;
1047
1048         rc = glueBack->be_entry_next (glueBack);
1049
1050         /* If we ran out of entries in one database, move on to the next */
1051         while (rc == NOID) {
1052                 if ( glueBack && glueBack->be_entry_close )
1053                         glueBack->be_entry_close (glueBack);
1054                 for (i=0; i<gi->gi_nodes; i++) {
1055                         if (gi->gi_n[i].gn_be == glueBack)
1056                                 break;
1057                 }
1058                 if (i == 0) {
1059                         glueBack = GLUEBACK_DONE;
1060                         break;
1061                 } else {
1062                         glueBack = gi->gi_n[i-1].gn_be;
1063                         if ( glue_base || glue_filter ) {
1064                                 /* using entry_first_x() */
1065                                 rc = glue_tool_entry_first_x (b0,
1066                                         glue_base, glue_scope, glue_filter);
1067
1068                         } else {
1069                                 /* using entry_first() */
1070                                 rc = glue_tool_entry_first (b0);
1071                         }
1072                         if ( glueBack == GLUEBACK_DONE ) {
1073                                 break;
1074                         }
1075                 }
1076         }
1077         return rc;
1078 }
1079
1080 static ID
1081 glue_tool_dn2id_get (
1082         BackendDB *b0,
1083         struct berval *dn
1084 )
1085 {
1086         BackendDB *be, b2;
1087         int rc = -1;
1088
1089         b2 = *b0;
1090         b2.bd_info = (BackendInfo *)glue_tool_inst( b0->bd_info );
1091         be = glue_back_select (&b2, dn);
1092         if ( be == &b2 ) be = &toolDB;
1093
1094         if (!be->be_dn2id_get)
1095                 return NOID;
1096
1097         if (!glueBack) {
1098                 if ( be->be_entry_open ) {
1099                         rc = be->be_entry_open (be, glueMode);
1100                 }
1101                 if (rc != 0) {
1102                         return NOID;
1103                 }
1104         } else if (be != glueBack) {
1105                 /* If this entry belongs in a different branch than the
1106                  * previous one, close the current database and open the
1107                  * new one.
1108                  */
1109                 if ( glueBack->be_entry_close ) {
1110                         glueBack->be_entry_close (glueBack);
1111                 }
1112                 if ( be->be_entry_open ) {
1113                         rc = be->be_entry_open (be, glueMode);
1114                 }
1115                 if (rc != 0) {
1116                         return NOID;
1117                 }
1118         }
1119         glueBack = be;
1120         return be->be_dn2id_get (be, dn);
1121 }
1122
1123 static Entry *
1124 glue_tool_entry_get (
1125         BackendDB *b0,
1126         ID id
1127 )
1128 {
1129         if (!glueBack || !glueBack->be_entry_get)
1130                 return NULL;
1131
1132         return glueBack->be_entry_get (glueBack, id);
1133 }
1134
1135 static ID
1136 glue_tool_entry_put (
1137         BackendDB *b0,
1138         Entry *e,
1139         struct berval *text
1140 )
1141 {
1142         BackendDB *be, b2;
1143         int rc = -1;
1144
1145         b2 = *b0;
1146         b2.bd_info = (BackendInfo *)glue_tool_inst( b0->bd_info );
1147         be = glue_back_select (&b2, &e->e_nname);
1148         if ( be == &b2 ) be = &toolDB;
1149
1150         if (!be->be_entry_put)
1151                 return NOID;
1152
1153         if (!glueBack) {
1154                 if ( be->be_entry_open ) {
1155                         rc = be->be_entry_open (be, glueMode);
1156                 }
1157                 if (rc != 0) {
1158                         return NOID;
1159                 }
1160         } else if (be != glueBack) {
1161                 /* If this entry belongs in a different branch than the
1162                  * previous one, close the current database and open the
1163                  * new one.
1164                  */
1165                 if ( glueBack->be_entry_close ) {
1166                         glueBack->be_entry_close (glueBack);
1167                 }
1168                 if ( be->be_entry_open ) {
1169                         rc = be->be_entry_open (be, glueMode);
1170                 }
1171                 if (rc != 0) {
1172                         return NOID;
1173                 }
1174         }
1175         glueBack = be;
1176         return be->be_entry_put (be, e, text);
1177 }
1178
1179 static ID
1180 glue_tool_entry_modify (
1181         BackendDB *b0,
1182         Entry *e,
1183         struct berval *text
1184 )
1185 {
1186         if (!glueBack || !glueBack->be_entry_modify)
1187                 return NOID;
1188
1189         return glueBack->be_entry_modify (glueBack, e, text);
1190 }
1191
1192 static int
1193 glue_tool_entry_reindex (
1194         BackendDB *b0,
1195         ID id,
1196         AttributeDescription **adv
1197 )
1198 {
1199         if (!glueBack || !glueBack->be_entry_reindex)
1200                 return -1;
1201
1202         return glueBack->be_entry_reindex (glueBack, id, adv);
1203 }
1204
1205 static int
1206 glue_tool_sync (
1207         BackendDB *b0
1208 )
1209 {
1210         slap_overinst   *on = glue_tool_inst( b0->bd_info );
1211         glueinfo                *gi = on->on_bi.bi_private;
1212         BackendInfo             *bi = b0->bd_info;
1213         int i;
1214
1215         /* just sync everyone */
1216         for (i = 0; i<gi->gi_nodes; i++)
1217                 if (gi->gi_n[i].gn_be->be_sync)
1218                         gi->gi_n[i].gn_be->be_sync (gi->gi_n[i].gn_be);
1219         b0->bd_info = on->on_info->oi_orig;
1220         if ( b0->be_sync )
1221                 b0->be_sync( b0 );
1222         b0->bd_info = bi;
1223         return 0;
1224 }
1225
1226 typedef struct glue_Addrec {
1227         struct glue_Addrec *ga_next;
1228         BackendDB *ga_be;
1229 } glue_Addrec;
1230
1231 /* List of added subordinates */
1232 static glue_Addrec *ga_list;
1233 static int ga_adding;
1234
1235 static int
1236 glue_db_init(
1237         BackendDB *be,
1238         ConfigReply *cr
1239 )
1240 {
1241         slap_overinst   *on = (slap_overinst *)be->bd_info;
1242         slap_overinfo   *oi = on->on_info;
1243         BackendInfo     *bi = oi->oi_orig;
1244         glueinfo *gi;
1245
1246         if ( SLAP_GLUE_SUBORDINATE( be )) {
1247                 Debug( LDAP_DEBUG_ANY, "glue: backend %s is already subordinate, "
1248                         "cannot have glue overlay!\n",
1249                         be->be_suffix[0].bv_val, 0, 0 );
1250                 return LDAP_OTHER;
1251         }
1252
1253         gi = ch_calloc( 1, sizeof(glueinfo));
1254         on->on_bi.bi_private = gi;
1255         dnParent( be->be_nsuffix, &gi->gi_pdn );
1256
1257         /* Currently the overlay framework doesn't handle these entry points
1258          * but we need them....
1259          */
1260         oi->oi_bi.bi_open = glue_open;
1261         oi->oi_bi.bi_close = glue_close;
1262
1263         /* Only advertise these if the root DB supports them */
1264         if ( bi->bi_tool_entry_open )
1265                 oi->oi_bi.bi_tool_entry_open = glue_tool_entry_open;
1266         if ( bi->bi_tool_entry_close )
1267                 oi->oi_bi.bi_tool_entry_close = glue_tool_entry_close;
1268         if ( bi->bi_tool_entry_first )
1269                 oi->oi_bi.bi_tool_entry_first = glue_tool_entry_first;
1270         /* FIXME: check whether all support bi_tool_entry_first_x() ? */
1271         if ( bi->bi_tool_entry_first_x )
1272                 oi->oi_bi.bi_tool_entry_first_x = glue_tool_entry_first_x;
1273         if ( bi->bi_tool_entry_next )
1274                 oi->oi_bi.bi_tool_entry_next = glue_tool_entry_next;
1275         if ( bi->bi_tool_entry_get )
1276                 oi->oi_bi.bi_tool_entry_get = glue_tool_entry_get;
1277         if ( bi->bi_tool_dn2id_get )
1278                 oi->oi_bi.bi_tool_dn2id_get = glue_tool_dn2id_get;
1279         if ( bi->bi_tool_entry_put )
1280                 oi->oi_bi.bi_tool_entry_put = glue_tool_entry_put;
1281         if ( bi->bi_tool_entry_reindex )
1282                 oi->oi_bi.bi_tool_entry_reindex = glue_tool_entry_reindex;
1283         if ( bi->bi_tool_entry_modify )
1284                 oi->oi_bi.bi_tool_entry_modify = glue_tool_entry_modify;
1285         if ( bi->bi_tool_sync )
1286                 oi->oi_bi.bi_tool_sync = glue_tool_sync;
1287
1288         SLAP_DBFLAGS( be ) |= SLAP_DBFLAG_GLUE_INSTANCE;
1289
1290         if ( ga_list ) {
1291                 be->bd_info = (BackendInfo *)oi;
1292                 glue_sub_attach( 1 );
1293         }
1294
1295         return 0;
1296 }
1297
1298 static int
1299 glue_db_destroy (
1300         BackendDB *be,
1301         ConfigReply *cr
1302 )
1303 {
1304         slap_overinst   *on = (slap_overinst *)be->bd_info;
1305         glueinfo                *gi = (glueinfo *)on->on_bi.bi_private;
1306
1307         free (gi);
1308         return SLAP_CB_CONTINUE;
1309 }
1310
1311 static int
1312 glue_db_close(
1313         BackendDB *be,
1314         ConfigReply *cr
1315 )
1316 {
1317         slap_overinst   *on = (slap_overinst *)be->bd_info;
1318
1319         on->on_info->oi_bi.bi_db_close = 0;
1320         return 0;
1321 }
1322
1323 int
1324 glue_sub_del( BackendDB *b0 )
1325 {
1326         BackendDB *be;
1327         int rc = 0;
1328
1329         /* Find the top backend for this subordinate */
1330         be = b0;
1331         while ( (be=LDAP_STAILQ_NEXT( be, be_next )) != NULL ) {
1332                 slap_overinfo *oi;
1333                 slap_overinst *on;
1334                 glueinfo *gi;
1335                 int i;
1336
1337                 if ( SLAP_GLUE_SUBORDINATE( be ))
1338                         continue;
1339                 if ( !SLAP_GLUE_INSTANCE( be ))
1340                         continue;
1341                 if ( !dnIsSuffix( &b0->be_nsuffix[0], &be->be_nsuffix[0] ))
1342                         continue;
1343
1344                 /* OK, got the right backend, find the overlay */
1345                 oi = (slap_overinfo *)be->bd_info;
1346                 for ( on=oi->oi_list; on; on=on->on_next ) {
1347                         if ( on->on_bi.bi_type == glue.on_bi.bi_type )
1348                                 break;
1349                 }
1350                 assert( on != NULL );
1351                 gi = on->on_bi.bi_private;
1352                 for ( i=0; i < gi->gi_nodes; i++ ) {
1353                         if ( gi->gi_n[i].gn_be == b0 ) {
1354                                 int j;
1355
1356                                 for (j=i+1; j < gi->gi_nodes; j++)
1357                                         gi->gi_n[j-1] = gi->gi_n[j];
1358
1359                                 gi->gi_nodes--;
1360                         }
1361                 }
1362         }
1363         if ( be == NULL )
1364                 rc = LDAP_NO_SUCH_OBJECT;
1365
1366         return rc;
1367 }
1368
1369
1370 /* Attach all the subordinate backends to their superior */
1371 int
1372 glue_sub_attach( int online )
1373 {
1374         glue_Addrec *ga, *gnext = NULL;
1375         int rc = 0;
1376
1377         if ( ga_adding )
1378                 return 0;
1379
1380         ga_adding = 1;
1381
1382         /* For all the subordinate backends */
1383         for ( ga=ga_list; ga != NULL; ga = gnext ) {
1384                 BackendDB *be;
1385
1386                 gnext = ga->ga_next;
1387
1388                 /* Find the top backend for this subordinate */
1389                 be = ga->ga_be;
1390                 while ( (be=LDAP_STAILQ_NEXT( be, be_next )) != NULL ) {
1391                         slap_overinfo *oi;
1392                         slap_overinst *on;
1393                         glueinfo *gi;
1394
1395                         if ( SLAP_GLUE_SUBORDINATE( be ))
1396                                 continue;
1397                         if ( !dnIsSuffix( &ga->ga_be->be_nsuffix[0], &be->be_nsuffix[0] ))
1398                                 continue;
1399
1400                         /* If it's not already configured, set up the overlay */
1401                         if ( !SLAP_GLUE_INSTANCE( be )) {
1402                                 rc = overlay_config( be, glue.on_bi.bi_type, -1, NULL, NULL);
1403                                 if ( rc )
1404                                         break;
1405                         }
1406                         /* Find the overlay instance */
1407                         oi = (slap_overinfo *)be->bd_info;
1408                         for ( on=oi->oi_list; on; on=on->on_next ) {
1409                                 if ( on->on_bi.bi_type == glue.on_bi.bi_type )
1410                                         break;
1411                         }
1412                         assert( on != NULL );
1413                         gi = on->on_bi.bi_private;
1414                         gi = (glueinfo *)ch_realloc( gi, sizeof(glueinfo) +
1415                                 gi->gi_nodes * sizeof(gluenode));
1416                         gi->gi_n[gi->gi_nodes].gn_be = ga->ga_be;
1417                         dnParent( &ga->ga_be->be_nsuffix[0],
1418                                 &gi->gi_n[gi->gi_nodes].gn_pdn );
1419                         gi->gi_nodes++;
1420                         on->on_bi.bi_private = gi;
1421                         ga->ga_be->be_flags |= SLAP_DBFLAG_GLUE_LINKED;
1422                         break;
1423                 }
1424                 if ( !be ) {
1425                         Debug( LDAP_DEBUG_ANY, "glue: no superior found for sub %s!\n",
1426                                 ga->ga_be->be_suffix[0].bv_val, 0, 0 );
1427                         /* allow this for now, assume a superior will
1428                          * be added later
1429                          */
1430                         if ( online ) {
1431                                 rc = 0;
1432                                 gnext = ga_list;
1433                                 break;
1434                         }
1435                         rc = LDAP_NO_SUCH_OBJECT;
1436                 }
1437                 ch_free( ga );
1438                 if ( rc ) break;
1439         }
1440
1441         ga_list = gnext;
1442
1443         ga_adding = 0;
1444
1445         return rc;
1446 }
1447
1448 int
1449 glue_sub_add( BackendDB *be, int advert, int online )
1450 {
1451         glue_Addrec *ga;
1452         int rc = 0;
1453
1454         if ( overlay_is_inst( be, "glue" )) {
1455                 Debug( LDAP_DEBUG_ANY, "glue: backend %s already has glue overlay, "
1456                         "cannot be a subordinate!\n",
1457                         be->be_suffix[0].bv_val, 0, 0 );
1458                 return LDAP_OTHER;
1459         }
1460         SLAP_DBFLAGS( be ) |= SLAP_DBFLAG_GLUE_SUBORDINATE;
1461         if ( advert )
1462                 SLAP_DBFLAGS( be ) |= SLAP_DBFLAG_GLUE_ADVERTISE;
1463
1464         ga = ch_malloc( sizeof( glue_Addrec ));
1465         ga->ga_next = ga_list;
1466         ga->ga_be = be;
1467         ga_list = ga;
1468
1469         if ( online )
1470                 rc = glue_sub_attach( online );
1471
1472         return rc;
1473 }
1474
1475 static int
1476 glue_access_allowed(
1477         Operation               *op,
1478         Entry                   *e,
1479         AttributeDescription    *desc,
1480         struct berval           *val,
1481         slap_access_t           access,
1482         AccessControlState      *state,
1483         slap_mask_t             *maskp )
1484 {
1485         BackendDB *b0, *be = glue_back_select( op->o_bd, &e->e_nname );
1486         int rc;
1487
1488         if ( be == NULL || be == op->o_bd || be->bd_info->bi_access_allowed == NULL )
1489                 return SLAP_CB_CONTINUE;
1490
1491         b0 = op->o_bd;
1492         op->o_bd = be;
1493         rc = be->bd_info->bi_access_allowed ( op, e, desc, val, access, state, maskp );
1494         op->o_bd = b0;
1495         return rc;
1496 }
1497
1498 int
1499 glue_sub_init()
1500 {
1501         glue.on_bi.bi_type = "glue";
1502
1503         glue.on_bi.bi_db_init = glue_db_init;
1504         glue.on_bi.bi_db_close = glue_db_close;
1505         glue.on_bi.bi_db_destroy = glue_db_destroy;
1506
1507         glue.on_bi.bi_op_search = glue_op_search;
1508         glue.on_bi.bi_op_modify = glue_op_func;
1509         glue.on_bi.bi_op_modrdn = glue_op_func;
1510         glue.on_bi.bi_op_add = glue_op_func;
1511         glue.on_bi.bi_op_delete = glue_op_func;
1512         glue.on_bi.bi_extended = glue_op_func;
1513
1514         glue.on_bi.bi_chk_referrals = glue_chk_referrals;
1515         glue.on_bi.bi_chk_controls = glue_chk_controls;
1516         glue.on_bi.bi_entry_get_rw = glue_entry_get_rw;
1517         glue.on_bi.bi_entry_release_rw = glue_entry_release_rw;
1518         glue.on_bi.bi_access_allowed = glue_access_allowed;
1519
1520         glue.on_response = glue_response;
1521
1522         return overlay_register( &glue );
1523 }