mirror/openldap
2
0
Fork 0
mirror of https://git.openldap.org/openldap/openldap.git synced 2024-12-21 03:10:25 +08:00
Code Issues Packages Projects Releases Wiki Activity

ITS#7903 preserve Sorted status of attrs

Browse Source
This commit is contained in:
Howard Chu 2014-07-22 20:24:58 -07:00
parent f0475bab5a
commit 031640456b
1 changed files with 14 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

18
servers/slapd/back-mdb/id2entry.c
View File

@ -561,7 +561,9 @@ static int mdb_entry_partsize(struct mdb_info *mdb, MDB_txn *txn, Entry *e,
* entry, and the e_ocflags. It then contains a list of integers for each * entry, and the e_ocflags. It then contains a list of integers for each
* attribute. For each attribute the first integer gives the index of the * attribute. For each attribute the first integer gives the index of the
* matching AttributeDescription, followed by the number of values in the * matching AttributeDescription, followed by the number of values in the
* attribute. If the high bit is set, the attribute also has normalized * attribute. If the high bit of the attr index is set, the attribute's
* values are already sorted.
* If the high bit of numvals is set, the attribute also has normalized
* values present. (Note - a_numvals is an unsigned int, so this means * values present. (Note - a_numvals is an unsigned int, so this means
* it's possible to receive an attribute that we can't encode due to size * it's possible to receive an attribute that we can't encode due to size
* overflow. In practice, this should not be an issue.) Then the length * overflow. In practice, this should not be an issue.) Then the length
@ -598,7 +600,10 @@ static int mdb_entry_encode(Operation *op, Entry *e, MDB_val *data, Ecount *eh)
for (a=e->e_attrs; a; a=a->a_next) { for (a=e->e_attrs; a; a=a->a_next) {
if (!a->a_desc->ad_index) if (!a->a_desc->ad_index)
return LDAP_UNDEFINED_TYPE; return LDAP_UNDEFINED_TYPE;
*lp++ = mdb->mi_adxs[a->a_desc->ad_index]; l = mdb->mi_adxs[a->a_desc->ad_index];
if (a->a_flags & SLAP_ATTR_SORTED_VALS)
l |= HIGH_BIT;
*lp++ = l;
l = a->a_numvals; l = a->a_numvals;
if (a->a_nvals != a->a_vals) if (a->a_nvals != a->a_vals)
l |= HIGH_BIT; l |= HIGH_BIT;
@ -669,7 +674,12 @@ int mdb_entry_decode(Operation *op, MDB_txn *txn, MDB_val *data, Entry **e)
for (;nattrs>0; nattrs--) { for (;nattrs>0; nattrs--) {
int have_nval = 0; int have_nval = 0;
a->a_flags = SLAP_ATTR_DONT_FREE_DATA | SLAP_ATTR_DONT_FREE_VALS;
i = *lp++; i = *lp++;
if (i & HIGH_BIT) {
i ^= HIGH_BIT;
a->a_flags |= SLAP_ATTR_SORTED_VALS;
}
if (i > mdb->mi_numads) { if (i > mdb->mi_numads) {
rc = mdb_ad_read(mdb, txn); rc = mdb_ad_read(mdb, txn);
if (rc) if (rc)
@ -682,7 +692,6 @@ int mdb_entry_decode(Operation *op, MDB_txn *txn, MDB_val *data, Entry **e)
} }
} }
a->a_desc = mdb->mi_ads[i]; a->a_desc = mdb->mi_ads[i];
a->a_flags = SLAP_ATTR_DONT_FREE_DATA | SLAP_ATTR_DONT_FREE_VALS;
a->a_numvals = *lp++; a->a_numvals = *lp++;
if (a->a_numvals & HIGH_BIT) { if (a->a_numvals & HIGH_BIT) {
a->a_numvals ^= HIGH_BIT; a->a_numvals ^= HIGH_BIT;
@ -714,7 +723,8 @@ int mdb_entry_decode(Operation *op, MDB_txn *txn, MDB_val *data, Entry **e)
a->a_nvals = a->a_vals; a->a_nvals = a->a_vals;
} }
/* FIXME: This is redundant once a sorted entry is saved into the DB */ /* FIXME: This is redundant once a sorted entry is saved into the DB */
if ( a->a_desc->ad_type->sat_flags & SLAP_AT_SORTED_VAL ) { if (( a->a_desc->ad_type->sat_flags & SLAP_AT_SORTED_VAL )
&& !(a->a_flags & SLAP_ATTR_SORTED_VALS)) {
rc = slap_sort_vals( (Modifications *)a, &text, &j, NULL ); rc = slap_sort_vals( (Modifications *)a, &text, &j, NULL );
if ( rc == LDAP_SUCCESS ) { if ( rc == LDAP_SUCCESS ) {
a->a_flags |= SLAP_ATTR_SORTED_VALS; a->a_flags |= SLAP_ATTR_SORTED_VALS;