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-2009 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                                                 /* Don't bother to remember the first backend.
 553                                                  * Only remember the last one if there's more state left.
 554                                                  */
 555                                                 if ( op->o_bd != b0 &&
 556                                                         ( !BER_BVISNULL( &op->o_conn->c_pagedresults_state.ps_cookieval ) ||
 557                                                         op->o_bd != gi->gi_n[0].gn_be ))
 558                                                 {
 559                                                         op->o_conn->c_pagedresults_state.ps_be = op->o_bd;
 560                                                 }
 561
 562                                                 /* Check whether the cookie is empty,
 563                                                  * and give remaining databases a chance
 564                                                  */
 565                                                 if ( op->o_bd != gi->gi_n[0].gn_be ||
 566                                                         BER_BVISNULL( &op->o_conn->c_pagedresults_state.ps_cookieval ) )
 567                                                 {
 568                                                         int             c;
 569
 570                                                         for ( c = 0; gs.ctrls[c] != NULL; c++ ) {
 571                                                                 if ( strcmp( gs.ctrls[c]->ldctl_oid, LDAP_CONTROL_PAGEDRESULTS ) == 0 ) {
 572                                                                         break;
 573                                                                 }
 574                                                         }
 575
 576                                                         if ( gs.ctrls[c] != NULL ) {
 577                                                                 BerElementBuffer berbuf;
 578                                                                 BerElement      *ber = (BerElement *)&berbuf;
 579                                                                 ber_tag_t       tag;
 580                                                                 ber_int_t       size;
 581                                                                 struct berval   cookie, value;
 582
 583                                                                 ber_init2( ber, &gs.ctrls[c]->ldctl_value, LBER_USE_DER );
 584
 585                                                                 tag = ber_scanf( ber, "{im}", &size, &cookie );
 586                                                                 assert( tag != LBER_ERROR );
 587
 588                                                                 if ( BER_BVISEMPTY( &cookie ) ) {
 589                                                                         /* delete old, create new cookie with NOID */
 590                                                                         PagedResultsCookie respcookie = (PagedResultsCookie)NOID;
 591                                                                         ber_len_t oidlen = strlen( gs.ctrls[c]->ldctl_oid );
 592                                                                         LDAPControl *newctrl;
 593
 594                                                                         if ( btmp == b0 ) {
 595                                                                                 op->o_conn->c_pagedresults_state.ps_be = gi->gi_n[gi->gi_nodes - 1].gn_be;
 596
 597                                                                         } else {
 598                                                                                 op->o_conn->c_pagedresults_state.ps_be = gi->gi_n[(i > 0 ? i - 1: 0)].gn_be;
 599                                                                         }
 600
 601                                                                         cookie.bv_val = (char *)&respcookie;
 602                                                                         cookie.bv_len = sizeof( PagedResultsCookie );
 603
 604                                                                         ber_init2( ber, NULL, LBER_USE_DER );
 605                                                                         ber_printf( ber, "{iO}", 0, &cookie );
 606                                                                         ber_flatten2( ber, &value, 0 );
 607
 608                                                                         newctrl = op->o_tmprealloc( gs.ctrls[c],
 609                                                                                 sizeof(LDAPControl) + oidlen + 1 + value.bv_len + 1,
 610                                                                                 op->o_tmpmemctx);
 611                                                                         newctrl->ldctl_iscritical = gs.ctrls[c]->ldctl_iscritical;
 612                                                                         newctrl->ldctl_oid = (char *)&newctrl[1];
 613                                                                         lutil_strcopy( newctrl->ldctl_oid, gs.ctrls[c]->ldctl_oid );
 614                                                                         newctrl->ldctl_value.bv_len = value.bv_len;
 615                                                                         lutil_memcopy( newctrl->ldctl_value.bv_val,
 616                                                                                 value.bv_val, value.bv_len );
 617
 618                                                                         gs.ctrls[c] = newctrl;
 619
 620                                                                         ber_free_buf( ber );
 621
 622                                                                 } else {
 623                                                                         op->o_conn->c_pagedresults_state.ps_be = op->o_bd;
 624                                                                 }
 625                                                         }
 626                                                 }
 627
 628                                                 goto end_of_loop;
 629                                         }
 630
 631                                         /* This backend has run out of entries, but more responses
 632                                          * can fit in the page. Fake a reset of the state so the
 633                                          * next backend will start up properly. Only back-[bh]db
 634                                          * and back-sql look at this state info.
 635                                          */
 636                                         if ( ps->ps_cookieval.bv_len == sizeof( PagedResultsCookie )) {
 637                                                 ps->ps_cookie = (PagedResultsCookie)0;
 638 #if 0
 639                                                 memset( ps->ps_cookieval.bv_val, 0,
 640                                                         sizeof( PagedResultsCookie ));
 641 #endif
 642                                                 BER_BVZERO( &ps->ps_cookieval );
 643                                         }
 644
 645                                         {
 646                                                 /* change the size of the page in the request
 647                                                  * that will be propagated, and reset the cookie */
 648                                                 BerElementBuffer berbuf;
 649                                                 BerElement *ber = (BerElement *)&berbuf;
 650                                                 int size = ps->ps_size - rs->sr_nentries;
 651                                                 struct berval cookie = BER_BVC(""), value;
 652                                                 int c;
 653
 654                                                 for (c = 0; op->o_ctrls[c] != NULL; c++) {
 655                                                         if (strcmp(op->o_ctrls[c]->ldctl_oid, LDAP_CONTROL_PAGEDRESULTS) == 0)
 656                                                                 break;
 657                                                 }
 658
 659                                                 assert( op->o_ctrls[c] != NULL );
 660
 661                                                 ber_init2( ber, NULL, LBER_USE_DER );
 662                                                 ber_printf( ber, "{iO}", size, &cookie );
 663                                                 ber_flatten2( ber, &value, 0 );
 664                                                 assert( op->o_ctrls[c]->ldctl_value.bv_len >= value.bv_len );
 665                                                 op->o_ctrls[c]->ldctl_value.bv_len = value.bv_len;
 666                                                 lutil_memcopy( op->o_ctrls[c]->ldctl_value.bv_val,
 667                                                         value.bv_val, value.bv_len );
 668                                                 ber_free_buf( ber );
 669                                         }
 670                                 }
 671
 672                         default:
 673                                 break;
 674                         }
 675                 }
 676 end_of_loop:;
 677                 op->ors_scope = scope0;
 678                 op->ors_tlimit = tlimit0;
 679                 op->o_time = starttime;
 680
 681                 break;
 682         }
 683
 684         op->o_callback = cb.sc_next;
 685         if ( op->o_abandon ) {
 686                 rs->sr_err = SLAPD_ABANDON;
 687         } else {
 688                 rs->sr_err = gs.err;
 689                 rs->sr_matched = gs.matched;
 690                 rs->sr_ref = gs.refs;
 691         }
 692         rs->sr_ctrls = gs.ctrls;
 693
 694         send_ldap_result( op, rs );
 695
 696         op->o_bd = b0;
 697         op->o_bd->bd_info = bi0;
 698         if (gs.matched)
 699                 free (gs.matched);
 700         if (gs.refs)
 701                 ber_bvarray_free(gs.refs);
 702         if (gs.ctrls) {
 703                 for (i = gs.nctrls; --i >= 0; ) {
 704                         op->o_tmpfree(gs.ctrls[i], op->o_tmpmemctx);
 705                 }
 706                 op->o_tmpfree(gs.ctrls, op->o_tmpmemctx);
 707         }
 708         return rs->sr_err;
 709 }
 710
 711 static BackendDB toolDB;
 712
 713 static int
 714 glue_tool_entry_open (
 715         BackendDB *b0,
 716         int mode
 717 )
 718 {
 719         slap_overinfo   *oi = (slap_overinfo *)b0->bd_info;
 720
 721         /* We don't know which backend to talk to yet, so just
 722          * remember the mode and move on...
 723          */
 724
 725         glueMode = mode;
 726         glueBack = NULL;
 727         toolDB = *b0;
 728         toolDB.bd_info = oi->oi_orig;
 729
 730         /* Sanity checks */
 731         {
 732                 slap_overinst *on = glue_tool_inst( b0->bd_info );
 733                 glueinfo        *gi = on->on_bi.bi_private;
 734
 735                 int i;
 736                 for (i = 0; i < gi->gi_nodes; i++) {
 737                         BackendDB *bd;
 738                         struct berval pdn;
 739
 740                         dnParent( &gi->gi_n[i].gn_be->be_nsuffix[0], &pdn );
 741                         bd = select_backend( &pdn, 0 );
 742                         if ( bd ) {
 743                                 ID id;
 744                                 BackendDB db;
 745
 746                                 if ( overlay_is_over( bd ) ) {
 747                                         slap_overinfo *oi = (slap_overinfo *)bd->bd_info;
 748                                         db = *bd;
 749                                         db.bd_info = oi->oi_orig;
 750                                         bd = &db;
 751                                 }
 752
 753                                 if ( !bd->bd_info->bi_tool_dn2id_get
 754                                         || !bd->bd_info->bi_tool_entry_open
 755                                         || !bd->bd_info->bi_tool_entry_close )
 756                                 {
 757                                         continue;
 758                                 }
 759
 760                                 bd->bd_info->bi_tool_entry_open( bd, 0 );
 761                                 id = bd->bd_info->bi_tool_dn2id_get( bd, &gi->gi_n[i].gn_be->be_nsuffix[0] );
 762                                 bd->bd_info->bi_tool_entry_close( bd );
 763                                 if ( id != NOID ) {
 764                                         Debug( LDAP_DEBUG_ANY,
 765                                                 "glue_tool_entry_open: subordinate database suffix entry DN=\"%s\" also present in superior database rooted at DN=\"%s\"\n",
 766                                                 gi->gi_n[i].gn_be->be_suffix[0].bv_val, bd->be_suffix[0].bv_val, 0 );
 767                                         return LDAP_OTHER;
 768                                 }
 769                         }
 770                 }
 771         }
 772
 773         return 0;
 774 }
 775
 776 static int
 777 glue_tool_entry_close (
 778         BackendDB *b0
 779 )
 780 {
 781         int rc = 0;
 782
 783         if (glueBack && glueBack != GLUEBACK_DONE) {
 784                 if (!glueBack->be_entry_close)
 785                         return 0;
 786                 rc = glueBack->be_entry_close (glueBack);
 787         }
 788         return rc;
 789 }
 790
 791 static slap_overinst *
 792 glue_tool_inst(
 793         BackendInfo *bi
 794 )
 795 {
 796         slap_overinfo   *oi = (slap_overinfo *)bi;
 797         slap_overinst   *on;
 798
 799         for ( on = oi->oi_list; on; on=on->on_next ) {
 800                 if ( !strcmp( on->on_bi.bi_type, glue.on_bi.bi_type ))
 801                         return on;
 802         }
 803         return NULL;
 804 }
 805
 806 /* This function will only be called in tool mode */
 807 static int
 808 glue_open (
 809         BackendInfo *bi
 810 )
 811 {
 812         slap_overinst *on = glue_tool_inst( bi );
 813         glueinfo                *gi = on->on_bi.bi_private;
 814         static int glueOpened = 0;
 815         int i, j, same, bsame = 0, rc = 0;
 816         ConfigReply cr = {0};
 817
 818         if (glueOpened) return 0;
 819
 820         glueOpened = 1;
 821
 822         /* If we were invoked in tool mode, open all the underlying backends */
 823         if (slapMode & SLAP_TOOL_MODE) {
 824                 for (i = 0; i<gi->gi_nodes; i++) {
 825                         same = 0;
 826                         /* Same bi_open as our main backend? */
 827                         if ( gi->gi_n[i].gn_be->bd_info->bi_open ==
 828                                 on->on_info->oi_orig->bi_open )
 829                                 bsame = 1;
 830
 831                         /* Loop thru the bd_info's and make sure we only
 832                          * invoke their bi_open functions once each.
 833                          */
 834                         for ( j = 0; j<i; j++ ) {
 835                                 if ( gi->gi_n[i].gn_be->bd_info->bi_open ==
 836                                         gi->gi_n[j].gn_be->bd_info->bi_open ) {
 837                                         same = 1;
 838                                         break;
 839                                 }
 840                         }
 841                         /* OK, it's unique and non-NULL, call it. */
 842                         if ( !same && gi->gi_n[i].gn_be->bd_info->bi_open )
 843                                 rc = gi->gi_n[i].gn_be->bd_info->bi_open(
 844                                         gi->gi_n[i].gn_be->bd_info );
 845                         /* Let backend.c take care of the rest of startup */
 846                         if ( !rc )
 847                                 rc = backend_startup_one( gi->gi_n[i].gn_be, &cr );
 848                         if ( rc ) break;
 849                 }
 850                 if ( !rc && !bsame && on->on_info->oi_orig->bi_open )
 851                         rc = on->on_info->oi_orig->bi_open( on->on_info->oi_orig );
 852
 853         } /* other case is impossible */
 854         return rc;
 855 }
 856
 857 /* This function will only be called in tool mode */
 858 static int
 859 glue_close (
 860         BackendInfo *bi
 861 )
 862 {
 863         static int glueClosed = 0;
 864         int rc = 0;
 865
 866         if (glueClosed) return 0;
 867
 868         glueClosed = 1;
 869
 870         if (slapMode & SLAP_TOOL_MODE) {
 871                 rc = backend_shutdown( NULL );
 872         }
 873         return rc;
 874 }
 875
 876 static int
 877 glue_entry_get_rw (
 878         Operation               *op,
 879         struct berval   *dn,
 880         ObjectClass             *oc,
 881         AttributeDescription    *ad,
 882         int     rw,
 883         Entry   **e )
 884 {
 885         int rc;
 886         BackendDB *b0 = op->o_bd;
 887         op->o_bd = glue_back_select( b0, dn );
 888
 889         if ( op->o_bd->be_fetch ) {
 890                 rc = op->o_bd->be_fetch( op, dn, oc, ad, rw, e );
 891         } else {
 892                 rc = LDAP_UNWILLING_TO_PERFORM;
 893         }
 894         op->o_bd =b0;
 895         return rc;
 896 }
 897
 898 static int
 899 glue_entry_release_rw (
 900         Operation *op,
 901         Entry *e,
 902         int rw
 903 )
 904 {
 905         BackendDB *b0 = op->o_bd;
 906         int rc = -1;
 907
 908         op->o_bd = glue_back_select (b0, &e->e_nname);
 909
 910         if ( op->o_bd->be_release ) {
 911                 rc = op->o_bd->be_release( op, e, rw );
 912
 913         } else {
 914                 /* FIXME: mimic be_entry_release_rw
 915                  * when no be_release() available */
 916                 /* free entry */
 917                 entry_free( e );
 918                 rc = 0;
 919         }
 920         op->o_bd = b0;
 921         return rc;
 922 }
 923
 924 static struct berval *glue_base;
 925 static int glue_scope;
 926 static Filter *glue_filter;
 927
 928 static ID
 929 glue_tool_entry_first (
 930         BackendDB *b0
 931 )
 932 {
 933         slap_overinst   *on = glue_tool_inst( b0->bd_info );
 934         glueinfo                *gi = on->on_bi.bi_private;
 935         int i;
 936         ID rc;
 937
 938         /* If we're starting from scratch, start at the most general */
 939         if (!glueBack) {
 940                 if ( toolDB.be_entry_open && toolDB.be_entry_first ) {
 941                         glueBack = &toolDB;
 942                 } else {
 943                         for (i = gi->gi_nodes-1; i >= 0; i--) {
 944                                 if (gi->gi_n[i].gn_be->be_entry_open &&
 945                                         gi->gi_n[i].gn_be->be_entry_first) {
 946                                                 glueBack = gi->gi_n[i].gn_be;
 947                                         break;
 948                                 }
 949                         }
 950                 }
 951         }
 952         if (!glueBack || !glueBack->be_entry_open || !glueBack->be_entry_first ||
 953                 glueBack->be_entry_open (glueBack, glueMode) != 0)
 954                 return NOID;
 955
 956         rc = glueBack->be_entry_first (glueBack);
 957         while ( rc == NOID ) {
 958                 if ( glueBack && glueBack->be_entry_close )
 959                         glueBack->be_entry_close (glueBack);
 960                 for (i=0; i<gi->gi_nodes; i++) {
 961                         if (gi->gi_n[i].gn_be == glueBack)
 962                                 break;
 963                 }
 964                 if (i == 0) {
 965                         glueBack = GLUEBACK_DONE;
 966                         break;
 967                 } else {
 968                         glueBack = gi->gi_n[i-1].gn_be;
 969                         rc = glue_tool_entry_first (b0);
 970                         if ( glueBack == GLUEBACK_DONE ) {
 971                                 break;
 972                         }
 973                 }
 974         }
 975         return rc;
 976 }
 977
 978 static ID
 979 glue_tool_entry_first_x (
 980         BackendDB *b0,
 981         struct berval *base,
 982         int scope,
 983         Filter *f
 984 )
 985 {
 986         slap_overinst   *on = glue_tool_inst( b0->bd_info );
 987         glueinfo                *gi = on->on_bi.bi_private;
 988         int i;
 989         ID rc;
 990
 991         glue_base = base;
 992         glue_scope = scope;
 993         glue_filter = f;
 994
 995         /* If we're starting from scratch, start at the most general */
 996         if (!glueBack) {
 997                 if ( toolDB.be_entry_open && toolDB.be_entry_first_x ) {
 998                         glueBack = &toolDB;
 999                 } else {
1000                         for (i = gi->gi_nodes-1; i >= 0; i--) {
1001                                 if (gi->gi_n[i].gn_be->be_entry_open &&
1002                                         gi->gi_n[i].gn_be->be_entry_first_x)
1003                                 {
1004                                         glueBack = gi->gi_n[i].gn_be;
1005                                         break;
1006                                 }
1007                         }
1008                 }
1009         }
1010         if (!glueBack || !glueBack->be_entry_open || !glueBack->be_entry_first_x ||
1011                 glueBack->be_entry_open (glueBack, glueMode) != 0)
1012                 return NOID;
1013
1014         rc = glueBack->be_entry_first_x (glueBack,
1015                 glue_base, glue_scope, glue_filter);
1016         while ( rc == NOID ) {
1017                 if ( glueBack && glueBack->be_entry_close )
1018                         glueBack->be_entry_close (glueBack);
1019                 for (i=0; i<gi->gi_nodes; i++) {
1020                         if (gi->gi_n[i].gn_be == glueBack)
1021                                 break;
1022                 }
1023                 if (i == 0) {
1024                         glueBack = GLUEBACK_DONE;
1025                         break;
1026                 } else {
1027                         glueBack = gi->gi_n[i-1].gn_be;
1028                         rc = glue_tool_entry_first_x (b0,
1029                                 glue_base, glue_scope, glue_filter);
1030                         if ( glueBack == GLUEBACK_DONE ) {
1031                                 break;
1032                         }
1033                 }
1034         }
1035         return rc;
1036 }
1037
1038 static ID
1039 glue_tool_entry_next (
1040         BackendDB *b0
1041 )
1042 {
1043         slap_overinst   *on = glue_tool_inst( b0->bd_info );
1044         glueinfo                *gi = on->on_bi.bi_private;
1045         int i;
1046         ID rc;
1047
1048         if (!glueBack || !glueBack->be_entry_next)
1049                 return NOID;
1050
1051         rc = glueBack->be_entry_next (glueBack);
1052
1053         /* If we ran out of entries in one database, move on to the next */
1054         while (rc == NOID) {
1055                 if ( glueBack && glueBack->be_entry_close )
1056                         glueBack->be_entry_close (glueBack);
1057                 for (i=0; i<gi->gi_nodes; i++) {
1058                         if (gi->gi_n[i].gn_be == glueBack)
1059                                 break;
1060                 }
1061                 if (i == 0) {
1062                         glueBack = GLUEBACK_DONE;
1063                         break;
1064                 } else {
1065                         glueBack = gi->gi_n[i-1].gn_be;
1066                         if ( glue_base || glue_filter ) {
1067                                 /* using entry_first_x() */
1068                                 rc = glue_tool_entry_first_x (b0,
1069                                         glue_base, glue_scope, glue_filter);
1070
1071                         } else {
1072                                 /* using entry_first() */
1073                                 rc = glue_tool_entry_first (b0);
1074                         }
1075                         if ( glueBack == GLUEBACK_DONE ) {
1076                                 break;
1077                         }
1078                 }
1079         }
1080         return rc;
1081 }
1082
1083 static ID
1084 glue_tool_dn2id_get (
1085         BackendDB *b0,
1086         struct berval *dn
1087 )
1088 {
1089         BackendDB *be, b2;
1090         int rc = -1;
1091
1092         b2 = *b0;
1093         b2.bd_info = (BackendInfo *)glue_tool_inst( b0->bd_info );
1094         be = glue_back_select (&b2, dn);
1095         if ( be == &b2 ) be = &toolDB;
1096
1097         if (!be->be_dn2id_get)
1098                 return NOID;
1099
1100         if (!glueBack) {
1101                 if ( be->be_entry_open ) {
1102                         rc = be->be_entry_open (be, glueMode);
1103                 }
1104                 if (rc != 0) {
1105                         return NOID;
1106                 }
1107         } else if (be != glueBack) {
1108                 /* If this entry belongs in a different branch than the
1109                  * previous one, close the current database and open the
1110                  * new one.
1111                  */
1112                 if ( glueBack->be_entry_close ) {
1113                         glueBack->be_entry_close (glueBack);
1114                 }
1115                 if ( be->be_entry_open ) {
1116                         rc = be->be_entry_open (be, glueMode);
1117                 }
1118                 if (rc != 0) {
1119                         return NOID;
1120                 }
1121         }
1122         glueBack = be;
1123         return be->be_dn2id_get (be, dn);
1124 }
1125
1126 static Entry *
1127 glue_tool_entry_get (
1128         BackendDB *b0,
1129         ID id
1130 )
1131 {
1132         if (!glueBack || !glueBack->be_entry_get)
1133                 return NULL;
1134
1135         return glueBack->be_entry_get (glueBack, id);
1136 }
1137
1138 static ID
1139 glue_tool_entry_put (
1140         BackendDB *b0,
1141         Entry *e,
1142         struct berval *text
1143 )
1144 {
1145         BackendDB *be, b2;
1146         int rc = -1;
1147
1148         b2 = *b0;
1149         b2.bd_info = (BackendInfo *)glue_tool_inst( b0->bd_info );
1150         be = glue_back_select (&b2, &e->e_nname);
1151         if ( be == &b2 ) be = &toolDB;
1152
1153         if (!be->be_entry_put)
1154                 return NOID;
1155
1156         if (!glueBack) {
1157                 if ( be->be_entry_open ) {
1158                         rc = be->be_entry_open (be, glueMode);
1159                 }
1160                 if (rc != 0) {
1161                         return NOID;
1162                 }
1163         } else if (be != glueBack) {
1164                 /* If this entry belongs in a different branch than the
1165                  * previous one, close the current database and open the
1166                  * new one.
1167                  */
1168                 if ( glueBack->be_entry_close ) {
1169                         glueBack->be_entry_close (glueBack);
1170                 }
1171                 if ( be->be_entry_open ) {
1172                         rc = be->be_entry_open (be, glueMode);
1173                 }
1174                 if (rc != 0) {
1175                         return NOID;
1176                 }
1177         }
1178         glueBack = be;
1179         return be->be_entry_put (be, e, text);
1180 }
1181
1182 static ID
1183 glue_tool_entry_modify (
1184         BackendDB *b0,
1185         Entry *e,
1186         struct berval *text
1187 )
1188 {
1189         if (!glueBack || !glueBack->be_entry_modify)
1190                 return NOID;
1191
1192         return glueBack->be_entry_modify (glueBack, e, text);
1193 }
1194
1195 static int
1196 glue_tool_entry_reindex (
1197         BackendDB *b0,
1198         ID id,
1199         AttributeDescription **adv
1200 )
1201 {
1202         if (!glueBack || !glueBack->be_entry_reindex)
1203                 return -1;
1204
1205         return glueBack->be_entry_reindex (glueBack, id, adv);
1206 }
1207
1208 static int
1209 glue_tool_sync (
1210         BackendDB *b0
1211 )
1212 {
1213         slap_overinst   *on = glue_tool_inst( b0->bd_info );
1214         glueinfo                *gi = on->on_bi.bi_private;
1215         BackendInfo             *bi = b0->bd_info;
1216         int i;
1217
1218         /* just sync everyone */
1219         for (i = 0; i<gi->gi_nodes; i++)
1220                 if (gi->gi_n[i].gn_be->be_sync)
1221                         gi->gi_n[i].gn_be->be_sync (gi->gi_n[i].gn_be);
1222         b0->bd_info = on->on_info->oi_orig;
1223         if ( b0->be_sync )
1224                 b0->be_sync( b0 );
1225         b0->bd_info = bi;
1226         return 0;
1227 }
1228
1229 typedef struct glue_Addrec {
1230         struct glue_Addrec *ga_next;
1231         BackendDB *ga_be;
1232 } glue_Addrec;
1233
1234 /* List of added subordinates */
1235 static glue_Addrec *ga_list;
1236 static int ga_adding;
1237
1238 static int
1239 glue_db_init(
1240         BackendDB *be,
1241         ConfigReply *cr
1242 )
1243 {
1244         slap_overinst   *on = (slap_overinst *)be->bd_info;
1245         slap_overinfo   *oi = on->on_info;
1246         BackendInfo     *bi = oi->oi_orig;
1247         glueinfo *gi;
1248
1249         if ( SLAP_GLUE_SUBORDINATE( be )) {
1250                 Debug( LDAP_DEBUG_ANY, "glue: backend %s is already subordinate, "
1251                         "cannot have glue overlay!\n",
1252                         be->be_suffix[0].bv_val, 0, 0 );
1253                 return LDAP_OTHER;
1254         }
1255
1256         gi = ch_calloc( 1, sizeof(glueinfo));
1257         on->on_bi.bi_private = gi;
1258         dnParent( be->be_nsuffix, &gi->gi_pdn );
1259
1260         /* Currently the overlay framework doesn't handle these entry points
1261          * but we need them....
1262          */
1263         oi->oi_bi.bi_open = glue_open;
1264         oi->oi_bi.bi_close = glue_close;
1265
1266         /* Only advertise these if the root DB supports them */
1267         if ( bi->bi_tool_entry_open )
1268                 oi->oi_bi.bi_tool_entry_open = glue_tool_entry_open;
1269         if ( bi->bi_tool_entry_close )
1270                 oi->oi_bi.bi_tool_entry_close = glue_tool_entry_close;
1271         if ( bi->bi_tool_entry_first )
1272                 oi->oi_bi.bi_tool_entry_first = glue_tool_entry_first;
1273         /* FIXME: check whether all support bi_tool_entry_first_x() ? */
1274         if ( bi->bi_tool_entry_first_x )
1275                 oi->oi_bi.bi_tool_entry_first_x = glue_tool_entry_first_x;
1276         if ( bi->bi_tool_entry_next )
1277                 oi->oi_bi.bi_tool_entry_next = glue_tool_entry_next;
1278         if ( bi->bi_tool_entry_get )
1279                 oi->oi_bi.bi_tool_entry_get = glue_tool_entry_get;
1280         if ( bi->bi_tool_dn2id_get )
1281                 oi->oi_bi.bi_tool_dn2id_get = glue_tool_dn2id_get;
1282         if ( bi->bi_tool_entry_put )
1283                 oi->oi_bi.bi_tool_entry_put = glue_tool_entry_put;
1284         if ( bi->bi_tool_entry_reindex )
1285                 oi->oi_bi.bi_tool_entry_reindex = glue_tool_entry_reindex;
1286         if ( bi->bi_tool_entry_modify )
1287                 oi->oi_bi.bi_tool_entry_modify = glue_tool_entry_modify;
1288         if ( bi->bi_tool_sync )
1289                 oi->oi_bi.bi_tool_sync = glue_tool_sync;
1290
1291         SLAP_DBFLAGS( be ) |= SLAP_DBFLAG_GLUE_INSTANCE;
1292
1293         if ( ga_list ) {
1294                 be->bd_info = (BackendInfo *)oi;
1295                 glue_sub_attach( 1 );
1296         }
1297
1298         return 0;
1299 }
1300
1301 static int
1302 glue_db_destroy (
1303         BackendDB *be,
1304         ConfigReply *cr
1305 )
1306 {
1307         slap_overinst   *on = (slap_overinst *)be->bd_info;
1308         glueinfo                *gi = (glueinfo *)on->on_bi.bi_private;
1309
1310         free (gi);
1311         return SLAP_CB_CONTINUE;
1312 }
1313
1314 static int
1315 glue_db_close(
1316         BackendDB *be,
1317         ConfigReply *cr
1318 )
1319 {
1320         slap_overinst   *on = (slap_overinst *)be->bd_info;
1321
1322         on->on_info->oi_bi.bi_db_close = 0;
1323         return 0;
1324 }
1325
1326 int
1327 glue_sub_del( BackendDB *b0 )
1328 {
1329         BackendDB *be;
1330         int rc = 0;
1331
1332         /* Find the top backend for this subordinate */
1333         be = b0;
1334         while ( (be=LDAP_STAILQ_NEXT( be, be_next )) != NULL ) {
1335                 slap_overinfo *oi;
1336                 slap_overinst *on;
1337                 glueinfo *gi;
1338                 int i;
1339
1340                 if ( SLAP_GLUE_SUBORDINATE( be ))
1341                         continue;
1342                 if ( !SLAP_GLUE_INSTANCE( be ))
1343                         continue;
1344                 if ( !dnIsSuffix( &b0->be_nsuffix[0], &be->be_nsuffix[0] ))
1345                         continue;
1346
1347                 /* OK, got the right backend, find the overlay */
1348                 oi = (slap_overinfo *)be->bd_info;
1349                 for ( on=oi->oi_list; on; on=on->on_next ) {
1350                         if ( on->on_bi.bi_type == glue.on_bi.bi_type )
1351                                 break;
1352                 }
1353                 assert( on != NULL );
1354                 gi = on->on_bi.bi_private;
1355                 for ( i=0; i < gi->gi_nodes; i++ ) {
1356                         if ( gi->gi_n[i].gn_be == b0 ) {
1357                                 int j;
1358
1359                                 for (j=i+1; j < gi->gi_nodes; j++)
1360                                         gi->gi_n[j-1] = gi->gi_n[j];
1361
1362                                 gi->gi_nodes--;
1363                         }
1364                 }
1365         }
1366         if ( be == NULL )
1367                 rc = LDAP_NO_SUCH_OBJECT;
1368
1369         return rc;
1370 }
1371
1372
1373 /* Attach all the subordinate backends to their superior */
1374 int
1375 glue_sub_attach( int online )
1376 {
1377         glue_Addrec *ga, *gnext = NULL;
1378         int rc = 0;
1379
1380         if ( ga_adding )
1381                 return 0;
1382
1383         ga_adding = 1;
1384
1385         /* For all the subordinate backends */
1386         for ( ga=ga_list; ga != NULL; ga = gnext ) {
1387                 BackendDB *be;
1388
1389                 gnext = ga->ga_next;
1390
1391                 /* Find the top backend for this subordinate */
1392                 be = ga->ga_be;
1393                 while ( (be=LDAP_STAILQ_NEXT( be, be_next )) != NULL ) {
1394                         slap_overinfo *oi;
1395                         slap_overinst *on;
1396                         glueinfo *gi;
1397
1398                         if ( SLAP_GLUE_SUBORDINATE( be ))
1399                                 continue;
1400                         if ( !dnIsSuffix( &ga->ga_be->be_nsuffix[0], &be->be_nsuffix[0] ))
1401                                 continue;
1402
1403                         /* If it's not already configured, set up the overlay */
1404                         if ( !SLAP_GLUE_INSTANCE( be )) {
1405                                 rc = overlay_config( be, glue.on_bi.bi_type, -1, NULL, NULL);
1406                                 if ( rc )
1407                                         break;
1408                         }
1409                         /* Find the overlay instance */
1410                         oi = (slap_overinfo *)be->bd_info;
1411                         for ( on=oi->oi_list; on; on=on->on_next ) {
1412                                 if ( on->on_bi.bi_type == glue.on_bi.bi_type )
1413                                         break;
1414                         }
1415                         assert( on != NULL );
1416                         gi = on->on_bi.bi_private;
1417                         gi = (glueinfo *)ch_realloc( gi, sizeof(glueinfo) +
1418                                 gi->gi_nodes * sizeof(gluenode));
1419                         gi->gi_n[gi->gi_nodes].gn_be = ga->ga_be;
1420                         dnParent( &ga->ga_be->be_nsuffix[0],
1421                                 &gi->gi_n[gi->gi_nodes].gn_pdn );
1422                         gi->gi_nodes++;
1423                         on->on_bi.bi_private = gi;
1424                         ga->ga_be->be_flags |= SLAP_DBFLAG_GLUE_LINKED;
1425                         break;
1426                 }
1427                 if ( !be ) {
1428                         Debug( LDAP_DEBUG_ANY, "glue: no superior found for sub %s!\n",
1429                                 ga->ga_be->be_suffix[0].bv_val, 0, 0 );
1430                         /* allow this for now, assume a superior will
1431                          * be added later
1432                          */
1433                         if ( online ) {
1434                                 rc = 0;
1435                                 gnext = ga_list;
1436                                 break;
1437                         }
1438                         rc = LDAP_NO_SUCH_OBJECT;
1439                 }
1440                 ch_free( ga );
1441                 if ( rc ) break;
1442         }
1443
1444         ga_list = gnext;
1445
1446         ga_adding = 0;
1447
1448         return rc;
1449 }
1450
1451 int
1452 glue_sub_add( BackendDB *be, int advert, int online )
1453 {
1454         glue_Addrec *ga;
1455         int rc = 0;
1456
1457         if ( overlay_is_inst( be, "glue" )) {
1458                 Debug( LDAP_DEBUG_ANY, "glue: backend %s already has glue overlay, "
1459                         "cannot be a subordinate!\n",
1460                         be->be_suffix[0].bv_val, 0, 0 );
1461                 return LDAP_OTHER;
1462         }
1463         SLAP_DBFLAGS( be ) |= SLAP_DBFLAG_GLUE_SUBORDINATE;
1464         if ( advert )
1465                 SLAP_DBFLAGS( be ) |= SLAP_DBFLAG_GLUE_ADVERTISE;
1466
1467         ga = ch_malloc( sizeof( glue_Addrec ));
1468         ga->ga_next = ga_list;
1469         ga->ga_be = be;
1470         ga_list = ga;
1471
1472         if ( online )
1473                 rc = glue_sub_attach( online );
1474
1475         return rc;
1476 }
1477
1478 static int
1479 glue_access_allowed(
1480         Operation               *op,
1481         Entry                   *e,
1482         AttributeDescription    *desc,
1483         struct berval           *val,
1484         slap_access_t           access,
1485         AccessControlState      *state,
1486         slap_mask_t             *maskp )
1487 {
1488         BackendDB *b0, *be = glue_back_select( op->o_bd, &e->e_nname );
1489         int rc;
1490
1491         if ( be == NULL || be == op->o_bd || be->bd_info->bi_access_allowed == NULL )
1492                 return SLAP_CB_CONTINUE;
1493
1494         b0 = op->o_bd;
1495         op->o_bd = be;
1496         rc = be->bd_info->bi_access_allowed ( op, e, desc, val, access, state, maskp );
1497         op->o_bd = b0;
1498         return rc;
1499 }
1500
1501 int
1502 glue_sub_init()
1503 {
1504         glue.on_bi.bi_type = "glue";
1505
1506         glue.on_bi.bi_db_init = glue_db_init;
1507         glue.on_bi.bi_db_close = glue_db_close;
1508         glue.on_bi.bi_db_destroy = glue_db_destroy;
1509
1510         glue.on_bi.bi_op_search = glue_op_search;
1511         glue.on_bi.bi_op_modify = glue_op_func;
1512         glue.on_bi.bi_op_modrdn = glue_op_func;
1513         glue.on_bi.bi_op_add = glue_op_func;
1514         glue.on_bi.bi_op_delete = glue_op_func;
1515         glue.on_bi.bi_extended = glue_op_func;
1516
1517         glue.on_bi.bi_chk_referrals = glue_chk_referrals;
1518         glue.on_bi.bi_chk_controls = glue_chk_controls;
1519         glue.on_bi.bi_entry_get_rw = glue_entry_get_rw;
1520         glue.on_bi.bi_entry_release_rw = glue_entry_release_rw;
1521         glue.on_bi.bi_access_allowed = glue_access_allowed;
1522
1523         glue.on_response = glue_response;
1524
1525         return overlay_register( &glue );
1526 }