#define SUBLEN 3
-#define DN_INDICES 1
-/* #define DN_INDICES 1 *//* generate dn eq, subtree, and parent indices */
+/* #undef DN_INDICES *//* generate dn eq, subtree, and parent indices */
#define DN_ENTRY_PREFIX '='
-#define DN_SUBTREE_PREFIX '+'
-#define DN_PARENT_PREFIX '-'
+#define DN_SUBTREE_PREFIX '?'
+#define DN_PARENT_PREFIX '@'
/*
* there is a single index for each attribute. these prefixes ensure
/* allow 3 characters per byte + PREFIX + EOS */
#define CONT_SIZE ( sizeof(long)*3 + 1 + 1 )
-#undef CONT_POSTFIX /* postfix original key */
+/* #undef CONT_POSTFIX *//* postfix original key */
#define UNKNOWN_PREFIX '?' /* prefix for unknown keys */
for( i=0; subtree[i] != NULL; i++ ) {
key.dsize = strlen( subtree[i] ) + 2;
key.dptr = ch_malloc( key.dsize );
- sprintf( key.dptr, "%c%s", DN_SUBTREE_PREFIX, subtree[i] );
+ sprintf( key.dptr, "%c%s",
+ DN_SUBTREE_PREFIX, subtree[i] );
rc = idl_insert_key( be, db, key, id );
if( pdn != NULL ) {
key.dsize = strlen( pdn ) + 2;
key.dptr = ch_malloc( key.dsize );
- sprintf( key.dptr, "%c%s", DN_PARENT_PREFIX, pdn );
+ sprintf( key.dptr, "%c%s",
+ DN_PARENT_PREFIX, pdn );
rc = idl_insert_key( be, db, key, id );
free( key.dptr );
}
for( i=0; subtree[i] != NULL; i++ ) {
key.dsize = strlen( subtree[i] ) + 2;
key.dptr = ch_malloc( key.dsize );
- sprintf( key.dptr, "%c%s", DN_SUBTREE_PREFIX, subtree[i] );
+ sprintf( key.dptr, "%c%s",
+ DN_SUBTREE_PREFIX, subtree[i] );
rc = idl_insert_key( be, db, key, id );