1 /* id2children.c - routines to deal with the id2children index */
11 #include "back-ldbm.h"
13 struct dbcache *ldbm_cache_open();
14 extern Datum ldbm_cache_fetch();
30 #ifdef HAVE_BERKELEY_DB2
32 memset( &key, 0, sizeof( key ) );
33 memset( &data, 0, sizeof( data ) );
36 Debug( LDAP_DEBUG_TRACE, "=> id2children_add( %d, %d )\n", p ? p->e_id
39 if ( (db = ldbm_cache_open( be, "id2children", LDBM_SUFFIX,
40 LDBM_WRCREAT )) == NULL ) {
41 Debug( LDAP_DEBUG_ANY,
42 "<= id2children_add -1 could not open \"id2children%s\"\n",
47 sprintf( buf, "%c%ld", EQ_PREFIX, p ? p->e_id : 0 );
49 key.dsize = strlen( buf ) + 1;
51 if ( idl_insert_key( be, db, key, e->e_id ) != 0 ) {
52 Debug( LDAP_DEBUG_TRACE, "<= id2children_add -1 (idl_insert)\n",
54 ldbm_cache_close( be, db );
58 ldbm_cache_close( be, db );
60 Debug( LDAP_DEBUG_TRACE, "<= id2children_add 0\n", 0, 0, 0 );
78 Debug( LDAP_DEBUG_TRACE, "=> id2children_remove( %d, %d )\n", p ? p->e_id
81 if ( (db = ldbm_cache_open( be, "id2children", LDBM_SUFFIX,
82 LDBM_WRCREAT )) == NULL ) {
83 Debug( LDAP_DEBUG_ANY,
84 "<= id2children_add -1 could not open \"id2children%s\"\n",
89 memset( &key, 0, sizeof(key) );
90 sprintf( buf, "%c%d", EQ_PREFIX, p ? p->e_id : 0 );
92 key.dsize = strlen( buf ) + 1;
94 if ( idl_delete_key( be, db, key, e->e_id ) != 0 ) {
95 Debug( LDAP_DEBUG_TRACE, "<= id2children_add -1 (idl_insert)\n",
97 ldbm_cache_close( be, db );
101 ldbm_cache_close( be, db );
103 Debug( LDAP_DEBUG_TRACE, "<= id2children_add 0\n", 0, 0, 0 );
119 #ifdef HAVE_BERKELEY_DB2
120 memset( &key, 0, sizeof( key ) );
123 Debug( LDAP_DEBUG_TRACE, "=> has_children( %d )\n", p->e_id , 0, 0 );
125 if ( (db = ldbm_cache_open( be, "id2children", LDBM_SUFFIX,
126 LDBM_WRCREAT )) == NULL ) {
127 Debug( LDAP_DEBUG_ANY,
128 "<= has_children -1 could not open \"id2children%s\"\n",
133 sprintf( buf, "%c%ld", EQ_PREFIX, p->e_id );
135 key.dsize = strlen( buf ) + 1;
137 idl = idl_fetch( be, db, key );
139 ldbm_cache_close( be, db );
143 Debug( LDAP_DEBUG_TRACE, "<= has_children %d\n", rc, 0, 0 );