1 /* id2children.c - routines to deal with the id2children index */
10 #include "back-ldbm.h"
12 struct dbcache *ldbm_cache_open();
13 extern Datum ldbm_cache_fetch();
29 #ifdef HAVE_BERKELEY_DB2
31 memset( &key, 0, sizeof( key ) );
32 memset( &data, 0, sizeof( data ) );
35 Debug( LDAP_DEBUG_TRACE, "=> id2children_add( %d, %d )\n", p ? p->e_id
38 if ( (db = ldbm_cache_open( be, "id2children", LDBM_SUFFIX,
39 LDBM_WRCREAT )) == NULL ) {
40 Debug( LDAP_DEBUG_ANY,
41 "<= id2children_add -1 could not open \"id2children%s\"\n",
46 sprintf( buf, "%c%ld", EQ_PREFIX, p ? p->e_id : 0 );
48 key.dsize = strlen( buf ) + 1;
50 if ( idl_insert_key( be, db, key, e->e_id ) != 0 ) {
51 Debug( LDAP_DEBUG_TRACE, "<= id2children_add -1 (idl_insert)\n",
53 ldbm_cache_close( be, db );
57 ldbm_cache_close( be, db );
59 Debug( LDAP_DEBUG_TRACE, "<= id2children_add 0\n", 0, 0, 0 );
75 #ifdef HAVE_BERKELEY_DB2
76 memset( &key, 0, sizeof( key ) );
79 Debug( LDAP_DEBUG_TRACE, "=> has_children( %d )\n", p->e_id , 0, 0 );
81 if ( (db = ldbm_cache_open( be, "id2children", LDBM_SUFFIX,
82 LDBM_WRCREAT )) == NULL ) {
83 Debug( LDAP_DEBUG_ANY,
84 "<= has_children -1 could not open \"id2children%s\"\n",
89 sprintf( buf, "%c%ld", EQ_PREFIX, p->e_id );
91 key.dsize = strlen( buf ) + 1;
93 idl = idl_fetch( be, db, key );
95 ldbm_cache_close( be, db );
99 Debug( LDAP_DEBUG_TRACE, "<= has_children %d\n", rc, 0, 0 );