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-2018 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 );
311 for ( a = ec.multi; a; a=a->a_next ) {
312 if (!(a->a_flags & SLAP_ATTR_BIG_MULTI))
314 rc = mdb_mval_put( op, mvc, e->e_id, a );
318 mdb_cursor_close( mvc );
321 Debug( LDAP_DEBUG_ANY,
322 "mdb_id2entry_put: mdb_mval_put failed: %s(%d) \"%s\"\n",
323 mdb_strerror(rc), rc,
330 /* Was there a hole from slapadd? */
331 if ( (flag & MDB_NOOVERWRITE) && data.mv_size == 0 ) {
335 Debug( LDAP_DEBUG_ANY,
336 "mdb_id2entry_put: mdb_put failed: %s(%d) \"%s\"\n",
337 mdb_strerror(rc), rc,
339 if ( rc != MDB_KEYEXIST )
346 * This routine adds (or updates) an entry on disk.
348 int mdb_id2entry_add(
354 return mdb_id2entry_put(op, txn, mc, e, ADD_FLAGS);
357 int mdb_id2entry_update(
363 return mdb_id2entry_put(op, txn, mc, e, 0);
376 key.mv_size = sizeof(ID);
379 rc = mdb_cursor_get( mc, &key, data, MDB_SET );
380 /* stubs from missing parents - DB is actually invalid */
381 if ( rc == MDB_SUCCESS && !data->mv_size )
398 key.mv_size = sizeof(ID);
401 rc = mdb_cursor_get( mc, &key, &data, MDB_SET );
402 if ( rc == MDB_NOTFOUND ) {
403 /* Looking for root entry on an empty-dn suffix? */
404 if ( !id && BER_BVISEMPTY( &op->o_bd->be_nsuffix[0] )) {
405 struct berval gluebv = BER_BVC("glue");
406 Entry *r = mdb_entry_alloc(op, 2, 4);
407 Attribute *a = r->e_attrs;
411 r->e_ocflags = SLAP_OC_GLUE|SLAP_OC__END;
413 a->a_flags = SLAP_ATTR_DONT_FREE_DATA | SLAP_ATTR_DONT_FREE_VALS;
414 a->a_desc = slap_schema.si_ad_objectClass;
415 a->a_nvals = a->a_vals;
422 a->a_flags = SLAP_ATTR_DONT_FREE_DATA | SLAP_ATTR_DONT_FREE_VALS;
423 a->a_desc = slap_schema.si_ad_structuralObjectClass;
425 a->a_nvals = a->a_vals;
434 /* stubs from missing parents - DB is actually invalid */
435 if ( rc == MDB_SUCCESS && !data.mv_size )
439 rc = mdb_entry_decode( op, mdb_cursor_txn( mc ), &data, id, e );
443 (*e)->e_name.bv_val = NULL;
444 (*e)->e_nname.bv_val = NULL;
449 int mdb_id2entry_delete(
454 struct mdb_info *mdb = (struct mdb_info *) be->be_private;
455 MDB_dbi dbi = mdb->mi_id2entry;
460 key.mv_data = &e->e_id;
461 key.mv_size = sizeof(ID);
463 /* delete from database */
464 rc = mdb_del( tid, dbi, &key, NULL );
467 rc = mdb_cursor_open( tid, mdb->mi_dbis[MDB_ID2VAL], &mvc );
471 rc = mdb_cursor_get( mvc, &key, NULL, MDB_SET_RANGE );
473 if (rc == MDB_NOTFOUND)
477 while (*(ID *)key.mv_data == e->e_id ) {
478 rc = mdb_cursor_del( mvc, MDB_NODUPDATA );
481 rc = mdb_cursor_get( mvc, &key, NULL, MDB_GET_CURRENT );
483 if (rc == MDB_NOTFOUND)
491 static Entry * mdb_entry_alloc(
496 Entry *e = op->o_tmpalloc( sizeof(Entry) +
497 nattrs * sizeof(Attribute) +
498 nvals * sizeof(struct berval), op->o_tmpmemctx );
499 BER_BVZERO(&e->e_bv);
502 e->e_attrs = (Attribute *)(e+1);
503 e->e_attrs->a_vals = (struct berval *)(e->e_attrs+nattrs);
511 int mdb_entry_return(
518 if ( e->e_private ) {
519 if ( op->o_hdr && op->o_tmpmfuncs ) {
520 op->o_tmpfree( e->e_nname.bv_val, op->o_tmpmemctx );
521 op->o_tmpfree( e->e_name.bv_val, op->o_tmpmemctx );
522 op->o_tmpfree( e, op->o_tmpmemctx );
524 ch_free( e->e_nname.bv_val );
525 ch_free( e->e_name.bv_val );
534 int mdb_entry_release(
539 struct mdb_info *mdb = (struct mdb_info *) op->o_bd->be_private;
540 struct mdb_op_info *moi = NULL;
542 /* slapMode : SLAP_SERVER_MODE, SLAP_TOOL_MODE,
543 SLAP_TRUNCATE_MODE, SLAP_UNDEFINED_MODE */
546 if ( slapMode & SLAP_SERVER_MODE ) {
548 LDAP_SLIST_FOREACH( oex, &op->o_extra, oe_next ) {
550 if ( oex->oe_key == mdb ) {
551 mdb_entry_return( op, e );
552 moi = (mdb_op_info *)oex;
553 /* If it was setup by entry_get we should probably free it */
554 if (( moi->moi_flag & (MOI_FREEIT|MOI_KEEPER)) == MOI_FREEIT ) {
556 if ( moi->moi_ref < 1 ) {
557 mdb_txn_reset( moi->moi_txn );
559 LDAP_SLIST_REMOVE( &op->o_extra, &moi->moi_oe, OpExtra, oe_next );
560 op->o_tmpfree( moi, op->o_tmpmemctx );
569 mdb_entry_return( op, e );
574 /* return LDAP_SUCCESS IFF we can retrieve the specified entry.
580 AttributeDescription *at,
584 struct mdb_info *mdb = (struct mdb_info *) op->o_bd->be_private;
585 struct mdb_op_info *moi = NULL;
589 const char *at_name = at ? at->ad_cname.bv_val : "(null)";
591 Debug( LDAP_DEBUG_ARGS,
592 "=> mdb_entry_get: ndn: \"%s\"\n", ndn->bv_val, 0, 0 );
593 Debug( LDAP_DEBUG_ARGS,
594 "=> mdb_entry_get: oc: \"%s\", at: \"%s\"\n",
595 oc ? oc->soc_cname.bv_val : "(null)", at_name, 0);
597 rc = mdb_opinfo_get( op, mdb, rw == 0, &moi );
602 /* can we find entry */
603 rc = mdb_dn2entry( op, txn, NULL, ndn, &e, NULL, 0 );
609 return (rc != LDAP_BUSY) ? LDAP_OTHER : LDAP_BUSY;
612 Debug( LDAP_DEBUG_ACL,
613 "=> mdb_entry_get: cannot find entry: \"%s\"\n",
615 rc = LDAP_NO_SUCH_OBJECT;
619 Debug( LDAP_DEBUG_ACL,
620 "=> mdb_entry_get: found entry: \"%s\"\n",
623 if ( oc && !is_entry_objectclass( e, oc, 0 )) {
624 Debug( LDAP_DEBUG_ACL,
625 "<= mdb_entry_get: failed to find objectClass %s\n",
626 oc->soc_cname.bv_val, 0, 0 );
627 rc = LDAP_NO_SUCH_ATTRIBUTE;
631 /* NOTE: attr_find() or attrs_find()? */
632 if ( at && attr_find( e->e_attrs, at ) == NULL ) {
633 Debug( LDAP_DEBUG_ACL,
634 "<= mdb_entry_get: failed to find attribute %s\n",
635 at->ad_cname.bv_val, 0, 0 );
636 rc = LDAP_NO_SUCH_ATTRIBUTE;
641 if( rc != LDAP_SUCCESS ) {
643 mdb_entry_release( op, e, rw );
648 Debug( LDAP_DEBUG_TRACE,
649 "mdb_entry_get: rc=%d\n",
655 mdb_reader_free( void *key, void *data )
659 if ( txn ) mdb_txn_abort( txn );
662 /* free up any keys used by the main thread */
664 mdb_reader_flush( MDB_env *env )
667 void *ctx = ldap_pvt_thread_pool_context();
669 if ( !ldap_pvt_thread_pool_getkey( ctx, env, &data, NULL ) ) {
670 ldap_pvt_thread_pool_setkey( ctx, env, NULL, 0, NULL, NULL );
671 mdb_reader_free( env, data );
675 extern MDB_txn *mdb_tool_txn;
678 mdb_opinfo_get( Operation *op, struct mdb_info *mdb, int rdonly, mdb_op_info **moip )
683 mdb_op_info *moi = NULL;
686 assert( op != NULL );
688 if ( !mdb || !moip ) return -1;
690 /* If no op was provided, try to find the ctx anyway... */
692 ctx = op->o_threadctx;
694 ctx = ldap_pvt_thread_pool_context();
698 LDAP_SLIST_FOREACH( oex, &op->o_extra, oe_next ) {
699 if ( oex->oe_key == mdb ) break;
701 moi = (mdb_op_info *)oex;
709 moi = op->o_tmpalloc(sizeof(struct mdb_op_info),op->o_tmpmemctx);
711 moi = ch_malloc(sizeof(mdb_op_info));
713 moi->moi_flag = MOI_FREEIT;
716 LDAP_SLIST_INSERT_HEAD( &op->o_extra, &moi->moi_oe, oe_next );
717 moi->moi_oe.oe_key = mdb;
723 /* This op started as a reader, but now wants to write. */
724 if ( moi->moi_flag & MOI_READER ) {
726 LDAP_SLIST_INSERT_HEAD( &op->o_extra, &moi->moi_oe, oe_next );
728 /* This op is continuing an existing write txn */
732 if ( !moi->moi_txn ) {
733 if (( slapMode & SLAP_TOOL_MODE ) && mdb_tool_txn ) {
734 moi->moi_txn = mdb_tool_txn;
737 if ( get_lazyCommit( op ))
738 flag |= MDB_NOMETASYNC;
739 rc = mdb_txn_begin( mdb->mi_dbenv, NULL, flag, &moi->moi_txn );
741 Debug( LDAP_DEBUG_ANY, "mdb_opinfo_get: err %s(%d)\n",
742 mdb_strerror(rc), rc, 0 );
750 /* OK, this is a reader */
751 if ( !moi->moi_txn ) {
752 if (( slapMode & SLAP_TOOL_MODE ) && mdb_tool_txn ) {
753 moi->moi_txn = mdb_tool_txn;
757 /* Shouldn't happen unless we're single-threaded */
758 rc = mdb_txn_begin( mdb->mi_dbenv, NULL, MDB_RDONLY, &moi->moi_txn );
760 Debug( LDAP_DEBUG_ANY, "mdb_opinfo_get: err %s(%d)\n",
761 mdb_strerror(rc), rc, 0 );
765 if ( ldap_pvt_thread_pool_getkey( ctx, mdb->mi_dbenv, &data, NULL ) ) {
766 rc = mdb_txn_begin( mdb->mi_dbenv, NULL, MDB_RDONLY, &moi->moi_txn );
768 Debug( LDAP_DEBUG_ANY, "mdb_opinfo_get: err %s(%d)\n",
769 mdb_strerror(rc), rc, 0 );
773 if ( ( rc = ldap_pvt_thread_pool_setkey( ctx, mdb->mi_dbenv,
774 data, mdb_reader_free, NULL, NULL ) ) ) {
775 mdb_txn_abort( moi->moi_txn );
777 Debug( LDAP_DEBUG_ANY, "mdb_opinfo_get: thread_pool_setkey failed err (%d)\n",
785 moi->moi_flag |= MOI_READER;
788 if ( moi->moi_ref < 1 ) {
792 rc = mdb_txn_renew( moi->moi_txn );
803 int mdb_txn( Operation *op, int txnop, OpExtra **ptr )
805 struct mdb_info *mdb = (struct mdb_info *) op->o_bd->be_private;
806 mdb_op_info **moip = (mdb_op_info **)ptr, *moi = *moip;
811 rc = mdb_opinfo_get( op, mdb, 0, moip );
814 moi->moi_flag |= MOI_KEEPER;
817 case SLAP_TXN_COMMIT:
818 rc = mdb_txn_commit( moi->moi_txn );
821 op->o_tmpfree( moi, op->o_tmpmemctx );
825 mdb_txn_abort( moi->moi_txn );
826 op->o_tmpfree( moi, op->o_tmpmemctx );
833 /* Count up the sizes of the components of an entry */
834 static int mdb_entry_partsize(struct mdb_info *mdb, MDB_txn *txn, Entry *e,
838 int i, nat = 0, nval = 0, nnval = 0, doff = 0;
842 len = 4*sizeof(int); /* nattrs, nvals, ocflags, offset */
844 for (a=e->e_attrs; a; a=a->a_next) {
845 /* For AttributeDesc, we only store the attr index */
847 if (a->a_desc->ad_index >= MDB_MAXADS) {
848 Debug( LDAP_DEBUG_ANY, "mdb_entry_partsize: too many AttributeDescriptions used\n",
852 if (!mdb->mi_adxs[a->a_desc->ad_index]) {
853 int rc = mdb_ad_get(mdb, txn, a->a_desc);
857 len += 2*sizeof(int); /* AD index, numvals */
858 dlen += 2*sizeof(int);
859 nval += a->a_numvals + 1; /* empty berval at end */
860 if (a->a_numvals > mdb->mi_multi_hi)
861 a->a_flags |= SLAP_ATTR_BIG_MULTI;
862 if (a->a_flags & SLAP_ATTR_BIG_MULTI)
863 doff += a->a_numvals;
864 for (i=0; i<a->a_numvals; i++) {
865 int alen = a->a_vals[i].bv_len + 1 + sizeof(int); /* len */
867 if (a->a_flags & SLAP_ATTR_BIG_MULTI) {
874 if (a->a_nvals != a->a_vals) {
875 nval += a->a_numvals + 1;
877 if (a->a_flags & SLAP_ATTR_BIG_MULTI)
878 doff += a->a_numvals;
879 for (i=0; i<a->a_numvals; i++) {
880 int alen = a->a_nvals[i].bv_len + 1 + sizeof(int);
882 if (!(a->a_flags & SLAP_ATTR_BIG_MULTI))
888 dlen = (dlen + sizeof(ID)-1) & ~(sizeof(ID)-1);
893 eh->offset = nat + nval - nnval - doff;
897 /* Flag bits for an encoded attribute */
898 #define MDB_AT_SORTED (1<<(sizeof(unsigned int)*CHAR_BIT-1))
899 /* the values are in sorted order */
900 #define MDB_AT_MULTI (1<<(sizeof(unsigned int)*CHAR_BIT-2))
901 /* the values of this multi-valued attr are stored separately */
903 #define MDB_AT_NVALS (1<<(sizeof(unsigned int)*CHAR_BIT-1))
904 /* this attribute has normalized values */
906 /* Flatten an Entry into a buffer. The buffer starts with the count of the
907 * number of attributes in the entry, the total number of values in the
908 * entry, and the e_ocflags. It then contains a list of integers for each
909 * attribute. For each attribute the first integer gives the index of the
910 * matching AttributeDescription, followed by the number of values in the
911 * attribute. If the MDB_AT_SORTED bit of the attr index is set, the
912 * attribute's values are already sorted. If the MDB_AT_MULTI bit of the
913 * attr index is set, the values are stored separately.
915 * If the MDB_AT_NVALS bit of numvals is set, the attribute also has
916 * normalized values present. (Note - a_numvals is an unsigned int, so this
917 * means it's possible to receive an attribute that we can't encode due
918 * to size overflow. In practice, this should not be an issue.)
920 * Then the length of each value is listed. If there are normalized values,
921 * their lengths come next. This continues for each attribute. After all
922 * of the lengths for the last attribute, the actual values are copied,
923 * with a NUL terminator after each value.
924 * The buffer is padded to the sizeof(ID). The entire buffer size is
925 * precomputed so that a single malloc can be performed.
927 static int mdb_entry_encode(Operation *op, Entry *e, MDB_val *data, Ecount *eh)
929 struct mdb_info *mdb = (struct mdb_info *) op->o_bd->be_private;
935 Debug( LDAP_DEBUG_TRACE, "=> mdb_entry_encode(0x%08lx): %s\n",
936 (long) e->e_id, e->e_dn, 0 );
938 /* make sure e->e_ocflags is set */
939 if (is_entry_referral(e))
942 lp = (unsigned int *)data->mv_data;
945 *lp++ = (unsigned int)e->e_ocflags;
947 ptr = (unsigned char *)(lp + eh->offset);
949 for (a=e->e_attrs; a; a=a->a_next) {
950 if (!a->a_desc->ad_index)
951 return LDAP_UNDEFINED_TYPE;
952 l = mdb->mi_adxs[a->a_desc->ad_index];
953 if (a->a_flags & SLAP_ATTR_BIG_MULTI)
955 if (a->a_flags & SLAP_ATTR_SORTED_VALS)
959 if (a->a_nvals != a->a_vals)
962 if (a->a_flags & SLAP_ATTR_BIG_MULTI) {
966 for (i=0; a->a_vals[i].bv_val; i++);
967 assert( i == a->a_numvals );
968 for (i=0; i<a->a_numvals; i++) {
969 *lp++ = a->a_vals[i].bv_len;
970 memcpy(ptr, a->a_vals[i].bv_val,
971 a->a_vals[i].bv_len);
972 ptr += a->a_vals[i].bv_len;
975 if (a->a_nvals != a->a_vals) {
976 for (i=0; i<a->a_numvals; i++) {
977 *lp++ = a->a_nvals[i].bv_len;
978 memcpy(ptr, a->a_nvals[i].bv_val,
979 a->a_nvals[i].bv_len);
980 ptr += a->a_nvals[i].bv_len;
988 Debug( LDAP_DEBUG_TRACE, "<= mdb_entry_encode(0x%08lx): %s\n",
989 (long) e->e_id, e->e_dn, 0 );
994 /* Retrieve an Entry that was stored using entry_encode above.
996 * Note: everything is stored in a single contiguous block, so
997 * you can not free individual attributes or names from this
998 * structure. Attempting to do so will likely corrupt memory.
1001 int mdb_entry_decode(Operation *op, MDB_txn *txn, MDB_val *data, ID id, Entry **e)
1003 struct mdb_info *mdb = (struct mdb_info *) op->o_bd->be_private;
1004 int i, j, nattrs, nvals;
1009 unsigned int *lp = (unsigned int *)data->mv_data;
1012 MDB_cursor *mvc = NULL;
1014 Debug( LDAP_DEBUG_TRACE,
1015 "=> mdb_entry_decode:\n",
1020 x = mdb_entry_alloc(op, nattrs, nvals);
1021 x->e_ocflags = *lp++;
1028 ptr = (unsigned char *)(lp + i);
1030 for (;nattrs>0; nattrs--) {
1031 int have_nval = 0, multi = 0;
1032 a->a_flags = SLAP_ATTR_DONT_FREE_DATA | SLAP_ATTR_DONT_FREE_VALS;
1034 if (i & MDB_AT_SORTED) {
1036 a->a_flags |= SLAP_ATTR_SORTED_VALS;
1038 if (i & MDB_AT_MULTI) {
1040 a->a_flags |= SLAP_ATTR_BIG_MULTI;
1043 if (i > mdb->mi_numads) {
1044 rc = mdb_ad_read(mdb, txn);
1047 if (i > mdb->mi_numads) {
1048 Debug( LDAP_DEBUG_ANY,
1049 "mdb_entry_decode: attribute index %d not recognized\n",
1055 a->a_desc = mdb->mi_ads[i];
1056 a->a_numvals = *lp++;
1057 if (a->a_numvals & MDB_AT_NVALS) {
1058 a->a_numvals ^= MDB_AT_NVALS;
1064 rc = mdb_cursor_open(txn, mdb->mi_dbis[MDB_ID2VAL], &mvc);
1068 mdb_mval_get(op, mvc, id, a, have_nval);
1069 bptr += a->a_numvals + 1;
1071 bptr += a->a_numvals + 1;
1073 for (i=0; i<a->a_numvals; i++) {
1074 bptr->bv_len = *lp++;
1075 bptr->bv_val = (char *)ptr;
1076 ptr += bptr->bv_len+1;
1079 bptr->bv_val = NULL;
1085 for (i=0; i<a->a_numvals; i++) {
1086 bptr->bv_len = *lp++;
1087 bptr->bv_val = (char *)ptr;
1088 ptr += bptr->bv_len+1;
1091 bptr->bv_val = NULL;
1095 a->a_nvals = a->a_vals;
1099 /* FIXME: This is redundant once a sorted entry is saved into the DB */
1100 if (( a->a_desc->ad_type->sat_flags & SLAP_AT_SORTED_VAL )
1101 && !(a->a_flags & SLAP_ATTR_SORTED_VALS)) {
1102 rc = slap_sort_vals( (Modifications *)a, &text, &j, NULL );
1103 if ( rc == LDAP_SUCCESS ) {
1104 a->a_flags |= SLAP_ATTR_SORTED_VALS;
1105 } else if ( rc == LDAP_TYPE_OR_VALUE_EXISTS ) {
1106 /* should never happen */
1107 Debug( LDAP_DEBUG_ANY,
1108 "mdb_entry_decode: attributeType %s value #%d provided more than once\n",
1109 a->a_desc->ad_cname.bv_val, j, 0 );
1116 a[-1].a_next = NULL;
1118 Debug(LDAP_DEBUG_TRACE, "<= mdb_entry_decode\n",
1125 mdb_cursor_close(mvc);