openldap/servers/slapd/back-ldbm/dn2id.c

320 lines
6.2 KiB
C
Raw Normal View History

1998-08-09 08:43:13 +08:00
/* dn2id.c - routines to deal with the dn2id index */
/* $OpenLDAP$ */
1999-08-07 07:07:46 +08:00
/*
2000-05-13 10:47:56 +08:00
* Copyright 1998-2000 The OpenLDAP Foundation, All Rights Reserved.
1999-08-07 07:07:46 +08:00
* COPYING RESTRICTIONS APPLY, see COPYRIGHT file
*/
1998-08-09 08:43:13 +08:00
1998-10-25 09:41:42 +08:00
#include "portable.h"
1998-08-09 08:43:13 +08:00
#include <stdio.h>
1998-10-25 09:41:42 +08:00
#include <ac/string.h>
#include <ac/socket.h>
1998-08-09 08:43:13 +08:00
#include "slap.h"
#include "back-ldbm.h"
#include "proto-back-ldbm.h"
1998-08-09 08:43:13 +08:00
int
dn2id_add(
Backend *be,
1999-08-21 03:00:44 +08:00
const char *dn,
1998-08-09 08:43:13 +08:00
ID id
)
{
int rc, flags;
DBCache *db;
1998-08-09 08:43:13 +08:00
Datum key, data;
struct ldbminfo *li = (struct ldbminfo *) be->be_private;
1998-08-09 08:43:13 +08:00
Debug( LDAP_DEBUG_TRACE, "=> dn2id_add( \"%s\", %ld )\n", dn, id, 0 );
assert( id != NOID );
1998-08-09 08:43:13 +08:00
if ( (db = ldbm_cache_open( be, "dn2id", LDBM_SUFFIX, LDBM_WRCREAT ))
== NULL ) {
Debug( LDAP_DEBUG_ANY, "Could not open/create dn2id%s\n",
LDBM_SUFFIX, 0, 0 );
return( -1 );
}
ldbm_datum_init( key );
key.dsize = strlen( dn ) + 2;
key.dptr = ch_malloc( key.dsize );
sprintf( key.dptr, "%c%s", DN_BASE_PREFIX, dn );
ldbm_datum_init( data );
1998-08-09 08:43:13 +08:00
data.dptr = (char *) &id;
data.dsize = sizeof(ID);
flags = LDBM_INSERT;
rc = ldbm_cache_store( db, key, data, flags );
1998-08-09 08:43:13 +08:00
free( key.dptr );
if ( rc != -1 ) {
char *pdn = dn_parent( NULL, dn );
if( pdn != NULL ) {
ldbm_datum_init( key );
key.dsize = strlen( pdn ) + 2;
key.dptr = ch_malloc( key.dsize );
sprintf( key.dptr, "%c%s", DN_ONE_PREFIX, pdn );
rc = idl_insert_key( be, db, key, id );
free( key.dptr );
1999-08-20 00:51:43 +08:00
free( pdn );
}
}
if ( rc != -1 ) {
char **subtree = dn_subtree( NULL, dn );
if( subtree != NULL ) {
int i;
for( i=0; subtree[i] != NULL; i++ ) {
ldbm_datum_init( key );
key.dsize = strlen( subtree[i] ) + 2;
key.dptr = ch_malloc( key.dsize );
sprintf( key.dptr, "%c%s",
DN_SUBTREE_PREFIX, subtree[i] );
rc = idl_insert_key( be, db, key, id );
free( key.dptr );
if(rc == -1) break;
}
charray_free( subtree );
}
}
ldbm_cache_close( be, db );
1998-08-09 08:43:13 +08:00
Debug( LDAP_DEBUG_TRACE, "<= dn2id_add %d\n", rc, 0, 0 );
return( rc );
}
ID
dn2id(
Backend *be,
1999-08-21 03:00:44 +08:00
const char *dn
1998-08-09 08:43:13 +08:00
)
{
struct ldbminfo *li = (struct ldbminfo *) be->be_private;
DBCache *db;
1998-08-09 08:43:13 +08:00
ID id;
Datum key, data;
1998-08-19 01:51:53 +08:00
Debug( LDAP_DEBUG_TRACE, "=> dn2id( \"%s\" )\n", dn, 0, 0 );
1998-08-09 08:43:13 +08:00
/* first check the cache */
if ( (id = cache_find_entry_dn2id( be, &li->li_cache, dn )) != NOID ) {
Debug( LDAP_DEBUG_TRACE, "<= dn2id %ld (in cache)\n", id,
0, 0 );
1998-08-09 08:43:13 +08:00
return( id );
}
if ( (db = ldbm_cache_open( be, "dn2id", LDBM_SUFFIX, LDBM_WRCREAT ))
== NULL ) {
1998-08-09 08:43:13 +08:00
Debug( LDAP_DEBUG_ANY, "<= dn2id could not open dn2id%s\n",
LDBM_SUFFIX, 0, 0 );
1998-08-09 08:43:13 +08:00
return( NOID );
}
ldbm_datum_init( key );
key.dsize = strlen( dn ) + 2;
key.dptr = ch_malloc( key.dsize );
sprintf( key.dptr, "%c%s", DN_BASE_PREFIX, dn );
1998-08-09 08:43:13 +08:00
data = ldbm_cache_fetch( db, key );
ldbm_cache_close( be, db );
free( key.dptr );
1998-08-09 08:43:13 +08:00
if ( data.dptr == NULL ) {
Debug( LDAP_DEBUG_TRACE, "<= dn2id NOID\n", 0, 0, 0 );
return( NOID );
}
(void) memcpy( (char *) &id, data.dptr, sizeof(ID) );
assert( id != NOID );
1998-08-09 08:43:13 +08:00
ldbm_datum_free( db->dbc_db, data );
Debug( LDAP_DEBUG_TRACE, "<= dn2id %ld\n", id, 0, 0 );
1998-08-09 08:43:13 +08:00
return( id );
}
ID_BLOCK *
dn2idl(
Backend *be,
1999-08-21 03:00:44 +08:00
const char *dn,
int prefix
)
{
DBCache *db;
Datum key;
ID_BLOCK *idl;
Debug( LDAP_DEBUG_TRACE, "=> dn2idl( \"%c%s\" )\n", prefix, dn, 0 );
if ( (db = ldbm_cache_open( be, "dn2id", LDBM_SUFFIX, LDBM_WRCREAT ))
== NULL ) {
Debug( LDAP_DEBUG_ANY, "<= dn2idl could not open dn2id%s\n",
LDBM_SUFFIX, 0, 0 );
return NULL;
}
ldbm_datum_init( key );
key.dsize = strlen( dn ) + 2;
key.dptr = ch_malloc( key.dsize );
sprintf( key.dptr, "%c%s", prefix, dn );
idl = idl_fetch( be, db, key );
ldbm_cache_close( be, db );
free( key.dptr );
return( idl );
}
1998-08-09 08:43:13 +08:00
int
dn2id_delete(
Backend *be,
const char *dn,
ID id
1998-08-09 08:43:13 +08:00
)
{
DBCache *db;
1998-08-09 08:43:13 +08:00
Datum key;
int rc;
Debug( LDAP_DEBUG_TRACE, "=> dn2id_delete( \"%s\", %ld )\n", dn, id, 0 );
1998-08-09 08:43:13 +08:00
assert( id != NOID );
1998-08-09 08:43:13 +08:00
if ( (db = ldbm_cache_open( be, "dn2id", LDBM_SUFFIX, LDBM_WRCREAT ))
== NULL ) {
Debug( LDAP_DEBUG_ANY,
"<= dn2id_delete could not open dn2id%s\n", LDBM_SUFFIX,
0, 0 );
return( -1 );
}
{
char *pdn = dn_parent( NULL, dn );
if( pdn != NULL ) {
ldbm_datum_init( key );
key.dsize = strlen( pdn ) + 2;
key.dptr = ch_malloc( key.dsize );
sprintf( key.dptr, "%c%s", DN_ONE_PREFIX, pdn );
(void) idl_delete_key( be, db, key, id );
free( key.dptr );
free( pdn );
}
}
{
char **subtree = dn_subtree( NULL, dn );
if( subtree != NULL ) {
int i;
for( i=0; subtree[i] != NULL; i++ ) {
ldbm_datum_init( key );
key.dsize = strlen( subtree[i] ) + 2;
key.dptr = ch_malloc( key.dsize );
sprintf( key.dptr, "%c%s",
DN_SUBTREE_PREFIX, subtree[i] );
(void) idl_delete_key( be, db, key, id );
free( key.dptr );
}
charray_free( subtree );
}
}
ldbm_datum_init( key );
key.dsize = strlen( dn ) + 2;
key.dptr = ch_malloc( key.dsize );
sprintf( key.dptr, "%c%s", DN_BASE_PREFIX, dn );
1998-08-09 08:43:13 +08:00
rc = ldbm_cache_delete( db, key );
free( key.dptr );
1999-01-19 04:49:07 +08:00
1998-08-09 08:43:13 +08:00
ldbm_cache_close( be, db );
Debug( LDAP_DEBUG_TRACE, "<= dn2id_delete %d\n", rc, 0, 0 );
return( rc );
}
/*
* dn2entry - look up dn in the cache/indexes and return the corresponding
* entry.
*/
Entry *
dn2entry_rw(
1998-08-09 08:43:13 +08:00
Backend *be,
1999-08-21 03:00:44 +08:00
const char *dn,
Entry **matched,
int rw
1998-08-09 08:43:13 +08:00
)
{
ID id;
Entry *e = NULL;
1998-08-09 08:43:13 +08:00
char *pdn;
1999-01-19 01:33:36 +08:00
Debug(LDAP_DEBUG_TRACE, "dn2entry_%s: dn: \"%s\"\n",
rw ? "w" : "r", dn, 0);
if( matched != NULL ) {
/* caller cares about match */
*matched = NULL;
}
if ( (id = dn2id( be, dn )) != NOID &&
(e = id2entry_rw( be, id, rw )) != NULL )
{
1998-08-09 08:43:13 +08:00
return( e );
}
if ( id != NOID ) {
Debug(LDAP_DEBUG_ANY,
"dn2entry_%s: no entry for valid id (%ld), dn \"%s\"\n",
rw ? "w" : "r", id, dn);
/* must have been deleted from underneath us */
/* treat as if NOID was found */
}
/* caller doesn't care about match */
if( matched == NULL ) return NULL;
1998-08-09 08:43:13 +08:00
/* entry does not exist - see how much of the dn does exist */
/* dn_parent checks returns NULL if dn is suffix */
1998-08-09 08:43:13 +08:00
if ( (pdn = dn_parent( be, dn )) != NULL ) {
/* get entry with reader lock */
if ( (e = dn2entry_r( be, pdn, matched )) != NULL ) {
*matched = e;
1998-08-09 08:43:13 +08:00
}
free( pdn );
1998-08-09 08:43:13 +08:00
}
return NULL;
1998-08-09 08:43:13 +08:00
}