id2entry.c 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475
  1. /** BEGIN COPYRIGHT BLOCK
  2. * This Program is free software; you can redistribute it and/or modify it under
  3. * the terms of the GNU General Public License as published by the Free Software
  4. * Foundation; version 2 of the License.
  5. *
  6. * This Program is distributed in the hope that it will be useful, but WITHOUT
  7. * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
  8. * FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
  9. *
  10. * You should have received a copy of the GNU General Public License along with
  11. * this Program; if not, write to the Free Software Foundation, Inc., 59 Temple
  12. * Place, Suite 330, Boston, MA 02111-1307 USA.
  13. *
  14. * In addition, as a special exception, Red Hat, Inc. gives You the additional
  15. * right to link the code of this Program with code not covered under the GNU
  16. * General Public License ("Non-GPL Code") and to distribute linked combinations
  17. * including the two, subject to the limitations in this paragraph. Non-GPL Code
  18. * permitted under this exception must only link to the code of this Program
  19. * through those well defined interfaces identified in the file named EXCEPTION
  20. * found in the source code files (the "Approved Interfaces"). The files of
  21. * Non-GPL Code may instantiate templates or use macros or inline functions from
  22. * the Approved Interfaces without causing the resulting work to be covered by
  23. * the GNU General Public License. Only Red Hat, Inc. may make changes or
  24. * additions to the list of Approved Interfaces. You must obey the GNU General
  25. * Public License in all respects for all of the Program code and other code used
  26. * in conjunction with the Program except the Non-GPL Code covered by this
  27. * exception. If you modify this file, you may extend this exception to your
  28. * version of the file, but you are not obligated to do so. If you do not wish to
  29. * provide this exception without modification, you must delete this exception
  30. * statement from your version and license this file solely under the GPL without
  31. * exception.
  32. *
  33. *
  34. * Copyright (C) 2001 Sun Microsystems, Inc. Used by permission.
  35. * Copyright (C) 2005 Red Hat, Inc.
  36. * All rights reserved.
  37. * END COPYRIGHT BLOCK **/
  38. #ifdef HAVE_CONFIG_H
  39. # include <config.h>
  40. #endif
  41. /* id2entry.c - routines to deal with the id2entry index */
  42. #include "back-ldbm.h"
  43. #define ID2ENTRY "id2entry"
  44. /*
  45. * The caller MUST check for DB_LOCK_DEADLOCK and DB_RUNRECOVERY returned
  46. */
  47. int
  48. id2entry_add_ext( backend *be, struct backentry *e, back_txn *txn, int encrypt )
  49. {
  50. ldbm_instance *inst = (ldbm_instance *) be->be_instance_info;
  51. DB *db = NULL;
  52. DB_TXN *db_txn = NULL;
  53. DBT data;
  54. DBT key;
  55. int len, rc;
  56. char temp_id[sizeof(ID)];
  57. struct backentry *encrypted_entry = NULL;
  58. char *entrydn = NULL;
  59. LDAPDebug( LDAP_DEBUG_TRACE, "=> id2entry_add( %lu, \"%s\" )\n",
  60. (u_long)e->ep_id, backentry_get_ndn(e), 0 );
  61. if ( (rc = dblayer_get_id2entry( be, &db )) != 0 ) {
  62. LDAPDebug( LDAP_DEBUG_ANY, "Could not open/create id2entry\n",
  63. 0, 0, 0 );
  64. rc = -1;
  65. goto done;
  66. }
  67. id_internal_to_stored(e->ep_id,temp_id);
  68. memset(&key, 0, sizeof(key));
  69. key.dptr = temp_id;
  70. key.dsize = sizeof(temp_id);
  71. /* Encrypt attributes in this entry if necessary */
  72. if (encrypt) {
  73. rc = attrcrypt_encrypt_entry(be, e, &encrypted_entry);
  74. if (rc) {
  75. LDAPDebug( LDAP_DEBUG_ANY, "attrcrypt_encrypt_entry failed in id2entry_add\n",
  76. 0, 0, 0 );
  77. rc = -1;
  78. goto done;
  79. }
  80. }
  81. {
  82. int options = SLAPI_DUMP_STATEINFO | SLAPI_DUMP_UNIQUEID;
  83. Slapi_Entry *entry_to_use = encrypted_entry ? encrypted_entry->ep_entry : e->ep_entry;
  84. memset(&data, 0, sizeof(data));
  85. if (entryrdn_get_switch())
  86. {
  87. Slapi_Attr *eattr = NULL;
  88. struct backdn *oldbdn = NULL;
  89. Slapi_DN *sdn =
  90. slapi_sdn_dup(slapi_entry_get_sdn_const(e->ep_entry));
  91. struct backdn *bdn = backdn_init(sdn, e->ep_id, 0);
  92. options |= SLAPI_DUMP_RDN_ENTRY;
  93. /* If the ID already exists in the DN cache && the DNs do not match,
  94. * replace it. */
  95. if (CACHE_ADD( &inst->inst_dncache, bdn, &oldbdn ) == 1) {
  96. if (slapi_sdn_compare(sdn, oldbdn->dn_sdn)) {
  97. if (cache_replace( &inst->inst_dncache, oldbdn, bdn ) != 0) {
  98. /* The entry was not in the cache for some reason (this
  99. * should not happen since CACHE_ADD said it existed above). */
  100. LDAPDebug( LDAP_DEBUG_ANY, "id2entry_add_ext(): Entry disappeared "
  101. "from cache (%s)\n", oldbdn->dn_sdn, 0, 0 );
  102. }
  103. }
  104. CACHE_RETURN(&inst->inst_dncache, &oldbdn); /* to free oldbdn */
  105. }
  106. CACHE_RETURN(&inst->inst_dncache, &bdn);
  107. LDAPDebug( LDAP_DEBUG_TRACE,
  108. "=> id2entry_add (dncache) ( %lu, \"%s\" )\n",
  109. (u_long)e->ep_id, slapi_entry_get_dn_const(e->ep_entry), 0 );
  110. /* If entrydn exists in the entry, we have to remove it before
  111. * writing the entry to the database. */
  112. if (0 == slapi_entry_attr_find(e->ep_entry,
  113. LDBM_ENTRYDN_STR, &eattr)) {
  114. /* entrydn exists in the entry. let's removed it. */
  115. slapi_entry_delete_values(e->ep_entry, LDBM_ENTRYDN_STR, NULL);
  116. }
  117. }
  118. data.dptr = slapi_entry2str_with_options(entry_to_use, &len, options);
  119. data.dsize = len + 1;
  120. }
  121. if (NULL != txn) {
  122. db_txn = txn->back_txn_txn;
  123. }
  124. /* call pre-entry-store plugin */
  125. plugin_call_entrystore_plugins( (char **) &data.dptr, &data.dsize );
  126. /* store it */
  127. rc = db->put( db, db_txn, &key, &data, 0);
  128. /* DBDB looks like we're freeing memory allocated by another DLL, which is bad */
  129. slapi_ch_free( &(data.dptr) );
  130. dblayer_release_id2entry( be, db );
  131. if (0 == rc)
  132. {
  133. if (entryrdn_get_switch()) {
  134. struct backentry *parententry = NULL;
  135. ID parentid = slapi_entry_attr_get_ulong(e->ep_entry, "parentid");
  136. const char *myrdn = slapi_entry_get_rdn_const(e->ep_entry);
  137. const char *parentdn = NULL;
  138. char *myparentdn = NULL;
  139. Slapi_Attr *eattr = NULL;
  140. /* If the parent is in the cache, check the parent's DN and
  141. * adjust to it if they don't match. (bz628300) */
  142. if (parentid && myrdn) {
  143. parententry = cache_find_id(&inst->inst_cache, parentid);
  144. if (parententry) {
  145. parentdn = slapi_entry_get_dn_const(parententry->ep_entry);
  146. if (parentdn) {
  147. myparentdn =
  148. slapi_dn_parent(slapi_entry_get_dn_const(e->ep_entry));
  149. if (myparentdn && PL_strcmp(parentdn, myparentdn)) {
  150. Slapi_DN *sdn = slapi_entry_get_sdn(e->ep_entry);
  151. char *newdn = NULL;
  152. slapi_sdn_done(sdn);
  153. newdn = slapi_ch_smprintf("%s,%s", myrdn, parentdn);
  154. slapi_sdn_init_dn_passin(sdn, newdn);
  155. slapi_sdn_get_ndn(sdn); /* to set ndn */
  156. }
  157. slapi_ch_free_string(&myparentdn);
  158. }
  159. CACHE_RETURN(&inst->inst_cache, &parententry);
  160. }
  161. }
  162. /*
  163. * Adding entrydn attribute value to the entry,
  164. * which should be done before adding the entry to the entry cache.
  165. * Note: since we removed entrydn from the entry before writing
  166. * it to the database, it is guaranteed not in the entry.
  167. */
  168. /* slapi_ch_strdup and slapi_dn_ignore_case never returns NULL */
  169. entrydn = slapi_ch_strdup(slapi_entry_get_dn_const(e->ep_entry));
  170. entrydn = slapi_dn_ignore_case(entrydn);
  171. slapi_entry_attr_set_charptr (e->ep_entry,
  172. LDBM_ENTRYDN_STR, entrydn);
  173. if (0 == slapi_entry_attr_find(e->ep_entry,
  174. LDBM_ENTRYDN_STR, &eattr)) {
  175. /* now entrydn should exist in the entry */
  176. /* Set it to operational attribute */
  177. eattr->a_flags = SLAPI_ATTR_FLAG_OPATTR;
  178. }
  179. slapi_ch_free_string(&entrydn);
  180. }
  181. /*
  182. * For ldbm_back_add and ldbm_back_modify, this entry had been already
  183. * reserved as a tentative entry. So, it should be safe.
  184. * For ldbm_back_modify, the original entry having the same dn/id
  185. * should be in the cache. Thus, this entry e won't be put into the
  186. * entry cache. It'll be added by cache_replace.
  187. */
  188. (void) CACHE_ADD( &inst->inst_cache, e, NULL );
  189. }
  190. done:
  191. /* If we had an encrypted entry, we no longer need it */
  192. if (encrypted_entry) {
  193. backentry_free(&encrypted_entry);
  194. }
  195. LDAPDebug( LDAP_DEBUG_TRACE, "<= id2entry_add %d\n", rc, 0, 0 );
  196. return( rc );
  197. }
  198. int
  199. id2entry_add( backend *be, struct backentry *e, back_txn *txn )
  200. {
  201. return id2entry_add_ext(be,e,txn,1);
  202. }
  203. /*
  204. * The caller MUST check for DB_LOCK_DEADLOCK and DB_RUNRECOVERY returned
  205. */
  206. int
  207. id2entry_delete( backend *be, struct backentry *e, back_txn *txn )
  208. {
  209. DB *db = NULL;
  210. DB_TXN *db_txn = NULL;
  211. DBT key = {0};
  212. int rc;
  213. char temp_id[sizeof(ID)];
  214. LDAPDebug( LDAP_DEBUG_TRACE, "=> id2entry_delete( %lu, \"%s\" )\n",
  215. (u_long)e->ep_id, backentry_get_ndn(e), 0 );
  216. if ( (rc = dblayer_get_id2entry( be, &db )) != 0 ) {
  217. LDAPDebug( LDAP_DEBUG_ANY, "Could not open/create id2entry\n",
  218. 0, 0, 0 );
  219. return( -1 );
  220. }
  221. id_internal_to_stored(e->ep_id,temp_id);
  222. key.dptr = temp_id;
  223. key.dsize = sizeof(temp_id);
  224. if (NULL != txn) {
  225. db_txn = txn->back_txn_txn;
  226. }
  227. if (entryrdn_get_switch())
  228. {
  229. ldbm_instance *inst = (ldbm_instance *)be->be_instance_info;
  230. struct backdn *bdn = dncache_find_id(&inst->inst_dncache, e->ep_id);
  231. if (bdn) {
  232. slapi_log_error(SLAPI_LOG_CACHE, ID2ENTRY,
  233. "dncache_find_id returned: %s\n",
  234. slapi_sdn_get_dn(bdn->dn_sdn));
  235. CACHE_REMOVE(&inst->inst_dncache, bdn);
  236. CACHE_RETURN(&inst->inst_dncache, &bdn);
  237. }
  238. }
  239. rc = db->del( db,db_txn,&key,0 );
  240. dblayer_release_id2entry( be, db );
  241. LDAPDebug( LDAP_DEBUG_TRACE, "<= id2entry_delete %d\n", rc, 0, 0 );
  242. return( rc );
  243. }
  244. struct backentry *
  245. id2entry( backend *be, ID id, back_txn *txn, int *err )
  246. {
  247. ldbm_instance *inst = (ldbm_instance *) be->be_instance_info;
  248. DB *db = NULL;
  249. DB_TXN *db_txn = NULL;
  250. DBT key = {0};
  251. DBT data = {0};
  252. struct backentry *e = NULL;
  253. Slapi_Entry *ee;
  254. char temp_id[sizeof(ID)];
  255. slapi_log_error(SLAPI_LOG_TRACE, ID2ENTRY,
  256. "=> id2entry(%lu)\n", (u_long)id);
  257. if ( (e = cache_find_id( &inst->inst_cache, id )) != NULL ) {
  258. slapi_log_error(SLAPI_LOG_TRACE, ID2ENTRY,
  259. "<= id2entry %p, dn \"%s\" (cache)\n",
  260. e, backentry_get_ndn(e));
  261. goto bail;
  262. }
  263. if ( (*err = dblayer_get_id2entry( be, &db )) != 0 ) {
  264. slapi_log_error(SLAPI_LOG_FATAL, ID2ENTRY,
  265. "Could not open id2entry err %d\n", *err);
  266. return( NULL );
  267. }
  268. id_internal_to_stored(id,temp_id);
  269. key.data = temp_id;
  270. key.size = sizeof(temp_id);
  271. /* DBDB need to improve this, we're mallocing, freeing, all over the place here */
  272. data.flags = DB_DBT_MALLOC;
  273. if (NULL != txn) {
  274. db_txn = txn->back_txn_txn;
  275. }
  276. do {
  277. *err = db->get( db, db_txn, &key, &data, 0 );
  278. if ( (0 != *err) &&
  279. (DB_NOTFOUND != *err) && (DB_LOCK_DEADLOCK != *err) )
  280. {
  281. slapi_log_error(SLAPI_LOG_FATAL, ID2ENTRY, "db error %d (%s)\n",
  282. *err, dblayer_strerror( *err ));
  283. }
  284. }
  285. while ( (DB_LOCK_DEADLOCK == *err) && (txn == NULL) );
  286. if ( (0 != *err) && (DB_NOTFOUND != *err) && (DB_LOCK_DEADLOCK != *err) )
  287. {
  288. if ( (DB_BUFFER_SMALL == *err) && (data.dptr == NULL) )
  289. {
  290. /*
  291. * Now we are setting slapi_ch_malloc and its friends to libdb
  292. * by ENV->set_alloc in dblayer.c. As long as the functions are
  293. * used by libdb, it won't reach here.
  294. */
  295. slapi_log_error(SLAPI_LOG_FATAL, ID2ENTRY,
  296. "malloc failed in libdb; "
  297. "terminating the server; OS error %d (%s)\n",
  298. *err, slapd_system_strerror( *err ));
  299. exit (1);
  300. }
  301. dblayer_release_id2entry( be, db );
  302. return( NULL );
  303. }
  304. if ( data.dptr == NULL ) {
  305. slapi_log_error(SLAPI_LOG_TRACE, ID2ENTRY,
  306. "<= id2entry( %lu ) not found\n", (u_long)id);
  307. goto bail;
  308. }
  309. /* call post-entry plugin */
  310. plugin_call_entryfetch_plugins( (char **) &data.dptr, &data.dsize );
  311. if (entryrdn_get_switch()) {
  312. char *rdn = NULL;
  313. int rc = 0;
  314. /* rdn is allocated in get_value_from_string */
  315. rc = get_value_from_string((const char *)data.dptr, "rdn", &rdn);
  316. if (rc) {
  317. /* data.dptr may not include rdn: ..., try "dn: ..." */
  318. ee = slapi_str2entry( data.dptr, 0 );
  319. } else {
  320. char *dn = NULL;
  321. struct backdn *bdn = dncache_find_id(&inst->inst_dncache, id);
  322. if (bdn) {
  323. dn = slapi_ch_strdup(slapi_sdn_get_dn(bdn->dn_sdn));
  324. slapi_log_error(SLAPI_LOG_CACHE, ID2ENTRY,
  325. "dncache_find_id returned: %s\n", dn);
  326. CACHE_RETURN(&inst->inst_dncache, &bdn);
  327. } else {
  328. Slapi_DN *sdn = NULL;
  329. rc = entryrdn_lookup_dn(be, rdn, id, &dn, txn);
  330. if (rc) {
  331. slapi_log_error(SLAPI_LOG_TRACE, ID2ENTRY,
  332. "id2entry: entryrdn look up failed "
  333. "(rdn=%s, ID=%d)\n", rdn, id);
  334. /* Try rdn as dn. Could be RUV. */
  335. dn = slapi_ch_strdup(rdn);
  336. }
  337. sdn = slapi_sdn_new_dn_byval((const char *)dn);
  338. bdn = backdn_init(sdn, id, 0);
  339. CACHE_ADD( &inst->inst_dncache, bdn, NULL );
  340. CACHE_RETURN(&inst->inst_dncache, &bdn);
  341. slapi_log_error(SLAPI_LOG_CACHE, ID2ENTRY,
  342. "entryrdn_lookup_dn returned: %s, "
  343. "and set to dn cache (id %d)\n", dn, id);
  344. }
  345. ee = slapi_str2entry_ext( (const char *)dn, data.dptr, 0 );
  346. slapi_ch_free_string(&rdn);
  347. slapi_ch_free_string(&dn);
  348. }
  349. } else {
  350. ee = slapi_str2entry( data.dptr, 0 );
  351. }
  352. if ( ee != NULL ) {
  353. int retval = 0;
  354. struct backentry *imposter = NULL;
  355. /* All entries should have uniqueids */
  356. PR_ASSERT(slapi_entry_get_uniqueid(ee) != NULL);
  357. /* ownership of the entry is passed into the backentry */
  358. e = backentry_init( ee );
  359. e->ep_id = id;
  360. slapi_log_error(SLAPI_LOG_TRACE, ID2ENTRY,
  361. "id2entry id: %d, dn \"%s\" -- adding it to cache\n",
  362. id, backentry_get_ndn(e));
  363. /* Decrypt any encrypted attributes in this entry,
  364. * before adding it to the cache */
  365. retval = attrcrypt_decrypt_entry(be, e);
  366. if (retval) {
  367. slapi_log_error(SLAPI_LOG_FATAL, ID2ENTRY,
  368. "attrcrypt_decrypt_entry failed in id2entry\n");
  369. }
  370. /*
  371. * If return entry exists AND entryrdn switch is on,
  372. * add the entrydn value.
  373. */
  374. if (entryrdn_get_switch()) {
  375. Slapi_Attr *eattr = NULL;
  376. /* Check if entrydn is in the entry or not */
  377. if (slapi_entry_attr_find(e->ep_entry, LDBM_ENTRYDN_STR, &eattr)) {
  378. /* entrydn does not exist in the entry */
  379. char *entrydn = NULL;
  380. /* slapi_ch_strdup and slapi_dn_ignore_case never returns NULL */
  381. entrydn = slapi_ch_strdup(slapi_entry_get_dn_const(e->ep_entry));
  382. entrydn = slapi_dn_ignore_case(entrydn);
  383. slapi_entry_attr_set_charptr (e->ep_entry,
  384. LDBM_ENTRYDN_STR, entrydn);
  385. if (0 == slapi_entry_attr_find(e->ep_entry,
  386. LDBM_ENTRYDN_STR, &eattr)) {
  387. /* now entrydn should exist in the entry */
  388. /* Set it to operational attribute */
  389. eattr->a_flags = SLAPI_ATTR_FLAG_OPATTR;
  390. }
  391. slapi_ch_free_string(&entrydn);
  392. }
  393. }
  394. retval = CACHE_ADD( &inst->inst_cache, e, &imposter );
  395. if (1 == retval) {
  396. /* This means that someone else put the entry in the cache
  397. while we weren't looking ! So, we need to use the pointer
  398. returned and free the one we made earlier */
  399. if (imposter)
  400. {
  401. backentry_free(&e);
  402. e = imposter;
  403. }
  404. } else if (-1 == retval) {
  405. /* the entry is in idtable but not in dntable, i.e., the entry
  406. * could have been renamed */
  407. slapi_log_error(SLAPI_LOG_TRACE, ID2ENTRY,
  408. "id2entry: failed to put entry (id %lu, dn %s) "
  409. "into entry cache\n", (u_long)id,
  410. backentry_get_ndn(e));
  411. }
  412. } else {
  413. slapi_log_error(SLAPI_LOG_FATAL, ID2ENTRY,
  414. "str2entry returned NULL for id %lu, string=\"%s\"\n",
  415. (u_long)id, (char*)data.data);
  416. e = NULL;
  417. }
  418. bail:
  419. slapi_ch_free( &(data.data) );
  420. dblayer_release_id2entry( be, db );
  421. slapi_log_error(SLAPI_LOG_TRACE, ID2ENTRY,
  422. "<= id2entry( %lu ) %p (disk)\n", (u_long)id, e);
  423. return( e );
  424. }