devsd.c 30 KB

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