ramfs.c 16 KB

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