id2entry.c 19 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488
  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. CACHE_LOCK(&inst->inst_cache);
  153. slapi_sdn_done(sdn);
  154. newdn = slapi_ch_smprintf("%s,%s", myrdn, parentdn);
  155. slapi_sdn_init_dn_passin(sdn, newdn);
  156. slapi_sdn_get_ndn(sdn); /* to set ndn */
  157. CACHE_UNLOCK(&inst->inst_cache);
  158. }
  159. slapi_ch_free_string(&myparentdn);
  160. }
  161. CACHE_RETURN(&inst->inst_cache, &parententry);
  162. }
  163. }
  164. /*
  165. * Adding entrydn attribute value to the entry,
  166. * which should be done before adding the entry to the entry cache.
  167. * Note: since we removed entrydn from the entry before writing
  168. * it to the database, it is guaranteed not in the entry.
  169. */
  170. /* slapi_ch_strdup and slapi_dn_ignore_case never returns NULL */
  171. entrydn = slapi_ch_strdup(slapi_entry_get_dn_const(e->ep_entry));
  172. entrydn = slapi_dn_ignore_case(entrydn);
  173. slapi_entry_attr_set_charptr (e->ep_entry,
  174. LDBM_ENTRYDN_STR, entrydn);
  175. if (0 == slapi_entry_attr_find(e->ep_entry,
  176. LDBM_ENTRYDN_STR, &eattr)) {
  177. /* now entrydn should exist in the entry */
  178. /* Set it to operational attribute */
  179. eattr->a_flags = SLAPI_ATTR_FLAG_OPATTR;
  180. }
  181. slapi_ch_free_string(&entrydn);
  182. }
  183. /*
  184. * For ldbm_back_add and ldbm_back_modify, this entry had been already
  185. * reserved as a tentative entry. So, it should be safe.
  186. * For ldbm_back_modify, the original entry having the same dn/id
  187. * should be in the cache. Thus, this entry e won't be put into the
  188. * entry cache. It'll be added by cache_replace.
  189. */
  190. cache_rc = CACHE_ADD(&inst->inst_cache, e, NULL);
  191. if (cache_res) {
  192. *cache_res = cache_rc;
  193. }
  194. }
  195. done:
  196. /* If we had an encrypted entry, we no longer need it.
  197. * Note: encrypted_entry is not in the entry cache. */
  198. if (encrypted_entry) {
  199. backentry_free(&encrypted_entry);
  200. }
  201. LDAPDebug( LDAP_DEBUG_TRACE, "<= id2entry_add %d\n", rc, 0, 0 );
  202. return( rc );
  203. }
  204. int
  205. id2entry_add( backend *be, struct backentry *e, back_txn *txn )
  206. {
  207. return id2entry_add_ext(be, e, txn, 1, NULL);
  208. }
  209. /*
  210. * The caller MUST check for DB_LOCK_DEADLOCK and DB_RUNRECOVERY returned
  211. */
  212. int
  213. id2entry_delete( backend *be, struct backentry *e, back_txn *txn )
  214. {
  215. DB *db = NULL;
  216. DB_TXN *db_txn = NULL;
  217. DBT key = {0};
  218. int rc;
  219. char temp_id[sizeof(ID)];
  220. LDAPDebug( LDAP_DEBUG_TRACE, "=> id2entry_delete( %lu, \"%s\" )\n",
  221. (u_long)e->ep_id, backentry_get_ndn(e), 0 );
  222. if ( (rc = dblayer_get_id2entry( be, &db )) != 0 ) {
  223. LDAPDebug( LDAP_DEBUG_ANY, "Could not open/create id2entry\n",
  224. 0, 0, 0 );
  225. return( -1 );
  226. }
  227. id_internal_to_stored(e->ep_id,temp_id);
  228. key.dptr = temp_id;
  229. key.dsize = sizeof(temp_id);
  230. if (NULL != txn) {
  231. db_txn = txn->back_txn_txn;
  232. }
  233. if (entryrdn_get_switch())
  234. {
  235. ldbm_instance *inst = (ldbm_instance *)be->be_instance_info;
  236. struct backdn *bdn = dncache_find_id(&inst->inst_dncache, e->ep_id);
  237. if (bdn) {
  238. slapi_log_error(SLAPI_LOG_CACHE, ID2ENTRY,
  239. "dncache_find_id returned: %s\n",
  240. slapi_sdn_get_dn(bdn->dn_sdn));
  241. CACHE_REMOVE(&inst->inst_dncache, bdn);
  242. CACHE_RETURN(&inst->inst_dncache, &bdn);
  243. }
  244. }
  245. rc = db->del( db,db_txn,&key,0 );
  246. dblayer_release_id2entry( be, db );
  247. LDAPDebug( LDAP_DEBUG_TRACE, "<= id2entry_delete %d\n", rc, 0, 0 );
  248. return( rc );
  249. }
  250. struct backentry *
  251. id2entry( backend *be, ID id, back_txn *txn, int *err )
  252. {
  253. ldbm_instance *inst = (ldbm_instance *) be->be_instance_info;
  254. DB *db = NULL;
  255. DB_TXN *db_txn = NULL;
  256. DBT key = {0};
  257. DBT data = {0};
  258. struct backentry *e = NULL;
  259. Slapi_Entry *ee;
  260. char temp_id[sizeof(ID)];
  261. slapi_log_error(SLAPI_LOG_TRACE, ID2ENTRY,
  262. "=> id2entry(%lu)\n", (u_long)id);
  263. if ( (e = cache_find_id( &inst->inst_cache, id )) != NULL ) {
  264. slapi_log_error(SLAPI_LOG_TRACE, ID2ENTRY,
  265. "<= id2entry %p, dn \"%s\" (cache)\n",
  266. e, backentry_get_ndn(e));
  267. goto bail;
  268. }
  269. *err = dblayer_get_id2entry( be, &db );
  270. if ( (*err != 0) || (NULL == db) ) {
  271. slapi_log_error(SLAPI_LOG_FATAL, ID2ENTRY,
  272. "Could not open id2entry err %d\n", *err);
  273. return( NULL );
  274. }
  275. id_internal_to_stored(id,temp_id);
  276. key.data = temp_id;
  277. key.size = sizeof(temp_id);
  278. /* DBDB need to improve this, we're mallocing, freeing, all over the place here */
  279. data.flags = DB_DBT_MALLOC;
  280. if (NULL != txn) {
  281. db_txn = txn->back_txn_txn;
  282. }
  283. do {
  284. *err = db->get( db, db_txn, &key, &data, 0 );
  285. if ( (0 != *err) &&
  286. (DB_NOTFOUND != *err) && (DB_LOCK_DEADLOCK != *err) )
  287. {
  288. slapi_log_error(SLAPI_LOG_FATAL, ID2ENTRY, "db error %d (%s)\n",
  289. *err, dblayer_strerror( *err ));
  290. }
  291. }
  292. while ( (DB_LOCK_DEADLOCK == *err) && (txn == NULL) );
  293. if ( (0 != *err) && (DB_NOTFOUND != *err) && (DB_LOCK_DEADLOCK != *err) )
  294. {
  295. if ( (DB_BUFFER_SMALL == *err) && (data.dptr == NULL) )
  296. {
  297. /*
  298. * Now we are setting slapi_ch_malloc and its friends to libdb
  299. * by ENV->set_alloc in dblayer.c. As long as the functions are
  300. * used by libdb, it won't reach here.
  301. */
  302. slapi_log_error(SLAPI_LOG_FATAL, ID2ENTRY,
  303. "malloc failed in libdb; "
  304. "terminating the server; OS error %d (%s)\n",
  305. *err, slapd_system_strerror( *err ));
  306. exit (1);
  307. }
  308. dblayer_release_id2entry( be, db );
  309. return( NULL );
  310. }
  311. if ( data.dptr == NULL ) {
  312. slapi_log_error(SLAPI_LOG_TRACE, ID2ENTRY,
  313. "<= id2entry( %lu ) not found\n", (u_long)id);
  314. goto bail;
  315. }
  316. /* call post-entry plugin */
  317. plugin_call_entryfetch_plugins( (char **) &data.dptr, &data.dsize );
  318. if (entryrdn_get_switch()) {
  319. char *rdn = NULL;
  320. int rc = 0;
  321. /* rdn is allocated in get_value_from_string */
  322. rc = get_value_from_string((const char *)data.dptr, "rdn", &rdn);
  323. if (rc) {
  324. /* data.dptr may not include rdn: ..., try "dn: ..." */
  325. ee = slapi_str2entry( data.dptr, SLAPI_STR2ENTRY_NO_ENTRYDN );
  326. } else {
  327. char *normdn = NULL;
  328. struct backdn *bdn = dncache_find_id(&inst->inst_dncache, id);
  329. if (bdn) {
  330. normdn = slapi_ch_strdup(slapi_sdn_get_dn(bdn->dn_sdn));
  331. slapi_log_error(SLAPI_LOG_CACHE, ID2ENTRY,
  332. "dncache_find_id returned: %s\n", normdn);
  333. CACHE_RETURN(&inst->inst_dncache, &bdn);
  334. } else {
  335. Slapi_DN *sdn = NULL;
  336. rc = entryrdn_lookup_dn(be, rdn, id, &normdn, txn);
  337. if (rc) {
  338. slapi_log_error(SLAPI_LOG_TRACE, ID2ENTRY,
  339. "id2entry: entryrdn look up failed "
  340. "(rdn=%s, ID=%d)\n", rdn, id);
  341. /* Try rdn as dn. Could be RUV. */
  342. normdn = slapi_ch_strdup(rdn);
  343. }
  344. sdn = slapi_sdn_new_normdn_byval((const char *)normdn);
  345. bdn = backdn_init(sdn, id, 0);
  346. if (CACHE_ADD( &inst->inst_dncache, bdn, NULL )) {
  347. backdn_free(&bdn);
  348. slapi_log_error(SLAPI_LOG_CACHE, ID2ENTRY,
  349. "%s is already in the dn cache\n", normdn);
  350. } else {
  351. CACHE_RETURN(&inst->inst_dncache, &bdn);
  352. slapi_log_error(SLAPI_LOG_CACHE, ID2ENTRY,
  353. "entryrdn_lookup_dn returned: %s, "
  354. "and set to dn cache (id %d)\n", normdn, id);
  355. }
  356. }
  357. ee = slapi_str2entry_ext( (const char *)normdn, data.dptr,
  358. SLAPI_STR2ENTRY_NO_ENTRYDN );
  359. slapi_ch_free_string(&rdn);
  360. slapi_ch_free_string(&normdn);
  361. }
  362. } else {
  363. ee = slapi_str2entry( data.dptr, 0 );
  364. }
  365. if ( ee != NULL ) {
  366. int retval = 0;
  367. struct backentry *imposter = NULL;
  368. /* All entries should have uniqueids */
  369. PR_ASSERT(slapi_entry_get_uniqueid(ee) != NULL);
  370. /* ownership of the entry is passed into the backentry */
  371. e = backentry_init( ee );
  372. e->ep_id = id;
  373. slapi_log_error(SLAPI_LOG_TRACE, ID2ENTRY,
  374. "id2entry id: %d, dn \"%s\" -- adding it to cache\n",
  375. id, backentry_get_ndn(e));
  376. /* Decrypt any encrypted attributes in this entry,
  377. * before adding it to the cache */
  378. retval = attrcrypt_decrypt_entry(be, e);
  379. if (retval) {
  380. slapi_log_error(SLAPI_LOG_FATAL, ID2ENTRY,
  381. "attrcrypt_decrypt_entry failed in id2entry\n");
  382. }
  383. /*
  384. * If return entry exists AND entryrdn switch is on,
  385. * add the entrydn value.
  386. */
  387. if (entryrdn_get_switch()) {
  388. Slapi_Attr *eattr = NULL;
  389. /* Check if entrydn is in the entry or not */
  390. if (slapi_entry_attr_find(e->ep_entry, LDBM_ENTRYDN_STR, &eattr)) {
  391. /* entrydn does not exist in the entry */
  392. char *entrydn = NULL;
  393. /* slapi_ch_strdup and slapi_dn_ignore_case never returns NULL */
  394. entrydn = slapi_ch_strdup(slapi_entry_get_dn_const(e->ep_entry));
  395. entrydn = slapi_dn_ignore_case(entrydn);
  396. slapi_entry_attr_set_charptr (e->ep_entry,
  397. LDBM_ENTRYDN_STR, entrydn);
  398. if (0 == slapi_entry_attr_find(e->ep_entry,
  399. LDBM_ENTRYDN_STR, &eattr)) {
  400. /* now entrydn should exist in the entry */
  401. /* Set it to operational attribute */
  402. eattr->a_flags = SLAPI_ATTR_FLAG_OPATTR;
  403. }
  404. slapi_ch_free_string(&entrydn);
  405. }
  406. }
  407. retval = CACHE_ADD( &inst->inst_cache, e, &imposter );
  408. if (1 == retval) {
  409. /* This means that someone else put the entry in the cache
  410. while we weren't looking ! So, we need to use the pointer
  411. returned and free the one we made earlier */
  412. if (imposter)
  413. {
  414. backentry_free(&e);
  415. e = imposter;
  416. }
  417. } else if (-1 == retval) {
  418. /* the entry is in idtable but not in dntable, i.e., the entry
  419. * could have been renamed */
  420. slapi_log_error(SLAPI_LOG_TRACE, ID2ENTRY,
  421. "id2entry: failed to put entry (id %lu, dn %s) "
  422. "into entry cache\n", (u_long)id,
  423. backentry_get_ndn(e));
  424. }
  425. } else {
  426. slapi_log_error(SLAPI_LOG_FATAL, ID2ENTRY,
  427. "str2entry returned NULL for id %lu, string=\"%s\"\n",
  428. (u_long)id, (char*)data.data);
  429. e = NULL;
  430. }
  431. bail:
  432. slapi_ch_free( &(data.data) );
  433. dblayer_release_id2entry( be, db );
  434. slapi_log_error(SLAPI_LOG_TRACE, ID2ENTRY,
  435. "<= id2entry( %lu ) %p (disk)\n", (u_long)id, e);
  436. return( e );
  437. }