devsd.c 31 KB

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