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-2016 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 /* Values are stored as
64 * [normalized-value NUL ] original-value NUL 2-byte-len
65 * The trailing 2-byte-len is zero if there is no normalized value.
66 * Otherwise, it is the length of the original-value.
68 int mdb_mval_put(Operation *op, MDB_cursor *mc, ID id, Attribute *a)
70 struct mdb_info *mdb = (struct mdb_info *) op->o_bd->be_private;
78 memcpy(ivk, &id, sizeof(id));
79 s = mdb->mi_adxs[a->a_desc->ad_index];
80 memcpy(ivk+sizeof(ID), &s, 2);
82 key.mv_size = sizeof(ivk);
84 for (i=0; i<a->a_numvals; i++) {
85 len = a->a_nvals[i].bv_len + 1 + 2;
86 if (a->a_nvals != a->a_vals)
87 len += a->a_vals[i].bv_len + 1;
89 buf = op->o_tmpalloc( len, op->o_tmpmemctx );
91 memcpy(buf, a->a_nvals[i].bv_val, a->a_nvals[i].bv_len);
92 buf += a->a_nvals[i].bv_len;
94 if (a->a_nvals != a->a_vals) {
95 s = a->a_vals[i].bv_len;
96 memcpy(buf, a->a_vals[i].bv_val, a->a_vals[i].bv_len);
97 buf += a->a_vals[i].bv_len;
104 rc = mdb_cursor_put(mc, &key, &data, 0);
105 op->o_tmpfree( data.mv_data, op->o_tmpmemctx );
112 int mdb_mval_del(Operation *op, MDB_cursor *mc, ID id, Attribute *a)
114 struct mdb_info *mdb = (struct mdb_info *) op->o_bd->be_private;
122 memcpy(ivk, &id, sizeof(id));
123 s = mdb->mi_adxs[a->a_desc->ad_index];
124 memcpy(ivk+sizeof(ID), &s, 2);
126 key.mv_size = sizeof(ivk);
129 for (i=0; i<a->a_numvals; i++) {
130 data.mv_data = a->a_nvals[i].bv_val;
131 data.mv_size = a->a_nvals[i].bv_len+1;
132 rc = mdb_cursor_get(mc, &key, &data, MDB_GET_BOTH_RANGE);
135 rc = mdb_cursor_del(mc, 0);
140 rc = mdb_cursor_get(mc, &key, &data, MDB_SET);
143 rc = mdb_cursor_del(mc, MDB_NODUPDATA);
148 static int mdb_mval_get(Operation *op, MDB_cursor *mc, ID id, Attribute *a, int have_nvals)
150 struct mdb_info *mdb = (struct mdb_info *) op->o_bd->be_private;
158 memcpy(ivk, &id, sizeof(id));
159 s = mdb->mi_adxs[a->a_desc->ad_index];
160 memcpy(ivk+sizeof(ID), &s, 2);
162 key.mv_size = sizeof(ivk);
165 a->a_nvals = a->a_vals + a->a_numvals + 1;
167 a->a_nvals = a->a_vals;
168 for (i=0; i<a->a_numvals; i++) {
170 rc = mdb_cursor_get(mc, &key, &data, MDB_SET);
172 rc = mdb_cursor_get(mc, &key, &data, MDB_NEXT_DUP);
175 ptr = (char*)data.mv_data + data.mv_size - 2;
178 a->a_nvals[i].bv_val = data.mv_data;
179 a->a_vals[i].bv_len = s;
180 a->a_vals[i].bv_val = ptr - a->a_vals[i].bv_len - 1;
181 a->a_nvals[i].bv_len = a->a_vals[i].bv_val - a->a_nvals[i].bv_val - 1;
184 a->a_vals[i].bv_val = data.mv_data;
185 a->a_vals[i].bv_len = data.mv_size - 3;
188 BER_BVZERO(&a->a_vals[i]);
190 BER_BVZERO(&a->a_nvals[i]);
195 #define ADD_FLAGS (MDB_NOOVERWRITE|MDB_APPEND)
197 static int mdb_id2entry_put(
204 struct mdb_info *mdb = (struct mdb_info *) op->o_bd->be_private;
207 int rc, adding = flag;
209 /* We only store rdns, and they go in the dn2id database. */
211 key.mv_data = &e->e_id;
212 key.mv_size = sizeof(ID);
214 rc = mdb_entry_partsize( mdb, txn, e, &ec );
220 if (e->e_id < mdb->mi_nextid)
223 if (mdb->mi_maxentrysize && ec.len > mdb->mi_maxentrysize)
224 return LDAP_ADMINLIMIT_EXCEEDED;
227 data.mv_size = ec.dlen;
229 rc = mdb_cursor_put( mc, &key, &data, flag );
231 rc = mdb_put( txn, mdb->mi_id2entry, &key, &data, flag );
232 if (rc == MDB_SUCCESS) {
233 rc = mdb_entry_encode( op, e, &data, &ec );
234 if( rc != LDAP_SUCCESS )
236 /* Handle adds of large multi-valued attrs here.
237 * Modifies handle them directly.
239 if (adding && ec.multi) {
242 rc = mdb_cursor_open( txn, mdb->mi_dbis[MDB_ID2VAL], &mvc );
245 for ( a = ec.multi; a; a=a->a_next ) {
246 if (!(a->a_flags & SLAP_ATTR_BIG_MULTI))
248 rc = mdb_mval_put( op, mvc, e->e_id, a );
249 if( rc != LDAP_SUCCESS )
252 mdb_cursor_close( mvc );
258 /* Was there a hole from slapadd? */
259 if ( (flag & MDB_NOOVERWRITE) && data.mv_size == 0 ) {
263 Debug( LDAP_DEBUG_ANY,
264 "mdb_id2entry_put: mdb_put failed: %s(%d) \"%s\"\n",
265 mdb_strerror(rc), rc,
267 if ( rc != MDB_KEYEXIST )
274 * This routine adds (or updates) an entry on disk.
276 int mdb_id2entry_add(
282 return mdb_id2entry_put(op, txn, mc, e, ADD_FLAGS);
285 int mdb_id2entry_update(
291 return mdb_id2entry_put(op, txn, mc, e, 0);
304 key.mv_size = sizeof(ID);
307 rc = mdb_cursor_get( mc, &key, data, MDB_SET );
308 /* stubs from missing parents - DB is actually invalid */
309 if ( rc == MDB_SUCCESS && !data->mv_size )
320 struct mdb_info *mdb = (struct mdb_info *) op->o_bd->be_private;
327 key.mv_size = sizeof(ID);
330 rc = mdb_cursor_get( mc, &key, &data, MDB_SET );
331 if ( rc == MDB_NOTFOUND ) {
332 /* Looking for root entry on an empty-dn suffix? */
333 if ( !id && BER_BVISEMPTY( &op->o_bd->be_nsuffix[0] )) {
334 struct berval gluebv = BER_BVC("glue");
335 Entry *r = mdb_entry_alloc(op, 2, 4);
336 Attribute *a = r->e_attrs;
340 r->e_ocflags = SLAP_OC_GLUE|SLAP_OC__END;
342 a->a_flags = SLAP_ATTR_DONT_FREE_DATA | SLAP_ATTR_DONT_FREE_VALS;
343 a->a_desc = slap_schema.si_ad_objectClass;
344 a->a_nvals = a->a_vals;
351 a->a_flags = SLAP_ATTR_DONT_FREE_DATA | SLAP_ATTR_DONT_FREE_VALS;
352 a->a_desc = slap_schema.si_ad_structuralObjectClass;
354 a->a_nvals = a->a_vals;
363 /* stubs from missing parents - DB is actually invalid */
364 if ( rc == MDB_SUCCESS && !data.mv_size )
368 rc = mdb_entry_decode( op, mdb_cursor_txn( mc ), &data, id, e );
372 (*e)->e_name.bv_val = NULL;
373 (*e)->e_nname.bv_val = NULL;
378 int mdb_id2entry_delete(
383 struct mdb_info *mdb = (struct mdb_info *) be->be_private;
384 MDB_dbi dbi = mdb->mi_id2entry;
389 key.mv_data = &e->e_id;
390 key.mv_size = sizeof(ID);
392 /* delete from database */
393 rc = mdb_del( tid, dbi, &key, NULL );
396 rc = mdb_cursor_open( tid, mdb->mi_dbis[MDB_ID2VAL], &mvc );
400 rc = mdb_cursor_get( mvc, &key, NULL, MDB_SET_RANGE );
402 if (rc == MDB_NOTFOUND)
406 while (*(ID *)key.mv_data == e->e_id ) {
407 rc = mdb_cursor_del( mvc, MDB_NODUPDATA );
410 rc = mdb_cursor_get( mvc, &key, NULL, MDB_GET_CURRENT );
412 if (rc == MDB_NOTFOUND)
420 static Entry * mdb_entry_alloc(
425 Entry *e = op->o_tmpalloc( sizeof(Entry) +
426 nattrs * sizeof(Attribute) +
427 nvals * sizeof(struct berval), op->o_tmpmemctx );
428 BER_BVZERO(&e->e_bv);
431 e->e_attrs = (Attribute *)(e+1);
432 e->e_attrs->a_vals = (struct berval *)(e->e_attrs+nattrs);
440 int mdb_entry_return(
447 if ( e->e_private ) {
448 if ( op->o_hdr && op->o_tmpmfuncs ) {
449 op->o_tmpfree( e->e_nname.bv_val, op->o_tmpmemctx );
450 op->o_tmpfree( e->e_name.bv_val, op->o_tmpmemctx );
451 op->o_tmpfree( e, op->o_tmpmemctx );
453 ch_free( e->e_nname.bv_val );
454 ch_free( e->e_name.bv_val );
463 int mdb_entry_release(
468 struct mdb_info *mdb = (struct mdb_info *) op->o_bd->be_private;
469 struct mdb_op_info *moi = NULL;
472 /* slapMode : SLAP_SERVER_MODE, SLAP_TOOL_MODE,
473 SLAP_TRUNCATE_MODE, SLAP_UNDEFINED_MODE */
476 if ( slapMode & SLAP_SERVER_MODE ) {
478 LDAP_SLIST_FOREACH( oex, &op->o_extra, oe_next ) {
480 if ( oex->oe_key == mdb ) {
481 mdb_entry_return( op, e );
482 moi = (mdb_op_info *)oex;
483 /* If it was setup by entry_get we should probably free it */
484 if (( moi->moi_flag & (MOI_FREEIT|MOI_KEEPER)) == MOI_FREEIT ) {
486 if ( moi->moi_ref < 1 ) {
487 mdb_txn_reset( moi->moi_txn );
489 LDAP_SLIST_REMOVE( &op->o_extra, &moi->moi_oe, OpExtra, oe_next );
490 op->o_tmpfree( moi, op->o_tmpmemctx );
499 mdb_entry_return( op, e );
504 /* return LDAP_SUCCESS IFF we can retrieve the specified entry.
510 AttributeDescription *at,
514 struct mdb_info *mdb = (struct mdb_info *) op->o_bd->be_private;
515 struct mdb_op_info *moi = NULL;
519 const char *at_name = at ? at->ad_cname.bv_val : "(null)";
521 Debug( LDAP_DEBUG_ARGS,
522 "=> mdb_entry_get: ndn: \"%s\"\n", ndn->bv_val, 0, 0 );
523 Debug( LDAP_DEBUG_ARGS,
524 "=> mdb_entry_get: oc: \"%s\", at: \"%s\"\n",
525 oc ? oc->soc_cname.bv_val : "(null)", at_name, 0);
527 rc = mdb_opinfo_get( op, mdb, rw == 0, &moi );
532 /* can we find entry */
533 rc = mdb_dn2entry( op, txn, NULL, ndn, &e, NULL, 0 );
539 return (rc != LDAP_BUSY) ? LDAP_OTHER : LDAP_BUSY;
542 Debug( LDAP_DEBUG_ACL,
543 "=> mdb_entry_get: cannot find entry: \"%s\"\n",
545 rc = LDAP_NO_SUCH_OBJECT;
549 Debug( LDAP_DEBUG_ACL,
550 "=> mdb_entry_get: found entry: \"%s\"\n",
553 if ( oc && !is_entry_objectclass( e, oc, 0 )) {
554 Debug( LDAP_DEBUG_ACL,
555 "<= mdb_entry_get: failed to find objectClass %s\n",
556 oc->soc_cname.bv_val, 0, 0 );
557 rc = LDAP_NO_SUCH_ATTRIBUTE;
561 /* NOTE: attr_find() or attrs_find()? */
562 if ( at && attr_find( e->e_attrs, at ) == NULL ) {
563 Debug( LDAP_DEBUG_ACL,
564 "<= mdb_entry_get: failed to find attribute %s\n",
565 at->ad_cname.bv_val, 0, 0 );
566 rc = LDAP_NO_SUCH_ATTRIBUTE;
571 if( rc != LDAP_SUCCESS ) {
573 mdb_entry_release( op, e, rw );
578 Debug( LDAP_DEBUG_TRACE,
579 "mdb_entry_get: rc=%d\n",
585 mdb_reader_free( void *key, void *data )
589 if ( txn ) mdb_txn_abort( txn );
592 /* free up any keys used by the main thread */
594 mdb_reader_flush( MDB_env *env )
597 void *ctx = ldap_pvt_thread_pool_context();
599 if ( !ldap_pvt_thread_pool_getkey( ctx, env, &data, NULL ) ) {
600 ldap_pvt_thread_pool_setkey( ctx, env, NULL, 0, NULL, NULL );
601 mdb_reader_free( env, data );
605 extern MDB_txn *mdb_tool_txn;
608 mdb_opinfo_get( Operation *op, struct mdb_info *mdb, int rdonly, mdb_op_info **moip )
613 mdb_op_info *moi = NULL;
616 assert( op != NULL );
618 if ( !mdb || !moip ) return -1;
620 /* If no op was provided, try to find the ctx anyway... */
622 ctx = op->o_threadctx;
624 ctx = ldap_pvt_thread_pool_context();
628 LDAP_SLIST_FOREACH( oex, &op->o_extra, oe_next ) {
629 if ( oex->oe_key == mdb ) break;
631 moi = (mdb_op_info *)oex;
639 moi = op->o_tmpalloc(sizeof(struct mdb_op_info),op->o_tmpmemctx);
641 moi = ch_malloc(sizeof(mdb_op_info));
643 moi->moi_flag = MOI_FREEIT;
646 LDAP_SLIST_INSERT_HEAD( &op->o_extra, &moi->moi_oe, oe_next );
647 moi->moi_oe.oe_key = mdb;
653 /* This op started as a reader, but now wants to write. */
654 if ( moi->moi_flag & MOI_READER ) {
656 LDAP_SLIST_INSERT_HEAD( &op->o_extra, &moi->moi_oe, oe_next );
658 /* This op is continuing an existing write txn */
662 if ( !moi->moi_txn ) {
663 if (( slapMode & SLAP_TOOL_MODE ) && mdb_tool_txn ) {
664 moi->moi_txn = mdb_tool_txn;
667 if ( get_lazyCommit( op ))
668 flag |= MDB_NOMETASYNC;
669 rc = mdb_txn_begin( mdb->mi_dbenv, NULL, flag, &moi->moi_txn );
671 Debug( LDAP_DEBUG_ANY, "mdb_opinfo_get: err %s(%d)\n",
672 mdb_strerror(rc), rc, 0 );
680 /* OK, this is a reader */
681 if ( !moi->moi_txn ) {
682 if (( slapMode & SLAP_TOOL_MODE ) && mdb_tool_txn ) {
683 moi->moi_txn = mdb_tool_txn;
687 /* Shouldn't happen unless we're single-threaded */
688 rc = mdb_txn_begin( mdb->mi_dbenv, NULL, MDB_RDONLY, &moi->moi_txn );
690 Debug( LDAP_DEBUG_ANY, "mdb_opinfo_get: err %s(%d)\n",
691 mdb_strerror(rc), rc, 0 );
695 if ( ldap_pvt_thread_pool_getkey( ctx, mdb->mi_dbenv, &data, NULL ) ) {
696 rc = mdb_txn_begin( mdb->mi_dbenv, NULL, MDB_RDONLY, &moi->moi_txn );
698 Debug( LDAP_DEBUG_ANY, "mdb_opinfo_get: err %s(%d)\n",
699 mdb_strerror(rc), rc, 0 );
703 if ( ( rc = ldap_pvt_thread_pool_setkey( ctx, mdb->mi_dbenv,
704 data, mdb_reader_free, NULL, NULL ) ) ) {
705 mdb_txn_abort( moi->moi_txn );
707 Debug( LDAP_DEBUG_ANY, "mdb_opinfo_get: thread_pool_setkey failed err (%d)\n",
715 moi->moi_flag |= MOI_READER;
718 if ( moi->moi_ref < 1 ) {
722 rc = mdb_txn_renew( moi->moi_txn );
733 int mdb_txn( Operation *op, int txnop, OpExtra **ptr )
735 struct mdb_info *mdb = (struct mdb_info *) op->o_bd->be_private;
736 mdb_op_info **moip = (mdb_op_info **)ptr, *moi = *moip;
741 rc = mdb_opinfo_get( op, mdb, 0, moip );
744 moi->moi_flag |= MOI_KEEPER;
747 case SLAP_TXN_COMMIT:
748 rc = mdb_txn_commit( moi->moi_txn );
751 op->o_tmpfree( moi, op->o_tmpmemctx );
755 mdb_txn_abort( moi->moi_txn );
756 op->o_tmpfree( moi, op->o_tmpmemctx );
763 /* Count up the sizes of the components of an entry */
764 static int mdb_entry_partsize(struct mdb_info *mdb, MDB_txn *txn, Entry *e,
768 int i, nat = 0, nval = 0, nnval = 0, doff = 0;
772 len = 4*sizeof(int); /* nattrs, nvals, ocflags, offset */
774 for (a=e->e_attrs; a; a=a->a_next) {
775 /* For AttributeDesc, we only store the attr index */
777 if (a->a_desc->ad_index >= MDB_MAXADS) {
778 Debug( LDAP_DEBUG_ANY, "mdb_entry_partsize: too many AttributeDescriptions used\n",
782 if (!mdb->mi_adxs[a->a_desc->ad_index]) {
783 int rc = mdb_ad_get(mdb, txn, a->a_desc);
787 len += 2*sizeof(int); /* AD index, numvals */
788 dlen += 2*sizeof(int);
789 nval += a->a_numvals + 1; /* empty berval at end */
790 if (a->a_numvals > mdb->mi_multi_hi)
791 a->a_flags |= SLAP_ATTR_BIG_MULTI;
792 if (a->a_flags & SLAP_ATTR_BIG_MULTI)
793 doff += a->a_numvals;
794 for (i=0; i<a->a_numvals; i++) {
795 int alen = a->a_vals[i].bv_len + 1 + sizeof(int); /* len */
797 if (a->a_flags & SLAP_ATTR_BIG_MULTI) {
804 if (a->a_nvals != a->a_vals) {
805 nval += a->a_numvals + 1;
807 if (a->a_flags & SLAP_ATTR_BIG_MULTI)
808 doff += a->a_numvals;
809 for (i=0; i<a->a_numvals; i++) {
810 int alen = a->a_nvals[i].bv_len + 1 + sizeof(int);
812 if (!(a->a_flags & SLAP_ATTR_BIG_MULTI))
818 dlen = (dlen + sizeof(ID)-1) & ~(sizeof(ID)-1);
823 eh->offset = nat + nval - nnval - doff;
827 /* Flag bits for an encoded attribute */
828 #define MDB_AT_SORTED (1<<(sizeof(unsigned int)*CHAR_BIT-1))
829 /* the values are in sorted order */
830 #define MDB_AT_MULTI (1<<(sizeof(unsigned int)*CHAR_BIT-2))
831 /* the values of this multi-valued attr are stored separately */
833 #define MDB_AT_NVALS (1<<(sizeof(unsigned int)*CHAR_BIT-1))
834 /* this attribute has normalized values */
836 /* Flatten an Entry into a buffer. The buffer starts with the count of the
837 * number of attributes in the entry, the total number of values in the
838 * entry, and the e_ocflags. It then contains a list of integers for each
839 * attribute. For each attribute the first integer gives the index of the
840 * matching AttributeDescription, followed by the number of values in the
841 * attribute. If the MDB_AT_SORTED bit of the attr index is set, the
842 * attribute's values are already sorted. If the MDB_AT_MULTI bit of the
843 * attr index is set, the values are stored separately.
845 * Unfortunately, MDB_AT_MULTI and MDB_AT_SORTED are mutually exclusive;
846 * the DB stores big multi-valued attrs in sorted order but the sorting
847 * is according to the DB order which is not guaranteed to match the
848 * attribute's matching rule ordering. So, drop the sorted flag on big
849 * multi-val attributes, the values will need to be resorted when the
850 * entry is read again.
852 * If the MDB_AT_NVALS bit of numvals is set, the attribute also has
853 * normalized values present. (Note - a_numvals is an unsigned int, so this
854 * means it's possible to receive an attribute that we can't encode due
855 * to size overflow. In practice, this should not be an issue.)
857 * Then the length of each value is listed. If there are normalized values,
858 * their lengths come next. This continues for each attribute. After all
859 * of the lengths for the last attribute, the actual values are copied,
860 * with a NUL terminator after each value.
861 * The buffer is padded to the sizeof(ID). The entire buffer size is
862 * precomputed so that a single malloc can be performed.
864 static int mdb_entry_encode(Operation *op, Entry *e, MDB_val *data, Ecount *eh)
866 struct mdb_info *mdb = (struct mdb_info *) op->o_bd->be_private;
873 Debug( LDAP_DEBUG_TRACE, "=> mdb_entry_encode(0x%08lx): %s\n",
874 (long) e->e_id, e->e_dn, 0 );
876 /* make sure e->e_ocflags is set */
877 if (is_entry_referral(e))
880 lp = (unsigned int *)data->mv_data;
883 *lp++ = (unsigned int)e->e_ocflags;
885 ptr = (unsigned char *)(lp + eh->offset);
887 for (a=e->e_attrs; a; a=a->a_next) {
888 if (!a->a_desc->ad_index)
889 return LDAP_UNDEFINED_TYPE;
890 l = mdb->mi_adxs[a->a_desc->ad_index];
891 if (a->a_flags & SLAP_ATTR_BIG_MULTI)
893 else if (a->a_flags & SLAP_ATTR_SORTED_VALS)
897 if (a->a_nvals != a->a_vals)
900 if (a->a_flags & SLAP_ATTR_BIG_MULTI) {
904 for (i=0; a->a_vals[i].bv_val; i++);
905 assert( i == a->a_numvals );
906 for (i=0; i<a->a_numvals; i++) {
907 *lp++ = a->a_vals[i].bv_len;
908 memcpy(ptr, a->a_vals[i].bv_val,
909 a->a_vals[i].bv_len);
910 ptr += a->a_vals[i].bv_len;
913 if (a->a_nvals != a->a_vals) {
914 for (i=0; i<a->a_numvals; i++) {
915 *lp++ = a->a_nvals[i].bv_len;
916 memcpy(ptr, a->a_nvals[i].bv_val,
917 a->a_nvals[i].bv_len);
918 ptr += a->a_nvals[i].bv_len;
926 Debug( LDAP_DEBUG_TRACE, "<= mdb_entry_encode(0x%08lx): %s\n",
927 (long) e->e_id, e->e_dn, 0 );
932 /* Retrieve an Entry that was stored using entry_encode above.
934 * Note: everything is stored in a single contiguous block, so
935 * you can not free individual attributes or names from this
936 * structure. Attempting to do so will likely corrupt memory.
939 int mdb_entry_decode(Operation *op, MDB_txn *txn, MDB_val *data, ID id, Entry **e)
941 struct mdb_info *mdb = (struct mdb_info *) op->o_bd->be_private;
942 int i, j, nattrs, nvals;
947 AttributeDescription *ad;
948 unsigned int *lp = (unsigned int *)data->mv_data;
951 MDB_cursor *mvc = NULL;
953 Debug( LDAP_DEBUG_TRACE,
954 "=> mdb_entry_decode:\n",
959 x = mdb_entry_alloc(op, nattrs, nvals);
960 x->e_ocflags = *lp++;
967 ptr = (unsigned char *)(lp + i);
969 for (;nattrs>0; nattrs--) {
970 int have_nval = 0, multi = 0;
971 a->a_flags = SLAP_ATTR_DONT_FREE_DATA | SLAP_ATTR_DONT_FREE_VALS;
973 if (i & MDB_AT_SORTED) {
975 a->a_flags |= SLAP_ATTR_SORTED_VALS;
977 if (i & MDB_AT_MULTI) {
979 a->a_flags |= SLAP_ATTR_BIG_MULTI;
982 if (i > mdb->mi_numads) {
983 rc = mdb_ad_read(mdb, txn);
986 if (i > mdb->mi_numads) {
987 Debug( LDAP_DEBUG_ANY,
988 "mdb_entry_decode: attribute index %d not recognized\n",
994 a->a_desc = mdb->mi_ads[i];
995 a->a_numvals = *lp++;
996 if (a->a_numvals & MDB_AT_NVALS) {
997 a->a_numvals ^= MDB_AT_NVALS;
1003 rc = mdb_cursor_open(txn, mdb->mi_dbis[MDB_ID2VAL], &mvc);
1007 mdb_mval_get(op, mvc, id, a, have_nval);
1008 bptr += a->a_numvals + 1;
1010 bptr += a->a_numvals + 1;
1012 for (i=0; i<a->a_numvals; i++) {
1013 bptr->bv_len = *lp++;
1014 bptr->bv_val = (char *)ptr;
1015 ptr += bptr->bv_len+1;
1018 bptr->bv_val = NULL;
1024 for (i=0; i<a->a_numvals; i++) {
1025 bptr->bv_len = *lp++;
1026 bptr->bv_val = (char *)ptr;
1027 ptr += bptr->bv_len+1;
1030 bptr->bv_val = NULL;
1034 a->a_nvals = a->a_vals;
1038 /* FIXME: This is redundant once a sorted entry is saved into the DB */
1039 if (( a->a_desc->ad_type->sat_flags & SLAP_AT_SORTED_VAL )
1040 && !(a->a_flags & SLAP_ATTR_SORTED_VALS)) {
1041 rc = slap_sort_vals( (Modifications *)a, &text, &j, NULL );
1042 if ( rc == LDAP_SUCCESS ) {
1043 a->a_flags |= SLAP_ATTR_SORTED_VALS;
1044 } else if ( rc == LDAP_TYPE_OR_VALUE_EXISTS ) {
1045 /* should never happen */
1046 Debug( LDAP_DEBUG_ANY,
1047 "mdb_entry_decode: attributeType %s value #%d provided more than once\n",
1048 a->a_desc->ad_cname.bv_val, j, 0 );
1055 a[-1].a_next = NULL;
1057 Debug(LDAP_DEBUG_TRACE, "<= mdb_entry_decode\n",
1064 mdb_cursor_close(mvc);