1 /* id2entry.c - routines to deal with the id2entry database */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
5 * Copyright 2000-2017 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>.
20 #include <ac/string.h>
25 typedef struct Ecount {
26 ber_len_t len; /* total entry size */
27 ber_len_t dlen; /* contiguous data size */
34 static int mdb_entry_partsize(struct mdb_info *mdb, MDB_txn *txn, Entry *e,
36 static int mdb_entry_encode(Operation *op, Entry *e, MDB_val *data,
38 static Entry *mdb_entry_alloc( Operation *op, int nattrs, int nvals );
40 #define ID2VKSZ (sizeof(ID)+2)
44 const MDB_val *usrkey,
48 unsigned short *uv, *cv;
52 memcpy(&ui, usrkey->mv_data, sizeof(ID));
53 memcpy(&ci, curkey->mv_data, sizeof(ID));
60 return uv[sizeof(ID)/2] - cv[sizeof(ID)/2];
63 /* usrkey[0] is the key in DB format, as described at mdb_mval_put.
64 * usrkey[1] is the value we'll actually match against.
65 * usrkey[2] is the attributeDescription for this value.
69 const MDB_val *usrkey,
73 AttributeDescription *ad = usrkey[2].mv_data;
74 struct berval bv1, bv2;
79 ptr = curkey->mv_data + curkey->mv_size - 2;
81 bv2.bv_val = curkey->mv_data;
82 bv2.bv_len = curkey->mv_size - 3;
86 bv1.bv_val = usrkey[1].mv_data;
87 bv1.bv_len = usrkey[1].mv_size;
90 MatchingRule *mr = ad->ad_type->sat_equality;
91 rc = mr->smr_match(&match, SLAP_MR_EQUALITY
92 | SLAP_MR_VALUE_OF_ASSERTION_SYNTAX
93 | SLAP_MR_ASSERTED_VALUE_NORMALIZED_MATCH
94 | SLAP_MR_ATTRIBUTE_VALUE_NORMALIZED_MATCH,
95 ad->ad_type->sat_syntax, mr, &bv1, &bv2);
97 match = ber_bvcmp(&bv1, &bv2);
103 /* Values are stored as
104 * [normalized-value NUL ] original-value NUL 2-byte-len
105 * The trailing 2-byte-len is zero if there is no normalized value.
106 * Otherwise, it is the length of the original-value.
108 int mdb_mval_put(Operation *op, MDB_cursor *mc, ID id, Attribute *a)
110 struct mdb_info *mdb = (struct mdb_info *) op->o_bd->be_private;
111 MDB_val key, data[3];
118 memcpy(ivk, &id, sizeof(id));
119 s = mdb->mi_adxs[a->a_desc->ad_index];
120 memcpy(ivk+sizeof(ID), &s, 2);
122 key.mv_size = sizeof(ivk);
123 if ((a->a_desc->ad_type->sat_flags & SLAP_AT_ORDERED) || a->a_desc == slap_schema.si_ad_objectClass)
124 data[2].mv_data = NULL;
126 data[2].mv_data = a->a_desc;
128 for (i=0; i<a->a_numvals; i++) {
129 len = a->a_nvals[i].bv_len + 1 + 2;
130 if (a->a_nvals != a->a_vals) {
131 len += a->a_vals[i].bv_len + 1;
132 data[1].mv_data = a->a_nvals[i].bv_val;
133 data[1].mv_size = a->a_nvals[i].bv_len;
135 data[1].mv_data = a->a_vals[i].bv_val;
136 data[1].mv_size = a->a_vals[i].bv_len;
138 data[0].mv_size = len;
139 buf = op->o_tmpalloc( len, op->o_tmpmemctx );
140 data[0].mv_data = buf;
141 memcpy(buf, a->a_nvals[i].bv_val, a->a_nvals[i].bv_len);
142 buf += a->a_nvals[i].bv_len;
144 if (a->a_nvals != a->a_vals) {
145 s = a->a_vals[i].bv_len;
146 memcpy(buf, a->a_vals[i].bv_val, a->a_vals[i].bv_len);
147 buf += a->a_vals[i].bv_len;
154 rc = mdb_cursor_put(mc, &key, data, 0);
155 op->o_tmpfree( data[0].mv_data, op->o_tmpmemctx );
162 int mdb_mval_del(Operation *op, MDB_cursor *mc, ID id, Attribute *a)
164 struct mdb_info *mdb = (struct mdb_info *) op->o_bd->be_private;
165 MDB_val key, data[3];
172 memcpy(ivk, &id, sizeof(id));
173 s = mdb->mi_adxs[a->a_desc->ad_index];
174 memcpy(ivk+sizeof(ID), &s, 2);
176 key.mv_size = sizeof(ivk);
177 if ((a->a_desc->ad_type->sat_flags & SLAP_AT_ORDERED) || a->a_desc == slap_schema.si_ad_objectClass)
178 data[2].mv_data = NULL;
180 data[2].mv_data = a->a_desc;
183 for (i=0; i<a->a_numvals; i++) {
184 data[0].mv_data = a->a_nvals[i].bv_val;
185 data[0].mv_size = a->a_nvals[i].bv_len+1;
186 if (a->a_nvals != a->a_vals) {
187 data[1].mv_data = a->a_nvals[i].bv_val;
188 data[1].mv_size = a->a_nvals[i].bv_len;
190 data[1].mv_data = a->a_vals[i].bv_val;
191 data[1].mv_size = a->a_vals[i].bv_len;
193 rc = mdb_cursor_get(mc, &key, data, MDB_GET_BOTH_RANGE);
196 rc = mdb_cursor_del(mc, 0);
201 rc = mdb_cursor_get(mc, &key, data, MDB_SET);
204 rc = mdb_cursor_del(mc, MDB_NODUPDATA);
209 static int mdb_mval_get(Operation *op, MDB_cursor *mc, ID id, Attribute *a, int have_nvals)
211 struct mdb_info *mdb = (struct mdb_info *) op->o_bd->be_private;
212 MDB_val key, data[3];
219 memcpy(ivk, &id, sizeof(id));
220 s = mdb->mi_adxs[a->a_desc->ad_index];
221 memcpy(ivk+sizeof(ID), &s, 2);
223 key.mv_size = sizeof(ivk);
226 if ((a->a_desc->ad_type->sat_flags & SLAP_AT_ORDERED) || a->a_desc == slap_schema.si_ad_objectClass)
227 data[2].mv_data = NULL;
229 data[2].mv_data = a->a_desc;
232 a->a_nvals = a->a_vals + a->a_numvals + 1;
234 a->a_nvals = a->a_vals;
235 for (i=0; i<a->a_numvals; i++) {
237 rc = mdb_cursor_get(mc, &key, data, MDB_SET);
239 rc = mdb_cursor_get(mc, &key, data, MDB_NEXT_DUP);
242 ptr = (char*)data[0].mv_data + data[0].mv_size - 2;
245 a->a_nvals[i].bv_val = data[0].mv_data;
246 a->a_vals[i].bv_len = s;
247 a->a_vals[i].bv_val = ptr - a->a_vals[i].bv_len - 1;
248 a->a_nvals[i].bv_len = a->a_vals[i].bv_val - a->a_nvals[i].bv_val - 1;
251 a->a_vals[i].bv_val = data[0].mv_data;
252 a->a_vals[i].bv_len = data[0].mv_size - 3;
255 BER_BVZERO(&a->a_vals[i]);
257 BER_BVZERO(&a->a_nvals[i]);
262 #define ADD_FLAGS (MDB_NOOVERWRITE|MDB_APPEND)
264 static int mdb_id2entry_put(
271 struct mdb_info *mdb = (struct mdb_info *) op->o_bd->be_private;
274 int rc, adding = flag;
276 /* We only store rdns, and they go in the dn2id database. */
278 key.mv_data = &e->e_id;
279 key.mv_size = sizeof(ID);
281 rc = mdb_entry_partsize( mdb, txn, e, &ec );
287 if (e->e_id < mdb->mi_nextid)
290 if (mdb->mi_maxentrysize && ec.len > mdb->mi_maxentrysize)
291 return LDAP_ADMINLIMIT_EXCEEDED;
294 data.mv_size = ec.dlen;
296 rc = mdb_cursor_put( mc, &key, &data, flag );
298 rc = mdb_put( txn, mdb->mi_id2entry, &key, &data, flag );
299 if (rc == MDB_SUCCESS) {
300 rc = mdb_entry_encode( op, e, &data, &ec );
301 if( rc != LDAP_SUCCESS )
303 /* Handle adds of large multi-valued attrs here.
304 * Modifies handle them directly.
306 if (adding && ec.multi) {
309 rc = mdb_cursor_open( txn, mdb->mi_dbis[MDB_ID2VAL], &mvc );
312 for ( a = ec.multi; a; a=a->a_next ) {
313 if (!(a->a_flags & SLAP_ATTR_BIG_MULTI))
315 rc = mdb_mval_put( op, mvc, e->e_id, a );
316 if( rc != LDAP_SUCCESS )
319 mdb_cursor_close( mvc );
325 /* Was there a hole from slapadd? */
326 if ( (flag & MDB_NOOVERWRITE) && data.mv_size == 0 ) {
330 Debug( LDAP_DEBUG_ANY,
331 "mdb_id2entry_put: mdb_put failed: %s(%d) \"%s\"\n",
332 mdb_strerror(rc), rc,
334 if ( rc != MDB_KEYEXIST )
341 * This routine adds (or updates) an entry on disk.
343 int mdb_id2entry_add(
349 return mdb_id2entry_put(op, txn, mc, e, ADD_FLAGS);
352 int mdb_id2entry_update(
358 return mdb_id2entry_put(op, txn, mc, e, 0);
371 key.mv_size = sizeof(ID);
374 rc = mdb_cursor_get( mc, &key, data, MDB_SET );
375 /* stubs from missing parents - DB is actually invalid */
376 if ( rc == MDB_SUCCESS && !data->mv_size )
393 key.mv_size = sizeof(ID);
396 rc = mdb_cursor_get( mc, &key, &data, MDB_SET );
397 if ( rc == MDB_NOTFOUND ) {
398 /* Looking for root entry on an empty-dn suffix? */
399 if ( !id && BER_BVISEMPTY( &op->o_bd->be_nsuffix[0] )) {
400 struct berval gluebv = BER_BVC("glue");
401 Entry *r = mdb_entry_alloc(op, 2, 4);
402 Attribute *a = r->e_attrs;
406 r->e_ocflags = SLAP_OC_GLUE|SLAP_OC__END;
408 a->a_flags = SLAP_ATTR_DONT_FREE_DATA | SLAP_ATTR_DONT_FREE_VALS;
409 a->a_desc = slap_schema.si_ad_objectClass;
410 a->a_nvals = a->a_vals;
417 a->a_flags = SLAP_ATTR_DONT_FREE_DATA | SLAP_ATTR_DONT_FREE_VALS;
418 a->a_desc = slap_schema.si_ad_structuralObjectClass;
420 a->a_nvals = a->a_vals;
429 /* stubs from missing parents - DB is actually invalid */
430 if ( rc == MDB_SUCCESS && !data.mv_size )
434 rc = mdb_entry_decode( op, mdb_cursor_txn( mc ), &data, id, e );
438 (*e)->e_name.bv_val = NULL;
439 (*e)->e_nname.bv_val = NULL;
444 int mdb_id2entry_delete(
449 struct mdb_info *mdb = (struct mdb_info *) be->be_private;
450 MDB_dbi dbi = mdb->mi_id2entry;
455 key.mv_data = &e->e_id;
456 key.mv_size = sizeof(ID);
458 /* delete from database */
459 rc = mdb_del( tid, dbi, &key, NULL );
462 rc = mdb_cursor_open( tid, mdb->mi_dbis[MDB_ID2VAL], &mvc );
466 rc = mdb_cursor_get( mvc, &key, NULL, MDB_SET_RANGE );
468 if (rc == MDB_NOTFOUND)
472 while (*(ID *)key.mv_data == e->e_id ) {
473 rc = mdb_cursor_del( mvc, MDB_NODUPDATA );
476 rc = mdb_cursor_get( mvc, &key, NULL, MDB_GET_CURRENT );
478 if (rc == MDB_NOTFOUND)
486 static Entry * mdb_entry_alloc(
491 Entry *e = op->o_tmpalloc( sizeof(Entry) +
492 nattrs * sizeof(Attribute) +
493 nvals * sizeof(struct berval), op->o_tmpmemctx );
494 BER_BVZERO(&e->e_bv);
497 e->e_attrs = (Attribute *)(e+1);
498 e->e_attrs->a_vals = (struct berval *)(e->e_attrs+nattrs);
506 int mdb_entry_return(
513 if ( e->e_private ) {
514 if ( op->o_hdr && op->o_tmpmfuncs ) {
515 op->o_tmpfree( e->e_nname.bv_val, op->o_tmpmemctx );
516 op->o_tmpfree( e->e_name.bv_val, op->o_tmpmemctx );
517 op->o_tmpfree( e, op->o_tmpmemctx );
519 ch_free( e->e_nname.bv_val );
520 ch_free( e->e_name.bv_val );
529 int mdb_entry_release(
534 struct mdb_info *mdb = (struct mdb_info *) op->o_bd->be_private;
535 struct mdb_op_info *moi = NULL;
537 /* slapMode : SLAP_SERVER_MODE, SLAP_TOOL_MODE,
538 SLAP_TRUNCATE_MODE, SLAP_UNDEFINED_MODE */
541 if ( slapMode & SLAP_SERVER_MODE ) {
543 LDAP_SLIST_FOREACH( oex, &op->o_extra, oe_next ) {
545 if ( oex->oe_key == mdb ) {
546 mdb_entry_return( op, e );
547 moi = (mdb_op_info *)oex;
548 /* If it was setup by entry_get we should probably free it */
549 if (( moi->moi_flag & (MOI_FREEIT|MOI_KEEPER)) == MOI_FREEIT ) {
551 if ( moi->moi_ref < 1 ) {
552 mdb_txn_reset( moi->moi_txn );
554 LDAP_SLIST_REMOVE( &op->o_extra, &moi->moi_oe, OpExtra, oe_next );
555 op->o_tmpfree( moi, op->o_tmpmemctx );
564 mdb_entry_return( op, e );
569 /* return LDAP_SUCCESS IFF we can retrieve the specified entry.
575 AttributeDescription *at,
579 struct mdb_info *mdb = (struct mdb_info *) op->o_bd->be_private;
580 struct mdb_op_info *moi = NULL;
584 const char *at_name = at ? at->ad_cname.bv_val : "(null)";
586 Debug( LDAP_DEBUG_ARGS,
587 "=> mdb_entry_get: ndn: \"%s\"\n", ndn->bv_val, 0, 0 );
588 Debug( LDAP_DEBUG_ARGS,
589 "=> mdb_entry_get: oc: \"%s\", at: \"%s\"\n",
590 oc ? oc->soc_cname.bv_val : "(null)", at_name, 0);
592 rc = mdb_opinfo_get( op, mdb, rw == 0, &moi );
597 /* can we find entry */
598 rc = mdb_dn2entry( op, txn, NULL, ndn, &e, NULL, 0 );
604 return (rc != LDAP_BUSY) ? LDAP_OTHER : LDAP_BUSY;
607 Debug( LDAP_DEBUG_ACL,
608 "=> mdb_entry_get: cannot find entry: \"%s\"\n",
610 rc = LDAP_NO_SUCH_OBJECT;
614 Debug( LDAP_DEBUG_ACL,
615 "=> mdb_entry_get: found entry: \"%s\"\n",
618 if ( oc && !is_entry_objectclass( e, oc, 0 )) {
619 Debug( LDAP_DEBUG_ACL,
620 "<= mdb_entry_get: failed to find objectClass %s\n",
621 oc->soc_cname.bv_val, 0, 0 );
622 rc = LDAP_NO_SUCH_ATTRIBUTE;
626 /* NOTE: attr_find() or attrs_find()? */
627 if ( at && attr_find( e->e_attrs, at ) == NULL ) {
628 Debug( LDAP_DEBUG_ACL,
629 "<= mdb_entry_get: failed to find attribute %s\n",
630 at->ad_cname.bv_val, 0, 0 );
631 rc = LDAP_NO_SUCH_ATTRIBUTE;
636 if( rc != LDAP_SUCCESS ) {
638 mdb_entry_release( op, e, rw );
643 Debug( LDAP_DEBUG_TRACE,
644 "mdb_entry_get: rc=%d\n",
650 mdb_reader_free( void *key, void *data )
654 if ( txn ) mdb_txn_abort( txn );
657 /* free up any keys used by the main thread */
659 mdb_reader_flush( MDB_env *env )
662 void *ctx = ldap_pvt_thread_pool_context();
664 if ( !ldap_pvt_thread_pool_getkey( ctx, env, &data, NULL ) ) {
665 ldap_pvt_thread_pool_setkey( ctx, env, NULL, 0, NULL, NULL );
666 mdb_reader_free( env, data );
670 extern MDB_txn *mdb_tool_txn;
673 mdb_opinfo_get( Operation *op, struct mdb_info *mdb, int rdonly, mdb_op_info **moip )
678 mdb_op_info *moi = NULL;
681 assert( op != NULL );
683 if ( !mdb || !moip ) return -1;
685 /* If no op was provided, try to find the ctx anyway... */
687 ctx = op->o_threadctx;
689 ctx = ldap_pvt_thread_pool_context();
693 LDAP_SLIST_FOREACH( oex, &op->o_extra, oe_next ) {
694 if ( oex->oe_key == mdb ) break;
696 moi = (mdb_op_info *)oex;
704 moi = op->o_tmpalloc(sizeof(struct mdb_op_info),op->o_tmpmemctx);
706 moi = ch_malloc(sizeof(mdb_op_info));
708 moi->moi_flag = MOI_FREEIT;
711 LDAP_SLIST_INSERT_HEAD( &op->o_extra, &moi->moi_oe, oe_next );
712 moi->moi_oe.oe_key = mdb;
718 /* This op started as a reader, but now wants to write. */
719 if ( moi->moi_flag & MOI_READER ) {
721 LDAP_SLIST_INSERT_HEAD( &op->o_extra, &moi->moi_oe, oe_next );
723 /* This op is continuing an existing write txn */
727 if ( !moi->moi_txn ) {
728 if (( slapMode & SLAP_TOOL_MODE ) && mdb_tool_txn ) {
729 moi->moi_txn = mdb_tool_txn;
732 if ( get_lazyCommit( op ))
733 flag |= MDB_NOMETASYNC;
734 rc = mdb_txn_begin( mdb->mi_dbenv, NULL, flag, &moi->moi_txn );
736 Debug( LDAP_DEBUG_ANY, "mdb_opinfo_get: err %s(%d)\n",
737 mdb_strerror(rc), rc, 0 );
745 /* OK, this is a reader */
746 if ( !moi->moi_txn ) {
747 if (( slapMode & SLAP_TOOL_MODE ) && mdb_tool_txn ) {
748 moi->moi_txn = mdb_tool_txn;
752 /* Shouldn't happen unless we're single-threaded */
753 rc = mdb_txn_begin( mdb->mi_dbenv, NULL, MDB_RDONLY, &moi->moi_txn );
755 Debug( LDAP_DEBUG_ANY, "mdb_opinfo_get: err %s(%d)\n",
756 mdb_strerror(rc), rc, 0 );
760 if ( ldap_pvt_thread_pool_getkey( ctx, mdb->mi_dbenv, &data, NULL ) ) {
761 rc = mdb_txn_begin( mdb->mi_dbenv, NULL, MDB_RDONLY, &moi->moi_txn );
763 Debug( LDAP_DEBUG_ANY, "mdb_opinfo_get: err %s(%d)\n",
764 mdb_strerror(rc), rc, 0 );
768 if ( ( rc = ldap_pvt_thread_pool_setkey( ctx, mdb->mi_dbenv,
769 data, mdb_reader_free, NULL, NULL ) ) ) {
770 mdb_txn_abort( moi->moi_txn );
772 Debug( LDAP_DEBUG_ANY, "mdb_opinfo_get: thread_pool_setkey failed err (%d)\n",
780 moi->moi_flag |= MOI_READER;
783 if ( moi->moi_ref < 1 ) {
787 rc = mdb_txn_renew( moi->moi_txn );
798 int mdb_txn( Operation *op, int txnop, OpExtra **ptr )
800 struct mdb_info *mdb = (struct mdb_info *) op->o_bd->be_private;
801 mdb_op_info **moip = (mdb_op_info **)ptr, *moi = *moip;
806 rc = mdb_opinfo_get( op, mdb, 0, moip );
809 moi->moi_flag |= MOI_KEEPER;
812 case SLAP_TXN_COMMIT:
813 rc = mdb_txn_commit( moi->moi_txn );
816 op->o_tmpfree( moi, op->o_tmpmemctx );
820 mdb_txn_abort( moi->moi_txn );
821 op->o_tmpfree( moi, op->o_tmpmemctx );
828 /* Count up the sizes of the components of an entry */
829 static int mdb_entry_partsize(struct mdb_info *mdb, MDB_txn *txn, Entry *e,
833 int i, nat = 0, nval = 0, nnval = 0, doff = 0;
837 len = 4*sizeof(int); /* nattrs, nvals, ocflags, offset */
839 for (a=e->e_attrs; a; a=a->a_next) {
840 /* For AttributeDesc, we only store the attr index */
842 if (a->a_desc->ad_index >= MDB_MAXADS) {
843 Debug( LDAP_DEBUG_ANY, "mdb_entry_partsize: too many AttributeDescriptions used\n",
847 if (!mdb->mi_adxs[a->a_desc->ad_index]) {
848 int rc = mdb_ad_get(mdb, txn, a->a_desc);
852 len += 2*sizeof(int); /* AD index, numvals */
853 dlen += 2*sizeof(int);
854 nval += a->a_numvals + 1; /* empty berval at end */
855 if (a->a_numvals > mdb->mi_multi_hi)
856 a->a_flags |= SLAP_ATTR_BIG_MULTI;
857 if (a->a_flags & SLAP_ATTR_BIG_MULTI)
858 doff += a->a_numvals;
859 for (i=0; i<a->a_numvals; i++) {
860 int alen = a->a_vals[i].bv_len + 1 + sizeof(int); /* len */
862 if (a->a_flags & SLAP_ATTR_BIG_MULTI) {
869 if (a->a_nvals != a->a_vals) {
870 nval += a->a_numvals + 1;
872 if (a->a_flags & SLAP_ATTR_BIG_MULTI)
873 doff += a->a_numvals;
874 for (i=0; i<a->a_numvals; i++) {
875 int alen = a->a_nvals[i].bv_len + 1 + sizeof(int);
877 if (!(a->a_flags & SLAP_ATTR_BIG_MULTI))
883 dlen = (dlen + sizeof(ID)-1) & ~(sizeof(ID)-1);
888 eh->offset = nat + nval - nnval - doff;
892 /* Flag bits for an encoded attribute */
893 #define MDB_AT_SORTED (1<<(sizeof(unsigned int)*CHAR_BIT-1))
894 /* the values are in sorted order */
895 #define MDB_AT_MULTI (1<<(sizeof(unsigned int)*CHAR_BIT-2))
896 /* the values of this multi-valued attr are stored separately */
898 #define MDB_AT_NVALS (1<<(sizeof(unsigned int)*CHAR_BIT-1))
899 /* this attribute has normalized values */
901 /* Flatten an Entry into a buffer. The buffer starts with the count of the
902 * number of attributes in the entry, the total number of values in the
903 * entry, and the e_ocflags. It then contains a list of integers for each
904 * attribute. For each attribute the first integer gives the index of the
905 * matching AttributeDescription, followed by the number of values in the
906 * attribute. If the MDB_AT_SORTED bit of the attr index is set, the
907 * attribute's values are already sorted. If the MDB_AT_MULTI bit of the
908 * attr index is set, the values are stored separately.
910 * If the MDB_AT_NVALS bit of numvals is set, the attribute also has
911 * normalized values present. (Note - a_numvals is an unsigned int, so this
912 * means it's possible to receive an attribute that we can't encode due
913 * to size overflow. In practice, this should not be an issue.)
915 * Then the length of each value is listed. If there are normalized values,
916 * their lengths come next. This continues for each attribute. After all
917 * of the lengths for the last attribute, the actual values are copied,
918 * with a NUL terminator after each value.
919 * The buffer is padded to the sizeof(ID). The entire buffer size is
920 * precomputed so that a single malloc can be performed.
922 static int mdb_entry_encode(Operation *op, Entry *e, MDB_val *data, Ecount *eh)
924 struct mdb_info *mdb = (struct mdb_info *) op->o_bd->be_private;
930 Debug( LDAP_DEBUG_TRACE, "=> mdb_entry_encode(0x%08lx): %s\n",
931 (long) e->e_id, e->e_dn, 0 );
933 /* make sure e->e_ocflags is set */
934 if (is_entry_referral(e))
937 lp = (unsigned int *)data->mv_data;
940 *lp++ = (unsigned int)e->e_ocflags;
942 ptr = (unsigned char *)(lp + eh->offset);
944 for (a=e->e_attrs; a; a=a->a_next) {
945 if (!a->a_desc->ad_index)
946 return LDAP_UNDEFINED_TYPE;
947 l = mdb->mi_adxs[a->a_desc->ad_index];
948 if (a->a_flags & SLAP_ATTR_BIG_MULTI)
950 if (a->a_flags & SLAP_ATTR_SORTED_VALS)
954 if (a->a_nvals != a->a_vals)
957 if (a->a_flags & SLAP_ATTR_BIG_MULTI) {
961 for (i=0; a->a_vals[i].bv_val; i++);
962 assert( i == a->a_numvals );
963 for (i=0; i<a->a_numvals; i++) {
964 *lp++ = a->a_vals[i].bv_len;
965 memcpy(ptr, a->a_vals[i].bv_val,
966 a->a_vals[i].bv_len);
967 ptr += a->a_vals[i].bv_len;
970 if (a->a_nvals != a->a_vals) {
971 for (i=0; i<a->a_numvals; i++) {
972 *lp++ = a->a_nvals[i].bv_len;
973 memcpy(ptr, a->a_nvals[i].bv_val,
974 a->a_nvals[i].bv_len);
975 ptr += a->a_nvals[i].bv_len;
983 Debug( LDAP_DEBUG_TRACE, "<= mdb_entry_encode(0x%08lx): %s\n",
984 (long) e->e_id, e->e_dn, 0 );
989 /* Retrieve an Entry that was stored using entry_encode above.
991 * Note: everything is stored in a single contiguous block, so
992 * you can not free individual attributes or names from this
993 * structure. Attempting to do so will likely corrupt memory.
996 int mdb_entry_decode(Operation *op, MDB_txn *txn, MDB_val *data, ID id, Entry **e)
998 struct mdb_info *mdb = (struct mdb_info *) op->o_bd->be_private;
999 int i, j, nattrs, nvals;
1004 unsigned int *lp = (unsigned int *)data->mv_data;
1007 MDB_cursor *mvc = NULL;
1009 Debug( LDAP_DEBUG_TRACE,
1010 "=> mdb_entry_decode:\n",
1015 x = mdb_entry_alloc(op, nattrs, nvals);
1016 x->e_ocflags = *lp++;
1023 ptr = (unsigned char *)(lp + i);
1025 for (;nattrs>0; nattrs--) {
1026 int have_nval = 0, multi = 0;
1027 a->a_flags = SLAP_ATTR_DONT_FREE_DATA | SLAP_ATTR_DONT_FREE_VALS;
1029 if (i & MDB_AT_SORTED) {
1031 a->a_flags |= SLAP_ATTR_SORTED_VALS;
1033 if (i & MDB_AT_MULTI) {
1035 a->a_flags |= SLAP_ATTR_BIG_MULTI;
1038 if (i > mdb->mi_numads) {
1039 rc = mdb_ad_read(mdb, txn);
1042 if (i > mdb->mi_numads) {
1043 Debug( LDAP_DEBUG_ANY,
1044 "mdb_entry_decode: attribute index %d not recognized\n",
1050 a->a_desc = mdb->mi_ads[i];
1051 a->a_numvals = *lp++;
1052 if (a->a_numvals & MDB_AT_NVALS) {
1053 a->a_numvals ^= MDB_AT_NVALS;
1059 rc = mdb_cursor_open(txn, mdb->mi_dbis[MDB_ID2VAL], &mvc);
1063 mdb_mval_get(op, mvc, id, a, have_nval);
1064 bptr += a->a_numvals + 1;
1066 bptr += a->a_numvals + 1;
1068 for (i=0; i<a->a_numvals; i++) {
1069 bptr->bv_len = *lp++;
1070 bptr->bv_val = (char *)ptr;
1071 ptr += bptr->bv_len+1;
1074 bptr->bv_val = NULL;
1080 for (i=0; i<a->a_numvals; i++) {
1081 bptr->bv_len = *lp++;
1082 bptr->bv_val = (char *)ptr;
1083 ptr += bptr->bv_len+1;
1086 bptr->bv_val = NULL;
1090 a->a_nvals = a->a_vals;
1094 /* FIXME: This is redundant once a sorted entry is saved into the DB */
1095 if (( a->a_desc->ad_type->sat_flags & SLAP_AT_SORTED_VAL )
1096 && !(a->a_flags & SLAP_ATTR_SORTED_VALS)) {
1097 rc = slap_sort_vals( (Modifications *)a, &text, &j, NULL );
1098 if ( rc == LDAP_SUCCESS ) {
1099 a->a_flags |= SLAP_ATTR_SORTED_VALS;
1100 } else if ( rc == LDAP_TYPE_OR_VALUE_EXISTS ) {
1101 /* should never happen */
1102 Debug( LDAP_DEBUG_ANY,
1103 "mdb_entry_decode: attributeType %s value #%d provided more than once\n",
1104 a->a_desc->ad_cname.bv_val, j, 0 );
1111 a[-1].a_next = NULL;
1113 Debug(LDAP_DEBUG_TRACE, "<= mdb_entry_decode\n",
1120 mdb_cursor_close(mvc);