devproc.c 28 KB

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