devproc.c 28 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580
  1. #include "u.h"
  2. #include <trace.h>
  3. #include "tos.h"
  4. #include "../port/lib.h"
  5. #include "mem.h"
  6. #include "dat.h"
  7. #include "fns.h"
  8. #include "../port/error.h"
  9. #include "ureg.h"
  10. #include "edf.h"
  11. enum
  12. {
  13. Qdir,
  14. Qtrace,
  15. Qargs,
  16. Qctl,
  17. Qfd,
  18. Qfpregs,
  19. Qkregs,
  20. Qmem,
  21. Qnote,
  22. Qnoteid,
  23. Qnotepg,
  24. Qns,
  25. Qproc,
  26. Qregs,
  27. Qsegment,
  28. Qstatus,
  29. Qtext,
  30. Qwait,
  31. Qprofile,
  32. };
  33. enum
  34. {
  35. CMclose,
  36. CMclosefiles,
  37. CMfixedpri,
  38. CMhang,
  39. CMkill,
  40. CMnohang,
  41. CMnoswap,
  42. CMpri,
  43. CMprivate,
  44. CMprofile,
  45. CMstart,
  46. CMstartstop,
  47. CMstartsyscall,
  48. CMstop,
  49. CMwaitstop,
  50. CMwired,
  51. CMfair,
  52. CMunfair,
  53. CMtrace,
  54. /* real time */
  55. CMperiod,
  56. CMdeadline,
  57. CMcost,
  58. CMsporadic,
  59. CMdeadlinenotes,
  60. CMadmit,
  61. CMextra,
  62. CMexpel,
  63. };
  64. enum{
  65. Nevents = 0x4000,
  66. Emask = Nevents - 1,
  67. };
  68. #define STATSIZE (2*KNAMELEN+12+9*12)
  69. /*
  70. * Status, fd, and ns are left fully readable (0444) because of their use in debugging,
  71. * particularly on shared servers.
  72. * Arguably, ns and fd shouldn't be readable; if you'd prefer, change them to 0000
  73. */
  74. Dirtab procdir[] =
  75. {
  76. "args", {Qargs}, 0, 0660,
  77. "ctl", {Qctl}, 0, 0000,
  78. "fd", {Qfd}, 0, 0444,
  79. "fpregs", {Qfpregs}, sizeof(FPsave), 0000,
  80. "kregs", {Qkregs}, sizeof(Ureg), 0400,
  81. "mem", {Qmem}, 0, 0000,
  82. "note", {Qnote}, 0, 0000,
  83. "noteid", {Qnoteid}, 0, 0664,
  84. "notepg", {Qnotepg}, 0, 0000,
  85. "ns", {Qns}, 0, 0444,
  86. "proc", {Qproc}, 0, 0400,
  87. "regs", {Qregs}, sizeof(Ureg), 0000,
  88. "segment", {Qsegment}, 0, 0444,
  89. "status", {Qstatus}, STATSIZE, 0444,
  90. "text", {Qtext}, 0, 0000,
  91. "wait", {Qwait}, 0, 0400,
  92. "profile", {Qprofile}, 0, 0400,
  93. };
  94. static
  95. Cmdtab proccmd[] = {
  96. CMclose, "close", 2,
  97. CMclosefiles, "closefiles", 1,
  98. CMfixedpri, "fixedpri", 2,
  99. CMhang, "hang", 1,
  100. CMnohang, "nohang", 1,
  101. CMnoswap, "noswap", 1,
  102. CMkill, "kill", 1,
  103. CMpri, "pri", 2,
  104. CMprivate, "private", 1,
  105. CMprofile, "profile", 1,
  106. CMstart, "start", 1,
  107. CMstartstop, "startstop", 1,
  108. CMstartsyscall, "startsyscall", 1,
  109. CMstop, "stop", 1,
  110. CMwaitstop, "waitstop", 1,
  111. CMwired, "wired", 2,
  112. CMfair, "fair", 1,
  113. CMunfair, "unfair", 1,
  114. CMtrace, "trace", 0,
  115. CMperiod, "period", 2,
  116. CMdeadline, "deadline", 2,
  117. CMcost, "cost", 2,
  118. CMsporadic, "sporadic", 1,
  119. CMdeadlinenotes, "deadlinenotes", 1,
  120. CMadmit, "admit", 1,
  121. CMextra, "extra", 1,
  122. CMexpel, "expel", 1,
  123. };
  124. /* Segment type from portdat.h */
  125. static char *sname[]={ "Text", "Data", "Bss", "Stack", "Shared", "Phys", };
  126. /*
  127. * Qids are, in path:
  128. * 4 bits of file type (qids above)
  129. * 23 bits of process slot number + 1
  130. * in vers,
  131. * 32 bits of pid, for consistency checking
  132. * If notepg, c->pgrpid.path is pgrp slot, .vers is noteid.
  133. */
  134. #define QSHIFT 5 /* location in qid of proc slot # */
  135. #define QID(q) ((((ulong)(q).path)&0x0000001F)>>0)
  136. #define SLOT(q) (((((ulong)(q).path)&0x07FFFFFE0)>>QSHIFT)-1)
  137. #define PID(q) ((q).vers)
  138. #define NOTEID(q) ((q).vers)
  139. void procctlreq(Proc*, char*, int);
  140. int procctlmemio(Proc*, ulong, int, void*, int);
  141. Chan* proctext(Chan*, Proc*);
  142. Segment* txt2data(Proc*, Segment*);
  143. int procstopped(void*);
  144. void mntscan(Mntwalk*, Proc*);
  145. static Traceevent *tevents;
  146. static Lock tlock;
  147. static int topens;
  148. static int tproduced, tconsumed;
  149. static Rendez teventr;
  150. void (*proctrace)(Proc*, int, vlong);
  151. extern int unfair;
  152. static void
  153. profclock(Ureg *ur, Timer *)
  154. {
  155. Tos *tos;
  156. if(up == 0 || up->state != Running)
  157. return;
  158. /* user profiling clock */
  159. if(userureg(ur)){
  160. tos = (Tos*)(USTKTOP-sizeof(Tos));
  161. tos->clock += TK2MS(1);
  162. segclock(ur->pc);
  163. }
  164. }
  165. static int
  166. procgen(Chan *c, char *name, Dirtab *tab, int, int s, Dir *dp)
  167. {
  168. Qid qid;
  169. Proc *p;
  170. char *ename;
  171. Segment *q;
  172. ulong pid, path, perm, len;
  173. if(s == DEVDOTDOT){
  174. mkqid(&qid, Qdir, 0, QTDIR);
  175. devdir(c, qid, "#p", 0, eve, 0555, dp);
  176. return 1;
  177. }
  178. if(c->qid.path == Qdir){
  179. if(s == 0){
  180. strcpy(up->genbuf, "trace");
  181. mkqid(&qid, Qtrace, -1, QTFILE);
  182. devdir(c, qid, up->genbuf, 0, eve, 0444, dp);
  183. return 1;
  184. }
  185. if(name != nil){
  186. /* ignore s and use name to find pid */
  187. pid = strtol(name, &ename, 10);
  188. if(pid==0 || ename[0]!='\0')
  189. return -1;
  190. s = procindex(pid);
  191. if(s < 0)
  192. return -1;
  193. }
  194. else if(--s >= conf.nproc)
  195. return -1;
  196. p = proctab(s);
  197. pid = p->pid;
  198. if(pid == 0)
  199. return 0;
  200. sprint(up->genbuf, "%lud", pid);
  201. /*
  202. * String comparison is done in devwalk so name must match its formatted pid
  203. */
  204. if(name != nil && strcmp(name, up->genbuf) != 0)
  205. return -1;
  206. mkqid(&qid, (s+1)<<QSHIFT, pid, QTDIR);
  207. devdir(c, qid, up->genbuf, 0, p->user, DMDIR|0555, dp);
  208. return 1;
  209. }
  210. if(c->qid.path == Qtrace){
  211. strcpy(up->genbuf, "trace");
  212. mkqid(&qid, Qtrace, -1, QTFILE);
  213. devdir(c, qid, up->genbuf, 0, eve, 0444, dp);
  214. return 1;
  215. }
  216. if(s >= nelem(procdir))
  217. return -1;
  218. if(tab)
  219. panic("procgen");
  220. tab = &procdir[s];
  221. path = c->qid.path&~(((1<<QSHIFT)-1)); /* slot component */
  222. p = proctab(SLOT(c->qid));
  223. perm = tab->perm;
  224. if(perm == 0)
  225. perm = p->procmode;
  226. else /* just copy read bits */
  227. perm |= p->procmode & 0444;
  228. len = tab->length;
  229. switch(QID(c->qid)) {
  230. case Qwait:
  231. len = p->nwait; /* incorrect size, but >0 means there's something to read */
  232. break;
  233. case Qprofile:
  234. q = p->seg[TSEG];
  235. if(q && q->profile) {
  236. len = (q->top-q->base)>>LRESPROF;
  237. len *= sizeof(*q->profile);
  238. }
  239. break;
  240. }
  241. mkqid(&qid, path|tab->qid.path, c->qid.vers, QTFILE);
  242. devdir(c, qid, tab->name, len, p->user, perm, dp);
  243. return 1;
  244. }
  245. static void
  246. _proctrace(Proc* p, Tevent etype, vlong ts)
  247. {
  248. Traceevent *te;
  249. if (p->trace == 0 || topens == 0)
  250. return;
  251. if(tproduced - tconsumed >= Nevents)
  252. tconsumed = tproduced - Nevents + 1;
  253. /* discard oldest, never mind the race */
  254. te = &tevents[tproduced&Emask];
  255. te->pid = p->pid;
  256. te->etype = etype;
  257. if (ts == 0)
  258. te->time = todget(nil);
  259. else
  260. te->time = ts;
  261. tproduced++;
  262. /* To avoid circular wakeup when used in combination with
  263. * EDF scheduling.
  264. */
  265. if (teventr.p && teventr.p->state == Wakeme)
  266. wakeup(&teventr);
  267. }
  268. static void
  269. procinit(void)
  270. {
  271. if(conf.nproc >= (1<<(16-QSHIFT))-1)
  272. print("warning: too many procs for devproc\n");
  273. addclock0link((void (*)(void))profclock, 113); /* Relative prime to HZ */
  274. }
  275. static Chan*
  276. procattach(char *spec)
  277. {
  278. return devattach('p', spec);
  279. }
  280. static Walkqid*
  281. procwalk(Chan *c, Chan *nc, char **name, int nname)
  282. {
  283. return devwalk(c, nc, name, nname, 0, 0, procgen);
  284. }
  285. static int
  286. procstat(Chan *c, uchar *db, int n)
  287. {
  288. return devstat(c, db, n, 0, 0, procgen);
  289. }
  290. /*
  291. * none can't read or write state on other
  292. * processes. This is to contain access of
  293. * servers running as none should they be
  294. * subverted by, for example, a stack attack.
  295. */
  296. static void
  297. nonone(Proc *p)
  298. {
  299. if(p == up)
  300. return;
  301. if(strcmp(up->user, "none") != 0)
  302. return;
  303. if(iseve())
  304. return;
  305. error(Eperm);
  306. }
  307. static Chan*
  308. procopen(Chan *c, int omode)
  309. {
  310. Proc *p;
  311. Pgrp *pg;
  312. Chan *tc;
  313. int pid;
  314. if(c->qid.type & QTDIR)
  315. return devopen(c, omode, 0, 0, procgen);
  316. if(QID(c->qid) == Qtrace){
  317. if (omode != OREAD)
  318. error(Eperm);
  319. lock(&tlock);
  320. if (waserror()){
  321. unlock(&tlock);
  322. nexterror();
  323. }
  324. if (topens > 0)
  325. error("already open");
  326. topens++;
  327. if (tevents == nil){
  328. tevents = (Traceevent*)malloc(sizeof(Traceevent) * Nevents);
  329. if(tevents == nil)
  330. error(Enomem);
  331. tproduced = tconsumed = 0;
  332. }
  333. proctrace = _proctrace;
  334. unlock(&tlock);
  335. poperror();
  336. c->mode = openmode(omode);
  337. c->flag |= COPEN;
  338. c->offset = 0;
  339. return c;
  340. }
  341. p = proctab(SLOT(c->qid));
  342. qlock(&p->debug);
  343. if(waserror()){
  344. qunlock(&p->debug);
  345. nexterror();
  346. }
  347. pid = PID(c->qid);
  348. if(p->pid != pid)
  349. error(Eprocdied);
  350. omode = openmode(omode);
  351. switch(QID(c->qid)){
  352. case Qtext:
  353. if(omode != OREAD)
  354. error(Eperm);
  355. tc = proctext(c, p);
  356. tc->offset = 0;
  357. qunlock(&p->debug);
  358. poperror();
  359. return tc;
  360. case Qproc:
  361. case Qkregs:
  362. case Qsegment:
  363. case Qprofile:
  364. case Qfd:
  365. if(omode != OREAD)
  366. error(Eperm);
  367. break;
  368. case Qmem:
  369. case Qnote:
  370. case Qctl:
  371. if(p->privatemem)
  372. error(Eperm);
  373. /* fall through */
  374. case Qargs:
  375. case Qnoteid:
  376. case Qstatus:
  377. case Qwait:
  378. case Qregs:
  379. case Qfpregs:
  380. nonone(p);
  381. break;
  382. case Qns:
  383. if(omode != OREAD)
  384. error(Eperm);
  385. c->aux = malloc(sizeof(Mntwalk));
  386. break;
  387. case Qnotepg:
  388. nonone(p);
  389. pg = p->pgrp;
  390. if(pg == nil)
  391. error(Eprocdied);
  392. if(omode!=OWRITE || pg->pgrpid == 1)
  393. error(Eperm);
  394. c->pgrpid.path = pg->pgrpid+1;
  395. c->pgrpid.vers = p->noteid;
  396. break;
  397. default:
  398. pprint("procopen %lux\n", c->qid);
  399. error(Egreg);
  400. }
  401. /* Affix pid to qid */
  402. if(p->state != Dead)
  403. c->qid.vers = p->pid;
  404. /* make sure the process slot didn't get reallocated while we were playing */
  405. coherence();
  406. if(p->pid != pid)
  407. error(Eprocdied);
  408. tc = devopen(c, omode, 0, 0, procgen);
  409. qunlock(&p->debug);
  410. poperror();
  411. return tc;
  412. }
  413. static int
  414. procwstat(Chan *c, uchar *db, int n)
  415. {
  416. Proc *p;
  417. Dir *d;
  418. if(c->qid.type&QTDIR)
  419. error(Eperm);
  420. if(QID(c->qid) == Qtrace)
  421. return devwstat(c, db, n);
  422. p = proctab(SLOT(c->qid));
  423. nonone(p);
  424. d = nil;
  425. if(waserror()){
  426. free(d);
  427. qunlock(&p->debug);
  428. nexterror();
  429. }
  430. qlock(&p->debug);
  431. if(p->pid != PID(c->qid))
  432. error(Eprocdied);
  433. if(strcmp(up->user, p->user) != 0 && strcmp(up->user, eve) != 0)
  434. error(Eperm);
  435. d = smalloc(sizeof(Dir)+n);
  436. n = convM2D(db, n, &d[0], (char*)&d[1]);
  437. if(n == 0)
  438. error(Eshortstat);
  439. if(!emptystr(d->uid) && strcmp(d->uid, p->user) != 0){
  440. if(strcmp(up->user, eve) != 0)
  441. error(Eperm);
  442. else
  443. kstrdup(&p->user, d->uid);
  444. }
  445. if(d->mode != ~0UL)
  446. p->procmode = d->mode&0777;
  447. poperror();
  448. free(d);
  449. qunlock(&p->debug);
  450. return n;
  451. }
  452. static long
  453. procoffset(long offset, char *va, int *np)
  454. {
  455. if(offset > 0) {
  456. offset -= *np;
  457. if(offset < 0) {
  458. memmove(va, va+*np+offset, -offset);
  459. *np = -offset;
  460. }
  461. else
  462. *np = 0;
  463. }
  464. return offset;
  465. }
  466. static int
  467. procqidwidth(Chan *c)
  468. {
  469. char buf[32];
  470. return sprint(buf, "%lud", c->qid.vers);
  471. }
  472. int
  473. procfdprint(Chan *c, int fd, int w, char *s, int ns)
  474. {
  475. int n;
  476. if(w == 0)
  477. w = procqidwidth(c);
  478. n = snprint(s, ns, "%3d %.2s %C %4ld (%.16llux %*lud %.2ux) %5ld %8lld %s\n",
  479. fd,
  480. &"r w rw"[(c->mode&3)<<1],
  481. devtab[c->type]->dc, c->dev,
  482. c->qid.path, w, c->qid.vers, c->qid.type,
  483. c->iounit, c->offset, c->name->s);
  484. return n;
  485. }
  486. static int
  487. procfds(Proc *p, char *va, int count, long offset)
  488. {
  489. Fgrp *f;
  490. Chan *c;
  491. char buf[256];
  492. int n, i, w, ww;
  493. char *a;
  494. /* print to buf to avoid holding fgrp lock while writing to user space */
  495. if(count > sizeof buf)
  496. count = sizeof buf;
  497. a = buf;
  498. qlock(&p->debug);
  499. f = p->fgrp;
  500. if(f == nil){
  501. qunlock(&p->debug);
  502. return 0;
  503. }
  504. lock(f);
  505. if(waserror()){
  506. unlock(f);
  507. qunlock(&p->debug);
  508. nexterror();
  509. }
  510. n = readstr(0, a, count, p->dot->name->s);
  511. n += snprint(a+n, count-n, "\n");
  512. offset = procoffset(offset, a, &n);
  513. /* compute width of qid.path */
  514. w = 0;
  515. for(i = 0; i <= f->maxfd; i++) {
  516. c = f->fd[i];
  517. if(c == nil)
  518. continue;
  519. ww = procqidwidth(c);
  520. if(ww > w)
  521. w = ww;
  522. }
  523. for(i = 0; i <= f->maxfd; i++) {
  524. c = f->fd[i];
  525. if(c == nil)
  526. continue;
  527. n += procfdprint(c, i, w, a+n, count-n);
  528. offset = procoffset(offset, a, &n);
  529. }
  530. unlock(f);
  531. qunlock(&p->debug);
  532. poperror();
  533. /* copy result to user space, now that locks are released */
  534. memmove(va, buf, n);
  535. return n;
  536. }
  537. static void
  538. procclose(Chan * c)
  539. {
  540. if(QID(c->qid) == Qtrace){
  541. lock(&tlock);
  542. if(topens > 0)
  543. topens--;
  544. if(topens == 0)
  545. proctrace = nil;
  546. unlock(&tlock);
  547. }
  548. if(QID(c->qid) == Qns && c->aux != 0)
  549. free(c->aux);
  550. }
  551. static void
  552. int2flag(int flag, char *s)
  553. {
  554. if(flag == 0){
  555. *s = '\0';
  556. return;
  557. }
  558. *s++ = '-';
  559. if(flag & MAFTER)
  560. *s++ = 'a';
  561. if(flag & MBEFORE)
  562. *s++ = 'b';
  563. if(flag & MCREATE)
  564. *s++ = 'c';
  565. if(flag & MCACHE)
  566. *s++ = 'C';
  567. *s = '\0';
  568. }
  569. static int
  570. procargs(Proc *p, char *buf, int nbuf)
  571. {
  572. int j, k, m;
  573. char *a;
  574. int n;
  575. a = p->args;
  576. if(p->setargs){
  577. snprint(buf, nbuf, "%s [%s]", p->text, p->args);
  578. return strlen(buf);
  579. }
  580. n = p->nargs;
  581. for(j = 0; j < nbuf - 1; j += m){
  582. if(n <= 0)
  583. break;
  584. if(j != 0)
  585. buf[j++] = ' ';
  586. m = snprint(buf+j, nbuf-j, "%q", a);
  587. k = strlen(a) + 1;
  588. a += k;
  589. n -= k;
  590. }
  591. return j;
  592. }
  593. static int
  594. eventsavailable(void *)
  595. {
  596. return tproduced > tconsumed;
  597. }
  598. static long
  599. procread(Chan *c, void *va, long n, vlong off)
  600. {
  601. int m, navail, ne;
  602. long l;
  603. Proc *p;
  604. Waitq *wq;
  605. Ureg kur;
  606. uchar *rptr;
  607. Mntwalk *mw;
  608. Segment *sg, *s;
  609. char *a = va, *sps;
  610. int i, j, rsize, pid;
  611. char statbuf[NSEG*32], *srv, flag[10];
  612. ulong offset = off;
  613. if(c->qid.type & QTDIR)
  614. return devdirread(c, a, n, 0, 0, procgen);
  615. if(QID(c->qid) == Qtrace){
  616. if(!eventsavailable(nil))
  617. return 0;
  618. rptr = (uchar*)va;
  619. navail = tproduced - tconsumed;
  620. if(navail > n / sizeof(Traceevent))
  621. navail = n / sizeof(Traceevent);
  622. while(navail > 0) {
  623. ne = ((tconsumed & Emask) + navail > Nevents)?
  624. Nevents - (tconsumed & Emask): navail;
  625. memmove(rptr, &tevents[tconsumed & Emask],
  626. ne * sizeof(Traceevent));
  627. tconsumed += ne;
  628. rptr += ne * sizeof(Traceevent);
  629. navail -= ne;
  630. }
  631. return rptr - (uchar*)va;
  632. }
  633. p = proctab(SLOT(c->qid));
  634. if(p->pid != PID(c->qid))
  635. error(Eprocdied);
  636. switch(QID(c->qid)){
  637. case Qargs:
  638. qlock(&p->debug);
  639. j = procargs(p, p->genbuf, sizeof p->genbuf);
  640. qunlock(&p->debug);
  641. if(offset >= j)
  642. return 0;
  643. if(offset+n > j)
  644. n = j-offset;
  645. memmove(a, &p->genbuf[offset], n);
  646. return n;
  647. case Qmem:
  648. if(offset < KZERO
  649. || (offset >= USTKTOP-USTKSIZE && offset < USTKTOP))
  650. return procctlmemio(p, offset, n, va, 1);
  651. if(!iseve())
  652. error(Eperm);
  653. /* validate kernel addresses */
  654. if(offset < (ulong)end) {
  655. if(offset+n > (ulong)end)
  656. n = (ulong)end - offset;
  657. memmove(a, (char*)offset, n);
  658. return n;
  659. }
  660. /* conf.base* and conf.npage* are set by xinit to refer to kernel allocation, not user pages */
  661. if(offset >= conf.base0 && offset < conf.npage0){
  662. if(offset+n > conf.npage0)
  663. n = conf.npage0 - offset;
  664. memmove(a, (char*)offset, n);
  665. return n;
  666. }
  667. if(offset >= conf.base1 && offset < conf.npage1){
  668. if(offset+n > conf.npage1)
  669. n = conf.npage1 - offset;
  670. memmove(a, (char*)offset, n);
  671. return n;
  672. }
  673. error(Ebadarg);
  674. case Qprofile:
  675. s = p->seg[TSEG];
  676. if(s == 0 || s->profile == 0)
  677. error("profile is off");
  678. i = (s->top-s->base)>>LRESPROF;
  679. i *= sizeof(*s->profile);
  680. if(offset >= i)
  681. return 0;
  682. if(offset+n > i)
  683. n = i - offset;
  684. memmove(a, ((char*)s->profile)+offset, n);
  685. return n;
  686. case Qnote:
  687. qlock(&p->debug);
  688. if(waserror()){
  689. qunlock(&p->debug);
  690. nexterror();
  691. }
  692. if(p->pid != PID(c->qid))
  693. error(Eprocdied);
  694. if(n < 1) /* must accept at least the '\0' */
  695. error(Etoosmall);
  696. if(p->nnote == 0)
  697. n = 0;
  698. else {
  699. m = strlen(p->note[0].msg) + 1;
  700. if(m > n)
  701. m = n;
  702. memmove(va, p->note[0].msg, m);
  703. ((char*)va)[m-1] = '\0';
  704. p->nnote--;
  705. memmove(p->note, p->note+1, p->nnote*sizeof(Note));
  706. n = m;
  707. }
  708. if(p->nnote == 0)
  709. p->notepending = 0;
  710. poperror();
  711. qunlock(&p->debug);
  712. return n;
  713. case Qproc:
  714. if(offset >= sizeof(Proc))
  715. return 0;
  716. if(offset+n > sizeof(Proc))
  717. n = sizeof(Proc) - offset;
  718. memmove(a, ((char*)p)+offset, n);
  719. return n;
  720. case Qregs:
  721. rptr = (uchar*)p->dbgreg;
  722. rsize = sizeof(Ureg);
  723. goto regread;
  724. case Qkregs:
  725. memset(&kur, 0, sizeof(Ureg));
  726. setkernur(&kur, p);
  727. rptr = (uchar*)&kur;
  728. rsize = sizeof(Ureg);
  729. goto regread;
  730. case Qfpregs:
  731. rptr = (uchar*)&p->fpsave;
  732. rsize = sizeof(FPsave);
  733. regread:
  734. if(rptr == 0)
  735. error(Enoreg);
  736. if(offset >= rsize)
  737. return 0;
  738. if(offset+n > rsize)
  739. n = rsize - offset;
  740. memmove(a, rptr+offset, n);
  741. return n;
  742. case Qstatus:
  743. if(offset >= STATSIZE)
  744. return 0;
  745. if(offset+n > STATSIZE)
  746. n = STATSIZE - offset;
  747. sps = p->psstate;
  748. if(sps == 0)
  749. sps = statename[p->state];
  750. memset(statbuf, ' ', sizeof statbuf);
  751. memmove(statbuf+0*KNAMELEN, p->text, strlen(p->text));
  752. memmove(statbuf+1*KNAMELEN, p->user, strlen(p->user));
  753. memmove(statbuf+2*KNAMELEN, sps, strlen(sps));
  754. j = 2*KNAMELEN + 12;
  755. for(i = 0; i < 6; i++) {
  756. l = p->time[i];
  757. if(i == TReal)
  758. l = MACHP(0)->ticks - l;
  759. l = TK2MS(l);
  760. readnum(0, statbuf+j+NUMSIZE*i, NUMSIZE, l, NUMSIZE);
  761. }
  762. /* ignore stack, which is mostly non-existent */
  763. l = 0;
  764. for(i=1; i<NSEG; i++){
  765. s = p->seg[i];
  766. if(s)
  767. l += s->top - s->base;
  768. }
  769. readnum(0, statbuf+j+NUMSIZE*6, NUMSIZE, l>>10, NUMSIZE);
  770. readnum(0, statbuf+j+NUMSIZE*7, NUMSIZE, p->basepri, NUMSIZE);
  771. readnum(0, statbuf+j+NUMSIZE*8, NUMSIZE, p->priority, NUMSIZE);
  772. memmove(a, statbuf+offset, n);
  773. return n;
  774. case Qsegment:
  775. j = 0;
  776. for(i = 0; i < NSEG; i++) {
  777. sg = p->seg[i];
  778. if(sg == 0)
  779. continue;
  780. j += sprint(statbuf+j, "%-6s %c%c %.8lux %.8lux %4ld\n",
  781. sname[sg->type&SG_TYPE],
  782. sg->type&SG_RONLY ? 'R' : ' ',
  783. sg->profile ? 'P' : ' ',
  784. sg->base, sg->top, sg->ref);
  785. }
  786. if(offset >= j)
  787. return 0;
  788. if(offset+n > j)
  789. n = j-offset;
  790. if(n == 0 && offset == 0)
  791. exhausted("segments");
  792. memmove(a, &statbuf[offset], n);
  793. return n;
  794. case Qwait:
  795. if(!canqlock(&p->qwaitr))
  796. error(Einuse);
  797. if(waserror()) {
  798. qunlock(&p->qwaitr);
  799. nexterror();
  800. }
  801. lock(&p->exl);
  802. if(up == p && p->nchild == 0 && p->waitq == 0) {
  803. unlock(&p->exl);
  804. error(Enochild);
  805. }
  806. pid = p->pid;
  807. while(p->waitq == 0) {
  808. unlock(&p->exl);
  809. sleep(&p->waitr, haswaitq, p);
  810. if(p->pid != pid)
  811. error(Eprocdied);
  812. lock(&p->exl);
  813. }
  814. wq = p->waitq;
  815. p->waitq = wq->next;
  816. p->nwait--;
  817. unlock(&p->exl);
  818. qunlock(&p->qwaitr);
  819. poperror();
  820. n = snprint(a, n, "%d %lud %lud %lud %q",
  821. wq->w.pid,
  822. wq->w.time[TUser], wq->w.time[TSys], wq->w.time[TReal],
  823. wq->w.msg);
  824. free(wq);
  825. return n;
  826. case Qns:
  827. qlock(&p->debug);
  828. if(waserror()){
  829. qunlock(&p->debug);
  830. nexterror();
  831. }
  832. if(p->pgrp == nil || p->pid != PID(c->qid))
  833. error(Eprocdied);
  834. mw = c->aux;
  835. if(mw->cddone){
  836. qunlock(&p->debug);
  837. poperror();
  838. return 0;
  839. }
  840. mntscan(mw, p);
  841. if(mw->mh == 0){
  842. mw->cddone = 1;
  843. i = snprint(a, n, "cd %s\n", p->dot->name->s);
  844. qunlock(&p->debug);
  845. poperror();
  846. return i;
  847. }
  848. int2flag(mw->cm->mflag, flag);
  849. if(strcmp(mw->cm->to->name->s, "#M") == 0){
  850. srv = srvname(mw->cm->to->mchan);
  851. i = snprint(a, n, "mount %s %s %s %s\n", flag,
  852. srv==nil? mw->cm->to->mchan->name->s : srv,
  853. mw->mh->from->name->s, mw->cm->spec? mw->cm->spec : "");
  854. free(srv);
  855. }else
  856. i = snprint(a, n, "bind %s %s %s\n", flag,
  857. mw->cm->to->name->s, mw->mh->from->name->s);
  858. qunlock(&p->debug);
  859. poperror();
  860. return i;
  861. case Qnoteid:
  862. return readnum(offset, va, n, p->noteid, NUMSIZE);
  863. case Qfd:
  864. return procfds(p, va, n, offset);
  865. }
  866. error(Egreg);
  867. return 0; /* not reached */
  868. }
  869. void
  870. mntscan(Mntwalk *mw, Proc *p)
  871. {
  872. Pgrp *pg;
  873. Mount *t;
  874. Mhead *f;
  875. int nxt, i;
  876. ulong last, bestmid;
  877. pg = p->pgrp;
  878. rlock(&pg->ns);
  879. nxt = 0;
  880. bestmid = ~0;
  881. last = 0;
  882. if(mw->mh)
  883. last = mw->cm->mountid;
  884. for(i = 0; i < MNTHASH; i++) {
  885. for(f = pg->mnthash[i]; f; f = f->hash) {
  886. for(t = f->mount; t; t = t->next) {
  887. if(mw->mh == 0 ||
  888. (t->mountid > last && t->mountid < bestmid)) {
  889. mw->cm = t;
  890. mw->mh = f;
  891. bestmid = mw->cm->mountid;
  892. nxt = 1;
  893. }
  894. }
  895. }
  896. }
  897. if(nxt == 0)
  898. mw->mh = 0;
  899. runlock(&pg->ns);
  900. }
  901. static long
  902. procwrite(Chan *c, void *va, long n, vlong off)
  903. {
  904. int id, m;
  905. Proc *p, *t, *et;
  906. char *a, *arg, buf[ERRMAX];
  907. ulong offset = off;
  908. a = va;
  909. if(c->qid.type & QTDIR)
  910. error(Eisdir);
  911. p = proctab(SLOT(c->qid));
  912. /* Use the remembered noteid in the channel rather
  913. * than the process pgrpid
  914. */
  915. if(QID(c->qid) == Qnotepg) {
  916. pgrpnote(NOTEID(c->pgrpid), va, n, NUser);
  917. return n;
  918. }
  919. qlock(&p->debug);
  920. if(waserror()){
  921. qunlock(&p->debug);
  922. nexterror();
  923. }
  924. if(p->pid != PID(c->qid))
  925. error(Eprocdied);
  926. switch(QID(c->qid)){
  927. case Qargs:
  928. if(n == 0)
  929. error(Eshort);
  930. if(n >= ERRMAX)
  931. error(Etoobig);
  932. arg = malloc(n+1);
  933. if(arg == nil)
  934. error(Enomem);
  935. memmove(arg, va, n);
  936. m = n;
  937. if(arg[m-1] != 0)
  938. arg[m++] = 0;
  939. free(p->args);
  940. p->nargs = m;
  941. p->args = arg;
  942. p->setargs = 1;
  943. break;
  944. case Qmem:
  945. if(p->state != Stopped)
  946. error(Ebadctl);
  947. n = procctlmemio(p, offset, n, va, 0);
  948. break;
  949. case Qregs:
  950. if(offset >= sizeof(Ureg))
  951. return 0;
  952. if(offset+n > sizeof(Ureg))
  953. n = sizeof(Ureg) - offset;
  954. if(p->dbgreg == 0)
  955. error(Enoreg);
  956. setregisters(p->dbgreg, (char*)(p->dbgreg)+offset, va, n);
  957. break;
  958. case Qfpregs:
  959. if(offset >= sizeof(FPsave))
  960. return 0;
  961. if(offset+n > sizeof(FPsave))
  962. n = sizeof(FPsave) - offset;
  963. memmove((uchar*)&p->fpsave+offset, va, n);
  964. break;
  965. case Qctl:
  966. procctlreq(p, va, n);
  967. break;
  968. case Qnote:
  969. if(p->kp)
  970. error(Eperm);
  971. if(n >= ERRMAX-1)
  972. error(Etoobig);
  973. memmove(buf, va, n);
  974. buf[n] = 0;
  975. if(!postnote(p, 0, buf, NUser))
  976. error("note not posted");
  977. break;
  978. case Qnoteid:
  979. id = atoi(a);
  980. if(id == p->pid) {
  981. p->noteid = id;
  982. break;
  983. }
  984. t = proctab(0);
  985. for(et = t+conf.nproc; t < et; t++) {
  986. if(id == t->noteid) {
  987. if(strcmp(p->user, t->user) != 0)
  988. error(Eperm);
  989. p->noteid = id;
  990. break;
  991. }
  992. }
  993. if(p->noteid != id)
  994. error(Ebadarg);
  995. break;
  996. default:
  997. pprint("unknown qid in procwrite\n");
  998. error(Egreg);
  999. }
  1000. poperror();
  1001. qunlock(&p->debug);
  1002. return n;
  1003. }
  1004. Dev procdevtab = {
  1005. 'p',
  1006. "proc",
  1007. devreset,
  1008. procinit,
  1009. devshutdown,
  1010. procattach,
  1011. procwalk,
  1012. procstat,
  1013. procopen,
  1014. devcreate,
  1015. procclose,
  1016. procread,
  1017. devbread,
  1018. procwrite,
  1019. devbwrite,
  1020. devremove,
  1021. procwstat,
  1022. };
  1023. Chan*
  1024. proctext(Chan *c, Proc *p)
  1025. {
  1026. Chan *tc;
  1027. Image *i;
  1028. Segment *s;
  1029. s = p->seg[TSEG];
  1030. if(s == 0)
  1031. error(Enonexist);
  1032. if(p->state==Dead)
  1033. error(Eprocdied);
  1034. lock(s);
  1035. i = s->image;
  1036. if(i == 0) {
  1037. unlock(s);
  1038. error(Eprocdied);
  1039. }
  1040. unlock(s);
  1041. lock(i);
  1042. if(waserror()) {
  1043. unlock(i);
  1044. nexterror();
  1045. }
  1046. tc = i->c;
  1047. if(tc == 0)
  1048. error(Eprocdied);
  1049. if(incref(tc) == 1 || (tc->flag&COPEN) == 0 || tc->mode!=OREAD) {
  1050. cclose(tc);
  1051. error(Eprocdied);
  1052. }
  1053. if(p->pid != PID(c->qid))
  1054. error(Eprocdied);
  1055. unlock(i);
  1056. poperror();
  1057. return tc;
  1058. }
  1059. void
  1060. procstopwait(Proc *p, int ctl)
  1061. {
  1062. int pid;
  1063. if(p->pdbg)
  1064. error(Einuse);
  1065. if(procstopped(p) || p->state == Broken)
  1066. return;
  1067. if(ctl != 0)
  1068. p->procctl = ctl;
  1069. p->pdbg = up;
  1070. pid = p->pid;
  1071. qunlock(&p->debug);
  1072. up->psstate = "Stopwait";
  1073. if(waserror()) {
  1074. p->pdbg = 0;
  1075. qlock(&p->debug);
  1076. nexterror();
  1077. }
  1078. sleep(&up->sleep, procstopped, p);
  1079. poperror();
  1080. qlock(&p->debug);
  1081. if(p->pid != pid)
  1082. error(Eprocdied);
  1083. }
  1084. static void
  1085. procctlcloseone(Proc *p, Fgrp *f, int fd)
  1086. {
  1087. Chan *c;
  1088. c = f->fd[fd];
  1089. if(c == nil)
  1090. return;
  1091. f->fd[fd] = nil;
  1092. unlock(f);
  1093. qunlock(&p->debug);
  1094. cclose(c);
  1095. qlock(&p->debug);
  1096. lock(f);
  1097. }
  1098. void
  1099. procctlclosefiles(Proc *p, int all, int fd)
  1100. {
  1101. int i;
  1102. Fgrp *f;
  1103. f = p->fgrp;
  1104. if(f == nil)
  1105. error(Eprocdied);
  1106. lock(f);
  1107. f->ref++;
  1108. if(all)
  1109. for(i = 0; i < f->maxfd; i++)
  1110. procctlcloseone(p, f, i);
  1111. else
  1112. procctlcloseone(p, f, fd);
  1113. unlock(f);
  1114. closefgrp(f);
  1115. }
  1116. static char *
  1117. parsetime(vlong *rt, char *s)
  1118. {
  1119. uvlong ticks;
  1120. ulong l;
  1121. char *e, *p;
  1122. static int p10[] = {100000000, 10000000, 1000000, 100000, 10000, 1000, 100, 10, 1};
  1123. if (s == nil)
  1124. return("missing value");
  1125. ticks=strtoul(s, &e, 10);
  1126. if (*e == '.'){
  1127. p = e+1;
  1128. l = strtoul(p, &e, 10);
  1129. if(e-p > nelem(p10))
  1130. return "too many digits after decimal point";
  1131. if(e-p == 0)
  1132. return "ill-formed number";
  1133. l *= p10[e-p-1];
  1134. }else
  1135. l = 0;
  1136. if (*e == '\0' || strcmp(e, "s") == 0){
  1137. ticks = 1000000000 * ticks + l;
  1138. }else if (strcmp(e, "ms") == 0){
  1139. ticks = 1000000 * ticks + l/1000;
  1140. }else if (strcmp(e, "µs") == 0 || strcmp(e, "us") == 0){
  1141. ticks = 1000 * ticks + l/1000000;
  1142. }else if (strcmp(e, "ns") != 0)
  1143. return "unrecognized unit";
  1144. *rt = ticks;
  1145. return nil;
  1146. }
  1147. void
  1148. procctlreq(Proc *p, char *va, int n)
  1149. {
  1150. Segment *s;
  1151. int npc, pri;
  1152. Cmdbuf *cb;
  1153. Cmdtab *ct;
  1154. vlong time;
  1155. char *e;
  1156. if(p->kp) /* no ctl requests to kprocs */
  1157. error(Eperm);
  1158. cb = parsecmd(va, n);
  1159. if(waserror()){
  1160. free(cb);
  1161. nexterror();
  1162. }
  1163. ct = lookupcmd(cb, proccmd, nelem(proccmd));
  1164. switch(ct->index){
  1165. case CMclose:
  1166. procctlclosefiles(p, 0, atoi(cb->f[1]));
  1167. break;
  1168. case CMclosefiles:
  1169. procctlclosefiles(p, 1, 0);
  1170. break;
  1171. case CMhang:
  1172. p->hang = 1;
  1173. break;
  1174. case CMkill:
  1175. switch(p->state) {
  1176. case Broken:
  1177. unbreak(p);
  1178. break;
  1179. case Stopped:
  1180. postnote(p, 0, "sys: killed", NExit);
  1181. p->procctl = Proc_exitme;
  1182. ready(p);
  1183. break;
  1184. default:
  1185. postnote(p, 0, "sys: killed", NExit);
  1186. p->procctl = Proc_exitme;
  1187. }
  1188. break;
  1189. case CMnohang:
  1190. p->hang = 0;
  1191. break;
  1192. case CMnoswap:
  1193. p->noswap = 1;
  1194. break;
  1195. case CMpri:
  1196. pri = atoi(cb->f[1]);
  1197. if(pri > PriNormal && !iseve())
  1198. error(Eperm);
  1199. procpriority(p, pri, 0);
  1200. break;
  1201. case CMfixedpri:
  1202. pri = atoi(cb->f[1]);
  1203. if(pri > PriNormal && !iseve())
  1204. error(Eperm);
  1205. procpriority(p, pri, 1);
  1206. break;
  1207. case CMprivate:
  1208. p->privatemem = 1;
  1209. break;
  1210. case CMprofile:
  1211. s = p->seg[TSEG];
  1212. if(s == 0 || (s->type&SG_TYPE) != SG_TEXT)
  1213. error(Ebadctl);
  1214. if(s->profile != 0)
  1215. free(s->profile);
  1216. npc = (s->top-s->base)>>LRESPROF;
  1217. s->profile = malloc(npc*sizeof(*s->profile));
  1218. if(s->profile == 0)
  1219. error(Enomem);
  1220. break;
  1221. case CMstart:
  1222. if(p->state != Stopped)
  1223. error(Ebadctl);
  1224. ready(p);
  1225. break;
  1226. case CMstartstop:
  1227. if(p->state != Stopped)
  1228. error(Ebadctl);
  1229. p->procctl = Proc_traceme;
  1230. ready(p);
  1231. procstopwait(p, Proc_traceme);
  1232. break;
  1233. case CMstartsyscall:
  1234. if(p->state != Stopped)
  1235. error(Ebadctl);
  1236. p->procctl = Proc_tracesyscall;
  1237. ready(p);
  1238. procstopwait(p, Proc_tracesyscall);
  1239. break;
  1240. case CMstop:
  1241. procstopwait(p, Proc_stopme);
  1242. break;
  1243. case CMwaitstop:
  1244. procstopwait(p, 0);
  1245. break;
  1246. case CMwired:
  1247. procwired(p, atoi(cb->f[1]));
  1248. break;
  1249. case CMtrace:
  1250. switch(cb->nf){
  1251. case 1:
  1252. p->trace ^= 1;
  1253. break;
  1254. case 2:
  1255. p->trace = atoi(cb->f[1])?1:0;
  1256. break;
  1257. default:
  1258. error("args");
  1259. }
  1260. break;
  1261. /* real time */
  1262. case CMperiod:
  1263. if(p->edf == nil)
  1264. edfinit(p);
  1265. if(e=parsetime(&time, cb->f[1]))
  1266. error(e);
  1267. edfstop(p);
  1268. p->edf->T = time;
  1269. break;
  1270. case CMdeadline:
  1271. if(p->edf == nil)
  1272. edfinit(p);
  1273. if(e=parsetime(&time, cb->f[1]))
  1274. error(e);
  1275. edfstop(p);
  1276. p->edf->D = time;
  1277. break;
  1278. case CMcost:
  1279. if(p->edf == nil)
  1280. edfinit(p);
  1281. if(e=parsetime(&time, cb->f[1]))
  1282. error(e);
  1283. edfstop(p);
  1284. p->edf->C = time;
  1285. break;
  1286. case CMsporadic:
  1287. if(p->edf == nil)
  1288. edfinit(p);
  1289. p->edf->flags |= Sporadic;
  1290. break;
  1291. case CMdeadlinenotes:
  1292. if(p->edf == nil)
  1293. edfinit(p);
  1294. p->edf->flags |= Sendnotes;
  1295. break;
  1296. case CMadmit:
  1297. if(p->edf == 0)
  1298. error("edf params");
  1299. if(e = edfadmit(p))
  1300. error(e);
  1301. break;
  1302. case CMextra:
  1303. if(p->edf == nil)
  1304. edfinit(p);
  1305. p->edf->flags |= Extratime;
  1306. break;
  1307. case CMexpel:
  1308. if(p->edf)
  1309. edfstop(p);
  1310. break;
  1311. }
  1312. poperror();
  1313. free(cb);
  1314. }
  1315. int
  1316. procstopped(void *a)
  1317. {
  1318. Proc *p = a;
  1319. return p->state == Stopped;
  1320. }
  1321. int
  1322. procctlmemio(Proc *p, ulong offset, int n, void *va, int read)
  1323. {
  1324. KMap *k;
  1325. Pte *pte;
  1326. Page *pg;
  1327. Segment *s;
  1328. ulong soff, l;
  1329. char *a = va, *b;
  1330. for(;;) {
  1331. s = seg(p, offset, 1);
  1332. if(s == 0)
  1333. error(Ebadarg);
  1334. if(offset+n >= s->top)
  1335. n = s->top-offset;
  1336. if(!read && (s->type&SG_TYPE) == SG_TEXT)
  1337. s = txt2data(p, s);
  1338. s->steal++;
  1339. soff = offset-s->base;
  1340. if(waserror()) {
  1341. s->steal--;
  1342. nexterror();
  1343. }
  1344. if(fixfault(s, offset, read, 0) == 0)
  1345. break;
  1346. poperror();
  1347. s->steal--;
  1348. }
  1349. poperror();
  1350. pte = s->map[soff/PTEMAPMEM];
  1351. if(pte == 0)
  1352. panic("procctlmemio");
  1353. pg = pte->pages[(soff&(PTEMAPMEM-1))/BY2PG];
  1354. if(pagedout(pg))
  1355. panic("procctlmemio1");
  1356. l = BY2PG - (offset&(BY2PG-1));
  1357. if(n > l)
  1358. n = l;
  1359. k = kmap(pg);
  1360. if(waserror()) {
  1361. s->steal--;
  1362. kunmap(k);
  1363. nexterror();
  1364. }
  1365. b = (char*)VA(k);
  1366. b += offset&(BY2PG-1);
  1367. if(read == 1)
  1368. memmove(a, b, n); /* This can fault */
  1369. else
  1370. memmove(b, a, n);
  1371. kunmap(k);
  1372. poperror();
  1373. /* Ensure the process sees text page changes */
  1374. if(s->flushme)
  1375. memset(pg->cachectl, PG_TXTFLUSH, sizeof(pg->cachectl));
  1376. s->steal--;
  1377. if(read == 0)
  1378. p->newtlb = 1;
  1379. return n;
  1380. }
  1381. Segment*
  1382. txt2data(Proc *p, Segment *s)
  1383. {
  1384. int i;
  1385. Segment *ps;
  1386. ps = newseg(SG_DATA, s->base, s->size);
  1387. ps->image = s->image;
  1388. incref(ps->image);
  1389. ps->fstart = s->fstart;
  1390. ps->flen = s->flen;
  1391. ps->flushme = 1;
  1392. qlock(&p->seglock);
  1393. for(i = 0; i < NSEG; i++)
  1394. if(p->seg[i] == s)
  1395. break;
  1396. if(p->seg[i] != s)
  1397. panic("segment gone");
  1398. qunlock(&s->lk);
  1399. putseg(s);
  1400. qlock(&ps->lk);
  1401. p->seg[i] = ps;
  1402. qunlock(&p->seglock);
  1403. return ps;
  1404. }
  1405. Segment*
  1406. data2txt(Segment *s)
  1407. {
  1408. Segment *ps;
  1409. ps = newseg(SG_TEXT, s->base, s->size);
  1410. ps->image = s->image;
  1411. incref(ps->image);
  1412. ps->fstart = s->fstart;
  1413. ps->flen = s->flen;
  1414. ps->flushme = 1;
  1415. return ps;
  1416. }