id2entry.c 19 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492
  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. * If cache_res is not NULL, it stores the result of CACHE_ADD of the
  47. * entry cache.
  48. */
  49. int
  50. id2entry_add_ext(backend *be, struct backentry *e, back_txn *txn,
  51. int encrypt, int *cache_res)
  52. {
  53. ldbm_instance *inst = (ldbm_instance *) be->be_instance_info;
  54. DB *db = NULL;
  55. DB_TXN *db_txn = NULL;
  56. DBT data;
  57. DBT key;
  58. int len, rc;
  59. char temp_id[sizeof(ID)];
  60. struct backentry *encrypted_entry = NULL;
  61. char *entrydn = NULL;
  62. LDAPDebug( LDAP_DEBUG_TRACE, "=> id2entry_add( %lu, \"%s\" )\n",
  63. (u_long)e->ep_id, backentry_get_ndn(e), 0 );
  64. if ( (rc = dblayer_get_id2entry( be, &db )) != 0 ) {
  65. LDAPDebug( LDAP_DEBUG_ANY, "Could not open/create id2entry\n",
  66. 0, 0, 0 );
  67. rc = -1;
  68. goto done;
  69. }
  70. id_internal_to_stored(e->ep_id,temp_id);
  71. memset(&key, 0, sizeof(key));
  72. key.dptr = temp_id;
  73. key.dsize = sizeof(temp_id);
  74. /* Encrypt attributes in this entry if necessary */
  75. if (encrypt) {
  76. rc = attrcrypt_encrypt_entry(be, e, &encrypted_entry);
  77. if (rc) {
  78. LDAPDebug( LDAP_DEBUG_ANY, "attrcrypt_encrypt_entry failed in id2entry_add\n",
  79. 0, 0, 0 );
  80. rc = -1;
  81. goto done;
  82. }
  83. }
  84. {
  85. int options = SLAPI_DUMP_STATEINFO | SLAPI_DUMP_UNIQUEID;
  86. Slapi_Entry *entry_to_use = encrypted_entry ? encrypted_entry->ep_entry : e->ep_entry;
  87. memset(&data, 0, sizeof(data));
  88. if (entryrdn_get_switch())
  89. {
  90. struct backdn *oldbdn = NULL;
  91. Slapi_DN *sdn =
  92. slapi_sdn_dup(slapi_entry_get_sdn_const(entry_to_use));
  93. struct backdn *bdn = backdn_init(sdn, e->ep_id, 0);
  94. options |= SLAPI_DUMP_RDN_ENTRY;
  95. /* If the ID already exists in the DN cache && the DNs do not match,
  96. * replace it. */
  97. if (CACHE_ADD( &inst->inst_dncache, bdn, &oldbdn ) == 1) {
  98. if (slapi_sdn_compare(sdn, oldbdn->dn_sdn)) {
  99. if (cache_replace( &inst->inst_dncache, oldbdn, bdn ) != 0) {
  100. /* The entry was not in the cache for some reason (this
  101. * should not happen since CACHE_ADD said it existed above). */
  102. LDAPDebug( LDAP_DEBUG_ANY, "id2entry_add_ext(): Entry disappeared "
  103. "from cache (%s)\n", oldbdn->dn_sdn, 0, 0 );
  104. }
  105. }
  106. CACHE_RETURN(&inst->inst_dncache, &oldbdn); /* to free oldbdn */
  107. }
  108. CACHE_RETURN(&inst->inst_dncache, &bdn);
  109. LDAPDebug2Args( LDAP_DEBUG_TRACE,
  110. "=> id2entry_add (dncache) ( %lu, \"%s\" )\n",
  111. (u_long)e->ep_id, slapi_entry_get_dn_const(entry_to_use) );
  112. }
  113. data.dptr = slapi_entry2str_with_options(entry_to_use, &len, options);
  114. data.dsize = len + 1;
  115. }
  116. if (NULL != txn) {
  117. db_txn = txn->back_txn_txn;
  118. }
  119. /* call pre-entry-store plugin */
  120. plugin_call_entrystore_plugins( (char **) &data.dptr, &data.dsize );
  121. /* store it */
  122. rc = db->put( db, db_txn, &key, &data, 0);
  123. /* DBDB looks like we're freeing memory allocated by another DLL, which is bad */
  124. slapi_ch_free( &(data.dptr) );
  125. dblayer_release_id2entry( be, db );
  126. if (0 == rc) {
  127. int cache_rc = 0;
  128. /* Putting the entry into the entry cache.
  129. * We don't use the encrypted entry here. */
  130. if (entryrdn_get_switch()) {
  131. struct backentry *parententry = NULL;
  132. ID parentid = slapi_entry_attr_get_ulong(e->ep_entry, "parentid");
  133. const char *myrdn = slapi_entry_get_rdn_const(e->ep_entry);
  134. const char *parentdn = NULL;
  135. char *myparentdn = NULL;
  136. Slapi_Attr *eattr = NULL;
  137. /* If the parent is in the cache, check the parent's DN and
  138. * adjust to it if they don't match. (bz628300) */
  139. if (parentid && myrdn) {
  140. parententry = cache_find_id(&inst->inst_cache, parentid);
  141. if (parententry) {
  142. parentdn = slapi_entry_get_dn_const(parententry->ep_entry);
  143. if (parentdn) {
  144. int is_tombstone = slapi_entry_flag_is_set(e->ep_entry,
  145. SLAPI_ENTRY_FLAG_TOMBSTONE);
  146. myparentdn = slapi_dn_parent_ext(
  147. slapi_entry_get_dn_const(e->ep_entry),
  148. is_tombstone);
  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. cache_rc = CACHE_ADD(&inst->inst_cache, e, NULL);
  189. if (cache_res) {
  190. *cache_res = cache_rc;
  191. }
  192. }
  193. done:
  194. /* If we had an encrypted entry, we no longer need it.
  195. * Note: encrypted_entry is not in the entry cache. */
  196. if (encrypted_entry) {
  197. backentry_free(&encrypted_entry);
  198. }
  199. LDAPDebug( LDAP_DEBUG_TRACE, "<= id2entry_add %d\n", rc, 0, 0 );
  200. return( rc );
  201. }
  202. int
  203. id2entry_add( backend *be, struct backentry *e, back_txn *txn )
  204. {
  205. return id2entry_add_ext(be, e, txn, 1, NULL);
  206. }
  207. /*
  208. * The caller MUST check for DB_LOCK_DEADLOCK and DB_RUNRECOVERY returned
  209. */
  210. int
  211. id2entry_delete( backend *be, struct backentry *e, back_txn *txn )
  212. {
  213. DB *db = NULL;
  214. DB_TXN *db_txn = NULL;
  215. DBT key = {0};
  216. int rc;
  217. char temp_id[sizeof(ID)];
  218. LDAPDebug( LDAP_DEBUG_TRACE, "=> id2entry_delete( %lu, \"%s\" )\n",
  219. (u_long)e->ep_id, backentry_get_ndn(e), 0 );
  220. if ( (rc = dblayer_get_id2entry( be, &db )) != 0 ) {
  221. LDAPDebug( LDAP_DEBUG_ANY, "Could not open/create id2entry\n",
  222. 0, 0, 0 );
  223. return( -1 );
  224. }
  225. id_internal_to_stored(e->ep_id,temp_id);
  226. key.dptr = temp_id;
  227. key.dsize = sizeof(temp_id);
  228. if (NULL != txn) {
  229. db_txn = txn->back_txn_txn;
  230. }
  231. if (entryrdn_get_switch())
  232. {
  233. ldbm_instance *inst = (ldbm_instance *)be->be_instance_info;
  234. struct backdn *bdn = dncache_find_id(&inst->inst_dncache, e->ep_id);
  235. if (bdn) {
  236. slapi_log_error(SLAPI_LOG_CACHE, ID2ENTRY,
  237. "dncache_find_id returned: %s\n",
  238. slapi_sdn_get_dn(bdn->dn_sdn));
  239. CACHE_REMOVE(&inst->inst_dncache, bdn);
  240. CACHE_RETURN(&inst->inst_dncache, &bdn);
  241. }
  242. }
  243. rc = db->del( db,db_txn,&key,0 );
  244. dblayer_release_id2entry( be, db );
  245. LDAPDebug( LDAP_DEBUG_TRACE, "<= id2entry_delete %d\n", rc, 0, 0 );
  246. return( rc );
  247. }
  248. struct backentry *
  249. id2entry( backend *be, ID id, back_txn *txn, int *err )
  250. {
  251. ldbm_instance *inst = (ldbm_instance *) be->be_instance_info;
  252. DB *db = NULL;
  253. DB_TXN *db_txn = NULL;
  254. DBT key = {0};
  255. DBT data = {0};
  256. struct backentry *e = NULL;
  257. Slapi_Entry *ee;
  258. char temp_id[sizeof(ID)];
  259. slapi_log_error(SLAPI_LOG_TRACE, ID2ENTRY,
  260. "=> id2entry(%lu)\n", (u_long)id);
  261. if ( (e = cache_find_id( &inst->inst_cache, id )) != NULL ) {
  262. slapi_log_error(SLAPI_LOG_TRACE, ID2ENTRY,
  263. "<= id2entry %p, dn \"%s\" (cache)\n",
  264. e, backentry_get_ndn(e));
  265. goto bail;
  266. }
  267. *err = dblayer_get_id2entry( be, &db );
  268. if ( (*err != 0) || (NULL == db) ) {
  269. slapi_log_error(SLAPI_LOG_FATAL, ID2ENTRY,
  270. "Could not open id2entry err %d\n", *err);
  271. return( NULL );
  272. }
  273. id_internal_to_stored(id,temp_id);
  274. key.data = temp_id;
  275. key.size = sizeof(temp_id);
  276. /* DBDB need to improve this, we're mallocing, freeing, all over the place here */
  277. data.flags = DB_DBT_MALLOC;
  278. if (NULL != txn) {
  279. db_txn = txn->back_txn_txn;
  280. }
  281. do {
  282. *err = db->get( db, db_txn, &key, &data, 0 );
  283. if ( (0 != *err) &&
  284. (DB_NOTFOUND != *err) && (DB_LOCK_DEADLOCK != *err) )
  285. {
  286. slapi_log_error(SLAPI_LOG_FATAL, ID2ENTRY, "db error %d (%s)\n",
  287. *err, dblayer_strerror( *err ));
  288. }
  289. }
  290. while ( (DB_LOCK_DEADLOCK == *err) && (txn == NULL) );
  291. if ( (0 != *err) && (DB_NOTFOUND != *err) && (DB_LOCK_DEADLOCK != *err) )
  292. {
  293. if ( (DB_BUFFER_SMALL == *err) && (data.dptr == NULL) )
  294. {
  295. /*
  296. * Now we are setting slapi_ch_malloc and its friends to libdb
  297. * by ENV->set_alloc in dblayer.c. As long as the functions are
  298. * used by libdb, it won't reach here.
  299. */
  300. slapi_log_error(SLAPI_LOG_FATAL, ID2ENTRY,
  301. "malloc failed in libdb; "
  302. "terminating the server; OS error %d (%s)\n",
  303. *err, slapd_system_strerror( *err ));
  304. exit (1);
  305. }
  306. dblayer_release_id2entry( be, db );
  307. return( NULL );
  308. }
  309. if ( data.dptr == NULL ) {
  310. slapi_log_error(SLAPI_LOG_TRACE, ID2ENTRY,
  311. "<= id2entry( %lu ) not found\n", (u_long)id);
  312. goto bail;
  313. }
  314. /* call post-entry plugin */
  315. plugin_call_entryfetch_plugins( (char **) &data.dptr, &data.dsize );
  316. if (entryrdn_get_switch()) {
  317. char *rdn = NULL;
  318. int rc = 0;
  319. /* rdn is allocated in get_value_from_string */
  320. rc = get_value_from_string((const char *)data.dptr, "rdn", &rdn);
  321. if (rc) {
  322. /* data.dptr may not include rdn: ..., try "dn: ..." */
  323. ee = slapi_str2entry( data.dptr, SLAPI_STR2ENTRY_NO_ENTRYDN );
  324. } else {
  325. char *normdn = NULL;
  326. struct backdn *bdn = dncache_find_id(&inst->inst_dncache, id);
  327. if (bdn) {
  328. normdn = slapi_ch_strdup(slapi_sdn_get_dn(bdn->dn_sdn));
  329. slapi_log_error(SLAPI_LOG_CACHE, ID2ENTRY,
  330. "dncache_find_id returned: %s\n", normdn);
  331. CACHE_RETURN(&inst->inst_dncache, &bdn);
  332. } else {
  333. Slapi_DN *sdn = NULL;
  334. rc = entryrdn_lookup_dn(be, rdn, id, &normdn, txn);
  335. if (rc) {
  336. slapi_log_error(SLAPI_LOG_TRACE, ID2ENTRY,
  337. "id2entry: entryrdn look up failed "
  338. "(rdn=%s, ID=%d)\n", rdn, id);
  339. /* Try rdn as dn. Could be RUV. */
  340. normdn = slapi_ch_strdup(rdn);
  341. } else if (NULL == normdn) {
  342. slapi_log_error(SLAPI_LOG_FATAL, ID2ENTRY,
  343. "<= id2entry( %lu ) entryrdn_lookup_dn returned NULL. "
  344. "Index file may be deleted or corrupted.\n",
  345. (u_long)id);
  346. goto bail;
  347. }
  348. sdn = slapi_sdn_new_normdn_byval((const char *)normdn);
  349. bdn = backdn_init(sdn, id, 0);
  350. if (CACHE_ADD( &inst->inst_dncache, bdn, NULL )) {
  351. backdn_free(&bdn);
  352. slapi_log_error(SLAPI_LOG_CACHE, ID2ENTRY,
  353. "%s is already in the dn cache\n", normdn);
  354. } else {
  355. CACHE_RETURN(&inst->inst_dncache, &bdn);
  356. slapi_log_error(SLAPI_LOG_CACHE, ID2ENTRY,
  357. "entryrdn_lookup_dn returned: %s, "
  358. "and set to dn cache (id %d)\n", normdn, id);
  359. }
  360. }
  361. ee = slapi_str2entry_ext( (const char *)normdn, data.dptr,
  362. SLAPI_STR2ENTRY_NO_ENTRYDN );
  363. slapi_ch_free_string(&rdn);
  364. slapi_ch_free_string(&normdn);
  365. }
  366. } else {
  367. ee = slapi_str2entry( data.dptr, 0 );
  368. }
  369. if ( ee != NULL ) {
  370. int retval = 0;
  371. struct backentry *imposter = NULL;
  372. /* All entries should have uniqueids */
  373. PR_ASSERT(slapi_entry_get_uniqueid(ee) != NULL);
  374. /* ownership of the entry is passed into the backentry */
  375. e = backentry_init( ee );
  376. e->ep_id = id;
  377. slapi_log_error(SLAPI_LOG_TRACE, ID2ENTRY,
  378. "id2entry id: %d, dn \"%s\" -- adding it to cache\n",
  379. id, backentry_get_ndn(e));
  380. /* Decrypt any encrypted attributes in this entry,
  381. * before adding it to the cache */
  382. retval = attrcrypt_decrypt_entry(be, e);
  383. if (retval) {
  384. slapi_log_error(SLAPI_LOG_FATAL, ID2ENTRY,
  385. "attrcrypt_decrypt_entry failed in id2entry\n");
  386. }
  387. /*
  388. * If return entry exists AND entryrdn switch is on,
  389. * add the entrydn value.
  390. */
  391. if (entryrdn_get_switch()) {
  392. Slapi_Attr *eattr = NULL;
  393. /* Check if entrydn is in the entry or not */
  394. if (slapi_entry_attr_find(e->ep_entry, LDBM_ENTRYDN_STR, &eattr)) {
  395. /* entrydn does not exist in the entry */
  396. char *entrydn = NULL;
  397. /* slapi_ch_strdup and slapi_dn_ignore_case never returns NULL */
  398. entrydn = slapi_ch_strdup(slapi_entry_get_dn_const(e->ep_entry));
  399. entrydn = slapi_dn_ignore_case(entrydn);
  400. slapi_entry_attr_set_charptr (e->ep_entry,
  401. LDBM_ENTRYDN_STR, entrydn);
  402. if (0 == slapi_entry_attr_find(e->ep_entry,
  403. LDBM_ENTRYDN_STR, &eattr)) {
  404. /* now entrydn should exist in the entry */
  405. /* Set it to operational attribute */
  406. eattr->a_flags = SLAPI_ATTR_FLAG_OPATTR;
  407. }
  408. slapi_ch_free_string(&entrydn);
  409. }
  410. }
  411. retval = CACHE_ADD( &inst->inst_cache, e, &imposter );
  412. if (1 == retval) {
  413. /* This means that someone else put the entry in the cache
  414. while we weren't looking ! So, we need to use the pointer
  415. returned and free the one we made earlier */
  416. if (imposter)
  417. {
  418. backentry_free(&e);
  419. e = imposter;
  420. }
  421. } else if (-1 == retval) {
  422. /* the entry is in idtable but not in dntable, i.e., the entry
  423. * could have been renamed */
  424. slapi_log_error(SLAPI_LOG_TRACE, ID2ENTRY,
  425. "id2entry: failed to put entry (id %lu, dn %s) "
  426. "into entry cache\n", (u_long)id,
  427. backentry_get_ndn(e));
  428. }
  429. } else {
  430. slapi_log_error(SLAPI_LOG_FATAL, ID2ENTRY,
  431. "str2entry returned NULL for id %lu, string=\"%s\"\n",
  432. (u_long)id, (char*)data.data);
  433. e = NULL;
  434. }
  435. bail:
  436. slapi_ch_free( &(data.data) );
  437. dblayer_release_id2entry( be, db );
  438. slapi_log_error(SLAPI_LOG_TRACE, ID2ENTRY,
  439. "<= id2entry( %lu ) %p (disk)\n", (u_long)id, e);
  440. return( e );
  441. }