devproc.c 28 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585
  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. char *a, flag[10], *sps, *srv, statbuf[NSEG*32];
  600. int i, j, m, navail, ne, pid, rsize;
  601. long l;
  602. uchar *rptr;
  603. ulong offset;
  604. Confmem *cm;
  605. Mntwalk *mw;
  606. Proc *p;
  607. Segment *sg, *s;
  608. Ureg kur;
  609. Waitq *wq;
  610. a = va;
  611. offset = off;
  612. if(c->qid.type & QTDIR)
  613. return devdirread(c, a, n, 0, 0, procgen);
  614. if(QID(c->qid) == Qtrace){
  615. if(!eventsavailable(nil))
  616. return 0;
  617. rptr = (uchar*)va;
  618. navail = tproduced - tconsumed;
  619. if(navail > n / sizeof(Traceevent))
  620. navail = n / sizeof(Traceevent);
  621. while(navail > 0) {
  622. ne = ((tconsumed & Emask) + navail > Nevents)?
  623. Nevents - (tconsumed & Emask): navail;
  624. memmove(rptr, &tevents[tconsumed & Emask],
  625. ne * sizeof(Traceevent));
  626. tconsumed += ne;
  627. rptr += ne * sizeof(Traceevent);
  628. navail -= ne;
  629. }
  630. return rptr - (uchar*)va;
  631. }
  632. p = proctab(SLOT(c->qid));
  633. if(p->pid != PID(c->qid))
  634. error(Eprocdied);
  635. switch(QID(c->qid)){
  636. case Qargs:
  637. qlock(&p->debug);
  638. j = procargs(p, p->genbuf, sizeof p->genbuf);
  639. qunlock(&p->debug);
  640. if(offset >= j)
  641. return 0;
  642. if(offset+n > j)
  643. n = j-offset;
  644. memmove(a, &p->genbuf[offset], n);
  645. return n;
  646. case Qmem:
  647. if(offset < KZERO)
  648. return procctlmemio(p, offset, n, va, 1);
  649. if(!iseve())
  650. error(Eperm);
  651. /* validate kernel addresses */
  652. if(offset < (ulong)end) {
  653. if(offset+n > (ulong)end)
  654. n = (ulong)end - offset;
  655. memmove(a, (char*)offset, n);
  656. return n;
  657. }
  658. for(i=0; i<nelem(conf.mem); i++){
  659. cm = &conf.mem[i];
  660. /* klimit-1 because klimit might be zero! */
  661. if(cm->kbase <= offset && offset <= cm->klimit-1){
  662. if(offset+n >= cm->klimit-1)
  663. n = cm->klimit - offset;
  664. memmove(a, (char*)offset, n);
  665. return n;
  666. }
  667. }
  668. error(Ebadarg);
  669. case Qprofile:
  670. s = p->seg[TSEG];
  671. if(s == 0 || s->profile == 0)
  672. error("profile is off");
  673. i = (s->top-s->base)>>LRESPROF;
  674. i *= sizeof(*s->profile);
  675. if(offset >= i)
  676. return 0;
  677. if(offset+n > i)
  678. n = i - offset;
  679. memmove(a, ((char*)s->profile)+offset, n);
  680. return n;
  681. case Qnote:
  682. qlock(&p->debug);
  683. if(waserror()){
  684. qunlock(&p->debug);
  685. nexterror();
  686. }
  687. if(p->pid != PID(c->qid))
  688. error(Eprocdied);
  689. if(n < 1) /* must accept at least the '\0' */
  690. error(Etoosmall);
  691. if(p->nnote == 0)
  692. n = 0;
  693. else {
  694. m = strlen(p->note[0].msg) + 1;
  695. if(m > n)
  696. m = n;
  697. memmove(va, p->note[0].msg, m);
  698. ((char*)va)[m-1] = '\0';
  699. p->nnote--;
  700. memmove(p->note, p->note+1, p->nnote*sizeof(Note));
  701. n = m;
  702. }
  703. if(p->nnote == 0)
  704. p->notepending = 0;
  705. poperror();
  706. qunlock(&p->debug);
  707. return n;
  708. case Qproc:
  709. if(offset >= sizeof(Proc))
  710. return 0;
  711. if(offset+n > sizeof(Proc))
  712. n = sizeof(Proc) - offset;
  713. memmove(a, ((char*)p)+offset, n);
  714. return n;
  715. case Qregs:
  716. rptr = (uchar*)p->dbgreg;
  717. rsize = sizeof(Ureg);
  718. goto regread;
  719. case Qkregs:
  720. memset(&kur, 0, sizeof(Ureg));
  721. setkernur(&kur, p);
  722. rptr = (uchar*)&kur;
  723. rsize = sizeof(Ureg);
  724. goto regread;
  725. case Qfpregs:
  726. rptr = (uchar*)&p->fpsave;
  727. rsize = sizeof(FPsave);
  728. regread:
  729. if(rptr == 0)
  730. error(Enoreg);
  731. if(offset >= rsize)
  732. return 0;
  733. if(offset+n > rsize)
  734. n = rsize - offset;
  735. memmove(a, rptr+offset, n);
  736. return n;
  737. case Qstatus:
  738. if(offset >= STATSIZE)
  739. return 0;
  740. if(offset+n > STATSIZE)
  741. n = STATSIZE - offset;
  742. sps = p->psstate;
  743. if(sps == 0)
  744. sps = statename[p->state];
  745. memset(statbuf, ' ', sizeof statbuf);
  746. memmove(statbuf+0*KNAMELEN, p->text, strlen(p->text));
  747. memmove(statbuf+1*KNAMELEN, p->user, strlen(p->user));
  748. memmove(statbuf+2*KNAMELEN, sps, strlen(sps));
  749. j = 2*KNAMELEN + 12;
  750. for(i = 0; i < 6; i++) {
  751. l = p->time[i];
  752. if(i == TReal)
  753. l = MACHP(0)->ticks - l;
  754. l = TK2MS(l);
  755. readnum(0, statbuf+j+NUMSIZE*i, NUMSIZE, l, NUMSIZE);
  756. }
  757. /* ignore stack, which is mostly non-existent */
  758. l = 0;
  759. for(i=1; i<NSEG; i++){
  760. s = p->seg[i];
  761. if(s)
  762. l += s->top - s->base;
  763. }
  764. readnum(0, statbuf+j+NUMSIZE*6, NUMSIZE, l>>10, NUMSIZE);
  765. readnum(0, statbuf+j+NUMSIZE*7, NUMSIZE, p->basepri, NUMSIZE);
  766. readnum(0, statbuf+j+NUMSIZE*8, NUMSIZE, p->priority, NUMSIZE);
  767. memmove(a, statbuf+offset, n);
  768. return n;
  769. case Qsegment:
  770. j = 0;
  771. for(i = 0; i < NSEG; i++) {
  772. sg = p->seg[i];
  773. if(sg == 0)
  774. continue;
  775. j += sprint(statbuf+j, "%-6s %c%c %.8lux %.8lux %4ld\n",
  776. sname[sg->type&SG_TYPE],
  777. sg->type&SG_RONLY ? 'R' : ' ',
  778. sg->profile ? 'P' : ' ',
  779. sg->base, sg->top, sg->ref);
  780. }
  781. if(offset >= j)
  782. return 0;
  783. if(offset+n > j)
  784. n = j-offset;
  785. if(n == 0 && offset == 0)
  786. exhausted("segments");
  787. memmove(a, &statbuf[offset], n);
  788. return n;
  789. case Qwait:
  790. if(!canqlock(&p->qwaitr))
  791. error(Einuse);
  792. if(waserror()) {
  793. qunlock(&p->qwaitr);
  794. nexterror();
  795. }
  796. lock(&p->exl);
  797. if(up == p && p->nchild == 0 && p->waitq == 0) {
  798. unlock(&p->exl);
  799. error(Enochild);
  800. }
  801. pid = p->pid;
  802. while(p->waitq == 0) {
  803. unlock(&p->exl);
  804. sleep(&p->waitr, haswaitq, p);
  805. if(p->pid != pid)
  806. error(Eprocdied);
  807. lock(&p->exl);
  808. }
  809. wq = p->waitq;
  810. p->waitq = wq->next;
  811. p->nwait--;
  812. unlock(&p->exl);
  813. qunlock(&p->qwaitr);
  814. poperror();
  815. n = snprint(a, n, "%d %lud %lud %lud %q",
  816. wq->w.pid,
  817. wq->w.time[TUser], wq->w.time[TSys], wq->w.time[TReal],
  818. wq->w.msg);
  819. free(wq);
  820. return n;
  821. case Qns:
  822. qlock(&p->debug);
  823. if(waserror()){
  824. qunlock(&p->debug);
  825. nexterror();
  826. }
  827. if(p->pgrp == nil || p->pid != PID(c->qid))
  828. error(Eprocdied);
  829. mw = c->aux;
  830. if(mw->cddone){
  831. qunlock(&p->debug);
  832. poperror();
  833. return 0;
  834. }
  835. mntscan(mw, p);
  836. if(mw->mh == 0){
  837. mw->cddone = 1;
  838. i = snprint(a, n, "cd %s\n", p->dot->path->s);
  839. qunlock(&p->debug);
  840. poperror();
  841. return i;
  842. }
  843. int2flag(mw->cm->mflag, flag);
  844. if(strcmp(mw->cm->to->path->s, "#M") == 0){
  845. srv = srvname(mw->cm->to->mchan);
  846. i = snprint(a, n, "mount %s %s %s %s\n", flag,
  847. srv==nil? mw->cm->to->mchan->path->s : srv,
  848. mw->mh->from->path->s, mw->cm->spec? mw->cm->spec : "");
  849. free(srv);
  850. }else
  851. i = snprint(a, n, "bind %s %s %s\n", flag,
  852. mw->cm->to->path->s, mw->mh->from->path->s);
  853. qunlock(&p->debug);
  854. poperror();
  855. return i;
  856. case Qnoteid:
  857. return readnum(offset, va, n, p->noteid, NUMSIZE);
  858. case Qfd:
  859. return procfds(p, va, n, offset);
  860. }
  861. error(Egreg);
  862. return 0; /* not reached */
  863. }
  864. void
  865. mntscan(Mntwalk *mw, Proc *p)
  866. {
  867. Pgrp *pg;
  868. Mount *t;
  869. Mhead *f;
  870. int nxt, i;
  871. ulong last, bestmid;
  872. pg = p->pgrp;
  873. rlock(&pg->ns);
  874. nxt = 0;
  875. bestmid = ~0;
  876. last = 0;
  877. if(mw->mh)
  878. last = mw->cm->mountid;
  879. for(i = 0; i < MNTHASH; i++) {
  880. for(f = pg->mnthash[i]; f; f = f->hash) {
  881. for(t = f->mount; t; t = t->next) {
  882. if(mw->mh == 0 ||
  883. (t->mountid > last && t->mountid < bestmid)) {
  884. mw->cm = t;
  885. mw->mh = f;
  886. bestmid = mw->cm->mountid;
  887. nxt = 1;
  888. }
  889. }
  890. }
  891. }
  892. if(nxt == 0)
  893. mw->mh = 0;
  894. runlock(&pg->ns);
  895. }
  896. static long
  897. procwrite(Chan *c, void *va, long n, vlong off)
  898. {
  899. int id, m;
  900. Proc *p, *t, *et;
  901. char *a, *arg, buf[ERRMAX];
  902. ulong offset = off;
  903. a = va;
  904. if(c->qid.type & QTDIR)
  905. error(Eisdir);
  906. p = proctab(SLOT(c->qid));
  907. /* Use the remembered noteid in the channel rather
  908. * than the process pgrpid
  909. */
  910. if(QID(c->qid) == Qnotepg) {
  911. pgrpnote(NOTEID(c->pgrpid), va, n, NUser);
  912. return n;
  913. }
  914. qlock(&p->debug);
  915. if(waserror()){
  916. qunlock(&p->debug);
  917. nexterror();
  918. }
  919. if(p->pid != PID(c->qid))
  920. error(Eprocdied);
  921. switch(QID(c->qid)){
  922. case Qargs:
  923. if(n == 0)
  924. error(Eshort);
  925. if(n >= ERRMAX)
  926. error(Etoobig);
  927. arg = malloc(n+1);
  928. if(arg == nil)
  929. error(Enomem);
  930. memmove(arg, va, n);
  931. m = n;
  932. if(arg[m-1] != 0)
  933. arg[m++] = 0;
  934. free(p->args);
  935. p->nargs = m;
  936. p->args = arg;
  937. p->setargs = 1;
  938. break;
  939. case Qmem:
  940. if(p->state != Stopped)
  941. error(Ebadctl);
  942. n = procctlmemio(p, offset, n, va, 0);
  943. break;
  944. case Qregs:
  945. if(offset >= sizeof(Ureg))
  946. return 0;
  947. if(offset+n > sizeof(Ureg))
  948. n = sizeof(Ureg) - offset;
  949. if(p->dbgreg == 0)
  950. error(Enoreg);
  951. setregisters(p->dbgreg, (char*)(p->dbgreg)+offset, va, n);
  952. break;
  953. case Qfpregs:
  954. if(offset >= sizeof(FPsave))
  955. return 0;
  956. if(offset+n > sizeof(FPsave))
  957. n = sizeof(FPsave) - offset;
  958. memmove((uchar*)&p->fpsave+offset, va, n);
  959. break;
  960. case Qctl:
  961. procctlreq(p, va, n);
  962. break;
  963. case Qnote:
  964. if(p->kp)
  965. error(Eperm);
  966. if(n >= ERRMAX-1)
  967. error(Etoobig);
  968. memmove(buf, va, n);
  969. buf[n] = 0;
  970. if(!postnote(p, 0, buf, NUser))
  971. error("note not posted");
  972. break;
  973. case Qnoteid:
  974. id = atoi(a);
  975. if(id == p->pid) {
  976. p->noteid = id;
  977. break;
  978. }
  979. t = proctab(0);
  980. for(et = t+conf.nproc; t < et; t++) {
  981. if(t->state == Dead)
  982. continue;
  983. if(id == t->noteid) {
  984. if(strcmp(p->user, t->user) != 0)
  985. error(Eperm);
  986. p->noteid = id;
  987. break;
  988. }
  989. }
  990. if(p->noteid != id)
  991. error(Ebadarg);
  992. break;
  993. default:
  994. pprint("unknown qid in procwrite\n");
  995. error(Egreg);
  996. }
  997. poperror();
  998. qunlock(&p->debug);
  999. return n;
  1000. }
  1001. Dev procdevtab = {
  1002. 'p',
  1003. "proc",
  1004. devreset,
  1005. procinit,
  1006. devshutdown,
  1007. procattach,
  1008. procwalk,
  1009. procstat,
  1010. procopen,
  1011. devcreate,
  1012. procclose,
  1013. procread,
  1014. devbread,
  1015. procwrite,
  1016. devbwrite,
  1017. devremove,
  1018. procwstat,
  1019. };
  1020. Chan*
  1021. proctext(Chan *c, Proc *p)
  1022. {
  1023. Chan *tc;
  1024. Image *i;
  1025. Segment *s;
  1026. s = p->seg[TSEG];
  1027. if(s == 0)
  1028. error(Enonexist);
  1029. if(p->state==Dead)
  1030. error(Eprocdied);
  1031. lock(s);
  1032. i = s->image;
  1033. if(i == 0) {
  1034. unlock(s);
  1035. error(Eprocdied);
  1036. }
  1037. unlock(s);
  1038. lock(i);
  1039. if(waserror()) {
  1040. unlock(i);
  1041. nexterror();
  1042. }
  1043. tc = i->c;
  1044. if(tc == 0)
  1045. error(Eprocdied);
  1046. if(incref(tc) == 1 || (tc->flag&COPEN) == 0 || tc->mode!=OREAD) {
  1047. cclose(tc);
  1048. error(Eprocdied);
  1049. }
  1050. if(p->pid != PID(c->qid))
  1051. error(Eprocdied);
  1052. unlock(i);
  1053. poperror();
  1054. return tc;
  1055. }
  1056. void
  1057. procstopwait(Proc *p, int ctl)
  1058. {
  1059. int pid;
  1060. if(p->pdbg)
  1061. error(Einuse);
  1062. if(procstopped(p) || p->state == Broken)
  1063. return;
  1064. if(ctl != 0)
  1065. p->procctl = ctl;
  1066. p->pdbg = up;
  1067. pid = p->pid;
  1068. qunlock(&p->debug);
  1069. up->psstate = "Stopwait";
  1070. if(waserror()) {
  1071. p->pdbg = 0;
  1072. qlock(&p->debug);
  1073. nexterror();
  1074. }
  1075. sleep(&up->sleep, procstopped, p);
  1076. poperror();
  1077. qlock(&p->debug);
  1078. if(p->pid != pid)
  1079. error(Eprocdied);
  1080. }
  1081. static void
  1082. procctlcloseone(Proc *p, Fgrp *f, int fd)
  1083. {
  1084. Chan *c;
  1085. c = f->fd[fd];
  1086. if(c == nil)
  1087. return;
  1088. f->fd[fd] = nil;
  1089. unlock(f);
  1090. qunlock(&p->debug);
  1091. cclose(c);
  1092. qlock(&p->debug);
  1093. lock(f);
  1094. }
  1095. void
  1096. procctlclosefiles(Proc *p, int all, int fd)
  1097. {
  1098. int i;
  1099. Fgrp *f;
  1100. f = p->fgrp;
  1101. if(f == nil)
  1102. error(Eprocdied);
  1103. lock(f);
  1104. f->ref++;
  1105. if(all)
  1106. for(i = 0; i < f->maxfd; i++)
  1107. procctlcloseone(p, f, i);
  1108. else
  1109. procctlcloseone(p, f, fd);
  1110. unlock(f);
  1111. closefgrp(f);
  1112. }
  1113. static char *
  1114. parsetime(vlong *rt, char *s)
  1115. {
  1116. uvlong ticks;
  1117. ulong l;
  1118. char *e, *p;
  1119. static int p10[] = {100000000, 10000000, 1000000, 100000, 10000, 1000, 100, 10, 1};
  1120. if (s == nil)
  1121. return("missing value");
  1122. ticks=strtoul(s, &e, 10);
  1123. if (*e == '.'){
  1124. p = e+1;
  1125. l = strtoul(p, &e, 10);
  1126. if(e-p > nelem(p10))
  1127. return "too many digits after decimal point";
  1128. if(e-p == 0)
  1129. return "ill-formed number";
  1130. l *= p10[e-p-1];
  1131. }else
  1132. l = 0;
  1133. if (*e == '\0' || strcmp(e, "s") == 0){
  1134. ticks = 1000000000 * ticks + l;
  1135. }else if (strcmp(e, "ms") == 0){
  1136. ticks = 1000000 * ticks + l/1000;
  1137. }else if (strcmp(e, "µs") == 0 || strcmp(e, "us") == 0){
  1138. ticks = 1000 * ticks + l/1000000;
  1139. }else if (strcmp(e, "ns") != 0)
  1140. return "unrecognized unit";
  1141. *rt = ticks;
  1142. return nil;
  1143. }
  1144. void
  1145. procctlreq(Proc *p, char *va, int n)
  1146. {
  1147. Segment *s;
  1148. int npc, pri;
  1149. Cmdbuf *cb;
  1150. Cmdtab *ct;
  1151. vlong time;
  1152. char *e;
  1153. void (*pt)(Proc*, int, vlong);
  1154. if(p->kp) /* no ctl requests to kprocs */
  1155. error(Eperm);
  1156. cb = parsecmd(va, n);
  1157. if(waserror()){
  1158. free(cb);
  1159. nexterror();
  1160. }
  1161. ct = lookupcmd(cb, proccmd, nelem(proccmd));
  1162. switch(ct->index){
  1163. case CMclose:
  1164. procctlclosefiles(p, 0, atoi(cb->f[1]));
  1165. break;
  1166. case CMclosefiles:
  1167. procctlclosefiles(p, 1, 0);
  1168. break;
  1169. case CMhang:
  1170. p->hang = 1;
  1171. break;
  1172. case CMkill:
  1173. switch(p->state) {
  1174. case Broken:
  1175. unbreak(p);
  1176. break;
  1177. case Stopped:
  1178. p->procctl = Proc_exitme;
  1179. postnote(p, 0, "sys: killed", NExit);
  1180. ready(p);
  1181. break;
  1182. default:
  1183. p->procctl = Proc_exitme;
  1184. postnote(p, 0, "sys: killed", NExit);
  1185. }
  1186. break;
  1187. case CMnohang:
  1188. p->hang = 0;
  1189. break;
  1190. case CMnoswap:
  1191. p->noswap = 1;
  1192. break;
  1193. case CMpri:
  1194. pri = atoi(cb->f[1]);
  1195. if(pri > PriNormal && !iseve())
  1196. error(Eperm);
  1197. procpriority(p, pri, 0);
  1198. break;
  1199. case CMfixedpri:
  1200. pri = atoi(cb->f[1]);
  1201. if(pri > PriNormal && !iseve())
  1202. error(Eperm);
  1203. procpriority(p, pri, 1);
  1204. break;
  1205. case CMprivate:
  1206. p->privatemem = 1;
  1207. break;
  1208. case CMprofile:
  1209. s = p->seg[TSEG];
  1210. if(s == 0 || (s->type&SG_TYPE) != SG_TEXT)
  1211. error(Ebadctl);
  1212. if(s->profile != 0)
  1213. free(s->profile);
  1214. npc = (s->top-s->base)>>LRESPROF;
  1215. s->profile = malloc(npc*sizeof(*s->profile));
  1216. if(s->profile == 0)
  1217. error(Enomem);
  1218. break;
  1219. case CMstart:
  1220. if(p->state != Stopped)
  1221. error(Ebadctl);
  1222. ready(p);
  1223. break;
  1224. case CMstartstop:
  1225. if(p->state != Stopped)
  1226. error(Ebadctl);
  1227. p->procctl = Proc_traceme;
  1228. ready(p);
  1229. procstopwait(p, Proc_traceme);
  1230. break;
  1231. case CMstartsyscall:
  1232. if(p->state != Stopped)
  1233. error(Ebadctl);
  1234. p->procctl = Proc_tracesyscall;
  1235. ready(p);
  1236. procstopwait(p, Proc_tracesyscall);
  1237. break;
  1238. case CMstop:
  1239. procstopwait(p, Proc_stopme);
  1240. break;
  1241. case CMwaitstop:
  1242. procstopwait(p, 0);
  1243. break;
  1244. case CMwired:
  1245. procwired(p, atoi(cb->f[1]));
  1246. break;
  1247. case CMtrace:
  1248. switch(cb->nf){
  1249. case 1:
  1250. p->trace ^= 1;
  1251. break;
  1252. case 2:
  1253. p->trace = (atoi(cb->f[1]) != 0);
  1254. break;
  1255. default:
  1256. error("args");
  1257. }
  1258. break;
  1259. /* real time */
  1260. case CMperiod:
  1261. if(p->edf == nil)
  1262. edfinit(p);
  1263. if(e=parsetime(&time, cb->f[1])) /* time in ns */
  1264. error(e);
  1265. edfstop(p);
  1266. p->edf->T = time/1000; /* Edf times are in µs */
  1267. break;
  1268. case CMdeadline:
  1269. if(p->edf == nil)
  1270. edfinit(p);
  1271. if(e=parsetime(&time, cb->f[1]))
  1272. error(e);
  1273. edfstop(p);
  1274. p->edf->D = time/1000;
  1275. break;
  1276. case CMcost:
  1277. if(p->edf == nil)
  1278. edfinit(p);
  1279. if(e=parsetime(&time, cb->f[1]))
  1280. error(e);
  1281. edfstop(p);
  1282. p->edf->C = time/1000;
  1283. break;
  1284. case CMsporadic:
  1285. if(p->edf == nil)
  1286. edfinit(p);
  1287. p->edf->flags |= Sporadic;
  1288. break;
  1289. case CMdeadlinenotes:
  1290. if(p->edf == nil)
  1291. edfinit(p);
  1292. p->edf->flags |= Sendnotes;
  1293. break;
  1294. case CMadmit:
  1295. if(p->edf == 0)
  1296. error("edf params");
  1297. if(e = edfadmit(p))
  1298. error(e);
  1299. break;
  1300. case CMextra:
  1301. if(p->edf == nil)
  1302. edfinit(p);
  1303. p->edf->flags |= Extratime;
  1304. break;
  1305. case CMexpel:
  1306. if(p->edf)
  1307. edfstop(p);
  1308. break;
  1309. case CMevent:
  1310. pt = proctrace;
  1311. if(up->trace && pt)
  1312. pt(up, SUser, 0);
  1313. break;
  1314. }
  1315. poperror();
  1316. free(cb);
  1317. }
  1318. int
  1319. procstopped(void *a)
  1320. {
  1321. Proc *p = a;
  1322. return p->state == Stopped;
  1323. }
  1324. int
  1325. procctlmemio(Proc *p, ulong offset, int n, void *va, int read)
  1326. {
  1327. KMap *k;
  1328. Pte *pte;
  1329. Page *pg;
  1330. Segment *s;
  1331. ulong soff, l;
  1332. char *a = va, *b;
  1333. for(;;) {
  1334. s = seg(p, offset, 1);
  1335. if(s == 0)
  1336. error(Ebadarg);
  1337. if(offset+n >= s->top)
  1338. n = s->top-offset;
  1339. if(!read && (s->type&SG_TYPE) == SG_TEXT)
  1340. s = txt2data(p, s);
  1341. s->steal++;
  1342. soff = offset-s->base;
  1343. if(waserror()) {
  1344. s->steal--;
  1345. nexterror();
  1346. }
  1347. if(fixfault(s, offset, read, 0) == 0)
  1348. break;
  1349. poperror();
  1350. s->steal--;
  1351. }
  1352. poperror();
  1353. pte = s->map[soff/PTEMAPMEM];
  1354. if(pte == 0)
  1355. panic("procctlmemio");
  1356. pg = pte->pages[(soff&(PTEMAPMEM-1))/BY2PG];
  1357. if(pagedout(pg))
  1358. panic("procctlmemio1");
  1359. l = BY2PG - (offset&(BY2PG-1));
  1360. if(n > l)
  1361. n = l;
  1362. k = kmap(pg);
  1363. if(waserror()) {
  1364. s->steal--;
  1365. kunmap(k);
  1366. nexterror();
  1367. }
  1368. b = (char*)VA(k);
  1369. b += offset&(BY2PG-1);
  1370. if(read == 1)
  1371. memmove(a, b, n); /* This can fault */
  1372. else
  1373. memmove(b, a, n);
  1374. kunmap(k);
  1375. poperror();
  1376. /* Ensure the process sees text page changes */
  1377. if(s->flushme)
  1378. memset(pg->cachectl, PG_TXTFLUSH, sizeof(pg->cachectl));
  1379. s->steal--;
  1380. if(read == 0)
  1381. p->newtlb = 1;
  1382. return n;
  1383. }
  1384. Segment*
  1385. txt2data(Proc *p, Segment *s)
  1386. {
  1387. int i;
  1388. Segment *ps;
  1389. ps = newseg(SG_DATA, s->base, s->size);
  1390. ps->image = s->image;
  1391. incref(ps->image);
  1392. ps->fstart = s->fstart;
  1393. ps->flen = s->flen;
  1394. ps->flushme = 1;
  1395. qlock(&p->seglock);
  1396. for(i = 0; i < NSEG; i++)
  1397. if(p->seg[i] == s)
  1398. break;
  1399. if(p->seg[i] != s)
  1400. panic("segment gone");
  1401. qunlock(&s->lk);
  1402. putseg(s);
  1403. qlock(&ps->lk);
  1404. p->seg[i] = ps;
  1405. qunlock(&p->seglock);
  1406. return ps;
  1407. }
  1408. Segment*
  1409. data2txt(Segment *s)
  1410. {
  1411. Segment *ps;
  1412. ps = newseg(SG_TEXT, s->base, s->size);
  1413. ps->image = s->image;
  1414. incref(ps->image);
  1415. ps->fstart = s->fstart;
  1416. ps->flen = s->flen;
  1417. ps->flushme = 1;
  1418. return ps;
  1419. }