cl5_clcache.c 29 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023
  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. Slapi_RWLock *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. if (_pool) {
  164. return 0; /* already initialized */
  165. }
  166. if (NULL == dbenv) {
  167. return -1;
  168. }
  169. _pool = (struct clc_pool*) slapi_ch_calloc ( 1, sizeof ( struct clc_pool ));
  170. _pool->pl_dbenv = dbenv;
  171. _pool->pl_buffer_cnt_min = DEFAULT_CLC_BUFFER_COUNT_MIN;
  172. _pool->pl_buffer_cnt_max = DEFAULT_CLC_BUFFER_COUNT_MAX;
  173. _pool->pl_buffer_default_pages = DEFAULT_CLC_BUFFER_COUNT_MAX;
  174. _pool->pl_lock = slapi_new_rwlock ();
  175. return 0;
  176. }
  177. /*
  178. * This is part of a callback function when changelog configuration
  179. * is read or updated.
  180. */
  181. void
  182. clcache_set_config ()
  183. {
  184. slapi_rwlock_wrlock ( _pool->pl_lock );
  185. _pool->pl_buffer_cnt_max = CL5_DEFAULT_CONFIG_CACHESIZE;
  186. /*
  187. * According to http://www.sleepycat.com/docs/api_c/dbc_get.html,
  188. * data buffer should be a multiple of 1024 bytes in size
  189. * for DB_MULTIPLE_KEY operation.
  190. */
  191. _pool->pl_buffer_default_pages = CL5_DEFAULT_CONFIG_CACHEMEMSIZE / DEFAULT_CLC_BUFFER_PAGE_SIZE + 1;
  192. _pool->pl_buffer_default_pages = DEFAULT_CLC_BUFFER_PAGE_COUNT;
  193. if ( _pool->pl_buffer_default_pages <= 0 ) {
  194. _pool->pl_buffer_default_pages = DEFAULT_CLC_BUFFER_PAGE_COUNT;
  195. }
  196. slapi_rwlock_unlock ( _pool->pl_lock );
  197. }
  198. /*
  199. * Gets the pointer to a thread dedicated buffer, or allocates
  200. * a new buffer if there is no buffer allocated yet for this thread.
  201. *
  202. * This is called when a cl5replayiterator is created for
  203. * a replication session.
  204. */
  205. int
  206. clcache_get_buffer ( CLC_Buffer **buf, DB *db, ReplicaId consumer_rid, const RUV *consumer_ruv, const RUV *local_ruv )
  207. {
  208. int rc = 0;
  209. int need_new;
  210. if ( buf == NULL ) return CL5_BAD_DATA;
  211. *buf = NULL;
  212. /* if the pool was re-initialized, the thread private cache will be invalid,
  213. so we must get a new one */
  214. need_new = (!_pool || !_pool->pl_busy_lists || !_pool->pl_busy_lists->bl_buffers);
  215. if ( (!need_new) && (NULL != ( *buf = (CLC_Buffer*) get_thread_private_cache())) ) {
  216. slapi_log_error ( SLAPI_LOG_REPL, get_thread_private_agmtname(),
  217. "clcache_get_buffer: found thread private buffer cache %p\n", *buf);
  218. slapi_log_error ( SLAPI_LOG_REPL, get_thread_private_agmtname(),
  219. "clcache_get_buffer: _pool is %p _pool->pl_busy_lists is %p _pool->pl_busy_lists->bl_buffers is %p\n",
  220. _pool, _pool ? _pool->pl_busy_lists : NULL,
  221. (_pool && _pool->pl_busy_lists) ? _pool->pl_busy_lists->bl_buffers : NULL);
  222. (*buf)->buf_state = CLC_STATE_READY;
  223. (*buf)->buf_load_cnt = 0;
  224. (*buf)->buf_record_cnt = 0;
  225. (*buf)->buf_record_skipped = 0;
  226. (*buf)->buf_cursor = NULL;
  227. (*buf)->buf_num_cscbs = 0;
  228. }
  229. else {
  230. *buf = clcache_new_buffer ( consumer_rid );
  231. if ( *buf ) {
  232. if ( 0 == clcache_enqueue_busy_list ( db, *buf ) ) {
  233. set_thread_private_cache ( (void*) (*buf) );
  234. }
  235. else {
  236. clcache_delete_buffer ( buf );
  237. }
  238. }
  239. }
  240. if ( NULL != *buf ) {
  241. (*buf)->buf_consumer_ruv = consumer_ruv;
  242. (*buf)->buf_local_ruv = local_ruv;
  243. }
  244. else {
  245. slapi_log_error ( SLAPI_LOG_FATAL, get_thread_private_agmtname(),
  246. "clcache_get_buffer: can't allocate new buffer\n" );
  247. rc = CL5_MEMORY_ERROR;
  248. }
  249. return rc;
  250. }
  251. /*
  252. * Returns a buffer back to the buffer pool.
  253. */
  254. void
  255. clcache_return_buffer ( CLC_Buffer **buf )
  256. {
  257. int i;
  258. slapi_log_error ( SLAPI_LOG_REPL, (*buf)->buf_agmt_name,
  259. "session end: state=%d load=%d sent=%d skipped=%d\n",
  260. (*buf)->buf_state,
  261. (*buf)->buf_load_cnt,
  262. (*buf)->buf_record_cnt - (*buf)->buf_record_skipped,
  263. (*buf)->buf_record_skipped );
  264. for ( i = 0; i < (*buf)->buf_num_cscbs; i++ ) {
  265. clcache_free_cscb ( &(*buf)->buf_cscbs[i] );
  266. }
  267. (*buf)->buf_num_cscbs = 0;
  268. if ( (*buf)->buf_cursor ) {
  269. (*buf)->buf_cursor->c_close ( (*buf)->buf_cursor );
  270. (*buf)->buf_cursor = NULL;
  271. }
  272. }
  273. /*
  274. * Loads a buffer from DB.
  275. *
  276. * anchorcsn - passed in for the first load of a replication session;
  277. * flag - DB_SET to load in the key CSN record.
  278. * DB_NEXT to load in the records greater than key CSN.
  279. * return - DB error code instead of cl5 one because of the
  280. * historic reason.
  281. */
  282. int
  283. clcache_load_buffer ( CLC_Buffer *buf, CSN *anchorcsn, int flag )
  284. {
  285. int rc = 0;
  286. clcache_refresh_local_maxcsns ( buf );
  287. /* Set the loading key */
  288. if ( anchorcsn ) {
  289. clcache_refresh_consumer_maxcsns ( buf );
  290. buf->buf_load_flag = DB_MULTIPLE_KEY;
  291. csn_as_string ( anchorcsn, 0, (char*)buf->buf_key.data );
  292. slapi_log_error ( SLAPI_LOG_REPL, buf->buf_agmt_name,
  293. "session start: anchorcsn=%s\n", (char*)buf->buf_key.data );
  294. }
  295. else if ( csn_get_time(buf->buf_current_csn) == 0 ) {
  296. /* time == 0 means this csn has never been set */
  297. rc = DB_NOTFOUND;
  298. }
  299. else if ( clcache_adjust_anchorcsn ( buf ) != 0 ) {
  300. rc = DB_NOTFOUND;
  301. }
  302. else {
  303. csn_as_string ( buf->buf_current_csn, 0, (char*)buf->buf_key.data );
  304. slapi_log_error ( SLAPI_LOG_REPL, buf->buf_agmt_name,
  305. "load next: anchorcsn=%s\n", (char*)buf->buf_key.data );
  306. }
  307. if ( rc == 0 ) {
  308. buf->buf_state = CLC_STATE_READY;
  309. rc = clcache_load_buffer_bulk ( buf, flag );
  310. /* Reset some flag variables */
  311. if ( rc == 0 ) {
  312. int i;
  313. for ( i = 0; i < buf->buf_num_cscbs; i++ ) {
  314. buf->buf_cscbs[i]->state = CLC_STATE_READY;
  315. }
  316. }
  317. else if ( anchorcsn ) {
  318. /* Report error only when the missing is persistent */
  319. if ( buf->buf_missing_csn && csn_compare (buf->buf_missing_csn, anchorcsn) == 0 ) {
  320. slapi_log_error ( SLAPI_LOG_FATAL, buf->buf_agmt_name,
  321. "Can't locate CSN %s in the changelog (DB rc=%d). The consumer may need to be reinitialized.\n",
  322. (char*)buf->buf_key.data, rc );
  323. }
  324. else {
  325. csn_dup_or_init_by_csn (&buf->buf_missing_csn, anchorcsn);
  326. }
  327. }
  328. }
  329. if ( rc != 0 ) {
  330. slapi_log_error ( SLAPI_LOG_REPL, buf->buf_agmt_name,
  331. "clcache_load_buffer: rc=%d\n", rc );
  332. }
  333. return rc;
  334. }
  335. static int
  336. clcache_load_buffer_bulk ( CLC_Buffer *buf, int flag )
  337. {
  338. DB_TXN *txn = NULL;
  339. DBC *cursor = NULL;
  340. int rc = 0;
  341. #if 0 /* txn control seems not improving anything so turn it off */
  342. if ( *(_pool->pl_dbenv) ) {
  343. txn_begin( *(_pool->pl_dbenv), NULL, &txn, 0 );
  344. }
  345. #endif
  346. if (NULL == buf) {
  347. slapi_log_error ( SLAPI_LOG_FATAL, "clcache_load_buffer_bulk",
  348. "NULL buf\n" );
  349. return rc;
  350. }
  351. if (NULL == buf->buf_busy_list) {
  352. slapi_log_error ( SLAPI_LOG_FATAL, "clcache_load_buffer_bulk",
  353. "%s%sno buf_busy_list\n",
  354. buf->buf_agmt_name?buf->buf_agmt_name:"",
  355. buf->buf_agmt_name?": ":"" );
  356. return rc;
  357. }
  358. PR_Lock ( buf->buf_busy_list->bl_lock );
  359. if ( 0 == ( rc = clcache_open_cursor ( txn, buf, &cursor )) ) {
  360. if ( flag == DB_NEXT ) {
  361. /* For bulk read, position the cursor before read the next block */
  362. rc = cursor->c_get ( cursor,
  363. & buf->buf_key,
  364. & buf->buf_data,
  365. DB_SET );
  366. }
  367. /*
  368. * Continue if the error is no-mem since we don't need to
  369. * load in the key record anyway with DB_SET.
  370. */
  371. if ( 0 == rc || DB_BUFFER_SMALL == rc )
  372. rc = clcache_cursor_get ( cursor, buf, flag );
  373. }
  374. /*
  375. * Don't keep a cursor open across the whole replication session.
  376. * That had caused noticable DB resource contention.
  377. */
  378. if ( cursor ) {
  379. cursor->c_close ( cursor );
  380. }
  381. #if 0 /* txn control seems not improving anything so turn it off */
  382. if ( txn ) {
  383. txn->commit ( txn, DB_TXN_NOSYNC );
  384. }
  385. #endif
  386. PR_Unlock ( buf->buf_busy_list->bl_lock );
  387. buf->buf_record_ptr = NULL;
  388. if ( 0 == rc ) {
  389. DB_MULTIPLE_INIT ( buf->buf_record_ptr, &buf->buf_data );
  390. if ( NULL == buf->buf_record_ptr )
  391. rc = DB_NOTFOUND;
  392. else
  393. buf->buf_load_cnt++;
  394. }
  395. return rc;
  396. }
  397. /*
  398. * Gets the next change from the buffer.
  399. * *key : output - key of the next change, or NULL if no more change
  400. * *data: output - data of the next change, or NULL if no more change
  401. */
  402. int
  403. clcache_get_next_change ( CLC_Buffer *buf, void **key, size_t *keylen, void **data, size_t *datalen, CSN **csn )
  404. {
  405. int skip = 1;
  406. int rc = 0;
  407. do {
  408. *key = *data = NULL;
  409. *keylen = *datalen = 0;
  410. if ( buf->buf_record_ptr ) {
  411. DB_MULTIPLE_KEY_NEXT ( buf->buf_record_ptr, &buf->buf_data,
  412. *key, *keylen, *data, *datalen );
  413. }
  414. /*
  415. * We're done with the current buffer. Now load the next chunk.
  416. */
  417. if ( NULL == *key && CLC_STATE_READY == buf->buf_state ) {
  418. rc = clcache_load_buffer ( buf, NULL, DB_NEXT );
  419. if ( 0 == rc && buf->buf_record_ptr ) {
  420. DB_MULTIPLE_KEY_NEXT ( buf->buf_record_ptr, &buf->buf_data,
  421. *key, *keylen, *data, *datalen );
  422. }
  423. }
  424. /* Compare the new change to the local and remote RUVs */
  425. if ( NULL != *key ) {
  426. buf->buf_record_cnt++;
  427. csn_init_by_string ( buf->buf_current_csn, (char*)*key );
  428. skip = clcache_skip_change ( buf );
  429. if (skip) buf->buf_record_skipped++;
  430. }
  431. }
  432. while ( rc == 0 && *key && skip );
  433. if ( NULL == *key ) {
  434. *key = NULL;
  435. *csn = NULL;
  436. rc = DB_NOTFOUND;
  437. }
  438. else {
  439. *csn = buf->buf_current_csn;
  440. slapi_log_error ( SLAPI_LOG_REPL, buf->buf_agmt_name,
  441. "load=%d rec=%d csn=%s\n",
  442. buf->buf_load_cnt, buf->buf_record_cnt, (char*)*key );
  443. }
  444. return rc;
  445. }
  446. static void
  447. clcache_refresh_consumer_maxcsns ( CLC_Buffer *buf )
  448. {
  449. int i;
  450. for ( i = 0; i < buf->buf_num_cscbs; i++ ) {
  451. csn_free(&buf->buf_cscbs[i]->consumer_maxcsn);
  452. ruv_get_largest_csn_for_replica (
  453. buf->buf_consumer_ruv,
  454. buf->buf_cscbs[i]->rid,
  455. &buf->buf_cscbs[i]->consumer_maxcsn );
  456. }
  457. }
  458. static int
  459. clcache_refresh_local_maxcsn ( const ruv_enum_data *rid_data, void *data )
  460. {
  461. CLC_Buffer *buf = (CLC_Buffer*) data;
  462. ReplicaId rid;
  463. int rc = 0;
  464. int i;
  465. rid = csn_get_replicaid ( rid_data->csn );
  466. /*
  467. * No need to create cscb for consumer's RID.
  468. * If RID==65535, the CSN is originated from a
  469. * legacy consumer. In this case the supplier
  470. * and the consumer may have the same RID.
  471. */
  472. if ( rid == buf->buf_consumer_rid && rid != MAX_REPLICA_ID )
  473. return rc;
  474. for ( i = 0; i < buf->buf_num_cscbs; i++ ) {
  475. if ( buf->buf_cscbs[i]->rid == rid )
  476. break;
  477. }
  478. if ( i >= buf->buf_num_cscbs ) {
  479. buf->buf_cscbs[i] = clcache_new_cscb ();
  480. if ( buf->buf_cscbs[i] == NULL ) {
  481. return -1;
  482. }
  483. buf->buf_cscbs[i]->rid = rid;
  484. buf->buf_num_cscbs++;
  485. }
  486. csn_dup_or_init_by_csn ( &buf->buf_cscbs[i]->local_maxcsn, rid_data->csn );
  487. if ( buf->buf_cscbs[i]->consumer_maxcsn &&
  488. csn_compare (buf->buf_cscbs[i]->consumer_maxcsn, rid_data->csn) >= 0 ) {
  489. /* No change need to be sent for this RID */
  490. buf->buf_cscbs[i]->state = CLC_STATE_UP_TO_DATE;
  491. }
  492. return rc;
  493. }
  494. static int
  495. clcache_refresh_local_maxcsns ( CLC_Buffer *buf )
  496. {
  497. int i;
  498. for ( i = 0; i < buf->buf_num_cscbs; i++ ) {
  499. csn_dup_or_init_by_csn ( &buf->buf_cscbs[i]->prev_local_maxcsn,
  500. buf->buf_cscbs[i]->local_maxcsn );
  501. }
  502. return ruv_enumerate_elements ( buf->buf_local_ruv, clcache_refresh_local_maxcsn, buf );
  503. }
  504. /*
  505. * Algorithm:
  506. *
  507. * 1. Snapshot local RUVs;
  508. * 2. Load buffer;
  509. * 3. Send to the consumer only those CSNs that are covered
  510. * by the RUVs snapshot taken in the first step;
  511. * All CSNs that are covered by the RUVs snapshot taken in the
  512. * first step are guaranteed in consecutive order for the respected
  513. * RIDs because of the the CSN pending list control;
  514. * A CSN that is not covered by the RUVs snapshot may be out of order
  515. * since it is possible that a smaller CSN might not have committed
  516. * yet by the time the buffer was loaded.
  517. * 4. Determine anchorcsn for each RID:
  518. *
  519. * Case| Local vs. Buffer | New Local | Next
  520. * | MaxCSN MaxCSN | MaxCSN | Anchor-CSN
  521. * ----+-------------------+-----------+----------------
  522. * 1 | Cl >= Cb | * | Cb
  523. * 2 | Cl < Cb | Cl | Cb
  524. * 3 | Cl < Cb | Cl2 | Cl
  525. *
  526. * 5. Determine anchorcsn for next load:
  527. * Anchor-CSN = min { all Next-Anchor-CSN, Buffer-MaxCSN }
  528. */
  529. static int
  530. clcache_adjust_anchorcsn ( CLC_Buffer *buf )
  531. {
  532. PRBool hasChange = PR_FALSE;
  533. struct csn_seq_ctrl_block *cscb;
  534. int i;
  535. if ( buf->buf_state == CLC_STATE_READY ) {
  536. for ( i = 0; i < buf->buf_num_cscbs; i++ ) {
  537. cscb = buf->buf_cscbs[i];
  538. if ( cscb->state == CLC_STATE_UP_TO_DATE )
  539. continue;
  540. /*
  541. * Case 3 unsafe ruv change: next buffer load should start
  542. * from where the maxcsn in the old ruv was. Since each
  543. * cscb has remembered the maxcsn sent to the consumer,
  544. * CSNs that may be loaded again could easily be skipped.
  545. */
  546. if ( cscb->prev_local_maxcsn &&
  547. csn_compare (cscb->prev_local_maxcsn, buf->buf_current_csn) < 0 &&
  548. csn_compare (cscb->local_maxcsn, cscb->prev_local_maxcsn) != 0 ) {
  549. hasChange = PR_TRUE;
  550. cscb->state = CLC_STATE_READY;
  551. csn_init_by_csn ( buf->buf_current_csn, cscb->prev_local_maxcsn );
  552. csn_as_string ( cscb->prev_local_maxcsn, 0, (char*)buf->buf_key.data );
  553. slapi_log_error ( SLAPI_LOG_REPL, buf->buf_agmt_name,
  554. "adjust anchor csn upon %s\n",
  555. ( cscb->state == CLC_STATE_CSN_GT_RUV ? "out of sequence csn" : "unsafe ruv change") );
  556. continue;
  557. }
  558. /*
  559. * check if there are still changes to send for this RID
  560. * Assume we had compared the local maxcsn and the consumer
  561. * max csn before this function was called and hence the
  562. * cscb->state had been set accordingly.
  563. */
  564. if ( hasChange == PR_FALSE &&
  565. csn_compare (cscb->local_maxcsn, buf->buf_current_csn) > 0 ) {
  566. hasChange = PR_TRUE;
  567. }
  568. }
  569. }
  570. if ( !hasChange ) {
  571. buf->buf_state = CLC_STATE_DONE;
  572. }
  573. return buf->buf_state;
  574. }
  575. static int
  576. clcache_skip_change ( CLC_Buffer *buf )
  577. {
  578. struct csn_seq_ctrl_block *cscb = NULL;
  579. ReplicaId rid;
  580. int skip = 1;
  581. int i;
  582. do {
  583. rid = csn_get_replicaid ( buf->buf_current_csn );
  584. /*
  585. * Skip CSN that is originated from the consumer.
  586. * If RID==65535, the CSN is originated from a
  587. * legacy consumer. In this case the supplier
  588. * and the consumer may have the same RID.
  589. */
  590. if (rid == buf->buf_consumer_rid && rid != MAX_REPLICA_ID)
  591. break;
  592. /* Skip helper entry (ENTRY_COUNT, PURGE_RUV and so on) */
  593. if ( cl5HelperEntry ( NULL, buf->buf_current_csn ) == PR_TRUE ) {
  594. slapi_log_error ( SLAPI_LOG_REPL, buf->buf_agmt_name,
  595. "Skip helper entry type=%ld\n", csn_get_time( buf->buf_current_csn ));
  596. break;
  597. }
  598. /* Find csn sequence control block for the current rid */
  599. for (i = 0; i < buf->buf_num_cscbs && buf->buf_cscbs[i]->rid != rid; i++);
  600. /* Skip CSN whose RID is unknown to the local RUV snapshot */
  601. if ( i >= buf->buf_num_cscbs ) {
  602. buf->buf_state = CLC_STATE_NEW_RID;
  603. break;
  604. }
  605. cscb = buf->buf_cscbs[i];
  606. /* Skip if the consumer is already up-to-date for the RID */
  607. if ( cscb->state == CLC_STATE_UP_TO_DATE ) {
  608. break;
  609. }
  610. /* Skip CSN whose preceedents are not covered by local RUV snapshot */
  611. if ( cscb->state == CLC_STATE_CSN_GT_RUV ) {
  612. break;
  613. }
  614. /* Skip CSNs already covered by consumer RUV */
  615. if ( cscb->consumer_maxcsn &&
  616. csn_compare ( buf->buf_current_csn, cscb->consumer_maxcsn ) <= 0 ) {
  617. break;
  618. }
  619. /* Send CSNs that are covered by the local RUV snapshot */
  620. if ( csn_compare ( buf->buf_current_csn, cscb->local_maxcsn ) <= 0 ) {
  621. skip = 0;
  622. csn_dup_or_init_by_csn ( &cscb->consumer_maxcsn, buf->buf_current_csn );
  623. break;
  624. }
  625. /*
  626. * Promote the local maxcsn to its next neighbor
  627. * to keep the current session going. Skip if we
  628. * are not sure if current_csn is the neighbor.
  629. */
  630. if ( csn_time_difference(buf->buf_current_csn, cscb->local_maxcsn) == 0 &&
  631. (csn_get_seqnum(buf->buf_current_csn) ==
  632. csn_get_seqnum(cscb->local_maxcsn) + 1) ) {
  633. csn_init_by_csn ( cscb->local_maxcsn, buf->buf_current_csn );
  634. csn_init_by_csn ( cscb->consumer_maxcsn, buf->buf_current_csn );
  635. skip = 0;
  636. break;
  637. }
  638. /* Skip CSNs not covered by local RUV snapshot */
  639. cscb->state = CLC_STATE_CSN_GT_RUV;
  640. } while (0);
  641. #ifdef DEBUG
  642. if (skip && cscb) {
  643. char consumer[24] = {'\0'};
  644. char local[24] = {'\0'};
  645. char current[24] = {'\0'};
  646. if ( cscb->consumer_maxcsn )
  647. csn_as_string ( cscb->consumer_maxcsn, PR_FALSE, consumer );
  648. if ( cscb->local_maxcsn )
  649. csn_as_string ( cscb->local_maxcsn, PR_FALSE, local );
  650. csn_as_string ( buf->buf_current_csn, PR_FALSE, current );
  651. slapi_log_error ( SLAPI_LOG_REPL, buf->buf_agmt_name,
  652. "Skip %s consumer=%s local=%s\n", current, consumer, local );
  653. }
  654. #endif
  655. return skip;
  656. }
  657. static struct csn_seq_ctrl_block *
  658. clcache_new_cscb ()
  659. {
  660. struct csn_seq_ctrl_block *cscb;
  661. cscb = (struct csn_seq_ctrl_block *) slapi_ch_calloc ( 1, sizeof (struct csn_seq_ctrl_block) );
  662. if (cscb == NULL) {
  663. slapi_log_error ( SLAPI_LOG_FATAL, NULL, "clcache: malloc failure\n" );
  664. }
  665. return cscb;
  666. }
  667. static void
  668. clcache_free_cscb ( struct csn_seq_ctrl_block ** cscb )
  669. {
  670. csn_free ( & (*cscb)->consumer_maxcsn );
  671. csn_free ( & (*cscb)->local_maxcsn );
  672. csn_free ( & (*cscb)->prev_local_maxcsn );
  673. slapi_ch_free ( (void **) cscb );
  674. }
  675. /*
  676. * Allocate and initialize a new buffer
  677. * It is called when there is a request for a buffer while
  678. * buffer free list is empty.
  679. */
  680. static CLC_Buffer *
  681. clcache_new_buffer ( ReplicaId consumer_rid )
  682. {
  683. CLC_Buffer *buf = NULL;
  684. int welldone = 0;
  685. do {
  686. buf = (CLC_Buffer*) slapi_ch_calloc (1, sizeof(CLC_Buffer));
  687. if ( NULL == buf )
  688. break;
  689. buf->buf_key.flags = DB_DBT_USERMEM;
  690. buf->buf_key.ulen = CSN_STRSIZE + 1;
  691. buf->buf_key.size = CSN_STRSIZE;
  692. buf->buf_key.data = slapi_ch_calloc( 1, buf->buf_key.ulen );
  693. if ( NULL == buf->buf_key.data )
  694. break;
  695. buf->buf_data.flags = DB_DBT_USERMEM;
  696. buf->buf_data.ulen = _pool->pl_buffer_default_pages * DEFAULT_CLC_BUFFER_PAGE_SIZE;
  697. buf->buf_data.data = slapi_ch_malloc( buf->buf_data.ulen );
  698. if ( NULL == buf->buf_data.data )
  699. break;
  700. if ( NULL == ( buf->buf_current_csn = csn_new()) )
  701. break;
  702. buf->buf_state = CLC_STATE_READY;
  703. buf->buf_agmt_name = get_thread_private_agmtname();
  704. buf->buf_consumer_rid = consumer_rid;
  705. buf->buf_num_cscbs = 0;
  706. welldone = 1;
  707. } while (0);
  708. if ( !welldone ) {
  709. clcache_delete_buffer ( &buf );
  710. }
  711. return buf;
  712. }
  713. /*
  714. * Deallocates a buffer.
  715. * It is called when a buffer is returned to the buffer pool
  716. * and the pool size is over the limit.
  717. */
  718. static void
  719. clcache_delete_buffer ( CLC_Buffer **buf )
  720. {
  721. if ( buf && *buf ) {
  722. slapi_ch_free (&( (*buf)->buf_key.data ));
  723. slapi_ch_free (&( (*buf)->buf_data.data ));
  724. csn_free (&( (*buf)->buf_current_csn ));
  725. csn_free (&( (*buf)->buf_missing_csn ));
  726. slapi_ch_free ( (void **) buf );
  727. }
  728. }
  729. static CLC_Busy_List *
  730. clcache_new_busy_list ()
  731. {
  732. CLC_Busy_List *bl;
  733. int welldone = 0;
  734. do {
  735. if ( NULL == (bl = ( CLC_Busy_List* ) slapi_ch_calloc (1, sizeof(CLC_Busy_List)) ))
  736. break;
  737. if ( NULL == (bl->bl_lock = PR_NewLock ()) )
  738. break;
  739. /*
  740. if ( NULL == (bl->bl_max_csn = csn_new ()) )
  741. break;
  742. */
  743. welldone = 1;
  744. }
  745. while (0);
  746. if ( !welldone ) {
  747. clcache_delete_busy_list ( &bl );
  748. }
  749. return bl;
  750. }
  751. static void
  752. clcache_delete_busy_list ( CLC_Busy_List **bl )
  753. {
  754. if ( bl && *bl ) {
  755. CLC_Buffer *buf = NULL;
  756. if ( (*bl)->bl_lock ) {
  757. PR_Lock ( (*bl)->bl_lock );
  758. }
  759. buf = (*bl)->bl_buffers;
  760. while (buf) {
  761. CLC_Buffer *next = buf->buf_next;
  762. clcache_delete_buffer(&buf);
  763. buf = next;
  764. }
  765. (*bl)->bl_buffers = NULL;
  766. (*bl)->bl_db = NULL;
  767. if ( (*bl)->bl_lock ) {
  768. PR_Unlock ( (*bl)->bl_lock );
  769. PR_DestroyLock ( (*bl)->bl_lock );
  770. (*bl)->bl_lock = NULL;
  771. }
  772. /* csn_free (&( (*bl)->bl_max_csn )); */
  773. slapi_ch_free ( (void **) bl );
  774. }
  775. }
  776. static int
  777. clcache_enqueue_busy_list ( DB *db, CLC_Buffer *buf )
  778. {
  779. CLC_Busy_List *bl;
  780. int rc = 0;
  781. slapi_rwlock_rdlock ( _pool->pl_lock );
  782. for ( bl = _pool->pl_busy_lists; bl && bl->bl_db != db; bl = bl->bl_next );
  783. slapi_rwlock_unlock ( _pool->pl_lock );
  784. if ( NULL == bl ) {
  785. if ( NULL == ( bl = clcache_new_busy_list ()) ) {
  786. rc = CL5_MEMORY_ERROR;
  787. }
  788. else {
  789. slapi_rwlock_wrlock ( _pool->pl_lock );
  790. bl->bl_db = db;
  791. bl->bl_next = _pool->pl_busy_lists;
  792. _pool->pl_busy_lists = bl;
  793. slapi_rwlock_unlock ( _pool->pl_lock );
  794. }
  795. }
  796. if ( NULL != bl ) {
  797. PR_Lock ( bl->bl_lock );
  798. buf->buf_busy_list = bl;
  799. buf->buf_next = bl->bl_buffers;
  800. bl->bl_buffers = buf;
  801. PR_Unlock ( bl->bl_lock );
  802. }
  803. return rc;
  804. }
  805. static int
  806. clcache_open_cursor ( DB_TXN *txn, CLC_Buffer *buf, DBC **cursor )
  807. {
  808. int rc;
  809. rc = buf->buf_busy_list->bl_db->cursor ( buf->buf_busy_list->bl_db, txn, cursor, 0 );
  810. if ( rc != 0 ) {
  811. slapi_log_error ( SLAPI_LOG_FATAL, get_thread_private_agmtname(),
  812. "clcache: failed to open cursor; db error - %d %s\n",
  813. rc, db_strerror(rc));
  814. }
  815. return rc;
  816. }
  817. static int
  818. clcache_cursor_get ( DBC *cursor, CLC_Buffer *buf, int flag )
  819. {
  820. int rc;
  821. rc = cursor->c_get ( cursor,
  822. & buf->buf_key,
  823. & buf->buf_data,
  824. buf->buf_load_flag | flag );
  825. if ( DB_BUFFER_SMALL == rc ) {
  826. /*
  827. * The record takes more space than the current size of the
  828. * buffer. Fortunately, buf->buf_data.size has been set by
  829. * c_get() to the actual data size needed. So we can
  830. * reallocate the data buffer and try to read again.
  831. */
  832. buf->buf_data.ulen = ( buf->buf_data.size / DEFAULT_CLC_BUFFER_PAGE_SIZE + 1 ) * DEFAULT_CLC_BUFFER_PAGE_SIZE;
  833. buf->buf_data.data = slapi_ch_realloc ( buf->buf_data.data, buf->buf_data.ulen );
  834. if ( buf->buf_data.data != NULL ) {
  835. rc = cursor->c_get ( cursor,
  836. &( buf->buf_key ),
  837. &( buf->buf_data ),
  838. buf->buf_load_flag | flag );
  839. slapi_log_error ( SLAPI_LOG_REPL, buf->buf_agmt_name,
  840. "clcache: (%d | %d) buf key len %d reallocated and retry returns %d\n", buf->buf_load_flag, flag, buf->buf_key.size, rc );
  841. }
  842. }
  843. switch ( rc ) {
  844. case EINVAL:
  845. slapi_log_error ( SLAPI_LOG_FATAL, buf->buf_agmt_name,
  846. "clcache_cursor_get: invalid parameter\n" );
  847. break;
  848. case DB_BUFFER_SMALL:
  849. slapi_log_error ( SLAPI_LOG_FATAL, buf->buf_agmt_name,
  850. "clcache_cursor_get: can't allocate %u bytes\n", buf->buf_data.ulen );
  851. break;
  852. default:
  853. break;
  854. }
  855. return rc;
  856. }
  857. static void
  858. csn_dup_or_init_by_csn ( CSN **csn1, CSN *csn2 )
  859. {
  860. if ( *csn1 == NULL )
  861. *csn1 = csn_new();
  862. csn_init_by_csn ( *csn1, csn2 );
  863. }
  864. void
  865. clcache_destroy()
  866. {
  867. if (_pool) {
  868. CLC_Busy_List *bl = NULL;
  869. if (_pool->pl_lock) {
  870. slapi_rwlock_wrlock (_pool->pl_lock);
  871. }
  872. bl = _pool->pl_busy_lists;
  873. while (bl) {
  874. CLC_Busy_List *next = bl->bl_next;
  875. clcache_delete_busy_list(&bl);
  876. bl = next;
  877. }
  878. _pool->pl_busy_lists = NULL;
  879. _pool->pl_dbenv = NULL;
  880. if (_pool->pl_lock) {
  881. slapi_rwlock_unlock(_pool->pl_lock);
  882. slapi_destroy_rwlock(_pool->pl_lock);
  883. _pool->pl_lock = NULL;
  884. }
  885. slapi_ch_free ( (void **) &_pool );
  886. }
  887. }