devacpi.c 57 KB

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