devacpi.c 56 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549
  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. #include "u.h"
  10. #include "../port/lib.h"
  11. #include "mem.h"
  12. #include "dat.h"
  13. #include "fns.h"
  14. #include "io.h"
  15. #include "apic.h"
  16. #include "acpi.h"
  17. /* -----------------------------------------------------------------------------
  18. * Basic ACPI device.
  19. *
  20. * The qid.Path will be made unique by incrementing lastpath. lastpath starts
  21. * at Qroot.
  22. *
  23. * Qtbl will return a pointer to the Atable, which includes the signature, OEM
  24. * data, and so on.
  25. *
  26. * Raw, at any level, dumps the raw table at that level, which by the ACPI
  27. * flattened tree layout will include all descendents.
  28. *
  29. * Qpretty, at any level, will print the pretty form for that level and all
  30. * descendants.
  31. */
  32. enum {
  33. Qroot = 0,
  34. // The type is the qid.path mod NQtypes.
  35. Qdir = 0,
  36. Qpretty,
  37. Qraw,
  38. Qtbl,
  39. NQtypes,
  40. QIndexShift = 8,
  41. QIndexMask = (1 << QIndexShift) - 1,
  42. };
  43. /* what do we need to round up to? */
  44. #define ATABLEBUFSZ ROUNDUP(sizeof(Atable), 128)
  45. static u64 lastpath;
  46. static PSlice emptyslice;
  47. static Atable **atableindex;
  48. static Rsdp *rsd = nil;
  49. static Queue *acpiev;
  50. Dev acpidevtab;
  51. static u16 pm1status;
  52. static int v = 0;
  53. /* Table of ACPI ports we own. We just burn 64k of bss here rather
  54. * than look them up in a function each time they're used. */
  55. static u8 acpiport[1 << 16];
  56. static i32 acpiioread(Chan *c, void *a, i32 n, isize off);
  57. static i32 acpiiowrite(Chan *c, void *a, i32 n, isize off);
  58. static i32 acpimemread(Chan *c, void *a, i32 n, isize off);
  59. static i32 acpiintrread(Chan *c, void *a, i32 n, isize off);
  60. static void acpiintr(Ureg *, void *);
  61. static char *
  62. devname(void)
  63. {
  64. return acpidevtab.name;
  65. }
  66. static int
  67. devdc(void)
  68. {
  69. return acpidevtab.dc;
  70. }
  71. void outofyourelement(void);
  72. #if 0
  73. /*
  74. * ACPI 4.0 Support.
  75. * Still WIP.
  76. *
  77. * This driver locates tables and parses only a small subset
  78. * of tables. All other tables are mapped and kept for the user-level
  79. * interpreter.
  80. */
  81. enum {
  82. CMirq,
  83. };
  84. static Cmdtab ctls[] = {
  85. // {CMregion, "region", 6},
  86. // {CMgpe, "gpe", 3},
  87. {CMirq, "irq", 2},
  88. };
  89. #endif
  90. static Facs *facs; /* Firmware ACPI control structure */
  91. static Fadt *fadt; /* Fixed ACPI description to reach ACPI regs */
  92. static Atable *root;
  93. static Xsdt *xsdt; /* XSDT table */
  94. static Atable *tfirst; /* loaded DSDT/SSDT/... tables */
  95. //static Atable *tlast; /* pointer to last table */
  96. Atable *apics; /* APIC info */
  97. Atable *srat; /* System resource affinity used by physalloc */
  98. Atable *dmar;
  99. static Slit *slit; /* Sys locality info table used by scheduler */
  100. static Atable *mscttbl; /* Maximum system characteristics table */
  101. //static Reg *reg; /* region used for I/O */
  102. static Gpe *gpes; /* General purpose events */
  103. static int ngpes;
  104. static char *regnames[] = {
  105. "mem",
  106. "io",
  107. "pcicfg",
  108. "embed",
  109. "smb",
  110. "cmos",
  111. "pcibar",
  112. "ipmi",
  113. };
  114. /*
  115. * Lists to store RAM that we copy ACPI tables into. When we map a new
  116. * ACPI list into the kernel, we copy it into a specifically RAM buffer
  117. * (to make sure it's not coming from e.g. slow device memory). We store
  118. * pointers to those buffers on these lists. We maintain information
  119. * about base and size to support Qraw and, hence, the ACPICA library.
  120. */
  121. struct Acpilist {
  122. struct Acpilist *next;
  123. usize base;
  124. usize size;
  125. u8 raw[];
  126. };
  127. typedef struct Acpilist Acpilist;
  128. static Acpilist *acpilists;
  129. /*
  130. * Given a base address, bind the list that contains it.
  131. * It's possible and allowed for ACPICA to ask for a bigger region,
  132. * so size matters.
  133. */
  134. static Acpilist *
  135. findlist(usize base, u32 size)
  136. {
  137. Acpilist *a = acpilists;
  138. if(v)
  139. print("findlist: find %p\n", (void *)base);
  140. for(; a; a = a->next){
  141. if((base >= a->base) && ((base + size) < (a->base + a->size))){
  142. return a;
  143. }
  144. }
  145. if(v)
  146. print("Can't find list for %p\n", (void *)base);
  147. return nil;
  148. }
  149. /*
  150. * Produces an Atable at some level in the tree. Note that Atables are
  151. * isomorphic to directories in the file system namespace; this code
  152. * ensures that invariant.
  153. */
  154. Atable *
  155. mkatable(Atable *parent,
  156. int type, char *name, u8 *raw,
  157. usize rawsize, usize addsize)
  158. {
  159. void *m;
  160. Atable *t;
  161. m = mallocz(ATABLEBUFSZ + addsize, 1);
  162. if(m == nil)
  163. panic("no memory for more aml tables");
  164. t = m;
  165. t->parent = parent;
  166. t->tbl = nil;
  167. if(addsize != 0)
  168. t->tbl = m + ATABLEBUFSZ;
  169. t->rawsize = rawsize;
  170. t->raw = raw;
  171. strlcpy(t->name, name, sizeof(t->name));
  172. mkqid(&t->qid, (lastpath << QIndexShift) + Qdir, 0, QTDIR);
  173. mkqid(&t->rqid, (lastpath << QIndexShift) + Qraw, 0, 0);
  174. mkqid(&t->pqid, (lastpath << QIndexShift) + Qpretty, 0, 0);
  175. mkqid(&t->tqid, (lastpath << QIndexShift) + Qtbl, 0, 0);
  176. lastpath++;
  177. return t;
  178. }
  179. Atable *
  180. finatable(Atable *t, PSlice *slice)
  181. {
  182. usize n;
  183. Atable *tail;
  184. Dirtab *dirs;
  185. n = pslicelen(slice);
  186. t->nchildren = n;
  187. t->children = (Atable **)pslicefinalize(slice);
  188. dirs = reallocarray(nil, n + NQtypes, sizeof(Dirtab));
  189. assert(dirs != nil);
  190. dirs[0] = (Dirtab){".", t->qid, 0, 0555};
  191. dirs[1] = (Dirtab){"pretty", t->pqid, 0, 0444};
  192. dirs[2] = (Dirtab){"raw", t->rqid, t->rawsize, 0444};
  193. dirs[3] = (Dirtab){"table", t->tqid, 0, 0444};
  194. dirs[4] = (Dirtab){"ctl", t->tqid, 0, 0666};
  195. for(usize i = 0; i < n; i++){
  196. strlcpy(dirs[i + NQtypes].name, t->children[i]->name, KNAMELEN);
  197. dirs[i + NQtypes].qid = t->children[i]->qid;
  198. dirs[i + NQtypes].length = 0;
  199. dirs[i + NQtypes].perm = DMDIR | 0555;
  200. }
  201. t->cdirs = dirs;
  202. tail = nil;
  203. while(n-- > 0){
  204. t->children[n]->next = tail;
  205. tail = t->children[n];
  206. }
  207. return t;
  208. }
  209. Atable *
  210. finatable_nochildren(Atable *t)
  211. {
  212. return finatable(t, &emptyslice);
  213. }
  214. static char *dumpGas(char *start, char *end, char *prefix, Gas *g);
  215. static void dumpxsdt(void);
  216. static char *
  217. acpiregstr(int id)
  218. {
  219. static char buf[20]; /* BUG */
  220. if(id >= 0 && id < nelem(regnames))
  221. return regnames[id];
  222. seprint(buf, buf + sizeof(buf), "spc:%#x", id);
  223. return buf;
  224. }
  225. static int
  226. acpiregid(char *s)
  227. {
  228. for(int i = 0; i < nelem(regnames); i++)
  229. if(strcmp(regnames[i], s) == 0)
  230. return i;
  231. return -1;
  232. }
  233. /*
  234. * TODO(rminnich): Fix these if we're ever on a different-endian machine.
  235. * They are specific to little-endian processors and are not portable.
  236. */
  237. static u8
  238. mget8(usize p, void *unused)
  239. {
  240. u8 *cp = (u8 *)p;
  241. return *cp;
  242. }
  243. static void
  244. mset8(usize p, u8 v, void *unused)
  245. {
  246. u8 *cp = (u8 *)p;
  247. *cp = v;
  248. }
  249. static u16
  250. mget16(usize p, void *unused)
  251. {
  252. u16 *cp = (u16 *)p;
  253. return *cp;
  254. }
  255. static void
  256. mset16(usize p, u16 v, void *unused)
  257. {
  258. u16 *cp = (u16 *)p;
  259. *cp = v;
  260. }
  261. static u32
  262. mget32(usize p, void *unused)
  263. {
  264. u32 *cp = (u32 *)p;
  265. return *cp;
  266. }
  267. static void
  268. mset32(usize p, u32 v, void *unused)
  269. {
  270. u32 *cp = (u32 *)p;
  271. *cp = v;
  272. }
  273. static u64
  274. mget64(usize p, void *unused)
  275. {
  276. u64 *cp = (u64 *)p;
  277. return *cp;
  278. }
  279. static void
  280. mset64(usize p, u64 v, void *unused)
  281. {
  282. u64 *cp = (u64 *)p;
  283. *cp = v;
  284. }
  285. static u8
  286. ioget8(usize p, void *unused)
  287. {
  288. return inb(p);
  289. }
  290. static void
  291. ioset8(usize p, u8 v, void *unused)
  292. {
  293. outb(p, v);
  294. }
  295. static u16
  296. ioget16(usize p, void *unused)
  297. {
  298. return ins(p);
  299. }
  300. static void
  301. ioset16(usize p, u16 v, void *unused)
  302. {
  303. outs(p, v);
  304. }
  305. static u32
  306. ioget32(usize p, void *unused)
  307. {
  308. return inl(p);
  309. }
  310. static void
  311. ioset32(usize p, u32 v, void *unused)
  312. {
  313. outl(p, v);
  314. }
  315. static u8
  316. cfgget8(usize p, void *r)
  317. {
  318. Reg *ro = r;
  319. Pcidev d;
  320. d.tbdf = ro->tbdf;
  321. return pcicfgr8(&d, p);
  322. }
  323. static void
  324. cfgset8(usize p, u8 v, void *r)
  325. {
  326. Reg *ro = r;
  327. Pcidev d;
  328. d.tbdf = ro->tbdf;
  329. pcicfgw8(&d, p, v);
  330. }
  331. static u16
  332. cfgget16(usize p, void *r)
  333. {
  334. Reg *ro = r;
  335. Pcidev d;
  336. d.tbdf = ro->tbdf;
  337. return pcicfgr16(&d, p);
  338. }
  339. static void
  340. cfgset16(usize p, u16 v, void *r)
  341. {
  342. Reg *ro = r;
  343. Pcidev d;
  344. d.tbdf = ro->tbdf;
  345. pcicfgw16(&d, p, v);
  346. }
  347. static u32
  348. cfgget32(usize p, void *r)
  349. {
  350. Reg *ro = r;
  351. Pcidev d;
  352. d.tbdf = ro->tbdf;
  353. return pcicfgr32(&d, p);
  354. }
  355. static void
  356. cfgset32(usize p, u32 v, void *r)
  357. {
  358. Reg *ro = r;
  359. Pcidev d;
  360. d.tbdf = ro->tbdf;
  361. pcicfgw32(&d, p, v);
  362. }
  363. static struct Regio memio = {
  364. nil,
  365. mget8, mset8, mget16, mset16,
  366. mget32, mset32, mget64, mset64};
  367. static struct Regio ioio = {
  368. nil,
  369. ioget8, ioset8, ioget16, ioset16,
  370. ioget32, ioset32, nil, nil};
  371. static struct Regio cfgio = {
  372. nil,
  373. cfgget8, cfgset8, cfgget16, cfgset16,
  374. cfgget32, cfgset32, nil, nil};
  375. /*
  376. * Copy memory, 1/2/4/8-bytes at a time, to/from a region.
  377. */
  378. static long
  379. regcpy(Regio *dio, usize da, Regio *sio,
  380. usize sa, long len, int align)
  381. {
  382. int n, i;
  383. print("regcpy %#p %#p %#p %#p\n", da, sa, len, align);
  384. if((len % align) != 0)
  385. print("regcpy: bug: copy not aligned. truncated\n");
  386. n = len / align;
  387. for(i = 0; i < n; i++){
  388. switch(align){
  389. case 1:
  390. print("cpy8 %#p %#p\n", da, sa);
  391. dio->set8(da, sio->get8(sa, sio->arg), dio->arg);
  392. break;
  393. case 2:
  394. print("cpy16 %#p %#p\n", da, sa);
  395. dio->set16(da, sio->get16(sa, sio->arg), dio->arg);
  396. break;
  397. case 4:
  398. print("cpy32 %#p %#p\n", da, sa);
  399. dio->set32(da, sio->get32(sa, sio->arg), dio->arg);
  400. break;
  401. case 8:
  402. print("cpy64 %#p %#p\n", da, sa);
  403. print("Not doing set64 for some reason, fix me!");
  404. // dio->set64(da, sio->get64(sa, sio->arg), dio->arg);
  405. break;
  406. default:
  407. panic("regcpy: align bug");
  408. }
  409. da += align;
  410. sa += align;
  411. }
  412. return n * align;
  413. }
  414. /*
  415. * Perform I/O within region in access units of accsz bytes.
  416. * All units in bytes.
  417. */
  418. static long
  419. regio(Reg *r, void *p, u32 len, usize off, int iswr)
  420. {
  421. Regio rio;
  422. usize rp;
  423. print("reg%s %s %#p %#p %#lx sz=%d\n",
  424. iswr ? "out" : "in", r->name, p, off, len, r->accsz);
  425. rp = 0;
  426. if(off + len > r->len){
  427. print("regio: access outside limits");
  428. len = r->len - off;
  429. }
  430. if(len <= 0){
  431. print("regio: zero len\n");
  432. return 0;
  433. }
  434. switch(r->spc){
  435. case Rsysmem:
  436. if(r->p == nil)
  437. r->p = vmap(r->base, len);
  438. if(r->p == nil)
  439. error("regio: KADDR failed");
  440. rp = (usize)r->p + off;
  441. rio = memio;
  442. break;
  443. case Rsysio:
  444. rp = r->base + off;
  445. rio = ioio;
  446. break;
  447. case Rpcicfg:
  448. rp = r->base + off;
  449. rio = cfgio;
  450. rio.arg = r;
  451. break;
  452. case Rpcibar:
  453. case Rembed:
  454. case Rsmbus:
  455. case Rcmos:
  456. case Ripmi:
  457. case Rfixedhw:
  458. print("regio: reg %s not supported\n", acpiregstr(r->spc));
  459. error("region not supported");
  460. }
  461. if(iswr)
  462. regcpy(&rio, rp, &memio, (usize)p, len, r->accsz);
  463. else
  464. regcpy(&memio, (usize)p, &rio, rp, len, r->accsz);
  465. return len;
  466. }
  467. /*
  468. * Compute and return SDT checksum: '0' is a correct sum.
  469. */
  470. static u8
  471. sdtchecksum(void *addr, int len)
  472. {
  473. u8 *p;
  474. unsigned int sum;
  475. sum = 0;
  476. if(v)
  477. print("check %p %d\n", addr, len);
  478. for(p = addr; len-- > 0; p++)
  479. sum += *p;
  480. sum &= 0xFF; // The checksum is only the low 8 bits.
  481. if(v)
  482. print("sum is 0x%x\n", sum);
  483. return (u8)sum;
  484. }
  485. static void *
  486. sdtmap(usize pa, usize want, usize *n, int cksum)
  487. {
  488. Sdthdr *sdt;
  489. Acpilist *p;
  490. if(v)
  491. print("sdtmap %p\n", (void *)pa);
  492. if(!pa){
  493. print("sdtmap: nil pa\n");
  494. return nil;
  495. }
  496. sdt = KADDR(pa);
  497. if(want){
  498. sdt = vmap(pa, want);
  499. if (sdt == nil) {
  500. print("acpi: vmap full table @%p/0x%x: nil\n", (void *)pa, want);
  501. return nil;
  502. }
  503. /* realistically, we get a full page, and acpica seems to know that somehow. */
  504. usize endaddress = (usize)sdt;
  505. endaddress += want + 0xfff;
  506. endaddress &= ~0xfff;
  507. want = endaddress - (usize)sdt;
  508. *n = want;
  509. } else {
  510. sdt = vmap(pa, sizeof(Sdthdr));
  511. if (sdt == nil) {
  512. print("acpi: vmap header@%p/%d: nil\n", (void *)pa, sizeof(Sdthdr));
  513. return nil;
  514. }
  515. if(v){
  516. hexdump(sdt, sizeof(Sdthdr));
  517. print("sdt %p\n", sdt);
  518. }
  519. *n = l32get(sdt->length);
  520. if(v)
  521. print("*n is %d\n", *n);
  522. if(*n == 0){
  523. print("sdt has zero length: pa = %p, sig = %.4s\n", pa, sdt->sig);
  524. return nil;
  525. }
  526. sdt = vmap(pa, *n);
  527. if (sdt == nil) {
  528. print("acpi: vmap full table @%p/0x%x: nil\n", (void *)pa, *n);
  529. return nil;
  530. }
  531. if(v)print("check it\n");
  532. if(cksum != 0 && sdtchecksum(sdt, *n) != 0){
  533. print("acpi: %c%c%c%c: bad checksum. pa = %p, len = %lu\n", sdt->sig[0], sdt->sig[1], sdt->sig[2], sdt->sig[3], pa, *n);
  534. return nil;
  535. }
  536. }
  537. if(v)
  538. print("now mallocz\n");
  539. p = mallocz(sizeof(Acpilist) + *n, 1);
  540. if(v)
  541. print("malloc'ed %p\n", p);
  542. if(p == nil)
  543. panic("sdtmap: memory allocation failed for %lu bytes", *n);
  544. if(v)
  545. print("move (%p, %p, %d)\n", p->raw, (void *)sdt, *n);
  546. memmove(p->raw, (void *)sdt, *n);
  547. p->base = pa;
  548. p->size = *n;
  549. p->next = acpilists;
  550. acpilists = p;
  551. if(v)
  552. print("sdtmap: size %d\n", *n);
  553. return p->raw;
  554. }
  555. static int
  556. loadfacs(usize pa)
  557. {
  558. usize n;
  559. facs = sdtmap(pa, 0, &n, 0);
  560. if(facs == nil)
  561. return -1;
  562. if(memcmp(facs->sig, "FACS", 4) != 0){
  563. facs = nil;
  564. return -1;
  565. }
  566. /* no unmap */
  567. if(0){
  568. print("acpi: facs: hwsig: %#p\n", facs->hwsig);
  569. print("acpi: facs: wakingv: %#p\n", facs->wakingv);
  570. print("acpi: facs: flags: %#p\n", facs->flags);
  571. print("acpi: facs: glock: %#p\n", facs->glock);
  572. print("acpi: facs: xwakingv: %#p\n", facs->xwakingv);
  573. print("acpi: facs: vers: %#p\n", facs->vers);
  574. print("acpi: facs: ospmflags: %#p\n", facs->ospmflags);
  575. }
  576. return 0;
  577. }
  578. static void
  579. loaddsdt(usize pa)
  580. {
  581. usize n;
  582. u8 *dsdtp;
  583. dsdtp = sdtmap(pa, 0, &n, 1);
  584. if(v)
  585. print("Loaded it\n");
  586. if(dsdtp == nil){
  587. print("acpi: Failed to map dsdtp.\n");
  588. return;
  589. }
  590. }
  591. static void
  592. gasget(Gas *gas, u8 *p)
  593. {
  594. gas->spc = p[0];
  595. gas->len = p[1];
  596. gas->off = p[2];
  597. gas->accsz = p[3];
  598. gas->addr = l64get(p + 4);
  599. }
  600. static char *
  601. dumpfadt(char *start, char *end, Fadt *fp)
  602. {
  603. if(fp == nil)
  604. return start;
  605. start = seprint(start, end, "acpi: FADT@%p\n", fp);
  606. start = seprint(start, end, "acpi: fadt: facs: $%p\n", fp->facs);
  607. start = seprint(start, end, "acpi: fadt: dsdt: $%p\n", fp->dsdt);
  608. start = seprint(start, end, "acpi: fadt: pmprofile: $%p\n", fp->pmprofile);
  609. start = seprint(start, end, "acpi: fadt: sciint: $%p\n", fp->sciint);
  610. start = seprint(start, end, "acpi: fadt: smicmd: $%p\n", fp->smicmd);
  611. start = seprint(start, end, "acpi: fadt: acpienable: $%p\n", fp->acpienable);
  612. start = seprint(start, end, "acpi: fadt: acpidisable: $%p\n", fp->acpidisable);
  613. start = seprint(start, end, "acpi: fadt: s4biosreq: $%p\n", fp->s4biosreq);
  614. start = seprint(start, end, "acpi: fadt: pstatecnt: $%p\n", fp->pstatecnt);
  615. start = seprint(start, end, "acpi: fadt: pm1aevtblk: $%p\n", fp->pm1aevtblk);
  616. start = seprint(start, end, "acpi: fadt: pm1bevtblk: $%p\n", fp->pm1bevtblk);
  617. start = seprint(start, end, "acpi: fadt: pm1acntblk: $%p\n", fp->pm1acntblk);
  618. start = seprint(start, end, "acpi: fadt: pm1bcntblk: $%p\n", fp->pm1bcntblk);
  619. start = seprint(start, end, "acpi: fadt: pm2cntblk: $%p\n", fp->pm2cntblk);
  620. start = seprint(start, end, "acpi: fadt: pmtmrblk: $%p\n", fp->pmtmrblk);
  621. start = seprint(start, end, "acpi: fadt: gpe0blk: $%p\n", fp->gpe0blk);
  622. start = seprint(start, end, "acpi: fadt: gpe1blk: $%p\n", fp->gpe1blk);
  623. start = seprint(start, end, "acpi: fadt: pm1evtlen: $%p\n", fp->pm1evtlen);
  624. start = seprint(start, end, "acpi: fadt: pm1cntlen: $%p\n", fp->pm1cntlen);
  625. start = seprint(start, end, "acpi: fadt: pm2cntlen: $%p\n", fp->pm2cntlen);
  626. start = seprint(start, end, "acpi: fadt: pmtmrlen: $%p\n", fp->pmtmrlen);
  627. start = seprint(start, end, "acpi: fadt: gpe0blklen: $%p\n", fp->gpe0blklen);
  628. start = seprint(start, end, "acpi: fadt: gpe1blklen: $%p\n", fp->gpe1blklen);
  629. start = seprint(start, end, "acpi: fadt: gp1base: $%p\n", fp->gp1base);
  630. start = seprint(start, end, "acpi: fadt: cstcnt: $%p\n", fp->cstcnt);
  631. start = seprint(start, end, "acpi: fadt: plvl2lat: $%p\n", fp->plvl2lat);
  632. start = seprint(start, end, "acpi: fadt: plvl3lat: $%p\n", fp->plvl3lat);
  633. start = seprint(start, end, "acpi: fadt: flushsz: $%p\n", fp->flushsz);
  634. start = seprint(start, end, "acpi: fadt: flushstride: $%p\n", fp->flushstride);
  635. start = seprint(start, end, "acpi: fadt: dutyoff: $%p\n", fp->dutyoff);
  636. start = seprint(start, end, "acpi: fadt: dutywidth: $%p\n", fp->dutywidth);
  637. start = seprint(start, end, "acpi: fadt: dayalrm: $%p\n", fp->dayalrm);
  638. start = seprint(start, end, "acpi: fadt: monalrm: $%p\n", fp->monalrm);
  639. start = seprint(start, end, "acpi: fadt: century: $%p\n", fp->century);
  640. start = seprint(start, end, "acpi: fadt: iapcbootarch: $%p\n", fp->iapcbootarch);
  641. start = seprint(start, end, "acpi: fadt: flags: $%p\n", fp->flags);
  642. start = dumpGas(start, end, "acpi: fadt: resetreg: ", &fp->resetreg);
  643. start = seprint(start, end, "acpi: fadt: resetval: $%p\n", fp->resetval);
  644. start = seprint(start, end, "acpi: fadt: xfacs: $%p\n", fp->xfacs);
  645. start = seprint(start, end, "acpi: fadt: xdsdt: $%p\n", fp->xdsdt);
  646. start = dumpGas(start, end, "acpi: fadt: xpm1aevtblk:", &fp->xpm1aevtblk);
  647. start = dumpGas(start, end, "acpi: fadt: xpm1bevtblk:", &fp->xpm1bevtblk);
  648. start = dumpGas(start, end, "acpi: fadt: xpm1acntblk:", &fp->xpm1acntblk);
  649. start = dumpGas(start, end, "acpi: fadt: xpm1bcntblk:", &fp->xpm1bcntblk);
  650. start = dumpGas(start, end, "acpi: fadt: xpm2cntblk:", &fp->xpm2cntblk);
  651. start = dumpGas(start, end, "acpi: fadt: xpmtmrblk:", &fp->xpmtmrblk);
  652. start = dumpGas(start, end, "acpi: fadt: xgpe0blk:", &fp->xgpe0blk);
  653. start = dumpGas(start, end, "acpi: fadt: xgpe1blk:", &fp->xgpe1blk);
  654. return start;
  655. }
  656. static Atable *
  657. parsefadt(Atable *parent, char *name, u8 *p, usize rawsize)
  658. {
  659. Atable *t;
  660. Fadt *fp;
  661. t = mkatable(parent, FADT, name, p, rawsize, sizeof(Fadt));
  662. if(rawsize < 116){
  663. print("ACPI: unusually short FADT, aborting!\n");
  664. return t;
  665. }
  666. /* for now, keep the globals. We'll get rid of them later. */
  667. fp = t->tbl;
  668. fadt = fp;
  669. fp->facs = l32get(p + 36);
  670. fp->dsdt = l32get(p + 40);
  671. fp->pmprofile = p[45];
  672. fp->sciint = l16get(p + 46);
  673. fp->smicmd = l32get(p + 48);
  674. fp->acpienable = p[52];
  675. fp->acpidisable = p[53];
  676. fp->s4biosreq = p[54];
  677. fp->pstatecnt = p[55];
  678. fp->pm1aevtblk = l32get(p + 56);
  679. fp->pm1bevtblk = l32get(p + 60);
  680. fp->pm1acntblk = l32get(p + 64);
  681. fp->pm1bcntblk = l32get(p + 68);
  682. fp->pm2cntblk = l32get(p + 72);
  683. fp->pmtmrblk = l32get(p + 76);
  684. fp->gpe0blk = l32get(p + 80);
  685. fp->gpe1blk = l32get(p + 84);
  686. fp->pm1evtlen = p[88];
  687. fp->pm1cntlen = p[89];
  688. fp->pm2cntlen = p[90];
  689. fp->pmtmrlen = p[91];
  690. fp->gpe0blklen = p[92];
  691. fp->gpe1blklen = p[93];
  692. fp->gp1base = p[94];
  693. fp->cstcnt = p[95];
  694. fp->plvl2lat = l16get(p + 96);
  695. fp->plvl3lat = l16get(p + 98);
  696. fp->flushsz = l16get(p + 100);
  697. fp->flushstride = l16get(p + 102);
  698. fp->dutyoff = p[104];
  699. fp->dutywidth = p[105];
  700. fp->dayalrm = p[106];
  701. fp->monalrm = p[107];
  702. fp->century = p[108];
  703. fp->iapcbootarch = l16get(p + 109);
  704. fp->flags = l32get(p + 112);
  705. /*
  706. * qemu gives us a 116 byte fadt, though i haven't seen any HW do that.
  707. * The right way to do this is to realloc the table and fake it out.
  708. */
  709. if(rawsize >= 244){
  710. gasget(&fp->resetreg, p + 116);
  711. fp->resetval = p[128];
  712. fp->xfacs = l64get(p + 132);
  713. fp->xdsdt = l64get(p + 140);
  714. gasget(&fp->xpm1aevtblk, p + 148);
  715. gasget(&fp->xpm1bevtblk, p + 160);
  716. gasget(&fp->xpm1acntblk, p + 172);
  717. gasget(&fp->xpm1bcntblk, p + 184);
  718. gasget(&fp->xpm2cntblk, p + 196);
  719. gasget(&fp->xpmtmrblk, p + 208);
  720. gasget(&fp->xgpe0blk, p + 220);
  721. gasget(&fp->xgpe1blk, p + 232);
  722. }
  723. if(v)
  724. print("xfacs %#llx facs %#llx\n", fp->xfacs, fp->facs);
  725. if(fp->xfacs != 0)
  726. loadfacs(fp->xfacs);
  727. else
  728. loadfacs(fp->facs);
  729. if(v)
  730. print("x %p %p %p \n", fp, (void *)fp->xdsdt, (void *)(u64)fp->dsdt);
  731. if(v)
  732. print("fp->xdsdt %#llx facs %#llx\n", fp->xdsdt, fp->dsdt);
  733. if(fp->xdsdt == (u64)fp->dsdt) /* acpica */
  734. loaddsdt(fp->xdsdt);
  735. else
  736. loaddsdt(fp->dsdt);
  737. if(v)
  738. print("y\n");
  739. return finatable_nochildren(t);
  740. }
  741. static char *
  742. dumpmsct(char *start, char *end, Atable *table)
  743. {
  744. Msct *msct;
  745. if(!table)
  746. return start;
  747. msct = table->tbl;
  748. if(!msct)
  749. return start;
  750. start = seprint(start, end, "acpi: msct: %d doms %d clkdoms %#p maxpa\n",
  751. msct->ndoms, msct->nclkdoms, msct->maxpa);
  752. for(int i = 0; i < table->nchildren; i++){
  753. Atable *domtbl = table->children[i]->tbl;
  754. Mdom *st = domtbl->tbl;
  755. start = seprint(start, end, "\t[%d:%d] %d maxproc %#p maxmmem\n",
  756. st->start, st->end, st->maxproc, st->maxmem);
  757. }
  758. start = seprint(start, end, "\n");
  759. return start;
  760. }
  761. /*
  762. * XXX: should perhaps update our idea of available memory.
  763. * Else we should remove this code.
  764. */
  765. static Atable *
  766. parsemsct(Atable *parent, char *name, u8 *raw, usize rawsize)
  767. {
  768. Atable *t;
  769. u8 *r, *re;
  770. Msct *msct;
  771. usize off, nmdom;
  772. int i;
  773. re = raw + rawsize;
  774. off = l32get(raw + 36);
  775. nmdom = 0;
  776. for(r = raw + off, re = raw + rawsize; r < re; r += 22)
  777. nmdom++;
  778. t = mkatable(parent, MSCT, name, raw, rawsize,
  779. sizeof(Msct) + nmdom * sizeof(Mdom));
  780. msct = t->tbl;
  781. msct->ndoms = l32get(raw + 40) + 1;
  782. msct->nclkdoms = l32get(raw + 44) + 1;
  783. msct->maxpa = l64get(raw + 48);
  784. msct->ndoms = nmdom;
  785. msct->dom = nil;
  786. if(nmdom != 0)
  787. msct->dom = (void *)msct + sizeof(Msct);
  788. for(i = 0, r = raw; i < nmdom; i++, r += 22){
  789. msct->dom[i].start = l32get(r + 2);
  790. msct->dom[i].end = l32get(r + 6);
  791. msct->dom[i].maxproc = l32get(r + 10);
  792. msct->dom[i].maxmem = l64get(r + 14);
  793. }
  794. mscttbl = finatable_nochildren(t);
  795. return mscttbl;
  796. }
  797. /* TODO(rminnich): only handles on IOMMU for now. */
  798. static char *
  799. dumpdmar(char *start, char *end, Atable *dmar)
  800. {
  801. Dmar *dt;
  802. if(dmar == nil)
  803. return start;
  804. dt = dmar->tbl;
  805. start = seprint(start, end, "acpi: DMAR addr %p:\n", dt);
  806. start = seprint(start, end, "\tdmar: intr_remap %d haw %d\n",
  807. dt->intr_remap, dt->haw);
  808. for(int i = 0; i < dmar->nchildren; i++){
  809. Atable *at = dmar->children[i];
  810. Drhd *drhd = at->tbl;
  811. start = seprint(start, end, "\tDRHD: ");
  812. start = seprint(start, end, "%s 0x%02x 0x%016x\n",
  813. drhd->all & 1 ? "INCLUDE_PCI_ALL" : "Scoped",
  814. drhd->segment, drhd->rba);
  815. }
  816. return start;
  817. }
  818. static char *
  819. dumpsrat(char *start, char *end, Atable *table)
  820. {
  821. if(table == nil)
  822. return seprint(start, end, "NO SRAT\n");
  823. start = seprint(start, end, "acpi: SRAT@%p:\n", table->tbl);
  824. for(; table != nil; table = table->next){
  825. Srat *st = table->tbl;
  826. if(st == nil)
  827. continue;
  828. switch(st->type){
  829. case SRlapic:
  830. start = seprint(start, end,
  831. "\tlapic: dom %d apic %d sapic %d clk %d\n",
  832. st->lapic.dom, st->lapic.apic, st->lapic.sapic,
  833. st->lapic.clkdom);
  834. break;
  835. case SRmem:
  836. start = seprint(start, end, "\tmem: dom %d %#p %#p %c%c\n",
  837. st->mem.dom, st->mem.addr, st->mem.len,
  838. st->mem.hplug ? 'h' : '-',
  839. st->mem.nvram ? 'n' : '-');
  840. break;
  841. case SRlx2apic:
  842. start = seprint(start, end, "\tlx2apic: dom %d apic %d clk %d\n",
  843. st->lx2apic.dom, st->lx2apic.apic,
  844. st->lx2apic.clkdom);
  845. break;
  846. default:
  847. start = seprint(start, end, "\t<unknown srat entry>\n");
  848. }
  849. }
  850. start = seprint(start, end, "\n");
  851. return start;
  852. }
  853. static Atable *
  854. parsesrat(Atable *parent, char *name, u8 *p, usize rawsize)
  855. {
  856. Atable *t, *tt;
  857. u8 *pe;
  858. int stlen, flags;
  859. PSlice slice;
  860. char buf[16];
  861. int i;
  862. Srat *st;
  863. /* TODO: Parse the second SRAT */
  864. if(srat != nil){
  865. print("Multiple SRATs detected and ignored!");
  866. return nil;
  867. }
  868. t = mkatable(parent, SRAT, name, p, rawsize, 0);
  869. psliceinit(&slice);
  870. pe = p + rawsize;
  871. for(p += 48, i = 0; p < pe; p += stlen, i++){
  872. snprint(buf, sizeof(buf), "%d", i);
  873. stlen = p[1];
  874. tt = mkatable(t, SRAT, buf, p, stlen, sizeof(Srat));
  875. st = tt->tbl;
  876. st->type = p[0];
  877. switch(st->type){
  878. case SRlapic:
  879. st->lapic.dom = p[2] | p[9] << 24 | p[10] << 16 | p[11] << 8;
  880. st->lapic.apic = p[3];
  881. st->lapic.sapic = p[8];
  882. st->lapic.clkdom = l32get(p + 12);
  883. if(l32get(p + 4) == 0){
  884. free(tt);
  885. tt = nil;
  886. }
  887. break;
  888. case SRmem:
  889. st->mem.dom = l32get(p + 2);
  890. st->mem.addr = l64get(p + 8);
  891. st->mem.len = l64get(p + 16);
  892. flags = l32get(p + 28);
  893. if((flags & 1) == 0) { /* not enabled */
  894. free(tt);
  895. tt = nil;
  896. } else {
  897. st->mem.hplug = flags & 2;
  898. st->mem.nvram = flags & 4;
  899. }
  900. break;
  901. case SRlx2apic:
  902. st->lx2apic.dom = l32get(p + 4);
  903. st->lx2apic.apic = l32get(p + 8);
  904. st->lx2apic.clkdom = l32get(p + 16);
  905. if(l32get(p + 12) == 0){
  906. free(tt);
  907. tt = nil;
  908. }
  909. break;
  910. default:
  911. print("unknown SRAT structure\n");
  912. free(tt);
  913. tt = nil;
  914. break;
  915. }
  916. if(tt != nil){
  917. finatable_nochildren(tt);
  918. psliceappend(&slice, tt);
  919. }
  920. }
  921. srat = finatable(t, &slice);
  922. return srat;
  923. }
  924. static char *
  925. dumpslit(char *start, char *end, Slit *sl)
  926. {
  927. int i;
  928. if(sl == nil)
  929. return start;
  930. start = seprint(start, end, "acpi slit:\n");
  931. for(i = 0; i < sl->rowlen * sl->rowlen; i++){
  932. start = seprint(start, end,
  933. "slit: %x\n",
  934. sl->e[i / sl->rowlen][i % sl->rowlen].dist);
  935. }
  936. start = seprint(start, end, "\n");
  937. return start;
  938. }
  939. static int
  940. cmpslitent(void *v1, void *v2)
  941. {
  942. SlEntry *se1, *se2;
  943. se1 = v1;
  944. se2 = v2;
  945. return se1->dist - se2->dist;
  946. }
  947. static Atable *
  948. parseslit(Atable *parent,
  949. char *name, u8 *raw, usize rawsize)
  950. {
  951. Atable *t;
  952. u8 *r, *re;
  953. int i;
  954. SlEntry *se;
  955. usize addsize, rowlen;
  956. void *p;
  957. addsize = sizeof(*slit);
  958. rowlen = l64get(raw + 36);
  959. addsize += rowlen * sizeof(SlEntry *);
  960. addsize += sizeof(SlEntry) * rowlen * rowlen;
  961. t = mkatable(parent, SLIT, name, raw, rawsize, addsize);
  962. slit = t->tbl;
  963. slit->rowlen = rowlen;
  964. p = (void *)slit + sizeof(*slit);
  965. slit->e = p;
  966. p += rowlen * sizeof(SlEntry *);
  967. for(i = 0; i < rowlen; i++){
  968. slit->e[i] = p;
  969. p += sizeof(SlEntry) * rowlen;
  970. }
  971. for(i = 0, r = raw + 44, re = raw + rawsize; r < re; r++, i++){
  972. int j = i / rowlen;
  973. int k = i % rowlen;
  974. se = &slit->e[j][k];
  975. se->dom = k;
  976. se->dist = *r;
  977. }
  978. #if 0
  979. /* TODO: might need to sort this shit */
  980. for (i = 0; i < slit->rowlen; i++)
  981. qsort(slit->e[i], slit->rowlen, sizeof(slit->e[0][0]), cmpslitent);
  982. #endif
  983. return finatable_nochildren(t);
  984. }
  985. /*
  986. * we use mp->machno (or index in Mach array) as the identifier,
  987. * but ACPI relies on the apic identifier.
  988. */
  989. int
  990. corecolor(int core)
  991. {
  992. /* FIXME */
  993. return -1;
  994. #if 0
  995. Mach *m;
  996. Srat *sl;
  997. static int colors[32];
  998. if(core < 0 || core >= MACHMAX)
  999. return -1;
  1000. m = sys->machptr[core];
  1001. if(m == nil)
  1002. return -1;
  1003. if(core >= 0 && core < nelem(colors) && colors[core] != 0)
  1004. return colors[core] - 1;
  1005. for(sl = srat; sl != nil; sl = sl->next)
  1006. if(sl->type == SRlapic && sl->lapic.apic == m->apicno){
  1007. if(core >= 0 && core < nelem(colors))
  1008. colors[core] = 1 + sl->lapic.dom;
  1009. return sl->lapic.dom;
  1010. }
  1011. return -1;
  1012. #endif
  1013. }
  1014. int
  1015. pickcore(int mycolor, int index)
  1016. {
  1017. if(slit == nil)
  1018. return 0;
  1019. return 0;
  1020. #if 0
  1021. int color;
  1022. int ncorepercol;
  1023. ncorepercol = num_cores / slit->rowlen;
  1024. color = slit->e[mycolor][index / ncorepercol].dom;
  1025. return color * ncorepercol + index % ncorepercol;
  1026. #endif
  1027. }
  1028. static char *polarity[4] = {
  1029. "polarity/trigger like in ISA",
  1030. "active high",
  1031. "BOGUS POLARITY",
  1032. "active low"};
  1033. static char *trigger[] = {
  1034. "BOGUS TRIGGER",
  1035. "edge",
  1036. "BOGUS TRIGGER",
  1037. "level"};
  1038. static char *
  1039. printiflags(char *start, char *end, int flags)
  1040. {
  1041. return seprint(start, end, "[%s,%s]",
  1042. polarity[flags & AFpmask], trigger[(flags & AFtmask) >> 2]);
  1043. }
  1044. static char *
  1045. dumpmadt(char *start, char *end, Atable *apics)
  1046. {
  1047. Madt *mt;
  1048. if(apics == nil)
  1049. return start;
  1050. mt = apics->tbl;
  1051. if(mt == nil)
  1052. return seprint(start, end, "acpi: no MADT");
  1053. start = seprint(start, end, "acpi: MADT@%p: lapic paddr %p pcat %d:\n",
  1054. mt, mt->lapicpa, mt->pcat);
  1055. for(int i = 0; i < apics->nchildren; i++){
  1056. Atable *apic = apics->children[i];
  1057. Apicst *st = apic->tbl;
  1058. switch(st->type){
  1059. case ASlapic:
  1060. start =
  1061. seprint(start, end, "\tlapic pid %d id %d\n",
  1062. st->lapic.pid, st->lapic.id);
  1063. break;
  1064. case ASioapic:
  1065. case ASiosapic:
  1066. start =
  1067. seprint(start, end,
  1068. "\tioapic id %d addr %p ibase %d\n",
  1069. st->ioapic.id, st->ioapic.addr, st->ioapic.ibase);
  1070. break;
  1071. case ASintovr:
  1072. start =
  1073. seprint(start, end, "\tintovr irq %d intr %d flags $%p",
  1074. st->intovr.irq, st->intovr.intr, st->intovr.flags);
  1075. start = printiflags(start, end, st->intovr.flags);
  1076. start = seprint(start, end, "\n");
  1077. break;
  1078. case ASnmi:
  1079. start = seprint(start, end, "\tnmi intr %d flags $%p\n",
  1080. st->nmi.intr, st->nmi.flags);
  1081. break;
  1082. case ASlnmi:
  1083. start =
  1084. seprint(start, end, "\tlnmi pid %d lint %d flags $%p\n",
  1085. st->lnmi.pid, st->lnmi.lint, st->lnmi.flags);
  1086. break;
  1087. case ASlsapic:
  1088. start =
  1089. seprint(start, end,
  1090. "\tlsapic pid %d id %d eid %d puid %d puids %s\n",
  1091. st->lsapic.pid, st->lsapic.id, st->lsapic.eid,
  1092. st->lsapic.puid, st->lsapic.puids);
  1093. break;
  1094. case ASintsrc:
  1095. start =
  1096. seprint(start, end,
  1097. "\tintr type %d pid %d peid %d iosv %d intr %d %#x\n",
  1098. st->type, st->intsrc.pid, st->intsrc.peid,
  1099. st->intsrc.iosv, st->intsrc.intr,
  1100. st->intsrc.flags);
  1101. start = printiflags(start, end, st->intsrc.flags);
  1102. start = seprint(start, end, "\n");
  1103. break;
  1104. case ASlx2apic:
  1105. start =
  1106. seprint(start, end, "\tlx2apic puid %d id %d\n",
  1107. st->lx2apic.puid, st->lx2apic.id);
  1108. break;
  1109. case ASlx2nmi:
  1110. start =
  1111. seprint(start, end, "\tlx2nmi puid %d intr %d flags $%p\n",
  1112. st->lx2nmi.puid, st->lx2nmi.intr,
  1113. st->lx2nmi.flags);
  1114. break;
  1115. default:
  1116. start = seprint(start, end, "\t<unknown madt entry>\n");
  1117. }
  1118. }
  1119. start = seprint(start, end, "\n");
  1120. return start;
  1121. }
  1122. static Atable *
  1123. parsemadt(Atable *parent, char *name, u8 *p, usize size)
  1124. {
  1125. Atable *t, *tt;
  1126. u8 *pe;
  1127. Madt *mt;
  1128. Apicst *st, *l;
  1129. int id;
  1130. usize stlen;
  1131. char buf[16];
  1132. int i;
  1133. PSlice slice;
  1134. psliceinit(&slice);
  1135. t = mkatable(parent, MADT, name, p, size, sizeof(Madt));
  1136. mt = t->tbl;
  1137. mt->lapicpa = l32get(p + 36);
  1138. mt->pcat = l32get(p + 40);
  1139. pe = p + size;
  1140. for(p += 44, i = 0; p < pe; p += stlen, i++){
  1141. snprint(buf, sizeof(buf), "%d", i);
  1142. stlen = p[1];
  1143. tt = mkatable(t, APIC, buf, p, stlen, sizeof(Apicst));
  1144. st = tt->tbl;
  1145. st->type = p[0];
  1146. switch(st->type){
  1147. case ASlapic:
  1148. st->lapic.pid = p[2];
  1149. st->lapic.id = p[3];
  1150. if(l32get(p + 4) == 0){
  1151. free(tt);
  1152. tt = nil;
  1153. }
  1154. break;
  1155. case ASioapic:
  1156. st->ioapic.id = id = p[2];
  1157. st->ioapic.addr = l32get(p + 4);
  1158. st->ioapic.ibase = l32get(p + 8);
  1159. /* ioapic overrides any ioapic entry for the same id */
  1160. for(int i = 0; i < pslicelen(&slice); i++){
  1161. l = ((Atable *)psliceget(&slice, i))->tbl;
  1162. if(l->type == ASiosapic && l->iosapic.id == id){
  1163. st->ioapic = l->iosapic;
  1164. /* we leave it linked; could be removed */
  1165. break;
  1166. }
  1167. }
  1168. break;
  1169. case ASintovr:
  1170. st->intovr.irq = p[3];
  1171. st->intovr.intr = l32get(p + 4);
  1172. st->intovr.flags = l16get(p + 8);
  1173. break;
  1174. case ASnmi:
  1175. st->nmi.flags = l16get(p + 2);
  1176. st->nmi.intr = l32get(p + 4);
  1177. break;
  1178. case ASlnmi:
  1179. st->lnmi.pid = p[2];
  1180. st->lnmi.flags = l16get(p + 3);
  1181. st->lnmi.lint = p[5];
  1182. break;
  1183. case ASladdr:
  1184. /* This is for 64 bits, perhaps we should not
  1185. * honor it on 32 bits.
  1186. */
  1187. mt->lapicpa = l64get(p + 8);
  1188. break;
  1189. case ASiosapic:
  1190. id = st->iosapic.id = p[2];
  1191. st->iosapic.ibase = l32get(p + 4);
  1192. st->iosapic.addr = l64get(p + 8);
  1193. /* iosapic overrides any ioapic entry for the same id */
  1194. for(int i = 0; i < pslicelen(&slice); i++){
  1195. l = ((Atable *)psliceget(&slice, i))->tbl;
  1196. if(l->type == ASioapic && l->ioapic.id == id){
  1197. l->ioapic = st->iosapic;
  1198. free(tt);
  1199. tt = nil;
  1200. break;
  1201. }
  1202. }
  1203. break;
  1204. case ASlsapic:
  1205. st->lsapic.pid = p[2];
  1206. st->lsapic.id = p[3];
  1207. st->lsapic.eid = p[4];
  1208. st->lsapic.puid = l32get(p + 12);
  1209. if(l32get(p + 8) == 0){
  1210. free(tt);
  1211. tt = nil;
  1212. } else
  1213. kstrdup(&st->lsapic.puids, (char *)p + 16);
  1214. break;
  1215. case ASintsrc:
  1216. st->intsrc.flags = l16get(p + 2);
  1217. st->type = p[4];
  1218. st->intsrc.pid = p[5];
  1219. st->intsrc.peid = p[6];
  1220. st->intsrc.iosv = p[7];
  1221. st->intsrc.intr = l32get(p + 8);
  1222. st->intsrc.any = l32get(p + 12);
  1223. break;
  1224. case ASlx2apic:
  1225. st->lx2apic.id = l32get(p + 4);
  1226. st->lx2apic.puid = l32get(p + 12);
  1227. if(l32get(p + 8) == 0){
  1228. free(tt);
  1229. tt = nil;
  1230. }
  1231. break;
  1232. case ASlx2nmi:
  1233. st->lx2nmi.flags = l16get(p + 2);
  1234. st->lx2nmi.puid = l32get(p + 4);
  1235. st->lx2nmi.intr = p[8];
  1236. break;
  1237. default:
  1238. print("unknown APIC structure\n");
  1239. free(tt);
  1240. tt = nil;
  1241. }
  1242. if(tt != nil){
  1243. finatable_nochildren(tt);
  1244. psliceappend(&slice, tt);
  1245. }
  1246. }
  1247. apics = finatable(t, &slice);
  1248. return apics;
  1249. }
  1250. static Atable *
  1251. parsedmar(Atable *parent, char *name, u8 *raw, usize rawsize)
  1252. {
  1253. Atable *t, *tt;
  1254. int i;
  1255. int baselen = MIN(rawsize, 38);
  1256. int nentry, nscope, npath, off, dslen, dhlen, type, flags;
  1257. void *pathp;
  1258. char buf[16];
  1259. PSlice drhds;
  1260. Drhd *drhd;
  1261. Dmar *dt;
  1262. /* count the entries */
  1263. for(nentry = 0, off = 48; off < rawsize; nentry++){
  1264. dslen = l16get(raw + off + 2);
  1265. print("acpi DMAR: entry %d is addr %p (0x%x/0x%x)\n",
  1266. nentry, raw + off, l16get(raw + off), dslen);
  1267. off = off + dslen;
  1268. }
  1269. print("DMAR: %d entries\n", nentry);
  1270. t = mkatable(parent, DMAR, name, raw, rawsize, sizeof(*dmar));
  1271. dt = t->tbl;
  1272. /* The table can be only partly filled. */
  1273. if(baselen >= 38 && raw[37] & 1)
  1274. dt->intr_remap = 1;
  1275. if(baselen >= 37)
  1276. dt->haw = raw[36] + 1;
  1277. /* Now we walk all the DMAR entries. */
  1278. psliceinit(&drhds);
  1279. for(off = 48, i = 0; i < nentry; i++, off += dslen){
  1280. snprint(buf, sizeof(buf), "%d", i);
  1281. dslen = l16get(raw + off + 2);
  1282. type = l16get(raw + off);
  1283. // TODO(dcross): Introduce sensible symbolic constants
  1284. // for DMAR entry types. For right now, type 0 => DRHD.
  1285. // We skip everything else.
  1286. if(type != 0)
  1287. continue;
  1288. npath = 0;
  1289. nscope = 0;
  1290. for(int o = off + 16; o < (off + dslen); o += dhlen){
  1291. nscope++;
  1292. dhlen = *(raw + o + 1); // Single byte length.
  1293. npath += ((dhlen - 6) / 2);
  1294. }
  1295. tt = mkatable(t, DRHD, buf, raw + off, dslen,
  1296. sizeof(Drhd) + 2 * npath +
  1297. nscope * sizeof(DevScope));
  1298. flags = *(raw + off + 4);
  1299. drhd = tt->tbl;
  1300. drhd->all = flags & 1;
  1301. drhd->segment = l16get(raw + off + 6);
  1302. drhd->rba = l64get(raw + off + 8);
  1303. drhd->nscope = nscope;
  1304. drhd->scopes = (void *)drhd + sizeof(Drhd);
  1305. pathp = (void *)drhd +
  1306. sizeof(Drhd) + nscope * sizeof(DevScope);
  1307. for(int i = 0, o = off + 16; i < nscope; i++){
  1308. DevScope *ds = &drhd->scopes[i];
  1309. dhlen = *(raw + o + 1);
  1310. ds->enumeration_id = *(raw + o + 4);
  1311. ds->start_bus_number = *(raw + o + 5);
  1312. ds->npath = (dhlen - 6) / 2;
  1313. ds->paths = pathp;
  1314. for(int j = 0; j < ds->npath; j++)
  1315. ds->paths[j] = l16get(raw + o + 6 + 2 * j);
  1316. pathp += 2 * ds->npath;
  1317. o += dhlen;
  1318. }
  1319. /*
  1320. * NOTE: if all is set, there should be no scopes of type
  1321. * This being ACPI, where vendors randomly copy tables
  1322. * from one system to another, and creating breakage,
  1323. * anything is possible. But we'll warn them.
  1324. */
  1325. finatable_nochildren(tt);
  1326. psliceappend(&drhds, tt);
  1327. }
  1328. dmar = finatable(t, &drhds);
  1329. return dmar;
  1330. }
  1331. /*
  1332. * Map the table and keep it there.
  1333. */
  1334. static Atable *
  1335. parsessdt(Atable *parent,
  1336. char *name, u8 *raw, usize size)
  1337. {
  1338. Atable *t;
  1339. Sdthdr *h;
  1340. /*
  1341. * We found it and it is too small.
  1342. * Simply return with no side effect.
  1343. */
  1344. if(size < Sdthdrsz)
  1345. return nil;
  1346. t = mkatable(parent, SSDT, name, raw, size, 0);
  1347. h = (Sdthdr *)raw;
  1348. memmove(t->name, h->sig, sizeof(h->sig));
  1349. t->name[sizeof(h->sig)] = '\0';
  1350. return finatable_nochildren(t);
  1351. }
  1352. static char *
  1353. dumptable(char *start, char *end, char *sig, u8 *p, int l)
  1354. {
  1355. int n, i;
  1356. if(2 > 1){
  1357. start = seprint(start, end, "%s @ %#p\n", sig, p);
  1358. if(2 > 2)
  1359. n = l;
  1360. else
  1361. n = 256;
  1362. for(i = 0; i < n; i++){
  1363. if((i % 16) == 0)
  1364. start = seprint(start, end, "%x: ", i);
  1365. start = seprint(start, end, " %2.2x", p[i]);
  1366. if((i % 16) == 15)
  1367. start = seprint(start, end, "\n");
  1368. }
  1369. start = seprint(start, end, "\n");
  1370. start = seprint(start, end, "\n");
  1371. }
  1372. return start;
  1373. }
  1374. static char *
  1375. seprinttable(char *s, char *e, Atable *t)
  1376. {
  1377. u8 *p;
  1378. int i, n;
  1379. p = (u8 *)t->tbl; /* include header */
  1380. n = t->rawsize;
  1381. s = seprint(s, e, "%s @ %#p\n", t->name, p);
  1382. for(i = 0; i < n; i++){
  1383. if((i % 16) == 0)
  1384. s = seprint(s, e, "%x: ", i);
  1385. s = seprint(s, e, " %2.2x", p[i]);
  1386. if((i % 16) == 15)
  1387. s = seprint(s, e, "\n");
  1388. }
  1389. return seprint(s, e, "\n\n");
  1390. }
  1391. void *
  1392. rsdsearch(void *start, usize size)
  1393. {
  1394. if(rsd != nil)
  1395. return rsd;
  1396. rsd = sigscan(start, size, RSDPTR);
  1397. return rsd;
  1398. }
  1399. /*
  1400. * Note: some of this comment is from the unfinished user interpreter.
  1401. *
  1402. * The DSDT is always given to the user interpreter.
  1403. * Tables listed here are also loaded from the XSDT:
  1404. * MSCT, MADT, and FADT are processed by us, because they are
  1405. * required to do early initialization before we have user processes.
  1406. * Other tables are given to the user level interpreter for
  1407. * execution.
  1408. *
  1409. * These historically returned a value to tell acpi whether or not it was okay
  1410. * to unmap the table. (return 0 means there was no table, meaning it was okay
  1411. * to unmap). We just use the kernbase mapping, so it's irrelevant.
  1412. *
  1413. * N.B. The intel source code defines the constants for ACPI in a
  1414. * non-endian-independent manner. Rather than bring in the huge wad o' code
  1415. * that represents, we just the names.
  1416. */
  1417. typedef struct Parser {
  1418. char *sig;
  1419. Atable *(*parse)(Atable *parent,
  1420. char *name, u8 *raw, usize rawsize);
  1421. } Parser;
  1422. static Parser ptable[] = {
  1423. {"FACP", parsefadt},
  1424. {"APIC", parsemadt},
  1425. {"DMAR", parsedmar},
  1426. {"SRAT", parsesrat},
  1427. {"SLIT", parseslit},
  1428. {"MSCT", parsemsct},
  1429. {"SSDT", parsessdt},
  1430. // {"HPET", parsehpet},
  1431. };
  1432. /*
  1433. * process xsdt table and load tables with sig, or all if nil.
  1434. * (XXX: should be able to search for sig, oemid, oemtblid)
  1435. */
  1436. static void
  1437. parsexsdt(Atable *root)
  1438. {
  1439. Sdthdr *sdt;
  1440. Atable *table;
  1441. PSlice slice;
  1442. usize l, end;
  1443. usize dhpa;
  1444. //Atable *n;
  1445. u8 *tbl;
  1446. if(v)
  1447. print("1\n");
  1448. psliceinit(&slice);
  1449. if(v)
  1450. print("2\n");
  1451. if(v)
  1452. print("xsdt %p\n", xsdt);
  1453. tbl = xsdt->p + sizeof(Sdthdr);
  1454. end = xsdt->len - sizeof(Sdthdr);
  1455. print("%s: tbl %p, end %d\n", __func__, tbl, end);
  1456. for(int i = 0; i < end; i += xsdt->asize){
  1457. dhpa = (xsdt->asize == 8) ? l64get(tbl + i) : l32get(tbl + i);
  1458. sdt = sdtmap(dhpa, 0, &l, 1);
  1459. if(v)
  1460. print("sdt for map of %p, %d, 1 is %p\n", (void *)dhpa, l, sdt);
  1461. if(sdt == nil)
  1462. continue;
  1463. if(v)
  1464. print("acpi: %s: addr %#p\n", __func__, sdt);
  1465. for(int j = 0; j < nelem(ptable); j++){
  1466. if(v)
  1467. print("tb sig %s\n", ptable[j].sig);
  1468. if(memcmp(sdt->sig, ptable[j].sig, sizeof(sdt->sig)) == 0){
  1469. table = ptable[j].parse(root, ptable[j].sig, (void *)sdt, l);
  1470. if(table != nil)
  1471. psliceappend(&slice, table);
  1472. break;
  1473. }
  1474. }
  1475. }
  1476. if(v)
  1477. print("FINATABLE\n\n\n\n");
  1478. finatable(root, &slice);
  1479. }
  1480. void
  1481. makeindex(Atable *root)
  1482. {
  1483. u64 index;
  1484. if(root == nil)
  1485. return;
  1486. index = root->qid.path >> QIndexShift;
  1487. atableindex[index] = root;
  1488. for(int k = 0; k < root->nchildren; k++)
  1489. makeindex(root->children[k]);
  1490. }
  1491. static void
  1492. parsersdptr(void)
  1493. {
  1494. int asize, cksum;
  1495. usize sdtpa;
  1496. /* Find the root pointer. */
  1497. /*
  1498. * Search for the data structure signature:
  1499. * 1) in the BIOS ROM between 0xE0000 and 0xFFFFF.
  1500. */
  1501. rsd = rsdsearch(KADDR(0xE0000), 0x20000);
  1502. if(rsd == nil){
  1503. print("NO RSDP\n");
  1504. return;
  1505. }
  1506. /*
  1507. * Initialize the root of ACPI parse tree.
  1508. */
  1509. lastpath = Qroot;
  1510. root = mkatable(nil, XSDT, devname(), nil, 0, sizeof(Xsdt));
  1511. root->parent = root;
  1512. if(v)
  1513. print("/* RSDP */ Rsdp = {%08c, %x, %06c, %x, %p, %d, %p, %x}\n",
  1514. rsd->signature, rsd->rchecksum, rsd->oemid, rsd->revision,
  1515. *(u32 *)rsd->raddr, *(u32 *)rsd->length,
  1516. *(u64 *)rsd->xaddr, rsd->xchecksum);
  1517. if(v)
  1518. print("acpi: RSD PTR@ %#p, physaddr $%p length %ud %#llx rev %d\n",
  1519. rsd, l32get(rsd->raddr), l32get(rsd->length),
  1520. l64get(rsd->xaddr), rsd->revision);
  1521. if(rsd->revision >= 2){
  1522. cksum = sdtchecksum(rsd, 36);
  1523. if(cksum != 0){
  1524. print("acpi: bad RSD checksum %d, 64 bit parser aborted\n", cksum);
  1525. return;
  1526. }
  1527. sdtpa = l64get(rsd->xaddr);
  1528. asize = 8;
  1529. } else {
  1530. cksum = sdtchecksum(rsd, 20);
  1531. if(cksum != 0){
  1532. print("acpi: bad RSD checksum %d, 32 bit parser aborted\n", cksum);
  1533. return;
  1534. }
  1535. sdtpa = l32get(rsd->raddr);
  1536. asize = 4;
  1537. }
  1538. /*
  1539. * process the RSDT or XSDT table.
  1540. */
  1541. xsdt = root->tbl;
  1542. xsdt->p = sdtmap(sdtpa, 0, &xsdt->len, 1);
  1543. if(xsdt->p == nil){
  1544. print("acpi: sdtmap failed\n");
  1545. return;
  1546. }
  1547. if((xsdt->p[0] != 'R' && xsdt->p[0] != 'X') || memcmp(xsdt->p + 1, "SDT", 3) != 0){
  1548. if(v)
  1549. print("acpi: xsdt sig: %c%c%c%c\n",
  1550. xsdt->p[0], xsdt->p[1], xsdt->p[2], xsdt->p[3]);
  1551. xsdt = nil;
  1552. return;
  1553. }
  1554. xsdt->asize = asize;
  1555. root->raw = xsdt->p;
  1556. root->rawsize = xsdt->len;
  1557. if(v)
  1558. print("acpi: XSDT %#p\n", xsdt);
  1559. parsexsdt(root);
  1560. if(v)
  1561. print("POST PARSE XSDT raw is %p len is 0x%x\n", xsdt->p, xsdt->len);
  1562. if(v)
  1563. print("parsexdt done: lastpath %d\n", lastpath);
  1564. atableindex = reallocarray(nil, lastpath, sizeof(Atable *));
  1565. assert(atableindex != nil);
  1566. makeindex(root);
  1567. }
  1568. /*
  1569. * The invariant that each level in the tree has an associated
  1570. * Atable implies that each chan can be mapped to an Atable.
  1571. * The assertions here enforce that invariant.
  1572. */
  1573. static Atable *
  1574. genatable(Chan *c)
  1575. {
  1576. Atable *a;
  1577. u64 ai;
  1578. ai = c->qid.path >> QIndexShift;
  1579. assert(ai < lastpath);
  1580. a = atableindex[ai];
  1581. assert(a != nil);
  1582. return a;
  1583. }
  1584. static int
  1585. acpigen(Chan *c, char *name, Dirtab *tab, int ntab,
  1586. int i, Dir *dp)
  1587. {
  1588. Atable *a = genatable(c);
  1589. if(i == DEVDOTDOT){
  1590. assert((c->qid.path & QIndexMask) == Qdir);
  1591. devdir(c, a->parent->qid, a->parent->name, 0, eve, DMDIR | 0555, dp);
  1592. return 1;
  1593. }
  1594. return devgen(c, name, a->cdirs, a->nchildren + NQtypes, i, dp);
  1595. }
  1596. /*
  1597. * Print the contents of the XSDT.
  1598. */
  1599. static void
  1600. dumpxsdt(void)
  1601. {
  1602. if(v)
  1603. print("xsdt: len = %lu, asize = %lu, p = %p\n",
  1604. xsdt->len, xsdt->asize, xsdt->p);
  1605. }
  1606. static char *
  1607. dumpGas(char *start, char *end, char *prefix, Gas *g)
  1608. {
  1609. start = seprint(start, end, "%s", prefix);
  1610. switch(g->spc){
  1611. case Rsysmem:
  1612. case Rsysio:
  1613. case Rembed:
  1614. case Rsmbus:
  1615. case Rcmos:
  1616. case Rpcibar:
  1617. case Ripmi:
  1618. start = seprint(start, end, "[%s ", regnames[g->spc]);
  1619. break;
  1620. case Rpcicfg:
  1621. start = seprint(start, end, "[pci ");
  1622. start =
  1623. seprint(start, end, "dev %#p ",
  1624. (u32)(g->addr >> 32) & 0xFFFF);
  1625. start =
  1626. seprint(start, end, "fn %#p ",
  1627. (u32)(g->addr & 0xFFFF0000) >> 16);
  1628. start =
  1629. seprint(start, end, "adr %#p ", (u32)(g->addr & 0xFFFF));
  1630. break;
  1631. case Rfixedhw:
  1632. start = seprint(start, end, "[hw ");
  1633. break;
  1634. default:
  1635. start = seprint(start, end, "[spc=%#p ", g->spc);
  1636. }
  1637. start = seprint(start, end, "off %d len %d addr %#p sz%d]",
  1638. g->off, g->len, g->addr, g->accsz);
  1639. start = seprint(start, end, "\n");
  1640. return start;
  1641. }
  1642. static unsigned int
  1643. getbanked(usize ra, usize rb, int sz)
  1644. {
  1645. unsigned int r;
  1646. r = 0;
  1647. switch(sz){
  1648. case 1:
  1649. if(ra != 0)
  1650. r |= inb(ra);
  1651. if(rb != 0)
  1652. r |= inb(rb);
  1653. break;
  1654. case 2:
  1655. if(ra != 0)
  1656. r |= ins(ra);
  1657. if(rb != 0)
  1658. r |= ins(rb);
  1659. break;
  1660. case 4:
  1661. if(ra != 0)
  1662. r |= inl(ra);
  1663. if(rb != 0)
  1664. r |= inl(rb);
  1665. break;
  1666. default:
  1667. print("getbanked: wrong size\n");
  1668. }
  1669. return r;
  1670. }
  1671. static unsigned int
  1672. setbanked(usize ra, usize rb, int sz, int val)
  1673. {
  1674. unsigned int r;
  1675. if(v)
  1676. print("setbanked: ra %#x rb %#x sz %d value %#x\n", ra, rb, sz, val);
  1677. r = -1;
  1678. switch(sz){
  1679. case 1:
  1680. if(ra != 0)
  1681. outb(ra, val);
  1682. if(rb != 0)
  1683. outb(rb, val);
  1684. break;
  1685. case 2:
  1686. if(ra != 0)
  1687. outs(ra, val);
  1688. if(rb != 0)
  1689. outs(rb, val);
  1690. break;
  1691. case 4:
  1692. if(ra != 0)
  1693. outl(ra, val);
  1694. if(rb != 0)
  1695. outl(rb, val);
  1696. break;
  1697. default:
  1698. print("setbanked: wrong size\n");
  1699. }
  1700. return r;
  1701. }
  1702. static unsigned int
  1703. getpm1ctl(void)
  1704. {
  1705. assert(fadt != nil);
  1706. return getbanked(fadt->pm1acntblk, fadt->pm1bcntblk, fadt->pm1cntlen);
  1707. }
  1708. static void
  1709. setpm1sts(unsigned int v)
  1710. {
  1711. assert(fadt != nil);
  1712. setbanked(fadt->pm1aevtblk, fadt->pm1bevtblk, fadt->pm1evtlen / 2, v);
  1713. }
  1714. static unsigned int
  1715. getpm1sts(void)
  1716. {
  1717. assert(fadt != nil);
  1718. return getbanked(fadt->pm1aevtblk, fadt->pm1bevtblk, fadt->pm1evtlen / 2);
  1719. }
  1720. static unsigned int
  1721. getpm1en(void)
  1722. {
  1723. int sz;
  1724. assert(fadt != nil);
  1725. sz = fadt->pm1evtlen / 2;
  1726. return getbanked(fadt->pm1aevtblk + sz, fadt->pm1bevtblk + sz, sz);
  1727. }
  1728. static int
  1729. getgpeen(int n)
  1730. {
  1731. return inb(gpes[n].enio) & 1 << gpes[n].enbit;
  1732. }
  1733. static void
  1734. setgpeen(int n, unsigned int v)
  1735. {
  1736. int old;
  1737. old = inb(gpes[n].enio);
  1738. if(v)
  1739. outb(gpes[n].enio, old | 1 << gpes[n].enbit);
  1740. else
  1741. outb(gpes[n].enio, old & ~(1 << gpes[n].enbit));
  1742. }
  1743. static void
  1744. clrgpests(int n)
  1745. {
  1746. outb(gpes[n].stsio, 1 << gpes[n].stsbit);
  1747. }
  1748. static unsigned int
  1749. getgpests(int n)
  1750. {
  1751. return inb(gpes[n].stsio) & 1 << gpes[n].stsbit;
  1752. }
  1753. static void
  1754. acpiintr(Ureg *u, void *v)
  1755. {
  1756. int i;
  1757. unsigned int sts, en;
  1758. for(i = 0; i < ngpes; i++)
  1759. if(getgpests(i)){
  1760. print("acpiintr: gpe %d on\n", i);
  1761. en = getgpeen(i);
  1762. setgpeen(i, 0);
  1763. clrgpests(i);
  1764. if(en != 0)
  1765. print("acpiintr: calling gpe %d\n", i);
  1766. // queue gpe for calling gpe->ho in the
  1767. // aml process.
  1768. // enable it again when it returns.
  1769. }
  1770. sts = getpm1sts();
  1771. en = getpm1en();
  1772. if(v)
  1773. print("acpiintr: pm1sts %#p pm1en %#p\n", sts, en);
  1774. //if (sts & en)
  1775. // print("acpiintr: have enabled events\n");
  1776. //if (sts & 1)
  1777. // print("acpiintr: power button\n");
  1778. // XXX serve other interrupts here.
  1779. setpm1sts(sts);
  1780. }
  1781. static void
  1782. initgpes(void)
  1783. {
  1784. int i, n0, n1;
  1785. assert(fadt != nil);
  1786. n0 = fadt->gpe0blklen / 2;
  1787. n1 = fadt->gpe1blklen / 2;
  1788. ngpes = n0 + n1;
  1789. gpes = mallocz(sizeof(Gpe) * ngpes, 1);
  1790. for(i = 0; i < n0; i++){
  1791. gpes[i].nb = i;
  1792. gpes[i].stsbit = i & 7;
  1793. gpes[i].stsio = fadt->gpe0blk + (i >> 3);
  1794. gpes[i].enbit = (n0 + i) & 7;
  1795. gpes[i].enio = fadt->gpe0blk + ((n0 + i) >> 3);
  1796. }
  1797. for(i = 0; i + n0 < ngpes; i++){
  1798. gpes[i + n0].nb = fadt->gp1base + i;
  1799. gpes[i + n0].stsbit = i & 7;
  1800. gpes[i + n0].stsio = fadt->gpe1blk + (i >> 3);
  1801. gpes[i + n0].enbit = (n1 + i) & 7;
  1802. gpes[i + n0].enio = fadt->gpe1blk + ((n1 + i) >> 3);
  1803. }
  1804. }
  1805. static void
  1806. startgpes(void)
  1807. {
  1808. int i;
  1809. for(i = 0; i < ngpes; i++){
  1810. setgpeen(i, 0);
  1811. clrgpests(i);
  1812. }
  1813. }
  1814. static void
  1815. acpiioalloc(u16 addr, int len)
  1816. {
  1817. if(ioalloc(addr, len, 1, "ACPI") < 0)
  1818. return;
  1819. for(int io = addr; io < addr + len; io++)
  1820. acpiport[io] = 1;
  1821. }
  1822. static void
  1823. acpiinitonce(void)
  1824. {
  1825. parsersdptr();
  1826. if(root != nil)
  1827. print("ACPI initialized\n");
  1828. addarchfile("acpimem", 0444, acpimemread, nil);
  1829. addarchfile("acpiio", 0666 | DMEXCL, acpiioread, acpiiowrite);
  1830. addarchfile("acpiintr", 0444 | DMEXCL, acpiintrread, nil);
  1831. /*
  1832. * should use fadt->xpm* and fadt->xgpe* registers for 64 bits.
  1833. * We are not ready in this kernel for that.
  1834. */
  1835. assert(fadt != nil);
  1836. acpiioalloc(fadt->smicmd, 1);
  1837. acpiioalloc(fadt->pm1aevtblk, fadt->pm1evtlen);
  1838. acpiioalloc(fadt->pm1bevtblk, fadt->pm1evtlen);
  1839. acpiioalloc(fadt->pm1acntblk, fadt->pm1cntlen);
  1840. acpiioalloc(fadt->pm1bcntblk, fadt->pm1cntlen);
  1841. acpiioalloc(fadt->pm2cntblk, fadt->pm2cntlen);
  1842. acpiioalloc(fadt->pmtmrblk, fadt->pmtmrlen);
  1843. acpiioalloc(fadt->gpe0blk, fadt->gpe0blklen);
  1844. acpiioalloc(fadt->gpe1blk, fadt->gpe1blklen);
  1845. initgpes();
  1846. outofyourelement();
  1847. }
  1848. static int
  1849. acpienable(void)
  1850. {
  1851. int i;
  1852. /* This starts ACPI, which may require we handle
  1853. * power mgmt events ourselves. Use with care.
  1854. */
  1855. outb(fadt->smicmd, fadt->acpienable);
  1856. for(i = 0; i < 10; i++)
  1857. if(getpm1ctl() & Pm1SciEn)
  1858. break;
  1859. if(i == 10){
  1860. print("acpi: failed to enable\n");
  1861. return -1;
  1862. }
  1863. return 0;
  1864. }
  1865. static int
  1866. acpidisable(void)
  1867. {
  1868. int i;
  1869. /* This starts ACPI, which may require we handle
  1870. * power mgmt events ourselves. Use with care.
  1871. */
  1872. outb(fadt->smicmd, fadt->acpidisable);
  1873. for(i = 0; i < 10; i++)
  1874. if((getpm1ctl() & Pm1SciEn) == 0)
  1875. break;
  1876. if(i == 10){
  1877. print("acpi: failed to disable\n");
  1878. return -1;
  1879. }
  1880. return 0;
  1881. }
  1882. void
  1883. acpistart(void)
  1884. {
  1885. acpiev = qopen(1024, Qmsg, nil, nil);
  1886. if(!acpiev){
  1887. print("acpistart: qopen failed; not enabling interrupts");
  1888. return;
  1889. }
  1890. if(fadt->sciint != 0)
  1891. intrenable(fadt->sciint, acpiintr, 0, BUSUNKNOWN, "acpi");
  1892. }
  1893. int
  1894. acpiinit(void)
  1895. {
  1896. static int once = 0;
  1897. if(!once)
  1898. acpiinitonce();
  1899. once++;
  1900. return (root == nil) ? -1 : 0;
  1901. }
  1902. static Chan *
  1903. acpiattach(char *spec)
  1904. {
  1905. Chan *c;
  1906. /*
  1907. * This was written for the stock kernel.
  1908. * This code must use 64 registers to be acpi ready in nix.
  1909. */
  1910. if(acpiinit() < 0)
  1911. error("no acpi");
  1912. c = devattach(devdc(), spec);
  1913. return c;
  1914. }
  1915. static Walkqid *
  1916. acpiwalk(Chan *c, Chan *nc, char **name, int nname)
  1917. {
  1918. /*
  1919. * Note that devwalk hard-codes a test against the location of 'devgen',
  1920. * so we pretty much have to not pass it here.
  1921. */
  1922. return devwalk(c, nc, name, nname, nil, 0, acpigen);
  1923. }
  1924. static int
  1925. acpistat(Chan *c, u8 *dp, int n)
  1926. {
  1927. Atable *a = genatable(c);
  1928. if(c->qid.type == QTDIR)
  1929. a = a->parent;
  1930. assert(a != nil);
  1931. /* TODO(dcross): make acpigen work here. */
  1932. return devstat(c, dp, n, a->cdirs, a->nchildren + NQtypes, devgen);
  1933. }
  1934. static Chan *
  1935. acpiopen(Chan *c, int omode)
  1936. {
  1937. return devopen(c, omode, nil, 0, acpigen);
  1938. }
  1939. static void
  1940. acpiclose(Chan *unused)
  1941. {
  1942. }
  1943. static char *ttext;
  1944. static int tlen;
  1945. /* acpimemread allows processes to read acpi tables, using the offset as the
  1946. * physical address. It hence enforces limits on what is visible.
  1947. * This is NOT the same as Qraw; Qraw is the area associated with one device, and offsets
  1948. * start at 0 in Qraw. We need this special read so we can make sense of pointers in tables,
  1949. * which are physical addresses.
  1950. */
  1951. static i32
  1952. acpimemread(Chan *c, void *a, i32 n, isize off)
  1953. {
  1954. Proc *up = externup();
  1955. Acpilist *l;
  1956. int ret;
  1957. /* due to vmap limitations, you have to be on core 0. Make
  1958. * it easy for them. */
  1959. procwired(up, 0);
  1960. /* This is horribly insecure but, for now,
  1961. * focus on getting it to work.
  1962. * The only read allowed at 0 is sizeof(*rsd).
  1963. * Later on, we'll need to track the things we
  1964. * map with sdtmap and only allow reads of those
  1965. * areas. But let's see if this idea even works, first.
  1966. */
  1967. if(v)
  1968. print("ACPI Qraw: rsd %p %p %d %p\n", rsd, a, n, (void *)off);
  1969. if(off == 0){
  1970. u32 pa = (u32)PADDR(rsd);
  1971. print("FIND RSD\n");
  1972. print("PA OF rsd is %lx\n", pa);
  1973. return readmem(0, a, n, &pa, sizeof(pa));
  1974. }
  1975. if(off == PADDR(rsd)){
  1976. if(v)
  1977. print("READ RSD");
  1978. if(v)
  1979. print("returning for rsd\n");
  1980. //hexdump(rsd, sizeof(*rsd));
  1981. return readmem(0, a, n, rsd, sizeof(*rsd));
  1982. }
  1983. l = findlist(off, n);
  1984. /* we don't load all the lists, so this may be a new one. */
  1985. if(!l){
  1986. usize _;
  1987. if(sdtmap(off, n, &_, 0) == nil){
  1988. static char msg[256];
  1989. snprint(msg, sizeof(msg), "unable to map acpi@%p/%d", off, n);
  1990. error(msg);
  1991. }
  1992. l = findlist(off, n);
  1993. }
  1994. /* we really need to improve on plan 9 error message handling. */
  1995. if(!l){
  1996. static char msg[256];
  1997. snprint(msg, sizeof(msg), "unable to map acpi@%p/%d", off, n);
  1998. error(msg);
  1999. }
  2000. //hexdump(l->raw, l->size);
  2001. ret = readmem(off - l->base, a, n, l->raw, l->size);
  2002. if(v)
  2003. print("%d = readmem(0x%lx, %p, %d, %p, %d\n", ret, off - l->base, a, n, l->raw, l->size);
  2004. return ret;
  2005. }
  2006. /*
  2007. * acpiintrread waits on the acpiev Queue.
  2008. */
  2009. static i32
  2010. acpiintrread(Chan *c, void *a, i32 n, isize off)
  2011. {
  2012. if(acpienable())
  2013. error("Can't enable ACPI");
  2014. startgpes();
  2015. n = qread(acpiev, a, n);
  2016. if(acpidisable())
  2017. error("Can't disable ACPI");
  2018. return n;
  2019. }
  2020. /* acpiioread only lets you read one of each type for now.
  2021. * i.e. one byte, word, or long.
  2022. */
  2023. static i32
  2024. acpiioread(Chan *c, void *a, i32 n, isize off)
  2025. {
  2026. int port, pm1aevtblk;
  2027. u8 *p;
  2028. u16 *sp;
  2029. u32 *lp;
  2030. pm1aevtblk = (int)fadt->pm1aevtblk;
  2031. port = off;
  2032. if(!acpiport[port]){
  2033. error("Bad port in acpiiread");
  2034. return -1;
  2035. }
  2036. switch(n){
  2037. case 1:
  2038. p = a;
  2039. if(port == pm1aevtblk)
  2040. *p = pm1status & 0xff;
  2041. else if(port == (pm1aevtblk + 1))
  2042. *p = pm1status >> 8;
  2043. else
  2044. *p = inb(port);
  2045. return n;
  2046. case 2:
  2047. if(n & 1){
  2048. error("Odd address for word IO");
  2049. break;
  2050. }
  2051. sp = a;
  2052. if(port == pm1aevtblk)
  2053. *sp = pm1status;
  2054. else
  2055. *sp = ins(port);
  2056. return n;
  2057. case 4:
  2058. if(n & 3){
  2059. error("bad alignment for word io");
  2060. break;
  2061. }
  2062. lp = a;
  2063. *lp = inl(port);
  2064. if(port == pm1aevtblk)
  2065. *lp |= pm1status;
  2066. return n;
  2067. default:
  2068. error("Bad size for IO in acpiioread");
  2069. }
  2070. return -1;
  2071. }
  2072. static i32
  2073. acpiiowrite(Chan *c, void *a, i32 n, isize off)
  2074. {
  2075. int port, pm1aevtblk;
  2076. u8 *p;
  2077. u16 *sp;
  2078. u32 *lp;
  2079. port = off;
  2080. pm1aevtblk = (int)fadt->pm1aevtblk;
  2081. if(!acpiport[port]){
  2082. error("invalid port in acpiiowrite");
  2083. return -1;
  2084. }
  2085. switch(n){
  2086. case 1:
  2087. p = a;
  2088. if(port == pm1aevtblk)
  2089. pm1status &= ~*p;
  2090. else if(port == (pm1aevtblk + 1))
  2091. pm1status &= ~(*p << 8);
  2092. else
  2093. outb(port, *p);
  2094. return n;
  2095. case 2:
  2096. if(n & 1)
  2097. error("Odd alignment for word io");
  2098. sp = a;
  2099. if(port == pm1aevtblk)
  2100. pm1status &= ~*sp;
  2101. outs(port, *sp);
  2102. return n;
  2103. case 4:
  2104. if(n & 3)
  2105. error("bad alignment for 32 bit IO");
  2106. lp = a;
  2107. if(port == pm1aevtblk)
  2108. pm1status &= ~*lp;
  2109. outl(port, (*lp & ~0xffff));
  2110. return n;
  2111. default:
  2112. error("bad size for word io");
  2113. }
  2114. return -1;
  2115. }
  2116. // Get the table from the qid.
  2117. // Read that one table using the pointers.
  2118. // Actually, this function doesn't do this right now for pretty or table.
  2119. // It dumps the same table at every level. Working on it.
  2120. // It does the right thing for raw.
  2121. static i32
  2122. acpiread(Chan *c, void *a, i32 n, isize off)
  2123. {
  2124. long q;
  2125. Atable *t;
  2126. char *ns, *s, *e, *ntext;
  2127. int ret;
  2128. if(ttext == nil){
  2129. tlen = 32768;
  2130. ttext = mallocz(tlen, 1);
  2131. }
  2132. if(ttext == nil)
  2133. error("acpiread: no memory");
  2134. q = c->qid.path & QIndexMask;
  2135. switch(q){
  2136. case Qdir:
  2137. return devdirread(c, a, n, nil, 0, acpigen);
  2138. case Qraw:
  2139. t = genatable(c);
  2140. ret = readmem(off, a, n, t->raw, t->rawsize);
  2141. if(v)
  2142. print("%d = readmem(0x%lx, %p, %d, %p, %d\n", ret, off, a, n, t->raw, t->rawsize);
  2143. return ret;
  2144. case Qtbl:
  2145. s = ttext;
  2146. e = ttext + tlen;
  2147. strlcpy(s, "no tables\n", tlen);
  2148. for(t = tfirst; t != nil; t = t->next){
  2149. ns = seprinttable(s, e, t);
  2150. while(ns == e - 1){
  2151. ntext = realloc(ttext, tlen * 2);
  2152. if(ntext == nil)
  2153. panic("acpi: no memory\n");
  2154. s = ntext + (ttext - s);
  2155. ttext = ntext;
  2156. tlen *= 2;
  2157. e = ttext + tlen;
  2158. ns = seprinttable(s, e, t);
  2159. }
  2160. s = ns;
  2161. }
  2162. return readstr(off, a, n, ttext);
  2163. case Qpretty:
  2164. s = ttext;
  2165. e = ttext + tlen;
  2166. s = dumpfadt(s, e, fadt);
  2167. s = dumpmadt(s, e, apics);
  2168. s = dumpslit(s, e, slit);
  2169. s = dumpsrat(s, e, srat);
  2170. s = dumpdmar(s, e, dmar);
  2171. dumpmsct(s, e, mscttbl);
  2172. return readstr(off, a, n, ttext);
  2173. default:
  2174. error("acpiread: bad path");
  2175. }
  2176. error("Permission denied");
  2177. return -1;
  2178. }
  2179. static i32
  2180. acpiwrite(Chan *c, void *a, i32 n, isize off)
  2181. {
  2182. error("not yet");
  2183. return -1;
  2184. #if 0
  2185. int acpiirq(u32 tbdf, int irq);
  2186. Proc *up = externup();
  2187. Cmdtab *ct;
  2188. Cmdbuf *cb;
  2189. u32 tbdf;
  2190. int irq;
  2191. if (c->qid.path == Qio){
  2192. if (reg == nil)
  2193. error("region not configured");
  2194. return regio(reg, a, n, off, 1);
  2195. }
  2196. if (c->qid.path != Qctl)
  2197. error("Can only write Qctl");
  2198. cb = parsecmd(a, n);
  2199. if (waserror()){
  2200. free(cb);
  2201. nexterror();
  2202. }
  2203. ct = lookupcmd(cb, ctls, nelem(ctls));
  2204. switch (ct->index){
  2205. Reg *r;
  2206. unsigned int rno, fun, dev, bus, i;
  2207. case CMregion:
  2208. /* TODO: this block is racy on reg (global) */
  2209. r = reg;
  2210. if (r == nil){
  2211. r = mallocz(sizeof(Reg), 1);
  2212. r->name = nil;
  2213. }
  2214. kstrdup(&r->name, cb->f[1]);
  2215. r->spc = acpiregid(cb->f[2]);
  2216. if (r->spc < 0){
  2217. free(r);
  2218. reg = nil;
  2219. error("bad region type");
  2220. }
  2221. if (r->spc == Rpcicfg || r->spc == Rpcibar){
  2222. rno = r->base >> Rpciregshift & Rpciregmask;
  2223. fun = r->base >> Rpcifunshift & Rpcifunmask;
  2224. dev = r->base >> Rpcidevshift & Rpcidevmask;
  2225. bus = r->base >> Rpcibusshift & Rpcibusmask;
  2226. r->tbdf = MKBUS(BusPCI, bus, dev, fun);
  2227. r->base = rno; /* register ~ our base addr */
  2228. }
  2229. r->base = strtoul(cb->f[3], nil, 0);
  2230. r->len = strtoul(cb->f[4], nil, 0);
  2231. r->accsz = strtoul(cb->f[5], nil, 0);
  2232. if (r->accsz < 1 || r->accsz > 4){
  2233. free(r);
  2234. reg = nil;
  2235. error("bad region access size");
  2236. }
  2237. reg = r;
  2238. print("region %s %s %p %p sz%d",
  2239. r->name, acpiregstr(r->spc), r->base, r->len, r->accsz);
  2240. break;
  2241. case CMgpe:
  2242. i = strtoul(cb->f[1], nil, 0);
  2243. if (i >= ngpes)
  2244. error(ERANGE, "gpe out of range");
  2245. kstrdup(&gpes[i].obj, cb->f[2]);
  2246. setgpeen(i, 1);
  2247. break;
  2248. case CMirq:
  2249. tbdf = strtoul(cb->f[1], 0, 0);
  2250. irq = strtoul(cb->f[2], 0, 0);
  2251. acpiirq(tbdf, irq);
  2252. break;
  2253. default:
  2254. panic("acpi: unknown ctl");
  2255. }
  2256. poperror();
  2257. free(cb);
  2258. return n;
  2259. #endif
  2260. }
  2261. struct {
  2262. char *(*pretty)(Atable *atbl, char *start, char *end, void *arg);
  2263. } acpisw[NACPITBLS] = {};
  2264. static char *
  2265. pretty(Atable *atbl, char *start, char *end, void *arg)
  2266. {
  2267. int type;
  2268. type = atbl->type;
  2269. if(type < 0 || NACPITBLS < type)
  2270. return start;
  2271. if(acpisw[type].pretty == nil)
  2272. return seprint(start, end, "\"\"\n");
  2273. return acpisw[type].pretty(atbl, start, end, arg);
  2274. }
  2275. static char *
  2276. raw(Atable *atbl, char *start, char *end, void *unused_arg)
  2277. {
  2278. usize len = MIN(end - start, atbl->rawsize);
  2279. memmove(start, atbl->raw, len);
  2280. return start + len;
  2281. }
  2282. void
  2283. outofyourelement(void)
  2284. {
  2285. /*
  2286. * These just shut the compiler up.
  2287. */
  2288. if(0)
  2289. pretty(nil, nil, nil, nil);
  2290. if(0)
  2291. raw(nil, nil, nil, nil);
  2292. if(0)
  2293. dumpxsdt();
  2294. if(0)
  2295. dumptable(nil, nil, nil, nil, 0);
  2296. if(0)
  2297. cmpslitent(nil, nil);
  2298. if(0)
  2299. regio(nil, nil, 0, 0, 0);
  2300. if(0)
  2301. acpiregid(nil);
  2302. }
  2303. Dev acpidevtab = {
  2304. .dc = 'Z',
  2305. .name = "acpi",
  2306. .reset = devreset,
  2307. .init = devinit,
  2308. .shutdown = devshutdown,
  2309. .attach = acpiattach,
  2310. .walk = acpiwalk,
  2311. .stat = acpistat,
  2312. .open = acpiopen,
  2313. .create = devcreate,
  2314. .close = acpiclose,
  2315. .read = acpiread,
  2316. .bread = devbread,
  2317. .write = acpiwrite,
  2318. .bwrite = devbwrite,
  2319. .remove = devremove,
  2320. .wstat = devwstat,
  2321. };