1
0

cl5_clcache.c 27 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953
  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) 2005 Red Hat, Inc.
  35. * All rights reserved.
  36. * END COPYRIGHT BLOCK **/
  37. #ifdef HAVE_CONFIG_H
  38. # include <config.h>
  39. #endif
  40. #include "errno.h" /* ENOMEM, EVAL used by Berkeley DB */
  41. #include "db.h" /* Berkeley DB */
  42. #include "cl5.h" /* changelog5Config */
  43. #include "cl5_clcache.h"
  44. /* newer bdb uses DB_BUFFER_SMALL instead of ENOMEM as the
  45. error return if the given buffer in which to load a
  46. key or value is too small - if it is not defined, define
  47. it here to ENOMEM
  48. */
  49. #ifndef DB_BUFFER_SMALL
  50. #define DB_BUFFER_SMALL ENOMEM
  51. #endif
  52. /*
  53. * Constants for the buffer pool:
  54. *
  55. * DEFAULT_CLC_BUFFER_PAGE_COUNT
  56. * Little performance boost if it is too small.
  57. *
  58. * DEFAULT_CLC_BUFFER_PAGE_SIZE
  59. * Its value is determined based on the DB requirement that
  60. * the buffer size should be the multiple of 1024.
  61. */
  62. #define DEFAULT_CLC_BUFFER_COUNT_MIN 10
  63. #define DEFAULT_CLC_BUFFER_COUNT_MAX 0
  64. #define DEFAULT_CLC_BUFFER_PAGE_COUNT 32
  65. #define DEFAULT_CLC_BUFFER_PAGE_SIZE 1024
  66. enum {
  67. CLC_STATE_READY = 0, /* ready to iterate */
  68. CLC_STATE_UP_TO_DATE, /* remote RUV already covers the CSN */
  69. CLC_STATE_CSN_GT_RUV, /* local RUV doesn't conver the CSN */
  70. CLC_STATE_NEW_RID, /* unknown RID to local RUVs */
  71. CLC_STATE_UNSAFE_RUV_CHANGE,/* (RUV1 < maxcsn-in-buffer) && (RUV1 < RUV1') */
  72. CLC_STATE_DONE, /* no more change */
  73. CLC_STATE_ABORTING /* abort replication session */
  74. };
  75. typedef struct clc_busy_list CLC_Busy_List;
  76. struct csn_seq_ctrl_block {
  77. ReplicaId rid; /* RID this block serves */
  78. CSN *consumer_maxcsn; /* Don't send CSN <= this */
  79. CSN *local_maxcsn; /* Don't send CSN > this */
  80. CSN *prev_local_maxcsn; /* */
  81. int state; /* CLC_STATE_* */
  82. };
  83. /*
  84. * Each cl5replayiterator acquires a buffer from the buffer pool
  85. * at the beginning of a replication session, and returns it back
  86. * at the end.
  87. */
  88. struct clc_buffer {
  89. char *buf_agmt_name; /* agreement acquired this buffer */
  90. ReplicaId buf_consumer_rid; /* help checking threshold csn */
  91. const RUV *buf_consumer_ruv; /* used to skip change */
  92. const RUV *buf_local_ruv; /* used to refresh local_maxcsn */
  93. /*
  94. * fields for retriving data from DB
  95. */
  96. int buf_state;
  97. CSN *buf_current_csn;
  98. int buf_load_flag; /* db flag DB_MULTIPLE_KEY, DB_SET, DB_NEXT */
  99. DBC *buf_cursor;
  100. DBT buf_key; /* current csn string */
  101. DBT buf_data; /* data retrived from db */
  102. void *buf_record_ptr; /* ptr to the current record in data */
  103. CSN *buf_missing_csn; /* used to detect persistent missing of CSN */
  104. /* fields for control the CSN sequence sent to the consumer */
  105. struct csn_seq_ctrl_block *buf_cscbs [MAX_NUM_OF_MASTERS];
  106. int buf_num_cscbs; /* number of csn sequence ctrl blocks */
  107. /* fields for debugging stat */
  108. int buf_load_cnt; /* number of loads for session */
  109. int buf_record_cnt; /* number of changes for session */
  110. int buf_record_skipped; /* number of changes skipped */
  111. /*
  112. * fields that should be accessed via bl_lock or pl_lock
  113. */
  114. CLC_Buffer *buf_next; /* next buffer in the same list */
  115. CLC_Busy_List *buf_busy_list; /* which busy list I'm in */
  116. };
  117. /*
  118. * Each changelog has a busy buffer list
  119. */
  120. struct clc_busy_list {
  121. PRLock *bl_lock;
  122. DB *bl_db; /* changelog db handle */
  123. CLC_Buffer *bl_buffers; /* busy buffers of this list */
  124. CLC_Busy_List *bl_next; /* next busy list in the pool */
  125. };
  126. /*
  127. * Each process has a buffer pool
  128. */
  129. struct clc_pool {
  130. PRRWLock *pl_lock; /* cl writer and agreements */
  131. DB_ENV **pl_dbenv; /* pointer to DB_ENV for all the changelog files */
  132. CLC_Busy_List *pl_busy_lists; /* busy buffer lists, one list per changelog file */
  133. int pl_buffer_cnt_now; /* total number of buffers */
  134. int pl_buffer_cnt_min; /* free a newly returned buffer if _now > _min */
  135. int pl_buffer_cnt_max; /* no use */
  136. int pl_buffer_default_pages; /* num of pages in a new buffer */
  137. };
  138. /* static variables */
  139. static struct clc_pool *_pool = NULL; /* process's buffer pool */
  140. /* static prototypes */
  141. static int clcache_adjust_anchorcsn ( CLC_Buffer *buf );
  142. static void clcache_refresh_consumer_maxcsns ( CLC_Buffer *buf );
  143. static int clcache_refresh_local_maxcsns ( CLC_Buffer *buf );
  144. static int clcache_skip_change ( CLC_Buffer *buf );
  145. static int clcache_load_buffer_bulk ( CLC_Buffer *buf, int flag );
  146. static int clcache_open_cursor ( DB_TXN *txn, CLC_Buffer *buf, DBC **cursor );
  147. static int clcache_cursor_get ( DBC *cursor, CLC_Buffer *buf, int flag );
  148. static struct csn_seq_ctrl_block *clcache_new_cscb ();
  149. static void clcache_free_cscb ( struct csn_seq_ctrl_block ** cscb );
  150. static CLC_Buffer *clcache_new_buffer ( ReplicaId consumer_rid );
  151. static void clcache_delete_buffer ( CLC_Buffer **buf );
  152. static CLC_Busy_List *clcache_new_busy_list ();
  153. static void clcache_delete_busy_list ( CLC_Busy_List **bl );
  154. static int clcache_enqueue_busy_list( DB *db, CLC_Buffer *buf );
  155. static void csn_dup_or_init_by_csn ( CSN **csn1, CSN *csn2 );
  156. /*
  157. * Initiates the process buffer pool. This should be done
  158. * once and only once when process starts.
  159. */
  160. int
  161. clcache_init ( DB_ENV **dbenv )
  162. {
  163. _pool = (struct clc_pool*) slapi_ch_calloc ( 1, sizeof ( struct clc_pool ));
  164. _pool->pl_dbenv = dbenv;
  165. _pool->pl_buffer_cnt_min = DEFAULT_CLC_BUFFER_COUNT_MIN;
  166. _pool->pl_buffer_cnt_max = DEFAULT_CLC_BUFFER_COUNT_MAX;
  167. _pool->pl_buffer_default_pages = DEFAULT_CLC_BUFFER_COUNT_MAX;
  168. _pool->pl_lock = PR_NewRWLock (PR_RWLOCK_RANK_NONE, "clcache_pl_lock");
  169. return 0;
  170. }
  171. /*
  172. * This is part of a callback function when changelog configuration
  173. * is read or updated.
  174. */
  175. void
  176. clcache_set_config ( CL5DBConfig *config )
  177. {
  178. if ( config == NULL ) return;
  179. PR_RWLock_Wlock ( _pool->pl_lock );
  180. _pool->pl_buffer_cnt_max = config->maxChCacheEntries;
  181. /*
  182. * According to http://www.sleepycat.com/docs/api_c/dbc_get.html,
  183. * data buffer should be a multiple of 1024 bytes in size
  184. * for DB_MULTIPLE_KEY operation.
  185. */
  186. _pool->pl_buffer_default_pages = config->maxChCacheSize / DEFAULT_CLC_BUFFER_PAGE_SIZE + 1;
  187. _pool->pl_buffer_default_pages = DEFAULT_CLC_BUFFER_PAGE_COUNT;
  188. if ( _pool->pl_buffer_default_pages <= 0 ) {
  189. _pool->pl_buffer_default_pages = DEFAULT_CLC_BUFFER_PAGE_COUNT;
  190. }
  191. PR_RWLock_Unlock ( _pool->pl_lock );
  192. }
  193. /*
  194. * Gets the pointer to a thread dedicated buffer, or allocates
  195. * a new buffer if there is no buffer allocated yet for this thread.
  196. *
  197. * This is called when a cl5replayiterator is created for
  198. * a replication session.
  199. */
  200. int
  201. clcache_get_buffer ( CLC_Buffer **buf, DB *db, ReplicaId consumer_rid, const RUV *consumer_ruv, const RUV *local_ruv )
  202. {
  203. int rc = 0;
  204. if ( buf == NULL ) return CL5_BAD_DATA;
  205. *buf = NULL;
  206. if ( NULL != ( *buf = (CLC_Buffer*) get_thread_private_cache()) ) {
  207. (*buf)->buf_state = CLC_STATE_READY;
  208. (*buf)->buf_load_cnt = 0;
  209. (*buf)->buf_record_cnt = 0;
  210. (*buf)->buf_record_skipped = 0;
  211. (*buf)->buf_cursor = NULL;
  212. (*buf)->buf_num_cscbs = 0;
  213. }
  214. else {
  215. *buf = clcache_new_buffer ( consumer_rid );
  216. if ( *buf ) {
  217. if ( 0 == clcache_enqueue_busy_list ( db, *buf ) ) {
  218. set_thread_private_cache ( (void*) (*buf) );
  219. }
  220. else {
  221. clcache_delete_buffer ( buf );
  222. }
  223. }
  224. }
  225. if ( NULL != *buf ) {
  226. (*buf)->buf_consumer_ruv = consumer_ruv;
  227. (*buf)->buf_local_ruv = local_ruv;
  228. }
  229. else {
  230. slapi_log_error ( SLAPI_LOG_FATAL, get_thread_private_agmtname(),
  231. "clcache_get_buffer: can't allocate new buffer\n" );
  232. rc = CL5_MEMORY_ERROR;
  233. }
  234. return rc;
  235. }
  236. /*
  237. * Returns a buffer back to the buffer pool.
  238. */
  239. void
  240. clcache_return_buffer ( CLC_Buffer **buf )
  241. {
  242. int i;
  243. slapi_log_error ( SLAPI_LOG_REPL, (*buf)->buf_agmt_name,
  244. "session end: state=%d load=%d sent=%d skipped=%d\n",
  245. (*buf)->buf_state,
  246. (*buf)->buf_load_cnt,
  247. (*buf)->buf_record_cnt - (*buf)->buf_record_skipped,
  248. (*buf)->buf_record_skipped );
  249. for ( i = 0; i < (*buf)->buf_num_cscbs; i++ ) {
  250. clcache_free_cscb ( &(*buf)->buf_cscbs[i] );
  251. }
  252. (*buf)->buf_num_cscbs = 0;
  253. if ( (*buf)->buf_cursor ) {
  254. (*buf)->buf_cursor->c_close ( (*buf)->buf_cursor );
  255. (*buf)->buf_cursor = NULL;
  256. }
  257. }
  258. /*
  259. * Loads a buffer from DB.
  260. *
  261. * anchorcsn - passed in for the first load of a replication session;
  262. * flag - DB_SET to load in the key CSN record.
  263. * DB_NEXT to load in the records greater than key CSN.
  264. * return - DB error code instead of cl5 one because of the
  265. * historic reason.
  266. */
  267. int
  268. clcache_load_buffer ( CLC_Buffer *buf, CSN *anchorcsn, int flag )
  269. {
  270. int rc = 0;
  271. clcache_refresh_local_maxcsns ( buf );
  272. /* Set the loading key */
  273. if ( anchorcsn ) {
  274. clcache_refresh_consumer_maxcsns ( buf );
  275. buf->buf_load_flag = DB_MULTIPLE_KEY;
  276. csn_as_string ( anchorcsn, 0, (char*)buf->buf_key.data );
  277. slapi_log_error ( SLAPI_LOG_REPL, buf->buf_agmt_name,
  278. "session start: anchorcsn=%s\n", (char*)buf->buf_key.data );
  279. }
  280. else if ( csn_get_time(buf->buf_current_csn) == 0 ) {
  281. /* time == 0 means this csn has never been set */
  282. rc = DB_NOTFOUND;
  283. }
  284. else if ( clcache_adjust_anchorcsn ( buf ) != 0 ) {
  285. rc = DB_NOTFOUND;
  286. }
  287. else {
  288. csn_as_string ( buf->buf_current_csn, 0, (char*)buf->buf_key.data );
  289. slapi_log_error ( SLAPI_LOG_REPL, buf->buf_agmt_name,
  290. "load next: anchorcsn=%s\n", (char*)buf->buf_key.data );
  291. }
  292. if ( rc == 0 ) {
  293. buf->buf_state = CLC_STATE_READY;
  294. rc = clcache_load_buffer_bulk ( buf, flag );
  295. /* Reset some flag variables */
  296. if ( rc == 0 ) {
  297. int i;
  298. for ( i = 0; i < buf->buf_num_cscbs; i++ ) {
  299. buf->buf_cscbs[i]->state = CLC_STATE_READY;
  300. }
  301. }
  302. else if ( anchorcsn ) {
  303. /* Report error only when the missing is persistent */
  304. if ( buf->buf_missing_csn && csn_compare (buf->buf_missing_csn, anchorcsn) == 0 ) {
  305. slapi_log_error ( SLAPI_LOG_FATAL, buf->buf_agmt_name,
  306. "Can't locate CSN %s in the changelog (DB rc=%d). The consumer may need to be reinitialized.\n",
  307. (char*)buf->buf_key.data, rc );
  308. }
  309. else {
  310. csn_dup_or_init_by_csn (&buf->buf_missing_csn, anchorcsn);
  311. }
  312. }
  313. }
  314. if ( rc != 0 ) {
  315. slapi_log_error ( SLAPI_LOG_REPL, buf->buf_agmt_name,
  316. "clcache_load_buffer: rc=%d\n", rc );
  317. }
  318. return rc;
  319. }
  320. static int
  321. clcache_load_buffer_bulk ( CLC_Buffer *buf, int flag )
  322. {
  323. DB_TXN *txn = NULL;
  324. DBC *cursor = NULL;
  325. int rc;
  326. /* txn control seems not improving anything so turn it off */
  327. /*
  328. if ( *(_pool->pl_dbenv) ) {
  329. txn_begin( *(_pool->pl_dbenv), NULL, &txn, 0 );
  330. }
  331. */
  332. PR_Lock ( buf->buf_busy_list->bl_lock );
  333. if ( 0 == ( rc = clcache_open_cursor ( txn, buf, &cursor )) ) {
  334. if ( flag == DB_NEXT ) {
  335. /* For bulk read, position the cursor before read the next block */
  336. rc = cursor->c_get ( cursor,
  337. & buf->buf_key,
  338. & buf->buf_data,
  339. DB_SET );
  340. }
  341. /*
  342. * Continue if the error is no-mem since we don't need to
  343. * load in the key record anyway with DB_SET.
  344. */
  345. if ( 0 == rc || DB_BUFFER_SMALL == rc )
  346. rc = clcache_cursor_get ( cursor, buf, flag );
  347. }
  348. /*
  349. * Don't keep a cursor open across the whole replication session.
  350. * That had caused noticable DB resource contention.
  351. */
  352. if ( cursor ) {
  353. cursor->c_close ( cursor );
  354. }
  355. if ( txn ) {
  356. txn->commit ( txn, DB_TXN_NOSYNC );
  357. }
  358. PR_Unlock ( buf->buf_busy_list->bl_lock );
  359. buf->buf_record_ptr = NULL;
  360. if ( 0 == rc ) {
  361. DB_MULTIPLE_INIT ( buf->buf_record_ptr, &buf->buf_data );
  362. if ( NULL == buf->buf_record_ptr )
  363. rc = DB_NOTFOUND;
  364. else
  365. buf->buf_load_cnt++;
  366. }
  367. return rc;
  368. }
  369. /*
  370. * Gets the next change from the buffer.
  371. * *key : output - key of the next change, or NULL if no more change
  372. * *data: output - data of the next change, or NULL if no more change
  373. */
  374. int
  375. clcache_get_next_change ( CLC_Buffer *buf, void **key, size_t *keylen, void **data, size_t *datalen, CSN **csn )
  376. {
  377. int skip = 1;
  378. int rc = 0;
  379. do {
  380. *key = *data = NULL;
  381. *keylen = *datalen = 0;
  382. if ( buf->buf_record_ptr ) {
  383. DB_MULTIPLE_KEY_NEXT ( buf->buf_record_ptr, &buf->buf_data,
  384. *key, *keylen, *data, *datalen );
  385. }
  386. /*
  387. * We're done with the current buffer. Now load the next chunk.
  388. */
  389. if ( NULL == *key && CLC_STATE_READY == buf->buf_state ) {
  390. rc = clcache_load_buffer ( buf, NULL, DB_NEXT );
  391. if ( 0 == rc && buf->buf_record_ptr ) {
  392. DB_MULTIPLE_KEY_NEXT ( buf->buf_record_ptr, &buf->buf_data,
  393. *key, *keylen, *data, *datalen );
  394. }
  395. }
  396. /* Compare the new change to the local and remote RUVs */
  397. if ( NULL != *key ) {
  398. buf->buf_record_cnt++;
  399. csn_init_by_string ( buf->buf_current_csn, (char*)*key );
  400. skip = clcache_skip_change ( buf );
  401. if (skip) buf->buf_record_skipped++;
  402. }
  403. }
  404. while ( rc == 0 && *key && skip );
  405. if ( NULL == *key ) {
  406. *key = NULL;
  407. *csn = NULL;
  408. rc = DB_NOTFOUND;
  409. }
  410. else {
  411. *csn = buf->buf_current_csn;
  412. slapi_log_error ( SLAPI_LOG_REPL, buf->buf_agmt_name,
  413. "load=%d rec=%d csn=%s\n",
  414. buf->buf_load_cnt, buf->buf_record_cnt, (char*)*key );
  415. }
  416. return rc;
  417. }
  418. static void
  419. clcache_refresh_consumer_maxcsns ( CLC_Buffer *buf )
  420. {
  421. int i;
  422. for ( i = 0; i < buf->buf_num_cscbs; i++ ) {
  423. ruv_get_largest_csn_for_replica (
  424. buf->buf_consumer_ruv,
  425. buf->buf_cscbs[i]->rid,
  426. &buf->buf_cscbs[i]->consumer_maxcsn );
  427. }
  428. }
  429. static int
  430. clcache_refresh_local_maxcsn ( const ruv_enum_data *rid_data, void *data )
  431. {
  432. CLC_Buffer *buf = (CLC_Buffer*) data;
  433. ReplicaId rid;
  434. int rc = 0;
  435. int i;
  436. rid = csn_get_replicaid ( rid_data->csn );
  437. /*
  438. * No need to create cscb for consumer's RID.
  439. * If RID==65535, the CSN is originated from a
  440. * legacy consumer. In this case the supplier
  441. * and the consumer may have the same RID.
  442. */
  443. if ( rid == buf->buf_consumer_rid && rid != MAX_REPLICA_ID )
  444. return rc;
  445. for ( i = 0; i < buf->buf_num_cscbs; i++ ) {
  446. if ( buf->buf_cscbs[i]->rid == rid )
  447. break;
  448. }
  449. if ( i >= buf->buf_num_cscbs ) {
  450. buf->buf_cscbs[i] = clcache_new_cscb ();
  451. if ( buf->buf_cscbs[i] == NULL ) {
  452. return -1;
  453. }
  454. buf->buf_cscbs[i]->rid = rid;
  455. buf->buf_num_cscbs++;
  456. }
  457. csn_dup_or_init_by_csn ( &buf->buf_cscbs[i]->local_maxcsn, rid_data->csn );
  458. if ( buf->buf_cscbs[i]->consumer_maxcsn &&
  459. csn_compare (buf->buf_cscbs[i]->consumer_maxcsn, rid_data->csn) >= 0 ) {
  460. /* No change need to be sent for this RID */
  461. buf->buf_cscbs[i]->state = CLC_STATE_UP_TO_DATE;
  462. }
  463. return rc;
  464. }
  465. static int
  466. clcache_refresh_local_maxcsns ( CLC_Buffer *buf )
  467. {
  468. int i;
  469. for ( i = 0; i < buf->buf_num_cscbs; i++ ) {
  470. csn_dup_or_init_by_csn ( &buf->buf_cscbs[i]->prev_local_maxcsn,
  471. buf->buf_cscbs[i]->local_maxcsn );
  472. }
  473. return ruv_enumerate_elements ( buf->buf_local_ruv, clcache_refresh_local_maxcsn, buf );
  474. }
  475. /*
  476. * Algorithm:
  477. *
  478. * 1. Snapshot local RUVs;
  479. * 2. Load buffer;
  480. * 3. Send to the consumer only those CSNs that are covered
  481. * by the RUVs snapshot taken in the first step;
  482. * All CSNs that are covered by the RUVs snapshot taken in the
  483. * first step are guaranteed in consecutive order for the respected
  484. * RIDs because of the the CSN pending list control;
  485. * A CSN that is not covered by the RUVs snapshot may be out of order
  486. * since it is possible that a smaller CSN might not have committed
  487. * yet by the time the buffer was loaded.
  488. * 4. Determine anchorcsn for each RID:
  489. *
  490. * Case| Local vs. Buffer | New Local | Next
  491. * | MaxCSN MaxCSN | MaxCSN | Anchor-CSN
  492. * ----+-------------------+-----------+----------------
  493. * 1 | Cl >= Cb | * | Cb
  494. * 2 | Cl < Cb | Cl | Cb
  495. * 3 | Cl < Cb | Cl2 | Cl
  496. *
  497. * 5. Determine anchorcsn for next load:
  498. * Anchor-CSN = min { all Next-Anchor-CSN, Buffer-MaxCSN }
  499. */
  500. static int
  501. clcache_adjust_anchorcsn ( CLC_Buffer *buf )
  502. {
  503. PRBool hasChange = PR_FALSE;
  504. struct csn_seq_ctrl_block *cscb;
  505. int i;
  506. if ( buf->buf_state == CLC_STATE_READY ) {
  507. for ( i = 0; i < buf->buf_num_cscbs; i++ ) {
  508. cscb = buf->buf_cscbs[i];
  509. if ( cscb->state == CLC_STATE_UP_TO_DATE )
  510. continue;
  511. /*
  512. * Case 3 unsafe ruv change: next buffer load should start
  513. * from where the maxcsn in the old ruv was. Since each
  514. * cscb has remembered the maxcsn sent to the consumer,
  515. * CSNs that may be loaded again could easily be skipped.
  516. */
  517. if ( cscb->prev_local_maxcsn &&
  518. csn_compare (cscb->prev_local_maxcsn, buf->buf_current_csn) < 0 &&
  519. csn_compare (cscb->local_maxcsn, cscb->prev_local_maxcsn) != 0 ) {
  520. hasChange = PR_TRUE;
  521. cscb->state = CLC_STATE_READY;
  522. csn_init_by_csn ( buf->buf_current_csn, cscb->prev_local_maxcsn );
  523. csn_as_string ( cscb->prev_local_maxcsn, 0, (char*)buf->buf_key.data );
  524. slapi_log_error ( SLAPI_LOG_REPL, buf->buf_agmt_name,
  525. "adjust anchor csn upon %s\n",
  526. ( cscb->state == CLC_STATE_CSN_GT_RUV ? "out of sequence csn" : "unsafe ruv change") );
  527. continue;
  528. }
  529. /*
  530. * check if there are still changes to send for this RID
  531. * Assume we had compared the local maxcsn and the consumer
  532. * max csn before this function was called and hence the
  533. * cscb->state had been set accordingly.
  534. */
  535. if ( hasChange == PR_FALSE &&
  536. csn_compare (cscb->local_maxcsn, buf->buf_current_csn) > 0 ) {
  537. hasChange = PR_TRUE;
  538. }
  539. }
  540. }
  541. if ( !hasChange ) {
  542. buf->buf_state = CLC_STATE_DONE;
  543. }
  544. return buf->buf_state;
  545. }
  546. static int
  547. clcache_skip_change ( CLC_Buffer *buf )
  548. {
  549. struct csn_seq_ctrl_block *cscb = NULL;
  550. ReplicaId rid;
  551. int skip = 1;
  552. int i;
  553. do {
  554. rid = csn_get_replicaid ( buf->buf_current_csn );
  555. /*
  556. * Skip CSN that is originated from the consumer.
  557. * If RID==65535, the CSN is originated from a
  558. * legacy consumer. In this case the supplier
  559. * and the consumer may have the same RID.
  560. */
  561. if (rid == buf->buf_consumer_rid && rid != MAX_REPLICA_ID)
  562. break;
  563. /* Skip helper entry (ENTRY_COUNT, PURGE_RUV and so on) */
  564. if ( cl5HelperEntry ( NULL, buf->buf_current_csn ) == PR_TRUE ) {
  565. slapi_log_error ( SLAPI_LOG_REPL, buf->buf_agmt_name,
  566. "Skip helper entry type=%d\n", csn_get_time( buf->buf_current_csn ));
  567. break;
  568. }
  569. /* Find csn sequence control block for the current rid */
  570. for (i = 0; i < buf->buf_num_cscbs && buf->buf_cscbs[i]->rid != rid; i++);
  571. /* Skip CSN whose RID is unknown to the local RUV snapshot */
  572. if ( i >= buf->buf_num_cscbs ) {
  573. buf->buf_state = CLC_STATE_NEW_RID;
  574. break;
  575. }
  576. cscb = buf->buf_cscbs[i];
  577. /* Skip if the consumer is already up-to-date for the RID */
  578. if ( cscb->state == CLC_STATE_UP_TO_DATE ) {
  579. break;
  580. }
  581. /* Skip CSN whose preceedents are not covered by local RUV snapshot */
  582. if ( cscb->state == CLC_STATE_CSN_GT_RUV ) {
  583. break;
  584. }
  585. /* Skip CSNs already covered by consumer RUV */
  586. if ( cscb->consumer_maxcsn &&
  587. csn_compare ( buf->buf_current_csn, cscb->consumer_maxcsn ) <= 0 ) {
  588. break;
  589. }
  590. /* Send CSNs that are covered by the local RUV snapshot */
  591. if ( csn_compare ( buf->buf_current_csn, cscb->local_maxcsn ) <= 0 ) {
  592. skip = 0;
  593. csn_dup_or_init_by_csn ( &cscb->consumer_maxcsn, buf->buf_current_csn );
  594. break;
  595. }
  596. /*
  597. * Promote the local maxcsn to its next neighbor
  598. * to keep the current session going. Skip if we
  599. * are not sure if current_csn is the neighbor.
  600. */
  601. if ( csn_time_difference(buf->buf_current_csn, cscb->local_maxcsn) == 0 &&
  602. (csn_get_seqnum(buf->buf_current_csn) ==
  603. csn_get_seqnum(cscb->local_maxcsn) + 1) ) {
  604. csn_init_by_csn ( cscb->local_maxcsn, buf->buf_current_csn );
  605. csn_init_by_csn ( cscb->consumer_maxcsn, buf->buf_current_csn );
  606. skip = 0;
  607. break;
  608. }
  609. /* Skip CSNs not covered by local RUV snapshot */
  610. cscb->state = CLC_STATE_CSN_GT_RUV;
  611. } while (0);
  612. #ifdef DEBUG
  613. if (skip && cscb) {
  614. char consumer[24] = {'\0'};
  615. char local[24] = {'\0'};
  616. char current[24] = {'\0'};
  617. if ( cscb->consumer_maxcsn )
  618. csn_as_string ( cscb->consumer_maxcsn, PR_FALSE, consumer );
  619. if ( cscb->local_maxcsn )
  620. csn_as_string ( cscb->local_maxcsn, PR_FALSE, local );
  621. csn_as_string ( buf->buf_current_csn, PR_FALSE, current );
  622. slapi_log_error ( SLAPI_LOG_REPL, buf->buf_agmt_name,
  623. "Skip %s consumer=%s local=%s\n", current, consumer, local );
  624. }
  625. #endif
  626. return skip;
  627. }
  628. static struct csn_seq_ctrl_block *
  629. clcache_new_cscb ()
  630. {
  631. struct csn_seq_ctrl_block *cscb;
  632. cscb = (struct csn_seq_ctrl_block *) slapi_ch_calloc ( 1, sizeof (struct csn_seq_ctrl_block) );
  633. if (cscb == NULL) {
  634. slapi_log_error ( SLAPI_LOG_FATAL, NULL, "clcache: malloc failure\n" );
  635. }
  636. return cscb;
  637. }
  638. static void
  639. clcache_free_cscb ( struct csn_seq_ctrl_block ** cscb )
  640. {
  641. csn_free ( & (*cscb)->consumer_maxcsn );
  642. csn_free ( & (*cscb)->local_maxcsn );
  643. csn_free ( & (*cscb)->prev_local_maxcsn );
  644. slapi_ch_free ( (void **) cscb );
  645. }
  646. /*
  647. * Allocate and initialize a new buffer
  648. * It is called when there is a request for a buffer while
  649. * buffer free list is empty.
  650. */
  651. static CLC_Buffer *
  652. clcache_new_buffer ( ReplicaId consumer_rid )
  653. {
  654. CLC_Buffer *buf = NULL;
  655. int welldone = 0;
  656. do {
  657. buf = (CLC_Buffer*) slapi_ch_calloc (1, sizeof(CLC_Buffer));
  658. if ( NULL == buf )
  659. break;
  660. buf->buf_key.flags = DB_DBT_USERMEM;
  661. buf->buf_key.ulen = CSN_STRSIZE + 1;
  662. buf->buf_key.size = CSN_STRSIZE;
  663. buf->buf_key.data = slapi_ch_calloc( 1, buf->buf_key.ulen );
  664. if ( NULL == buf->buf_key.data )
  665. break;
  666. buf->buf_data.flags = DB_DBT_USERMEM;
  667. buf->buf_data.ulen = _pool->pl_buffer_default_pages * DEFAULT_CLC_BUFFER_PAGE_SIZE;
  668. buf->buf_data.data = slapi_ch_malloc( buf->buf_data.ulen );
  669. if ( NULL == buf->buf_data.data )
  670. break;
  671. if ( NULL == ( buf->buf_current_csn = csn_new()) )
  672. break;
  673. buf->buf_state = CLC_STATE_READY;
  674. buf->buf_agmt_name = get_thread_private_agmtname();
  675. buf->buf_consumer_rid = consumer_rid;
  676. buf->buf_num_cscbs = 0;
  677. welldone = 1;
  678. } while (0);
  679. if ( !welldone ) {
  680. clcache_delete_buffer ( &buf );
  681. }
  682. return buf;
  683. }
  684. /*
  685. * Deallocates a buffer.
  686. * It is called when a buffer is returned to the buffer pool
  687. * and the pool size is over the limit.
  688. */
  689. static void
  690. clcache_delete_buffer ( CLC_Buffer **buf )
  691. {
  692. if ( buf && *buf ) {
  693. slapi_ch_free (&( (*buf)->buf_key.data ));
  694. slapi_ch_free (&( (*buf)->buf_data.data ));
  695. csn_free (&( (*buf)->buf_current_csn ));
  696. csn_free (&( (*buf)->buf_missing_csn ));
  697. slapi_ch_free ( (void **) buf );
  698. }
  699. }
  700. static CLC_Busy_List *
  701. clcache_new_busy_list ()
  702. {
  703. CLC_Busy_List *bl;
  704. int welldone = 0;
  705. do {
  706. if ( NULL == (bl = ( CLC_Busy_List* ) slapi_ch_calloc (1, sizeof(CLC_Busy_List)) ))
  707. break;
  708. if ( NULL == (bl->bl_lock = PR_NewLock ()) )
  709. break;
  710. /*
  711. if ( NULL == (bl->bl_max_csn = csn_new ()) )
  712. break;
  713. */
  714. welldone = 1;
  715. }
  716. while (0);
  717. if ( !welldone ) {
  718. clcache_delete_busy_list ( &bl );
  719. }
  720. return bl;
  721. }
  722. static void
  723. clcache_delete_busy_list ( CLC_Busy_List **bl )
  724. {
  725. if ( bl && *bl ) {
  726. if ( (*bl)->bl_lock ) {
  727. PR_DestroyLock ( (*bl)->bl_lock );
  728. }
  729. /* csn_free (&( (*bl)->bl_max_csn )); */
  730. slapi_ch_free ( (void **) bl );
  731. }
  732. }
  733. static int
  734. clcache_enqueue_busy_list ( DB *db, CLC_Buffer *buf )
  735. {
  736. CLC_Busy_List *bl;
  737. int rc = 0;
  738. PR_RWLock_Rlock ( _pool->pl_lock );
  739. for ( bl = _pool->pl_busy_lists; bl && bl->bl_db != db; bl = bl->bl_next );
  740. PR_RWLock_Unlock ( _pool->pl_lock );
  741. if ( NULL == bl ) {
  742. if ( NULL == ( bl = clcache_new_busy_list ()) ) {
  743. rc = CL5_MEMORY_ERROR;
  744. }
  745. else {
  746. PR_RWLock_Wlock ( _pool->pl_lock );
  747. bl->bl_db = db;
  748. bl->bl_next = _pool->pl_busy_lists;
  749. _pool->pl_busy_lists = bl;
  750. PR_RWLock_Unlock ( _pool->pl_lock );
  751. }
  752. }
  753. if ( NULL != bl ) {
  754. PR_Lock ( bl->bl_lock );
  755. buf->buf_busy_list = bl;
  756. buf->buf_next = bl->bl_buffers;
  757. bl->bl_buffers = buf;
  758. PR_Unlock ( bl->bl_lock );
  759. }
  760. return rc;
  761. }
  762. static int
  763. clcache_open_cursor ( DB_TXN *txn, CLC_Buffer *buf, DBC **cursor )
  764. {
  765. int rc;
  766. rc = buf->buf_busy_list->bl_db->cursor ( buf->buf_busy_list->bl_db, txn, cursor, 0 );
  767. if ( rc != 0 ) {
  768. slapi_log_error ( SLAPI_LOG_FATAL, get_thread_private_agmtname(),
  769. "clcache: failed to open cursor; db error - %d %s\n",
  770. rc, db_strerror(rc));
  771. }
  772. return rc;
  773. }
  774. static int
  775. clcache_cursor_get ( DBC *cursor, CLC_Buffer *buf, int flag )
  776. {
  777. int rc;
  778. rc = cursor->c_get ( cursor,
  779. & buf->buf_key,
  780. & buf->buf_data,
  781. buf->buf_load_flag | flag );
  782. if ( DB_BUFFER_SMALL == rc ) {
  783. /*
  784. * The record takes more space than the current size of the
  785. * buffer. Fortunately, buf->buf_data.size has been set by
  786. * c_get() to the actual data size needed. So we can
  787. * reallocate the data buffer and try to read again.
  788. */
  789. buf->buf_data.ulen = ( buf->buf_data.size / DEFAULT_CLC_BUFFER_PAGE_SIZE + 1 ) * DEFAULT_CLC_BUFFER_PAGE_SIZE;
  790. buf->buf_data.data = slapi_ch_realloc ( buf->buf_data.data, buf->buf_data.ulen );
  791. if ( buf->buf_data.data != NULL ) {
  792. rc = cursor->c_get ( cursor,
  793. &( buf->buf_key ),
  794. &( buf->buf_data ),
  795. buf->buf_load_flag | flag );
  796. slapi_log_error ( SLAPI_LOG_REPL, buf->buf_agmt_name,
  797. "clcache: (%d | %d) %s reallocated and retry returns %d\n", buf->buf_load_flag, flag, buf->buf_key.data, rc );
  798. }
  799. }
  800. switch ( rc ) {
  801. case EINVAL:
  802. slapi_log_error ( SLAPI_LOG_FATAL, buf->buf_agmt_name,
  803. "clcache_cursor_get: invalid parameter\n" );
  804. break;
  805. case DB_BUFFER_SMALL:
  806. slapi_log_error ( SLAPI_LOG_FATAL, buf->buf_agmt_name,
  807. "clcache_cursor_get: can't allocate %u bytes\n", buf->buf_data.ulen );
  808. break;
  809. default:
  810. break;
  811. }
  812. return rc;
  813. }
  814. static void
  815. csn_dup_or_init_by_csn ( CSN **csn1, CSN *csn2 )
  816. {
  817. if ( *csn1 == NULL )
  818. *csn1 = csn_new();
  819. csn_init_by_csn ( *csn1, csn2 );
  820. }