trap.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671
  1. /*
  2. * sheevaplug traps, exceptions, interrupts, system calls.
  3. */
  4. #include "u.h"
  5. #include "../port/lib.h"
  6. #include "mem.h"
  7. #include "dat.h"
  8. #include "fns.h"
  9. #include "io.h"
  10. #include "ureg.h"
  11. #include "../port/error.h"
  12. #include "arm.h"
  13. enum {
  14. Ntimevec = 20, /* # of time buckets for each intr */
  15. Nvecs = 256,
  16. };
  17. extern int notify(Ureg*);
  18. extern int ldrexvalid;
  19. typedef struct Vctl Vctl;
  20. typedef struct Vctl {
  21. Vctl* next; /* handlers on this vector */
  22. char *name; /* of driver, xallocated */
  23. void (*f)(Ureg*, void*); /* handler to call */
  24. void* a; /* argument to call it with */
  25. } Vctl;
  26. static Lock vctllock;
  27. static Vctl* vctl[32];
  28. uvlong ninterrupt;
  29. uvlong ninterruptticks;
  30. ulong intrtimes[Nvecs][Ntimevec];
  31. typedef struct Handler Handler;
  32. struct Handler {
  33. void (*r)(Ureg*, void*);
  34. void *a;
  35. char name[KNAMELEN];
  36. };
  37. static Handler irqlo[32];
  38. static Handler irqhi[32];
  39. static Handler irqbridge[32];
  40. static Lock irqlock;
  41. static int probing, trapped;
  42. typedef struct Irq Irq;
  43. struct Irq {
  44. ulong *irq;
  45. ulong *irqmask;
  46. Handler *irqvec;
  47. int nirqvec;
  48. char *name;
  49. };
  50. /* irq and irqmask are filled in by trapinit */
  51. static Irq irqs[] = {
  52. [Irqlo] {nil, nil, irqlo, nelem(irqlo), "lo"},
  53. [Irqhi] {nil, nil, irqhi, nelem(irqhi), "hi"},
  54. [Irqbridge] {nil, nil, irqbridge, nelem(irqbridge), "bridge"},
  55. };
  56. /*
  57. * keep histogram of interrupt service times
  58. */
  59. void
  60. intrtime(Mach*, int vno)
  61. {
  62. ulong diff, x;
  63. if (m == nil)
  64. return;
  65. x = perfticks();
  66. diff = x - m->perf.intrts;
  67. m->perf.intrts = x;
  68. m->perf.inintr += diff;
  69. if(up == nil && m->perf.inidle > diff)
  70. m->perf.inidle -= diff;
  71. if (m->cpuhz == 0) /* not set yet? */
  72. return;
  73. diff /= (m->cpuhz/1000000)*100; /* quantum = 100µsec */
  74. if(diff >= Ntimevec)
  75. diff = Ntimevec-1;
  76. assert(vno >= 0 && vno < Nvecs);
  77. intrtimes[vno][diff]++;
  78. }
  79. void
  80. intrfmtcounts(char *s, char *se)
  81. {
  82. USED(s, se);
  83. }
  84. static void
  85. dumpcounts(void)
  86. {
  87. }
  88. void
  89. intrclear(int sort, int v)
  90. {
  91. *irqs[sort].irq = ~(1 << v);
  92. }
  93. void
  94. intrmask(int sort, int v)
  95. {
  96. *irqs[sort].irqmask &= ~(1 << v);
  97. }
  98. void
  99. intrunmask(int sort, int v)
  100. {
  101. *irqs[sort].irqmask |= 1 << v;
  102. }
  103. static void
  104. maskallints(void)
  105. {
  106. CpucsReg *cpu = (CpucsReg *)soc.cpu;
  107. IntrReg *intr;
  108. /* no fiq or ep in use */
  109. intr = (IntrReg *)soc.intr;
  110. intr->lo.irqmask = 0;
  111. intr->hi.irqmask = 0;
  112. cpu->irqmask = 0;
  113. coherence();
  114. }
  115. void
  116. intrset(Handler *h, void (*f)(Ureg*, void*), void *a, char *name)
  117. {
  118. if(h->r != nil) {
  119. // iprint("duplicate irq: %s (%#p)\n", h->name, h->r);
  120. return;
  121. }
  122. h->r = f;
  123. h->a = a;
  124. strncpy(h->name, name, KNAMELEN-1);
  125. h->name[KNAMELEN-1] = 0;
  126. }
  127. void
  128. intrunset(Handler *h)
  129. {
  130. h->r = nil;
  131. h->a = nil;
  132. h->name[0] = 0;
  133. }
  134. void
  135. intrdel(Handler *h, void (*f)(Ureg*, void*), void *a, char *name)
  136. {
  137. if(h->r != f || h->a != a || strcmp(h->name, name) != 0)
  138. return;
  139. intrunset(h);
  140. }
  141. void
  142. intrenable(int sort, int v, void (*f)(Ureg*, void*), void *a, char *name)
  143. {
  144. //iprint("enabling intr %d vec %d for %s\n", sort, v, name);
  145. ilock(&irqlock);
  146. intrset(&irqs[sort].irqvec[v], f, a, name);
  147. intrunmask(sort, v);
  148. iunlock(&irqlock);
  149. }
  150. void
  151. intrdisable(int sort, int v, void (*f)(Ureg*, void*), void* a, char *name)
  152. {
  153. ilock(&irqlock);
  154. intrdel(&irqs[sort].irqvec[v], f, a, name);
  155. intrmask(sort, v);
  156. iunlock(&irqlock);
  157. }
  158. /*
  159. * called by trap to handle interrupts
  160. */
  161. static void
  162. intrs(Ureg *ur, int sort)
  163. {
  164. int i, s;
  165. ulong ibits;
  166. Handler *h;
  167. Irq irq;
  168. assert(sort >= 0 && sort < nelem(irqs));
  169. irq = irqs[sort];
  170. ibits = *irq.irq;
  171. ibits &= *irq.irqmask;
  172. for(i = 0; i < irq.nirqvec && ibits; i++)
  173. if(ibits & (1<<i)){
  174. h = &irq.irqvec[i];
  175. if(h->r != nil){
  176. h->r(ur, h->a);
  177. splhi();
  178. intrtime(m, sort*32 + i);
  179. if (sort == Irqbridge && i == IRQcputimer0)
  180. m->inclockintr = 1;
  181. ibits &= ~(1<<i);
  182. }
  183. }
  184. if(ibits != 0) {
  185. iprint("spurious irq%s interrupt: %8.8lux\n", irq.name, ibits);
  186. s = splfhi();
  187. *irq.irq &= ibits;
  188. splx(s);
  189. }
  190. }
  191. void
  192. intrhi(Ureg *ureg, void*)
  193. {
  194. intrs(ureg, Irqhi);
  195. }
  196. void
  197. intrbridge(Ureg *ureg, void*)
  198. {
  199. intrs(ureg, Irqbridge);
  200. intrclear(Irqlo, IRQ0bridge);
  201. }
  202. void
  203. trapinit(void)
  204. {
  205. int i;
  206. CpucsReg *cpu;
  207. IntrReg *intr;
  208. Vectorpage *page0 = (Vectorpage*)HVECTORS;
  209. intr = (IntrReg *)soc.intr;
  210. cpu = (CpucsReg *)soc.cpu;
  211. irqs[Irqlo].irq = &intr->lo.irq;
  212. irqs[Irqlo].irqmask = &intr->lo.irqmask;
  213. irqs[Irqhi].irq = &intr->hi.irq;
  214. irqs[Irqhi].irqmask = &intr->hi.irqmask;
  215. irqs[Irqbridge].irq = &cpu->irq;
  216. irqs[Irqbridge].irqmask = &cpu->irqmask;
  217. coherence();
  218. setr13(PsrMfiq, m->fiqstack + nelem(m->fiqstack));
  219. setr13(PsrMirq, m->irqstack + nelem(m->irqstack));
  220. setr13(PsrMabt, m->abtstack + nelem(m->abtstack));
  221. setr13(PsrMund, m->undstack + nelem(m->undstack));
  222. memmove(page0->vectors, vectors, sizeof page0->vectors);
  223. memmove(page0->vtable, vtable, sizeof page0->vtable);
  224. cacheuwbinv();
  225. l2cacheuwbinv();
  226. cpu->cpucfg &= ~Cfgvecinithi;
  227. for(i = 0; i < nelem(irqlo); i++)
  228. intrunset(&irqlo[i]);
  229. for(i = 0; i < nelem(irqhi); i++)
  230. intrunset(&irqhi[i]);
  231. for(i = 0; i < nelem(irqbridge); i++)
  232. intrunset(&irqbridge[i]);
  233. /* disable all interrupts */
  234. intr->lo.fiqmask = intr->hi.fiqmask = 0;
  235. intr->lo.irqmask = intr->hi.irqmask = 0;
  236. intr->lo.epmask = intr->hi.epmask = 0;
  237. cpu->irqmask = 0;
  238. coherence();
  239. /* clear interrupts */
  240. intr->lo.irq = intr->hi.irq = ~0;
  241. cpu->irq = ~0;
  242. coherence();
  243. intrenable(Irqlo, IRQ0hisum, intrhi, nil, "hi");
  244. intrenable(Irqlo, IRQ0bridge, intrbridge, nil, "bridge");
  245. /* enable watchdog & access-error interrupts */
  246. cpu->irqmask |= 1 << IRQcputimerwd | 1 << IRQaccesserr;
  247. coherence();
  248. }
  249. static char *trapnames[PsrMask+1] = {
  250. [ PsrMusr ] "user mode",
  251. [ PsrMfiq ] "fiq interrupt",
  252. [ PsrMirq ] "irq interrupt",
  253. [ PsrMsvc ] "svc/swi exception",
  254. [ PsrMabt ] "prefetch abort/data abort",
  255. [ PsrMabt+1 ] "data abort",
  256. [ PsrMund ] "undefined instruction",
  257. [ PsrMsys ] "sys trap",
  258. };
  259. static char *
  260. trapname(int psr)
  261. {
  262. char *s;
  263. s = trapnames[psr & PsrMask];
  264. if(s == nil)
  265. s = "unknown trap number in psr";
  266. return s;
  267. }
  268. /*
  269. * called by trap to handle access faults
  270. */
  271. static void
  272. faultarm(Ureg *ureg, uintptr va, int user, int read)
  273. {
  274. int n, insyscall;
  275. char buf[ERRMAX];
  276. static int cnt, lastpid;
  277. static ulong lastva;
  278. if(up == nil) {
  279. dumpregs(ureg);
  280. panic("fault: nil up in faultarm, accessing %#p", va);
  281. }
  282. insyscall = up->insyscall;
  283. up->insyscall = 1;
  284. /* this is quite helpful during mmu and cache debugging */
  285. if(va == lastva && up->pid == lastpid) {
  286. ++cnt;
  287. if (cnt >= 2)
  288. /* fault() isn't fixing the underlying cause */
  289. panic("fault: %d consecutive faults for va %#lux",
  290. cnt+1, va);
  291. } else {
  292. cnt = 0;
  293. lastva = va;
  294. lastpid = up->pid;
  295. }
  296. n = fault(va, read);
  297. if(n < 0){
  298. if(!user){
  299. dumpregs(ureg);
  300. panic("fault: kernel accessing %#p", va);
  301. }
  302. /* don't dump registers; programs suicide all the time */
  303. snprint(buf, sizeof buf, "sys: trap: fault %s va=%#p",
  304. read? "read": "write", va);
  305. postnote(up, 1, buf, NDebug);
  306. }
  307. up->insyscall = insyscall;
  308. }
  309. /*
  310. * returns 1 if the instruction writes memory, 0 otherwise
  311. */
  312. int
  313. writetomem(ulong inst)
  314. {
  315. /* swap always write memory */
  316. if((inst & 0x0FC00000) == 0x01000000)
  317. return 1;
  318. /* loads and stores are distinguished by bit 20 */
  319. if(inst & (1<<20))
  320. return 0;
  321. return 1;
  322. }
  323. void
  324. trap(Ureg *ureg)
  325. {
  326. int user, x, rv, rem;
  327. ulong inst;
  328. u32int fsr;
  329. uintptr va;
  330. char buf[ERRMAX];
  331. if(up != nil)
  332. rem = (char*)ureg - up->kstack;
  333. else
  334. rem = (char*)ureg - ((char*)m + sizeof(Mach));
  335. if(rem < 256) {
  336. dumpstack();
  337. panic("trap %d bytes remaining, up %#p ureg %#p at pc %#lux",
  338. rem, up, ureg, ureg->pc);
  339. }
  340. user = (ureg->psr & PsrMask) == PsrMusr;
  341. if(user){
  342. up->dbgreg = ureg;
  343. cycles(&up->kentry);
  344. }
  345. if(ureg->type == PsrMabt+1)
  346. ureg->pc -= 8;
  347. else
  348. ureg->pc -= 4;
  349. m->inclockintr = 0;
  350. switch(ureg->type) {
  351. default:
  352. panic("unknown trap %ld", ureg->type);
  353. break;
  354. case PsrMirq:
  355. ldrexvalid = 0;
  356. // splflo(); /* allow fast interrupts */
  357. intrs(ureg, Irqlo);
  358. m->intr++;
  359. break;
  360. case PsrMabt: /* prefetch fault */
  361. ldrexvalid = 0;
  362. faultarm(ureg, ureg->pc, user, 1);
  363. break;
  364. case PsrMabt+1: /* data fault */
  365. ldrexvalid = 0;
  366. va = farget();
  367. inst = *(ulong*)(ureg->pc);
  368. fsr = fsrget() & 0xf;
  369. if (probing && !user) {
  370. if (trapped++ > 0)
  371. panic("trap: recursive probe %#lux", va);
  372. ureg->pc += 4; /* continue at next instruction */
  373. break;
  374. }
  375. switch(fsr){
  376. case 0x0:
  377. panic("vector exception at %#lux", ureg->pc);
  378. break;
  379. case 0x1:
  380. case 0x3:
  381. if(user){
  382. snprint(buf, sizeof buf,
  383. "sys: alignment: pc %#lux va %#p\n",
  384. ureg->pc, va);
  385. postnote(up, 1, buf, NDebug);
  386. } else
  387. panic("kernel alignment: pc %#lux va %#p", ureg->pc, va);
  388. break;
  389. case 0x2:
  390. panic("terminal exception at %#lux", ureg->pc);
  391. break;
  392. case 0x4:
  393. case 0x6:
  394. case 0x8:
  395. case 0xa:
  396. case 0xc:
  397. case 0xe:
  398. panic("external abort %#ux pc %#lux addr %#px",
  399. fsr, ureg->pc, va);
  400. break;
  401. case 0x5: /* translation fault, no section entry */
  402. case 0x7: /* translation fault, no page entry */
  403. faultarm(ureg, va, user, !writetomem(inst));
  404. break;
  405. case 0x9:
  406. case 0xb:
  407. /* domain fault, accessing something we shouldn't */
  408. if(user){
  409. snprint(buf, sizeof buf,
  410. "sys: access violation: pc %#lux va %#p\n",
  411. ureg->pc, va);
  412. postnote(up, 1, buf, NDebug);
  413. } else
  414. panic("kernel access violation: pc %#lux va %#p",
  415. ureg->pc, va);
  416. break;
  417. case 0xd:
  418. case 0xf:
  419. /* permission error, copy on write or real permission error */
  420. faultarm(ureg, va, user, !writetomem(inst));
  421. break;
  422. }
  423. break;
  424. case PsrMund: /* undefined instruction */
  425. if(user){
  426. /* look for floating point instructions to interpret */
  427. x = spllo();
  428. rv = fpiarm(ureg);
  429. splx(x);
  430. if(rv == 0){
  431. ldrexvalid = 0;
  432. snprint(buf, sizeof buf,
  433. "undefined instruction: pc %#lux",
  434. ureg->pc);
  435. postnote(up, 1, buf, NDebug);
  436. }
  437. }else{
  438. iprint("undefined instruction: pc %#lux inst %#ux\n",
  439. ureg->pc, ((u32int*)ureg->pc)[-2]);
  440. panic("undefined instruction");
  441. }
  442. break;
  443. }
  444. splhi();
  445. /* delaysched set because we held a lock or because our quantum ended */
  446. if(up && up->delaysched && m->inclockintr){
  447. ldrexvalid = 0;
  448. sched();
  449. splhi();
  450. }
  451. if(user){
  452. if(up->procctl || up->nnote)
  453. notify(ureg);
  454. kexit(ureg);
  455. }
  456. }
  457. int
  458. isvalidaddr(void *v)
  459. {
  460. return (uintptr)v >= KZERO;
  461. }
  462. void
  463. dumplongs(char *msg, ulong *v, int n)
  464. {
  465. int i, l;
  466. l = 0;
  467. iprint("%s at %.8p: ", msg, v);
  468. for(i=0; i<n; i++){
  469. if(l >= 4){
  470. iprint("\n %.8p: ", v);
  471. l = 0;
  472. }
  473. if(isvalidaddr(v)){
  474. iprint(" %.8lux", *v++);
  475. l++;
  476. }else{
  477. iprint(" invalid");
  478. break;
  479. }
  480. }
  481. iprint("\n");
  482. }
  483. static void
  484. dumpstackwithureg(Ureg *ureg)
  485. {
  486. uintptr l, i, v, estack;
  487. u32int *p;
  488. iprint("ktrace /kernel/path %#.8lux %#.8lux %#.8lux # pc, sp, link\n",
  489. ureg->pc, ureg->sp, ureg->r14);
  490. delay(2000);
  491. i = 0;
  492. if(up != nil && (uintptr)&l <= (uintptr)up->kstack+KSTACK)
  493. estack = (uintptr)up->kstack+KSTACK;
  494. else if((uintptr)&l >= (uintptr)m->stack
  495. && (uintptr)&l <= (uintptr)m+MACHSIZE)
  496. estack = (uintptr)m+MACHSIZE;
  497. else{
  498. if(up != nil)
  499. iprint("&up->kstack %#p &l %#p\n", up->kstack, &l);
  500. else
  501. iprint("&m %#p &l %#p\n", m, &l);
  502. return;
  503. }
  504. for(l = (uintptr)&l; l < estack; l += sizeof(uintptr)){
  505. v = *(uintptr*)l;
  506. if(KTZERO < v && v < (uintptr)etext && !(v & 3)){
  507. v -= sizeof(u32int); /* back up an instr */
  508. p = (u32int*)v;
  509. if((*p & 0x0f000000) == 0x0b000000){ /* BL instr? */
  510. iprint("%#8.8lux=%#8.8lux ", l, v);
  511. i++;
  512. }
  513. }
  514. if(i == 4){
  515. i = 0;
  516. iprint("\n");
  517. }
  518. }
  519. if(i)
  520. iprint("\n");
  521. }
  522. /*
  523. * Fill in enough of Ureg to get a stack trace, and call a function.
  524. * Used by debugging interface rdb.
  525. */
  526. void
  527. callwithureg(void (*fn)(Ureg*))
  528. {
  529. Ureg ureg;
  530. ureg.pc = getcallerpc(&fn);
  531. ureg.sp = PTR2UINT(&fn);
  532. fn(&ureg);
  533. }
  534. void
  535. dumpstack(void)
  536. {
  537. callwithureg(dumpstackwithureg);
  538. }
  539. void
  540. dumpregs(Ureg* ureg)
  541. {
  542. int s;
  543. if (ureg == nil) {
  544. iprint("trap: no user process\n");
  545. return;
  546. }
  547. s = splhi();
  548. iprint("trap: %s", trapname(ureg->type));
  549. if(ureg != nil && (ureg->psr & PsrMask) != PsrMsvc)
  550. iprint(" in %s", trapname(ureg->psr));
  551. iprint("\n");
  552. iprint("psr %8.8lux type %2.2lux pc %8.8lux link %8.8lux\n",
  553. ureg->psr, ureg->type, ureg->pc, ureg->link);
  554. iprint("R14 %8.8lux R13 %8.8lux R12 %8.8lux R11 %8.8lux R10 %8.8lux\n",
  555. ureg->r14, ureg->r13, ureg->r12, ureg->r11, ureg->r10);
  556. iprint("R9 %8.8lux R8 %8.8lux R7 %8.8lux R6 %8.8lux R5 %8.8lux\n",
  557. ureg->r9, ureg->r8, ureg->r7, ureg->r6, ureg->r5);
  558. iprint("R4 %8.8lux R3 %8.8lux R2 %8.8lux R1 %8.8lux R0 %8.8lux\n",
  559. ureg->r4, ureg->r3, ureg->r2, ureg->r1, ureg->r0);
  560. iprint("stack is at %#p\n", ureg);
  561. iprint("pc %#lux link %#lux\n", ureg->pc, ureg->link);
  562. if(up)
  563. iprint("user stack: %#p-%#p\n", up->kstack, up->kstack+KSTACK-4);
  564. else
  565. iprint("kernel stack: %8.8lux-%8.8lux\n",
  566. (ulong)(m+1), (ulong)m+BY2PG-4);
  567. dumplongs("stack", (ulong *)(ureg + 1), 16);
  568. delay(2000);
  569. dumpstack();
  570. splx(s);
  571. }
  572. void
  573. idlehands(void)
  574. {
  575. extern void _idlehands(void);
  576. _idlehands();
  577. }
  578. vlong
  579. probeaddr(uintptr addr)
  580. {
  581. vlong v;
  582. static Lock fltlck;
  583. ilock(&fltlck);
  584. trapped = 0;
  585. probing = 1;
  586. coherence();
  587. v = *(ulong *)addr; /* this may cause a fault */
  588. USED(probing);
  589. coherence();
  590. probing = 0;
  591. coherence();
  592. if (trapped)
  593. v = -1;
  594. iunlock(&fltlck);
  595. return v;
  596. }