devacpi.c 57 KB

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