This repository has been archived by the owner on Jun 30, 2021. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 3
/
mddiff.c
1184 lines (1006 loc) · 31.2 KB
/
mddiff.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
//
// maildir diff (mddiff) computes the delta from an old status of a maildir
// (previously recorded in a support file) and the current status, generating
// a set of commands (a diff) that a third party software can apply to
// synchronize a (remote) copy of the maildir.
//
// Absolutely no warranties, released under GNU GPL version 3 or at your
// option any later version.
// Copyright Enrico Tassi <[email protected]>
#define _BSD_SOURCE
#define _GNU_SOURCE
#include <dirent.h>
#include <sys/mman.h>
#include <sys/stat.h>
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <sys/types.h>
#include <limits.h>
#include <errno.h>
#include <string.h>
#include <fcntl.h>
#include <getopt.h>
#include <fnmatch.h>
#include <glib.h>
#include "smd-config.h"
#ifndef O_NOATIME
# define O_NOATIME 0
#endif
// C99 has a printf length modifier for size_t
#if __STDC_VERSION__ >= 199901L
#define SIZE_T_FMT "%zu"
#define SIZE_T_CAST(x) x
#else
#define SIZE_T_FMT "%lu"
#define SIZE_T_CAST(x) ((unsigned long)x)
#endif
#define STATIC static
#define SHA_DIGEST_LENGTH 20
#define __tostring(x) #x
#define tostring(x) __tostring(x)
#define ERROR(cause, msg...) { \
fprintf(stderr, "error [" tostring(cause) "]: " msg);\
fprintf(stdout, "ERROR " msg);\
exit(EXIT_FAILURE);\
}
#define WARNING(cause, msg...) \
fprintf(stderr, "warning [" tostring(cause) "]: " msg)
#define VERBOSE(cause,msg...) \
if (verbose) fprintf(stderr,"debug [" tostring(cause) "]: " msg)
#define VERBOSE_NOH(msg...) \
if (verbose) fprintf(stderr,msg)
// default numbers for static memory allocation
#define DEFAULT_FILENAME_LEN 100
#define DEFAULT_MAIL_NUMBER 500000
#define MAX_EMAIL_NAME_LEN 1024
// int -> hex
STATIC char hexalphabet[] =
{'0','1','2','3','4','5','6','7','8','9','a','b','c','d','e','f'};
STATIC int hex2int(char c){
switch(c){
case '0': case '1': case '2': case '3': case '4':
case '5': case '6': case '7': case '8': case '9': return c - '0';
case 'a': case 'b': case 'c':
case 'd': case 'e': case 'f': return c - 'a' + 10;
}
ERROR(hex2int,"Invalid hex character: %c\n",c);
}
// temporary buffers used to store sha1 sums in ASCII hex
STATIC char tmpbuff_1[SHA_DIGEST_LENGTH * 2 + 1];
STATIC char tmpbuff_2[SHA_DIGEST_LENGTH * 2 + 1];
STATIC char tmpbuff_3[SHA_DIGEST_LENGTH * 2 + 1];
STATIC char tmpbuff_4[SHA_DIGEST_LENGTH * 2 + 1];
// temporary buffers used to URL encode mail names
STATIC char tmpbuff_5[MAX_EMAIL_NAME_LEN];
STATIC char tmpbuff_6[MAX_EMAIL_NAME_LEN];
STATIC char* txtsha(unsigned char *sha1, char* outbuff){
int fd;
for (fd = 0; fd < 20; fd++){
outbuff[fd*2] = hexalphabet[sha1[fd]>>4];
outbuff[fd*2+1] = hexalphabet[sha1[fd]&0x0f];
}
outbuff[40] = '\0';
return outbuff;
}
STATIC void shatxt(const char string[41], unsigned char outbuff[]) {
int i;
for(i=0; i < SHA_DIGEST_LENGTH; i++){
outbuff[i] = hex2int(string[2*i]) * 16 + hex2int(string[2*i+1]);
}
}
STATIC char* URLtxt(const char string[], char outbuff[]) {
size_t i,j;
size_t len = strlen(string);
for(i=0, j=0; i < len && j + 4 < MAX_EMAIL_NAME_LEN; i++, j++) {
if (string[i] == ' ' || string[i] == '%') {
snprintf(&outbuff[j], 4, "%%%X", string[i]);
j+=2;
} else {
outbuff[j] = string[i];
}
}
outbuff[j] = '\0';
return outbuff;
}
STATIC char* txtURL(const char* string, char* outbuff) {
size_t i,j;
size_t len = strlen(string);
for(i=0, j=0; i < len && j + 4 < MAX_EMAIL_NAME_LEN; i++, j++) {
if (string[i] == '%' && i + 2 < len) {
unsigned int k;
sscanf(&string[i+1],"%2x",&k);
snprintf(&outbuff[j], 2, "%c", k);
i+=2;
} else {
outbuff[j] = string[i];
}
}
outbuff[j] = '\0';
return outbuff;
}
#define PROMOTE(what,from,to) ((what) = ((what) == (from)) ? (to) : (what))
// flags used to mark struct mail so that at the end of the scanning
// we output commands lookig that flag
enum sight {
SEEN=0, NOT_SEEN=1, MOVED=2, CHANGED=3
};
STATIC char* sightalphabet[]={"SEEN","NOT_SEEN","MOVED","CHANGED"};
STATIC const char* strsight(enum sight s){
return sightalphabet[s];
}
// since the mails and names buffers may be reallocated,
// hashtables cannot record pointers to a struct mail or char.
// they record the offset w.r.t. the base pointer of the buffers.
// we define a type for them, so that the compiler complains loudly
typedef size_t name_t;
typedef size_t mail_t;
// mail metadata structure
struct mail {
unsigned char bsha[SHA_DIGEST_LENGTH]; // body hash value
unsigned char hsha[SHA_DIGEST_LENGTH]; // header hash value
name_t __name; // file name, do not use directly
enum sight seen; // already seen?
};
// memory pool for mail file names
STATIC char *names;
STATIC name_t curname, max_curname, old_curname;
// memory pool for mail metadata
STATIC struct mail* mails;
STATIC mail_t mailno, max_mailno;
// hash tables for fast comparison of mails given their name/body-hash
STATIC GHashTable *bsha2mail;
STATIC GHashTable *filename2mail;
STATIC time_t lastcheck;
// program options
STATIC int verbose;
STATIC int dry_run;
STATIC int only_list_subfolders;
STATIC int only_generate_symlinks;
STATIC int only_sha1sum_args;
STATIC int only_mkdirp;
STATIC int only_mkfifo;
STATIC int n_excludes;
STATIC char **excludes;
STATIC int no_delete;
STATIC int no_move;
// ============================ helpers =====================================
// mail da structure accessors
STATIC struct mail* mail(mail_t mail_idx) {
return &mails[mail_idx];
}
STATIC char* mail_name(mail_t mail_idx) {
return &names[mails[mail_idx].__name];
}
STATIC void set_mail_name(mail_t mail_idx, name_t name) {
mails[mail_idx].__name = name;
}
// predicates for assert_all_are
STATIC int directory(struct stat sb){ return S_ISDIR(sb.st_mode); }
STATIC int regular_file(struct stat sb){ return S_ISREG(sb.st_mode); }
// stats and asserts pred on argv[optind] ... argv[argc-optind]
STATIC void assert_all_are(
int(*predicate)(struct stat), char* description, char*argv[], int argc)
{
struct stat sb;
int c, rc;
VERBOSE(input, "Asserting all input paths are: %s\n", description);
for(c = 0; c < argc; c++) {
const char * argv_c = txtURL(argv[c], tmpbuff_5);
rc = stat(argv_c, &sb);
if (rc != 0) {
ERROR(stat,"unable to stat %s\n",argv_c);
} else if ( ! predicate(sb) ) {
ERROR(stat,"%s in not a %s\n", argv_c,description);
}
VERBOSE(input, "%s is a %s\n", argv_c, description);
}
}
#define ASSERT_ALL_ARE(what,v,c) assert_all_are(what,tostring(what),v,c)
// open a file in read only mode trying to use O_NOATIME
STATIC int open_rdonly_noatime(const char *fname) {
int fd = open(fname, O_RDONLY | O_NOATIME);
// if the file is not owned by the euid of the process, then
// it cannot be opened using the O_NOATIME flag (man 2 open)
if (fd == -1 && errno == EPERM) {
fd = open(fname, O_RDONLY);
}
return fd;
}
// looks for \n\n in a buffer starting at addr of size size
STATIC unsigned char * find_endof_header(unsigned char *addr, size_t size) {
unsigned char * next;
unsigned char * end = addr + size;
for(next = addr; next + 1 < end; next++){
if (*next == '\n' && *(next+1) == '\n') {
next+=2;
return next;
}
}
return NULL;
}
// =========================== memory allocator ============================
STATIC mail_t alloc_mail(){
mail_t m = mailno;
mailno++;
if (mailno >= max_mailno) {
mails = realloc(mails, sizeof(struct mail) * max_mailno * 2);
if (mails == NULL){
ERROR(realloc,"allocation failed for " SIZE_T_FMT " mails\n",
SIZE_T_CAST(max_mailno * 2));
}
max_mailno *= 2;
}
return m;
}
STATIC void dealloc_mail(){
mailno--;
}
STATIC char *next_name(){
return &names[curname];
}
STATIC name_t alloc_name(){
name_t name = curname;
size_t len = strlen(&names[name]);
old_curname = curname;
curname += len + 1;
if (curname + MAX_EMAIL_NAME_LEN > max_curname) {
names = realloc(names, max_curname * 2);
max_curname *= 2;
}
return name;
}
STATIC void dealloc_name(){
curname = old_curname;
}
// =========================== global variables setup ======================
// convenience casts to be used with glib hashtables
#define MAIL(t) ((mail_t)(t))
#define GPTR(t) ((gpointer)(t))
STATIC guint bsha_hash(gconstpointer key){
mail_t m = MAIL(key);
unsigned char * k = (unsigned char *) mail(m)->bsha;
return k[0] + (k[1] << 8) + (k[2] << 16) + (k[3] << 24);
}
STATIC gboolean bsha_equal(gconstpointer k1, gconstpointer k2){
mail_t m1 = MAIL(k1);
mail_t m2 = MAIL(k2);
if(!memcmp(mail(m1)->bsha,mail(m2)->bsha,SHA_DIGEST_LENGTH)) return TRUE;
else return FALSE;
}
STATIC gboolean hsha_equal(gconstpointer k1, gconstpointer k2){
mail_t m1 = MAIL(k1);
mail_t m2 = MAIL(k2);
if(!memcmp(mail(m1)->hsha,mail(m2)->hsha,SHA_DIGEST_LENGTH)) return TRUE;
else return FALSE;
}
STATIC guint name_hash(gconstpointer key){
mail_t m = MAIL(key);
return g_str_hash(mail_name(m));
}
STATIC gboolean name_equal(gconstpointer k1, gconstpointer k2){
mail_t m1 = MAIL(k1);
mail_t m2 = MAIL(k2);
return g_str_equal(mail_name(m1), mail_name(m2));
}
// wc -l, returning 0 on error
STATIC unsigned long int wc_l(const char* dbfile){
int unsigned long mno = 0;
struct stat sb;
unsigned char *addr, *next;
int fd;
if ((fd = open(dbfile, O_RDONLY | O_NOATIME)) == -1) goto err_open;
if (fstat(fd, &sb) == -1) goto err_mmap;
if ((addr = mmap(NULL, sb.st_size, PROT_READ, MAP_PRIVATE, fd, 0))
== MAP_FAILED) goto err_mmap;
for(next = addr; next < addr + sb.st_size; next++){
if (*next == '\n') mno++;
}
munmap(addr, sb.st_size);
close(fd);
return mno;
err_mmap:
close(fd);
err_open:
return 0;
}
// setup memory pools and hash tables
STATIC void setup_globals(
const char *dbfile, unsigned long int mno, unsigned int fnlen){
// we try to guess a reasonable number of email, to avoid asking the
// allocator an unnnecessarily big chunk whose allocation may fail if there
// is too few memory. We compute the number of entries in the db-file and
// we add 1000 speculating not more than 1000 mails will be received.
if (mno == 0){
if ((mno = wc_l(dbfile)) == 0) mno = DEFAULT_MAIL_NUMBER;
else mno += 1000;
VERBOSE(setup_globals, "guessing we need space for %lu mails\n", mno);
}
// allocate space for mail metadata
mails = malloc(sizeof(struct mail) * mno);
if (mails == NULL) ERROR(malloc,"allocation failed for %lu mails\n",mno);
mailno=1; // 0 is reserved for NULL
max_mailno = mno;
// allocate space for mail filenames
names = malloc(mno * fnlen);
if (names == NULL)
ERROR(malloc, "memory allocation failed for " SIZE_T_FMT
" mails with an average filename length of %u\n",
SIZE_T_CAST(mailno),fnlen);
curname=0;
max_curname=mno * fnlen;
// allocate hashtables for detection of already available mails
bsha2mail = g_hash_table_new(bsha_hash,bsha_equal);
if (bsha2mail == NULL) ERROR(bsha2mail,"hashtable creation failure\n");
filename2mail = g_hash_table_new(name_hash,name_equal);
if (filename2mail == NULL)
ERROR(filename2mail,"hashtable creation failure\n");
}
// =========================== cache (de)serialization ======================
// dump to file the mailbox status
STATIC void save_db(const char* dbname, time_t timestamp){
mail_t m;
FILE * fd;
char new_dbname[PATH_MAX];
snprintf(new_dbname,PATH_MAX,"%s.new",dbname);
fd = fopen(new_dbname,"w");
if (fd == NULL) ERROR(fopen,"unable to save db file '%s'\n",new_dbname);
for(m=1; m < mailno; m++){
if (mail(m)->seen == SEEN) {
fprintf(fd,"%s %s %s\n",
txtsha(mail(m)->hsha,tmpbuff_1),
txtsha(mail(m)->bsha,tmpbuff_2),
mail_name(m));
}
}
fclose(fd);
snprintf(new_dbname,PATH_MAX,"%s.mtime.new",dbname);
fd = fopen(new_dbname,"w");
if (fd == NULL) ERROR(fopen,"unable to save db file '%s'\n",new_dbname);
fprintf(fd,"%lu",timestamp);
fclose(fd);
}
// load from disk a mailbox status and index mails with hashtables
STATIC void load_db(const char* dbname){
FILE* fd;
int fields;
int line=0;
char new_dbname[PATH_MAX];
snprintf(new_dbname,PATH_MAX,"%s.mtime",dbname);
fd = fopen(new_dbname,"r");
if (fd == NULL){
WARNING(fopen,"unable to open db file '%s'\n",new_dbname);
lastcheck = 0L;
} else {
fields = fscanf(fd,"%1$lu",&lastcheck);
if (fields != 1)
ERROR(fscanf,"malformed db file '%s', please remove it\n",
new_dbname);
fclose(fd);
}
fd = fopen(dbname,"r");
if (fd == NULL) {
WARNING(fopen,"unable to open db file '%s'\n",dbname);
return;
}
for(;;) {
// allocate a mail entry
mail_t m = alloc_mail();
// read one entry
fields = fscanf(fd,
"%1$40s %2$40s %3$" tostring(MAX_EMAIL_NAME_LEN) "[^\n]\n",
tmpbuff_1, tmpbuff_2, next_name());
line++;
if (fields == EOF) {
// deallocate mail entry
dealloc_mail();
break;
}
// sanity checks
if (fields != 3)
ERROR(fscanf, "%s: malformed line %d: %d != 3 fields."
" Please remove this db file.\n", dbname, line, fields);
shatxt(tmpbuff_1, mail(m)->hsha);
shatxt(tmpbuff_2, mail(m)->bsha);
// allocate a name string
set_mail_name(m,alloc_name());
// not seen file, may be deleted
mail(m)->seen=NOT_SEEN;
// store it in the hash tables
g_hash_table_insert(bsha2mail,GPTR(m),
g_slist_prepend(g_hash_table_lookup(bsha2mail,GPTR(m)),GPTR(m)));
g_hash_table_insert(filename2mail,GPTR(m),GPTR(m));
}
fclose(fd);
}
// =============================== commands ================================
#define COMMAND_SKIP(m) \
VERBOSE(skip,"%s\n",mail_name(m))
#define COMMAND_ADD(m) \
fprintf(stdout,"ADD %s %s %s\n", URLtxt(mail_name(m),tmpbuff_5),\
txtsha(mail(m)->hsha,tmpbuff_1),\
txtsha(mail(m)->bsha, tmpbuff_2))
#define COMMAND_COPY(m,n) \
fprintf(stdout, "COPY %s %s %s TO %s\n", URLtxt(mail_name(m),tmpbuff_5),\
txtsha(mail(m)->hsha, tmpbuff_1),\
txtsha(mail(m)->bsha, tmpbuff_2),\
URLtxt(mail_name(n),tmpbuff_6))
#define COMMAND_MOVE(m,n) \
fprintf(stdout, "MOVE %s %s %s TO %s\n", URLtxt(mail_name(m),tmpbuff_5),\
txtsha(mail(m)->hsha, tmpbuff_1),\
txtsha(mail(m)->bsha, tmpbuff_2),\
URLtxt(mail_name(n),tmpbuff_6))
#define COMMAND_COPYBODY(m,n) \
fprintf(stdout, "COPYBODY %s %s TO %s %s\n",\
URLtxt(mail_name(m),tmpbuff_5),txtsha(mail(m)->bsha, tmpbuff_1),\
URLtxt(mail_name(n),tmpbuff_6),txtsha(mail(n)->hsha, tmpbuff_2))
#define COMMAND_DELETE(m) \
fprintf(stdout,"DELETE %s %s %s\n", URLtxt(mail_name(m),tmpbuff_5), \
txtsha(mail(m)->hsha, tmpbuff_1), txtsha(mail(m)->bsha, tmpbuff_2))
#define COMMAND_REPLACE(m,n) \
fprintf(stdout, "REPLACE %s %s %s WITH %s %s\n",\
URLtxt(mail_name(m),tmpbuff_5),txtsha(mail(m)->hsha,tmpbuff_1),\
txtsha(mail(m)->bsha,tmpbuff_2),\
txtsha(mail(n)->hsha,tmpbuff_3),txtsha(mail(n)->bsha,tmpbuff_4))
#define COMMAND_REPLACE_HEADER(m,n) \
fprintf(stdout, "REPLACEHEADER %s %s %s WITH %s\n",\
mail_name(m),txtsha(mail(m)->hsha,tmpbuff_1),\
txtsha(mail(m)->bsha,tmpbuff_2), \
txtsha(mail(n)->hsha,tmpbuff_3))
STATIC int is_old_file_still_there(const char* file){
int fd;
struct stat sb;
mail_t alias, m;
m = alloc_mail();
snprintf(next_name(), MAX_EMAIL_NAME_LEN,"%s",file);
set_mail_name(m,alloc_name());
fd = open_rdonly_noatime(mail_name(m));
if (fd == -1) {
goto err_alloc_cleanup;
}
if (fstat(fd, &sb) == -1) {
goto err_alloc_fd_cleanup;
}
alias = MAIL(g_hash_table_lookup(filename2mail,GPTR(m)));
if (alias != 0 && lastcheck >= sb.st_mtime) {
// we cache that it has been seen already
mail(alias)->seen=SEEN;
close(fd);
dealloc_name();
dealloc_mail();
return 1;
}
err_alloc_fd_cleanup:
close(fd);
err_alloc_cleanup:
dealloc_name();
dealloc_mail();
return 0;
}
// the heart
STATIC void analyze_file(const char* dir,const char* file) {
unsigned char *addr,*next;
int fd;
struct stat sb;
mail_t alias, m;
GChecksum* ctx;
gsize ctx_len;
GSList *bodyaliases = NULL, *bodyaliases_orig = NULL;
m = alloc_mail();
snprintf(next_name(), MAX_EMAIL_NAME_LEN,"%s/%s",dir,file);
set_mail_name(m,alloc_name());
fd = open_rdonly_noatime(mail_name(m));
if (fd == -1) {
WARNING(open,"unable to open file '%s': %s\n", mail_name(m),
strerror(errno));
WARNING(open,"ignoring '%s'\n", mail_name(m));
goto err_alloc_cleanup;
}
if (fstat(fd, &sb) == -1) {
WARNING(fstat,"unable to stat file '%s'\n",mail_name(m));
goto err_alloc_cleanup;
}
alias = MAIL(g_hash_table_lookup(filename2mail,GPTR(m)));
// check if the cache lists a file with the same name and the same
// mtime. If so, this is an old, untouched, message we can skip
if (alias != 0 && lastcheck > sb.st_mtime) {
mail(alias)->seen=SEEN;
COMMAND_SKIP(alias);
goto err_alloc_fd_cleanup;
}
addr = mmap(NULL, sb.st_size, PROT_READ, MAP_PRIVATE, fd, 0);
if (addr == MAP_FAILED){
if (sb.st_size == 0)
// empty file, we do not consider them emails
goto err_alloc_fd_cleanup;
else
// mmap failed
ERROR(mmap, "unable to load '%s'\n",mail_name(m));
}
next = find_endof_header(addr, sb.st_size);
if ( next == NULL ) {
WARNING(parse, "malformed file '%s', no header\n",mail_name(m));
munmap(addr, sb.st_size);
goto err_alloc_fd_cleanup;
}
// calculate sha1
ctx = g_checksum_new(G_CHECKSUM_SHA1);
ctx_len = SHA_DIGEST_LENGTH;
g_checksum_update(ctx, addr, next - addr);
g_checksum_get_digest(ctx, mail(m)->hsha, &ctx_len);
g_checksum_free(ctx);
ctx = g_checksum_new(G_CHECKSUM_SHA1);
ctx_len = SHA_DIGEST_LENGTH;
g_checksum_update(ctx, next, sb.st_size - (next - addr));
g_checksum_get_digest(ctx, mail(m)->bsha, &ctx_len);
g_checksum_free(ctx);
munmap(addr, sb.st_size);
close(fd);
if (alias != 0) {
if(bsha_equal(GPTR(alias),GPTR(m))) {
if (hsha_equal(GPTR(alias), GPTR(m))) {
mail(alias)->seen = SEEN;
goto err_alloc_fd_cleanup;
} else {
COMMAND_REPLACE_HEADER(alias,m);
mail(m)->seen=SEEN;
mail(alias)->seen=CHANGED;
return;
}
} else {
COMMAND_REPLACE(alias,m);
mail(m)->seen=SEEN;
mail(alias)->seen=CHANGED;
return;
}
}
bodyaliases_orig = bodyaliases = g_hash_table_lookup(bsha2mail,GPTR(m));
// some messages with the same body are there
if (bodyaliases != NULL) {
mail_t firstalias = MAIL(bodyaliases->data);
for(; bodyaliases != NULL; bodyaliases = g_slist_next(bodyaliases)) {
mail_t bodyalias = MAIL(bodyaliases->data);
if (hsha_equal(GPTR(bodyalias), GPTR(m))) {
// this one has the same header too
// absurd, see the else case
g_assert(mail(bodyalias)->seen != MOVED || no_move);
if (mail(bodyalias)->seen == SEEN ||
is_old_file_still_there(mail_name(bodyalias)) ||
no_move) {
// a real copy
COMMAND_COPY(bodyalias,m);
PROMOTE(mail(bodyalias)->seen, NOT_SEEN, MOVED);
mail(m)->seen=SEEN;
} else {
// a real move
COMMAND_MOVE(bodyalias,m);
// the new file is the source for such body so that if the
// file was copied twice and then removed we generate a
// MOVE x -> y and a COPY y -> z
g_hash_table_insert(bsha2mail,GPTR(m),
g_slist_prepend(bodyaliases_orig,GPTR(m)));
mail(bodyalias)->seen=MOVED;
mail(m)->seen=SEEN;
}
return;
}
}
// no full alias, we just recycle the body
COMMAND_COPYBODY(firstalias,m);
mail(m)->seen=SEEN;
return;
}
// we should add that file
COMMAND_ADD(m);
mail(m)->seen=SEEN;
return;
// error handlers, status cleanup
err_alloc_fd_cleanup:
close(fd);
err_alloc_cleanup:
dealloc_name();
dealloc_mail();
}
// recursively analyze a directory and its sub-directories
STATIC void analyze_dir(const char* path){
DIR* dir;
struct dirent *dir_entry;
int inside_cur_or_new = 0;
int i, rc;
// skip excluded paths
for(i = 0; i < n_excludes; i++){
if ( (rc = fnmatch(excludes[i], path, 0)) == 0 ) {
VERBOSE(analyze_dir,
"skipping '%s' because excluded by pattern '%s'\n",
path, excludes[i]);
return;
}
if ( rc != FNM_NOMATCH ){
ERROR(fnmatch,"processing pattern '%s': %s",excludes[i],
strerror(errno))
}
}
// detect if inside cur/ or new/
#ifdef __GLIBC__
const char* bname = basename(path);
#else
gchar* bname = g_path_get_basename(path);
#endif
if ( !strcmp(bname,"cur") || !strcmp(bname,"new") ) {
inside_cur_or_new = 1;
if ( only_list_subfolders ) {
fprintf(stdout, "%s\n", path);
return;
}
}
#ifndef __GLIBC__
g_free(bname);
#endif
dir = opendir(path);
if (dir == NULL) ERROR(opendir, "Unable to open directory '%s'\n", path);
while ( (dir_entry = readdir(dir)) != NULL) {
if (DT_REG == dir_entry->d_type) {
if ( inside_cur_or_new && !only_list_subfolders ) {
analyze_file(path,dir_entry->d_name);
} else {
VERBOSE(analyze_dir,"skipping '%s/%s', outside maildir\n",
path,dir_entry->d_name);
}
} else if ((DT_DIR == dir_entry->d_type ||
DT_LNK == dir_entry->d_type) &&
strcmp(dir_entry->d_name,"tmp") &&
strcmp(dir_entry->d_name,".") &&
strcmp(dir_entry->d_name,"..")){
int len = strlen(path) + 1 + strlen(dir_entry->d_name) + 1;
char * newdir = malloc(len);
snprintf(newdir,len,"%s/%s",path,dir_entry->d_name);
analyze_dir(newdir);
free(newdir);
}
}
closedir(dir);
}
STATIC void analyze_dirs(char* paths[], int no){
int i;
for(i=0; i<no; i++){
// we remove a trailing '/' if any
char *data = strdup(txtURL(paths[i],tmpbuff_5));
if (data[strlen(data)-1] == '/') data[strlen(data)-1] = '\0';
analyze_dir(data);
free(data);
}
}
// at the end of the analysis phase, look at the mails data structure to
// identify mails that are not available anymore and should be removed
STATIC void generate_deletions(){
size_t m;
for(m=1; m < mailno; m++){
if (!no_delete &&
(mail(m)->seen == NOT_SEEN || (no_move && mail(m)->seen == MOVED)))
// normally moved or removed mails are deleted
COMMAND_DELETE(m);
else if (no_delete && no_move && mail(m)->seen == MOVED)
// if --no-delete only moved mails should be deleted
COMMAND_DELETE(m);
else
VERBOSE(seen,"STATUS OF %s %s %s IS %s\n",
mail_name(m),txtsha(mail(m)->hsha,tmpbuff_1),
txtsha(mail(m)->bsha,tmpbuff_2),strsight(mail(m)->seen));
}
}
// removes trailing '\n' modifying the string
STATIC void rm_trailing_n(char *src_name){
size_t src_len = strlen(src_name);
if (src_len > 0 && src_name[src_len-1] == '\n') src_name[src_len-1]='\0';
}
STATIC void extra_sha_file(const char* file) {
unsigned char *addr,*next;
int fd;
struct stat sb;
gchar* sha1;
fd = open_rdonly_noatime(file);
if (fd == -1) ERROR(open,"unable to open file '%s'\n",file);
if (fstat(fd, &sb) == -1) ERROR(fstat,"unable to stat file '%s'\n",file);
if (! S_ISREG(sb.st_mode)) {
ERROR(fstat,"not a regular file '%s'\n",file);
}
addr = mmap(NULL, sb.st_size, PROT_READ, MAP_PRIVATE, fd, 0);
if (addr == MAP_FAILED) {
if (sb.st_size == 0) {
next = addr;
} else {
ERROR(mmap, "unable to load '%s'\n",file);
}
} else {
next = find_endof_header(addr, sb.st_size);
if ( next == NULL )
ERROR(parse, "malformed file '%s', no header\n",file);
}
// calculate sha1
fprintf(stdout, "%s ",
sha1 = g_compute_checksum_for_data(G_CHECKSUM_SHA1, addr, next - addr));
g_free(sha1);
fprintf(stdout, "%s\n",
sha1 = g_compute_checksum_for_data(G_CHECKSUM_SHA1,
next, sb.st_size - (next - addr)));
g_free(sha1);
munmap(addr, sb.st_size);
close(fd);
}
STATIC void extra_mkdir_ln(char* src_name, char* tgt_name) {
gchar* dir_tgt = g_path_get_dirname(tgt_name);
if ( g_mkdir_with_parents(dir_tgt, 0770) ){
ERROR(mkdir,"unable to create dir %s: %s\n",
dir_tgt, strerror(errno));
exit(EXIT_FAILURE);
}
if ( symlink(src_name, tgt_name) != 0 ){
ERROR(symlink,"unable to symlink %s to %s: %s\n",
src_name, tgt_name, strerror(errno));
exit(EXIT_FAILURE);
}
fprintf(stdout,"OK\n");
g_free(dir_tgt);
}
STATIC void extra_sha1sum_file(const char* file) {
unsigned char *addr;
int fd;
struct stat sb;
gchar* sha1;
fd = open_rdonly_noatime(file);
if (fd == -1) ERROR(open,"unable to open file '%s'\n",file);
if (fstat(fd, &sb) == -1) ERROR(fstat,"unable to stat file '%s'\n",file);
addr = mmap(NULL, sb.st_size, PROT_READ, MAP_PRIVATE, fd, 0);
if (addr == MAP_FAILED){
if (sb.st_size == 0)
// empty file
;
else
// mmap failed
ERROR(mmap, "unable to load '%s'\n",file);
}
// calculate sha1
fprintf(stdout, "%s %s\n",
sha1 = g_compute_checksum_for_data(G_CHECKSUM_SHA1, addr, sb.st_size),
file);
g_free(sha1);
if (addr != MAP_FAILED) munmap(addr, sb.st_size);
close(fd);
}
// ============================ main =====================================
#define OPT_MAX_MAILNO 300
#define OPT_DB_FILE 301
#define OPT_EXCLUDE 302
#define OPT_SHA1SUM 303
#define OPT_MKDIRP 304
#define OPT_MKFIFO 305
#define OPT_NOMOVE 306
// command line options
STATIC struct option long_options[] = {
{"max-mailno", required_argument, NULL, OPT_MAX_MAILNO},
{"db-file" , required_argument, NULL, OPT_DB_FILE},
{"exclude" , required_argument, NULL, OPT_EXCLUDE},
{"sha1sum" , no_argument , NULL, OPT_SHA1SUM},
{"mkdir-p" , no_argument , NULL, OPT_MKDIRP},
{"mkfifo" , no_argument , NULL, OPT_MKFIFO},
{"list" , no_argument , NULL, 'l'},
{"symlink" , no_argument , NULL, 's'},
{"verbose" , no_argument , NULL, 'v'},
{"dry-run" , no_argument , NULL, 'd'},
{"no-delete" , no_argument , NULL, 'n'},
{"no-move" , no_argument , NULL, OPT_NOMOVE},
{"help" , no_argument , NULL, 'h'},
{NULL , no_argument , NULL, 0},
};
// command line options documentation
STATIC const char* long_options_doc[] = {
" number Estimation of max mail message number (defaults to the"
"\n "
"number of messages in the db-file + 1000 or "
tostring(DEFAULT_MAIL_NUMBER)
"\n "
"if there is no db-file). You may want to decrease it"
"\n "
"for the first run on small systems. It is anyway"
"\n "
"increased automatically when needed",
"path Name of the cache for the endpoint (default db.txt)",
"glob Exclude paths matching the given glob expression",
"behave as sha1sum",
"behave as mkdir -p",
"behave as mkfifo",
"Only list subfolders (short -l)",
"Symbolic Link generation mode (short -s)",
"Increase program verbosity (printed on stderr, short -v)",
"Do not generate a new db file (short -d)",
"Do not track deletions (short -n)",
"This help screen",
NULL
};
// print help and bail out
STATIC void help(char* argv0){
int i;
char *bname = g_path_get_basename(argv0);
fprintf(stdout,"\nUsage: %s [options] (paths...|fifo)\n",bname);
for (i=0;long_options[i].name != NULL;i++) {
if ( long_options[i].has_arg == required_argument )
fprintf(stdout," --%-8s%s\n",
long_options[i].name,long_options_doc[i]);
else
fprintf(stdout," --%-18s%s\n",
long_options[i].name,long_options_doc[i]);
}
fprintf(stdout,"\n\
If paths is a single fifo, %s reads from it file names and outputs the\n\
sha1 of their header and body separated by space.\n\n\
If paths is a list of directories, %s outputs a list of actions a client\n\
has to perform to syncronize a copy of the same maildirs. This set of actions\n\
is relative to a previous status of the maildir stored in the db file.\n\
The input directories are traversed recursively, and every file encountered\n\
inside directories named cur/ and new/ is a potential mail message (if it\n\
contains no \\n\\n it is skipped).\n\n\