devacpi.c 50 KB

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