1 /* ldif.c - the ldif backend */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
5 * Copyright 2005-2006 The OpenLDAP Foundation.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted only as authorized by the OpenLDAP
12 * A copy of this license is available in the file LICENSE in the
13 * top-level directory of the distribution or, alternatively, at
14 * <http://www.OpenLDAP.org/license.html>.
17 * This work was originally developed by Eric Stokes for inclusion
18 * in OpenLDAP Software.
23 #include <ac/string.h>
24 #include <sys/types.h>
26 #include <ac/dirent.h>
29 #include <ac/unistd.h>
34 typedef struct enumCookie {
43 struct berval li_base_path;
44 enumCookie li_tool_cookie;
46 ldap_pvt_thread_mutex_t li_mutex;
50 #define mkdir(a,b) mkdir(a)
62 #define ENTRY_BUFF_INCREMENT 500
64 static ConfigTable ldifcfg[] = {
65 { "directory", "dir", 2, 2, 0, ARG_BERVAL|ARG_OFFSET,
66 (void *)offsetof(struct ldif_info, li_base_path),
67 "( OLcfgDbAt:0.1 NAME 'olcDbDirectory' "
68 "DESC 'Directory for database content' "
69 "EQUALITY caseIgnoreMatch "
70 "SYNTAX OMsDirectoryString )", NULL, NULL },
71 { NULL, NULL, 0, 0, 0, ARG_IGNORED,
72 NULL, NULL, NULL, NULL }
75 static ConfigOCs ldifocs[] = {
77 "NAME 'olcLdifConfig' "
78 "DESC 'LDIF backend configuration' "
79 "SUP olcDatabaseConfig "
80 "MUST ( olcDbDirectory ) )", Cft_Database, ldifcfg },
85 dn2path(struct berval * dn, struct berval * suffixdn, struct berval * base_path,
88 char *ptr, *sep, *end;
91 assert( !BER_BVISNULL( dn ) );
92 assert( suffixdn != NULL );
93 assert( !BER_BVISNULL( suffixdn ) );
94 assert( dnIsSuffix( dn, suffixdn ) );
96 res->bv_len = dn->bv_len + base_path->bv_len + 1 + STRLENOF( LDIF );
97 res->bv_val = ch_malloc( res->bv_len + 1 );
98 ptr = lutil_strcopy( res->bv_val, base_path->bv_val );
99 *ptr++ = LDAP_DIRSEP[0];
100 ptr = lutil_strcopy( ptr, suffixdn->bv_val );
101 end = dn->bv_val + dn->bv_len - suffixdn->bv_len - 1;
102 while ( end > dn->bv_val ) {
103 for (sep = end-1; sep >=dn->bv_val && !DN_SEPARATOR( *sep ); sep--);
104 *ptr++ = LDAP_DIRSEP[0];
105 ptr = lutil_strncopy( ptr, sep+1, end-sep-1 );
111 while( ptr=strchr(ptr, IX_DNL) ) {
113 ptr = strchr(ptr, IX_DNR);
122 static char * slurp_file(int fd) {
123 int read_chars_total = 0;
131 entry_size = st.st_size;
132 entry = ch_malloc( entry_size+1 );
136 read_chars = read(fd, (void *) entry_pos, entry_size - read_chars_total);
137 if(read_chars == -1) {
141 if(read_chars == 0) {
142 entry[read_chars_total] = '\0';
146 read_chars_total += read_chars;
147 entry_pos += read_chars;
153 static int spew_file(int fd, char * spew, int len) {
157 writeres = write(fd, spew, len);
159 Debug( LDAP_DEBUG_ANY, "could not spew write: %s\n",
160 strerror( errno ), 0, 0 );
171 static int spew_entry(Entry * e, struct berval * path) {
176 char * entry_as_string;
178 openres = open(path->bv_val, O_WRONLY|O_CREAT|O_TRUNC, S_IRUSR | S_IWUSR);
181 rs = LDAP_NO_SUCH_OBJECT;
183 rs = LDAP_UNWILLING_TO_PERFORM;
184 Debug( LDAP_DEBUG_ANY, "could not open \"%s\": %s\n",
185 path->bv_val, strerror( errno ), 0 );
191 /* Only save the RDN onto disk */
192 dnRdn( &e->e_name, &rdn );
193 if ( rdn.bv_len != e->e_name.bv_len ) {
194 e->e_name.bv_val[rdn.bv_len] = '\0';
195 tmp = e->e_name.bv_len;
196 e->e_name.bv_len = rdn.bv_len;
200 entry_as_string = entry2str(e, &entry_length);
202 /* Restore full DN */
203 if ( rdn.bv_len != e->e_name.bv_len ) {
204 e->e_name.bv_val[e->e_name.bv_len] = ',';
205 e->e_name.bv_len = rdn.bv_len;
208 if(entry_as_string == NULL) {
209 rs = LDAP_UNWILLING_TO_PERFORM;
213 spew_res = spew_file(openres, entry_as_string, entry_length);
216 rs = LDAP_UNWILLING_TO_PERFORM;
224 static Entry * get_entry_for_fd(int fd,
228 char * entry = (char *) slurp_file(fd);
229 Entry * ldentry = NULL;
231 /* error reading file */
236 ldentry = str2entry(entry);
239 rdn = ldentry->e_name;
240 build_new_dn( &ldentry->e_name, pdn, &rdn, NULL );
241 ch_free( rdn.bv_val );
242 rdn = ldentry->e_nname;
243 build_new_dn( &ldentry->e_nname, pndn, &rdn, NULL );
244 ch_free( rdn.bv_val );
258 static Entry * get_entry(Operation *op, struct berval *base_path) {
259 struct berval path, pdn, pndn;
262 dnParent(&op->o_req_dn, &pdn);
263 dnParent(&op->o_req_ndn, &pndn);
264 dn2path(&op->o_req_ndn, op->o_bd->be_nsuffix, base_path, &path);
265 fd = open(path.bv_val, O_RDONLY);
266 /* error opening file (mebbe should log error) */
268 Debug(LDAP_DEBUG_ANY, "failed to open file \"%s\": %s\n",
269 path.bv_val, strerror(errno), 0 );
272 if(path.bv_val != NULL)
273 SLAP_FREE(path.bv_val);
276 return get_entry_for_fd(fd, &pdn, &pndn);
282 static void fullpath(struct berval *base, struct berval *name, struct berval *res) {
284 res->bv_len = name->bv_len + base->bv_len + 1;
285 res->bv_val = ch_malloc( res->bv_len + 1 );
286 strcpy(res->bv_val, base->bv_val);
287 ptr = res->bv_val + base->bv_len;
288 *ptr++ = LDAP_DIRSEP[0];
289 strcpy(ptr, name->bv_val);
292 typedef struct bvlist {
301 static int r_enum_tree(enumCookie *ck, struct berval *path,
302 struct berval *pdn, struct berval *pndn)
305 int fd, rc = LDAP_SUCCESS;
307 fd = open( path->bv_val, O_RDONLY );
309 Debug( LDAP_DEBUG_ANY,
310 "=> ldif_enum_tree: failed to open %s: %s\n",
311 path->bv_val, strerror(errno), 0 );
312 return LDAP_NO_SUCH_OBJECT;
315 e = get_entry_for_fd(fd, pdn, pndn);
317 Debug( LDAP_DEBUG_ANY,
318 "=> ldif_enum_tree: failed to read entry for %s\n",
319 path->bv_val, 0, 0 );
323 if ( ck->op->ors_scope == LDAP_SCOPE_BASE ||
324 ck->op->ors_scope == LDAP_SCOPE_SUBTREE ) {
325 /* Send right away? */
328 * if it's a referral, add it to the list of referrals. only do
329 * this for non-base searches, and don't check the filter
330 * explicitly here since it's only a candidate anyway.
332 if ( !get_manageDSAit( ck->op )
333 && ck->op->ors_scope != LDAP_SCOPE_BASE
334 && is_entry_referral( e ) )
336 BerVarray erefs = get_entry_referrals( ck->op, e );
337 ck->rs->sr_ref = referral_rewrite( erefs,
339 ck->op->oq_search.rs_scope == LDAP_SCOPE_ONELEVEL
340 ? LDAP_SCOPE_BASE : LDAP_SCOPE_SUBTREE );
342 ck->rs->sr_entry = e;
343 rc = send_search_reference( ck->op, ck->rs );
344 ber_bvarray_free( ck->rs->sr_ref );
345 ber_bvarray_free( erefs );
346 ck->rs->sr_ref = NULL;
347 ck->rs->sr_entry = NULL;
349 } else if ( test_filter( ck->op, e, ck->op->ors_filter ) == LDAP_COMPARE_TRUE )
351 ck->rs->sr_entry = e;
352 ck->rs->sr_attrs = ck->op->ors_attrs;
353 ck->rs->sr_flags = REP_ENTRY_MODIFIABLE;
354 rc = send_search_entry(ck->op, ck->rs);
355 ck->rs->sr_entry = NULL;
361 /* Queueing up for tool mode */
362 if(ck->entries == NULL) {
363 ck->entries = (Entry **) ch_malloc(sizeof(Entry *) * ENTRY_BUFF_INCREMENT);
364 ck->elen = ENTRY_BUFF_INCREMENT;
366 if(ck->eind >= ck->elen) { /* grow entries if necessary */
367 ck->entries = (Entry **) ch_realloc(ck->entries, sizeof(Entry *) * (ck->elen) * 2);
371 ck->entries[ck->eind++] = e;
378 if ( ck->op->ors_scope != LDAP_SCOPE_BASE ) {
380 bvlist *list = NULL, *ptr;
382 path->bv_len -= STRLENOF( LDIF );
383 path->bv_val[path->bv_len] = '\0';
385 dir_of_path = opendir(path->bv_val);
386 if(dir_of_path == NULL) { /* can't open directory */
387 if ( errno != ENOENT ) {
388 /* it shouldn't be treated as an error
389 * only if the directory doesn't exist */
391 Debug( LDAP_DEBUG_ANY,
392 "=> ldif_enum_tree: failed to opendir %s (%d)\n",
393 path->bv_val, errno, 0 );
399 struct berval fname, itmp;
403 dir = readdir(dir_of_path);
404 if(dir == NULL) break; /* end of the directory */
405 fname.bv_len = strlen( dir->d_name );
406 if ( fname.bv_len <= STRLENOF( LDIF ))
408 if ( strcmp( dir->d_name + (fname.bv_len - STRLENOF(LDIF)), LDIF))
410 fname.bv_val = dir->d_name;
412 bvl = ch_malloc( sizeof(bvlist) );
413 ber_dupbv( &bvl->bv, &fname );
414 BER_BVZERO( &bvl->num );
415 itmp.bv_val = strchr( bvl->bv.bv_val, IX_FSL );
419 ptr = strchr( itmp.bv_val, IX_FSR );
421 itmp.bv_len = ptr - itmp.bv_val;
422 ber_dupbv( &bvl->num, &itmp );
423 bvl->inum = strtoul( itmp.bv_val, NULL, 0 );
424 itmp.bv_val[0] = '\0';
425 bvl->off = itmp.bv_val - bvl->bv.bv_val;
429 for (prev = &list; (ptr = *prev) != NULL; prev = &ptr->next) {
430 int cmp = strcmp( bvl->bv.bv_val, ptr->bv.bv_val );
431 if ( !cmp && bvl->num.bv_val )
432 cmp = bvl->inum - ptr->inum;
440 closedir(dir_of_path);
442 if (ck->op->ors_scope == LDAP_SCOPE_ONELEVEL)
443 ck->op->ors_scope = LDAP_SCOPE_BASE;
444 else if ( ck->op->ors_scope == LDAP_SCOPE_SUBORDINATE)
445 ck->op->ors_scope = LDAP_SCOPE_SUBTREE;
447 while ( ( ptr = list ) ) {
452 if ( rc == LDAP_SUCCESS ) {
453 if ( ptr->num.bv_val )
454 AC_MEMCPY( ptr->bv.bv_val + ptr->off, ptr->num.bv_val,
456 fullpath( path, &ptr->bv, &fpath );
457 rc = r_enum_tree(ck, &fpath, &e->e_name, &e->e_nname );
460 if ( ptr->num.bv_val )
461 free( ptr->num.bv_val );
462 free(ptr->bv.bv_val);
467 if ( fd ) entry_free( e );
476 struct ldif_info *ni = (struct ldif_info *) ck->op->o_bd->be_private;
478 struct berval pdn, pndn;
481 dnParent( &ck->op->o_req_dn, &pdn );
482 dnParent( &ck->op->o_req_ndn, &pndn );
483 dn2path( &ck->op->o_req_ndn, &ck->op->o_bd->be_nsuffix[0], &ni->li_base_path, &path);
484 rc = r_enum_tree(ck, &path, &pdn, &pndn);
485 ch_free( path.bv_val );
489 /* Get the parent path plus the LDIF suffix */
490 static void get_parent_path(struct berval * dnpath, struct berval *res) {
491 int dnpathlen = dnpath->bv_len;
494 for(i = dnpathlen;i>0;i--) /* find the first path seperator */
495 if(dnpath->bv_val[i] == LDAP_DIRSEP[0])
498 res->bv_val = ch_malloc( res->bv_len + 1 + STRLENOF(LDIF) );
499 strncpy(res->bv_val, dnpath->bv_val, i);
500 strcpy(res->bv_val+i, LDIF);
501 res->bv_val[i] = '\0';
504 static int apply_modify_to_entry(Entry * entry,
505 Modifications * modlist,
509 char textbuf[SLAP_TEXT_BUFLEN];
510 int rc = LDAP_UNWILLING_TO_PERFORM;
511 Modification *mods = NULL;
513 if (!acl_check_modlist(op, entry, modlist)) {
514 return LDAP_INSUFFICIENT_ACCESS;
517 for (; modlist != NULL; modlist = modlist->sml_next) {
518 mods = &modlist->sml_mod;
520 switch (mods->sm_op) {
522 rc = modify_add_values(entry, mods,
523 get_permissiveModify(op),
524 &rs->sr_text, textbuf,
528 case LDAP_MOD_DELETE:
529 rc = modify_delete_values(entry, mods,
530 get_permissiveModify(op),
531 &rs->sr_text, textbuf,
535 case LDAP_MOD_REPLACE:
536 rc = modify_replace_values(entry, mods,
537 get_permissiveModify(op),
538 &rs->sr_text, textbuf,
542 case LDAP_MOD_INCREMENT:
543 rc = modify_increment_values( entry,
544 mods, get_permissiveModify(op),
545 &rs->sr_text, textbuf,
551 case SLAP_MOD_SOFTADD:
552 mods->sm_op = LDAP_MOD_ADD;
553 rc = modify_add_values(entry, mods,
554 get_permissiveModify(op),
555 &rs->sr_text, textbuf,
557 mods->sm_op = SLAP_MOD_SOFTADD;
558 if (rc == LDAP_TYPE_OR_VALUE_EXISTS) {
565 if(rc != LDAP_SUCCESS) break;
568 if(rc == LDAP_SUCCESS) {
569 if ( mods->sm_desc == slap_schema.si_ad_objectClass ) {
570 entry->e_ocflags = 0;
572 /* check that the entry still obeys the schema */
573 rc = entry_schema_check(op, entry, NULL, 0,
574 &rs->sr_text, textbuf, sizeof( textbuf ) );
580 ldif_back_referrals( Operation *op, SlapReply *rs )
582 struct ldif_info *ni = NULL;
584 int rc = LDAP_SUCCESS;
587 if ( op->o_tag == LDAP_REQ_SEARCH ) {
588 /* let search take care of itself */
593 if ( get_manageDSAit( op ) ) {
594 /* let op take care of DSA management */
598 ni = (struct ldif_info *)op->o_bd->be_private;
599 ldap_pvt_thread_mutex_lock( &ni->li_mutex );
600 entry = (Entry *)get_entry( op, &ni->li_base_path );
602 /* no object is found for them */
603 if ( entry == NULL ) {
604 struct berval odn = op->o_req_dn;
605 struct berval ondn = op->o_req_ndn;
607 struct berval pndn = op->o_req_ndn;
609 for ( ; entry == NULL; ) {
610 dnParent( &pndn, &pndn );
612 if ( !dnIsSuffix( &pndn, &op->o_bd->be_nsuffix[0] ) ) {
617 op->o_req_ndn = pndn;
619 entry = (Entry *)get_entry( op, &ni->li_base_path );
622 ldap_pvt_thread_mutex_unlock( &ni->li_mutex );
625 op->o_req_ndn = ondn;
628 rs->sr_matched = NULL;
629 if ( entry != NULL ) {
630 Debug( LDAP_DEBUG_TRACE,
631 "ldif_back_referrals: op=%ld target=\"%s\" matched=\"%s\"\n",
632 (long) op->o_tag, op->o_req_dn.bv_val, entry->e_name.bv_val );
634 if ( is_entry_referral( entry ) ) {
636 rs->sr_ref = get_entry_referrals( op, entry );
638 rs->sr_matched = ber_strdup_x(
639 entry->e_name.bv_val, op->o_tmpmemctx );
645 } else if ( default_referral != NULL ) {
647 rs->sr_ref = referral_rewrite( default_referral,
648 NULL, &op->o_req_dn, LDAP_SCOPE_DEFAULT );
651 if ( rs->sr_ref != NULL ) {
653 rc = rs->sr_err = LDAP_REFERRAL;
654 send_ldap_result( op, rs );
655 ber_bvarray_free( rs->sr_ref );
658 } else if ( rc != LDAP_SUCCESS ) {
660 rs->sr_text = rs->sr_matched ? "bad referral object" : NULL;
661 send_ldap_result( op, rs );
664 if ( rs->sr_matched ) {
665 op->o_tmpfree( (char *)rs->sr_matched, op->o_tmpmemctx );
666 rs->sr_matched = NULL;
672 ldap_pvt_thread_mutex_unlock( &ni->li_mutex );
674 if ( is_entry_referral( entry ) ) {
675 /* entry is a referral */
676 BerVarray refs = get_entry_referrals( op, entry );
677 rs->sr_ref = referral_rewrite(
678 refs, &entry->e_name, &op->o_req_dn, LDAP_SCOPE_DEFAULT );
680 Debug( LDAP_DEBUG_TRACE,
681 "ldif_back_referrals: op=%ld target=\"%s\" matched=\"%s\"\n",
682 (long) op->o_tag, op->o_req_dn.bv_val, entry->e_name.bv_val );
684 rs->sr_matched = entry->e_name.bv_val;
685 if ( rs->sr_ref != NULL ) {
686 rc = rs->sr_err = LDAP_REFERRAL;
687 send_ldap_result( op, rs );
688 ber_bvarray_free( rs->sr_ref );
692 send_ldap_error( op, rs, LDAP_OTHER, "bad referral object" );
696 rs->sr_matched = NULL;
697 ber_bvarray_free( refs );
706 ldif_back_bind( Operation *op, SlapReply *rs )
708 struct ldif_info *ni = NULL;
709 Attribute * a = NULL;
710 AttributeDescription *password = slap_schema.si_ad_userPassword;
712 Entry * entry = NULL;
714 ni = (struct ldif_info *) op->o_bd->be_private;
715 ldap_pvt_thread_mutex_lock(&ni->li_mutex);
716 entry = (Entry *) get_entry(op, &ni->li_base_path);
718 /* no object is found for them */
720 if(be_isroot_pw(op)) {
721 rs->sr_err = return_val = LDAP_SUCCESS;
723 rs->sr_err = return_val = LDAP_INVALID_CREDENTIALS;
728 /* they don't have userpassword */
729 if((a = attr_find(entry->e_attrs, password)) == NULL) {
730 rs->sr_err = LDAP_INAPPROPRIATE_AUTH;
735 /* authentication actually failed */
736 if(slap_passwd_check(op, entry, a, &op->oq_bind.rb_cred,
737 &rs->sr_text) != 0) {
738 rs->sr_err = LDAP_INVALID_CREDENTIALS;
743 /* let the front-end send success */
748 ldap_pvt_thread_mutex_unlock(&ni->li_mutex);
750 send_ldap_result( op, rs );
756 static int ldif_back_search(Operation *op, SlapReply *rs)
758 struct ldif_info *ni = (struct ldif_info *) op->o_bd->be_private;
759 enumCookie ck = { NULL, NULL, NULL, 0, 0 };
763 ldap_pvt_thread_mutex_lock(&ni->li_mutex);
764 rs->sr_err = enum_tree( &ck );
765 ldap_pvt_thread_mutex_unlock(&ni->li_mutex);
766 send_ldap_result(op, rs);
771 static int ldif_back_add(Operation *op, SlapReply *rs) {
772 struct ldif_info *ni = (struct ldif_info *) op->o_bd->be_private;
773 Entry * e = op->ora_e;
774 struct berval dn = e->e_nname;
775 struct berval leaf_path = BER_BVNULL;
778 char textbuf[SLAP_TEXT_BUFLEN];
780 Debug( LDAP_DEBUG_TRACE, "ldif_back_add: \"%s\"\n", dn.bv_val, 0, 0);
781 slap_add_opattrs( op, &rs->sr_text, textbuf, sizeof( textbuf ), 1 );
783 rs->sr_err = entry_schema_check(op, e, NULL, 0,
784 &rs->sr_text, textbuf, sizeof( textbuf ) );
785 if ( rs->sr_err != LDAP_SUCCESS ) goto send_res;
787 ldap_pvt_thread_mutex_lock(&ni->li_mutex);
789 dn2path(&dn, &op->o_bd->be_nsuffix[0], &ni->li_base_path, &leaf_path);
791 if(leaf_path.bv_val != NULL) {
792 struct berval base = BER_BVNULL;
793 /* build path to container and ldif of container */
794 get_parent_path(&leaf_path, &base);
796 statres = stat(base.bv_val, &stats); /* check if container exists */
797 if(statres == -1 && errno == ENOENT) { /* container missing */
798 base.bv_val[base.bv_len] = '.';
799 statres = stat(base.bv_val, &stats); /* check for leaf node */
800 base.bv_val[base.bv_len] = '\0';
801 if(statres == -1 && errno == ENOENT) {
802 rs->sr_err = LDAP_NO_SUCH_OBJECT; /* parent doesn't exist */
803 rs->sr_text = "Parent does not exist";
805 else if(statres != -1) { /* create parent */
806 int mkdirres = mkdir(base.bv_val, 0750);
808 rs->sr_err = LDAP_UNWILLING_TO_PERFORM;
809 rs->sr_text = "Could not create parent folder";
810 Debug( LDAP_DEBUG_ANY, "could not create folder \"%s\": %s\n",
811 base.bv_val, strerror( errno ), 0 );
815 rs->sr_err = LDAP_UNWILLING_TO_PERFORM;
816 }/* container was possibly created, move on to add the entry */
817 if(rs->sr_err == LDAP_SUCCESS) {
818 statres = stat(leaf_path.bv_val, &stats);
819 if(statres == -1 && errno == ENOENT) {
820 ldap_pvt_thread_mutex_lock(&entry2str_mutex);
821 rs->sr_err = (int) spew_entry(e, &leaf_path);
822 ldap_pvt_thread_mutex_unlock(&entry2str_mutex);
824 else if ( statres == -1 ) {
825 rs->sr_err = LDAP_UNWILLING_TO_PERFORM;
826 Debug( LDAP_DEBUG_ANY, "could not stat file \"%s\": %s\n",
827 leaf_path.bv_val, strerror( errno ), 0 );
829 else /* it already exists */
830 rs->sr_err = LDAP_ALREADY_EXISTS;
832 SLAP_FREE(base.bv_val);
833 SLAP_FREE(leaf_path.bv_val);
836 ldap_pvt_thread_mutex_unlock(&ni->li_mutex);
839 Debug( LDAP_DEBUG_TRACE,
840 "ldif_back_add: err: %d text: %s\n", rs->sr_err, rs->sr_text, 0);
841 send_ldap_result(op, rs);
842 slap_graduate_commit_csn( op );
846 static int ldif_back_modify(Operation *op, SlapReply *rs) {
847 struct ldif_info *ni = (struct ldif_info *) op->o_bd->be_private;
848 Modifications * modlst = op->orm_modlist;
849 struct berval path = BER_BVNULL;
850 Entry * entry = NULL;
853 slap_mods_opattrs( op, &op->orm_modlist, 1 );
855 ldap_pvt_thread_mutex_lock(&ni->li_mutex);
856 dn2path(&op->o_req_ndn, &op->o_bd->be_nsuffix[0], &ni->li_base_path,
858 entry = (Entry *) get_entry(op, &ni->li_base_path);
861 rs->sr_err = apply_modify_to_entry(entry, modlst, op, rs);
862 if(rs->sr_err == LDAP_SUCCESS) {
864 ldap_pvt_thread_mutex_lock(&entry2str_mutex);
865 spew_res = spew_entry(entry, &path);
867 ldap_pvt_thread_mutex_unlock(&entry2str_mutex);
869 Debug( LDAP_DEBUG_ANY,
870 "%s ldif_back_modify: could not output entry \"%s\": %s\n",
871 op->o_log_prefix, entry->e_name.bv_val, strerror( save_errno ) );
872 rs->sr_err = LDAP_UNWILLING_TO_PERFORM;
877 rs->sr_err = LDAP_NO_SUCH_OBJECT;
882 if(path.bv_val != NULL)
883 SLAP_FREE(path.bv_val);
885 ldap_pvt_thread_mutex_unlock(&ni->li_mutex);
886 send_ldap_result(op, rs);
887 slap_graduate_commit_csn( op );
891 static int ldif_back_delete(Operation *op, SlapReply *rs) {
892 struct ldif_info *ni = (struct ldif_info *) op->o_bd->be_private;
893 struct berval path = BER_BVNULL;
896 if ( BER_BVISEMPTY( &op->o_csn )) {
898 char csnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
901 csn.bv_len = sizeof( csnbuf );
902 slap_get_csn( op, &csn, 1 );
905 ldap_pvt_thread_mutex_lock(&ni->li_mutex);
906 dn2path(&op->o_req_ndn, &op->o_bd->be_nsuffix[0], &ni->li_base_path, &path);
908 path.bv_val[path.bv_len - STRLENOF(LDIF)] = '\0';
909 res = rmdir(path.bv_val);
910 path.bv_val[path.bv_len - STRLENOF(LDIF)] = '.';
911 if ( res && errno != ENOENT ) {
912 rs->sr_err = LDAP_NOT_ALLOWED_ON_NONLEAF;
914 res = unlink(path.bv_val);
919 rs->sr_err = LDAP_NO_SUCH_OBJECT;
921 rs->sr_err = LDAP_UNWILLING_TO_PERFORM;
924 rs->sr_err = LDAP_SUCCESS;
926 SLAP_FREE(path.bv_val);
927 ldap_pvt_thread_mutex_unlock(&ni->li_mutex);
928 send_ldap_result(op, rs);
929 slap_graduate_commit_csn( op );
934 static int move_entry(Entry * entry, struct berval * ndn,
935 struct berval * newndn, struct berval * suffixdn,
936 struct berval * base_path) {
940 struct berval newpath;
942 dn2path(ndn, suffixdn, base_path, &path);
943 dn2path(newndn, suffixdn, base_path, &newpath);
945 if((entry == NULL || path.bv_val == NULL) || newpath.bv_val == NULL) {
946 /* some object doesn't exist */
947 res = LDAP_NO_SUCH_OBJECT;
949 else { /* do the modrdn */
950 exists_res = open(newpath.bv_val, O_RDONLY);
951 if(exists_res == -1 && errno == ENOENT) {
952 res = spew_entry(entry, &newpath);
954 /* if this fails we should log something bad */
955 res = unlink(path.bv_val);
960 res = LDAP_NO_SUCH_OBJECT;
962 res = LDAP_UNWILLING_TO_PERFORM;
963 unlink(newpath.bv_val); /* in case file was created */
966 else if(exists_res) {
967 int close_res = close(exists_res);
968 res = LDAP_ALREADY_EXISTS;
969 if(close_res == -1) {
970 /* log heinous error */
974 res = LDAP_UNWILLING_TO_PERFORM;
978 if(newpath.bv_val != NULL)
979 SLAP_FREE(newpath.bv_val);
980 if(path.bv_val != NULL)
981 SLAP_FREE(path.bv_val);
986 ldif_back_modrdn(Operation *op, SlapReply *rs)
988 struct ldif_info *ni = (struct ldif_info *) op->o_bd->be_private;
989 struct berval new_dn = BER_BVNULL, new_ndn = BER_BVNULL;
991 Entry * entry = NULL;
994 slap_mods_opattrs( op, &op->orr_modlist, 1 );
996 ldap_pvt_thread_mutex_lock( &ni->li_mutex );
997 ldap_pvt_thread_mutex_lock( &entry2str_mutex );
998 entry = (Entry *) get_entry( op, &ni->li_base_path );
1000 /* build the mods to the entry */
1001 if ( entry != NULL ) {
1002 /* build new dn, and new ndn for the entry */
1003 if ( op->oq_modrdn.rs_newSup != NULL ) {
1005 p_dn = *op->oq_modrdn.rs_newSup;
1007 p_dn = slap_empty_bv;
1009 dnParent( &entry->e_name, &p_dn );
1010 build_new_dn( &new_dn, &p_dn, &op->oq_modrdn.rs_newrdn, NULL );
1011 dnNormalize( 0, NULL, NULL, &new_dn, &new_ndn, NULL );
1012 ber_memfree_x( entry->e_name.bv_val, NULL );
1013 ber_memfree_x( entry->e_nname.bv_val, NULL );
1014 entry->e_name = new_dn;
1015 entry->e_nname = new_ndn;
1017 /* perform the modifications */
1018 res = apply_modify_to_entry( entry, op->orr_modlist, op, rs );
1019 if ( res == LDAP_SUCCESS ) {
1020 rs->sr_err = move_entry( entry, &op->o_req_ndn,
1022 &op->o_bd->be_nsuffix[0],
1023 &ni->li_base_path );
1028 /* entry was null */
1029 rs->sr_err = LDAP_NO_SUCH_OBJECT;
1032 if ( entry != NULL ) {
1033 entry_free( entry );
1036 ldap_pvt_thread_mutex_unlock( &ni->li_mutex );
1037 ldap_pvt_thread_mutex_unlock( &entry2str_mutex );
1038 send_ldap_result( op, rs );
1039 slap_graduate_commit_csn( op );
1043 /* return LDAP_SUCCESS IFF we can retrieve the specified entry.
1045 int ldif_back_entry_get(
1049 AttributeDescription *at,
1053 struct ldif_info *ni = (struct ldif_info *) op->o_bd->be_private;
1054 struct berval op_dn = op->o_req_dn, op_ndn = op->o_req_ndn;
1056 assert( ndn != NULL );
1057 assert( !BER_BVISNULL( ndn ) );
1059 ldap_pvt_thread_mutex_lock( &ni->li_mutex );
1060 op->o_req_dn = *ndn;
1061 op->o_req_ndn = *ndn;
1062 *ent = (Entry *) get_entry( op, &ni->li_base_path );
1063 op->o_req_dn = op_dn;
1064 op->o_req_ndn = op_ndn;
1065 ldap_pvt_thread_mutex_unlock( &ni->li_mutex );
1067 if ( *ent && oc && !is_entry_objectclass_or_sub( *ent, oc ) ) {
1072 return ( *ent == NULL ? 1 : 0 );
1075 static int ldif_tool_entry_open(BackendDB * be, int mode) {
1076 struct ldif_info *ni = (struct ldif_info *) be->be_private;
1077 ni->li_tool_current = 0;
1081 static int ldif_tool_entry_close(BackendDB * be) {
1082 struct ldif_info *ni = (struct ldif_info *) be->be_private;
1084 SLAP_FREE(ni->li_tool_cookie.entries);
1089 ldif_tool_entry_first(BackendDB *be)
1091 struct ldif_info *ni = (struct ldif_info *) be->be_private;
1092 ID id = 1; /* first entry in the array of entries shifted by one */
1094 ni->li_tool_current = 1;
1095 if(ni->li_tool_cookie.entries == NULL) {
1099 op.o_req_dn = *be->be_suffix;
1100 op.o_req_ndn = *be->be_nsuffix;
1101 op.ors_scope = LDAP_SCOPE_SUBTREE;
1102 ni->li_tool_cookie.op = &op;
1103 (void)enum_tree( &ni->li_tool_cookie );
1104 ni->li_tool_cookie.op = NULL;
1109 static ID ldif_tool_entry_next(BackendDB *be)
1111 struct ldif_info *ni = (struct ldif_info *) be->be_private;
1112 ni->li_tool_current += 1;
1113 if(ni->li_tool_current > ni->li_tool_cookie.eind)
1116 return ni->li_tool_current;
1119 static Entry * ldif_tool_entry_get(BackendDB * be, ID id) {
1120 struct ldif_info *ni = (struct ldif_info *) be->be_private;
1123 if(id > ni->li_tool_cookie.eind || id < 1)
1126 e = ni->li_tool_cookie.entries[id - 1];
1127 ni->li_tool_cookie.entries[id - 1] = NULL;
1132 static ID ldif_tool_entry_put(BackendDB * be, Entry * e, struct berval *text) {
1133 struct ldif_info *ni = (struct ldif_info *) be->be_private;
1134 struct berval dn = e->e_nname;
1135 struct berval leaf_path = BER_BVNULL;
1138 int res = LDAP_SUCCESS;
1140 dn2path(&dn, &be->be_nsuffix[0], &ni->li_base_path, &leaf_path);
1142 if(leaf_path.bv_val != NULL) {
1143 struct berval base = BER_BVNULL;
1144 /* build path to container, and path to ldif of container */
1145 get_parent_path(&leaf_path, &base);
1147 statres = stat(base.bv_val, &stats); /* check if container exists */
1148 if(statres == -1 && errno == ENOENT) { /* container missing */
1149 base.bv_val[base.bv_len] = '.';
1150 statres = stat(base.bv_val, &stats); /* check for leaf node */
1151 base.bv_val[base.bv_len] = '\0';
1152 if(statres == -1 && errno == ENOENT) {
1153 res = LDAP_NO_SUCH_OBJECT; /* parent doesn't exist */
1155 else if(statres != -1) { /* create parent */
1156 int mkdirres = mkdir(base.bv_val, 0750);
1157 if(mkdirres == -1) {
1158 res = LDAP_UNWILLING_TO_PERFORM;
1162 res = LDAP_UNWILLING_TO_PERFORM;
1163 }/* container was possibly created, move on to add the entry */
1164 if(res == LDAP_SUCCESS) {
1165 statres = stat(leaf_path.bv_val, &stats);
1166 if(statres == -1 && errno == ENOENT) {
1167 res = (int) spew_entry(e, &leaf_path);
1169 else /* it already exists */
1170 res = LDAP_ALREADY_EXISTS;
1172 SLAP_FREE(base.bv_val);
1173 SLAP_FREE(leaf_path.bv_val);
1176 if(res == LDAP_SUCCESS) {
1184 ldif_back_db_init( BackendDB *be )
1186 struct ldif_info *ni;
1188 ni = ch_calloc( 1, sizeof(struct ldif_info) );
1189 be->be_private = ni;
1190 be->be_cf_ocs = ldifocs;
1191 ldap_pvt_thread_mutex_init(&ni->li_mutex);
1196 ldif_back_db_destroy(
1200 struct ldif_info *ni = be->be_private;
1202 ch_free(ni->li_base_path.bv_val);
1203 ldap_pvt_thread_mutex_destroy(&ni->li_mutex);
1204 free( be->be_private );
1213 struct ldif_info *ni = (struct ldif_info *) be->be_private;
1214 if( BER_BVISEMPTY(&ni->li_base_path)) {/* missing base path */
1215 Debug( LDAP_DEBUG_ANY, "missing base path for back-ldif\n", 0, 0, 0);
1222 ldif_back_initialize(
1226 static char *controls[] = {
1227 LDAP_CONTROL_MANAGEDSAIT,
1233 SLAP_BFLAG_INCREMENT |
1234 SLAP_BFLAG_REFERRALS;
1236 bi->bi_controls = controls;
1243 bi->bi_db_init = ldif_back_db_init;
1244 bi->bi_db_config = config_generic_wrapper;
1245 bi->bi_db_open = ldif_back_db_open;
1246 bi->bi_db_close = 0;
1247 bi->bi_db_destroy = ldif_back_db_destroy;
1249 bi->bi_op_bind = ldif_back_bind;
1250 bi->bi_op_unbind = 0;
1251 bi->bi_op_search = ldif_back_search;
1252 bi->bi_op_compare = 0;
1253 bi->bi_op_modify = ldif_back_modify;
1254 bi->bi_op_modrdn = ldif_back_modrdn;
1255 bi->bi_op_add = ldif_back_add;
1256 bi->bi_op_delete = ldif_back_delete;
1257 bi->bi_op_abandon = 0;
1259 bi->bi_extended = 0;
1261 bi->bi_chk_referrals = ldif_back_referrals;
1263 bi->bi_connection_init = 0;
1264 bi->bi_connection_destroy = 0;
1266 bi->bi_entry_get_rw = ldif_back_entry_get;
1268 #if 0 /* NOTE: uncomment to completely disable access control */
1269 bi->bi_access_allowed = slap_access_always_allowed;
1272 bi->bi_tool_entry_open = ldif_tool_entry_open;
1273 bi->bi_tool_entry_close = ldif_tool_entry_close;
1274 bi->bi_tool_entry_first = ldif_tool_entry_first;
1275 bi->bi_tool_entry_next = ldif_tool_entry_next;
1276 bi->bi_tool_entry_get = ldif_tool_entry_get;
1277 bi->bi_tool_entry_put = ldif_tool_entry_put;
1278 bi->bi_tool_entry_reindex = 0;
1279 bi->bi_tool_sync = 0;
1281 bi->bi_tool_dn2id_get = 0;
1282 bi->bi_tool_id2entry_get = 0;
1283 bi->bi_tool_entry_modify = 0;
1285 bi->bi_cf_ocs = ldifocs;
1287 rc = config_register_schema( ldifcfg, ldifocs );
1288 if ( rc ) return rc;