ramfs.c 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871
  1. #include <u.h>
  2. #include <libc.h>
  3. #include <auth.h>
  4. #include <fcall.h>
  5. /*
  6. * Rather than reading /adm/users, which is a lot of work for
  7. * a toy program, we assume all groups have the form
  8. * NNN:user:user:
  9. * meaning that each user is the leader of his own group.
  10. */
  11. enum
  12. {
  13. OPERM = 0x3, /* mask of all permission types in open mode */
  14. Nram = 2048,
  15. Maxsize = 768*1024*1024,
  16. Maxfdata = 8192,
  17. };
  18. typedef struct Fid Fid;
  19. typedef struct Ram Ram;
  20. struct Fid
  21. {
  22. short busy;
  23. short open;
  24. short rclose;
  25. int fid;
  26. Fid *next;
  27. char *user;
  28. Ram *ram;
  29. };
  30. struct Ram
  31. {
  32. short busy;
  33. short open;
  34. long parent; /* index in Ram array */
  35. Qid qid;
  36. long perm;
  37. char *name;
  38. ulong atime;
  39. ulong mtime;
  40. char *user;
  41. char *group;
  42. char *muid;
  43. char *data;
  44. long ndata;
  45. };
  46. enum
  47. {
  48. Pexec = 1,
  49. Pwrite = 2,
  50. Pread = 4,
  51. Pother = 1,
  52. Pgroup = 8,
  53. Powner = 64,
  54. };
  55. ulong path; /* incremented for each new file */
  56. Fid *fids;
  57. Ram ram[Nram];
  58. int nram;
  59. int mfd[2];
  60. char *user;
  61. uchar mdata[IOHDRSZ+Maxfdata];
  62. uchar rdata[Maxfdata]; /* buffer for data in reply */
  63. uchar statbuf[STATMAX];
  64. Fcall thdr;
  65. Fcall rhdr;
  66. int messagesize = sizeof mdata;
  67. Fid * newfid(int);
  68. uint ramstat(Ram*, uchar*, uint);
  69. void error(char*);
  70. void io(void);
  71. void *erealloc(void*, ulong);
  72. void *emalloc(ulong);
  73. char *estrdup(char*);
  74. void usage(void);
  75. int perm(Fid*, Ram*, int);
  76. char *rflush(Fid*), *rversion(Fid*), *rauth(Fid*),
  77. *rattach(Fid*), *rwalk(Fid*),
  78. *ropen(Fid*), *rcreate(Fid*),
  79. *rread(Fid*), *rwrite(Fid*), *rclunk(Fid*),
  80. *rremove(Fid*), *rstat(Fid*), *rwstat(Fid*);
  81. char *(*fcalls[])(Fid*) = {
  82. [Tversion] rversion,
  83. [Tflush] rflush,
  84. [Tauth] rauth,
  85. [Tattach] rattach,
  86. [Twalk] rwalk,
  87. [Topen] ropen,
  88. [Tcreate] rcreate,
  89. [Tread] rread,
  90. [Twrite] rwrite,
  91. [Tclunk] rclunk,
  92. [Tremove] rremove,
  93. [Tstat] rstat,
  94. [Twstat] rwstat,
  95. };
  96. char Eperm[] = "permission denied";
  97. char Enotdir[] = "not a directory";
  98. char Enoauth[] = "ramfs: authentication not required";
  99. char Enotexist[] = "file does not exist";
  100. char Einuse[] = "file in use";
  101. char Eexist[] = "file exists";
  102. char Eisdir[] = "file is a directory";
  103. char Enotowner[] = "not owner";
  104. char Eisopen[] = "file already open for I/O";
  105. char Excl[] = "exclusive use file already open";
  106. char Ename[] = "illegal name";
  107. char Eversion[] = "unknown 9P version";
  108. char Enotempty[] = "directory not empty";
  109. int debug;
  110. int private;
  111. void
  112. notifyf(void *a, char *s)
  113. {
  114. USED(a);
  115. if(strncmp(s, "interrupt", 9) == 0)
  116. noted(NCONT);
  117. noted(NDFLT);
  118. }
  119. void
  120. main(int argc, char *argv[])
  121. {
  122. Ram *r;
  123. char *defmnt;
  124. int p[2];
  125. int fd;
  126. int stdio = 0;
  127. char *service;
  128. service = "ramfs";
  129. defmnt = "/tmp";
  130. ARGBEGIN{
  131. case 'D':
  132. debug = 1;
  133. break;
  134. case 'i':
  135. defmnt = 0;
  136. stdio = 1;
  137. mfd[0] = 0;
  138. mfd[1] = 1;
  139. break;
  140. case 's':
  141. defmnt = 0;
  142. break;
  143. case 'm':
  144. defmnt = ARGF();
  145. break;
  146. case 'p':
  147. private++;
  148. break;
  149. case 'S':
  150. defmnt = 0;
  151. service = EARGF(usage());
  152. break;
  153. default:
  154. usage();
  155. }ARGEND
  156. if(pipe(p) < 0)
  157. error("pipe failed");
  158. if(!stdio){
  159. mfd[0] = p[0];
  160. mfd[1] = p[0];
  161. if(defmnt == 0){
  162. char buf[64];
  163. snprint(buf, sizeof buf, "#s/%s", service);
  164. fd = create(buf, OWRITE, 0666);
  165. if(fd < 0)
  166. error("create failed");
  167. sprint(buf, "%d", p[1]);
  168. if(write(fd, buf, strlen(buf)) < 0)
  169. error("writing service file");
  170. }
  171. }
  172. user = getuser();
  173. notify(notifyf);
  174. nram = 1;
  175. r = &ram[0];
  176. r->busy = 1;
  177. r->data = 0;
  178. r->ndata = 0;
  179. r->perm = DMDIR | 0775;
  180. r->qid.type = QTDIR;
  181. r->qid.path = 0LL;
  182. r->qid.vers = 0;
  183. r->parent = 0;
  184. r->user = user;
  185. r->group = user;
  186. r->muid = user;
  187. r->atime = time(0);
  188. r->mtime = r->atime;
  189. r->name = estrdup(".");
  190. if(debug)
  191. fmtinstall('F', fcallfmt);
  192. switch(rfork(RFFDG|RFPROC|RFNAMEG|RFNOTEG)){
  193. case -1:
  194. error("fork");
  195. case 0:
  196. close(p[1]);
  197. io();
  198. break;
  199. default:
  200. close(p[0]); /* don't deadlock if child fails */
  201. if(defmnt && mount(p[1], -1, defmnt, MREPL|MCREATE, "") < 0)
  202. error("mount failed");
  203. }
  204. exits(0);
  205. }
  206. char*
  207. rversion(Fid*)
  208. {
  209. Fid *f;
  210. for(f = fids; f; f = f->next)
  211. if(f->busy)
  212. rclunk(f);
  213. if(thdr.msize > sizeof mdata)
  214. rhdr.msize = sizeof mdata;
  215. else
  216. rhdr.msize = thdr.msize;
  217. messagesize = rhdr.msize;
  218. if(strncmp(thdr.version, "9P2000", 6) != 0)
  219. return Eversion;
  220. rhdr.version = "9P2000";
  221. return 0;
  222. }
  223. char*
  224. rauth(Fid*)
  225. {
  226. return "ramfs: no authentication required";
  227. }
  228. char*
  229. rflush(Fid *f)
  230. {
  231. USED(f);
  232. return 0;
  233. }
  234. char*
  235. rattach(Fid *f)
  236. {
  237. /* no authentication! */
  238. f->busy = 1;
  239. f->rclose = 0;
  240. f->ram = &ram[0];
  241. rhdr.qid = f->ram->qid;
  242. if(thdr.uname[0])
  243. f->user = estrdup(thdr.uname);
  244. else
  245. f->user = "none";
  246. if(strcmp(user, "none") == 0)
  247. user = f->user;
  248. return 0;
  249. }
  250. char*
  251. clone(Fid *f, Fid **nf)
  252. {
  253. if(f->open)
  254. return Eisopen;
  255. if(f->ram->busy == 0)
  256. return Enotexist;
  257. *nf = newfid(thdr.newfid);
  258. (*nf)->busy = 1;
  259. (*nf)->open = 0;
  260. (*nf)->rclose = 0;
  261. (*nf)->ram = f->ram;
  262. (*nf)->user = f->user; /* no ref count; the leakage is minor */
  263. return 0;
  264. }
  265. char*
  266. rwalk(Fid *f)
  267. {
  268. Ram *r, *fram;
  269. char *name;
  270. Ram *parent;
  271. Fid *nf;
  272. char *err;
  273. ulong t;
  274. int i;
  275. err = nil;
  276. nf = nil;
  277. rhdr.nwqid = 0;
  278. if(thdr.newfid != thdr.fid){
  279. err = clone(f, &nf);
  280. if(err)
  281. return err;
  282. f = nf; /* walk the new fid */
  283. }
  284. fram = f->ram;
  285. if(thdr.nwname > 0){
  286. t = time(0);
  287. for(i=0; i<thdr.nwname && i<MAXWELEM; i++){
  288. if((fram->qid.type & QTDIR) == 0){
  289. err = Enotdir;
  290. break;
  291. }
  292. if(fram->busy == 0){
  293. err = Enotexist;
  294. break;
  295. }
  296. fram->atime = t;
  297. name = thdr.wname[i];
  298. if(strcmp(name, ".") == 0){
  299. Found:
  300. rhdr.nwqid++;
  301. rhdr.wqid[i] = fram->qid;
  302. continue;
  303. }
  304. parent = &ram[fram->parent];
  305. if(!perm(f, parent, Pexec)){
  306. err = Eperm;
  307. break;
  308. }
  309. if(strcmp(name, "..") == 0){
  310. fram = parent;
  311. goto Found;
  312. }
  313. for(r=ram; r < &ram[nram]; r++)
  314. if(r->busy && r->parent==fram-ram && strcmp(name, r->name)==0){
  315. fram = r;
  316. goto Found;
  317. }
  318. break;
  319. }
  320. if(i==0 && err == nil)
  321. err = Enotexist;
  322. }
  323. if(nf != nil && (err!=nil || rhdr.nwqid<thdr.nwname)){
  324. /* clunk the new fid, which is the one we walked */
  325. f->busy = 0;
  326. f->ram = nil;
  327. }
  328. if(rhdr.nwqid == thdr.nwname) /* update the fid after a successful walk */
  329. f->ram = fram;
  330. return err;
  331. }
  332. char *
  333. ropen(Fid *f)
  334. {
  335. Ram *r;
  336. int mode, trunc;
  337. if(f->open)
  338. return Eisopen;
  339. r = f->ram;
  340. if(r->busy == 0)
  341. return Enotexist;
  342. if(r->perm & DMEXCL)
  343. if(r->open)
  344. return Excl;
  345. mode = thdr.mode;
  346. if(r->qid.type & QTDIR){
  347. if(mode != OREAD)
  348. return Eperm;
  349. rhdr.qid = r->qid;
  350. return 0;
  351. }
  352. if(mode & ORCLOSE){
  353. /* can't remove root; must be able to write parent */
  354. if(r->qid.path==0 || !perm(f, &ram[r->parent], Pwrite))
  355. return Eperm;
  356. f->rclose = 1;
  357. }
  358. trunc = mode & OTRUNC;
  359. mode &= OPERM;
  360. if(mode==OWRITE || mode==ORDWR || trunc)
  361. if(!perm(f, r, Pwrite))
  362. return Eperm;
  363. if(mode==OREAD || mode==ORDWR)
  364. if(!perm(f, r, Pread))
  365. return Eperm;
  366. if(mode==OEXEC)
  367. if(!perm(f, r, Pexec))
  368. return Eperm;
  369. if(trunc && (r->perm&DMAPPEND)==0){
  370. r->ndata = 0;
  371. if(r->data)
  372. free(r->data);
  373. r->data = 0;
  374. r->qid.vers++;
  375. }
  376. rhdr.qid = r->qid;
  377. rhdr.iounit = messagesize-IOHDRSZ;
  378. f->open = 1;
  379. r->open++;
  380. return 0;
  381. }
  382. char *
  383. rcreate(Fid *f)
  384. {
  385. Ram *r;
  386. char *name;
  387. long parent, prm;
  388. if(f->open)
  389. return Eisopen;
  390. if(f->ram->busy == 0)
  391. return Enotexist;
  392. parent = f->ram - ram;
  393. if((f->ram->qid.type&QTDIR) == 0)
  394. return Enotdir;
  395. /* must be able to write parent */
  396. if(!perm(f, f->ram, Pwrite))
  397. return Eperm;
  398. prm = thdr.perm;
  399. name = thdr.name;
  400. if(strcmp(name, ".")==0 || strcmp(name, "..")==0)
  401. return Ename;
  402. for(r=ram; r<&ram[nram]; r++)
  403. if(r->busy && parent==r->parent)
  404. if(strcmp((char*)name, r->name)==0)
  405. return Einuse;
  406. for(r=ram; r->busy; r++)
  407. if(r == &ram[Nram-1])
  408. return "no free ram resources";
  409. r->busy = 1;
  410. r->qid.path = ++path;
  411. r->qid.vers = 0;
  412. if(prm & DMDIR)
  413. r->qid.type |= QTDIR;
  414. r->parent = parent;
  415. free(r->name);
  416. r->name = estrdup(name);
  417. r->user = f->user;
  418. r->group = f->ram->group;
  419. r->muid = f->ram->muid;
  420. if(prm & DMDIR)
  421. prm = (prm&~0777) | (f->ram->perm&prm&0777);
  422. else
  423. prm = (prm&(~0777|0111)) | (f->ram->perm&prm&0666);
  424. r->perm = prm;
  425. r->ndata = 0;
  426. if(r-ram >= nram)
  427. nram = r - ram + 1;
  428. r->atime = time(0);
  429. r->mtime = r->atime;
  430. f->ram->mtime = r->atime;
  431. f->ram = r;
  432. rhdr.qid = r->qid;
  433. rhdr.iounit = messagesize-IOHDRSZ;
  434. f->open = 1;
  435. if(thdr.mode & ORCLOSE)
  436. f->rclose = 1;
  437. r->open++;
  438. return 0;
  439. }
  440. char*
  441. rread(Fid *f)
  442. {
  443. Ram *r;
  444. uchar *buf;
  445. long off;
  446. int n, m, cnt;
  447. if(f->ram->busy == 0)
  448. return Enotexist;
  449. n = 0;
  450. rhdr.count = 0;
  451. off = thdr.offset;
  452. buf = rdata;
  453. cnt = thdr.count;
  454. if(cnt > messagesize) /* shouldn't happen, anyway */
  455. cnt = messagesize;
  456. if(f->ram->qid.type & QTDIR){
  457. for(r=ram+1; off > 0; r++){
  458. if(r->busy && r->parent==f->ram-ram)
  459. off -= ramstat(r, statbuf, sizeof statbuf);
  460. if(r == &ram[nram-1])
  461. return 0;
  462. }
  463. for(; r<&ram[nram] && n < cnt; r++){
  464. if(!r->busy || r->parent!=f->ram-ram)
  465. continue;
  466. m = ramstat(r, buf+n, cnt-n);
  467. if(m == 0)
  468. break;
  469. n += m;
  470. }
  471. rhdr.data = (char*)rdata;
  472. rhdr.count = n;
  473. return 0;
  474. }
  475. r = f->ram;
  476. if(off >= r->ndata)
  477. return 0;
  478. r->atime = time(0);
  479. n = cnt;
  480. if(off+n > r->ndata)
  481. n = r->ndata - off;
  482. rhdr.data = r->data+off;
  483. rhdr.count = n;
  484. return 0;
  485. }
  486. char*
  487. rwrite(Fid *f)
  488. {
  489. Ram *r;
  490. ulong off;
  491. int cnt;
  492. r = f->ram;
  493. if(r->busy == 0)
  494. return Enotexist;
  495. off = thdr.offset;
  496. if(r->perm & DMAPPEND)
  497. off = r->ndata;
  498. cnt = thdr.count;
  499. if(r->qid.type & QTDIR)
  500. return Eisdir;
  501. if(off+cnt >= Maxsize) /* sanity check */
  502. return "write too big";
  503. if(off+cnt > r->ndata)
  504. r->data = erealloc(r->data, off+cnt);
  505. if(off > r->ndata)
  506. memset(r->data+r->ndata, 0, off-r->ndata);
  507. if(off+cnt > r->ndata)
  508. r->ndata = off+cnt;
  509. memmove(r->data+off, thdr.data, cnt);
  510. r->qid.vers++;
  511. r->mtime = time(0);
  512. rhdr.count = cnt;
  513. return 0;
  514. }
  515. static int
  516. emptydir(Ram *dr)
  517. {
  518. long didx = dr - ram;
  519. Ram *r;
  520. for(r=ram; r<&ram[nram]; r++)
  521. if(r->busy && didx==r->parent)
  522. return 0;
  523. return 1;
  524. }
  525. char *
  526. realremove(Ram *r)
  527. {
  528. if(r->qid.type & QTDIR && !emptydir(r))
  529. return Enotempty;
  530. r->ndata = 0;
  531. if(r->data)
  532. free(r->data);
  533. r->data = 0;
  534. r->parent = 0;
  535. memset(&r->qid, 0, sizeof r->qid);
  536. free(r->name);
  537. r->name = nil;
  538. r->busy = 0;
  539. return nil;
  540. }
  541. char *
  542. rclunk(Fid *f)
  543. {
  544. char *e = nil;
  545. if(f->open)
  546. f->ram->open--;
  547. if(f->rclose)
  548. e = realremove(f->ram);
  549. f->busy = 0;
  550. f->open = 0;
  551. f->ram = 0;
  552. return e;
  553. }
  554. char *
  555. rremove(Fid *f)
  556. {
  557. Ram *r;
  558. if(f->open)
  559. f->ram->open--;
  560. f->busy = 0;
  561. f->open = 0;
  562. r = f->ram;
  563. f->ram = 0;
  564. if(r->qid.path == 0 || !perm(f, &ram[r->parent], Pwrite))
  565. return Eperm;
  566. ram[r->parent].mtime = time(0);
  567. return realremove(r);
  568. }
  569. char *
  570. rstat(Fid *f)
  571. {
  572. if(f->ram->busy == 0)
  573. return Enotexist;
  574. rhdr.nstat = ramstat(f->ram, statbuf, sizeof statbuf);
  575. rhdr.stat = statbuf;
  576. return 0;
  577. }
  578. char *
  579. rwstat(Fid *f)
  580. {
  581. Ram *r, *s;
  582. Dir dir;
  583. if(f->ram->busy == 0)
  584. return Enotexist;
  585. convM2D(thdr.stat, thdr.nstat, &dir, (char*)statbuf);
  586. r = f->ram;
  587. /*
  588. * To change length, must have write permission on file.
  589. */
  590. if(dir.length!=~0 && dir.length!=r->ndata){
  591. if(!perm(f, r, Pwrite))
  592. return Eperm;
  593. }
  594. /*
  595. * To change name, must have write permission in parent
  596. * and name must be unique.
  597. */
  598. if(dir.name[0]!='\0' && strcmp(dir.name, r->name)!=0){
  599. if(!perm(f, &ram[r->parent], Pwrite))
  600. return Eperm;
  601. for(s=ram; s<&ram[nram]; s++)
  602. if(s->busy && s->parent==r->parent)
  603. if(strcmp(dir.name, s->name)==0)
  604. return Eexist;
  605. }
  606. /*
  607. * To change mode, must be owner or group leader.
  608. * Because of lack of users file, leader=>group itself.
  609. */
  610. if(dir.mode!=~0 && r->perm!=dir.mode){
  611. if(strcmp(f->user, r->user) != 0)
  612. if(strcmp(f->user, r->group) != 0)
  613. return Enotowner;
  614. }
  615. /*
  616. * To change group, must be owner and member of new group,
  617. * or leader of current group and leader of new group.
  618. * Second case cannot happen, but we check anyway.
  619. */
  620. if(dir.gid[0]!='\0' && strcmp(r->group, dir.gid)!=0){
  621. if(strcmp(f->user, r->user) == 0)
  622. // if(strcmp(f->user, dir.gid) == 0)
  623. goto ok;
  624. if(strcmp(f->user, r->group) == 0)
  625. if(strcmp(f->user, dir.gid) == 0)
  626. goto ok;
  627. return Enotowner;
  628. ok:;
  629. }
  630. /* all ok; do it */
  631. if(dir.mode != ~0){
  632. dir.mode &= ~DMDIR; /* cannot change dir bit */
  633. dir.mode |= r->perm&DMDIR;
  634. r->perm = dir.mode;
  635. }
  636. if(dir.name[0] != '\0'){
  637. free(r->name);
  638. r->name = estrdup(dir.name);
  639. }
  640. if(dir.gid[0] != '\0')
  641. r->group = estrdup(dir.gid);
  642. if(dir.length!=~0 && dir.length!=r->ndata){
  643. r->data = erealloc(r->data, dir.length);
  644. if(r->ndata < dir.length)
  645. memset(r->data+r->ndata, 0, dir.length-r->ndata);
  646. r->ndata = dir.length;
  647. }
  648. ram[r->parent].mtime = time(0);
  649. return 0;
  650. }
  651. uint
  652. ramstat(Ram *r, uchar *buf, uint nbuf)
  653. {
  654. int n;
  655. Dir dir;
  656. dir.name = r->name;
  657. dir.qid = r->qid;
  658. dir.mode = r->perm;
  659. dir.length = r->ndata;
  660. dir.uid = r->user;
  661. dir.gid = r->group;
  662. dir.muid = r->muid;
  663. dir.atime = r->atime;
  664. dir.mtime = r->mtime;
  665. n = convD2M(&dir, buf, nbuf);
  666. if(n > 2)
  667. return n;
  668. return 0;
  669. }
  670. Fid *
  671. newfid(int fid)
  672. {
  673. Fid *f, *ff;
  674. ff = 0;
  675. for(f = fids; f; f = f->next)
  676. if(f->fid == fid)
  677. return f;
  678. else if(!ff && !f->busy)
  679. ff = f;
  680. if(ff){
  681. ff->fid = fid;
  682. return ff;
  683. }
  684. f = emalloc(sizeof *f);
  685. f->ram = nil;
  686. f->fid = fid;
  687. f->next = fids;
  688. fids = f;
  689. return f;
  690. }
  691. void
  692. io(void)
  693. {
  694. char *err, buf[40];
  695. int n, pid, ctl;
  696. pid = getpid();
  697. if(private){
  698. snprint(buf, sizeof buf, "/proc/%d/ctl", pid);
  699. ctl = open(buf, OWRITE);
  700. if(ctl < 0){
  701. fprint(2, "can't protect ramfs\n");
  702. }else{
  703. fprint(ctl, "noswap\n");
  704. fprint(ctl, "private\n");
  705. close(ctl);
  706. }
  707. }
  708. for(;;){
  709. /*
  710. * reading from a pipe or a network device
  711. * will give an error after a few eof reads.
  712. * however, we cannot tell the difference
  713. * between a zero-length read and an interrupt
  714. * on the processes writing to us,
  715. * so we wait for the error.
  716. */
  717. n = read9pmsg(mfd[0], mdata, messagesize);
  718. if(n < 0){
  719. errstr(buf, sizeof buf);
  720. if(buf[0]=='\0' || strstr(buf, "hungup"))
  721. exits("");
  722. error("mount read");
  723. }
  724. if(n < 0)
  725. error("mount read");
  726. if(n == 0)
  727. continue;
  728. if(convM2S(mdata, n, &thdr) == 0)
  729. continue;
  730. if(debug)
  731. fprint(2, "ramfs %d:<-%F\n", pid, &thdr);
  732. if(!fcalls[thdr.type])
  733. err = "bad fcall type";
  734. else
  735. err = (*fcalls[thdr.type])(newfid(thdr.fid));
  736. if(err){
  737. rhdr.type = Rerror;
  738. rhdr.ename = err;
  739. }else{
  740. rhdr.type = thdr.type + 1;
  741. rhdr.fid = thdr.fid;
  742. }
  743. rhdr.tag = thdr.tag;
  744. if(debug)
  745. fprint(2, "ramfs %d:->%F\n", pid, &rhdr);/**/
  746. n = convS2M(&rhdr, mdata, messagesize);
  747. if(n == 0)
  748. error("convS2M error on write");
  749. if(write(mfd[1], mdata, n) != n)
  750. error("mount write");
  751. }
  752. }
  753. int
  754. perm(Fid *f, Ram *r, int p)
  755. {
  756. if((p*Pother) & r->perm)
  757. return 1;
  758. if(strcmp(f->user, r->group)==0 && ((p*Pgroup) & r->perm))
  759. return 1;
  760. if(strcmp(f->user, r->user)==0 && ((p*Powner) & r->perm))
  761. return 1;
  762. return 0;
  763. }
  764. void
  765. error(char *s)
  766. {
  767. fprint(2, "%s: %s: %r\n", argv0, s);
  768. exits(s);
  769. }
  770. void *
  771. emalloc(ulong n)
  772. {
  773. void *p;
  774. p = malloc(n);
  775. if(!p)
  776. error("out of memory");
  777. memset(p, 0, n);
  778. return p;
  779. }
  780. void *
  781. erealloc(void *p, ulong n)
  782. {
  783. p = realloc(p, n);
  784. if(!p)
  785. error("out of memory");
  786. return p;
  787. }
  788. char *
  789. estrdup(char *q)
  790. {
  791. char *p;
  792. int n;
  793. n = strlen(q)+1;
  794. p = malloc(n);
  795. if(!p)
  796. error("out of memory");
  797. memmove(p, q, n);
  798. return p;
  799. }
  800. void
  801. usage(void)
  802. {
  803. fprint(2, "usage: %s [-is] [-m mountpoint]\n", argv0);
  804. exits("usage");
  805. }