1
0

devacpi.c 54 KB

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