devsd.c 30 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622
  1. /*
  2. * Storage Device.
  3. */
  4. #include "u.h"
  5. #include "../port/lib.h"
  6. #include "mem.h"
  7. #include "dat.h"
  8. #include "fns.h"
  9. #include "io.h"
  10. #include "ureg.h"
  11. #include "../port/error.h"
  12. #include "../port/sd.h"
  13. extern Dev sddevtab;
  14. extern SDifc* sdifc[];
  15. static char Echange[] = "media or partition has changed";
  16. static char devletters[] = "0123456789"
  17. "abcdefghijklmnopqrstuvwxyz"
  18. "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
  19. static SDev *devs[sizeof devletters-1];
  20. static QLock devslock;
  21. enum {
  22. Rawcmd,
  23. Rawdata,
  24. Rawstatus,
  25. };
  26. enum {
  27. Qtopdir = 1, /* top level directory */
  28. Qtopbase,
  29. Qtopctl = Qtopbase,
  30. Qunitdir, /* directory per unit */
  31. Qunitbase,
  32. Qctl = Qunitbase,
  33. Qraw,
  34. Qpart,
  35. TypeLOG = 4,
  36. NType = (1<<TypeLOG),
  37. TypeMASK = (NType-1),
  38. TypeSHIFT = 0,
  39. PartLOG = 8,
  40. NPart = (1<<PartLOG),
  41. PartMASK = (NPart-1),
  42. PartSHIFT = TypeLOG,
  43. UnitLOG = 8,
  44. NUnit = (1<<UnitLOG),
  45. UnitMASK = (NUnit-1),
  46. UnitSHIFT = (PartLOG+TypeLOG),
  47. DevLOG = 8,
  48. NDev = (1 << DevLOG),
  49. DevMASK = (NDev-1),
  50. DevSHIFT = (UnitLOG+PartLOG+TypeLOG),
  51. Ncmd = 20,
  52. };
  53. #define TYPE(q) ((((ulong)(q).path)>>TypeSHIFT) & TypeMASK)
  54. #define PART(q) ((((ulong)(q).path)>>PartSHIFT) & PartMASK)
  55. #define UNIT(q) ((((ulong)(q).path)>>UnitSHIFT) & UnitMASK)
  56. #define DEV(q) ((((ulong)(q).path)>>DevSHIFT) & DevMASK)
  57. #define QID(d,u, p, t) (((d)<<DevSHIFT)|((u)<<UnitSHIFT)|\
  58. ((p)<<PartSHIFT)|((t)<<TypeSHIFT))
  59. static void
  60. sdaddpart(SDunit* unit, char* name, ulong start, ulong end)
  61. {
  62. SDpart *pp;
  63. int i, partno;
  64. /*
  65. * Check name not already used
  66. * and look for a free slot.
  67. */
  68. if(unit->part != nil){
  69. partno = -1;
  70. for(i = 0; i < unit->npart; i++){
  71. pp = &unit->part[i];
  72. if(!pp->valid){
  73. if(partno == -1)
  74. partno = i;
  75. break;
  76. }
  77. if(strcmp(name, pp->name) == 0){
  78. if(pp->start == start && pp->end == end)
  79. return;
  80. error(Ebadctl);
  81. }
  82. }
  83. }
  84. else{
  85. if((unit->part = malloc(sizeof(SDpart)*SDnpart)) == nil)
  86. error(Enomem);
  87. unit->npart = SDnpart;
  88. partno = 0;
  89. }
  90. /*
  91. * If no free slot found then increase the
  92. * array size (can't get here with unit->part == nil).
  93. */
  94. if(partno == -1){
  95. if(unit->npart >= NPart)
  96. error(Enomem);
  97. if((pp = malloc(sizeof(SDpart)*(unit->npart+SDnpart))) == nil)
  98. error(Enomem);
  99. memmove(pp, unit->part, sizeof(SDpart)*unit->npart);
  100. free(unit->part);
  101. unit->part = pp;
  102. partno = unit->npart;
  103. unit->npart += SDnpart;
  104. }
  105. /*
  106. * Check size and extent are valid.
  107. */
  108. if(start > end || end > unit->sectors)
  109. error(Eio);
  110. pp = &unit->part[partno];
  111. pp->start = start;
  112. pp->end = end;
  113. kstrdup(&pp->name, name);
  114. kstrdup(&pp->user, eve);
  115. pp->perm = 0640;
  116. pp->valid = 1;
  117. }
  118. static void
  119. sddelpart(SDunit* unit, char* name)
  120. {
  121. int i;
  122. SDpart *pp;
  123. /*
  124. * Look for the partition to delete.
  125. * Can't delete if someone still has it open.
  126. */
  127. pp = unit->part;
  128. for(i = 0; i < unit->npart; i++){
  129. if(strcmp(name, pp->name) == 0)
  130. break;
  131. pp++;
  132. }
  133. if(i >= unit->npart)
  134. error(Ebadctl);
  135. if(strcmp(up->user, pp->user) && !iseve())
  136. error(Eperm);
  137. pp->valid = 0;
  138. pp->vers++;
  139. }
  140. static int
  141. sdinitpart(SDunit* unit)
  142. {
  143. int i, nf;
  144. ulong start, end;
  145. char *f[4], *p, *q, buf[10];
  146. unit->vers++;
  147. unit->sectors = unit->secsize = 0;
  148. if(unit->part){
  149. for(i = 0; i < unit->npart; i++){
  150. unit->part[i].valid = 0;
  151. unit->part[i].vers++;
  152. }
  153. }
  154. if(unit->inquiry[0] & 0xC0)
  155. return 0;
  156. switch(unit->inquiry[0] & 0x1F){
  157. case 0x00: /* DA */
  158. case 0x04: /* WORM */
  159. case 0x05: /* CD-ROM */
  160. case 0x07: /* MO */
  161. break;
  162. default:
  163. return 0;
  164. }
  165. if(unit->dev->ifc->online)
  166. unit->dev->ifc->online(unit);
  167. if(unit->sectors){
  168. sdaddpart(unit, "data", 0, unit->sectors);
  169. /*
  170. * Use partitions passed from boot program,
  171. * e.g.
  172. * sdC0part=dos 63 123123/plan9 123123 456456
  173. * This happens before /boot sets hostname so the
  174. * partitions will have the null-string for user.
  175. * The gen functions patch it up.
  176. */
  177. snprint(buf, sizeof buf, "%spart", unit->name);
  178. for(p = getconf(buf); p != nil; p = q){
  179. if(q = strchr(p, '/'))
  180. *q++ = '\0';
  181. nf = tokenize(p, f, nelem(f));
  182. if(nf < 3)
  183. continue;
  184. start = strtoul(f[1], 0, 0);
  185. end = strtoul(f[2], 0, 0);
  186. if(!waserror()){
  187. sdaddpart(unit, f[0], start, end);
  188. poperror();
  189. }
  190. }
  191. }
  192. return 1;
  193. }
  194. static int
  195. sdindex(int idno)
  196. {
  197. char *p;
  198. p = strchr(devletters, idno);
  199. if(p == nil)
  200. return -1;
  201. return p-devletters;
  202. }
  203. static SDev*
  204. sdgetdev(int idno)
  205. {
  206. SDev *sdev;
  207. int i;
  208. if((i = sdindex(idno)) < 0)
  209. return nil;
  210. qlock(&devslock);
  211. if(sdev = devs[i])
  212. incref(&sdev->r);
  213. qunlock(&devslock);
  214. return sdev;
  215. }
  216. static SDunit*
  217. sdgetunit(SDev* sdev, int subno)
  218. {
  219. SDunit *unit;
  220. char buf[32];
  221. /*
  222. * Associate a unit with a given device and sub-unit
  223. * number on that device.
  224. * The device will be probed if it has not already been
  225. * successfully accessed.
  226. */
  227. qlock(&sdev->unitlock);
  228. if(subno > sdev->nunit){
  229. qunlock(&sdev->unitlock);
  230. return nil;
  231. }
  232. unit = sdev->unit[subno];
  233. if(unit == nil){
  234. /*
  235. * Probe the unit only once. This decision
  236. * may be a little severe and reviewed later.
  237. */
  238. if(sdev->unitflg[subno]){
  239. qunlock(&sdev->unitlock);
  240. return nil;
  241. }
  242. if((unit = malloc(sizeof(SDunit))) == nil){
  243. qunlock(&sdev->unitlock);
  244. return nil;
  245. }
  246. sdev->unitflg[subno] = 1;
  247. snprint(buf, sizeof(buf), "%s%d", sdev->name, subno);
  248. kstrdup(&unit->name, buf);
  249. kstrdup(&unit->user, eve);
  250. unit->perm = 0555;
  251. unit->subno = subno;
  252. unit->dev = sdev;
  253. if(sdev->enabled == 0 && sdev->ifc->enable)
  254. sdev->ifc->enable(sdev);
  255. sdev->enabled = 1;
  256. /*
  257. * No need to lock anything here as this is only
  258. * called before the unit is made available in the
  259. * sdunit[] array.
  260. */
  261. if(unit->dev->ifc->verify(unit) == 0){
  262. qunlock(&sdev->unitlock);
  263. free(unit);
  264. return nil;
  265. }
  266. sdev->unit[subno] = unit;
  267. }
  268. qunlock(&sdev->unitlock);
  269. return unit;
  270. }
  271. static void
  272. sdreset(void)
  273. {
  274. int i;
  275. SDev *sdev;
  276. /*
  277. * Probe all known controller types and register any devices found.
  278. */
  279. for(i = 0; sdifc[i] != nil; i++){
  280. if(sdifc[i]->pnp == nil || (sdev = sdifc[i]->pnp()) == nil)
  281. continue;
  282. sdadddevs(sdev);
  283. }
  284. }
  285. void
  286. sdadddevs(SDev *sdev)
  287. {
  288. int i, j, id;
  289. SDev *next;
  290. for(; sdev; sdev=next){
  291. next = sdev->next;
  292. sdev->unit = (SDunit**)malloc(sdev->nunit * sizeof(SDunit*));
  293. sdev->unitflg = (int*)malloc(sdev->nunit * sizeof(int));
  294. if(sdev->unit == nil || sdev->unitflg == nil){
  295. print("sdadddevs: out of memory\n");
  296. giveup:
  297. free(sdev->unit);
  298. free(sdev->unitflg);
  299. if(sdev->ifc->clear)
  300. sdev->ifc->clear(sdev);
  301. free(sdev);
  302. continue;
  303. }
  304. id = sdindex(sdev->idno);
  305. if(id == -1){
  306. print("sdadddevs: bad id number %d (%C)\n", id, id);
  307. goto giveup;
  308. }
  309. qlock(&devslock);
  310. for(i=0; i<nelem(devs); i++){
  311. if(devs[j = (id+i)%nelem(devs)] == nil){
  312. sdev->idno = devletters[j];
  313. devs[j] = sdev;
  314. snprint(sdev->name, sizeof sdev->name, "sd%c", devletters[j]);
  315. break;
  316. }
  317. }
  318. qunlock(&devslock);
  319. if(i == nelem(devs)){
  320. print("sdadddevs: out of device letters\n");
  321. goto giveup;
  322. }
  323. }
  324. }
  325. static int
  326. sd2gen(Chan* c, int i, Dir* dp)
  327. {
  328. Qid q;
  329. vlong l;
  330. SDpart *pp;
  331. SDperm *perm;
  332. SDunit *unit;
  333. SDev *sdev;
  334. int rv;
  335. sdev = sdgetdev(DEV(c->qid));
  336. assert(sdev);
  337. unit = sdev->unit[UNIT(c->qid)];
  338. rv = -1;
  339. switch(i){
  340. case Qctl:
  341. mkqid(&q, QID(DEV(c->qid), UNIT(c->qid), PART(c->qid), Qctl),
  342. unit->vers, QTFILE);
  343. perm = &unit->ctlperm;
  344. if(emptystr(perm->user)){
  345. kstrdup(&perm->user, eve);
  346. perm->perm = 0640;
  347. }
  348. devdir(c, q, "ctl", 0, perm->user, perm->perm, dp);
  349. rv = 1;
  350. break;
  351. case Qraw:
  352. mkqid(&q, QID(DEV(c->qid), UNIT(c->qid), PART(c->qid), Qraw),
  353. unit->vers, QTFILE);
  354. perm = &unit->rawperm;
  355. if(emptystr(perm->user)){
  356. kstrdup(&perm->user, eve);
  357. perm->perm = DMEXCL|0600;
  358. }
  359. devdir(c, q, "raw", 0, perm->user, perm->perm, dp);
  360. rv = 1;
  361. break;
  362. case Qpart:
  363. pp = &unit->part[PART(c->qid)];
  364. l = (pp->end - pp->start) * (vlong)unit->secsize;
  365. mkqid(&q, QID(DEV(c->qid), UNIT(c->qid), PART(c->qid), Qpart),
  366. unit->vers+pp->vers, QTFILE);
  367. if(emptystr(pp->user))
  368. kstrdup(&pp->user, eve);
  369. devdir(c, q, pp->name, l, pp->user, pp->perm, dp);
  370. rv = 1;
  371. break;
  372. }
  373. decref(&sdev->r);
  374. return rv;
  375. }
  376. static int
  377. sd1gen(Chan* c, int i, Dir* dp)
  378. {
  379. Qid q;
  380. switch(i){
  381. case Qtopctl:
  382. mkqid(&q, QID(0, 0, 0, Qtopctl), 0, QTFILE);
  383. devdir(c, q, "sdctl", 0, eve, 0640, dp);
  384. return 1;
  385. }
  386. return -1;
  387. }
  388. static int
  389. sdgen(Chan* c, char*, Dirtab*, int, int s, Dir* dp)
  390. {
  391. Qid q;
  392. vlong l;
  393. int i, r;
  394. SDpart *pp;
  395. SDunit *unit;
  396. SDev *sdev;
  397. switch(TYPE(c->qid)){
  398. case Qtopdir:
  399. if(s == DEVDOTDOT){
  400. mkqid(&q, QID(0, 0, 0, Qtopdir), 0, QTDIR);
  401. sprint(up->genbuf, "#%C", sddevtab.dc);
  402. devdir(c, q, up->genbuf, 0, eve, 0555, dp);
  403. return 1;
  404. }
  405. if(s+Qtopbase < Qunitdir)
  406. return sd1gen(c, s+Qtopbase, dp);
  407. s -= (Qunitdir-Qtopbase);
  408. qlock(&devslock);
  409. for(i=0; i<nelem(devs); i++){
  410. if(devs[i]){
  411. if(s < devs[i]->nunit)
  412. break;
  413. s -= devs[i]->nunit;
  414. }
  415. }
  416. if(i == nelem(devs)){
  417. /* Run off the end of the list */
  418. qunlock(&devslock);
  419. return -1;
  420. }
  421. if((sdev = devs[i]) == nil){
  422. qunlock(&devslock);
  423. return 0;
  424. }
  425. incref(&sdev->r);
  426. qunlock(&devslock);
  427. if((unit = sdev->unit[s]) == nil)
  428. if((unit = sdgetunit(sdev, s)) == nil){
  429. decref(&sdev->r);
  430. return 0;
  431. }
  432. mkqid(&q, QID(sdev->idno, s, 0, Qunitdir), 0, QTDIR);
  433. if(emptystr(unit->user))
  434. kstrdup(&unit->user, eve);
  435. devdir(c, q, unit->name, 0, unit->user, unit->perm, dp);
  436. decref(&sdev->r);
  437. return 1;
  438. case Qunitdir:
  439. if(s == DEVDOTDOT){
  440. mkqid(&q, QID(0, 0, 0, Qtopdir), 0, QTDIR);
  441. sprint(up->genbuf, "#%C", sddevtab.dc);
  442. devdir(c, q, up->genbuf, 0, eve, 0555, dp);
  443. return 1;
  444. }
  445. if((sdev = sdgetdev(DEV(c->qid))) == nil){
  446. devdir(c, c->qid, "unavailable", 0, eve, 0, dp);
  447. return 1;
  448. }
  449. unit = sdev->unit[UNIT(c->qid)];
  450. qlock(&unit->ctl);
  451. /*
  452. * Check for media change.
  453. * If one has already been detected, sectors will be zero.
  454. * If there is one waiting to be detected, online
  455. * will return > 1.
  456. * Online is a bit of a large hammer but does the job.
  457. */
  458. if(unit->sectors == 0
  459. || (unit->dev->ifc->online && unit->dev->ifc->online(unit) > 1))
  460. sdinitpart(unit);
  461. i = s+Qunitbase;
  462. if(i < Qpart){
  463. r = sd2gen(c, i, dp);
  464. qunlock(&unit->ctl);
  465. decref(&sdev->r);
  466. return r;
  467. }
  468. i -= Qpart;
  469. if(unit->part == nil || i >= unit->npart){
  470. qunlock(&unit->ctl);
  471. decref(&sdev->r);
  472. break;
  473. }
  474. pp = &unit->part[i];
  475. if(!pp->valid){
  476. qunlock(&unit->ctl);
  477. decref(&sdev->r);
  478. return 0;
  479. }
  480. l = (pp->end - pp->start) * (vlong)unit->secsize;
  481. mkqid(&q, QID(DEV(c->qid), UNIT(c->qid), i, Qpart),
  482. unit->vers+pp->vers, QTFILE);
  483. if(emptystr(pp->user))
  484. kstrdup(&pp->user, eve);
  485. devdir(c, q, pp->name, l, pp->user, pp->perm, dp);
  486. qunlock(&unit->ctl);
  487. decref(&sdev->r);
  488. return 1;
  489. case Qraw:
  490. case Qctl:
  491. case Qpart:
  492. if((sdev = sdgetdev(DEV(c->qid))) == nil){
  493. devdir(c, q, "unavailable", 0, eve, 0, dp);
  494. return 1;
  495. }
  496. unit = sdev->unit[UNIT(c->qid)];
  497. qlock(&unit->ctl);
  498. r = sd2gen(c, TYPE(c->qid), dp);
  499. qunlock(&unit->ctl);
  500. decref(&sdev->r);
  501. return r;
  502. case Qtopctl:
  503. return sd1gen(c, TYPE(c->qid), dp);
  504. default:
  505. break;
  506. }
  507. return -1;
  508. }
  509. static Chan*
  510. sdattach(char* spec)
  511. {
  512. Chan *c;
  513. char *p;
  514. SDev *sdev;
  515. int idno, subno;
  516. if(*spec == '\0'){
  517. c = devattach(sddevtab.dc, spec);
  518. mkqid(&c->qid, QID(0, 0, 0, Qtopdir), 0, QTDIR);
  519. return c;
  520. }
  521. if(spec[0] != 's' || spec[1] != 'd')
  522. error(Ebadspec);
  523. idno = spec[2];
  524. subno = strtol(&spec[3], &p, 0);
  525. if(p == &spec[3])
  526. error(Ebadspec);
  527. if((sdev=sdgetdev(idno)) == nil)
  528. error(Enonexist);
  529. if(sdgetunit(sdev, subno) == nil){
  530. decref(&sdev->r);
  531. error(Enonexist);
  532. }
  533. c = devattach(sddevtab.dc, spec);
  534. mkqid(&c->qid, QID(sdev->idno, subno, 0, Qunitdir), 0, QTDIR);
  535. c->dev = (sdev->idno << UnitLOG) + subno;
  536. decref(&sdev->r);
  537. return c;
  538. }
  539. static Walkqid*
  540. sdwalk(Chan* c, Chan* nc, char** name, int nname)
  541. {
  542. return devwalk(c, nc, name, nname, nil, 0, sdgen);
  543. }
  544. static int
  545. sdstat(Chan* c, uchar* db, int n)
  546. {
  547. return devstat(c, db, n, nil, 0, sdgen);
  548. }
  549. static Chan*
  550. sdopen(Chan* c, int omode)
  551. {
  552. SDpart *pp;
  553. SDunit *unit;
  554. SDev *sdev;
  555. uchar tp;
  556. c = devopen(c, omode, 0, 0, sdgen);
  557. if((tp = TYPE(c->qid)) != Qctl && tp != Qraw && tp != Qpart)
  558. return c;
  559. sdev = sdgetdev(DEV(c->qid));
  560. if(sdev == nil)
  561. error(Enonexist);
  562. unit = sdev->unit[UNIT(c->qid)];
  563. switch(TYPE(c->qid)){
  564. case Qctl:
  565. c->qid.vers = unit->vers;
  566. break;
  567. case Qraw:
  568. c->qid.vers = unit->vers;
  569. if(tas(&unit->rawinuse) != 0){
  570. c->flag &= ~COPEN;
  571. decref(&sdev->r);
  572. error(Einuse);
  573. }
  574. unit->state = Rawcmd;
  575. break;
  576. case Qpart:
  577. qlock(&unit->ctl);
  578. if(waserror()){
  579. qunlock(&unit->ctl);
  580. c->flag &= ~COPEN;
  581. decref(&sdev->r);
  582. nexterror();
  583. }
  584. pp = &unit->part[PART(c->qid)];
  585. c->qid.vers = unit->vers+pp->vers;
  586. qunlock(&unit->ctl);
  587. poperror();
  588. break;
  589. }
  590. decref(&sdev->r);
  591. return c;
  592. }
  593. static void
  594. sdclose(Chan* c)
  595. {
  596. SDunit *unit;
  597. SDev *sdev;
  598. if(c->qid.type & QTDIR)
  599. return;
  600. if(!(c->flag & COPEN))
  601. return;
  602. switch(TYPE(c->qid)){
  603. default:
  604. break;
  605. case Qraw:
  606. sdev = sdgetdev(DEV(c->qid));
  607. if(sdev){
  608. unit = sdev->unit[UNIT(c->qid)];
  609. unit->rawinuse = 0;
  610. decref(&sdev->r);
  611. }
  612. break;
  613. }
  614. }
  615. static long
  616. sdbio(Chan* c, int write, char* a, long len, vlong off)
  617. {
  618. int nchange;
  619. long l;
  620. uchar *b;
  621. SDpart *pp;
  622. SDunit *unit;
  623. SDev *sdev;
  624. ulong bno, max, nb, offset;
  625. sdev = sdgetdev(DEV(c->qid));
  626. if(sdev == nil){
  627. decref(&sdev->r);
  628. error(Enonexist);
  629. }
  630. unit = sdev->unit[UNIT(c->qid)];
  631. if(unit == nil)
  632. error(Enonexist);
  633. nchange = 0;
  634. qlock(&unit->ctl);
  635. while(waserror()){
  636. /* notification of media change; go around again */
  637. if(strcmp(up->errstr, Eio) == 0 && unit->sectors == 0 && nchange++ == 0){
  638. sdinitpart(unit);
  639. continue;
  640. }
  641. /* other errors; give up */
  642. qunlock(&unit->ctl);
  643. decref(&sdev->r);
  644. nexterror();
  645. }
  646. pp = &unit->part[PART(c->qid)];
  647. if(unit->vers+pp->vers != c->qid.vers)
  648. error(Echange);
  649. /*
  650. * Check the request is within bounds.
  651. * Removeable drives are locked throughout the I/O
  652. * in case the media changes unexpectedly.
  653. * Non-removeable drives are not locked during the I/O
  654. * to allow the hardware to optimise if it can; this is
  655. * a little fast and loose.
  656. * It's assumed that non-removeable media parameters
  657. * (sectors, secsize) can't change once the drive has
  658. * been brought online.
  659. */
  660. bno = (off/unit->secsize) + pp->start;
  661. nb = ((off+len+unit->secsize-1)/unit->secsize) + pp->start - bno;
  662. max = SDmaxio/unit->secsize;
  663. if(nb > max)
  664. nb = max;
  665. if(bno+nb > pp->end)
  666. nb = pp->end - bno;
  667. if(bno >= pp->end || nb == 0){
  668. if(write)
  669. error(Eio);
  670. qunlock(&unit->ctl);
  671. decref(&sdev->r);
  672. poperror();
  673. return 0;
  674. }
  675. if(!(unit->inquiry[1] & 0x80)){
  676. qunlock(&unit->ctl);
  677. poperror();
  678. }
  679. b = sdmalloc(nb*unit->secsize);
  680. if(b == nil)
  681. error(Enomem);
  682. if(waserror()){
  683. sdfree(b);
  684. if(!(unit->inquiry[1] & 0x80))
  685. decref(&sdev->r); /* gadverdamme! */
  686. nexterror();
  687. }
  688. offset = off%unit->secsize;
  689. if(offset+len > nb*unit->secsize)
  690. len = nb*unit->secsize - offset;
  691. if(write){
  692. if(offset || (len%unit->secsize)){
  693. l = unit->dev->ifc->bio(unit, 0, 0, b, nb, bno);
  694. if(l < 0)
  695. error(Eio);
  696. if(l < (nb*unit->secsize)){
  697. nb = l/unit->secsize;
  698. l = nb*unit->secsize - offset;
  699. if(len > l)
  700. len = l;
  701. }
  702. }
  703. memmove(b+offset, a, len);
  704. l = unit->dev->ifc->bio(unit, 0, 1, b, nb, bno);
  705. if(l < 0)
  706. error(Eio);
  707. if(l < offset)
  708. len = 0;
  709. else if(len > l - offset)
  710. len = l - offset;
  711. }
  712. else{
  713. l = unit->dev->ifc->bio(unit, 0, 0, b, nb, bno);
  714. if(l < 0)
  715. error(Eio);
  716. if(l < offset)
  717. len = 0;
  718. else if(len > l - offset)
  719. len = l - offset;
  720. memmove(a, b+offset, len);
  721. }
  722. sdfree(b);
  723. poperror();
  724. if(unit->inquiry[1] & 0x80){
  725. qunlock(&unit->ctl);
  726. poperror();
  727. }
  728. decref(&sdev->r);
  729. return len;
  730. }
  731. static long
  732. sdrio(SDreq* r, void* a, long n)
  733. {
  734. void *data;
  735. if(n >= SDmaxio || n < 0)
  736. error(Etoobig);
  737. data = nil;
  738. if(n){
  739. if((data = sdmalloc(n)) == nil)
  740. error(Enomem);
  741. if(r->write)
  742. memmove(data, a, n);
  743. }
  744. r->data = data;
  745. r->dlen = n;
  746. if(waserror()){
  747. if(data != nil){
  748. sdfree(data);
  749. r->data = nil;
  750. }
  751. nexterror();
  752. }
  753. if(r->unit->dev->ifc->rio(r) != SDok)
  754. error(Eio);
  755. if(!r->write && r->rlen > 0)
  756. memmove(a, data, r->rlen);
  757. if(data != nil){
  758. sdfree(data);
  759. r->data = nil;
  760. }
  761. poperror();
  762. return r->rlen;
  763. }
  764. /*
  765. * SCSI simulation for non-SCSI devices
  766. */
  767. int
  768. sdsetsense(SDreq *r, int status, int key, int asc, int ascq)
  769. {
  770. int len;
  771. SDunit *unit;
  772. unit = r->unit;
  773. unit->sense[2] = key;
  774. unit->sense[12] = asc;
  775. unit->sense[13] = ascq;
  776. if(status == SDcheck && !(r->flags & SDnosense)){
  777. /* request sense case from sdfakescsi */
  778. len = sizeof unit->sense;
  779. if(len > sizeof r->sense-1)
  780. len = sizeof r->sense-1;
  781. memmove(r->sense, unit->sense, len);
  782. unit->sense[2] = 0;
  783. unit->sense[12] = 0;
  784. unit->sense[13] = 0;
  785. r->flags |= SDvalidsense;
  786. return SDok;
  787. }
  788. return status;
  789. }
  790. int
  791. sdmodesense(SDreq *r, uchar *cmd, void *info, int ilen)
  792. {
  793. int len;
  794. uchar *data;
  795. /*
  796. * Fake a vendor-specific request with page code 0,
  797. * return the drive info.
  798. */
  799. if((cmd[2] & 0x3F) != 0 && (cmd[2] & 0x3F) != 0x3F)
  800. return sdsetsense(r, SDcheck, 0x05, 0x24, 0);
  801. len = (cmd[7]<<8)|cmd[8];
  802. if(len == 0)
  803. return SDok;
  804. if(len < 8+ilen)
  805. return sdsetsense(r, SDcheck, 0x05, 0x1A, 0);
  806. if(r->data == nil || r->dlen < len)
  807. return sdsetsense(r, SDcheck, 0x05, 0x20, 1);
  808. data = r->data;
  809. memset(data, 0, 8);
  810. data[0] = ilen>>8;
  811. data[1] = ilen;
  812. if(ilen)
  813. memmove(data+8, info, ilen);
  814. r->rlen = 8+ilen;
  815. return sdsetsense(r, SDok, 0, 0, 0);
  816. }
  817. int
  818. sdfakescsi(SDreq *r, void *info, int ilen)
  819. {
  820. uchar *cmd, *p;
  821. uvlong len;
  822. SDunit *unit;
  823. cmd = r->cmd;
  824. r->rlen = 0;
  825. unit = r->unit;
  826. /*
  827. * Rewrite read(6)/write(6) into read(10)/write(10).
  828. */
  829. switch(cmd[0]){
  830. case 0x08: /* read */
  831. case 0x0A: /* write */
  832. cmd[9] = 0;
  833. cmd[8] = cmd[4];
  834. cmd[7] = 0;
  835. cmd[6] = 0;
  836. cmd[5] = cmd[3];
  837. cmd[4] = cmd[2];
  838. cmd[3] = cmd[1] & 0x0F;
  839. cmd[2] = 0;
  840. cmd[1] &= 0xE0;
  841. cmd[0] |= 0x20;
  842. break;
  843. }
  844. /*
  845. * Map SCSI commands into ATA commands for discs.
  846. * Fail any command with a LUN except INQUIRY which
  847. * will return 'logical unit not supported'.
  848. */
  849. if((cmd[1]>>5) && cmd[0] != 0x12)
  850. return sdsetsense(r, SDcheck, 0x05, 0x25, 0);
  851. switch(cmd[0]){
  852. default:
  853. return sdsetsense(r, SDcheck, 0x05, 0x20, 0);
  854. case 0x00: /* test unit ready */
  855. return sdsetsense(r, SDok, 0, 0, 0);
  856. case 0x03: /* request sense */
  857. if(cmd[4] < sizeof unit->sense)
  858. len = cmd[4];
  859. else
  860. len = sizeof unit->sense;
  861. if(r->data && r->dlen >= len){
  862. memmove(r->data, unit->sense, len);
  863. r->rlen = len;
  864. }
  865. return sdsetsense(r, SDok, 0, 0, 0);
  866. case 0x12: /* inquiry */
  867. if(cmd[4] < sizeof unit->inquiry)
  868. len = cmd[4];
  869. else
  870. len = sizeof unit->inquiry;
  871. if(r->data && r->dlen >= len){
  872. memmove(r->data, r->sense, len);
  873. r->rlen = len;
  874. }
  875. return sdsetsense(r, SDok, 0, 0, 0);
  876. case 0x1B: /* start/stop unit */
  877. /*
  878. * nop for now, can use power management later.
  879. */
  880. return sdsetsense(r, SDok, 0, 0, 0);
  881. case 0x25: /* read capacity */
  882. if((cmd[1] & 0x01) || cmd[2] || cmd[3])
  883. return sdsetsense(r, SDcheck, 0x05, 0x24, 0);
  884. if(r->data == nil || r->dlen < 8)
  885. return sdsetsense(r, SDcheck, 0x05, 0x20, 1);
  886. /*
  887. * Read capacity returns the LBA of the last sector.
  888. */
  889. len = unit->sectors - 1;
  890. p = r->data;
  891. *p++ = len>>24;
  892. *p++ = len>>16;
  893. *p++ = len>>8;
  894. *p++ = len;
  895. len = 512;
  896. *p++ = len>>24;
  897. *p++ = len>>16;
  898. *p++ = len>>8;
  899. *p++ = len;
  900. r->rlen = p - (uchar*)r->data;
  901. return sdsetsense(r, SDok, 0, 0, 0);
  902. case 0x9E: /* long read capacity */
  903. if((cmd[1] & 0x01) || cmd[2] || cmd[3])
  904. return sdsetsense(r, SDcheck, 0x05, 0x24, 0);
  905. if(r->data == nil || r->dlen < 8)
  906. return sdsetsense(r, SDcheck, 0x05, 0x20, 1);
  907. /*
  908. * Read capcity returns the LBA of the last sector.
  909. */
  910. len = unit->sectors - 1;
  911. p = r->data;
  912. *p++ = len>>56;
  913. *p++ = len>>48;
  914. *p++ = len>>40;
  915. *p++ = len>>32;
  916. *p++ = len>>24;
  917. *p++ = len>>16;
  918. *p++ = len>>8;
  919. *p++ = len;
  920. len = 512;
  921. *p++ = len>>24;
  922. *p++ = len>>16;
  923. *p++ = len>>8;
  924. *p++ = len;
  925. r->rlen = p - (uchar*)r->data;
  926. return sdsetsense(r, SDok, 0, 0, 0);
  927. case 0x5A: /* mode sense */
  928. return sdmodesense(r, cmd, info, ilen);
  929. case 0x28: /* read */
  930. case 0x2A: /* write */
  931. return SDnostatus;
  932. }
  933. }
  934. static long
  935. sdread(Chan *c, void *a, long n, vlong off)
  936. {
  937. char *p, *e, *buf;
  938. SDpart *pp;
  939. SDunit *unit;
  940. SDev *sdev;
  941. ulong offset;
  942. int i, l, m, status;
  943. offset = off;
  944. switch(TYPE(c->qid)){
  945. default:
  946. error(Eperm);
  947. case Qtopctl:
  948. m = 64*1024; /* room for register dumps */
  949. p = buf = malloc(m);
  950. assert(p);
  951. e = p + m;
  952. qlock(&devslock);
  953. for(i = 0; i < nelem(devs); i++){
  954. sdev = devs[i];
  955. if(sdev && sdev->ifc->rtopctl)
  956. p = sdev->ifc->rtopctl(sdev, p, e);
  957. }
  958. qunlock(&devslock);
  959. n = readstr(off, a, n, buf);
  960. free(buf);
  961. return n;
  962. case Qtopdir:
  963. case Qunitdir:
  964. return devdirread(c, a, n, 0, 0, sdgen);
  965. case Qctl:
  966. sdev = sdgetdev(DEV(c->qid));
  967. if(sdev == nil)
  968. error(Enonexist);
  969. unit = sdev->unit[UNIT(c->qid)];
  970. m = 16*1024; /* room for register dumps */
  971. p = malloc(m);
  972. l = snprint(p, m, "inquiry %.48s\n",
  973. (char*)unit->inquiry+8);
  974. qlock(&unit->ctl);
  975. /*
  976. * If there's a device specific routine it must
  977. * provide all information pertaining to night geometry
  978. * and the garscadden trains.
  979. */
  980. if(unit->dev->ifc->rctl)
  981. l += unit->dev->ifc->rctl(unit, p+l, m-l);
  982. if(unit->sectors == 0)
  983. sdinitpart(unit);
  984. if(unit->sectors){
  985. if(unit->dev->ifc->rctl == nil)
  986. l += snprint(p+l, m-l,
  987. "geometry %lud %ld\n",
  988. unit->sectors, unit->secsize);
  989. pp = unit->part;
  990. for(i = 0; i < unit->npart; i++){
  991. if(pp->valid)
  992. l += snprint(p+l, m-l,
  993. "part %s %lud %lud\n",
  994. pp->name, pp->start, pp->end);
  995. pp++;
  996. }
  997. }
  998. qunlock(&unit->ctl);
  999. decref(&sdev->r);
  1000. l = readstr(offset, a, n, p);
  1001. free(p);
  1002. return l;
  1003. case Qraw:
  1004. sdev = sdgetdev(DEV(c->qid));
  1005. if(sdev == nil)
  1006. error(Enonexist);
  1007. unit = sdev->unit[UNIT(c->qid)];
  1008. qlock(&unit->raw);
  1009. if(waserror()){
  1010. qunlock(&unit->raw);
  1011. decref(&sdev->r);
  1012. nexterror();
  1013. }
  1014. if(unit->state == Rawdata){
  1015. unit->state = Rawstatus;
  1016. i = sdrio(unit->req, a, n);
  1017. }
  1018. else if(unit->state == Rawstatus){
  1019. status = unit->req->status;
  1020. unit->state = Rawcmd;
  1021. free(unit->req);
  1022. unit->req = nil;
  1023. i = readnum(0, a, n, status, NUMSIZE);
  1024. } else
  1025. i = 0;
  1026. qunlock(&unit->raw);
  1027. decref(&sdev->r);
  1028. poperror();
  1029. return i;
  1030. case Qpart:
  1031. return sdbio(c, 0, a, n, off);
  1032. }
  1033. return 0;
  1034. }
  1035. static void legacytopctl(Cmdbuf*);
  1036. static long
  1037. sdwrite(Chan* c, void* a, long n, vlong off)
  1038. {
  1039. char *f0;
  1040. int i;
  1041. ulong end, start;
  1042. Cmdbuf *cb;
  1043. SDifc *ifc;
  1044. SDreq *req;
  1045. SDunit *unit;
  1046. SDev *sdev;
  1047. switch(TYPE(c->qid)){
  1048. default:
  1049. error(Eperm);
  1050. case Qtopctl:
  1051. cb = parsecmd(a, n);
  1052. if(waserror()){
  1053. free(cb);
  1054. nexterror();
  1055. }
  1056. if(cb->nf == 0)
  1057. error("empty control message");
  1058. f0 = cb->f[0];
  1059. cb->f++;
  1060. cb->nf--;
  1061. if(strcmp(f0, "config") == 0){
  1062. /* wormhole into ugly legacy interface */
  1063. legacytopctl(cb);
  1064. poperror();
  1065. free(cb);
  1066. break;
  1067. }
  1068. ifc = nil;
  1069. sdev = nil;
  1070. for(i=0; sdifc[i]; i++){
  1071. if(strcmp(sdifc[i]->name, f0) == 0){
  1072. ifc = sdifc[i];
  1073. sdev = nil;
  1074. goto subtopctl;
  1075. }
  1076. }
  1077. if(f0[0]=='s' && f0[1]=='d' && f0[2] && f0[3] == 0){
  1078. if((sdev = sdgetdev(f0[2])) != nil){
  1079. ifc = sdev->ifc;
  1080. goto subtopctl;
  1081. }
  1082. }
  1083. error("unknown interface");
  1084. subtopctl:
  1085. if(waserror()){
  1086. if(sdev)
  1087. decref(&sdev->r);
  1088. nexterror();
  1089. }
  1090. if(ifc->wtopctl)
  1091. ifc->wtopctl(sdev, cb);
  1092. else
  1093. error(Ebadctl);
  1094. poperror();
  1095. poperror();
  1096. decref(&sdev->r);
  1097. free(cb);
  1098. break;
  1099. case Qctl:
  1100. cb = parsecmd(a, n);
  1101. sdev = sdgetdev(DEV(c->qid));
  1102. if(sdev == nil)
  1103. error(Enonexist);
  1104. unit = sdev->unit[UNIT(c->qid)];
  1105. qlock(&unit->ctl);
  1106. if(waserror()){
  1107. qunlock(&unit->ctl);
  1108. decref(&sdev->r);
  1109. free(cb);
  1110. nexterror();
  1111. }
  1112. if(unit->vers != c->qid.vers)
  1113. error(Echange);
  1114. if(cb->nf < 1)
  1115. error(Ebadctl);
  1116. if(strcmp(cb->f[0], "part") == 0){
  1117. if(cb->nf != 4)
  1118. error(Ebadctl);
  1119. if(unit->sectors == 0 && !sdinitpart(unit))
  1120. error(Eio);
  1121. start = strtoul(cb->f[2], 0, 0);
  1122. end = strtoul(cb->f[3], 0, 0);
  1123. sdaddpart(unit, cb->f[1], start, end);
  1124. }
  1125. else if(strcmp(cb->f[0], "delpart") == 0){
  1126. if(cb->nf != 2 || unit->part == nil)
  1127. error(Ebadctl);
  1128. sddelpart(unit, cb->f[1]);
  1129. }
  1130. else if(unit->dev->ifc->wctl)
  1131. unit->dev->ifc->wctl(unit, cb);
  1132. else
  1133. error(Ebadctl);
  1134. qunlock(&unit->ctl);
  1135. decref(&sdev->r);
  1136. poperror();
  1137. free(cb);
  1138. break;
  1139. case Qraw:
  1140. sdev = sdgetdev(DEV(c->qid));
  1141. if(sdev == nil)
  1142. error(Enonexist);
  1143. unit = sdev->unit[UNIT(c->qid)];
  1144. qlock(&unit->raw);
  1145. if(waserror()){
  1146. qunlock(&unit->raw);
  1147. decref(&sdev->r);
  1148. nexterror();
  1149. }
  1150. switch(unit->state){
  1151. case Rawcmd:
  1152. if(n < 6 || n > sizeof(req->cmd))
  1153. error(Ebadarg);
  1154. if((req = malloc(sizeof(SDreq))) == nil)
  1155. error(Enomem);
  1156. req->unit = unit;
  1157. memmove(req->cmd, a, n);
  1158. req->clen = n;
  1159. req->flags = SDnosense;
  1160. req->status = ~0;
  1161. unit->req = req;
  1162. unit->state = Rawdata;
  1163. break;
  1164. case Rawstatus:
  1165. unit->state = Rawcmd;
  1166. free(unit->req);
  1167. unit->req = nil;
  1168. error(Ebadusefd);
  1169. case Rawdata:
  1170. if(unit->state != Rawdata)
  1171. error(Ebadusefd);
  1172. unit->state = Rawstatus;
  1173. unit->req->write = 1;
  1174. n = sdrio(unit->req, a, n);
  1175. }
  1176. qunlock(&unit->raw);
  1177. decref(&sdev->r);
  1178. poperror();
  1179. break;
  1180. case Qpart:
  1181. return sdbio(c, 1, a, n, off);
  1182. }
  1183. return n;
  1184. }
  1185. static int
  1186. sdwstat(Chan* c, uchar* dp, int n)
  1187. {
  1188. Dir *d;
  1189. SDpart *pp;
  1190. SDperm *perm;
  1191. SDunit *unit;
  1192. SDev *sdev;
  1193. if(c->qid.type & QTDIR)
  1194. error(Eperm);
  1195. sdev = sdgetdev(DEV(c->qid));
  1196. if(sdev == nil)
  1197. error(Enonexist);
  1198. unit = sdev->unit[UNIT(c->qid)];
  1199. qlock(&unit->ctl);
  1200. d = nil;
  1201. if(waserror()){
  1202. free(d);
  1203. qunlock(&unit->ctl);
  1204. decref(&sdev->r);
  1205. nexterror();
  1206. }
  1207. switch(TYPE(c->qid)){
  1208. default:
  1209. error(Eperm);
  1210. case Qctl:
  1211. perm = &unit->ctlperm;
  1212. break;
  1213. case Qraw:
  1214. perm = &unit->rawperm;
  1215. break;
  1216. case Qpart:
  1217. pp = &unit->part[PART(c->qid)];
  1218. if(unit->vers+pp->vers != c->qid.vers)
  1219. error(Enonexist);
  1220. perm = &pp->SDperm;
  1221. break;
  1222. }
  1223. if(strcmp(up->user, perm->user) && !iseve())
  1224. error(Eperm);
  1225. d = smalloc(sizeof(Dir)+n);
  1226. n = convM2D(dp, n, &d[0], (char*)&d[1]);
  1227. if(n == 0)
  1228. error(Eshortstat);
  1229. if(!emptystr(d[0].uid))
  1230. kstrdup(&perm->user, d[0].uid);
  1231. if(d[0].mode != ~0UL)
  1232. perm->perm = (perm->perm & ~0777) | (d[0].mode & 0777);
  1233. free(d);
  1234. qunlock(&unit->ctl);
  1235. decref(&sdev->r);
  1236. poperror();
  1237. return n;
  1238. }
  1239. static int
  1240. configure(char* spec, DevConf* cf)
  1241. {
  1242. SDev *s, *sdev;
  1243. char *p;
  1244. int i;
  1245. if(sdindex(*spec) < 0)
  1246. error("bad sd spec");
  1247. if((p = strchr(cf->type, '/')) != nil)
  1248. *p++ = '\0';
  1249. for(i = 0; sdifc[i] != nil; i++)
  1250. if(strcmp(sdifc[i]->name, cf->type) == 0)
  1251. break;
  1252. if(sdifc[i] == nil)
  1253. error("sd type not found");
  1254. if(p)
  1255. *(p-1) = '/';
  1256. if(sdifc[i]->probe == nil)
  1257. error("sd type cannot probe");
  1258. sdev = sdifc[i]->probe(cf);
  1259. for(s=sdev; s; s=s->next)
  1260. s->idno = *spec;
  1261. sdadddevs(sdev);
  1262. return 0;
  1263. }
  1264. static int
  1265. unconfigure(char* spec)
  1266. {
  1267. int i;
  1268. SDev *sdev;
  1269. SDunit *unit;
  1270. if((i = sdindex(*spec)) < 0)
  1271. error(Enonexist);
  1272. qlock(&devslock);
  1273. if((sdev = devs[i]) == nil){
  1274. qunlock(&devslock);
  1275. error(Enonexist);
  1276. }
  1277. if(sdev->r.ref){
  1278. qunlock(&devslock);
  1279. error(Einuse);
  1280. }
  1281. devs[i] = nil;
  1282. qunlock(&devslock);
  1283. /* make sure no interrupts arrive anymore before removing resources */
  1284. if(sdev->enabled && sdev->ifc->disable)
  1285. sdev->ifc->disable(sdev);
  1286. for(i = 0; i != sdev->nunit; i++){
  1287. if(unit = sdev->unit[i]){
  1288. free(unit->name);
  1289. free(unit->user);
  1290. free(unit);
  1291. }
  1292. }
  1293. if(sdev->ifc->clear)
  1294. sdev->ifc->clear(sdev);
  1295. free(sdev);
  1296. return 0;
  1297. }
  1298. static int
  1299. sdconfig(int on, char* spec, DevConf* cf)
  1300. {
  1301. if(on)
  1302. return configure(spec, cf);
  1303. return unconfigure(spec);
  1304. }
  1305. Dev sddevtab = {
  1306. 'S',
  1307. "sd",
  1308. sdreset,
  1309. devinit,
  1310. devshutdown,
  1311. sdattach,
  1312. sdwalk,
  1313. sdstat,
  1314. sdopen,
  1315. devcreate,
  1316. sdclose,
  1317. sdread,
  1318. devbread,
  1319. sdwrite,
  1320. devbwrite,
  1321. devremove,
  1322. sdwstat,
  1323. devpower,
  1324. sdconfig,
  1325. };
  1326. /*
  1327. * This is wrong for so many reasons. This code must go.
  1328. */
  1329. typedef struct Confdata Confdata;
  1330. struct Confdata {
  1331. int on;
  1332. char* spec;
  1333. DevConf cf;
  1334. };
  1335. static void
  1336. parseswitch(Confdata* cd, char* option)
  1337. {
  1338. if(!strcmp("on", option))
  1339. cd->on = 1;
  1340. else if(!strcmp("off", option))
  1341. cd->on = 0;
  1342. else
  1343. error(Ebadarg);
  1344. }
  1345. static void
  1346. parsespec(Confdata* cd, char* option)
  1347. {
  1348. if(strlen(option) > 1)
  1349. error(Ebadarg);
  1350. cd->spec = option;
  1351. }
  1352. static Devport*
  1353. getnewport(DevConf* dc)
  1354. {
  1355. Devport *p;
  1356. p = (Devport *)malloc((dc->nports + 1) * sizeof(Devport));
  1357. if(dc->nports > 0){
  1358. memmove(p, dc->ports, dc->nports * sizeof(Devport));
  1359. free(dc->ports);
  1360. }
  1361. dc->ports = p;
  1362. p = &dc->ports[dc->nports++];
  1363. p->size = -1;
  1364. p->port = (ulong)-1;
  1365. return p;
  1366. }
  1367. static void
  1368. parseport(Confdata* cd, char* option)
  1369. {
  1370. char *e;
  1371. Devport *p;
  1372. if(cd->cf.nports == 0 || cd->cf.ports[cd->cf.nports-1].port != (ulong)-1)
  1373. p = getnewport(&cd->cf);
  1374. else
  1375. p = &cd->cf.ports[cd->cf.nports-1];
  1376. p->port = strtol(option, &e, 0);
  1377. if(e == nil || *e != '\0')
  1378. error(Ebadarg);
  1379. }
  1380. static void
  1381. parsesize(Confdata* cd, char* option)
  1382. {
  1383. char *e;
  1384. Devport *p;
  1385. if(cd->cf.nports == 0 || cd->cf.ports[cd->cf.nports-1].size != -1)
  1386. p = getnewport(&cd->cf);
  1387. else
  1388. p = &cd->cf.ports[cd->cf.nports-1];
  1389. p->size = (int)strtol(option, &e, 0);
  1390. if(e == nil || *e != '\0')
  1391. error(Ebadarg);
  1392. }
  1393. static void
  1394. parseirq(Confdata* cd, char* option)
  1395. {
  1396. char *e;
  1397. cd->cf.intnum = strtoul(option, &e, 0);
  1398. if(e == nil || *e != '\0')
  1399. error(Ebadarg);
  1400. }
  1401. static void
  1402. parsetype(Confdata* cd, char* option)
  1403. {
  1404. cd->cf.type = option;
  1405. }
  1406. static struct {
  1407. char *name;
  1408. void (*parse)(Confdata*, char*);
  1409. } options[] = {
  1410. "switch", parseswitch,
  1411. "spec", parsespec,
  1412. "port", parseport,
  1413. "size", parsesize,
  1414. "irq", parseirq,
  1415. "type", parsetype,
  1416. };
  1417. static void
  1418. legacytopctl(Cmdbuf *cb)
  1419. {
  1420. char *opt;
  1421. int i, j;
  1422. Confdata cd;
  1423. memset(&cd, 0, sizeof cd);
  1424. cd.on = -1;
  1425. for(i=0; i<cb->nf; i+=2){
  1426. if(i+2 > cb->nf)
  1427. error(Ebadarg);
  1428. opt = cb->f[i];
  1429. for(j=0; j<nelem(options); j++)
  1430. if(strcmp(opt, options[j].name) == 0){
  1431. options[j].parse(&cd, cb->f[i+1]);
  1432. break;
  1433. }
  1434. if(j == nelem(options))
  1435. error(Ebadarg);
  1436. }
  1437. if(cd.on < 0)
  1438. error(Ebadarg);
  1439. if(cd.on
  1440. && (cd.spec == 0 || cd.cf.nports == 0 || cd.cf.intnum == 0 || cd.cf.type == nil))
  1441. error(Ebadarg);
  1442. if(!cd.on && cd.spec == 0)
  1443. error(Ebadarg);
  1444. sdconfig(cd.on, cd.spec, &cd.cf);
  1445. }