pattern.c 2.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154
  1. #include <u.h>
  2. #include <libc.h>
  3. #include <fcall.h>
  4. #include <bio.h>
  5. #include <regexp.h>
  6. #define Extern
  7. #include "exportfs.h"
  8. Reprog **exclude, **include;
  9. char *patternfile;
  10. void
  11. exclusions(void)
  12. {
  13. Biobuf *f;
  14. int ni, nmaxi, ne, nmaxe;
  15. char *line;
  16. if(patternfile == nil)
  17. return;
  18. f = Bopen(patternfile, OREAD);
  19. if(f == nil)
  20. fatal("cannot open patternfile");
  21. ni = 0;
  22. nmaxi = 100;
  23. include = malloc(nmaxi*sizeof(*include));
  24. if(include == nil)
  25. fatal("out of memory");
  26. include[0] = nil;
  27. ne = 0;
  28. nmaxe = 100;
  29. exclude = malloc(nmaxe*sizeof(*exclude));
  30. if(exclude == nil)
  31. fatal("out of memory");
  32. exclude[0] = nil;
  33. while(line = Brdline(f, '\n')){
  34. line[Blinelen(f) - 1] = 0;
  35. if(strlen(line) < 2 || line[1] != ' ')
  36. continue;
  37. switch(line[0]){
  38. case '+':
  39. if(ni+1 >= nmaxi){
  40. nmaxi = 2*nmaxi;
  41. include = realloc(include, nmaxi*sizeof(*include));
  42. if(include == nil)
  43. fatal("out of memory");
  44. }
  45. DEBUG(DFD, "\tinclude %s\n", line+2);
  46. include[ni] = regcomp(line+2);
  47. include[++ni] = nil;
  48. break;
  49. case '-':
  50. if(ne+1 >= nmaxe){
  51. nmaxe = 2*nmaxe;
  52. exclude = realloc(exclude, nmaxe*sizeof(*exclude));
  53. if(exclude == nil)
  54. fatal("out of memory");
  55. }
  56. DEBUG(DFD, "\texclude %s\n", line+2);
  57. exclude[ne] = regcomp(line+2);
  58. exclude[++ne] = nil;
  59. break;
  60. default:
  61. DEBUG(DFD, "ignoring pattern %s\n", line);
  62. break;
  63. }
  64. }
  65. Bterm(f);
  66. }
  67. int
  68. excludefile(char *path)
  69. {
  70. Reprog **re;
  71. char *p;
  72. if(*(path+1) == 0)
  73. p = "/";
  74. else
  75. p = path+1;
  76. DEBUG(DFD, "checking %s\n", path);
  77. for(re = include; *re != nil; re++){
  78. if(regexec(*re, p, nil, 0) != 1){
  79. DEBUG(DFD, "excluded+ %s\n", path);
  80. return -1;
  81. }
  82. }
  83. for(re = exclude; *re != nil; re++){
  84. if(regexec(*re, p, nil, 0) == 1){
  85. DEBUG(DFD, "excluded- %s\n", path);
  86. return -1;
  87. }
  88. }
  89. return 0;
  90. }
  91. int
  92. preaddir(Fid *f, uchar *data, int n, vlong offset)
  93. {
  94. int r = 0, m;
  95. Dir *d;
  96. DEBUG(DFD, "\tpreaddir n=%d wo=%lld fo=%lld\n", n, offset, f->offset);
  97. if(offset == 0 && f->offset != 0){
  98. if(seek(f->fid, 0, 0) != 0)
  99. return -1;
  100. f->offset = f->cdir = f->ndir = 0;
  101. free(f->dir);
  102. f->dir = nil;
  103. }else if(offset != f->offset){
  104. werrstr("can't seek dir %lld to %lld", f->offset, offset);
  105. return -1;
  106. }
  107. while(n > 0){
  108. if(f->dir == nil){
  109. f->ndir = dirread(f->fid, &f->dir);
  110. if(f->ndir < 0)
  111. return f->ndir;
  112. if(f->ndir == 0)
  113. return r;
  114. }
  115. d = &f->dir[f->cdir++];
  116. if(exclude){
  117. char *p = makepath(f->f, d->name);
  118. if(excludefile(p)){
  119. free(p);
  120. goto skipentry;
  121. }
  122. free(p);
  123. }
  124. m = convD2M(d, data, n);
  125. DEBUG(DFD, "\t\tconvD2M %d\n", m);
  126. if(m <= BIT16SZ){
  127. DEBUG(DFD, "\t\t\tneeded %d\n", GBIT16(data));
  128. /* not enough room for full entry; leave for next time */
  129. f->cdir--;
  130. return r;
  131. }else{
  132. data += m;
  133. n -= m;
  134. r += m;
  135. f->offset += m;
  136. }
  137. skipentry: if(f->cdir >= f->ndir){
  138. f->cdir = f->ndir = 0;
  139. free(f->dir);
  140. f->dir = nil;
  141. }
  142. }
  143. return r;
  144. }