disksim.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676
  1. #include <u.h>
  2. #include <libc.h>
  3. #include <auth.h>
  4. #include <fcall.h>
  5. #include <thread.h>
  6. #include <9p.h>
  7. typedef struct Part Part;
  8. typedef struct Trip Trip;
  9. typedef struct Dbl Dbl;
  10. typedef struct Ind Ind;
  11. /*
  12. * with 8192-byte blocks and 4-byte pointers,
  13. * double-indirect gets us 34 GB.
  14. * triple-indirect gets us 70,368 GB.
  15. */
  16. enum
  17. {
  18. LOGBLKSZ = 13,
  19. BLKSZ = 1<<LOGBLKSZ, /* 8192 */
  20. LOGNPTR = LOGBLKSZ-2, /* assume sizeof(void*) == 4 */
  21. NPTR = 1<<LOGNPTR,
  22. };
  23. static uchar zero[BLKSZ];
  24. struct Trip
  25. {
  26. Dbl *dbl[NPTR];
  27. };
  28. struct Dbl
  29. {
  30. Ind *ind[NPTR];
  31. };
  32. struct Ind
  33. {
  34. uchar *blk[NPTR];
  35. };
  36. Trip trip;
  37. struct Part
  38. {
  39. int inuse;
  40. int vers;
  41. ulong mode;
  42. char *name;
  43. vlong offset; /* in sectors */
  44. vlong length; /* in sectors */
  45. };
  46. enum
  47. {
  48. Qroot = 0,
  49. Qdir,
  50. Qctl,
  51. Qpart,
  52. };
  53. Part tab[64];
  54. int fd = -1;
  55. char *sdname = "sdXX";
  56. ulong ctlmode = 0666;
  57. char *inquiry = "aux/disksim hard drive";
  58. vlong nsect, sectsize, c, h, s;
  59. ulong time0;
  60. int rdonly;
  61. char*
  62. ctlstring(void)
  63. {
  64. int i;
  65. Fmt fmt;
  66. fmtstrinit(&fmt);
  67. fmtprint(&fmt, "inquiry %s\n", inquiry);
  68. fmtprint(&fmt, "geometry %lld %lld %lld %lld %lld\n", nsect, sectsize, c, h, s);
  69. for(i=0; i<nelem(tab); i++)
  70. if(tab[i].inuse)
  71. fmtprint(&fmt, "part %s %lld %lld\n", tab[i].name, tab[i].offset, tab[i].length);
  72. return fmtstrflush(&fmt);
  73. }
  74. int
  75. addpart(char *name, vlong start, vlong end)
  76. {
  77. int i;
  78. if(start < 0 || start > end || end > nsect){
  79. werrstr("bad partition boundaries");
  80. return -1;
  81. }
  82. for(i=0; i<nelem(tab); i++)
  83. if(tab[i].inuse == 0)
  84. break;
  85. if(i == nelem(tab)){
  86. werrstr("no free partition slots");
  87. return -1;
  88. }
  89. free(tab[i].name);
  90. tab[i].inuse = 1;
  91. tab[i].name = estrdup9p(name);
  92. tab[i].offset = start;
  93. tab[i].length = end - start;
  94. tab[i].mode = ctlmode;
  95. tab[i].vers++;
  96. return 0;
  97. }
  98. int
  99. delpart(char *s)
  100. {
  101. int i;
  102. for(i=0; i<nelem(tab); i++)
  103. if(tab[i].inuse && strcmp(tab[i].name, s) == 0)
  104. break;
  105. if(i==nelem(tab)){
  106. werrstr("partition not found");
  107. return -1;
  108. }
  109. tab[i].inuse = 0;
  110. free(tab[i].name);
  111. tab[i].name = 0;
  112. return 0;
  113. }
  114. void
  115. ctlwrite(Req *r)
  116. {
  117. int i;
  118. Cmdbuf *cb;
  119. vlong start, end;
  120. r->ofcall.count = r->ifcall.count;
  121. cb = parsecmd(r->ifcall.data, r->ifcall.count);
  122. if(cb->nf < 1){
  123. respond(r, "empty control message");
  124. free(cb);
  125. return;
  126. }
  127. if(strcmp(cb->f[0], "part") == 0){
  128. if(cb->nf != 4){
  129. respondcmderror(r, cb, "part takes 3 args");
  130. free(cb);
  131. return;
  132. }
  133. start = strtoll(cb->f[2], 0, 0);
  134. end = strtoll(cb->f[3], 0, 0);
  135. if(addpart(cb->f[1], start, end) < 0){
  136. respondcmderror(r, cb, "%r");
  137. free(cb);
  138. return;
  139. }
  140. }
  141. else if(strcmp(cb->f[0], "delpart") == 0){
  142. if(cb->nf != 2){
  143. respondcmderror(r, cb, "delpart takes 1 arg");
  144. free(cb);
  145. return;
  146. }
  147. if(delpart(cb->f[1]) < 0){
  148. respondcmderror(r, cb, "%r");
  149. free(cb);
  150. return;
  151. }
  152. }
  153. else if(strcmp(cb->f[0], "inquiry") == 0){
  154. if(cb->nf != 2){
  155. respondcmderror(r, cb, "inquiry takes 1 arg");
  156. free(cb);
  157. return;
  158. }
  159. free(inquiry);
  160. inquiry = estrdup9p(cb->f[1]);
  161. }
  162. else if(strcmp(cb->f[0], "geometry") == 0){
  163. if(cb->nf != 6){
  164. respondcmderror(r, cb, "geometry takes 5 args");
  165. free(cb);
  166. return;
  167. }
  168. nsect = strtoll(cb->f[1], 0, 0);
  169. sectsize = strtoll(cb->f[2], 0, 0);
  170. c = strtoll(cb->f[3], 0, 0);
  171. h = strtoll(cb->f[4], 0, 0);
  172. s = strtoll(cb->f[5], 0, 0);
  173. if(tab[0].inuse && strcmp(tab[0].name, "data") == 0 && tab[0].vers == 0){
  174. tab[0].offset = 0;
  175. tab[0].length = nsect;
  176. }
  177. for(i=0; i<nelem(tab); i++){
  178. if(tab[i].inuse && tab[i].offset+tab[i].length > nsect){
  179. tab[i].inuse = 0;
  180. free(tab[i].name);
  181. tab[i].name = 0;
  182. }
  183. }
  184. }
  185. else{
  186. respondcmderror(r, cb, "unknown control message");
  187. free(cb);
  188. return;
  189. }
  190. free(cb);
  191. respond(r, nil);
  192. }
  193. void*
  194. allocblk(vlong addr)
  195. {
  196. uchar *op;
  197. static uchar *p;
  198. static ulong n;
  199. if(n == 0){
  200. p = malloc(4*1024*1024);
  201. if(p == 0)
  202. sysfatal("out of memory");
  203. n = 4*1024*1024;
  204. }
  205. op = p;
  206. p += BLKSZ;
  207. n -= BLKSZ;
  208. memset(op, 0, BLKSZ);
  209. if(fd != -1 && addr != -1)
  210. pread(fd, op, BLKSZ, addr);
  211. return op;
  212. }
  213. uchar*
  214. getblock(vlong addr, int alloc)
  215. {
  216. Dbl *p2;
  217. Ind *p1;
  218. uchar *p0;
  219. uint i0, i1, i2;
  220. vlong oaddr;
  221. if(fd >= 0)
  222. alloc = 1;
  223. addr >>= LOGBLKSZ;
  224. oaddr = addr<<LOGBLKSZ;
  225. i0 = addr & (NPTR-1);
  226. addr >>= LOGNPTR;
  227. i1 = addr & (NPTR-1);
  228. addr >>= LOGNPTR;
  229. i2 = addr & (NPTR-1);
  230. addr >>= LOGNPTR;
  231. assert(addr == 0);
  232. if((p2 = trip.dbl[i2]) == 0){
  233. if(!alloc)
  234. return zero;
  235. trip.dbl[i2] = p2 = allocblk(-1);
  236. }
  237. if((p1 = p2->ind[i1]) == 0){
  238. if(!alloc)
  239. return zero;
  240. p2->ind[i1] = p1 = allocblk(-1);
  241. }
  242. if((p0 = p1->blk[i0]) == 0){
  243. if(!alloc)
  244. return zero;
  245. p1->blk[i0] = p0 = allocblk(oaddr);
  246. }
  247. return p0;
  248. }
  249. void
  250. dirty(vlong addr, uchar *buf)
  251. {
  252. vlong oaddr;
  253. if(fd == -1 || rdonly)
  254. return;
  255. oaddr = addr&~((vlong)BLKSZ-1);
  256. if(pwrite(fd, buf, BLKSZ, oaddr) != BLKSZ)
  257. sysfatal("write: %r");
  258. }
  259. int
  260. rootgen(int off, Dir *d, void*)
  261. {
  262. memset(d, 0, sizeof *d);
  263. d->atime = time0;
  264. d->mtime = time0;
  265. if(off == 0){
  266. d->name = estrdup9p(sdname);
  267. d->mode = DMDIR|0777;
  268. d->qid.path = Qdir;
  269. d->qid.type = QTDIR;
  270. d->uid = estrdup9p("disksim");
  271. d->gid = estrdup9p("disksim");
  272. d->muid = estrdup9p("");
  273. return 0;
  274. }
  275. return -1;
  276. }
  277. int
  278. dirgen(int off, Dir *d, void*)
  279. {
  280. int n, j;
  281. memset(d, 0, sizeof *d);
  282. d->atime = time0;
  283. d->mtime = time0;
  284. if(off == 0){
  285. d->name = estrdup9p("ctl");
  286. d->mode = ctlmode;
  287. d->qid.path = Qctl;
  288. goto Have;
  289. }
  290. off--;
  291. n = 0;
  292. for(j=0; j<nelem(tab); j++){
  293. if(tab[j].inuse==0)
  294. continue;
  295. if(n == off){
  296. d->name = estrdup9p(tab[j].name);
  297. d->length = tab[j].length*sectsize;
  298. d->mode = tab[j].mode;
  299. d->qid.path = Qpart+j;
  300. d->qid.vers = tab[j].vers;
  301. goto Have;
  302. }
  303. n++;
  304. }
  305. return -1;
  306. Have:
  307. d->uid = estrdup9p("disksim");
  308. d->gid = estrdup9p("disksim");
  309. d->muid = estrdup9p("");
  310. return 0;
  311. }
  312. void*
  313. evommem(void *a, void *b, ulong n)
  314. {
  315. return memmove(b, a, n);
  316. }
  317. int
  318. isnonzero(void *v, ulong n)
  319. {
  320. uchar *a, *ea;
  321. a = v;
  322. ea = a+n;
  323. for(; a<ea; a++)
  324. if(*a)
  325. return 1;
  326. return 0;
  327. }
  328. int
  329. rdwrpart(Req *r)
  330. {
  331. int q, nonzero;
  332. Part *p;
  333. vlong offset;
  334. long count, tot, n, o;
  335. uchar *blk, *dat;
  336. void *(*move)(void*, void*, ulong);
  337. q = r->fid->qid.path-Qpart;
  338. if(q < 0 || q > nelem(tab) || !tab[q].inuse || tab[q].vers != r->fid->qid.vers){
  339. respond(r, "unknown partition");
  340. return -1;
  341. }
  342. p = &tab[q];
  343. offset = r->ifcall.offset;
  344. count = r->ifcall.count;
  345. if(offset < 0){
  346. respond(r, "negative offset");
  347. return -1;
  348. }
  349. if(count < 0){
  350. respond(r, "negative count");
  351. return -1;
  352. }
  353. if(offset > p->length*sectsize){
  354. respond(r, "offset past end of partition");
  355. return -1;
  356. }
  357. if(offset+count > p->length*sectsize)
  358. count = p->length*sectsize - offset;
  359. offset += p->offset*sectsize;
  360. if(r->ifcall.type == Tread)
  361. move = memmove;
  362. else
  363. move = evommem;
  364. tot = 0;
  365. nonzero = 1;
  366. if(r->ifcall.type == Tread)
  367. dat = (uchar*)r->ofcall.data;
  368. else{
  369. dat = (uchar*)r->ifcall.data;
  370. nonzero = isnonzero(dat, r->ifcall.count);
  371. }
  372. o = offset & (BLKSZ-1);
  373. /* left fringe block */
  374. if(o && count){
  375. blk = getblock(offset, r->ifcall.type==Twrite && nonzero);
  376. n = BLKSZ - o;
  377. if(n > count)
  378. n = count;
  379. if(r->ifcall.type != Twrite || blk != zero)
  380. (*move)(dat, blk+o, n);
  381. if(r->ifcall.type == Twrite)
  382. dirty(offset, blk);
  383. tot += n;
  384. }
  385. /* full and right fringe blocks */
  386. while(tot < count){
  387. blk = getblock(offset+tot, r->ifcall.type==Twrite && nonzero);
  388. n = BLKSZ;
  389. if(n > count-tot)
  390. n = count-tot;
  391. if(r->ifcall.type != Twrite || blk != zero)
  392. (*move)(dat+tot, blk, n);
  393. if(r->ifcall.type == Twrite)
  394. dirty(offset+tot, blk);
  395. tot += n;
  396. }
  397. r->ofcall.count = tot;
  398. respond(r, nil);
  399. return 0;
  400. }
  401. void
  402. fsread(Req *r)
  403. {
  404. char *s;
  405. switch((int)r->fid->qid.path){
  406. case Qroot:
  407. dirread9p(r, rootgen, nil);
  408. respond(r, nil);
  409. break;
  410. case Qdir:
  411. dirread9p(r, dirgen, nil);
  412. respond(r, nil);
  413. break;
  414. case Qctl:
  415. s = ctlstring();
  416. readstr(r, s);
  417. free(s);
  418. respond(r, nil);
  419. break;
  420. default:
  421. rdwrpart(r);
  422. break;
  423. }
  424. }
  425. void
  426. fswrite(Req *r)
  427. {
  428. switch((int)r->fid->qid.path){
  429. case Qroot:
  430. case Qdir:
  431. respond(r, "write to a directory?");
  432. break;
  433. case Qctl:
  434. ctlwrite(r);
  435. break;
  436. default:
  437. rdwrpart(r);
  438. break;
  439. }
  440. }
  441. void
  442. fsopen(Req *r)
  443. {
  444. if(r->ifcall.mode&ORCLOSE)
  445. respond(r, "cannot open ORCLOSE");
  446. switch((int)r->fid->qid.path){
  447. case Qroot:
  448. case Qdir:
  449. if(r->ifcall.mode != OREAD){
  450. respond(r, "bad mode for directory open");
  451. return;
  452. }
  453. }
  454. respond(r, nil);
  455. }
  456. void
  457. fsstat(Req *r)
  458. {
  459. int q;
  460. Dir *d;
  461. Part *p;
  462. d = &r->d;
  463. memset(d, 0, sizeof *d);
  464. d->qid = r->fid->qid;
  465. d->atime = d->mtime = time0;
  466. q = r->fid->qid.path;
  467. switch(q){
  468. case Qroot:
  469. d->name = estrdup9p("/");
  470. d->mode = DMDIR|0777;
  471. break;
  472. case Qdir:
  473. d->name = estrdup9p(sdname);
  474. d->mode = DMDIR|0777;
  475. break;
  476. default:
  477. q -= Qpart;
  478. if(q < 0 || q > nelem(tab) || tab[q].inuse==0 || r->fid->qid.vers != tab[q].vers){
  479. respond(r, "partition no longer exists");
  480. return;
  481. }
  482. p = &tab[q];
  483. d->name = estrdup9p(p->name);
  484. d->length = p->length * sectsize;
  485. d->mode = p->mode;
  486. break;
  487. }
  488. d->uid = estrdup9p("disksim");
  489. d->gid = estrdup9p("disksim");
  490. d->muid = estrdup9p("");
  491. respond(r, nil);
  492. }
  493. void
  494. fsattach(Req *r)
  495. {
  496. char *spec;
  497. spec = r->ifcall.aname;
  498. if(spec && spec[0]){
  499. respond(r, "invalid attach specifier");
  500. return;
  501. }
  502. r->ofcall.qid = (Qid){Qroot, 0, QTDIR};
  503. r->fid->qid = r->ofcall.qid;
  504. respond(r, nil);
  505. }
  506. char*
  507. fswalk1(Fid *fid, char *name, Qid *qid)
  508. {
  509. int i;
  510. switch((int)fid->qid.path){
  511. case Qroot:
  512. if(strcmp(name, sdname) == 0){
  513. fid->qid.path = Qdir;
  514. fid->qid.type = QTDIR;
  515. *qid = fid->qid;
  516. return nil;
  517. }
  518. break;
  519. case Qdir:
  520. if(strcmp(name, "ctl") == 0){
  521. fid->qid.path = Qctl;
  522. fid->qid.vers = 0;
  523. fid->qid.type = 0;
  524. *qid = fid->qid;
  525. return nil;
  526. }
  527. for(i=0; i<nelem(tab); i++){
  528. if(tab[i].inuse && strcmp(tab[i].name, name) == 0){
  529. fid->qid.path = i+Qpart;
  530. fid->qid.vers = tab[i].vers;
  531. fid->qid.type = 0;
  532. *qid = fid->qid;
  533. return nil;
  534. }
  535. }
  536. break;
  537. }
  538. return "file not found";
  539. }
  540. Srv fs = {
  541. .attach= fsattach,
  542. .open= fsopen,
  543. .read= fsread,
  544. .write= fswrite,
  545. .stat= fsstat,
  546. .walk1= fswalk1,
  547. };
  548. char *mtpt = "/dev";
  549. char *srvname;
  550. void
  551. usage(void)
  552. {
  553. fprint(2, "usage: aux/disksim [-D] [-f file] [-s srvname] [-m mtpt] [sdXX]\n");
  554. fprint(2, "\tdefault mtpt is /dev\n");
  555. exits("usage");
  556. }
  557. void
  558. main(int argc, char **argv)
  559. {
  560. char *file;
  561. file = nil;
  562. quotefmtinstall();
  563. time0 = time(0);
  564. if(NPTR != BLKSZ/sizeof(void*))
  565. sysfatal("unexpected pointer size");
  566. ARGBEGIN{
  567. case 'D':
  568. chatty9p++;
  569. break;
  570. case 'f':
  571. file = EARGF(usage());
  572. break;
  573. case 'r':
  574. rdonly = 1;
  575. break;
  576. case 's':
  577. srvname = EARGF(usage());
  578. break;
  579. case 'm':
  580. mtpt = EARGF(usage());
  581. break;
  582. default:
  583. usage();
  584. }ARGEND
  585. if(argc > 1)
  586. usage();
  587. if(argc == 1)
  588. sdname = argv[0];
  589. if(file){
  590. if((fd = open(file, rdonly ? OREAD : ORDWR)) < 0)
  591. sysfatal("open %s: %r", file);
  592. }
  593. inquiry = estrdup9p(inquiry);
  594. tab[0].name = estrdup9p("data");
  595. tab[0].inuse = 1;
  596. tab[0].mode = 0666;
  597. postmountsrv(&fs, srvname, mtpt, MBEFORE);
  598. exits(nil);
  599. }