sync.c 30 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006
  1. /*
  2. * mbsync - mailbox synchronizer
  3. * Copyright (C) 2000-2002 Michael R. Elkins <me@mutt.org>
  4. * Copyright (C) 2002-2004 Oswald Buddenhagen <ossi@users.sf.net>
  5. *
  6. * This program is free software; you can redistribute it and/or modify
  7. * it under the terms of the GNU General Public License as published by
  8. * the Free Software Foundation; either version 2 of the License, or
  9. * (at your option) any later version.
  10. *
  11. * This program is distributed in the hope that it will be useful,
  12. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  13. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  14. * GNU General Public License for more details.
  15. *
  16. * You should have received a copy of the GNU General Public License
  17. * along with this program; if not, write to the Free Software
  18. * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
  19. *
  20. * As a special exception, mbsync may be linked with the OpenSSL library,
  21. * despite that library's more restrictive license.
  22. */
  23. #include "isync.h"
  24. #include <stdio.h>
  25. #include <limits.h>
  26. #include <stdlib.h>
  27. #include <unistd.h>
  28. #include <time.h>
  29. #include <fcntl.h>
  30. #include <string.h>
  31. #include <errno.h>
  32. #include <sys/stat.h>
  33. void
  34. Fprintf( FILE *f, const char *msg, ... )
  35. {
  36. int r;
  37. va_list va;
  38. va_start( va, msg );
  39. r = vfprintf( f, msg, va );
  40. va_end( va );
  41. if (r < 0) {
  42. perror( "cannot write file" );
  43. exit( 1 );
  44. }
  45. }
  46. static const char Flags[] = { 'D', 'F', 'R', 'S', 'T' };
  47. static int
  48. parse_flags( const char *buf )
  49. {
  50. unsigned flags, i, d;
  51. for (flags = i = d = 0; i < as(Flags); i++)
  52. if (buf[d] == Flags[i]) {
  53. flags |= (1 << i);
  54. d++;
  55. }
  56. return flags;
  57. }
  58. static int
  59. make_flags( int flags, char *buf )
  60. {
  61. unsigned i, d;
  62. for (i = d = 0; i < as(Flags); i++)
  63. if (flags & (1 << i))
  64. buf[d++] = Flags[i];
  65. buf[d] = 0;
  66. return d;
  67. }
  68. static void
  69. makeopts( int dops, store_conf_t *dconf, int *dopts,
  70. store_conf_t *sconf, int *sopts )
  71. {
  72. if (dops & (OP_DELETE|OP_FLAGS)) {
  73. *dopts |= OPEN_SETFLAGS;
  74. *sopts |= OPEN_OLD;
  75. if (dops & OP_FLAGS)
  76. *sopts |= OPEN_FLAGS;
  77. }
  78. if (dops & (OP_NEW|OP_RENEW)) {
  79. *dopts |= OPEN_APPEND;
  80. if (dops & OP_RENEW)
  81. *sopts |= OPEN_OLD;
  82. if (dops & OP_NEW)
  83. *sopts |= OPEN_NEW;
  84. if (dops & OP_EXPUNGE)
  85. *sopts |= OPEN_FLAGS;
  86. if (dconf->max_size)
  87. *sopts |= OPEN_SIZE;
  88. }
  89. if (dops & OP_EXPUNGE) {
  90. *dopts |= OPEN_EXPUNGE;
  91. if (dconf->trash) {
  92. if (!dconf->trash_only_new)
  93. *dopts |= OPEN_OLD;
  94. *dopts |= OPEN_NEW|OPEN_FLAGS;
  95. } else if (sconf->trash && sconf->trash_remote_new)
  96. *dopts |= OPEN_NEW|OPEN_FLAGS;
  97. }
  98. if (dops & OP_CREATE)
  99. *dopts |= OPEN_CREATE;
  100. }
  101. static void
  102. dump_box( store_t *ctx )
  103. {
  104. message_t *msg;
  105. char fbuf[16]; /* enlarge when support for keywords is added */
  106. if (Debug)
  107. for (msg = ctx->msgs; msg; msg = msg->next) {
  108. make_flags( msg->flags, fbuf );
  109. printf( " message %d, %s, %d\n", msg->uid, fbuf, msg->size );
  110. }
  111. }
  112. static message_t *
  113. findmsg( store_t *ctx, int uid, message_t **nmsg, const char *who )
  114. {
  115. message_t *msg;
  116. if (uid > 0) {
  117. if (*nmsg && (*nmsg)->uid == uid) {
  118. debug( " %s came in sequence\n", who );
  119. msg = *nmsg;
  120. found:
  121. *nmsg = msg->next;
  122. if (!(msg->status & M_DEAD)) {
  123. msg->status |= M_PROCESSED;
  124. return msg;
  125. }
  126. debug( " ... but it vanished under our feet!\n" );
  127. } else {
  128. for (msg = ctx->msgs; msg; msg = msg->next)
  129. if (msg->uid == uid) {
  130. debug( " %s came out of sequence\n", who );
  131. goto found;
  132. }
  133. debug( " %s not present\n", who );
  134. }
  135. } else
  136. debug( " no %s expected\n", who );
  137. return 0;
  138. }
  139. #define S_DEAD (1<<0)
  140. #define S_EXPIRED (1<<1)
  141. #define S_DEL_MASTER (1<<2)
  142. #define S_DEL_SLAVE (1<<3)
  143. #define S_EXP_SLAVE (1<<4)
  144. typedef struct sync_rec {
  145. struct sync_rec *next;
  146. /* string_list_t *keywords; */
  147. int muid, suid;
  148. unsigned char flags, status;
  149. } sync_rec_t;
  150. #define EX_OK 0
  151. #define EX_FAIL 1
  152. #define EX_STORE_BAD 2
  153. #define EX_RSTORE_BAD 3
  154. static int
  155. expunge( store_t *ctx, store_t *rctx )
  156. {
  157. driver_t *driver = ctx->conf->driver, *rdriver = rctx->conf->driver;
  158. message_t *msg;
  159. msg_data_t msgdata;
  160. for (msg = ctx->msgs; msg; msg = msg->next)
  161. if (msg->flags & F_DELETED) {
  162. if (ctx->conf->trash) {
  163. if (!ctx->conf->trash_only_new || (msg->status & M_NOT_SYNCED)) {
  164. debug( " trashing message %d\n", msg->uid );
  165. switch (driver->trash_msg( ctx, msg )) {
  166. case DRV_STORE_BAD: return EX_STORE_BAD;
  167. default: return EX_FAIL;
  168. case DRV_OK: break;
  169. }
  170. } else
  171. debug( " not trashing message %d - not new\n", msg->uid );
  172. } else if (rctx->conf->trash && rctx->conf->trash_remote_new) {
  173. if (msg->status & M_NOT_SYNCED) {
  174. if (!rctx->conf->max_size || msg->size <= rctx->conf->max_size) {
  175. debug( " remote trashing message %d\n", msg->uid );
  176. msgdata.flags = msg->flags;
  177. switch (driver->fetch_msg( ctx, msg, &msgdata )) {
  178. case DRV_STORE_BAD: return EX_STORE_BAD;
  179. default: return EX_FAIL;
  180. case DRV_OK: break;
  181. }
  182. switch (rdriver->store_msg( rctx, &msgdata, 0 )) {
  183. case DRV_STORE_BAD: return EX_RSTORE_BAD;
  184. default: return EX_FAIL;
  185. case DRV_OK: break;
  186. }
  187. } else
  188. debug( " not remote trashing message %d - too big\n", msg->uid );
  189. } else
  190. debug( " not remote trashing message %d - not new\n", msg->uid );
  191. }
  192. }
  193. switch (driver->close( ctx )) {
  194. case DRV_STORE_BAD: return EX_STORE_BAD;
  195. default: return EX_FAIL;
  196. case DRV_OK: return EX_OK;;
  197. }
  198. }
  199. /* cases:
  200. a) both non-null
  201. b) only master null
  202. b.1) muid 0
  203. b.2) muid -1
  204. b.3) master not scanned
  205. b.4) master gone
  206. c) only slave null
  207. c.1) suid 0
  208. c.2) suid -1
  209. c.3) slave not scanned
  210. c.4) slave gone
  211. d) both null
  212. d.1) both gone
  213. d.2) muid 0, slave not scanned
  214. d.3) muid -1, slave not scanned
  215. d.4) master gone, slave not scanned
  216. d.5) muid 0, slave gone
  217. d.6) muid -1, slave gone
  218. d.7) suid 0, master not scanned
  219. d.8) suid -1, master not scanned
  220. d.9) slave gone, master not scanned
  221. d.10) suid 0, master gone
  222. d.11) suid -1, master gone
  223. impossible cases: both muid & suid 0 or -1, both not scanned
  224. */
  225. static int
  226. sync_old( int tops, store_t *sctx, store_t *tctx, store_conf_t *tconf, FILE *jfp, int pull,
  227. unsigned char *nflags, sync_rec_t *srec, message_t *smsg, message_t *tmsg, int dels, int delt )
  228. {
  229. driver_t *tdriver = tctx->conf->driver, *sdriver = sctx->conf->driver;
  230. int uid, tuid, unex;
  231. unsigned char sflags, aflags, dflags, rflags;
  232. msg_data_t msgdata;
  233. /* excludes (push) c.3) d.2) d.3) d.4) / (pull) b.3) d.7) d.8) d.9) */
  234. tuid = pull ? srec->suid : srec->muid;
  235. if (!tuid) {
  236. /* b.1) / c.1) */
  237. debug( pull ? " no more slave\n" : " no more master\n" );
  238. } else if (dels) {
  239. /* c.4) d.9) / b.4) d.4) */
  240. debug( pull ? " master vanished\n" : " slave vanished\n" );
  241. if (tmsg && tmsg->flags != *nflags)
  242. info( "Info: conflicting changes in (%d,%d)\n", srec->muid, srec->suid );
  243. if (tops & OP_DELETE) {
  244. debug( pull ? " -> pulling delete\n" : " -> pushing delete\n" );
  245. switch (tdriver->set_flags( tctx, tmsg, tuid, F_DELETED, 0 )) {
  246. case DRV_STORE_BAD: return pull ? SYNC_SLAVE_BAD : SYNC_MASTER_BAD;
  247. case DRV_BOX_BAD: return SYNC_FAIL;
  248. default: /* ok */ break;
  249. case DRV_OK:
  250. if (pull) {
  251. Fprintf( jfp, "< %d %d 0\n", srec->muid, srec->suid );
  252. srec->muid = 0;
  253. } else {
  254. Fprintf( jfp, "> %d %d 0\n", srec->muid, srec->suid );
  255. srec->suid = 0;
  256. }
  257. }
  258. }
  259. } else if (!smsg)
  260. /* c.1) c.2) d.7) d.8) / b.1) b.2) d.2) d.3) */
  261. ;
  262. else if (tuid < 0) {
  263. /* b.2) / c.2) */
  264. debug( pull ? " no slave yet\n" : " no master yet\n" );
  265. if (tops & OP_RENEW) {
  266. if ((tops & OP_EXPUNGE) && (smsg->flags & F_DELETED)) {
  267. debug( pull ? " -> not pulling - would be expunged anyway\n" : " -> not pushing - would be expunged anyway\n" );
  268. smsg->status |= M_NOT_SYNCED;
  269. } else {
  270. if ((smsg->flags & F_FLAGGED) || !tconf->max_size || smsg->size <= tconf->max_size) {
  271. debug( pull ? " -> pulling it\n" : " -> pushing it\n" );
  272. msgdata.flags = smsg->flags;
  273. switch (sdriver->fetch_msg( sctx, smsg, &msgdata )) {
  274. case DRV_STORE_BAD: return pull ? SYNC_MASTER_BAD : SYNC_SLAVE_BAD;
  275. case DRV_BOX_BAD: return SYNC_FAIL;
  276. default: /* ok */ smsg->status |= M_NOT_SYNCED; break;
  277. case DRV_OK:
  278. smsg->flags = msgdata.flags;
  279. switch (tdriver->store_msg( tctx, &msgdata, &uid )) {
  280. case DRV_STORE_BAD: return pull ? SYNC_SLAVE_BAD : SYNC_MASTER_BAD;
  281. default: return SYNC_FAIL;
  282. case DRV_OK:
  283. if (pull) {
  284. srec->suid = uid;
  285. Fprintf( jfp, "> %d -1 %d\n", srec->muid, srec->suid );
  286. } else {
  287. srec->muid = uid;
  288. Fprintf( jfp, "< -1 %d %d\n", srec->suid, srec->muid );
  289. }
  290. *nflags = smsg->flags;
  291. }
  292. }
  293. } else {
  294. debug( pull ? " -> not pulling - still too big\n" : " -> not pushing - still too big\n" );
  295. smsg->status |= M_NOT_SYNCED;
  296. }
  297. }
  298. } else
  299. smsg->status |= M_NOT_SYNCED;
  300. } else if (!delt) {
  301. /* a) & b.3) / c.3) */
  302. debug( pull ? " may pull\n" : " may push\n" );
  303. if (tops & OP_FLAGS) {
  304. debug( pull ? " -> pulling flags\n" : " -> pushing flags\n" );
  305. sflags = smsg->flags;
  306. aflags = sflags & ~*nflags;
  307. dflags = ~sflags & *nflags;
  308. unex = 0;
  309. if (srec->status & S_EXPIRED) {
  310. if (!pull) {
  311. if (sflags & F_DELETED) {
  312. if (!(sflags & F_FLAGGED))
  313. aflags &= ~F_DELETED;
  314. } else
  315. unex = 1;
  316. } else {
  317. if ((sflags & F_FLAGGED) && !(sflags & F_DELETED)) {
  318. unex = 1;
  319. dflags |= F_DELETED;
  320. }
  321. }
  322. }
  323. rflags = (*nflags | aflags) & ~dflags;
  324. if ((tops & OP_EXPUNGE) && (rflags & F_DELETED) &&
  325. (!tctx->conf->trash || tctx->conf->trash_only_new))
  326. {
  327. aflags &= F_DELETED;
  328. dflags = 0;
  329. }
  330. switch ((aflags | dflags) ? tdriver->set_flags( tctx, tmsg, tuid, aflags, dflags ) : DRV_OK) {
  331. case DRV_STORE_BAD: return pull ? SYNC_SLAVE_BAD : SYNC_MASTER_BAD;
  332. case DRV_BOX_BAD: return SYNC_FAIL;
  333. default: /* ok */ break;
  334. case DRV_OK:
  335. *nflags = rflags;
  336. if (unex) {
  337. debug( "unexpiring pair(%d,%d)\n", srec->muid, srec->suid );
  338. /* log last, so deletion can't be misinterpreted! */
  339. Fprintf( jfp, "~ %d %d 0\n", srec->muid, srec->suid );
  340. srec->status &= ~S_EXPIRED;
  341. }
  342. }
  343. }
  344. } /* else b.4) / c.4) */
  345. return SYNC_OK;
  346. }
  347. static int
  348. sync_new( int tops, store_t *sctx, store_t *tctx, store_conf_t *tconf, FILE *jfp, sync_rec_t ***srecadd, int pull, int *smaxuid )
  349. {
  350. driver_t *tdriver = tctx->conf->driver, *sdriver = sctx->conf->driver;
  351. sync_rec_t *srec;
  352. message_t *msg;
  353. int nmsgs, uid;
  354. msg_data_t msgdata;
  355. for (nmsgs = 0, msg = sctx->msgs; msg; msg = msg->next)
  356. if (!(msg->status & M_PROCESSED)) {
  357. if (tops & OP_NEW) {
  358. debug( pull ? "new message %d on master\n" : "new message %d on slave\n", msg->uid );
  359. if ((tops & OP_EXPUNGE) && (msg->flags & F_DELETED)) {
  360. debug( pull ? " not pulling - would be expunged anyway\n" : " not pushing - would be expunged anyway\n" );
  361. msg->status |= M_NOT_SYNCED;
  362. } else {
  363. if ((msg->flags & F_FLAGGED) || !tconf->max_size || msg->size <= tconf->max_size) {
  364. debug( pull ? " pulling it\n" : " pushing it\n" );
  365. if (!nmsgs)
  366. info( pull ? "Pulling new messages..." : "Pushing new messages..." );
  367. else
  368. infoc( '.' );
  369. nmsgs++;
  370. msgdata.flags = msg->flags;
  371. switch (sdriver->fetch_msg( sctx, msg, &msgdata )) {
  372. case DRV_STORE_BAD: return pull ? SYNC_MASTER_BAD : SYNC_SLAVE_BAD;
  373. case DRV_BOX_BAD: return SYNC_FAIL;
  374. case DRV_MSG_BAD: /* ok */ msg->status |= M_NOT_SYNCED; continue;
  375. }
  376. msg->flags = msgdata.flags;
  377. switch (tdriver->store_msg( tctx, &msgdata, &uid )) {
  378. case DRV_STORE_BAD: return pull ? SYNC_SLAVE_BAD : SYNC_MASTER_BAD;
  379. default: return SYNC_FAIL;
  380. case DRV_OK: break;
  381. }
  382. } else {
  383. debug( pull ? " not pulling - too big\n" : " not pushing - too big\n" );
  384. msg->status |= M_NOT_SYNCED;
  385. uid = -1;
  386. }
  387. srec = nfmalloc( sizeof(*srec) );
  388. if (pull) {
  389. srec->muid = msg->uid;
  390. srec->suid = uid;
  391. } else {
  392. srec->muid = uid;
  393. srec->suid = msg->uid;
  394. }
  395. srec->flags = msg->flags;
  396. srec->status = 0;
  397. srec->next = 0;
  398. **srecadd = srec;
  399. *srecadd = &srec->next;
  400. Fprintf( jfp, "+ %d %d %u\n", srec->muid, srec->suid, srec->flags );
  401. if (*smaxuid < msg->uid) {
  402. *smaxuid = msg->uid;
  403. Fprintf( jfp, pull ? "( %d\n" : ") %d\n", msg->uid );
  404. }
  405. }
  406. } else
  407. msg->status |= M_NOT_SYNCED;
  408. }
  409. if (nmsgs)
  410. info( " %d messages\n", nmsgs );
  411. return SYNC_OK;
  412. }
  413. static char *
  414. clean_strdup( const char *s )
  415. {
  416. char *cs;
  417. int i;
  418. cs = nfstrdup( s );
  419. for (i = 0; cs[i]; i++)
  420. if (cs[i] == '/')
  421. cs[i] = '!';
  422. return cs;
  423. }
  424. int
  425. sync_boxes( store_t *mctx, const char *mname,
  426. store_t *sctx, const char *sname,
  427. channel_conf_t *chan )
  428. {
  429. driver_t *mdriver = mctx->conf->driver, *sdriver = sctx->conf->driver;
  430. message_t *mmsg, *smsg, *nmmsg, *nsmsg;
  431. sync_rec_t *recs, *srec, **srecadd, *nsrec;
  432. char *dname, *jname, *nname, *lname, *s, *cmname, *csname;
  433. FILE *dfp, *jfp, *nfp;
  434. int mopts, sopts;
  435. int nom, nos, delm, dels, mex, sex;
  436. int muidval, suidval, smaxxuid, mmaxuid, smaxuid, minwuid, maxwuid;
  437. int t1, t2, t3;
  438. int lfd, ret, line, todel, delt, i, *mexcs, nmexcs, rmexcs;
  439. unsigned char nflags;
  440. struct stat st;
  441. struct flock lck;
  442. char fbuf[16]; /* enlarge when support for keywords is added */
  443. char buf[64];
  444. ret = SYNC_OK;
  445. recs = 0, srecadd = &recs;
  446. nmmsg = nsmsg = 0;
  447. mctx->uidvalidity = sctx->uidvalidity = 0;
  448. mopts = sopts = 0;
  449. makeopts( chan->sops, chan->slave, &sopts, chan->master, &mopts );
  450. makeopts( chan->mops, chan->master, &mopts, chan->slave, &sopts );
  451. if ((chan->sops & (OP_NEW|OP_RENEW)) && chan->max_messages)
  452. sopts |= OPEN_OLD|OPEN_NEW|OPEN_FLAGS;
  453. if (!mname || (mctx->conf->map_inbox && !strcmp( mctx->conf->map_inbox, mname )))
  454. mname = "INBOX";
  455. mctx->name = mname;
  456. mdriver->prepare( mctx, mopts );
  457. if (!sname || (sctx->conf->map_inbox && !strcmp( sctx->conf->map_inbox, sname )))
  458. sname = "INBOX";
  459. sctx->name = sname;
  460. sdriver->prepare( sctx, sopts );
  461. if (!strcmp( chan->sync_state ? chan->sync_state : global_sync_state, "*" )) {
  462. if (!sctx->path) {
  463. fprintf( stderr, "Error: store '%s' does not support in-box sync state\n", chan->slave->name );
  464. return SYNC_SLAVE_BAD;
  465. }
  466. nfasprintf( &dname, "%s/." EXE "state", sctx->path );
  467. } else {
  468. csname = clean_strdup( sname );
  469. if (chan->sync_state)
  470. nfasprintf( &dname, "%s%s", chan->sync_state, csname );
  471. else {
  472. cmname = clean_strdup( mname );
  473. nfasprintf( &dname, "%s:%s:%s_:%s:%s", global_sync_state,
  474. chan->master->name, cmname, chan->slave->name, csname );
  475. free( cmname );
  476. }
  477. free( csname );
  478. }
  479. nfasprintf( &jname, "%s.journal", dname );
  480. nfasprintf( &nname, "%s.new", dname );
  481. nfasprintf( &lname, "%s.lock", dname );
  482. muidval = suidval = smaxxuid = mmaxuid = smaxuid = 0;
  483. memset( &lck, 0, sizeof(lck) );
  484. #if SEEK_SET != 0
  485. lck.l_whence = SEEK_SET;
  486. #endif
  487. #if F_WRLCK != 0
  488. lck.l_type = F_WRLCK;
  489. #endif
  490. if ((lfd = open( lname, O_WRONLY|O_CREAT, 0666 )) < 0) {
  491. if (errno != ENOENT) {
  492. lferr:
  493. fprintf( stderr, "Error: cannot create lock file %s: %s\n", lname, strerror(errno) );
  494. ret = SYNC_FAIL;
  495. goto bail2;
  496. }
  497. goto skiprd;
  498. }
  499. if (fcntl( lfd, F_SETLK, &lck )) {
  500. lckerr:
  501. fprintf( stderr, "Error: channel :%s:%s-:%s:%s is locked\n",
  502. chan->master->name, mname, chan->slave->name, sname );
  503. ret = SYNC_FAIL;
  504. goto bail1;
  505. }
  506. if ((dfp = fopen( dname, "r" ))) {
  507. debug( "reading sync state %s ...\n", dname );
  508. if (!fgets( buf, sizeof(buf), dfp ) || !(i = strlen( buf )) || buf[i - 1] != '\n') {
  509. fprintf( stderr, "Error: incomplete sync state header in %s\n", dname );
  510. fclose( dfp );
  511. ret = SYNC_FAIL;
  512. goto bail;
  513. }
  514. if (sscanf( buf, "%d:%d %d:%d:%d", &muidval, &mmaxuid, &suidval, &smaxxuid, &smaxuid) != 5) {
  515. fprintf( stderr, "Error: invalid sync state header in %s\n", dname );
  516. fclose( dfp );
  517. ret = SYNC_FAIL;
  518. goto bail;
  519. }
  520. line = 1;
  521. while (fgets( buf, sizeof(buf), dfp )) {
  522. line++;
  523. if (!(i = strlen( buf )) || buf[i - 1] != '\n') {
  524. fprintf( stderr, "Error: incomplete sync state entry at %s:%d\n", dname, line );
  525. fclose( dfp );
  526. ret = SYNC_FAIL;
  527. goto bail;
  528. }
  529. fbuf[0] = 0;
  530. if (sscanf( buf, "%d %d %15s", &t1, &t2, fbuf ) < 2) {
  531. fprintf( stderr, "Error: invalid sync state entry at %s:%d\n", dname, line );
  532. fclose( dfp );
  533. ret = SYNC_FAIL;
  534. goto bail;
  535. }
  536. srec = nfmalloc( sizeof(*srec) );
  537. srec->muid = t1;
  538. srec->suid = t2;
  539. s = fbuf;
  540. if (*s == 'X') {
  541. s++;
  542. srec->status = S_EXPIRED;
  543. } else
  544. srec->status = 0;
  545. srec->flags = parse_flags( s );
  546. debug( " entry (%d,%d,%u,%s)\n", srec->muid, srec->suid, srec->flags, srec->status & S_EXPIRED ? "X" : "" );
  547. srec->next = 0;
  548. *srecadd = srec;
  549. srecadd = &srec->next;
  550. }
  551. fclose( dfp );
  552. } else {
  553. if (errno != ENOENT) {
  554. fprintf( stderr, "Error: cannot read sync state %s\n", dname );
  555. ret = SYNC_FAIL;
  556. goto bail;
  557. }
  558. }
  559. if ((jfp = fopen( jname, "r" ))) {
  560. if (!stat( nname, &st )) {
  561. debug( "recovering journal ...\n" );
  562. line = 0;
  563. srec = recs;
  564. while (fgets( buf, sizeof(buf), jfp )) {
  565. line++;
  566. if (!(i = strlen( buf )) || buf[i - 1] != '\n') {
  567. fprintf( stderr, "Error: incomplete journal entry at %s:%d\n", jname, line );
  568. fclose( jfp );
  569. ret = SYNC_FAIL;
  570. goto bail;
  571. }
  572. if (buf[0] == '^')
  573. srec = recs;
  574. else {
  575. if (buf[0] == '(' || buf[0] == ')' ?
  576. (sscanf( buf + 2, "%d", &t1 ) != 1) :
  577. buf[0] == '-' || buf[0] == '|' ?
  578. (sscanf( buf + 2, "%d %d", &t1, &t2 ) != 2) :
  579. (sscanf( buf + 2, "%d %d %d", &t1, &t2, &t3 ) != 3))
  580. {
  581. fprintf( stderr, "Error: malformed journal entry at %s:%d\n", jname, line );
  582. fclose( jfp );
  583. ret = SYNC_FAIL;
  584. goto bail;
  585. }
  586. if (buf[0] == '(')
  587. mmaxuid = t1;
  588. else if (buf[0] == ')')
  589. smaxuid = t1;
  590. else if (buf[0] == '|') {
  591. muidval = t1;
  592. suidval = t2;
  593. } else if (buf[0] == '+') {
  594. srec = nfmalloc( sizeof(*srec) );
  595. srec->muid = t1;
  596. srec->suid = t2;
  597. srec->flags = t3;
  598. debug( " new entry(%d,%d,%u)\n", t1, t2, t3 );
  599. srec->status = 0;
  600. srec->next = 0;
  601. *srecadd = srec;
  602. srecadd = &srec->next;
  603. } else {
  604. for (; srec; srec = srec->next)
  605. if (srec->muid == t1 && srec->suid == t2)
  606. goto syncfnd;
  607. fprintf( stderr, "Error: journal entry at %s:%d refers to non-existing sync state entry\n", jname, line );
  608. fclose( jfp );
  609. ret = SYNC_FAIL;
  610. goto bail;
  611. syncfnd:
  612. debug( " entry(%d,%d,%u) ", srec->muid, srec->suid, srec->flags );
  613. switch (buf[0]) {
  614. case '-':
  615. debug( "killed\n" );
  616. srec->status = S_DEAD;
  617. break;
  618. case '<':
  619. debug( "master now %d\n", t3 );
  620. srec->muid = t3;
  621. break;
  622. case '>':
  623. debug( "slave now %d\n", t3 );
  624. srec->suid = t3;
  625. break;
  626. case '*':
  627. debug( "flags now %d\n", t3 );
  628. srec->flags = t3;
  629. break;
  630. case '~':
  631. debug( "expired now %d\n", t3 );
  632. if (t3) {
  633. if (smaxxuid < t2)
  634. smaxxuid = t2;
  635. srec->status |= S_EXPIRED;
  636. } else
  637. srec->status &= ~S_EXPIRED;
  638. break;
  639. default:
  640. fprintf( stderr, "Error: unrecognized journal entry at %s:%d\n", jname, line );
  641. fclose( jfp );
  642. ret = SYNC_FAIL;
  643. goto bail;
  644. }
  645. }
  646. }
  647. }
  648. }
  649. fclose( jfp );
  650. } else {
  651. if (errno != ENOENT) {
  652. fprintf( stderr, "Error: cannot read journal %s\n", jname );
  653. ret = SYNC_FAIL;
  654. goto bail;
  655. }
  656. }
  657. skiprd:
  658. if (sctx->opts & OPEN_NEW)
  659. maxwuid = INT_MAX;
  660. else if (sctx->opts & OPEN_OLD) {
  661. maxwuid = 0;
  662. for (srec = recs; srec; srec = srec->next)
  663. if (!(srec->status & S_DEAD) && srec->suid > maxwuid)
  664. maxwuid = srec->suid;
  665. } else
  666. maxwuid = 0;
  667. info( "Selecting slave %s... ", sname );
  668. debug( "selecting slave [1,%d]\n", maxwuid );
  669. switch (sdriver->select( sctx, (sctx->opts & OPEN_OLD) ? 1 : smaxuid + 1, maxwuid, 0, 0 )) {
  670. case DRV_STORE_BAD: ret = SYNC_SLAVE_BAD; goto bail;
  671. case DRV_BOX_BAD: ret = SYNC_FAIL; goto bail;
  672. }
  673. info( "%d messages, %d recent\n", sctx->count, sctx->recent );
  674. dump_box( sctx );
  675. if (suidval && suidval != sctx->uidvalidity) {
  676. fprintf( stderr, "Error: UIDVALIDITY of slave changed\n" );
  677. ret = SYNC_FAIL;
  678. goto bail;
  679. }
  680. s = strrchr( dname, '/' );
  681. *s = 0;
  682. mkdir( dname, 0700 );
  683. *s = '/';
  684. if (lfd < 0) {
  685. if ((lfd = open( lname, O_WRONLY|O_CREAT, 0666 )) < 0)
  686. goto lferr;
  687. if (fcntl( lfd, F_SETLK, &lck ))
  688. goto lckerr;
  689. }
  690. if (!(nfp = fopen( nname, "w" ))) {
  691. fprintf( stderr, "Error: cannot write new sync state %s\n", nname );
  692. ret = SYNC_FAIL;
  693. goto bail;
  694. }
  695. if (!(jfp = fopen( jname, "a" ))) {
  696. fprintf( stderr, "Error: cannot write journal %s\n", jname );
  697. fclose( nfp );
  698. ret = SYNC_FAIL;
  699. goto bail;
  700. }
  701. setlinebuf( jfp );
  702. mexcs = 0;
  703. nmexcs = rmexcs = 0;
  704. minwuid = INT_MAX;
  705. if (smaxxuid) {
  706. debug( "preparing master selection - max expired slave uid is %d\n", smaxxuid );
  707. for (srec = recs; srec; srec = srec->next) {
  708. if (srec->status & S_DEAD)
  709. continue;
  710. if (srec->status & S_EXPIRED) {
  711. if (!srec->suid || ((sctx->opts & OPEN_OLD) && !findmsg( sctx, srec->suid, &nsmsg, "slave" )))
  712. srec->status |= S_EXP_SLAVE;
  713. else if (minwuid > srec->muid)
  714. minwuid = srec->muid;
  715. } else if (smaxxuid < srec->suid && minwuid > srec->muid)
  716. minwuid = srec->muid;
  717. }
  718. debug( " min non-orphaned master uid is %d\n", minwuid );
  719. Fprintf( jfp, "^\n" ); /* if any S_EXP_SLAVE */
  720. for (srec = recs; srec; srec = srec->next) {
  721. if (srec->status & S_DEAD)
  722. continue;
  723. if (srec->status & S_EXP_SLAVE) {
  724. if (minwuid > srec->muid && mmaxuid >= srec->muid) {
  725. debug( " -> killing (%d,%d)\n", srec->muid, srec->suid );
  726. srec->status = S_DEAD;
  727. Fprintf( jfp, "- %d %d\n", srec->muid, srec->suid );
  728. } else if (srec->suid) {
  729. debug( " -> orphaning (%d,[%d])\n", srec->muid, srec->suid );
  730. Fprintf( jfp, "> %d %d 0\n", srec->muid, srec->suid );
  731. srec->suid = 0;
  732. }
  733. } else if (minwuid > srec->muid) {
  734. if (srec->suid < 0) {
  735. if (mmaxuid >= srec->muid) {
  736. debug( " -> killing (%d,%d)\n", srec->muid, srec->suid );
  737. srec->status = S_DEAD;
  738. Fprintf( jfp, "- %d %d\n", srec->muid, srec->suid );
  739. }
  740. } else if (srec->muid > 0 && srec->suid && (mctx->opts & OPEN_OLD) &&
  741. (!(mctx->opts & OPEN_NEW) || mmaxuid >= srec->muid)) {
  742. if (nmexcs == rmexcs) {
  743. rmexcs = rmexcs * 2 + 100;
  744. mexcs = nfrealloc( mexcs, rmexcs * sizeof(int) );
  745. }
  746. mexcs[nmexcs++] = srec->muid;
  747. }
  748. }
  749. }
  750. debug( " exception list is:" );
  751. for (i = 0; i < nmexcs; i++)
  752. debug( " %d", mexcs[i] );
  753. debug( "\n" );
  754. } else if (mctx->opts & OPEN_OLD)
  755. minwuid = 1;
  756. if (mctx->opts & OPEN_NEW) {
  757. if (minwuid > mmaxuid + 1)
  758. minwuid = mmaxuid + 1;
  759. maxwuid = INT_MAX;
  760. } else if (mctx->opts & OPEN_OLD) {
  761. maxwuid = 0;
  762. for (srec = recs; srec; srec = srec->next)
  763. if (!(srec->status & S_DEAD) && srec->muid > maxwuid)
  764. maxwuid = srec->muid;
  765. } else
  766. maxwuid = 0;
  767. info( "Selecting master %s... ", mname );
  768. debug( "selecting master [%d,%d]\n", minwuid, maxwuid );
  769. switch (mdriver->select( mctx, minwuid, maxwuid, mexcs, nmexcs )) {
  770. case DRV_STORE_BAD: ret = SYNC_MASTER_BAD; goto finish;
  771. case DRV_BOX_BAD: ret = SYNC_FAIL; goto finish;
  772. }
  773. info( "%d messages, %d recent\n", mctx->count, mctx->recent );
  774. dump_box( mctx );
  775. if (muidval && muidval != mctx->uidvalidity) {
  776. fprintf( stderr, "Error: UIDVALIDITY of master changed\n" );
  777. ret = SYNC_FAIL;
  778. goto finish;
  779. }
  780. if (!muidval || !suidval) {
  781. muidval = mctx->uidvalidity;
  782. suidval = sctx->uidvalidity;
  783. Fprintf( jfp, "| %d %d\n", muidval, suidval );
  784. }
  785. info( "Synchronizing\n" );
  786. debug( "synchronizing old entries\n" );
  787. Fprintf( jfp, "^\n" );
  788. for (srec = recs; srec; srec = srec->next) {
  789. if (srec->status & S_DEAD)
  790. continue;
  791. debug( "pair (%d,%d)\n", srec->muid, srec->suid );
  792. mmsg = findmsg( mctx, srec->muid, &nmmsg, "master" );
  793. smsg = (srec->status & S_EXP_SLAVE) ? 0 : findmsg( sctx, srec->suid, &nsmsg, "slave" );
  794. nom = !mmsg && (mctx->opts & OPEN_OLD);
  795. nos = !smsg && (sctx->opts & OPEN_OLD);
  796. if (nom && nos) {
  797. debug( " vanished\n" );
  798. /* d.1) d.5) d.6) d.10) d.11) */
  799. srec->status = S_DEAD;
  800. Fprintf( jfp, "- %d %d\n", srec->muid, srec->suid );
  801. } else {
  802. delm = nom && (srec->muid > 0);
  803. dels = nos && (srec->suid > 0);
  804. nflags = srec->flags;
  805. if ((ret = sync_old( chan->mops, sctx, mctx, chan->master, jfp, 0, &nflags, srec, smsg, mmsg, dels, delm )) != SYNC_OK ||
  806. (ret = sync_old( chan->sops, mctx, sctx, chan->slave, jfp, 1, &nflags, srec, mmsg, smsg, delm, dels )) != SYNC_OK)
  807. goto finish;
  808. if (srec->flags != nflags) {
  809. debug( " updating flags (%u -> %u)\n", srec->flags, nflags );
  810. srec->flags = nflags;
  811. Fprintf( jfp, "* %d %d %u\n", srec->muid, srec->suid, nflags );
  812. }
  813. if (mmsg && (mmsg->flags & F_DELETED))
  814. srec->status |= S_DEL_MASTER;
  815. if (smsg && (smsg->flags & F_DELETED))
  816. srec->status |= S_DEL_SLAVE;
  817. }
  818. }
  819. debug( "synchronizing new entries\n" );
  820. if ((ret = sync_new( chan->mops, sctx, mctx, chan->master, jfp, &srecadd, 0, &smaxuid )) != SYNC_OK ||
  821. (ret = sync_new( chan->sops, mctx, sctx, chan->slave, jfp, &srecadd, 1, &mmaxuid )) != SYNC_OK)
  822. goto finish;
  823. if ((chan->sops & (OP_NEW|OP_RENEW)) && chan->max_messages) {
  824. debug( "expiring excessive entries\n" );
  825. todel = sctx->count - chan->max_messages;
  826. for (smsg = sctx->msgs; smsg && todel > 0; smsg = smsg->next)
  827. if (!(smsg->status & M_DEAD) && (smsg->flags & F_DELETED))
  828. todel--;
  829. delt = 0;
  830. for (smsg = sctx->msgs; smsg && todel > 0; smsg = smsg->next) {
  831. if ((smsg->status & M_DEAD) || (smsg->flags & F_DELETED))
  832. continue;
  833. if ((smsg->flags & F_FLAGGED) || (smsg->status & M_NOT_SYNCED)) /* add M_DESYNCED? */
  834. todel--;
  835. else if (!(smsg->status & M_RECENT)) {
  836. smsg->status |= M_EXPIRED;
  837. delt++;
  838. todel--;
  839. }
  840. }
  841. if (delt) {
  842. Fprintf( jfp, "^\n" );
  843. for (srec = recs; srec; srec = srec->next) {
  844. if (srec->status & (S_DEAD|S_EXPIRED))
  845. continue;
  846. smsg = findmsg( sctx, srec->suid, &nsmsg, "slave" );
  847. if (smsg && (smsg->status & M_EXPIRED)) {
  848. debug( " expiring pair(%d,%d)\n", srec->muid, srec->suid );
  849. /* log first, so deletion can't be misinterpreted! */
  850. Fprintf( jfp, "~ %d %d 1\n", srec->muid, srec->suid );
  851. if (smaxxuid < srec->suid)
  852. smaxxuid = srec->suid;
  853. srec->status |= S_EXPIRED;
  854. switch (sdriver->set_flags( sctx, smsg, 0, F_DELETED, 0 )) {
  855. case DRV_STORE_BAD: ret = SYNC_SLAVE_BAD; goto finish;
  856. case DRV_BOX_BAD: ret = SYNC_FAIL; goto finish;
  857. default: /* ok */ break;
  858. case DRV_OK: srec->status |= S_DEL_SLAVE;
  859. }
  860. }
  861. }
  862. }
  863. }
  864. /* Doing CLOSE here instead of EXPUNGE above saves network traffic.
  865. But it costs more server power for single-file formats. And it
  866. makes disk-full/quota-exceeded more probable. */
  867. mex = sex = 0;
  868. if (chan->mops & OP_EXPUNGE) {
  869. info( "Expunging master\n" );
  870. debug( "expunging master\n" );
  871. switch (expunge( mctx, sctx )) {
  872. case EX_STORE_BAD: ret = SYNC_MASTER_BAD; goto finish;
  873. case EX_RSTORE_BAD: ret = SYNC_SLAVE_BAD; goto finish;
  874. default: ret = SYNC_FAIL; break;
  875. case EX_OK: mex = 1;
  876. }
  877. }
  878. if (chan->sops & OP_EXPUNGE) {
  879. info( "Expunging slave\n" );
  880. debug( "expunging slave\n" );
  881. switch (expunge( sctx, mctx )) {
  882. case EX_STORE_BAD: ret = SYNC_SLAVE_BAD; goto finish;
  883. case EX_RSTORE_BAD: ret = SYNC_MASTER_BAD; goto finish;
  884. default: ret = SYNC_FAIL; break;
  885. case EX_OK: sex = 1;
  886. }
  887. }
  888. if (mex || sex) {
  889. /* This cleanup is not strictly necessary, as the next full sync
  890. would throw out the dead entries anyway. But ... */
  891. minwuid = INT_MAX;
  892. if (smaxxuid) {
  893. debug( "preparing entry purge - max expired slave uid is %d\n", smaxxuid );
  894. for (srec = recs; srec; srec = srec->next) {
  895. if (srec->status & S_DEAD)
  896. continue;
  897. if (!((srec->suid <= 0 || ((srec->status & S_DEL_SLAVE) && sex)) &&
  898. (srec->muid <= 0 || ((srec->status & S_DEL_MASTER) && mex) || (srec->status & S_EXPIRED))) &&
  899. smaxxuid < srec->suid && minwuid > srec->muid)
  900. minwuid = srec->muid;
  901. }
  902. debug( " min non-orphaned master uid is %d\n", minwuid );
  903. }
  904. Fprintf( jfp, "^\n" );
  905. for (srec = recs; srec; srec = srec->next) {
  906. if (srec->status & S_DEAD)
  907. continue;
  908. if (srec->suid <= 0 || ((srec->status & S_DEL_SLAVE) && sex)) {
  909. if (srec->muid <= 0 || ((srec->status & S_DEL_MASTER) && mex)) {
  910. debug( " -> killing (%d,%d)\n", srec->muid, srec->suid );
  911. srec->status = S_DEAD;
  912. Fprintf( jfp, "- %d %d\n", srec->muid, srec->suid );
  913. } else if (srec->status & S_EXPIRED) {
  914. if (mmaxuid >= srec->muid && minwuid > srec->muid) {
  915. debug( " -> killing (%d,%d)\n", srec->muid, srec->suid );
  916. srec->status = S_DEAD;
  917. Fprintf( jfp, "- %d %d\n", srec->muid, srec->suid );
  918. } else if (srec->suid) {
  919. debug( " -> orphaning (%d,[%d])\n", srec->muid, srec->suid );
  920. Fprintf( jfp, "> %d %d 0\n", srec->muid, srec->suid );
  921. srec->suid = 0;
  922. }
  923. }
  924. }
  925. }
  926. }
  927. finish:
  928. Fprintf( nfp, "%d:%d %d:%d:%d\n", muidval, mmaxuid, suidval, smaxxuid, smaxuid );
  929. for (srec = recs; srec; srec = srec->next) {
  930. if (srec->status & S_DEAD)
  931. continue;
  932. make_flags( srec->flags, fbuf );
  933. Fprintf( nfp, "%d %d %s%s\n", srec->muid, srec->suid,
  934. srec->status & S_EXPIRED ? "X" : "", fbuf );
  935. }
  936. fclose( nfp );
  937. fclose( jfp );
  938. /* order is important! */
  939. rename( nname, dname );
  940. unlink( jname );
  941. bail:
  942. for (srec = recs; srec; srec = nsrec) {
  943. nsrec = srec->next;
  944. free( srec );
  945. }
  946. unlink( lname );
  947. bail1:
  948. close( lfd );
  949. bail2:
  950. free( lname );
  951. free( nname );
  952. free( jname );
  953. free( dname );
  954. return ret;
  955. }