retrocl_po.c 20 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672
  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. #include "retrocl.h"
  42. static int
  43. entry2reple( Slapi_Entry *e, Slapi_Entry *oe, int optype );
  44. static int
  45. mods2reple( Slapi_Entry *e, LDAPMod **ldm );
  46. static int
  47. modrdn2reple( Slapi_Entry *e, const char *newrdn, int deloldrdn,
  48. LDAPMod **ldm, const char *newsup );
  49. /******************************/
  50. const char *attr_changenumber = "changenumber";
  51. const char *attr_targetdn = "targetdn";
  52. const char *attr_changetype = "changetype";
  53. const char *attr_newrdn = "newrdn";
  54. const char *attr_deleteoldrdn = "deleteoldrdn";
  55. const char *attr_changes = "changes";
  56. const char *attr_newsuperior = "newsuperior";
  57. const char *attr_changetime = "changetime";
  58. const char *attr_objectclass = "objectclass";
  59. const char *attr_nsuniqueid = "nsuniqueid";
  60. const char *attr_isreplicated = "isreplicated";
  61. /*
  62. * Function: make_changes_string
  63. *
  64. * Returns:
  65. *
  66. * Arguments:
  67. *
  68. * Description:
  69. * loop through the LDAPMod struct and construct the changes attribute/
  70. *
  71. */
  72. static lenstr *make_changes_string(LDAPMod **ldm, const char **includeattrs)
  73. {
  74. lenstr *l;
  75. int i, j, len;
  76. int skip;
  77. l = lenstr_new();
  78. for ( i = 0; ldm[ i ] != NULL; i++ ) {
  79. /* If a list of explicit attributes was given, only add those */
  80. if ( NULL != includeattrs ) {
  81. skip = 1;
  82. for ( j = 0; includeattrs[ j ] != NULL; j++ ) {
  83. if ( strcasecmp( includeattrs[ j ], ldm[ i ]->mod_type ) == 0 ) {
  84. skip = 0;
  85. break;
  86. }
  87. }
  88. if ( skip ) {
  89. continue;
  90. }
  91. }
  92. switch ( ldm[ i ]->mod_op & ~LDAP_MOD_BVALUES ) {
  93. case LDAP_MOD_ADD:
  94. addlenstr( l, "add: " );
  95. addlenstr( l, ldm[ i ]->mod_type );
  96. addlenstr( l, "\n" );
  97. break;
  98. case LDAP_MOD_DELETE:
  99. addlenstr( l, "delete: " );
  100. addlenstr( l, ldm[ i ]->mod_type );
  101. addlenstr( l, "\n" );
  102. break;
  103. case LDAP_MOD_REPLACE:
  104. addlenstr( l, "replace: " );
  105. addlenstr( l, ldm[ i ]->mod_type );
  106. addlenstr( l, "\n" );
  107. break;
  108. }
  109. for ( j = 0; ldm[ i ]->mod_bvalues != NULL &&
  110. ldm[ i ]->mod_bvalues[ j ] != NULL; j++ ) {
  111. char *buf = NULL;
  112. char *bufp = NULL;
  113. len = strlen( ldm[ i ]->mod_type );
  114. len = LDIF_SIZE_NEEDED( len,
  115. ldm[ i ]->mod_bvalues[ j ]->bv_len ) + 1;
  116. buf = slapi_ch_malloc( len );
  117. bufp = buf;
  118. slapi_ldif_put_type_and_value_with_options( &bufp, ldm[ i ]->mod_type,
  119. ldm[ i ]->mod_bvalues[ j ]->bv_val,
  120. ldm[ i ]->mod_bvalues[ j ]->bv_len, 0 );
  121. *bufp = '\0';
  122. addlenstr( l, buf );
  123. slapi_ch_free_string( &buf );
  124. }
  125. addlenstr( l, "-\n" );
  126. }
  127. return l;
  128. }
  129. /*
  130. * Function: write_replog_db
  131. * Arguments: be - backend to which this change is being applied
  132. * optype - type of LDAP operation being logged
  133. * dn - distinguished name of entry being changed
  134. * log_m - pointer to the actual change operation on a modify
  135. * flag - only used by modrdn operations - value of deleteoldrdn
  136. * curtime - the current time
  137. * Returns: nothing
  138. * Description: Given a change, construct an entry which is to be added to the
  139. * changelog database.
  140. */
  141. static void
  142. write_replog_db(
  143. Slapi_PBlock *pb,
  144. int optype,
  145. char *dn,
  146. LDAPMod **log_m,
  147. int flag,
  148. time_t curtime,
  149. Slapi_Entry *log_e,
  150. const char *newrdn,
  151. LDAPMod **modrdn_mods,
  152. const char *newsuperior
  153. )
  154. {
  155. char *edn;
  156. struct berval *vals[ 2 ];
  157. struct berval val;
  158. Slapi_Entry *e;
  159. char chnobuf[ 20 ];
  160. int err;
  161. Slapi_PBlock *newPb = NULL;
  162. changeNumber changenum;
  163. int i;
  164. int extensibleObject = 0;
  165. if (!dn) {
  166. slapi_log_error( SLAPI_LOG_PLUGIN, RETROCL_PLUGIN_NAME, "write_replog_db: NULL dn\n");
  167. return;
  168. }
  169. PR_Lock(retrocl_internal_lock);
  170. changenum = retrocl_assign_changenumber();
  171. PR_ASSERT( changenum > 0UL );
  172. slapi_log_error( SLAPI_LOG_PLUGIN, RETROCL_PLUGIN_NAME,
  173. "write_replog_db: write change record %lu for dn: \"%s\"\n",
  174. changenum, dn );
  175. /* Construct the dn of this change record */
  176. edn = slapi_ch_smprintf( "%s=%lu,%s", attr_changenumber, changenum, RETROCL_CHANGELOG_DN);
  177. /*
  178. * Create the entry struct, and fill in fields common to all types
  179. * of change records.
  180. */
  181. vals[ 0 ] = &val;
  182. vals[ 1 ] = NULL;
  183. e = slapi_entry_alloc();
  184. slapi_entry_set_dn( e, slapi_ch_strdup( edn ));
  185. /* Set the objectclass attribute */
  186. val.bv_val = "top";
  187. val.bv_len = 3;
  188. slapi_entry_add_values( e, "objectclass", vals );
  189. val.bv_val = "changelogentry";
  190. val.bv_len = 14;
  191. slapi_entry_add_values( e, "objectclass", vals );
  192. for ( i=0; i<retrocl_nattributes; i++ ) {
  193. char* attributeName = retrocl_attributes[i];
  194. char* attributeAlias = retrocl_aliases[i];
  195. if ( attributeAlias == NULL ) {
  196. attributeAlias = attributeName;
  197. }
  198. if ( strcasecmp( attributeName, attr_nsuniqueid ) == 0 ) {
  199. Slapi_Entry *entry = NULL;
  200. const char *uniqueId = NULL;
  201. slapi_pblock_get( pb, SLAPI_ENTRY_POST_OP, &entry );
  202. if ( entry == NULL ) {
  203. slapi_pblock_get( pb, SLAPI_ENTRY_PRE_OP, &entry );
  204. }
  205. uniqueId = slapi_entry_get_uniqueid( entry );
  206. slapi_log_error( SLAPI_LOG_PLUGIN, RETROCL_PLUGIN_NAME,
  207. "write_replog_db: add %s: \"%s\"\n", attributeAlias, uniqueId );
  208. val.bv_val = (char *)uniqueId;
  209. val.bv_len = strlen( uniqueId );
  210. slapi_entry_add_values( e, attributeAlias, vals );
  211. extensibleObject = 1;
  212. } else if ( strcasecmp( attributeName, attr_isreplicated ) == 0 ) {
  213. int isReplicated = 0;
  214. char *attributeValue = NULL;
  215. slapi_pblock_get( pb, SLAPI_IS_REPLICATED_OPERATION, &isReplicated );
  216. attributeValue = isReplicated ? "TRUE" : "FALSE";
  217. slapi_log_error( SLAPI_LOG_PLUGIN, RETROCL_PLUGIN_NAME,
  218. "write_replog_db: add %s: \"%s\"\n", attributeAlias, attributeValue );
  219. val.bv_val = attributeValue;
  220. val.bv_len = strlen( attributeValue );
  221. slapi_entry_add_values( e, attributeAlias, vals );
  222. extensibleObject = 1;
  223. } else {
  224. Slapi_Entry *entry = NULL;
  225. Slapi_ValueSet *valueSet = NULL;
  226. int type_name_disposition = 0;
  227. char *actual_type_name = NULL;
  228. int flags = 0;
  229. int buffer_flags = 0;
  230. slapi_pblock_get( pb, SLAPI_ENTRY_POST_OP, &entry );
  231. if ( entry != NULL ) {
  232. slapi_vattr_values_get( entry, attributeName, &valueSet,
  233. &type_name_disposition, &actual_type_name, flags, &buffer_flags );
  234. }
  235. if ( valueSet == NULL ) {
  236. slapi_pblock_get( pb, SLAPI_ENTRY_PRE_OP, &entry );
  237. if ( entry != NULL ) {
  238. slapi_vattr_values_get( entry, attributeName, &valueSet,
  239. &type_name_disposition, &actual_type_name, flags, &buffer_flags );
  240. }
  241. }
  242. if ( valueSet == NULL ) continue;
  243. slapi_log_error( SLAPI_LOG_PLUGIN, RETROCL_PLUGIN_NAME,
  244. "write_replog_db: add %s\n", attributeAlias );
  245. slapi_entry_add_valueset( e, attributeAlias, valueSet );
  246. slapi_vattr_values_free( &valueSet, &actual_type_name, buffer_flags );
  247. extensibleObject = 1;
  248. }
  249. }
  250. if ( extensibleObject ) {
  251. val.bv_val = "extensibleObject";
  252. val.bv_len = 16;
  253. slapi_entry_add_values( e, "objectclass", vals );
  254. }
  255. /* Set the changeNumber attribute */
  256. sprintf( chnobuf, "%lu", changenum );
  257. val.bv_val = chnobuf;
  258. val.bv_len = strlen( chnobuf );
  259. slapi_entry_add_values( e, attr_changenumber, vals );
  260. /* Set the targetentrydn attribute */
  261. val.bv_val = dn;
  262. val.bv_len = strlen( dn );
  263. slapi_entry_add_values( e, attr_targetdn, vals );
  264. /* Set the changeTime attribute */
  265. val.bv_val = format_genTime (curtime);
  266. val.bv_len = strlen( val.bv_val );
  267. slapi_entry_add_values( e, attr_changetime, vals );
  268. slapi_ch_free( (void **)&val.bv_val );
  269. /*
  270. * Finish constructing the entry. How to do it depends on the type
  271. * of modification being logged.
  272. */
  273. err = 0;
  274. switch ( optype ) {
  275. case OP_ADD:
  276. if ( entry2reple( e, log_e, OP_ADD ) != 0 ) {
  277. err = 1;
  278. }
  279. break;
  280. case OP_MODIFY:
  281. if ( mods2reple( e, log_m ) != 0 ) {
  282. err = 1;
  283. }
  284. break;
  285. case OP_MODRDN:
  286. if ( modrdn2reple( e, newrdn, flag, modrdn_mods, newsuperior ) != 0 ) {
  287. err = 1;
  288. }
  289. break;
  290. case OP_DELETE:
  291. if (log_e) {
  292. /* we have to log the full entry */
  293. if ( entry2reple( e, log_e, OP_DELETE ) != 0 ) {
  294. err = 1;
  295. }
  296. } else {
  297. /* Set the changetype attribute */
  298. val.bv_val = "delete";
  299. val.bv_len = 6;
  300. slapi_entry_add_values( e, attr_changetype, vals );
  301. }
  302. break;
  303. default:
  304. slapi_log_error( SLAPI_LOG_FATAL, RETROCL_PLUGIN_NAME, "replog: Unknown LDAP operation type "
  305. "%d.\n", optype );
  306. err = 1;
  307. }
  308. /* Call the repl backend to add this entry */
  309. if ( 0 == err ) {
  310. int rc;
  311. newPb = slapi_pblock_new ();
  312. slapi_add_entry_internal_set_pb( newPb, e, NULL /* controls */,
  313. g_plg_identity[PLUGIN_RETROCL],
  314. 0 /* actions */ );
  315. slapi_add_internal_pb (newPb);
  316. slapi_pblock_get( newPb, SLAPI_PLUGIN_INTOP_RESULT, &rc );
  317. slapi_pblock_destroy(newPb);
  318. if ( 0 != rc ) {
  319. slapi_log_error( SLAPI_LOG_FATAL, RETROCL_PLUGIN_NAME,
  320. "replog: an error occured while adding change "
  321. "number %lu, dn = %s: %s. \n",
  322. changenum, edn, ldap_err2string( rc ));
  323. retrocl_release_changenumber();
  324. } else {
  325. /* Tell the change numbering system this one's committed to disk */
  326. retrocl_commit_changenumber();
  327. }
  328. } else {
  329. slapi_log_error( SLAPI_LOG_FATAL, RETROCL_PLUGIN_NAME,
  330. "An error occurred while constructing "
  331. "change record number %ld.\n", changenum );
  332. retrocl_release_changenumber();
  333. }
  334. PR_Unlock(retrocl_internal_lock);
  335. if ( NULL != edn ) {
  336. slapi_ch_free((void **) &edn);
  337. }
  338. }
  339. /*
  340. * Function: entry2reple
  341. * Arguments: e - a partially-constructed Slapi_Entry structure
  342. * oe - the original entry (an entry being added by a client).
  343. * Returns: 0 on success.
  344. * Description: Given an Slapi_Entry struct, construct a changelog entry which will be
  345. * added to the replication database. It is assumed that e points
  346. * to an entry obtained from slapi_entry_alloc().
  347. */
  348. static int
  349. entry2reple( Slapi_Entry *e, Slapi_Entry *oe, int optype )
  350. {
  351. char *p, *estr;
  352. struct berval *vals[ 2 ];
  353. struct berval val;
  354. int len;
  355. vals[ 0 ] = &val;
  356. vals[ 1 ] = NULL;
  357. /* Set the changetype attribute */
  358. if ( optype == OP_ADD ) {
  359. val.bv_val = "add";
  360. val.bv_len = 3;
  361. } else if ( optype == OP_DELETE) {
  362. val.bv_val = "delete";
  363. val.bv_len = 6;
  364. } else {
  365. return (1);
  366. }
  367. slapi_entry_add_values( e, attr_changetype, vals );
  368. estr = slapi_entry2str( oe, &len );
  369. p = estr;
  370. /* Skip over the dn: line */
  371. while (( p = strchr( p, '\n' )) != NULL ) {
  372. p++;
  373. if ( !ldap_utf8isspace( p )) {
  374. break;
  375. }
  376. }
  377. val.bv_val = p;
  378. val.bv_len = len - ( p - estr ); /* length + terminating \0 */
  379. slapi_entry_add_values( e, attr_changes, vals );
  380. slapi_ch_free_string( &estr );
  381. return 0;
  382. }
  383. /*
  384. * Function: mods2reple
  385. * Arguments: e - a partially-constructed Slapi_Entry structure
  386. * ldm - an array of pointers to LDAPMod structures describing the
  387. * change applied.
  388. * Returns: 0 on success.
  389. * Description: Given a pointer to an LDAPMod struct and a dn, construct
  390. * a new entry which will be added to the replication database.
  391. * It is assumed that e points to an entry obtained from
  392. * slapi_entry_alloc().
  393. */
  394. static int
  395. mods2reple( Slapi_Entry *e, LDAPMod **ldm )
  396. {
  397. struct berval val;
  398. struct berval *vals[ 2 ];
  399. lenstr *l;
  400. vals[ 0 ] = &val;
  401. vals[ 1 ] = NULL;
  402. /* Set the changetype attribute */
  403. val.bv_val = "modify";
  404. val.bv_len = 6;
  405. slapi_entry_add_values( e, "changetype", vals );
  406. if (NULL != ldm) {
  407. l = make_changes_string( ldm, NULL );
  408. if ( NULL != l ) {
  409. val.bv_val = l->ls_buf;
  410. val.bv_len = l->ls_len + 1; /* string + terminating \0 */
  411. slapi_entry_add_values( e, attr_changes, vals );
  412. lenstr_free( &l );
  413. }
  414. }
  415. return 0;
  416. }
  417. /*
  418. * Function: modrdn2reple
  419. * Arguments: e - a partially-constructed Slapi_Entry structure
  420. * newrdn - the new relative distinguished name for the entry
  421. * deloldrdn - the "deleteoldrdn" flag provided by the client
  422. * ldm - any modifications applied as a side-effect of the modrdn
  423. * Returns: 0 on success
  424. * Description: Given a dn, a new rdn, and a deleteoldrdn flag, construct
  425. * a new entry which will be added to the replication database reflecting a
  426. * completed modrdn operation. The entry has the same form as above.
  427. * It is assumed that e points to an entry obtained from slapi_entry_alloc().
  428. */
  429. static int
  430. modrdn2reple(
  431. Slapi_Entry *e,
  432. const char *newrdn,
  433. int deloldrdn,
  434. LDAPMod **ldm,
  435. const char *newsuperior
  436. )
  437. {
  438. struct berval val;
  439. struct berval *vals[ 2 ];
  440. lenstr *l;
  441. static const char *lastmodattrs[] = {"modifiersname", "modifytimestamp",
  442. "creatorsname", "createtimestamp",
  443. NULL };
  444. vals[ 0 ] = &val;
  445. vals[ 1 ] = NULL;
  446. val.bv_val = "modrdn";
  447. val.bv_len = 6;
  448. slapi_entry_add_values( e, attr_changetype, vals );
  449. if (newrdn) {
  450. val.bv_val = (char *)newrdn; /* cast away const */
  451. val.bv_len = strlen( newrdn );
  452. slapi_entry_add_values( e, attr_newrdn, vals );
  453. }
  454. if ( deloldrdn == 0 ) {
  455. val.bv_val = "FALSE";
  456. val.bv_len = 5;
  457. } else {
  458. val.bv_val = "TRUE";
  459. val.bv_len = 4;
  460. }
  461. slapi_entry_add_values( e, attr_deleteoldrdn, vals );
  462. if (newsuperior) {
  463. val.bv_val = (char *)newsuperior; /* cast away const */
  464. val.bv_len = strlen(newsuperior);
  465. slapi_entry_add_values(e, attr_newsuperior,vals);
  466. }
  467. if (NULL != ldm) {
  468. l = make_changes_string( ldm, lastmodattrs );
  469. if ( NULL != l ) {
  470. val.bv_val = l->ls_buf;
  471. val.bv_len = l->ls_len + 1; /* string + terminating \0 */
  472. slapi_entry_add_values( e, attr_changes, vals );
  473. lenstr_free( &l );
  474. }
  475. }
  476. return 0;
  477. }
  478. /*
  479. * Function: retrocl_postob
  480. *
  481. * Returns: 0 on success
  482. *
  483. * Arguments: pblock, optype (add, del, modify etc)
  484. *
  485. * Description: called from retrocl.c op-specific plugins.
  486. *
  487. * Please be aware that operation threads may be scheduled out between their
  488. * being performed inside of the LDBM database and the changelog plugin
  489. * running. For example, suppose MA and MB are two modify operations on the
  490. * same entry. MA may be performed on the LDBM database, and then block
  491. * before the changelog runs. MB then runs against the LDBM database and then
  492. * is written to the changelog. MA starts running. In the changelog, MB will
  493. * appear to have been performed before MA, but in the LDBM database the
  494. * opposite will have occured.
  495. *
  496. *
  497. */
  498. int retrocl_postob (Slapi_PBlock *pb,int optype)
  499. {
  500. char *dn;
  501. LDAPMod **log_m = NULL;
  502. int flag = 0;
  503. Slapi_Entry *te = NULL;
  504. Slapi_Operation *op = NULL;
  505. LDAPMod **modrdn_mods = NULL;
  506. char *newrdn = NULL;
  507. Slapi_DN *newsuperior = NULL;
  508. Slapi_Backend *be = NULL;
  509. time_t curtime;
  510. int rc;
  511. /*
  512. * Check to see if the change was made to the replication backend db.
  513. * If so, don't try to log it to the db (otherwise, we'd get in a loop).
  514. */
  515. (void)slapi_pblock_get( pb, SLAPI_BACKEND, &be );
  516. if (slapi_be_logchanges(be) == 0) {
  517. LDAPDebug0Args(LDAP_DEBUG_TRACE,"not applying change if not logging\n");
  518. return SLAPI_PLUGIN_SUCCESS;
  519. }
  520. if (retrocl_be_changelog == NULL || be == retrocl_be_changelog) {
  521. LDAPDebug0Args(LDAP_DEBUG_TRACE,"not applying change if no/cl be\n");
  522. return SLAPI_PLUGIN_SUCCESS;
  523. }
  524. slapi_pblock_get(pb, SLAPI_RESULT_CODE, &rc);
  525. if (rc != LDAP_SUCCESS) {
  526. LDAPDebug1Arg(LDAP_DEBUG_TRACE,"not applying change if op failed %d\n",rc);
  527. return SLAPI_PLUGIN_SUCCESS;
  528. }
  529. if (slapi_op_abandoned(pb)) {
  530. LDAPDebug0Args(LDAP_DEBUG_PLUGIN,"not applying change if op abandoned\n");
  531. return SLAPI_PLUGIN_SUCCESS;
  532. }
  533. curtime = current_time();
  534. (void)slapi_pblock_get( pb, SLAPI_ORIGINAL_TARGET_DN, &dn );
  535. /* change number could be retrieved from Operation extension stored in
  536. * the pblock, or else it needs to be made dynamically. */
  537. /* get the operation extension and retrieve the change number */
  538. slapi_pblock_get( pb, SLAPI_OPERATION, &op );
  539. if (op == NULL) {
  540. LDAPDebug0Args(LDAP_DEBUG_TRACE,"not applying change if no op\n");
  541. return SLAPI_PLUGIN_SUCCESS;
  542. }
  543. if (operation_is_flag_set(op, OP_FLAG_TOMBSTONE_ENTRY)){
  544. LDAPDebug0Args(LDAP_DEBUG_TRACE,"not applying change for nsTombstone entries\n");
  545. return SLAPI_PLUGIN_SUCCESS;
  546. }
  547. switch ( optype ) {
  548. case OP_MODIFY:
  549. (void)slapi_pblock_get( pb, SLAPI_MODIFY_MODS, &log_m );
  550. break;
  551. case OP_ADD:
  552. /*
  553. * For adds, we want the unnormalized dn, so we can preserve
  554. * spacing, case, when replicating it.
  555. */
  556. (void)slapi_pblock_get( pb, SLAPI_ADD_ENTRY, &te );
  557. if ( NULL != te ) {
  558. dn = slapi_entry_get_dn( te );
  559. }
  560. break;
  561. case OP_DELETE:
  562. if (retrocl_log_deleted)
  563. (void)slapi_pblock_get(pb, SLAPI_ENTRY_PRE_OP, &te);
  564. break;
  565. case OP_MODRDN:
  566. /* newrdn is used just for logging; no need to be normalized */
  567. (void)slapi_pblock_get( pb, SLAPI_MODRDN_NEWRDN, &newrdn );
  568. (void)slapi_pblock_get( pb, SLAPI_MODRDN_DELOLDRDN, &flag );
  569. (void)slapi_pblock_get( pb, SLAPI_MODIFY_MODS, &modrdn_mods );
  570. (void)slapi_pblock_get( pb, SLAPI_MODRDN_NEWSUPERIOR_SDN, &newsuperior );
  571. break;
  572. }
  573. /* check if we should log change to retro changelog, and
  574. * if so, do it here */
  575. write_replog_db( pb, optype, dn, log_m, flag, curtime, te,
  576. newrdn, modrdn_mods, slapi_sdn_get_dn(newsuperior) );
  577. return 0;
  578. }