ramfs.c 16 KB

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