devacpi.c 50 KB

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