repl5_ruv.c 60 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282
  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. * Copyright (C) 2010 Hewlett-Packard Development Company, L.P.
  37. * All rights reserved.
  38. * END COPYRIGHT BLOCK **/
  39. #ifdef HAVE_CONFIG_H
  40. # include <config.h>
  41. #endif
  42. /* repl5_ruv.c - implementation of replica update vector */
  43. /*
  44. * The replica update vector is stored in the nsds50ruv attribute. The LDIF
  45. * representation of the ruv is:
  46. * nsds50ruv: {replicageneration} <gen-id-for-this-replica>
  47. * nsds50ruv: {replica <rid>[ <url>]}[ <mincsn> <maxcsn>]
  48. * nsds50ruv: {replica <rid>[ <url>]}[ <mincsn> <maxcsn>]
  49. * ...
  50. * nsds50ruv: {replica <rid>[ <url>]}[ <mincsn> <maxcsn>]
  51. *
  52. * nsruvReplicaLastModified: {replica <rid>[ <url>]} lastModifiedTime
  53. * nsruvReplicaLastModified: {replica <rid>[ <url>]} lastModifiedTime
  54. * ...
  55. *
  56. * For readability, ruv_dump appends nsruvReplicaLastModified to nsds50ruv:
  57. * nsds50ruv: {replica <rid>[ <url>]}[ <mincsn> <maxcsn> [<lastModifiedTime>]]
  58. */
  59. #include <string.h>
  60. #include <ctype.h> /* For isdigit() */
  61. #include "csnpl.h"
  62. #include "repl5_ruv.h"
  63. #include "repl_shared.h"
  64. #include "repl5.h"
  65. #define RIDSTR_SIZE 16 /* string large enough to hold replicaid*/
  66. #define RUVSTR_SIZE 256 /* string large enough to hold ruv and lastmodifiedtime */
  67. /* Data Structures */
  68. /* replica */
  69. typedef struct ruvElement
  70. {
  71. ReplicaId rid; /* replica id for this element */
  72. CSN *csn; /* largest csn that we know about that originated at the master */
  73. CSN *min_csn; /* smallest csn that originated at the master */
  74. char *replica_purl; /* Partial URL for replica */
  75. CSNPL *csnpl; /* list of operations in progress */
  76. time_t last_modified; /* timestamp the modification of csn */
  77. } RUVElement;
  78. /* replica update vector */
  79. struct _ruv
  80. {
  81. char *replGen; /* replicated area generation: identifies replica
  82. in space and in time */
  83. DataList *elements; /* replicas */
  84. Slapi_RWLock *lock; /* concurrency control */
  85. };
  86. /* forward declarations */
  87. static int ruvInit (RUV **ruv, int initCount);
  88. static void ruvFreeReplica (void **data);
  89. static RUVElement* ruvGetReplica (const RUV *ruv, ReplicaId rid);
  90. static RUVElement* ruvAddReplica (RUV *ruv, const CSN *csn, const char *replica_purl);
  91. static RUVElement* ruvAddReplicaNoCSN (RUV *ruv, ReplicaId rid, const char *replica_purl);
  92. static RUVElement* ruvAddIndexReplicaNoCSN (RUV *ruv, ReplicaId rid, const char *replica_purl, int index);
  93. static int ruvReplicaCompare (const void *el1, const void *el2);
  94. static RUVElement *get_ruvelement_from_berval(const struct berval *bval);
  95. static char *get_replgen_from_berval(const struct berval *bval);
  96. static const char * const prefix_replicageneration = "{replicageneration}";
  97. static const char * const prefix_ruvcsn = "{replica "; /* intentionally missing '}' */
  98. /* API implementation */
  99. /*
  100. * Allocate a new ruv and set its replica generation to the given generation.
  101. */
  102. int
  103. ruv_init_new(const char *replGen, ReplicaId rid, const char *purl, RUV **ruv)
  104. {
  105. int rc;
  106. RUVElement *replica;
  107. if (ruv == NULL || replGen == NULL)
  108. {
  109. slapi_log_error(SLAPI_LOG_REPL, repl_plugin_name, "ruv_init_new: NULL argument\n");
  110. return RUV_BAD_DATA;
  111. }
  112. rc = ruvInit (ruv, 0);
  113. if (rc != RUV_SUCCESS)
  114. return rc;
  115. (*ruv)->replGen = slapi_ch_strdup (replGen);
  116. /* we want to add the local writable replica to the RUV before any csns are created */
  117. /* this is so that it can be referred to even before it accepted any changes */
  118. if (purl)
  119. {
  120. replica = ruvAddReplicaNoCSN (*ruv, rid, purl);
  121. if (replica == NULL)
  122. return RUV_MEMORY_ERROR;
  123. }
  124. return RUV_SUCCESS;
  125. }
  126. int ruv_private_new(RUV **ruv, RUV *clone )
  127. {
  128. int rc;
  129. rc = ruvInit (ruv, dl_get_count(clone->elements) );
  130. if (rc != RUV_SUCCESS)
  131. return rc;
  132. (*ruv)->replGen = slapi_ch_strdup (clone->replGen);
  133. return RUV_SUCCESS;
  134. }
  135. /*
  136. * Create a new RUV and initialize its contents from the provided Slapi_Attr.
  137. * Returns:
  138. * RUV_BAD_DATA if the values in the attribute were malformed.
  139. * RUV_SUCCESS if all went well
  140. */
  141. int
  142. ruv_init_from_slapi_attr(Slapi_Attr *attr, RUV **ruv)
  143. {
  144. ReplicaId dummy = 0;
  145. return (ruv_init_from_slapi_attr_and_check_purl(attr, ruv, &dummy));
  146. }
  147. /*
  148. * Create a new RUV and initialize its contents from the provided Slapi_Attr.
  149. * Returns:
  150. * RUV_BAD_DATA if the values in the attribute were malformed.
  151. * RUV_SUCCESS if all went well
  152. * contain_purl is 0 if the ruv doesn't contain the local purl
  153. * contain_purl is != 0 if the ruv contains the local purl (contains the rid)
  154. */
  155. int
  156. ruv_init_from_slapi_attr_and_check_purl(Slapi_Attr *attr, RUV **ruv, ReplicaId *contain_purl)
  157. {
  158. int return_value;
  159. PR_ASSERT(NULL != attr && NULL != ruv);
  160. if (NULL == ruv || NULL == attr)
  161. {
  162. slapi_log_error(SLAPI_LOG_REPL, repl_plugin_name,
  163. "ruv_init_from_slapi_attr: NULL argument\n");
  164. return_value = RUV_BAD_DATA;
  165. }
  166. else
  167. {
  168. int rc;
  169. int numvalues;
  170. slapi_attr_get_numvalues(attr, &numvalues);
  171. if ((rc = ruvInit(ruv, numvalues)) != RUV_SUCCESS)
  172. {
  173. return_value = rc;
  174. }
  175. else
  176. {
  177. int hint;
  178. Slapi_Value *value;
  179. const struct berval *bval;
  180. const char *purl = NULL;
  181. return_value = RUV_SUCCESS;
  182. purl = multimaster_get_local_purl();
  183. *contain_purl = 0;
  184. for (hint = slapi_attr_first_value(attr, &value);
  185. hint != -1; hint = slapi_attr_next_value(attr, hint, &value))
  186. {
  187. bval = slapi_value_get_berval(value);
  188. if (NULL != bval && NULL != bval->bv_val)
  189. {
  190. if (strncmp(bval->bv_val, prefix_replicageneration, strlen(prefix_replicageneration)) == 0) {
  191. if (NULL == (*ruv)->replGen)
  192. {
  193. (*ruv)->replGen = get_replgen_from_berval(bval);
  194. } else {
  195. /* Twice replicageneration is wrong, just log and ignore */
  196. slapi_log_error(SLAPI_LOG_REPL, repl_plugin_name,
  197. "ruv_init_from_slapi_attr: %s is present more than once\n",
  198. prefix_replicageneration);
  199. }
  200. }
  201. else
  202. {
  203. RUVElement *ruve = get_ruvelement_from_berval(bval);
  204. if (NULL != ruve)
  205. {
  206. /* Is the local purl already in the ruv ? */
  207. if ( (*contain_purl==0) && ruve->replica_purl && purl && (strncmp(ruve->replica_purl, purl, strlen(purl))==0) )
  208. {
  209. *contain_purl = ruve->rid;
  210. }
  211. dl_add ((*ruv)->elements, ruve);
  212. }
  213. }
  214. }
  215. }
  216. }
  217. }
  218. return return_value;
  219. }
  220. /*
  221. * Same as ruv_init_from_slapi_attr, but takes an array of pointers to bervals.
  222. * I wish this wasn't a cut-n-paste of the above function, but I don't see a
  223. * clean way to define one API in terms of the other.
  224. */
  225. int
  226. ruv_init_from_bervals(struct berval **vals, RUV **ruv)
  227. {
  228. int return_value;
  229. PR_ASSERT(NULL != vals && NULL != ruv);
  230. if (NULL == ruv || NULL == vals)
  231. {
  232. slapi_log_error(SLAPI_LOG_REPL, repl_plugin_name,
  233. "ruv_init_from_slapi_value: NULL argument\n");
  234. return_value = RUV_BAD_DATA;
  235. }
  236. else
  237. {
  238. int i, rc;
  239. i = 0;
  240. while (vals[i] != NULL)
  241. {
  242. i++;
  243. }
  244. if ((rc = ruvInit (ruv, i)) != RUV_SUCCESS)
  245. {
  246. return_value = rc;
  247. }
  248. else
  249. {
  250. return_value = RUV_SUCCESS;
  251. for (i = 0; NULL != vals[i]; i++)
  252. {
  253. if (NULL != vals[i]->bv_val)
  254. {
  255. if (strncmp(vals[i]->bv_val, prefix_replicageneration, strlen(prefix_replicageneration)) == 0) {
  256. if (NULL == (*ruv)->replGen)
  257. {
  258. (*ruv)->replGen = get_replgen_from_berval(vals[i]);
  259. } else {
  260. /* Twice replicageneration is wrong, just log and ignore */
  261. slapi_log_error(SLAPI_LOG_REPL, repl_plugin_name,
  262. "ruv_init_from_slapi_value: %s is present more than once\n",
  263. prefix_replicageneration);
  264. }
  265. }
  266. else
  267. {
  268. RUVElement *ruve = get_ruvelement_from_berval(vals[i]);
  269. if (NULL != ruve)
  270. {
  271. dl_add ((*ruv)->elements, ruve);
  272. }
  273. }
  274. }
  275. }
  276. }
  277. }
  278. return return_value;
  279. }
  280. RUV*
  281. ruv_dup (const RUV *ruv)
  282. {
  283. int rc;
  284. RUVElement *replica, *dupReplica;
  285. int cookie;
  286. RUV *dupRUV = NULL;
  287. if (ruv == NULL)
  288. return NULL;
  289. slapi_rwlock_rdlock (ruv->lock);
  290. rc = ruvInit (&dupRUV, dl_get_count (ruv->elements));
  291. if (rc != RUV_SUCCESS || dupRUV == NULL)
  292. goto done;
  293. dupRUV->replGen = slapi_ch_strdup (ruv->replGen);
  294. for (replica = dl_get_first (ruv->elements, &cookie); replica;
  295. replica = dl_get_next (ruv->elements, &cookie))
  296. {
  297. dupReplica = (RUVElement *)slapi_ch_calloc (1, sizeof (*dupReplica));
  298. dupReplica->rid = replica->rid;
  299. if (replica->csn)
  300. dupReplica->csn = csn_dup (replica->csn);
  301. if (replica->min_csn)
  302. dupReplica->min_csn = csn_dup (replica->min_csn);
  303. if (replica->replica_purl)
  304. dupReplica->replica_purl = slapi_ch_strdup (replica->replica_purl);
  305. dupReplica->last_modified = replica->last_modified;
  306. /* ONREPL - we don't make copy of the pernding list. For now
  307. we don't need it. */
  308. dl_add (dupRUV->elements, dupReplica);
  309. }
  310. done:
  311. slapi_rwlock_unlock (ruv->lock);
  312. return dupRUV;
  313. }
  314. void
  315. ruv_destroy (RUV **ruv)
  316. {
  317. if (ruv != NULL && *ruv != NULL)
  318. {
  319. if ((*ruv)->elements)
  320. {
  321. dl_cleanup ((*ruv)->elements, ruvFreeReplica);
  322. dl_free (&(*ruv)->elements);
  323. }
  324. /* slapi_ch_free accepts NULL pointer */
  325. slapi_ch_free ((void **)&((*ruv)->replGen));
  326. if ((*ruv)->lock)
  327. {
  328. slapi_destroy_rwlock ((*ruv)->lock);
  329. }
  330. slapi_ch_free ((void**)ruv);
  331. }
  332. }
  333. /*
  334. * [610948]
  335. * copy elements in srcruv to destruv
  336. * destruv is the live wrapper, which could be referred by other threads.
  337. * srcruv is cleaned up after copied.
  338. */
  339. void
  340. ruv_copy_and_destroy (RUV **srcruv, RUV **destruv)
  341. {
  342. DataList *elemp = NULL;
  343. char *replgp = NULL;
  344. if (NULL == srcruv || NULL == *srcruv || NULL == destruv)
  345. {
  346. return;
  347. }
  348. if (NULL == *destruv)
  349. {
  350. *destruv = *srcruv;
  351. *srcruv = NULL;
  352. }
  353. else
  354. {
  355. slapi_rwlock_wrlock((*destruv)->lock);
  356. elemp = (*destruv)->elements;
  357. (*destruv)->elements = (*srcruv)->elements;
  358. if (elemp)
  359. {
  360. dl_cleanup (elemp, ruvFreeReplica);
  361. dl_free (&elemp);
  362. }
  363. /* slapi_ch_free accepts NULL pointer */
  364. replgp = (*destruv)->replGen;
  365. (*destruv)->replGen = (*srcruv)->replGen;
  366. slapi_ch_free ((void **)&replgp);
  367. if ((*srcruv)->lock)
  368. {
  369. slapi_destroy_rwlock ((*srcruv)->lock);
  370. }
  371. slapi_ch_free ((void**)srcruv);
  372. slapi_rwlock_unlock((*destruv)->lock);
  373. }
  374. PR_ASSERT (*destruv != NULL && *srcruv == NULL);
  375. }
  376. int
  377. ruv_delete_replica (RUV *ruv, ReplicaId rid)
  378. {
  379. int return_value;
  380. if (ruv == NULL)
  381. {
  382. slapi_log_error(SLAPI_LOG_REPL, repl_plugin_name, "ruv_delete_replica: NULL argument\n");
  383. return_value = RUV_BAD_DATA;
  384. }
  385. else
  386. {
  387. /* check for duplicates */
  388. slapi_rwlock_wrlock (ruv->lock);
  389. dl_delete (ruv->elements, (const void*)&rid, ruvReplicaCompare, ruvFreeReplica);
  390. slapi_rwlock_unlock (ruv->lock);
  391. return_value = RUV_SUCCESS;
  392. }
  393. return return_value;
  394. }
  395. int
  396. ruv_add_replica (RUV *ruv, ReplicaId rid, const char *replica_purl)
  397. {
  398. RUVElement* replica;
  399. PR_ASSERT (ruv && replica_purl);
  400. slapi_rwlock_wrlock (ruv->lock);
  401. replica = ruvGetReplica (ruv, rid);
  402. if (replica == NULL)
  403. {
  404. replica = ruvAddReplicaNoCSN (ruv, rid, replica_purl);
  405. }
  406. slapi_rwlock_unlock (ruv->lock);
  407. if (replica)
  408. return RUV_SUCCESS;
  409. else
  410. return RUV_MEMORY_ERROR;
  411. }
  412. int
  413. ruv_replace_replica_purl (RUV *ruv, ReplicaId rid, const char *replica_purl)
  414. {
  415. RUVElement* replica;
  416. int rc = RUV_NOTFOUND;
  417. PR_ASSERT (ruv && replica_purl);
  418. slapi_rwlock_wrlock (ruv->lock);
  419. replica = ruvGetReplica (ruv, rid);
  420. if (replica != NULL)
  421. {
  422. if (strcmp(replica->replica_purl, replica_purl)) { /* purl updated */
  423. /* Replace replica_purl in RUV since supplier has been updated. */
  424. slapi_ch_free((void **)&(replica->replica_purl));
  425. replica->replica_purl = slapi_ch_strdup(replica_purl);
  426. /* Also, reset csn and min_csn. */
  427. replica->csn = replica->min_csn = NULL;
  428. }
  429. rc = RUV_SUCCESS;
  430. }
  431. slapi_rwlock_unlock (ruv->lock);
  432. return rc;
  433. }
  434. int
  435. ruv_add_index_replica (RUV *ruv, ReplicaId rid, const char *replica_purl, int index)
  436. {
  437. RUVElement* replica;
  438. PR_ASSERT (ruv && replica_purl);
  439. slapi_rwlock_wrlock (ruv->lock);
  440. replica = ruvGetReplica (ruv, rid);
  441. if (replica == NULL)
  442. {
  443. replica = ruvAddIndexReplicaNoCSN (ruv, rid, replica_purl, index);
  444. }
  445. slapi_rwlock_unlock (ruv->lock);
  446. if (replica)
  447. return RUV_SUCCESS;
  448. else
  449. return RUV_MEMORY_ERROR;
  450. }
  451. PRBool
  452. ruv_contains_replica (const RUV *ruv, ReplicaId rid)
  453. {
  454. RUVElement *replica;
  455. if (ruv == NULL)
  456. return PR_FALSE;
  457. slapi_rwlock_rdlock (ruv->lock);
  458. replica = ruvGetReplica (ruv, rid);
  459. slapi_rwlock_unlock (ruv->lock);
  460. return replica != NULL;
  461. }
  462. #define GET_LARGEST_CSN 231
  463. #define GET_SMALLEST_CSN 232
  464. static int
  465. get_csn_internal(const RUV *ruv, ReplicaId rid, CSN **csn, int whichone)
  466. {
  467. RUVElement *replica;
  468. int return_value = RUV_SUCCESS;
  469. if (ruv == NULL || csn == NULL)
  470. {
  471. slapi_log_error(SLAPI_LOG_REPL, repl_plugin_name, "ruv_get_largest_csn_for_replica: NULL argument\n");
  472. return_value = RUV_BAD_DATA;
  473. }
  474. else
  475. {
  476. *csn = NULL;
  477. /* prevent element from being destroyed while we get its data */
  478. slapi_rwlock_rdlock (ruv->lock);
  479. replica = ruvGetReplica (ruv, rid);
  480. /* replica without min csn is treated as a non-existent replica */
  481. if (replica == NULL || replica->min_csn == NULL)
  482. {
  483. return_value = RUV_NOTFOUND;
  484. }
  485. else
  486. {
  487. switch (whichone)
  488. {
  489. case GET_LARGEST_CSN:
  490. *csn = replica->csn ? csn_dup (replica->csn) : NULL;
  491. break;
  492. case GET_SMALLEST_CSN:
  493. *csn = replica->min_csn ? csn_dup (replica->min_csn) : NULL;
  494. break;
  495. default:
  496. *csn = NULL;
  497. }
  498. }
  499. slapi_rwlock_unlock (ruv->lock);
  500. }
  501. return return_value;
  502. }
  503. int
  504. ruv_get_largest_csn_for_replica(const RUV *ruv, ReplicaId rid, CSN **csn)
  505. {
  506. return get_csn_internal(ruv, rid, csn, GET_LARGEST_CSN);
  507. }
  508. int
  509. ruv_get_smallest_csn_for_replica(const RUV *ruv, ReplicaId rid, CSN **csn)
  510. {
  511. return get_csn_internal(ruv, rid, csn, GET_SMALLEST_CSN);
  512. }
  513. const char *
  514. ruv_get_purl_for_replica(const RUV *ruv, ReplicaId rid)
  515. {
  516. RUVElement *replica;
  517. const char *return_value = NULL;
  518. slapi_rwlock_rdlock (ruv->lock);
  519. replica = ruvGetReplica (ruv, rid);
  520. if (replica != NULL)
  521. {
  522. return_value = replica->replica_purl;
  523. }
  524. slapi_rwlock_unlock (ruv->lock);
  525. return return_value;
  526. }
  527. static int
  528. set_min_csn_nolock(RUV *ruv, const CSN *min_csn, const char *replica_purl)
  529. {
  530. int return_value;
  531. ReplicaId rid = csn_get_replicaid (min_csn);
  532. RUVElement *replica = ruvGetReplica (ruv, rid);
  533. if (NULL == replica)
  534. {
  535. replica = ruvAddReplica (ruv, min_csn, replica_purl);
  536. if (replica)
  537. return_value = RUV_SUCCESS;
  538. else
  539. return_value = RUV_MEMORY_ERROR;
  540. }
  541. else
  542. {
  543. if (replica->min_csn == NULL || csn_compare (min_csn, replica->min_csn) < 0)
  544. {
  545. csn_free(&replica->min_csn);
  546. replica->min_csn = csn_dup(min_csn);
  547. }
  548. return_value = RUV_SUCCESS;
  549. }
  550. return return_value;
  551. }
  552. static int
  553. set_max_csn_nolock(RUV *ruv, const CSN *max_csn, const char *replica_purl)
  554. {
  555. int return_value;
  556. ReplicaId rid = csn_get_replicaid (max_csn);
  557. RUVElement *replica = ruvGetReplica (ruv, rid);
  558. if (NULL == replica)
  559. {
  560. replica = ruvAddReplica (ruv, max_csn, replica_purl);
  561. if (replica)
  562. return_value = RUV_SUCCESS;
  563. else
  564. return_value = RUV_MEMORY_ERROR;
  565. }
  566. else
  567. {
  568. if (replica_purl && replica->replica_purl == NULL)
  569. replica->replica_purl = slapi_ch_strdup (replica_purl);
  570. csn_free(&replica->csn);
  571. replica->csn = csn_dup(max_csn);
  572. replica->last_modified = current_time();
  573. return_value = RUV_SUCCESS;
  574. }
  575. return return_value;
  576. }
  577. int
  578. ruv_set_min_csn(RUV *ruv, const CSN *min_csn, const char *replica_purl)
  579. {
  580. int return_value;
  581. slapi_rwlock_wrlock (ruv->lock);
  582. return_value = set_min_csn_nolock(ruv, min_csn, replica_purl);
  583. slapi_rwlock_unlock (ruv->lock);
  584. return return_value;
  585. }
  586. int
  587. ruv_set_max_csn(RUV *ruv, const CSN *max_csn, const char *replica_purl)
  588. {
  589. int return_value;
  590. slapi_rwlock_wrlock (ruv->lock);
  591. return_value = set_max_csn_nolock(ruv, max_csn, replica_purl);
  592. slapi_rwlock_unlock (ruv->lock);
  593. return return_value;
  594. }
  595. int
  596. ruv_set_csns(RUV *ruv, const CSN *csn, const char *replica_purl)
  597. {
  598. RUVElement *replica;
  599. ReplicaId rid;
  600. int return_value;
  601. if (ruv == NULL || csn == NULL)
  602. {
  603. slapi_log_error(SLAPI_LOG_REPL, repl_plugin_name, "ruv_set_csns: NULL argument\n");
  604. return_value = RUV_BAD_DATA;
  605. }
  606. else
  607. {
  608. rid = csn_get_replicaid (csn);
  609. /* prevent element from being destroyed while we get its data */
  610. slapi_rwlock_wrlock (ruv->lock);
  611. replica = ruvGetReplica (ruv, rid);
  612. if (replica == NULL) /* add new replica */
  613. {
  614. replica = ruvAddReplica (ruv, csn, replica_purl);
  615. if (replica)
  616. return_value = RUV_SUCCESS;
  617. else
  618. return_value = RUV_MEMORY_ERROR;
  619. }
  620. else
  621. {
  622. if (csn_compare (csn, replica->csn) > 0)
  623. {
  624. if (replica->csn != NULL)
  625. {
  626. csn_init_by_csn ( replica->csn, csn );
  627. }
  628. else
  629. {
  630. replica->csn = csn_dup(csn);
  631. }
  632. replica->last_modified = current_time();
  633. if (replica_purl && (NULL == replica->replica_purl ||
  634. strcmp(replica->replica_purl, replica_purl) != 0))
  635. {
  636. /* slapi_ch_free accepts NULL pointer */
  637. slapi_ch_free((void **)&replica->replica_purl);
  638. replica->replica_purl = slapi_ch_strdup(replica_purl);
  639. }
  640. }
  641. /* XXXggood only need to worry about this if real min csn not committed to changelog yet */
  642. if (csn_compare (csn, replica->min_csn) < 0)
  643. {
  644. csn_free(&replica->min_csn);
  645. replica->min_csn = csn_dup(csn);
  646. }
  647. return_value = RUV_SUCCESS;
  648. }
  649. slapi_rwlock_unlock (ruv->lock);
  650. }
  651. return return_value;
  652. }
  653. /* This function, for each replica keeps the smallest CSN its seen so far.
  654. Used for initial setup of changelog purge vector */
  655. int
  656. ruv_set_csns_keep_smallest(RUV *ruv, const CSN *csn)
  657. {
  658. RUVElement *replica;
  659. ReplicaId rid;
  660. int return_value;
  661. if (ruv == NULL || csn == NULL)
  662. {
  663. slapi_log_error(SLAPI_LOG_REPL, repl_plugin_name,
  664. "ruv_set_csns_keep_smallest: NULL argument\n");
  665. return_value = RUV_BAD_DATA;
  666. }
  667. else
  668. {
  669. rid = csn_get_replicaid (csn);
  670. /* prevent element from being destroyed while we get its data */
  671. slapi_rwlock_wrlock (ruv->lock);
  672. replica = ruvGetReplica (ruv, rid);
  673. if (replica == NULL) /* add new replica */
  674. {
  675. replica = ruvAddReplica (ruv, csn, NULL);
  676. if (replica)
  677. return_value = RUV_SUCCESS;
  678. else
  679. return_value = RUV_MEMORY_ERROR;
  680. }
  681. else
  682. {
  683. if (csn_compare (csn, replica->csn) < 0)
  684. {
  685. csn_free(&replica->csn);
  686. replica->csn = csn_dup(csn);
  687. replica->last_modified = current_time();
  688. }
  689. return_value = RUV_SUCCESS;
  690. }
  691. slapi_rwlock_unlock (ruv->lock);
  692. }
  693. return return_value;
  694. }
  695. void
  696. ruv_set_replica_generation(RUV *ruv, const char *csnstr)
  697. {
  698. if (NULL != csnstr && NULL != ruv)
  699. {
  700. slapi_rwlock_wrlock (ruv->lock);
  701. if (NULL != ruv->replGen)
  702. {
  703. slapi_ch_free((void **)&ruv->replGen);
  704. }
  705. ruv->replGen = slapi_ch_strdup(csnstr);
  706. slapi_rwlock_unlock (ruv->lock);
  707. }
  708. }
  709. char *
  710. ruv_get_replica_generation(const RUV *ruv)
  711. {
  712. char *return_str = NULL;
  713. if (!ruv) {
  714. return return_str;
  715. }
  716. slapi_rwlock_rdlock (ruv->lock);
  717. if (ruv != NULL && ruv->replGen != NULL)
  718. {
  719. return_str = slapi_ch_strdup(ruv->replGen);
  720. }
  721. slapi_rwlock_unlock (ruv->lock);
  722. return return_str;
  723. }
  724. static PRBool
  725. ruv_covers_csn_internal(const RUV *ruv, const CSN *csn, PRBool strict)
  726. {
  727. RUVElement *replica;
  728. ReplicaId rid;
  729. PRBool return_value;
  730. if (ruv == NULL || csn == NULL)
  731. {
  732. slapi_log_error(SLAPI_LOG_REPL, repl_plugin_name, "ruv_covers_csn: NULL argument\n");
  733. return_value = PR_FALSE;
  734. }
  735. else
  736. {
  737. rid = csn_get_replicaid(csn);
  738. replica = ruvGetReplica (ruv, rid);
  739. if((is_released_rid(rid)) || (replica == NULL && is_already_released_rid()) ){
  740. /* this is a released rid, so return true */
  741. return PR_TRUE;
  742. }
  743. if (replica == NULL)
  744. {
  745. /*
  746. * We don't know anything about this replica change in the cl, mark it to be zapped.
  747. * This could of been a previously cleaned ruv, but the server was restarted before
  748. * the change could be trimmed.
  749. *
  750. * Only the change log trimming calls this function with "strict" set. So we'll return success
  751. * if strict is set.
  752. */
  753. if(strict){
  754. slapi_log_error(SLAPI_LOG_REPL, repl_plugin_name, "ruv_covers_csn: replica for id %d not found.\n", rid);
  755. return_value = PR_TRUE;
  756. } else {
  757. slapi_log_error(SLAPI_LOG_FATAL, repl_plugin_name, "ruv_covers_csn: replica for id %d not found.\n", rid);
  758. return_value = PR_FALSE;
  759. }
  760. }
  761. else
  762. {
  763. if (strict)
  764. {
  765. return_value = (csn_compare (csn, replica->csn) < 0);
  766. }
  767. else
  768. {
  769. return_value = (csn_compare (csn, replica->csn) <= 0);
  770. }
  771. }
  772. }
  773. return return_value;
  774. }
  775. PRBool
  776. ruv_covers_csn(const RUV *ruv, const CSN *csn)
  777. {
  778. PRBool rc;
  779. slapi_rwlock_rdlock (ruv->lock);
  780. rc = ruv_covers_csn_internal(ruv, csn, PR_FALSE);
  781. slapi_rwlock_unlock (ruv->lock);
  782. return rc;
  783. }
  784. PRBool
  785. ruv_covers_csn_strict(const RUV *ruv, const CSN *csn)
  786. {
  787. PRBool rc;
  788. slapi_rwlock_rdlock (ruv->lock);
  789. rc = ruv_covers_csn_internal(ruv, csn, PR_TRUE);
  790. slapi_rwlock_unlock (ruv->lock);
  791. return rc;
  792. }
  793. /*
  794. * The function gets min{maxcsns of all ruv elements} if get_the_max=0,
  795. * or max{maxcsns of all ruv elements} if get_the_max != 0.
  796. */
  797. static int
  798. ruv_get_min_or_max_csn(const RUV *ruv, CSN **csn, int get_the_max)
  799. {
  800. int return_value;
  801. if (ruv == NULL || csn == NULL)
  802. {
  803. slapi_log_error(SLAPI_LOG_REPL, repl_plugin_name, "ruv_get_min_or_max_csn: NULL argument\n");
  804. return_value = RUV_BAD_DATA;
  805. }
  806. else
  807. {
  808. CSN *found = NULL;
  809. RUVElement *replica;
  810. int cookie;
  811. slapi_rwlock_rdlock (ruv->lock);
  812. for (replica = dl_get_first (ruv->elements, &cookie); replica;
  813. replica = dl_get_next (ruv->elements, &cookie))
  814. {
  815. /*
  816. * Skip replica whose maxcsn is NULL otherwise
  817. * the code will return different min_csn if
  818. * the sequence of the replicas is altered.
  819. *
  820. * don't use READ_ONLY replicas for computing the value of
  821. * "found", as they seem to have NULL csn and min_csn
  822. */
  823. if (replica->csn == NULL || replica->rid == READ_ONLY_REPLICA_ID)
  824. {
  825. continue;
  826. }
  827. if (found == NULL ||
  828. (!get_the_max && csn_compare(found, replica->csn)>0) ||
  829. ( get_the_max && csn_compare(found, replica->csn)<0))
  830. {
  831. found = replica->csn;
  832. }
  833. }
  834. if (found == NULL)
  835. {
  836. *csn = NULL;
  837. }
  838. else
  839. {
  840. *csn = csn_dup (found);
  841. }
  842. slapi_rwlock_unlock (ruv->lock);
  843. return_value = RUV_SUCCESS;
  844. }
  845. return return_value;
  846. }
  847. int
  848. ruv_get_max_csn(const RUV *ruv, CSN **csn)
  849. {
  850. return ruv_get_min_or_max_csn(ruv, csn, 1 /* get the max */);
  851. }
  852. int
  853. ruv_get_min_csn(const RUV *ruv, CSN **csn)
  854. {
  855. return ruv_get_min_or_max_csn(ruv, csn, 0 /* get the min */);
  856. }
  857. int
  858. ruv_enumerate_elements (const RUV *ruv, FNEnumRUV fn, void *arg)
  859. {
  860. int cookie;
  861. RUVElement *elem;
  862. int rc = 0;
  863. ruv_enum_data enum_data = {0};
  864. if (ruv == NULL || fn == NULL)
  865. {
  866. /* ONREPL - log error */
  867. return -1;
  868. }
  869. slapi_rwlock_rdlock (ruv->lock);
  870. for (elem = (RUVElement*)dl_get_first (ruv->elements, &cookie); elem;
  871. elem = (RUVElement*)dl_get_next (ruv->elements, &cookie))
  872. {
  873. /* we only return elements that contains both minimal and maximal CSNs */
  874. if (elem->csn && elem->min_csn)
  875. {
  876. enum_data.csn = elem->csn;
  877. enum_data.min_csn = elem->min_csn;
  878. rc = fn (&enum_data, arg);
  879. if (rc != 0)
  880. break;
  881. }
  882. }
  883. slapi_rwlock_unlock (ruv->lock);
  884. return rc;
  885. }
  886. void
  887. ruv_element_to_string(RUVElement *ruvelem, struct berval *bv, char *buf, size_t bufsize)
  888. {
  889. char csnStr1[CSN_STRSIZE];
  890. char csnStr2[CSN_STRSIZE];
  891. const char *fmtstr = "%s%d%s%s}%s%s%s%s";
  892. if (buf && bufsize) {
  893. PR_snprintf(buf, bufsize, fmtstr,
  894. prefix_ruvcsn, ruvelem->rid,
  895. ruvelem->replica_purl == NULL ? "" : " ",
  896. ruvelem->replica_purl == NULL ? "" : ruvelem->replica_purl,
  897. ruvelem->min_csn == NULL ? "" : " ",
  898. ruvelem->min_csn == NULL ? "" : csn_as_string (ruvelem->min_csn, PR_FALSE, csnStr1),
  899. ruvelem->csn == NULL ? "" : " ",
  900. ruvelem->csn == NULL ? "" : csn_as_string (ruvelem->csn, PR_FALSE, csnStr2));
  901. } else {
  902. bv->bv_val = slapi_ch_smprintf(fmtstr,
  903. prefix_ruvcsn, ruvelem->rid,
  904. ruvelem->replica_purl == NULL ? "" : " ",
  905. ruvelem->replica_purl == NULL ? "" : ruvelem->replica_purl,
  906. ruvelem->min_csn == NULL ? "" : " ",
  907. ruvelem->min_csn == NULL ? "" : csn_as_string (ruvelem->min_csn, PR_FALSE, csnStr1),
  908. ruvelem->csn == NULL ? "" : " ",
  909. ruvelem->csn == NULL ? "" : csn_as_string (ruvelem->csn, PR_FALSE, csnStr2));
  910. bv->bv_len = strlen(bv->bv_val);
  911. }
  912. }
  913. /*
  914. * Convert a replica update vector to a NULL-terminated array
  915. * of bervals. The caller is responsible for freeing the bervals.
  916. */
  917. int
  918. ruv_to_bervals(const RUV *ruv, struct berval ***bvals)
  919. {
  920. struct berval **returned_bervals = NULL;
  921. int return_value;
  922. if (ruv == NULL || bvals == NULL)
  923. {
  924. slapi_log_error(SLAPI_LOG_REPL, repl_plugin_name, "ruv_to_bervals: NULL argument\n");
  925. return_value = RUV_BAD_DATA;
  926. }
  927. else
  928. {
  929. int count;
  930. int i;
  931. RUVElement *replica;
  932. int cookie;
  933. slapi_rwlock_rdlock (ruv->lock);
  934. count = dl_get_count (ruv->elements) + 2;
  935. returned_bervals = (struct berval **)slapi_ch_malloc(sizeof(struct berval *) * count);
  936. returned_bervals[count - 1] = NULL;
  937. returned_bervals[0] = (struct berval *)slapi_ch_malloc(sizeof(struct berval));
  938. returned_bervals[0]->bv_val = slapi_ch_smprintf("%s %s",
  939. prefix_replicageneration, ruv->replGen);
  940. returned_bervals[0]->bv_len = strlen(returned_bervals[0]->bv_val);
  941. for (i = 1, replica = dl_get_first (ruv->elements, &cookie); replica;
  942. i++, replica = dl_get_next (ruv->elements, &cookie))
  943. {
  944. returned_bervals[i] = (struct berval *)slapi_ch_malloc(sizeof(struct berval));
  945. ruv_element_to_string(replica, returned_bervals[i], NULL, 0);
  946. }
  947. slapi_rwlock_unlock (ruv->lock);
  948. return_value = RUV_SUCCESS;
  949. *bvals = returned_bervals;
  950. }
  951. return return_value;
  952. }
  953. int
  954. ruv_to_smod(const RUV *ruv, Slapi_Mod *smod)
  955. {
  956. int return_value;
  957. if (ruv == NULL || smod == NULL)
  958. {
  959. slapi_log_error(SLAPI_LOG_REPL, repl_plugin_name, "ruv_to_smod: NULL argument\n");
  960. return_value = RUV_BAD_DATA;
  961. }
  962. else
  963. {
  964. struct berval val;
  965. RUVElement *replica;
  966. int cookie;
  967. #define B_SIZ 1024
  968. char buf[B_SIZ];
  969. slapi_rwlock_rdlock (ruv->lock);
  970. slapi_mod_init (smod, dl_get_count (ruv->elements) + 1);
  971. slapi_mod_set_type (smod, type_ruvElement);
  972. slapi_mod_set_operation (smod, LDAP_MOD_REPLACE | LDAP_MOD_BVALUES);
  973. PR_snprintf(buf, sizeof(buf), "%s %s", prefix_replicageneration, ruv->replGen);
  974. val.bv_val = buf;
  975. val.bv_len = strlen(buf);
  976. slapi_mod_add_value(smod, &val);
  977. for (replica = dl_get_first (ruv->elements, &cookie); replica;
  978. replica = dl_get_next (ruv->elements, &cookie))
  979. {
  980. ruv_element_to_string(replica, NULL, buf, sizeof(buf));
  981. val.bv_val = buf;
  982. val.bv_len = strlen(buf);
  983. slapi_mod_add_value(smod, &val);
  984. }
  985. slapi_rwlock_unlock (ruv->lock);
  986. return_value = RUV_SUCCESS;
  987. }
  988. return return_value;
  989. }
  990. int
  991. ruv_last_modified_to_smod(const RUV *ruv, Slapi_Mod *smod)
  992. {
  993. int return_value;
  994. if (ruv == NULL || smod == NULL)
  995. {
  996. slapi_log_error(SLAPI_LOG_REPL, repl_plugin_name, "ruv_last_modified_to_smod: NULL argument\n");
  997. return_value = RUV_BAD_DATA;
  998. }
  999. else
  1000. {
  1001. struct berval val;
  1002. RUVElement *replica;
  1003. int cookie;
  1004. char buf[B_SIZ];
  1005. slapi_rwlock_rdlock (ruv->lock);
  1006. slapi_mod_init (smod, dl_get_count (ruv->elements));
  1007. slapi_mod_set_type (smod, type_ruvElementUpdatetime);
  1008. slapi_mod_set_operation (smod, LDAP_MOD_REPLACE | LDAP_MOD_BVALUES);
  1009. val.bv_val = buf;
  1010. for (replica = dl_get_first (ruv->elements, &cookie); replica;
  1011. replica = dl_get_next (ruv->elements, &cookie))
  1012. {
  1013. PR_snprintf(buf, B_SIZ, "%s%d%s%s} %08lx", prefix_ruvcsn, replica->rid,
  1014. replica->replica_purl == NULL ? "" : " ",
  1015. replica->replica_purl == NULL ? "" : replica->replica_purl,
  1016. replica->last_modified);
  1017. val.bv_len = strlen(buf);
  1018. slapi_mod_add_value(smod, &val);
  1019. }
  1020. slapi_rwlock_unlock (ruv->lock);
  1021. return_value = RUV_SUCCESS;
  1022. }
  1023. return return_value;
  1024. }
  1025. /*
  1026. * XXXggood do we need "ruv_covers_ruv_strict" ???? */
  1027. PRBool
  1028. ruv_covers_ruv(const RUV *covering_ruv, const RUV *covered_ruv)
  1029. {
  1030. PRBool return_value = PR_TRUE;
  1031. RUVElement *replica;
  1032. int cookie;
  1033. /* compare replica generations first */
  1034. if (covering_ruv->replGen == NULL || covered_ruv->replGen == NULL)
  1035. return PR_FALSE;
  1036. if (strcasecmp (covered_ruv->replGen, covering_ruv->replGen))
  1037. return PR_FALSE;
  1038. /* replica generation is the same, now compare element by element */
  1039. for (replica = dl_get_first (covered_ruv->elements, &cookie);
  1040. NULL != replica;
  1041. replica = dl_get_next (covered_ruv->elements, &cookie))
  1042. {
  1043. if (replica->csn &&
  1044. (ruv_covers_csn(covering_ruv, replica->csn) == PR_FALSE))
  1045. {
  1046. return_value = PR_FALSE;
  1047. /* Don't break here - may leave something referenced? */
  1048. }
  1049. }
  1050. return return_value;
  1051. }
  1052. /*
  1053. * This compares two ruvs to see if they are compatible. This is
  1054. * used, for example, when the data is reloaded, to see if the ruv
  1055. * from the database is compatible with the ruv from the changelog.
  1056. * If the replica generation is empty or does not match, the data
  1057. * is not compatible.
  1058. * If the maxcsns are not compatible, the ruvs are not compatible.
  1059. * However, if the first ruv has replica IDs that the second RUV
  1060. * does not have, and this is the only difference, the application
  1061. * may allow that with a warning.
  1062. */
  1063. int
  1064. ruv_compare_ruv(const RUV *ruv1, const char *ruv1name, const RUV *ruv2, const char *ruv2name, int strict, int loglevel)
  1065. {
  1066. int rc = 0;
  1067. int ii = 0;
  1068. const RUV *ruvalist[] = {ruv1, ruv2};
  1069. const RUV *ruvblist[] = {ruv2, ruv1};
  1070. int missinglist[2] = {0, 0};
  1071. const char *ruvanames[] = {ruv1name, ruv2name};
  1072. const char *ruvbnames[] = {ruv2name, ruv1name};
  1073. const int nitems = 2;
  1074. /* compare replica generations first */
  1075. if (ruv1->replGen == NULL || ruv2->replGen == NULL) {
  1076. slapi_log_error(loglevel, repl_plugin_name,
  1077. "ruv_compare_ruv: RUV [%s] is missing the replica generation\n",
  1078. ruv1->replGen ? ruv2name : ruv1name);
  1079. return RUV_COMP_NO_GENERATION;
  1080. }
  1081. if (strcasecmp (ruv1->replGen, ruv2->replGen)) {
  1082. slapi_log_error(loglevel, repl_plugin_name,
  1083. "ruv_compare_ruv: RUV [%s] replica generation [%s] does not match RUV [%s] [%s]\n",
  1084. ruv1name, ruv1->replGen, ruv2name, ruv2->replGen);
  1085. return RUV_COMP_GENERATION_DIFFERS;
  1086. }
  1087. /* replica generation is the same, now compare element by element */
  1088. for (ii = 0; ii < nitems; ++ii) {
  1089. int cookie;
  1090. const RUV *ruva = ruvalist[ii];
  1091. const RUV *ruvb = ruvblist[ii];
  1092. int *missing = &missinglist[ii];
  1093. const char *ruvaname = ruvanames[ii];
  1094. const char *ruvbname = ruvbnames[ii];
  1095. RUVElement *replicab;
  1096. for (replicab = dl_get_first (ruvb->elements, &cookie);
  1097. NULL != replicab;
  1098. replicab = dl_get_next (ruvb->elements, &cookie)) {
  1099. if (replicab->csn) {
  1100. ReplicaId rid = csn_get_replicaid(replicab->csn);
  1101. RUVElement *replicaa = ruvGetReplica(ruva, rid);
  1102. char csnstra[CSN_STRSIZE];
  1103. char csnstrb[CSN_STRSIZE];
  1104. char ruvelem[1024];
  1105. ruv_element_to_string(replicab, NULL, ruvelem, sizeof(ruvelem));
  1106. csn_as_string(replicab->csn, PR_FALSE, csnstrb);
  1107. if (replicaa == NULL) {
  1108. (*missing)++;
  1109. slapi_log_error(loglevel, repl_plugin_name,
  1110. "ruv_compare_ruv: RUV [%s] does not contain element [%s] "
  1111. "which is present in RUV [%s]\n",
  1112. ruvaname, ruvelem, ruvbname);
  1113. } else if (strict && (csn_compare (replicab->csn, replicaa->csn) >= 0)) {
  1114. csn_as_string(replicaa->csn, PR_FALSE, csnstra);
  1115. slapi_log_error(loglevel, repl_plugin_name,
  1116. "ruv_compare_ruv: the max CSN [%s] from RUV [%s] is larger "
  1117. "than or equal to the max CSN [%s] from RUV [%s] for element [%s]\n",
  1118. csnstrb, ruvbname, csnstra, ruvaname, ruvelem);
  1119. rc = RUV_COMP_CSN_DIFFERS;
  1120. } else if (csn_compare (replicab->csn, replicaa->csn) > 0) {
  1121. csn_as_string(replicaa->csn, PR_FALSE, csnstra);
  1122. slapi_log_error(loglevel, repl_plugin_name,
  1123. "ruv_compare_ruv: the max CSN [%s] from RUV [%s] is larger "
  1124. "than the max CSN [%s] from RUV [%s] for element [%s]\n",
  1125. csnstrb, ruvbname, csnstra, ruvaname, ruvelem);
  1126. rc = RUV_COMP_CSN_DIFFERS;
  1127. }
  1128. }
  1129. }
  1130. }
  1131. if (!rc) {
  1132. if (missinglist[0]) {
  1133. rc = RUV_COMP_RUV1_MISSING;
  1134. } else if (missinglist[1]) {
  1135. rc = RUV_COMP_RUV2_MISSING;
  1136. }
  1137. }
  1138. return rc;
  1139. }
  1140. PRInt32
  1141. ruv_replica_count (const RUV *ruv)
  1142. {
  1143. if (ruv == NULL)
  1144. return 0;
  1145. else
  1146. {
  1147. int count;
  1148. slapi_rwlock_rdlock (ruv->lock);
  1149. count = dl_get_count (ruv->elements);
  1150. slapi_rwlock_unlock (ruv->lock);
  1151. return count;
  1152. }
  1153. }
  1154. /*
  1155. * Extract all the referral URL's from the RUV (but self URL),
  1156. * returning them in an array of strings, that
  1157. * the caller must free.
  1158. */
  1159. char **
  1160. ruv_get_referrals(const RUV *ruv)
  1161. {
  1162. char **r= NULL;
  1163. int n;
  1164. const char *mypurl = multimaster_get_local_purl();
  1165. slapi_rwlock_rdlock (ruv->lock);
  1166. n = ruv_replica_count(ruv);
  1167. if(n>0)
  1168. {
  1169. RUVElement *replica;
  1170. int cookie;
  1171. int i= 0;
  1172. r= (char**)slapi_ch_calloc(sizeof(char*),n+1);
  1173. for (replica = dl_get_first (ruv->elements, &cookie); replica;
  1174. replica = dl_get_next (ruv->elements, &cookie))
  1175. {
  1176. /* Add URL into referrals if doesn't match self URL */
  1177. if((replica->replica_purl!=NULL) &&
  1178. (slapi_utf8casecmp((unsigned char *)replica->replica_purl,
  1179. (unsigned char *)mypurl) != 0))
  1180. {
  1181. r[i]= slapi_ch_strdup(replica->replica_purl);
  1182. i++;
  1183. }
  1184. }
  1185. }
  1186. slapi_rwlock_unlock (ruv->lock);
  1187. return r; /* Caller must free this */
  1188. }
  1189. void
  1190. ruv_dump(const RUV *ruv, char *ruv_name, PRFileDesc *prFile)
  1191. {
  1192. RUVElement *replica;
  1193. int cookie;
  1194. char csnstr1[CSN_STRSIZE];
  1195. char csnstr2[CSN_STRSIZE];
  1196. char buff[RUVSTR_SIZE];
  1197. int len = sizeof (buff);
  1198. PR_ASSERT(NULL != ruv);
  1199. if (!slapi_is_loglevel_set(SLAPI_LOG_REPL)) {
  1200. return;
  1201. }
  1202. slapi_rwlock_rdlock (ruv->lock);
  1203. PR_snprintf (buff, len, "%s: {replicageneration} %s\n",
  1204. ruv_name ? ruv_name : type_ruvElement,
  1205. ruv->replGen == NULL ? "" : ruv->replGen);
  1206. if (prFile)
  1207. {
  1208. slapi_write_buffer (prFile, buff, strlen(buff));
  1209. }
  1210. else
  1211. {
  1212. slapi_log_error(SLAPI_LOG_REPL, repl_plugin_name, "%s", buff);
  1213. }
  1214. for (replica = dl_get_first (ruv->elements, &cookie); replica;
  1215. replica = dl_get_next (ruv->elements, &cookie))
  1216. {
  1217. /* prefix_ruvcsn = "{replica " */
  1218. PR_snprintf (buff, len, "%s: %s%d%s%s}%s%s%s%s\n",
  1219. ruv_name ? ruv_name : type_ruvElement,
  1220. prefix_ruvcsn, replica->rid,
  1221. replica->replica_purl == NULL ? "" : " ",
  1222. replica->replica_purl == NULL ? "" : replica->replica_purl,
  1223. replica->min_csn == NULL ? "" : " ",
  1224. csn_as_string(replica->min_csn, PR_FALSE, csnstr1),
  1225. replica->csn == NULL ? "" : " ",
  1226. csn_as_string(replica->csn, PR_FALSE, csnstr2));
  1227. if (strlen (csnstr1) > 0) {
  1228. PR_snprintf (buff + strlen(buff) - 1, len - strlen(buff), " %08lx\n",
  1229. replica->last_modified);
  1230. }
  1231. if (prFile)
  1232. {
  1233. slapi_write_buffer (prFile, buff, strlen(buff));
  1234. }
  1235. else
  1236. {
  1237. slapi_log_error(SLAPI_LOG_REPL, repl_plugin_name, "%s", buff);
  1238. }
  1239. }
  1240. slapi_rwlock_unlock (ruv->lock);
  1241. }
  1242. /* this function notifies the ruv that there are operations in progress so that
  1243. they can be added to the pending list for the appropriate client. */
  1244. int ruv_add_csn_inprogress (RUV *ruv, const CSN *csn)
  1245. {
  1246. RUVElement* replica;
  1247. char csn_str[CSN_STRSIZE];
  1248. int rc = RUV_SUCCESS;
  1249. int rid = csn_get_replicaid (csn);
  1250. PR_ASSERT (ruv && csn);
  1251. /* locate ruvElement */
  1252. slapi_rwlock_wrlock (ruv->lock);
  1253. if(is_cleaned_rid(rid)){
  1254. slapi_log_error(SLAPI_LOG_REPL, repl_plugin_name, "ruv_add_csn_inprogress: invalid replica ID"
  1255. "(%d), aborting update\n", rid);
  1256. /* return success because we want to consume the update, but not perform it */
  1257. goto done;
  1258. }
  1259. replica = ruvGetReplica (ruv, rid);
  1260. if (replica == NULL)
  1261. {
  1262. replica = ruvAddReplicaNoCSN (ruv, csn_get_replicaid (csn), NULL/*purl*/);
  1263. if (replica == NULL)
  1264. {
  1265. if (slapi_is_loglevel_set(SLAPI_LOG_REPL)) {
  1266. slapi_log_error(SLAPI_LOG_REPL, repl_plugin_name, "ruv_add_csn_inprogress: failed to add replica"
  1267. " that created csn %s\n", csn_as_string (csn, PR_FALSE, csn_str));
  1268. }
  1269. rc = RUV_MEMORY_ERROR;
  1270. goto done;
  1271. }
  1272. }
  1273. /* check first that this csn is not already covered by this RUV */
  1274. if (ruv_covers_csn_internal(ruv, csn, PR_FALSE))
  1275. {
  1276. if (slapi_is_loglevel_set(SLAPI_LOG_REPL)) {
  1277. slapi_log_error(SLAPI_LOG_REPL, repl_plugin_name, "ruv_add_csn_inprogress: "
  1278. "the csn %s has already be seen - ignoring\n",
  1279. csn_as_string (csn, PR_FALSE, csn_str));
  1280. }
  1281. rc = RUV_COVERS_CSN;
  1282. goto done;
  1283. }
  1284. rc = csnplInsert (replica->csnpl, csn);
  1285. if (rc == 1) /* we already seen this csn */
  1286. {
  1287. if (slapi_is_loglevel_set(SLAPI_LOG_REPL)) {
  1288. slapi_log_error(SLAPI_LOG_REPL, repl_plugin_name, "ruv_add_csn_inprogress: "
  1289. "the csn %s has already be seen - ignoring\n",
  1290. csn_as_string (csn, PR_FALSE, csn_str));
  1291. }
  1292. rc = RUV_COVERS_CSN;
  1293. }
  1294. else if(rc != 0)
  1295. {
  1296. if (slapi_is_loglevel_set(SLAPI_LOG_REPL)) {
  1297. slapi_log_error(SLAPI_LOG_REPL, repl_plugin_name, "ruv_add_csn_inprogress: failed to insert csn %s"
  1298. " into pending list\n", csn_as_string (csn, PR_FALSE, csn_str));
  1299. }
  1300. rc = RUV_UNKNOWN_ERROR;
  1301. }
  1302. else
  1303. {
  1304. if (slapi_is_loglevel_set(SLAPI_LOG_REPL)) {
  1305. slapi_log_error(SLAPI_LOG_REPL, repl_plugin_name, "ruv_add_csn_inprogress: successfully inserted csn %s"
  1306. " into pending list\n", csn_as_string (csn, PR_FALSE, csn_str));
  1307. }
  1308. rc = RUV_SUCCESS;
  1309. }
  1310. done:
  1311. slapi_rwlock_unlock (ruv->lock);
  1312. return rc;
  1313. }
  1314. int ruv_cancel_csn_inprogress (RUV *ruv, const CSN *csn)
  1315. {
  1316. RUVElement* replica;
  1317. int rc = RUV_SUCCESS;
  1318. PR_ASSERT (ruv && csn);
  1319. /* locate ruvElement */
  1320. slapi_rwlock_wrlock (ruv->lock);
  1321. replica = ruvGetReplica (ruv, csn_get_replicaid (csn));
  1322. if (replica == NULL)
  1323. {
  1324. /* ONREPL - log error */
  1325. rc = RUV_NOTFOUND;
  1326. goto done;
  1327. }
  1328. rc = csnplRemove (replica->csnpl, csn);
  1329. if (rc != 0)
  1330. rc = RUV_NOTFOUND;
  1331. else
  1332. rc = RUV_SUCCESS;
  1333. done:
  1334. slapi_rwlock_unlock (ruv->lock);
  1335. return rc;
  1336. }
  1337. int ruv_update_ruv (RUV *ruv, const CSN *csn, const char *replica_purl, PRBool isLocal)
  1338. {
  1339. int rc=RUV_SUCCESS;
  1340. char csn_str[CSN_STRSIZE];
  1341. CSN *max_csn;
  1342. CSN *first_csn = NULL;
  1343. RUVElement *replica;
  1344. PR_ASSERT (ruv && csn);
  1345. slapi_rwlock_wrlock (ruv->lock);
  1346. replica = ruvGetReplica (ruv, csn_get_replicaid (csn));
  1347. if (replica == NULL)
  1348. {
  1349. /* we should have a ruv element at this point because it would have
  1350. been added by ruv_add_inprogress function */
  1351. slapi_log_error(SLAPI_LOG_REPL, repl_plugin_name, "ruv_update_ruv: "
  1352. "can't locate RUV element for replica %d\n", csn_get_replicaid (csn));
  1353. goto done;
  1354. }
  1355. if (csnplCommit(replica->csnpl, csn) != 0)
  1356. {
  1357. slapi_log_error(SLAPI_LOG_FATAL, repl_plugin_name, "ruv_update_ruv: cannot commit csn %s\n",
  1358. csn_as_string(csn, PR_FALSE, csn_str));
  1359. rc = RUV_CSNPL_ERROR;
  1360. goto done;
  1361. }
  1362. else
  1363. {
  1364. if (slapi_is_loglevel_set(SLAPI_LOG_REPL)) {
  1365. slapi_log_error(SLAPI_LOG_REPL, repl_plugin_name, "ruv_update_ruv: "
  1366. "successfully committed csn %s\n", csn_as_string(csn, PR_FALSE, csn_str));
  1367. }
  1368. }
  1369. if ((max_csn = csnplRollUp(replica->csnpl, &first_csn)) != NULL)
  1370. {
  1371. #ifdef DEBUG
  1372. slapi_log_error(SLAPI_LOG_REPL, repl_plugin_name, "ruv_update_ruv: rolled up to csn %s\n",
  1373. csn_as_string(max_csn, PR_FALSE, csn_str)); /* XXXggood remove debugging */
  1374. #endif
  1375. /* replica object sets min csn for local replica */
  1376. if (!isLocal && replica->min_csn == NULL) {
  1377. /* bug 559223 - it seems that, under huge stress, a server might pass
  1378. * through this code when more than 1 change has already been sent and commited into
  1379. * the pending lists... Therefore, as we are trying to set the min_csn ever
  1380. * generated by this replica, we need to set the first_csn as the min csn in the
  1381. * ruv */
  1382. set_min_csn_nolock(ruv, first_csn, replica_purl);
  1383. }
  1384. set_max_csn_nolock(ruv, max_csn, replica_purl);
  1385. /* It is possible that first_csn points to max_csn.
  1386. We need to free it once */
  1387. if (max_csn != first_csn) {
  1388. csn_free(&first_csn);
  1389. }
  1390. csn_free(&max_csn);
  1391. }
  1392. done:
  1393. slapi_rwlock_unlock (ruv->lock);
  1394. return rc;
  1395. }
  1396. /* Helper functions */
  1397. static int
  1398. ruvInit (RUV **ruv, int initCount)
  1399. {
  1400. PR_ASSERT (ruv);
  1401. if (ruv == NULL) {
  1402. return RUV_NSPR_ERROR;
  1403. }
  1404. /* allocate new RUV */
  1405. *ruv = (RUV *)slapi_ch_calloc (1, sizeof (RUV));
  1406. /* allocate elements */
  1407. (*ruv)->elements = dl_new (); /* never returns NULL */
  1408. dl_init ((*ruv)->elements, initCount);
  1409. /* create lock */
  1410. (*ruv)->lock = slapi_new_rwlock();
  1411. if ((*ruv)->lock == NULL)
  1412. {
  1413. slapi_log_error(SLAPI_LOG_REPL, repl_plugin_name,
  1414. "ruvInit: failed to create lock\n");
  1415. dl_free(&(*ruv)->elements);
  1416. slapi_ch_free((void**)ruv);
  1417. return RUV_NSPR_ERROR;
  1418. }
  1419. return RUV_SUCCESS;
  1420. }
  1421. static void
  1422. ruvFreeReplica (void **data)
  1423. {
  1424. RUVElement *element = *(RUVElement**)data;
  1425. if (NULL != element)
  1426. {
  1427. if (NULL != element->csn)
  1428. {
  1429. csn_free (&element->csn);
  1430. }
  1431. if (NULL != element->min_csn)
  1432. {
  1433. csn_free (&element->min_csn);
  1434. }
  1435. /* slapi_ch_free accepts NULL pointer */
  1436. slapi_ch_free((void **)&element->replica_purl);
  1437. if (element->csnpl)
  1438. {
  1439. csnplFree (&(element->csnpl));
  1440. }
  1441. slapi_ch_free ((void **)&element);
  1442. }
  1443. }
  1444. static RUVElement*
  1445. ruvAddReplica (RUV *ruv, const CSN *csn, const char *replica_purl)
  1446. {
  1447. RUVElement *replica;
  1448. PR_ASSERT (NULL != ruv);
  1449. PR_ASSERT (NULL != csn);
  1450. replica = (RUVElement *)slapi_ch_calloc (1, sizeof (RUVElement));
  1451. if (replica == NULL)
  1452. {
  1453. slapi_log_error(SLAPI_LOG_REPL, repl_plugin_name,
  1454. "ruvAddReplica: memory allocation failed\n");
  1455. return NULL;
  1456. }
  1457. replica->rid = csn_get_replicaid (csn);
  1458. /* PR_ASSERT(replica->rid != READ_ONLY_REPLICA_ID); */
  1459. replica->csn = csn_dup (csn);
  1460. replica->last_modified = current_time();
  1461. replica->min_csn = csn_dup (csn);
  1462. replica->replica_purl = slapi_ch_strdup(replica_purl);
  1463. replica->csnpl = csnplNew ();
  1464. dl_add (ruv->elements, replica);
  1465. return replica;
  1466. }
  1467. static RUVElement*
  1468. ruvAddReplicaNoCSN (RUV *ruv, ReplicaId rid, const char *replica_purl)
  1469. {
  1470. RUVElement *replica;
  1471. PR_ASSERT (NULL != ruv);
  1472. /* PR_ASSERT(rid != READ_ONLY_REPLICA_ID); */
  1473. replica = (RUVElement *)slapi_ch_calloc (1, sizeof (RUVElement));
  1474. if (replica == NULL)
  1475. {
  1476. slapi_log_error(SLAPI_LOG_REPL, repl_plugin_name,
  1477. "ruvAddReplicaNoCSN: memory allocation failed\n");
  1478. return NULL;
  1479. }
  1480. replica->rid = rid;
  1481. replica->replica_purl = slapi_ch_strdup(replica_purl);
  1482. replica->csnpl = csnplNew ();
  1483. dl_add (ruv->elements, replica);
  1484. return replica;
  1485. }
  1486. static RUVElement*
  1487. ruvAddIndexReplicaNoCSN (RUV *ruv, ReplicaId rid, const char *replica_purl, int index)
  1488. {
  1489. RUVElement *replica;
  1490. PR_ASSERT (NULL != ruv);
  1491. /* PR_ASSERT(rid != READ_ONLY_REPLICA_ID); */
  1492. replica = (RUVElement *)slapi_ch_calloc (1, sizeof (RUVElement));
  1493. if (replica == NULL)
  1494. {
  1495. slapi_log_error(SLAPI_LOG_REPL, repl_plugin_name,
  1496. "ruvAddIndexReplicaNoCSN: memory allocation failed\n");
  1497. return NULL;
  1498. }
  1499. replica->rid = rid;
  1500. replica->replica_purl = slapi_ch_strdup(replica_purl);
  1501. replica->csnpl = csnplNew ();
  1502. dl_add_index (ruv->elements, replica, index);
  1503. return replica;
  1504. }
  1505. static RUVElement *
  1506. ruvGetReplica (const RUV *ruv, ReplicaId rid)
  1507. {
  1508. PR_ASSERT (ruv /* && rid >= 0 -- rid can't be negative */);
  1509. return (RUVElement *)dl_get (ruv->elements, (const void*)&rid, ruvReplicaCompare);
  1510. }
  1511. static int
  1512. ruvReplicaCompare (const void *el1, const void *el2)
  1513. {
  1514. RUVElement *replica = (RUVElement*)el1;
  1515. ReplicaId *rid1 = (ReplicaId*) el2;
  1516. if (replica == NULL || rid1 == NULL)
  1517. return -1;
  1518. if (*rid1 == replica->rid)
  1519. return 0;
  1520. if (*rid1 < replica->rid)
  1521. return -1;
  1522. else
  1523. return 1;
  1524. }
  1525. /*
  1526. * Given a berval that points to a string of the form:
  1527. * "{dbgen} generation-id", return a copy of the
  1528. * "generation-id" part in a null-terminated string.
  1529. * Returns NULL if the berval is malformed.
  1530. */
  1531. static char *
  1532. get_replgen_from_berval(const struct berval *bval)
  1533. {
  1534. char *ret_string = NULL;
  1535. if (NULL != bval && NULL != bval->bv_val &&
  1536. (bval->bv_len > strlen(prefix_replicageneration)) &&
  1537. strncasecmp(bval->bv_val, prefix_replicageneration,
  1538. strlen(prefix_replicageneration)) == 0)
  1539. {
  1540. unsigned int index = strlen(prefix_replicageneration);
  1541. /* Skip any whitespace */
  1542. while (index++ < bval->bv_len && bval->bv_val[index] == ' ');
  1543. if (index < bval->bv_len)
  1544. {
  1545. unsigned int ret_len = bval->bv_len - index;
  1546. ret_string = slapi_ch_malloc(ret_len + 1);
  1547. memcpy(ret_string, &bval->bv_val[index], ret_len);
  1548. ret_string[ret_len] = '\0';
  1549. }
  1550. }
  1551. return ret_string;
  1552. }
  1553. /*
  1554. * Given a berval that points to a string of the form:
  1555. * "{replica ldap[s]//host:port} <min_csn> <csn>", parse out the
  1556. * partial URL and the CSNs into an RUVElement, and return
  1557. * a pointer to the copy. Returns NULL if the berval is
  1558. * malformed.
  1559. */
  1560. static RUVElement *
  1561. get_ruvelement_from_berval(const struct berval *bval)
  1562. {
  1563. RUVElement *ret_ruve = NULL;
  1564. char *purl = NULL;
  1565. ReplicaId rid = 0;
  1566. char ridbuff [RIDSTR_SIZE];
  1567. int i;
  1568. if (NULL == bval || NULL == bval->bv_val ||
  1569. bval->bv_len <= strlen(prefix_ruvcsn) ||
  1570. strncasecmp(bval->bv_val, prefix_ruvcsn, strlen(prefix_ruvcsn)) != 0)
  1571. {
  1572. slapi_log_error(SLAPI_LOG_REPL, repl_plugin_name,
  1573. "get_ruvelement_from_berval: invalid berval\n");
  1574. goto loser;
  1575. }
  1576. {
  1577. unsigned int urlbegin = strlen(prefix_ruvcsn);
  1578. unsigned int urlend;
  1579. unsigned int mincsnbegin;
  1580. /* replica id must be here */
  1581. i = 0;
  1582. while (isdigit (bval->bv_val[urlbegin]))
  1583. {
  1584. ridbuff [i] = bval->bv_val[urlbegin];
  1585. i++;
  1586. urlbegin ++;
  1587. }
  1588. if (i == 0) /* replicaid is missing */
  1589. goto loser;
  1590. ridbuff[i] = '\0';
  1591. rid = atoi (ridbuff);
  1592. if (bval->bv_val[urlbegin] == '}')
  1593. {
  1594. /* No purl in this value */
  1595. purl = NULL;
  1596. mincsnbegin = urlbegin + 1;
  1597. }
  1598. else
  1599. {
  1600. while (urlbegin++ < bval->bv_len && bval->bv_val[urlbegin] == ' ');
  1601. urlend = urlbegin;
  1602. while (urlend++ < bval->bv_len && bval->bv_val[urlend] != '}');
  1603. purl = slapi_ch_malloc(urlend - urlbegin + 1);
  1604. memcpy(purl, &bval->bv_val[urlbegin], urlend - urlbegin);
  1605. purl[urlend - urlbegin] = '\0';
  1606. mincsnbegin = urlend;
  1607. }
  1608. /* Skip any whitespace before the first (minimum) CSN */
  1609. while (mincsnbegin++ < (bval->bv_len-1) && bval->bv_val[mincsnbegin] == ' ');
  1610. /* Now, mincsnbegin should contain the index of the beginning of the first csn */
  1611. if (mincsnbegin >= bval->bv_len)
  1612. {
  1613. /* Missing the entire content*/
  1614. if (purl == NULL)
  1615. goto loser;
  1616. else /* we have just purl - no changes from the replica has been seen */
  1617. {
  1618. ret_ruve = (RUVElement *)slapi_ch_calloc(1, sizeof(RUVElement));
  1619. ret_ruve->rid = rid;
  1620. ret_ruve->replica_purl = purl;
  1621. }
  1622. }
  1623. else
  1624. {
  1625. if ((bval->bv_len - mincsnbegin != (_CSN_VALIDCSN_STRLEN * 2) + 1)
  1626. && (bval->bv_len - mincsnbegin != (_CSN_VALIDCSN_STRLEN * 2) + 10))
  1627. {
  1628. /* Malformed - incorrect length for 2 CSNs + space AND
  1629. * incorrect length for 2 CSNs + 2 spaces +
  1630. * last_modified (see ruv_dump) */
  1631. goto loser;
  1632. }
  1633. else
  1634. {
  1635. char mincsnstr[CSN_STRSIZE];
  1636. char maxcsnstr[CSN_STRSIZE];
  1637. memset(mincsnstr, '\0', CSN_STRSIZE);
  1638. memset(maxcsnstr, '\0', CSN_STRSIZE);
  1639. memcpy(mincsnstr, &bval->bv_val[mincsnbegin], _CSN_VALIDCSN_STRLEN);
  1640. memcpy(maxcsnstr, &bval->bv_val[mincsnbegin + _CSN_VALIDCSN_STRLEN + 1], _CSN_VALIDCSN_STRLEN);
  1641. ret_ruve = (RUVElement *)slapi_ch_calloc(1, sizeof(RUVElement));
  1642. ret_ruve->min_csn = csn_new_by_string(mincsnstr);
  1643. ret_ruve->csn = csn_new_by_string(maxcsnstr);
  1644. ret_ruve->rid = rid;
  1645. ret_ruve->replica_purl = purl;
  1646. if (NULL == ret_ruve->min_csn || NULL == ret_ruve->csn)
  1647. {
  1648. goto loser;
  1649. }
  1650. }
  1651. }
  1652. }
  1653. /* initialize csn pending list */
  1654. ret_ruve->csnpl = csnplNew ();
  1655. if (ret_ruve->csnpl == NULL)
  1656. {
  1657. slapi_log_error(SLAPI_LOG_REPL, repl_plugin_name,
  1658. "get_ruvelement_from_berval: failed to create csn pending list\n");
  1659. goto loser;
  1660. }
  1661. return ret_ruve;
  1662. loser:
  1663. /* slapi_ch_free accepts NULL pointer */
  1664. slapi_ch_free((void **)&purl);
  1665. if (NULL != ret_ruve)
  1666. {
  1667. if (NULL != ret_ruve->min_csn)
  1668. {
  1669. csn_free(&ret_ruve->min_csn);
  1670. }
  1671. if (NULL != ret_ruve->csn)
  1672. {
  1673. csn_free(&ret_ruve->csn);
  1674. }
  1675. slapi_ch_free((void **)&ret_ruve);
  1676. }
  1677. return NULL;
  1678. }
  1679. int
  1680. ruv_move_local_supplier_to_first(RUV *ruv, ReplicaId aRid)
  1681. {
  1682. RUVElement * elem = NULL;
  1683. int rc = RUV_NOTFOUND;
  1684. PR_ASSERT(ruv);
  1685. slapi_rwlock_wrlock (ruv->lock);
  1686. elem = (RUVElement *)dl_delete(ruv->elements,(const void*)&aRid, ruvReplicaCompare, 0);
  1687. if (elem) {
  1688. dl_add_index(ruv->elements, elem, 1);
  1689. rc = RUV_SUCCESS;
  1690. }
  1691. slapi_rwlock_unlock (ruv->lock);
  1692. return rc;
  1693. }
  1694. int
  1695. ruv_get_first_id_and_purl(RUV *ruv, ReplicaId *rid, char **replica_purl )
  1696. {
  1697. RUVElement * first = NULL;
  1698. int cookie;
  1699. int rc;
  1700. PR_ASSERT(ruv);
  1701. slapi_rwlock_rdlock (ruv->lock);
  1702. first = dl_get_first(ruv->elements, &cookie);
  1703. if ( first == NULL )
  1704. {
  1705. rc = RUV_MEMORY_ERROR;
  1706. }
  1707. else
  1708. {
  1709. *rid = first->rid;
  1710. *replica_purl = first->replica_purl;
  1711. rc = RUV_SUCCESS;
  1712. }
  1713. slapi_rwlock_unlock (ruv->lock);
  1714. return rc;
  1715. }
  1716. int ruv_local_contains_supplier(RUV *ruv, ReplicaId rid)
  1717. {
  1718. int cookie;
  1719. RUVElement *elem = NULL;
  1720. PR_ASSERT(ruv);
  1721. slapi_rwlock_rdlock (ruv->lock);
  1722. for (elem = dl_get_first (ruv->elements, &cookie);
  1723. elem;
  1724. elem = dl_get_next (ruv->elements, &cookie))
  1725. {
  1726. if (elem->rid == rid){
  1727. slapi_rwlock_unlock (ruv->lock);
  1728. return 1;
  1729. }
  1730. }
  1731. slapi_rwlock_unlock (ruv->lock);
  1732. return 0;
  1733. }
  1734. PRBool ruv_has_csns(const RUV *ruv)
  1735. {
  1736. PRBool retval = PR_TRUE;
  1737. CSN *mincsn = NULL;
  1738. CSN *maxcsn = NULL;
  1739. ruv_get_min_csn(ruv, &mincsn);
  1740. ruv_get_max_csn(ruv, &maxcsn);
  1741. if (mincsn) {
  1742. csn_free(&mincsn);
  1743. csn_free(&maxcsn);
  1744. } else if (maxcsn) {
  1745. csn_free(&maxcsn);
  1746. } else {
  1747. retval = PR_FALSE; /* both min and max are false */
  1748. }
  1749. return retval;
  1750. }
  1751. PRBool ruv_has_both_csns(const RUV *ruv)
  1752. {
  1753. PRBool retval = PR_TRUE;
  1754. CSN *mincsn = NULL;
  1755. CSN *maxcsn = NULL;
  1756. ruv_get_min_csn(ruv, &mincsn);
  1757. ruv_get_max_csn(ruv, &maxcsn);
  1758. if (mincsn) {
  1759. csn_free(&mincsn);
  1760. csn_free(&maxcsn);
  1761. } else if (maxcsn) {
  1762. csn_free(&maxcsn);
  1763. retval = PR_FALSE; /* it has a maxcsn but no mincsn */
  1764. } else {
  1765. retval = PR_FALSE; /* both min and max are false */
  1766. }
  1767. return retval;
  1768. }
  1769. /* Check if the first ruv is newer than the second one */
  1770. PRBool
  1771. ruv_is_newer (Object *sruvobj, Object *cruvobj)
  1772. {
  1773. RUV *sruv, *cruv;
  1774. RUVElement *sreplica, *creplica;
  1775. int scookie, ccookie;
  1776. int is_newer = PR_FALSE;
  1777. if ( sruvobj == NULL ) {
  1778. return 0;
  1779. }
  1780. if ( cruvobj == NULL ) {
  1781. return 1;
  1782. }
  1783. sruv = (RUV *) object_get_data ( sruvobj );
  1784. cruv = (RUV *) object_get_data ( cruvobj );
  1785. for (sreplica = dl_get_first (sruv->elements, &scookie); sreplica;
  1786. sreplica = dl_get_next (sruv->elements, &scookie))
  1787. {
  1788. /* A hub may have a dummy ruv with rid 65535 */
  1789. if ( sreplica->csn == NULL ) continue;
  1790. if ( cruv->elements == NULL )
  1791. {
  1792. slapi_log_error(SLAPI_LOG_FATAL, repl_plugin_name,
  1793. "ruv_is_newer, consumer RUV has no elements\n");
  1794. is_newer=PR_FALSE;
  1795. break;
  1796. }
  1797. for (creplica = dl_get_first (cruv->elements, &ccookie); creplica;
  1798. creplica = dl_get_next (cruv->elements, &ccookie))
  1799. {
  1800. if ( sreplica->rid == creplica->rid ) {
  1801. if ( csn_compare ( sreplica->csn, creplica->csn ) > 0 ) {
  1802. is_newer = PR_TRUE;
  1803. }
  1804. break;
  1805. }
  1806. }
  1807. if ( creplica == NULL || is_newer ) {
  1808. is_newer = PR_TRUE;
  1809. break;
  1810. }
  1811. }
  1812. return is_newer;
  1813. }
  1814. void
  1815. ruv_force_csn_update (RUV *ruv, CSN *csn)
  1816. {
  1817. CSN *max = NULL;
  1818. if (ruv != NULL)
  1819. {
  1820. ruv_get_max_csn(ruv, &max);
  1821. if (csn_compare(max, csn))
  1822. {
  1823. ruv_set_max_csn(ruv, csn, NULL);
  1824. }
  1825. csn_free(&max);
  1826. }
  1827. }
  1828. /* This routine is used to iterate the elements in a RUV and set each vector's
  1829. + * minimal CSN to a dummy with just the rid set, e.g. 00000000000000010000 */
  1830. void
  1831. ruv_insert_dummy_min_csn (RUV *ruv)
  1832. {
  1833. RUVElement *r;
  1834. int cookie;
  1835. for (r = dl_get_first (ruv->elements, &cookie); r;
  1836. r = dl_get_next (ruv->elements, &cookie)) {
  1837. if (r->csn && !r->min_csn) {
  1838. CSN *dummycsn = csn_new();
  1839. csn_init(dummycsn);
  1840. csn_set_replicaid(dummycsn, csn_get_replicaid(r->csn));
  1841. r->min_csn = dummycsn;
  1842. }
  1843. }
  1844. }
  1845. #ifdef TESTING /* Some unit tests for code in this file */
  1846. static void
  1847. ruv_dump_internal(RUV *ruv)
  1848. {
  1849. RUVElement *replica;
  1850. int cookie;
  1851. char csnstr1[CSN_STRSIZE];
  1852. char csnstr2[CSN_STRSIZE];
  1853. PR_ASSERT(NULL != ruv);
  1854. printf("{replicageneration} %s\n", ruv->replGen == NULL ? "NULL" : ruv->replGen);
  1855. for (replica = dl_get_first (ruv->elements, &cookie); replica;
  1856. replica = dl_get_next (ruv->elements, &cookie))
  1857. {
  1858. printf("{replica%s%s} %s %s\n",
  1859. replica->replica_purl == NULL ? "" : " ",
  1860. replica->replica_purl == NULL ? "" : replica->replica_purl,
  1861. csn_as_string(replica->min_csn, PR_FALSE, csnstr1),
  1862. csn_as_string(replica->csn, PR_FALSE, csnstr2));
  1863. }
  1864. }
  1865. void
  1866. ruv_test()
  1867. {
  1868. const struct berval *vals[5];
  1869. struct berval val0, val1, val2, val3;
  1870. RUV *ruv;
  1871. Slapi_Attr *attr;
  1872. Slapi_Value *sv0, *sv1, *sv2, *sv3;
  1873. int rc;
  1874. char csnstr[CSN_STRSIZE];
  1875. char *gen;
  1876. CSN *newcsn;
  1877. ReplicaId *ids;
  1878. int nids;
  1879. Slapi_Mod smods;
  1880. PRBool covers;
  1881. vals[0] = &val0;
  1882. vals[1] = &val1;
  1883. vals[2] = &val2;
  1884. vals[3] = &val3;
  1885. vals[4] = NULL;
  1886. val0.bv_val = "{replicageneration} 0440FDC0A33F";
  1887. val0.bv_len = strlen(val0.bv_val);
  1888. val1.bv_val = "{replica ldap://ggood.mcom.com:389} 12345670000000FE0000 12345671000000FE0000";
  1889. val1.bv_len = strlen(val1.bv_val);
  1890. val2.bv_val = "{replica ldaps://an-impossibly-long-host-name-that-drags-on-forever-and-forever.mcom.com:389} 11112110000000FF0000 11112111000000FF0000";
  1891. val2.bv_len = strlen(val2.bv_val);
  1892. val3.bv_val = "{replica} 12345672000000FD0000 12345673000000FD0000";
  1893. val3.bv_len = strlen(val3.bv_val);
  1894. rc = ruv_init_from_bervals(vals, &ruv);
  1895. ruv_dump_internal(ruv);
  1896. attr = slapi_attr_new();
  1897. attr = slapi_attr_init(attr, "ruvelement");
  1898. sv0 = slapi_value_new();
  1899. sv1 = slapi_value_new();
  1900. sv2 = slapi_value_new();
  1901. sv3 = slapi_value_new();
  1902. slapi_value_init_berval(sv0, &val0);
  1903. slapi_value_init_berval(sv1, &val1);
  1904. slapi_value_init_berval(sv2, &val2);
  1905. slapi_value_init_berval(sv3, &val3);
  1906. slapi_attr_add_value(attr, sv0);
  1907. slapi_attr_add_value(attr, sv1);
  1908. slapi_attr_add_value(attr, sv2);
  1909. slapi_attr_add_value(attr, sv3);
  1910. rc = ruv_init_from_slapi_attr(attr, &ruv);
  1911. ruv_dump_internal(ruv);
  1912. rc = ruv_delete_replica(ruv, 0xFF);
  1913. /* Should delete one replica */
  1914. ruv_dump_internal(ruv);
  1915. rc = ruv_delete_replica(ruv, 0xAA);
  1916. /* No such replica - should not do anything */
  1917. ruv_dump_internal(ruv);
  1918. rc = ruv_get_largest_csn_for_replica(ruv, 0xFE, &newcsn);
  1919. if (NULL != newcsn)
  1920. {
  1921. csn_as_string(newcsn, PR_FALSE, csnstr);
  1922. printf("Replica 0x%X has largest csn \"%s\"\n", 0xFE, csnstr);
  1923. }
  1924. else
  1925. {
  1926. printf("BAD - can't get largest CSN for replica 0x%X\n", 0xFE);
  1927. }
  1928. rc = ruv_get_smallest_csn_for_replica(ruv, 0xFE, &newcsn);
  1929. if (NULL != newcsn)
  1930. {
  1931. csn_as_string(newcsn, PR_FALSE, csnstr);
  1932. printf("Replica 0x%X has smallest csn \"%s\"\n", 0xFE, csnstr);
  1933. }
  1934. else
  1935. {
  1936. printf("BAD - can't get smallest CSN for replica 0x%X\n", 0xFE);
  1937. }
  1938. rc = ruv_get_largest_csn_for_replica(ruv, 0xAA, &newcsn);
  1939. printf("ruv_get_largest_csn_for_replica on non-existent replica ID returns %d\n", rc);
  1940. rc = ruv_get_smallest_csn_for_replica(ruv, 0xAA, &newcsn);
  1941. printf("ruv_get_smallest_csn_for_replica on non-existent replica ID returns %d\n", rc);
  1942. newcsn = csn_new_by_string("12345674000000FE0000"); /* Old replica 0xFE */
  1943. rc = ruv_set_csns(ruv, newcsn, "ldaps://foobar.mcom.com");
  1944. /* Should update replica FE's CSN */
  1945. ruv_dump_internal(ruv);
  1946. newcsn = csn_new_by_string("12345675000000FB0000"); /* New replica 0xFB */
  1947. rc = ruv_set_csns(ruv, newcsn, "ldaps://foobar.mcom.com");
  1948. /* Should get a new replica in the list with min == max csn */
  1949. ruv_dump_internal(ruv);
  1950. newcsn = csn_new_by_string("12345676000000FD0000"); /* Old replica 0xFD */
  1951. rc = ruv_set_csns(ruv, newcsn, "ldaps://foobar.mcom.com");
  1952. /* Should update replica 0xFD so new CSN is newer than min CSN */
  1953. ruv_dump_internal(ruv);
  1954. gen = ruv_get_replica_generation(ruv);
  1955. printf("replica generation is \"%s\"\n", gen);
  1956. newcsn = csn_new_by_string("12345673000000FE0000"); /* Old replica 0xFE */
  1957. covers = ruv_covers_csn(ruv, newcsn); /* should say "true" */
  1958. newcsn = csn_new_by_string("12345675000000FE0000"); /* Old replica 0xFE */
  1959. covers = ruv_covers_csn(ruv, newcsn); /* Should say "false" */
  1960. newcsn = csn_new_by_string("123456700000000A0000"); /* New replica 0A */
  1961. rc = ruv_set_min_csn(ruv, newcsn, "ldap://repl0a.mcom.com");
  1962. ruv_dump_internal(ruv);
  1963. newcsn = csn_new_by_string("123456710000000A0000"); /* New replica 0A */
  1964. rc = ruv_set_max_csn(ruv, newcsn, "ldap://repl0a.mcom.com");
  1965. ruv_dump_internal(ruv);
  1966. newcsn = csn_new_by_string("123456700000000B0000"); /* New replica 0B */
  1967. rc = ruv_set_max_csn(ruv, newcsn, "ldap://repl0b.mcom.com");
  1968. ruv_dump_internal(ruv);
  1969. newcsn = csn_new_by_string("123456710000000B0000"); /* New replica 0B */
  1970. rc = ruv_set_min_csn(ruv, newcsn, "ldap://repl0b.mcom.com");
  1971. ruv_dump_internal(ruv);
  1972. /* ONREPL test ruv enumeration */
  1973. rc = ruv_to_smod(ruv, &smods);
  1974. ruv_destroy(&ruv);
  1975. }
  1976. #endif /* TESTING */