ramfs.c 16 KB

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