/* id2children.c - routines to deal with the id2children index */ #include "portable.h" #include #include #include #include "slap.h" #include "back-ldbm.h" struct dbcache *ldbm_cache_open(); extern Datum ldbm_cache_fetch(); IDList *idl_fetch(); int id2children_add( Backend *be, Entry *p, Entry *e ) { struct dbcache *db; Datum key; int len, rc; IDList *idl; char buf[20]; #ifdef HAVE_BERKELEY_DB2 Datum data; memset( &key, 0, sizeof( key ) ); memset( &data, 0, sizeof( data ) ); #endif Debug( LDAP_DEBUG_TRACE, "=> id2children_add( %d, %d )\n", p ? p->e_id : 0, e->e_id, 0 ); if ( (db = ldbm_cache_open( be, "id2children", LDBM_SUFFIX, LDBM_WRCREAT )) == NULL ) { Debug( LDAP_DEBUG_ANY, "<= id2children_add -1 could not open \"id2children%s\"\n", LDBM_SUFFIX, 0, 0 ); return( -1 ); } sprintf( buf, "%c%ld", EQ_PREFIX, p ? p->e_id : 0 ); key.dptr = buf; key.dsize = strlen( buf ) + 1; if ( idl_insert_key( be, db, key, e->e_id ) != 0 ) { Debug( LDAP_DEBUG_TRACE, "<= id2children_add -1 (idl_insert)\n", 0, 0, 0 ); ldbm_cache_close( be, db ); return( -1 ); } ldbm_cache_close( be, db ); Debug( LDAP_DEBUG_TRACE, "<= id2children_add 0\n", 0, 0, 0 ); return( 0 ); } int has_children( Backend *be, Entry *p ) { struct dbcache *db; Datum key; int rc; IDList *idl; char buf[20]; #ifdef HAVE_BERKELEY_DB2 memset( &key, 0, sizeof( key ) ); #endif Debug( LDAP_DEBUG_TRACE, "=> has_children( %d )\n", p->e_id , 0, 0 ); if ( (db = ldbm_cache_open( be, "id2children", LDBM_SUFFIX, LDBM_WRCREAT )) == NULL ) { Debug( LDAP_DEBUG_ANY, "<= has_children -1 could not open \"id2children%s\"\n", LDBM_SUFFIX, 0, 0 ); return( 0 ); } sprintf( buf, "%c%ld", EQ_PREFIX, p->e_id ); key.dptr = buf; key.dsize = strlen( buf ) + 1; idl = idl_fetch( be, db, key ); ldbm_cache_close( be, db ); rc = idl ? 1 : 0; idl_free( idl ); Debug( LDAP_DEBUG_TRACE, "<= has_children %d\n", rc, 0, 0 ); return( rc ); }