]> git.sur5r.net Git - openldap/blob - servers/slapd/overlays/glue.c
update for new backend types
[openldap] / servers / slapd / overlays / glue.c
1 /* glue.c - backend glue overlay */
2 /* $OpenLDAP$ */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
4  *
5  * Copyright 2001-2005 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 #ifdef SLAPD_OVER_GLUE
32
33 #include <stdio.h>
34
35 #include <ac/string.h>
36 #include <ac/socket.h>
37
38 #define SLAPD_TOOLS
39 #include "slap.h"
40
41 typedef struct gluenode {
42         BackendDB *gn_be;
43         struct berval gn_pdn;
44         int gn_async;
45 } gluenode;
46
47 typedef struct glueinfo {
48         int gi_nodes;
49         struct berval gi_pdn;
50         gluenode gi_n[1];
51 } glueinfo;
52
53 static slap_overinst    glue;
54
55 static int glueMode;
56 static BackendDB *glueBack;
57
58 static slap_response glue_op_response;
59
60 /* Just like select_backend, but only for our backends */
61 static BackendDB *
62 glue_back_select (
63         BackendDB *be,
64         struct berval *dn
65 )
66 {
67         slap_overinst   *on = (slap_overinst *)be->bd_info;
68         glueinfo                *gi = (glueinfo *)on->on_bi.bi_private;
69         int i;
70
71         for (i = 0; i<gi->gi_nodes; i++) {
72                 assert( gi->gi_n[i].gn_be->be_nsuffix != NULL );
73
74                 if (dnIsSuffix(dn, &gi->gi_n[i].gn_be->be_nsuffix[0])) {
75                         return gi->gi_n[i].gn_be;
76                 }
77         }
78         be->bd_info = on->on_info->oi_orig;
79         return be;
80 }
81
82
83 typedef struct glue_state {
84         int err;
85         int slimit;
86         int matchlen;
87         char *matched;
88         int nrefs;
89         BerVarray refs;
90 } glue_state;
91
92 static int
93 glue_op_response ( Operation *op, SlapReply *rs )
94 {
95         glue_state *gs = op->o_callback->sc_private;
96
97         switch(rs->sr_type) {
98         case REP_SEARCH:
99                 if ( gs->slimit != SLAP_NO_LIMIT
100                                 && rs->sr_nentries >= gs->slimit )
101                 {
102                         rs->sr_err = gs->err = LDAP_SIZELIMIT_EXCEEDED;
103                         return -1;
104                 }
105                 /* fallthru */
106         case REP_SEARCHREF:
107                 return SLAP_CB_CONTINUE;
108
109         default:
110                 if (rs->sr_err == LDAP_SUCCESS ||
111                         rs->sr_err == LDAP_SIZELIMIT_EXCEEDED ||
112                         rs->sr_err == LDAP_TIMELIMIT_EXCEEDED ||
113                         rs->sr_err == LDAP_ADMINLIMIT_EXCEEDED ||
114                         rs->sr_err == LDAP_NO_SUCH_OBJECT ||
115                         gs->err != LDAP_SUCCESS)
116                         gs->err = rs->sr_err;
117                 if (gs->err == LDAP_SUCCESS && gs->matched) {
118                         ch_free (gs->matched);
119                         gs->matched = NULL;
120                         gs->matchlen = 0;
121                 }
122                 if (gs->err != LDAP_SUCCESS && rs->sr_matched) {
123                         int len;
124                         len = strlen (rs->sr_matched);
125                         if (len > gs->matchlen) {
126                                 if (gs->matched)
127                                         ch_free (gs->matched);
128                                 gs->matched = ch_strdup (rs->sr_matched);
129                                 gs->matchlen = len;
130                         }
131                 }
132                 if (rs->sr_ref) {
133                         int i, j, k;
134                         BerVarray new;
135
136                         for (i=0; rs->sr_ref[i].bv_val; i++);
137
138                         j = gs->nrefs;
139                         if (!j) {
140                                 new = ch_malloc ((i+1)*sizeof(struct berval));
141                         } else {
142                                 new = ch_realloc(gs->refs,
143                                         (j+i+1)*sizeof(struct berval));
144                         }
145                         for (k=0; k<i; j++,k++) {
146                                 ber_dupbv( &new[j], &rs->sr_ref[k] );
147                         }
148                         new[j].bv_val = NULL;
149                         gs->nrefs = j;
150                         gs->refs = new;
151                 }
152         }
153         return 0;
154 }
155
156 static int
157 glue_op_func ( Operation *op, SlapReply *rs )
158 {
159         slap_overinst   *on = (slap_overinst *)op->o_bd->bd_info;
160         BackendDB *b0 = op->o_bd;
161         BackendInfo *bi0 = op->o_bd->bd_info;
162         BI_op_modify **func;
163         slap_operation_t which;
164         int rc;
165
166         op->o_bd = glue_back_select (b0, &op->o_req_ndn);
167         b0->bd_info = on->on_info->oi_orig;
168
169         switch(op->o_tag) {
170         case LDAP_REQ_ADD: which = op_add; break;
171         case LDAP_REQ_DELETE: which = op_delete; break;
172         case LDAP_REQ_MODIFY: which = op_modify; break;
173         case LDAP_REQ_MODRDN: which = op_modrdn; break;
174         }
175
176         func = &op->o_bd->bd_info->bi_op_bind;
177         if ( func[which] )
178                 rc = func[which]( op, rs );
179         else
180                 rc = SLAP_CB_CONTINUE;
181
182         op->o_bd = b0;
183         op->o_bd->bd_info = bi0;
184         return rc;
185 }
186
187 static int
188 glue_chk_referrals ( Operation *op, SlapReply *rs )
189 {
190         slap_overinst   *on = (slap_overinst *)op->o_bd->bd_info;
191         BackendDB *b0 = op->o_bd;
192         BackendInfo *bi0 = op->o_bd->bd_info;
193         int rc;
194
195         op->o_bd = glue_back_select (b0, &op->o_req_ndn);
196         b0->bd_info = on->on_info->oi_orig;
197
198         if ( op->o_bd->bd_info->bi_chk_referrals )
199                 rc = ( *op->o_bd->bd_info->bi_chk_referrals )( op, rs );
200         else
201                 rc = SLAP_CB_CONTINUE;
202
203         op->o_bd = b0;
204         op->o_bd->bd_info = bi0;
205         return rc;
206 }
207
208 static int
209 glue_chk_controls ( Operation *op, SlapReply *rs )
210 {
211         slap_overinst   *on = (slap_overinst *)op->o_bd->bd_info;
212         BackendDB *b0 = op->o_bd;
213         BackendInfo *bi0 = op->o_bd->bd_info;
214         int rc = SLAP_CB_CONTINUE;
215
216         op->o_bd = glue_back_select (b0, &op->o_req_ndn);
217         b0->bd_info = on->on_info->oi_orig;
218
219         /* if the subordinate database has overlays, the bi_chk_controls()
220          * hook is actually over_aux_chk_controls(); in case it actually
221          * wraps a missing hok, we need to mimic the behavior
222          * of the frontend applied to that database */
223         if ( op->o_bd->bd_info->bi_chk_controls ) {
224                 rc = ( *op->o_bd->bd_info->bi_chk_controls )( op, rs );
225         }
226
227         
228         if ( rc == SLAP_CB_CONTINUE ) {
229                 rc = backend_check_controls( op, rs );
230         }
231
232         op->o_bd = b0;
233         op->o_bd->bd_info = bi0;
234         return rc;
235 }
236
237 static int
238 glue_op_search ( Operation *op, SlapReply *rs )
239 {
240         slap_overinst   *on = (slap_overinst *)op->o_bd->bd_info;
241         glueinfo                *gi = (glueinfo *)on->on_bi.bi_private;
242         BackendDB *b0 = op->o_bd;
243         BackendDB *b1 = NULL, *btmp;
244         BackendInfo *bi0 = op->o_bd->bd_info;
245         int i;
246         long stoptime = 0;
247         glue_state gs = {0, 0, 0, NULL, 0, NULL};
248         slap_callback cb = { NULL, glue_op_response, NULL, NULL };
249         int scope0, slimit0, tlimit0;
250         struct berval dn, ndn, *pdn;
251
252         cb.sc_private = &gs;
253
254         cb.sc_next = op->o_callback;
255
256         stoptime = slap_get_time () + op->ors_tlimit;
257
258         op->o_bd = glue_back_select (b0, &op->o_req_ndn);
259         b0->bd_info = on->on_info->oi_orig;
260
261         switch (op->ors_scope) {
262         case LDAP_SCOPE_BASE:
263                 rs->sr_err = LDAP_UNWILLING_TO_PERFORM;
264                 if (op->o_bd && op->o_bd->be_search) {
265                         rs->sr_err = op->o_bd->be_search( op, rs );
266                 }
267                 return rs->sr_err;
268
269         case LDAP_SCOPE_ONELEVEL:
270         case LDAP_SCOPE_SUBTREE:
271 #ifdef LDAP_SCOPE_SUBORDINATE
272         case LDAP_SCOPE_SUBORDINATE: /* FIXME */
273 #endif
274
275 #if 0
276                 if ( op->o_sync ) {
277                         if (op->o_bd && op->o_bd->be_search) {
278                                 rs->sr_err = op->o_bd->be_search( op, rs );
279                         } else {
280                                 send_ldap_error(op, rs, LDAP_UNWILLING_TO_PERFORM,
281                                                 "No search target found");
282                         }
283                         return rs->sr_err;
284                 }
285 #endif
286
287                 op->o_callback = &cb;
288                 rs->sr_err = gs.err = LDAP_UNWILLING_TO_PERFORM;
289                 scope0 = op->ors_scope;
290                 slimit0 = gs.slimit = op->ors_slimit;
291                 tlimit0 = op->ors_tlimit;
292                 dn = op->o_req_dn;
293                 ndn = op->o_req_ndn;
294                 b1 = op->o_bd;
295
296                 /*
297                  * Execute in reverse order, most general first 
298                  */
299                 for (i = gi->gi_nodes; i >= 0; i--) {
300                         if ( i == gi->gi_nodes ) {
301                                 btmp = b0;
302                                 pdn = &gi->gi_pdn;
303                         } else {
304                                 btmp = gi->gi_n[i].gn_be;
305                                 pdn = &gi->gi_n[i].gn_pdn;
306                         }
307                         if (!btmp || !btmp->be_search)
308                                 continue;
309                         if (!dnIsSuffix(&btmp->be_nsuffix[0], &b1->be_nsuffix[0]))
310                                 continue;
311                         if (tlimit0 != SLAP_NO_LIMIT) {
312                                 op->ors_tlimit = stoptime - slap_get_time ();
313                                 if (op->ors_tlimit <= 0) {
314                                         rs->sr_err = gs.err = LDAP_TIMELIMIT_EXCEEDED;
315                                         break;
316                                 }
317                         }
318                         if (slimit0 != SLAP_NO_LIMIT) {
319                                 op->ors_slimit = slimit0 - rs->sr_nentries;
320                                 if (op->ors_slimit < 0) {
321                                         rs->sr_err = gs.err = LDAP_SIZELIMIT_EXCEEDED;
322                                         break;
323                                 }
324                         }
325                         rs->sr_err = 0;
326                         /*
327                          * check for abandon 
328                          */
329                         if (op->o_abandon) {
330                                 goto end_of_loop;
331                         }
332                         op->o_bd = btmp;
333
334                         assert( op->o_bd->be_suffix != NULL );
335                         assert( op->o_bd->be_nsuffix != NULL );
336                         
337                         if (scope0 == LDAP_SCOPE_ONELEVEL && 
338                                 dn_match(pdn, &ndn))
339                         {
340                                 op->ors_scope = LDAP_SCOPE_BASE;
341                                 op->o_req_dn = op->o_bd->be_suffix[0];
342                                 op->o_req_ndn = op->o_bd->be_nsuffix[0];
343                                 rs->sr_err = op->o_bd->be_search(op, rs);
344
345                         } else if (scope0 == LDAP_SCOPE_SUBTREE &&
346                                 dn_match(&op->o_bd->be_nsuffix[0], &ndn))
347                         {
348                                 rs->sr_err = op->o_bd->be_search( op, rs );
349
350                         } else if (scope0 == LDAP_SCOPE_SUBTREE &&
351                                 dnIsSuffix(&op->o_bd->be_nsuffix[0], &ndn))
352                         {
353                                 op->o_req_dn = op->o_bd->be_suffix[0];
354                                 op->o_req_ndn = op->o_bd->be_nsuffix[0];
355                                 rs->sr_err = op->o_bd->be_search( op, rs );
356                                 if ( rs->sr_err == LDAP_NO_SUCH_OBJECT ) {
357                                         gs.err = LDAP_SUCCESS;
358                                 }
359
360                         } else if (dnIsSuffix(&ndn, &op->o_bd->be_nsuffix[0])) {
361                                 rs->sr_err = op->o_bd->be_search( op, rs );
362                         }
363
364                         switch ( gs.err ) {
365
366                         /*
367                          * Add errors that should result in dropping
368                          * the search
369                          */
370                         case LDAP_SIZELIMIT_EXCEEDED:
371                         case LDAP_TIMELIMIT_EXCEEDED:
372                         case LDAP_ADMINLIMIT_EXCEEDED:
373                         case LDAP_NO_SUCH_OBJECT:
374 #ifdef LDAP_CONTROL_X_CHAINING_BEHAVIOR
375                         case LDAP_CANNOT_CHAIN:
376 #endif /* LDAP_CONTROL_X_CHAINING_BEHAVIOR */
377                                 goto end_of_loop;
378                         
379                         default:
380                                 break;
381                         }
382                 }
383 end_of_loop:;
384                 op->ors_scope = scope0;
385                 op->ors_slimit = slimit0;
386                 op->ors_tlimit = tlimit0;
387                 op->o_req_dn = dn;
388                 op->o_req_ndn = ndn;
389
390                 break;
391         }
392         if ( op->o_abandon ) {
393                 rs->sr_err = SLAPD_ABANDON;
394         } else {
395                 op->o_callback = cb.sc_next;
396                 rs->sr_err = gs.err;
397                 rs->sr_matched = gs.matched;
398                 rs->sr_ref = gs.refs;
399
400                 send_ldap_result( op, rs );
401         }
402
403         op->o_bd = b0;
404         op->o_bd->bd_info = bi0;
405         if (gs.matched)
406                 free (gs.matched);
407         if (gs.refs)
408                 ber_bvarray_free(gs.refs);
409         return rs->sr_err;
410 }
411
412 static BackendDB toolDB;
413
414 static int
415 glue_tool_entry_open (
416         BackendDB *b0,
417         int mode
418 )
419 {
420         slap_overinfo   *oi = (slap_overinfo *)b0->bd_info;
421
422         /* We don't know which backend to talk to yet, so just
423          * remember the mode and move on...
424          */
425
426         glueMode = mode;
427         glueBack = NULL;
428         toolDB = *b0;
429         toolDB.bd_info = oi->oi_orig;
430
431         return 0;
432 }
433
434 static int
435 glue_tool_entry_close (
436         BackendDB *b0
437 )
438 {
439         int rc = 0;
440
441         if (glueBack) {
442                 if (!glueBack->be_entry_close)
443                         return 0;
444                 rc = glueBack->be_entry_close (glueBack);
445         }
446         return rc;
447 }
448
449 static slap_overinst *
450 glue_tool_inst(
451         BackendInfo *bi
452 )
453 {
454         slap_overinfo   *oi = (slap_overinfo *)bi;
455         slap_overinst   *on;
456
457         for ( on = oi->oi_list; on; on=on->on_next ) {
458                 if ( !strcmp( on->on_bi.bi_type, glue.on_bi.bi_type ))
459                         return on;
460         }
461         return NULL;
462 }
463
464 /* This function will only be called in tool mode */
465 static int
466 glue_open (
467         BackendInfo *bi
468 )
469 {
470         slap_overinst *on = glue_tool_inst( bi );
471         glueinfo                *gi = on->on_bi.bi_private;
472         static int glueOpened = 0;
473         int i, j, same, bsame = 0, rc = 0;
474
475         if (glueOpened) return 0;
476
477         glueOpened = 1;
478
479         /* If we were invoked in tool mode, open all the underlying backends */
480         if (slapMode & SLAP_TOOL_MODE) {
481                 for (i = 0; i<gi->gi_nodes; i++) {
482                         same = 0;
483                         /* Same type as our main backend? */
484                         if ( gi->gi_n[i].gn_be->bd_info == on->on_info->oi_orig )
485                                 bsame = 1;
486
487                         /* Loop thru the bd_info's and make sure we only
488                          * invoke their bi_open functions once each.
489                          */
490                         for ( j = 0; j<i; j++ ) {
491                                 if ( gi->gi_n[i].gn_be->bd_info ==
492                                         gi->gi_n[j].gn_be->bd_info ) {
493                                         same = 1;
494                                         break;
495                                 }
496                         }
497                         /* OK, it's unique and non-NULL, call it. */
498                         if ( !same && gi->gi_n[i].gn_be->bd_info->bi_open )
499                                 rc = gi->gi_n[i].gn_be->bd_info->bi_open(
500                                         gi->gi_n[i].gn_be->bd_info );
501                         /* Let backend.c take care of the rest of startup */
502                         if ( !rc )
503                                 rc = backend_startup_one( gi->gi_n[i].gn_be );
504                         if ( rc ) break;
505                 }
506                 if ( !rc && !bsame && on->on_info->oi_orig->bi_open )
507                         rc = on->on_info->oi_orig->bi_open( on->on_info->oi_orig );
508
509         } /* other case is impossible */
510         return rc;
511 }
512
513 /* This function will only be called in tool mode */
514 static int
515 glue_close (
516         BackendInfo *bi
517 )
518 {
519         slap_overinst *on = glue_tool_inst( bi );
520         static int glueClosed = 0;
521         int rc = 0;
522
523         if (glueClosed) return 0;
524
525         glueClosed = 1;
526
527         if (slapMode & SLAP_TOOL_MODE) {
528                 rc = backend_shutdown( NULL );
529         }
530         return rc;
531 }
532
533 static int
534 glue_entry_release_rw (
535         Operation *op,
536         Entry *e,
537         int rw
538 )
539 {
540         BackendDB *b0, b2;
541         int rc = -1;
542
543         b0 = op->o_bd;
544         b2 = *op->o_bd;
545         b2.bd_info = (BackendInfo *)glue_tool_inst( op->o_bd->bd_info );
546         op->o_bd = glue_back_select (&b2, &e->e_nname);
547
548         if ( op->o_bd->be_release ) {
549                 rc = op->o_bd->be_release( op, e, rw );
550
551         } else {
552                 /* FIXME: mimic be_entry_release_rw
553                  * when no be_release() available */
554                 /* free entry */
555                 entry_free( e );
556                 rc = 0;
557         }
558         op->o_bd = b0;
559         return rc;
560 }
561
562 static ID
563 glue_tool_entry_first (
564         BackendDB *b0
565 )
566 {
567         slap_overinst   *on = glue_tool_inst( b0->bd_info );
568         glueinfo                *gi = on->on_bi.bi_private;
569         int i;
570
571         /* If we're starting from scratch, start at the most general */
572         if (!glueBack) {
573                 if ( toolDB.be_entry_open && toolDB.be_entry_first ) {
574                         glueBack = &toolDB;
575                 } else {
576                         for (i = gi->gi_nodes-1; i >= 0; i--) {
577                                 if (gi->gi_n[i].gn_be->be_entry_open &&
578                                         gi->gi_n[i].gn_be->be_entry_first) {
579                                                 glueBack = gi->gi_n[i].gn_be;
580                                         break;
581                                 }
582                         }
583                 }
584         }
585         if (!glueBack || !glueBack->be_entry_open || !glueBack->be_entry_first ||
586                 glueBack->be_entry_open (glueBack, glueMode) != 0)
587                 return NOID;
588
589         return glueBack->be_entry_first (glueBack);
590 }
591
592 static ID
593 glue_tool_entry_next (
594         BackendDB *b0
595 )
596 {
597         slap_overinst   *on = glue_tool_inst( b0->bd_info );
598         glueinfo                *gi = on->on_bi.bi_private;
599         int i;
600         ID rc;
601
602         if (!glueBack || !glueBack->be_entry_next)
603                 return NOID;
604
605         rc = glueBack->be_entry_next (glueBack);
606
607         /* If we ran out of entries in one database, move on to the next */
608         while (rc == NOID) {
609                 if ( glueBack && glueBack->be_entry_close )
610                         glueBack->be_entry_close (glueBack);
611                 for (i=0; i<gi->gi_nodes; i++) {
612                         if (gi->gi_n[i].gn_be == glueBack)
613                                 break;
614                 }
615                 if (i == 0) {
616                         glueBack = NULL;
617                         break;
618                 } else {
619                         glueBack = gi->gi_n[i-1].gn_be;
620                         rc = glue_tool_entry_first (b0);
621                 }
622         }
623         return rc;
624 }
625
626 static Entry *
627 glue_tool_entry_get (
628         BackendDB *b0,
629         ID id
630 )
631 {
632         if (!glueBack || !glueBack->be_entry_get)
633                 return NULL;
634
635         return glueBack->be_entry_get (glueBack, id);
636 }
637
638 static ID
639 glue_tool_entry_put (
640         BackendDB *b0,
641         Entry *e,
642         struct berval *text
643 )
644 {
645         BackendDB *be, b2;
646         int rc = -1;
647
648         b2 = *b0;
649         b2.bd_info = (BackendInfo *)glue_tool_inst( b0->bd_info );
650         be = glue_back_select (&b2, &e->e_nname);
651         if ( be == &b2 ) be = &toolDB;
652
653         if (!be->be_entry_put)
654                 return NOID;
655
656         if (!glueBack) {
657                 if ( be->be_entry_open ) {
658                         rc = be->be_entry_open (be, glueMode);
659                 }
660                 if (rc != 0) {
661                         return NOID;
662                 }
663         } else if (be != glueBack) {
664                 /* If this entry belongs in a different branch than the
665                  * previous one, close the current database and open the
666                  * new one.
667                  */
668                 if ( glueBack->be_entry_close ) {
669                         glueBack->be_entry_close (glueBack);
670                 }
671                 if ( be->be_entry_open ) {
672                         rc = be->be_entry_open (be, glueMode);
673                 }
674                 if (rc != 0) {
675                         return NOID;
676                 }
677         }
678         glueBack = be;
679         return be->be_entry_put (be, e, text);
680 }
681
682 static int
683 glue_tool_entry_reindex (
684         BackendDB *b0,
685         ID id
686 )
687 {
688         if (!glueBack || !glueBack->be_entry_reindex)
689                 return -1;
690
691         return glueBack->be_entry_reindex (glueBack, id);
692 }
693
694 static int
695 glue_tool_sync (
696         BackendDB *b0
697 )
698 {
699         slap_overinst   *on = glue_tool_inst( b0->bd_info );
700         glueinfo                *gi = on->on_bi.bi_private;
701         BackendInfo             *bi = b0->bd_info;
702         int i;
703
704         /* just sync everyone */
705         for (i = 0; i<gi->gi_nodes; i++)
706                 if (gi->gi_n[i].gn_be->be_sync)
707                         gi->gi_n[i].gn_be->be_sync (gi->gi_n[i].gn_be);
708         b0->bd_info = on->on_info->oi_orig;
709         if ( b0->be_sync )
710                 b0->be_sync( b0 );
711         b0->bd_info = bi;
712         return 0;
713 }
714
715 static int
716 glue_db_init(
717         BackendDB *be
718 )
719 {
720         slap_overinst   *on = (slap_overinst *)be->bd_info;
721         slap_overinfo   *oi = on->on_info;
722         glueinfo *gi;
723
724         gi = ch_calloc( 1, sizeof(glueinfo));
725         on->on_bi.bi_private = gi;
726         dnParent( be->be_nsuffix, &gi->gi_pdn );
727
728         /* Currently the overlay framework doesn't handle these entry points
729          * but we need them....
730          */
731         oi->oi_bi.bi_open = glue_open;
732         oi->oi_bi.bi_close = glue_close;
733
734         oi->oi_bi.bi_entry_release_rw = glue_entry_release_rw;
735
736         oi->oi_bi.bi_tool_entry_open = glue_tool_entry_open;
737         oi->oi_bi.bi_tool_entry_close = glue_tool_entry_close;
738         oi->oi_bi.bi_tool_entry_first = glue_tool_entry_first;
739         oi->oi_bi.bi_tool_entry_next = glue_tool_entry_next;
740         oi->oi_bi.bi_tool_entry_get = glue_tool_entry_get;
741         oi->oi_bi.bi_tool_entry_put = glue_tool_entry_put;
742         oi->oi_bi.bi_tool_entry_reindex = glue_tool_entry_reindex;
743         oi->oi_bi.bi_tool_sync = glue_tool_sync;
744
745         /*FIXME : need to add support */
746         oi->oi_bi.bi_tool_dn2id_get = 0;
747         oi->oi_bi.bi_tool_id2entry_get = 0;
748         oi->oi_bi.bi_tool_entry_modify = 0;
749
750         return 0;
751 }
752
753 static int
754 glue_db_destroy (
755         BackendDB *be
756 )
757 {
758         slap_overinst   *on = (slap_overinst *)be->bd_info;
759         glueinfo                *gi = (glueinfo *)on->on_bi.bi_private;
760
761         free (gi);
762         return SLAP_CB_CONTINUE;
763 }
764
765 static int
766 glue_db_close( 
767         BackendDB *be
768 )
769 {
770         slap_overinst   *on = (slap_overinst *)be->bd_info;
771
772         on->on_info->oi_bi.bi_db_close = NULL;
773         return 0;
774 }
775
776 static int
777 glue_db_config(
778         BackendDB       *be,
779         const char      *fname,
780         int             lineno,
781         int             argc,
782         char    **argv
783 )
784 {
785         slap_overinst   *on = (slap_overinst *)be->bd_info;
786         glueinfo                *gi = (glueinfo *)on->on_bi.bi_private;
787
788         /* redundant; could be applied just once */
789         SLAP_DBFLAGS( be ) |= SLAP_DBFLAG_GLUE_INSTANCE;
790
791         if ( strcasecmp( argv[0], "glue-sub" ) == 0 ) {
792                 int i, async = 0, advertise = 0;
793                 BackendDB *b2;
794                 struct berval bv, dn;
795
796                 if ( argc < 2 ) {
797                         fprintf( stderr, "%s: line %d: too few arguments in "
798                                 "\"glue-sub <suffixDN> [async] [advertise]\"\n", fname, lineno );
799                         return -1;
800                 }
801                 for ( i = 2; i < argc; i++ ) {
802                         if ( strcasecmp( argv[i], "async" ) == 0 ) {
803                                 async = 1;
804
805                         } else if ( strcasecmp( argv[i], "advertise" ) == 0 ) {
806                                 advertise = 1;
807
808                         } else {
809                                 fprintf( stderr, "%s: line %d: unrecognized option "
810                                         "\"%s\" ignored.\n", fname, lineno, argv[i] );
811                         }
812                 }
813                 ber_str2bv( argv[1], 0, 0, &bv );
814                 if ( dnNormalize( 0, NULL, NULL, &bv, &dn, NULL )) {
815                         fprintf( stderr, "invalid suffixDN \"%s\"\n", argv[1] );
816                         return -1;
817                 }
818                 b2 = select_backend( &dn, 0, 1 );
819                 if ( !b2 ) {
820                         fprintf( stderr, "%s: line %d: unknown suffix \"%s\"\n",
821                                 fname, lineno, argv[1] );
822                         return -1;
823                 }
824                 SLAP_DBFLAGS(b2) |= SLAP_DBFLAG_GLUE_SUBORDINATE;
825                 if ( advertise ) {
826                         SLAP_DBFLAGS(b2) |= SLAP_DBFLAG_GLUE_ADVERTISE;
827                 }
828                 gi = (glueinfo *)ch_realloc( gi, sizeof(glueinfo) +
829                         gi->gi_nodes * sizeof(gluenode));
830                 gi->gi_n[gi->gi_nodes].gn_be = b2;
831                 dnParent( &b2->be_nsuffix[0], &gi->gi_n[gi->gi_nodes].gn_pdn );
832                 gi->gi_n[gi->gi_nodes].gn_async = async;
833                 gi->gi_nodes++;
834                 on->on_bi.bi_private = gi;
835                 return 0;
836         }
837         return SLAP_CONF_UNKNOWN;
838 }
839
840 int
841 glue_init()
842 {
843         glue.on_bi.bi_type = "glue";
844
845         glue.on_bi.bi_db_init = glue_db_init;
846         glue.on_bi.bi_db_config = glue_db_config;
847         glue.on_bi.bi_db_close = glue_db_close;
848         glue.on_bi.bi_db_destroy = glue_db_destroy;
849
850         glue.on_bi.bi_op_search = glue_op_search;
851         glue.on_bi.bi_op_modify = glue_op_func;
852         glue.on_bi.bi_op_modrdn = glue_op_func;
853          glue.on_bi.bi_op_add = glue_op_func;
854         glue.on_bi.bi_op_delete = glue_op_func;
855
856         glue.on_bi.bi_chk_referrals = glue_chk_referrals;
857         glue.on_bi.bi_chk_controls = glue_chk_controls;
858
859         return overlay_register( &glue );
860 }
861
862 #if SLAPD_OVER_GLUE == SLAPD_MOD_DYNAMIC
863 int
864 init_module( int argc, char *argv[] )
865 {
866         return glue_init();
867 }
868 #endif  /* SLAPD_OVER_GLUE == SLAPD_MOD_DYNAMIC */
869
870 #endif  /* defined(SLAPD_OVER_GLUE */