devproc.c 28 KB

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