revproto.c 9.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522
  1. /*
  2. * This file is part of the UCB release of Plan 9. It is subject to the license
  3. * terms in the LICENSE file found in the top-level directory of this
  4. * distribution and at http://akaros.cs.berkeley.edu/files/Plan9License. No
  5. * part of the UCB release of Plan 9, including this file, may be copied,
  6. * modified, propagated, or distributed except according to the terms contained
  7. * in the LICENSE file.
  8. */
  9. #include <u.h>
  10. #include <libc.h>
  11. #include <bio.h>
  12. #include <auth.h>
  13. #include <fcall.h>
  14. #include <disk.h>
  15. enum {
  16. LEN = 8*1024,
  17. HUNKS = 128,
  18. };
  19. typedef struct File File;
  20. struct File{
  21. char *new;
  22. char *elem;
  23. char *old;
  24. char *uid;
  25. char *gid;
  26. uint32_t mode;
  27. };
  28. typedef void Mkfserr(char*, void*);
  29. typedef void Mkfsenum(char*, char*, Dir*, void*);
  30. typedef struct Name Name;
  31. struct Name {
  32. int n;
  33. char *s;
  34. };
  35. typedef struct Mkaux Mkaux;
  36. struct Mkaux {
  37. Mkfserr *warn;
  38. Mkfsenum *mkenum;
  39. char *root;
  40. char *xroot;
  41. char *proto;
  42. jmp_buf jmp;
  43. Biobuf *b;
  44. Name oldfile;
  45. Name fullname;
  46. int lineno;
  47. int indent;
  48. void *a;
  49. };
  50. static void domkfs(Mkaux *mkaux, File *me, int level);
  51. static int copyfile(Mkaux*, File*, Dir*, int);
  52. static void freefile(File*);
  53. static File* getfile(Mkaux*, File*);
  54. static char* getmode(Mkaux*, char*, uint32_t*);
  55. static char* getname(Mkaux*, char*, char**);
  56. static char* getpath(Mkaux*, char*);
  57. static int mkfile(Mkaux*, File*);
  58. static char* mkpath(Mkaux*, char*, char*);
  59. static void mktree(Mkaux*, File*, int);
  60. static void setnames(Mkaux*, File*);
  61. static void skipdir(Mkaux*);
  62. static void warn(Mkaux*, char *, ...);
  63. //static void
  64. //mprint(char *new, char *old, Dir *d, void*)
  65. //{
  66. // print("%s %s %D\n", new, old, d);
  67. //}
  68. int
  69. revrdproto(char *proto, char *root, char *xroot, Mkfsenum *mkenum,
  70. Mkfserr *mkerr, void *a)
  71. {
  72. Mkaux mx, *m;
  73. File file;
  74. int rv;
  75. m = &mx;
  76. memset(&mx, 0, sizeof mx);
  77. if(root == nil)
  78. root = "/";
  79. m->root = root;
  80. m->xroot = xroot;
  81. m->warn = mkerr;
  82. m->mkenum = mkenum;
  83. m->a = a;
  84. m->proto = proto;
  85. m->lineno = 0;
  86. m->indent = 0;
  87. if((m->b = Bopen(proto, OREAD)) == nil) {
  88. werrstr("open '%s': %r", proto);
  89. return -1;
  90. }
  91. memset(&file, 0, sizeof file);
  92. file.new = "";
  93. file.old = nil;
  94. rv = 0;
  95. if(setjmp(m->jmp) == 0)
  96. domkfs(m, &file, -1);
  97. else
  98. rv = -1;
  99. free(m->oldfile.s);
  100. free(m->fullname.s);
  101. return rv;
  102. }
  103. static void*
  104. emalloc(Mkaux *mkaux, uint32_t n)
  105. {
  106. void *v;
  107. v = malloc(n);
  108. if(v == nil)
  109. longjmp(mkaux->jmp, 1); /* memory leak */
  110. memset(v, 0, n);
  111. return v;
  112. }
  113. static char*
  114. estrdup(Mkaux *mkaux, char *s)
  115. {
  116. s = strdup(s);
  117. if(s == nil)
  118. longjmp(mkaux->jmp, 1); /* memory leak */
  119. return s;
  120. }
  121. static void
  122. domkfs(Mkaux *mkaux, File *me, int level)
  123. {
  124. File *child;
  125. int rec;
  126. child = getfile(mkaux, me);
  127. if(!child)
  128. return;
  129. if((child->elem[0] == '+' || child->elem[0] == '*') && child->elem[1] == '\0'){
  130. rec = child->elem[0] == '+';
  131. free(child->new);
  132. child->new = estrdup(mkaux, me->new);
  133. setnames(mkaux, child);
  134. mktree(mkaux, child, rec);
  135. freefile(child);
  136. child = getfile(mkaux, me);
  137. }
  138. while(child && mkaux->indent > level){
  139. if(mkfile(mkaux, child))
  140. domkfs(mkaux, child, mkaux->indent);
  141. freefile(child);
  142. child = getfile(mkaux, me);
  143. }
  144. if(child){
  145. freefile(child);
  146. Bseek(mkaux->b, -Blinelen(mkaux->b), 1);
  147. mkaux->lineno--;
  148. }
  149. }
  150. enum {
  151. SLOP = 30
  152. };
  153. static void
  154. setname(Mkaux *mkaux, Name *name, char *s1, char *s2)
  155. {
  156. int l;
  157. l = strlen(s1)+strlen(s2)+1;
  158. if(name->n < l) {
  159. free(name->s);
  160. name->s = emalloc(mkaux, l+SLOP);
  161. name->n = l+SLOP;
  162. }
  163. snprint(name->s, name->n, "%s%s%s", s1, s2[0] && s2[0]!='/' ? "/" : "", s2);
  164. }
  165. static void
  166. mktree(Mkaux *mkaux, File *me, int rec)
  167. {
  168. File child;
  169. Dir *d;
  170. int i, n, fd;
  171. setname(mkaux, &mkaux->fullname, mkaux->root, me->new);
  172. fd = open(mkaux->fullname.s, OREAD);
  173. if(fd < 0){
  174. warn(mkaux, "can't open %s: %r", mkaux->fullname.s);
  175. return;
  176. }
  177. child = *me;
  178. while((n = dirread(fd, &d)) > 0){
  179. for(i = 0; i < n; i++){
  180. child.new = mkpath(mkaux, me->new, d[i].name);
  181. if(me->old)
  182. child.old = mkpath(mkaux, me->old, d[i].name);
  183. child.elem = d[i].name;
  184. setnames(mkaux, &child);
  185. if(copyfile(mkaux, &child, &d[i], 1) && rec)
  186. mktree(mkaux, &child, rec);
  187. free(child.new);
  188. if(child.old)
  189. free(child.old);
  190. }
  191. }
  192. close(fd);
  193. }
  194. static int
  195. mkfile(Mkaux *mkaux, File *f)
  196. {
  197. Dir *d;
  198. setname(mkaux, &mkaux->fullname, mkaux->root, f->new);
  199. if((d = dirstat(mkaux->fullname.s)) == nil){
  200. warn(mkaux, "can't stat file %s: %r", mkaux->fullname.s);
  201. skipdir(mkaux);
  202. return 0;
  203. }
  204. return copyfile(mkaux, f, d, 0);
  205. }
  206. static int
  207. copyfile(Mkaux *mkaux, File *f, Dir *d, int permonly)
  208. {
  209. Dir *nd;
  210. uint32_t xmode;
  211. char *p;
  212. /*
  213. * Extra stat here is inefficient but accounts for binds.
  214. */
  215. setname(mkaux, &mkaux->fullname, mkaux->root, f->new);
  216. if((nd = dirstat(mkaux->fullname.s)) != nil)
  217. d = nd;
  218. setname(mkaux, &mkaux->fullname, mkaux->xroot, f->old ? f->old : f->new);
  219. d->name = f->elem;
  220. if(d->type != 'M'){
  221. d->uid = "sys";
  222. d->gid = "sys";
  223. xmode = (d->mode >> 6) & 7;
  224. d->mode |= xmode | (xmode << 3);
  225. }
  226. if(strcmp(f->uid, "-") != 0)
  227. d->uid = f->uid;
  228. if(strcmp(f->gid, "-") != 0)
  229. d->gid = f->gid;
  230. if(f->mode != ~0){
  231. if(permonly)
  232. d->mode = (d->mode & ~0666) | (f->mode & 0666);
  233. else if((d->mode&DMDIR) != (f->mode&DMDIR))
  234. warn(mkaux, "inconsistent mode for %s", f->new);
  235. else
  236. d->mode = f->mode;
  237. }
  238. if(p = strrchr(f->new, '/'))
  239. d->name = p+1;
  240. else
  241. d->name = f->new;
  242. mkaux->mkenum(f->new, mkaux->fullname.s, d, mkaux->a);
  243. xmode = d->mode;
  244. free(nd);
  245. return (xmode&DMDIR) != 0;
  246. }
  247. static char *
  248. mkpath(Mkaux *mkaux, char *prefix, char *elem)
  249. {
  250. char *p;
  251. int n;
  252. n = strlen(prefix) + strlen(elem) + 2;
  253. p = emalloc(mkaux, n);
  254. strcpy(p, prefix);
  255. strcat(p, "/");
  256. strcat(p, elem);
  257. return p;
  258. }
  259. static void
  260. setnames(Mkaux *mkaux, File *f)
  261. {
  262. if(f->old){
  263. if(f->old[0] == '/')
  264. setname(mkaux, &mkaux->oldfile, f->old, "");
  265. else
  266. setname(mkaux, &mkaux->oldfile, mkaux->xroot, f->old);
  267. } else
  268. setname(mkaux, &mkaux->oldfile, mkaux->xroot, f->new);
  269. }
  270. static void
  271. freefile(File *f)
  272. {
  273. if(f->old)
  274. free(f->old);
  275. if(f->new)
  276. free(f->new);
  277. free(f);
  278. }
  279. /*
  280. * skip all files in the proto that
  281. * could be in the current dir
  282. */
  283. static void
  284. skipdir(Mkaux *mkaux)
  285. {
  286. char *p, c;
  287. int level;
  288. if(mkaux->indent < 0)
  289. return;
  290. level = mkaux->indent;
  291. for(;;){
  292. mkaux->indent = 0;
  293. p = Brdline(mkaux->b, '\n');
  294. mkaux->lineno++;
  295. if(!p){
  296. mkaux->indent = -1;
  297. return;
  298. }
  299. while((c = *p++) != '\n')
  300. if(c == ' ')
  301. mkaux->indent++;
  302. else if(c == '\t')
  303. mkaux->indent += 8;
  304. else
  305. break;
  306. if(mkaux->indent <= level){
  307. Bseek(mkaux->b, -Blinelen(mkaux->b), 1);
  308. mkaux->lineno--;
  309. return;
  310. }
  311. }
  312. }
  313. static File*
  314. getfile(Mkaux *mkaux, File *old)
  315. {
  316. File *f;
  317. char *elem;
  318. char *p;
  319. int c;
  320. if(mkaux->indent < 0)
  321. return 0;
  322. loop:
  323. mkaux->indent = 0;
  324. p = Brdline(mkaux->b, '\n');
  325. mkaux->lineno++;
  326. if(!p){
  327. mkaux->indent = -1;
  328. return 0;
  329. }
  330. while((c = *p++) != '\n')
  331. if(c == ' ')
  332. mkaux->indent++;
  333. else if(c == '\t')
  334. mkaux->indent += 8;
  335. else
  336. break;
  337. if(c == '\n' || c == '#')
  338. goto loop;
  339. p--;
  340. f = emalloc(mkaux, sizeof *f);
  341. p = getname(mkaux, p, &elem);
  342. if(p == nil)
  343. return nil;
  344. f->new = mkpath(mkaux, old->new, elem);
  345. free(elem);
  346. f->elem = utfrrune(f->new, L'/') + 1;
  347. p = getmode(mkaux, p, &f->mode);
  348. p = getname(mkaux, p, &f->uid); /* LEAK */
  349. if(p == nil)
  350. return nil;
  351. if(!*f->uid)
  352. f->uid = "-"; /* LEAK */
  353. p = getname(mkaux, p, &f->gid); /* LEAK */
  354. if(p == nil)
  355. return nil;
  356. if(!*f->gid)
  357. f->gid = "-"; /* LEAK */
  358. f->old = getpath(mkaux, p);
  359. if(f->old && strcmp(f->old, "-") == 0){
  360. free(f->old);
  361. f->old = 0;
  362. }
  363. setnames(mkaux, f);
  364. return f;
  365. }
  366. static char*
  367. getpath(Mkaux *mkaux, char *p)
  368. {
  369. char *q, *new;
  370. int c, n;
  371. while((c = *p) == ' ' || c == '\t')
  372. p++;
  373. q = p;
  374. while((c = *q) != '\n' && c != ' ' && c != '\t')
  375. q++;
  376. if(q == p)
  377. return 0;
  378. n = q - p;
  379. new = emalloc(mkaux, n + 1);
  380. memcpy(new, p, n);
  381. new[n] = 0;
  382. return new;
  383. }
  384. static char*
  385. getname(Mkaux *mkaux, char *p, char **buf)
  386. {
  387. char *s, *start;
  388. int c;
  389. while((c = *p) == ' ' || c == '\t')
  390. p++;
  391. start = p;
  392. while((c = *p) != '\n' && c != ' ' && c != '\t')
  393. p++;
  394. *buf = malloc(p+1-start);
  395. if(*buf == nil)
  396. return nil;
  397. memmove(*buf, start, p-start);
  398. (*buf)[p-start] = '\0';
  399. if(**buf == '$'){
  400. s = getenv(*buf+1);
  401. if(s == 0){
  402. warn(mkaux, "can't read environment variable %s", *buf+1);
  403. skipdir(mkaux);
  404. free(*buf);
  405. return nil;
  406. }
  407. free(*buf);
  408. *buf = s;
  409. }
  410. return p;
  411. }
  412. static char*
  413. getmode(Mkaux *mkaux, char *p, uint32_t *xmode)
  414. {
  415. char *buf, *s;
  416. uint32_t m;
  417. *xmode = ~0;
  418. p = getname(mkaux, p, &buf);
  419. if(p == nil)
  420. return nil;
  421. s = buf;
  422. if(!*s || strcmp(s, "-") == 0)
  423. return p;
  424. m = 0;
  425. if(*s == 'd'){
  426. m |= DMDIR;
  427. s++;
  428. }
  429. if(*s == 'a'){
  430. m |= DMAPPEND;
  431. s++;
  432. }
  433. if(*s == 'l'){
  434. m |= DMEXCL;
  435. s++;
  436. }
  437. if(s[0] < '0' || s[0] > '7'
  438. || s[1] < '0' || s[1] > '7'
  439. || s[2] < '0' || s[2] > '7'
  440. || s[3]){
  441. warn(mkaux, "bad mode specification %s", buf);
  442. free(buf);
  443. return p;
  444. }
  445. *xmode = m | strtoul(s, 0, 8);
  446. free(buf);
  447. return p;
  448. }
  449. static void
  450. warn(Mkaux *mkaux, char *fmt, ...)
  451. {
  452. char buf[256];
  453. va_list va;
  454. va_start(va, fmt);
  455. vseprint(buf, buf+sizeof(buf), fmt, va);
  456. va_end(va);
  457. if(mkaux->warn)
  458. mkaux->warn(buf, mkaux->a);
  459. else
  460. fprint(2, "warning: %s\n", buf);
  461. }