profile.b 24 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230
  1. implement Profile;
  2. include "sys.m";
  3. sys: Sys;
  4. include "draw.m";
  5. include "bufio.m";
  6. bufio: Bufio;
  7. Iobuf: import bufio;
  8. include "workdir.m";
  9. workdir: Workdir;
  10. include "debug.m";
  11. debug: Debug;
  12. Sym: import debug;
  13. include "dis.m";
  14. dism: Dis;
  15. include "profile.m";
  16. # merge common code
  17. PROF: con "/prof";
  18. CTL: con "ctl";
  19. NAME: con "name";
  20. MPATH: con "path";
  21. HISTOGRAM: con "histogram";
  22. inited: int;
  23. modl: string;
  24. lasterr: string;
  25. bspath := array[] of
  26. {
  27. ("/dis/", "/appl/cmd/"),
  28. ("/dis/", "/appl/"),
  29. };
  30. error(s: string)
  31. {
  32. lasterr = sys->sprint("%s: %r", s);
  33. }
  34. error0(s: string)
  35. {
  36. lasterr = s;
  37. }
  38. cleare()
  39. {
  40. lasterr = nil;
  41. }
  42. lasterror(): string
  43. {
  44. return lasterr;
  45. }
  46. init(): int
  47. {
  48. cleare();
  49. sys = load Sys Sys->PATH;
  50. bufio = load Bufio Bufio->PATH;
  51. debug = load Debug Debug->PATH;
  52. if(debug == nil){
  53. error("cannot load Debug module");
  54. return -1;
  55. }
  56. debug->init();
  57. (ok, nil) := sys->stat(PROF + "/ctl");
  58. if (ok == -1) {
  59. if(sys->bind("#P", PROF, Sys->MREPL|Sys->MCREATE) < 0){
  60. error(sys->sprint("cannot bind prof device to /prof"));
  61. return -1;
  62. }
  63. }
  64. inited = 1;
  65. return 0;
  66. }
  67. end(): int
  68. {
  69. cleare();
  70. inited = 0;
  71. modl = nil;
  72. if(write(mkpath(PROF, CTL), "end") < 0)
  73. return -1;
  74. return 0;
  75. }
  76. start(): int
  77. {
  78. cleare();
  79. if(!inited && init() < 0)
  80. return -1;
  81. if(write(mkpath(PROF, CTL), "module " + modl) < 0)
  82. return -1;
  83. if(write(mkpath(PROF, CTL), "start") < 0)
  84. return -1;
  85. return 0;
  86. }
  87. cpstart(pid: int): int
  88. {
  89. cleare();
  90. if(!inited && init() < 0)
  91. return -1;
  92. if(write(mkpath(PROF, CTL), "module " + modl) < 0)
  93. return -1;
  94. if(write(mkpath(PROF, CTL), "startcp " + string pid) < 0)
  95. return -1;
  96. return 0;
  97. }
  98. memstart(m: int): int
  99. {
  100. cleare();
  101. if(!inited && init() < 0)
  102. return -1;
  103. if(modl != nil && write(mkpath(PROF, CTL), "module " + modl) < 0)
  104. return -1;
  105. start := "startmp";
  106. if(m == 0)
  107. m = MAIN|HEAP|IMAGE;
  108. if(m&MAIN)
  109. start += "1";
  110. if(m&HEAP)
  111. start += "2";
  112. if(m&IMAGE)
  113. start += "3";
  114. if(write(mkpath(PROF, CTL), start) < 0)
  115. return -1;
  116. return 0;
  117. }
  118. stop(): int
  119. {
  120. cleare();
  121. if(!inited && init() < 0)
  122. return -1;
  123. if(write(mkpath(PROF, CTL), "stop") < 0)
  124. return -1;
  125. return 0;
  126. }
  127. sample(i: int): int
  128. {
  129. cleare();
  130. if(i <= 0){
  131. error0(sys->sprint("bad sample rate %d", i));
  132. return -1;
  133. }
  134. if(write(mkpath(PROF, CTL), "interval " + string i) < 0)
  135. return -1;
  136. return 0;
  137. }
  138. profile(m: string): int
  139. {
  140. cleare();
  141. modl = m + " " + modl;
  142. return 0;
  143. }
  144. stats(): Prof
  145. {
  146. mp: Modprof;
  147. p: Prof;
  148. mpl: list of Modprof;
  149. cleare();
  150. fd := sys->open(PROF, Sys->OREAD);
  151. if(fd == nil){
  152. error(sys->sprint("cannot open %s for reading", PROF));
  153. return (nil, 0, nil);
  154. }
  155. total := 0;
  156. for(;;){
  157. (nr, d) := sys->dirread(fd);
  158. if(nr <= 0)
  159. break;
  160. for(i := 0; i < nr; i++){
  161. if(d[i].name == CTL)
  162. continue;
  163. dn := mkpath(PROF, d[i].name);
  164. mp.name = read(mkpath(dn, NAME));
  165. mp.path = read(mkpath(dn, MPATH));
  166. fdh := sys->open(mkpath(dn, HISTOGRAM), Sys->OREAD);
  167. if(fdh == nil)
  168. continue;
  169. (mp.srcpath, mp.linetab, mp.funtab, mp.total) = tprofile(fdh, mp.path);
  170. if((sp := getb(mp.path)) != nil)
  171. mp.srcpath = sp;
  172. if(mp.total != 0){
  173. mpl = mp :: mpl;
  174. total += mp.total;
  175. }
  176. }
  177. }
  178. p.mods = mpl;
  179. p.total = total;
  180. return p;
  181. }
  182. cpstats(rec: int, v: int): Prof
  183. {
  184. m: string;
  185. mp: Modprof;
  186. p: Prof;
  187. mpl: list of Modprof;
  188. cleare();
  189. fd := sys->open(PROF, Sys->OREAD);
  190. if(fd == nil){
  191. error(sys->sprint("cannot open %s for reading", PROF));
  192. return (nil, 0, nil);
  193. }
  194. total := 0;
  195. for(;;){
  196. (nr, d) := sys->dirread(fd);
  197. if(nr <= 0)
  198. break;
  199. for(i:=0; i<nr; i++){
  200. if(d[i].name == CTL)
  201. continue;
  202. dn := mkpath(PROF, d[i].name);
  203. mp.name = read(mkpath(dn, NAME));
  204. mp.path = read(mkpath(dn, MPATH));
  205. fdh := sys->open(mkpath(dn, HISTOGRAM), Sys->OREAD);
  206. if(fdh == nil)
  207. continue;
  208. (m, mp.srcpath, mp.rawtab, mp.linetab, mp.rngtab, mp.total, mp.coverage) = cprofile(fdh, mp.path, rec, v);
  209. if(mp.name == nil)
  210. mp.name = m;
  211. if((sp := getb(mp.path)) != nil)
  212. mp.srcpath = sp;
  213. if(len mp.rawtab > 0){
  214. mpl = mp :: mpl;
  215. total += mp.total;
  216. }
  217. }
  218. }
  219. p.mods = mpl;
  220. p.total = total;
  221. return p;
  222. }
  223. cpfstats(v: int): Prof
  224. {
  225. mp: Modprof;
  226. p: Prof;
  227. mpl: list of Modprof;
  228. cleare();
  229. total := 0;
  230. (nil, l) := sys->tokenize(modl, " ");
  231. for( ; l != nil; l = tl l){
  232. s := hd l;
  233. suf := suff(s);
  234. if(suf == nil)
  235. s += ".dis";
  236. else
  237. s = repsuff(s, "."+suf, ".dis");
  238. if(!exists(s) && s[0] != '/' && s[0:2] != "./")
  239. s = "/dis/"+s;
  240. mp.path = s;
  241. (mp.name, mp.srcpath, mp.rawtab, mp.linetab, mp.rngtab, mp.total, mp.coverage) = cprofile(nil, mp.path, 1, v);
  242. if((sp := getb(mp.path)) != nil)
  243. mp.srcpath = sp;
  244. if(len mp.rawtab > 0){
  245. mpl = mp :: mpl;
  246. total += mp.total;
  247. }
  248. }
  249. p.mods = mpl;
  250. p.total = total;
  251. return p;
  252. }
  253. memstats(): Prof
  254. {
  255. mp: Modprof;
  256. p: Prof;
  257. mpl: list of Modprof;
  258. cleare();
  259. fd := sys->open(PROF, Sys->OREAD);
  260. if(fd == nil){
  261. error(sys->sprint("cannot open %s for reading", PROF));
  262. return (nil, 0, nil);
  263. }
  264. total := totale := 0;
  265. for(;;){
  266. (nr, d) := sys->dirread(fd);
  267. if(nr <= 0)
  268. break;
  269. for(i:=0; i<nr; i++){
  270. if(d[i].name == CTL)
  271. continue;
  272. dn := mkpath(PROF, d[i].name);
  273. mp.name = read(mkpath(dn, NAME));
  274. mp.path = read(mkpath(dn, MPATH));
  275. fdh := sys->open(mkpath(dn, HISTOGRAM), Sys->OREAD);
  276. if(fdh == nil)
  277. continue;
  278. mp.totals = array[1] of int;
  279. (mp.srcpath, mp.linetab, mp.funtab, mp.total, mp.totals[0]) = mprofile(fdh, mp.path);
  280. if((sp := getb(mp.path)) != nil)
  281. mp.srcpath = sp;
  282. if(mp.total != 0 || mp.totals[0] != 0){
  283. mpl = mp :: mpl;
  284. total += mp.total;
  285. totale += mp.totals[0];
  286. }
  287. }
  288. }
  289. p.mods = mpl;
  290. p.total = total;
  291. p.totals = array[1] of int;
  292. p.totals[0] = totale;
  293. return p;
  294. }
  295. tprofile(fd: ref Sys->FD, dis: string): (string, array of int, array of Funprof, int)
  296. {
  297. sbl := findsbl(dis);
  298. if(sbl == nil){
  299. error0(sys->sprint("cannot locate symbol table file for %s", dis));
  300. return (nil, nil, nil, 0);
  301. }
  302. (sym, err) := debug->sym(sbl);
  303. if(sym == nil){
  304. error0(sys->sprint("bad symbol table file: %s", err));
  305. return (nil, nil, nil, 0);
  306. }
  307. nlines := 0;
  308. nl := len sym.src;
  309. for(i := 0; i < nl; i++){
  310. if((l := sym.src[i].stop.line) > nlines)
  311. nlines = l;
  312. }
  313. name := sym.src[0].start.file;
  314. line := array[nlines+1] of int;
  315. for(i = 0; i <= nlines; i++)
  316. line[i] = 0;
  317. nf := len sym.fns;
  318. fun := array[nf] of Funprof;
  319. for(i = 0; i < nf; i++){
  320. fun[i].name = sym.fns[i].name;
  321. # src seems to be always nil
  322. # fun[i].file = sym.fns[i].src.start.file;
  323. # fun[i].line = (sym.fns[i].src.start.line+sym.fns[i].src.stop.line)/2;
  324. src := sym.pctosrc(sym.fns[i].offset);
  325. if(src != nil)
  326. fun[i].line = src.start.line;
  327. else
  328. fun[i].line = 0;
  329. fun[i].count = 0;
  330. }
  331. buf := array[32] of byte;
  332. # pc := 0;
  333. tot := 0;
  334. fi := 0;
  335. # for(i=0; i < nl; i++) sys->print("%d -> %d\n", i, sym.pctosrc(i).start.line);
  336. while((m := sys->read(fd, buf, len buf)) > 0){
  337. (nw, lw) := sys->tokenize(string buf[0:m], " ");
  338. if(nw != 2){
  339. error0("bad histogram data");
  340. return (nil, nil, nil, 0);
  341. }
  342. pc := int hd lw;
  343. f := int hd tl lw;
  344. rpc := pc-1;
  345. src := sym.pctosrc(rpc);
  346. if(src == nil)
  347. continue;
  348. l1 := src.start.line;
  349. l2 := src.stop.line;
  350. if(l1 == 0 || l2 == 0)
  351. continue;
  352. if((nl = l2-l1+1) == 1)
  353. line[l1] += f;
  354. else{
  355. q := f/nl;
  356. r := f-q*nl;
  357. for(i = l1; i <= l2; i++)
  358. line[i] += q+(r-->0);
  359. }
  360. if(fi < nf){
  361. if(rpc >= sym.fns[fi].offset && rpc < sym.fns[fi].stoppc)
  362. fun[fi].count += f;
  363. else{
  364. while(fi < nf && rpc >= sym.fns[fi].stoppc)
  365. fi++;
  366. # fi++;
  367. if(fi >= nf && f != 0)
  368. error0(sys->sprint("bad fn index"));
  369. if(fi < nf)
  370. fun[fi].count += f;
  371. }
  372. }
  373. tot += f;
  374. # sys->print("pc %d count %d l1 %d l2 %d\n", rpc, f, l1, l2);
  375. }
  376. return (name, line, fun, tot);
  377. }
  378. cprofile(fd: ref Sys->FD, dis: string, rec: int, v: int): (string, string, array of (int, int), array of int, array of ref Range, int, int)
  379. {
  380. freq := v&FREQUENCY;
  381. sbl := findsbl(dis);
  382. if(sbl == nil){
  383. error0(sys->sprint("cannot locate symbol table file for %s", dis));
  384. return (nil, nil, nil, nil, nil, 0, 0);
  385. }
  386. (sym, err) := debug->sym(sbl);
  387. if(sym == nil){
  388. error0(sys->sprint("bad symbol table file: %s", err));
  389. return (nil, nil, nil, nil, nil, 0, 0);
  390. }
  391. nlines := 0;
  392. nl := len sym.src;
  393. for(i := 0; i < nl; i++){
  394. if((l := sym.src[i].start.line) > nlines)
  395. nlines = l;
  396. if((l = sym.src[i].stop.line) > nlines)
  397. nlines = l;
  398. }
  399. name := sym.src[0].start.file;
  400. line := array[nlines+1] of int;
  401. for(i = 0; i <= nlines; i++){
  402. if(freq)
  403. line[i] = -1;
  404. else
  405. line[i] = 0;
  406. }
  407. rng := array[nlines+1] of ref Range;
  408. for(i = 0; i < nl; i++)
  409. cover(i, -1, sym, line, rng, freq);
  410. buf := array[32] of byte;
  411. nr := 0;
  412. r := array[1024] of (int, int);
  413. while((m := sys->read(fd, buf, len buf)) > 0){
  414. (nw, lw) := sys->tokenize(string buf[0:m], " ");
  415. if(nw != 2){
  416. error0("bad histogram data");
  417. return (nil, nil, nil, nil, nil, 0, 0);
  418. }
  419. (r, nr) = add(r, nr, int hd lw, int hd tl lw);
  420. }
  421. r = clip(r, nr);
  422. if(rec){
  423. wt := nr > 0;
  424. prf := repsuff(sbl, ".sbl", ".prf");
  425. if(exists(prf)){
  426. if(stamp(sbl) > stamp(prf)){
  427. error0(sys->sprint("%s later than %s", sbl, prf));
  428. return (nil, nil, nil, nil, nil, 0, 0);
  429. }
  430. r = mergeprof(r, readprof(prf));
  431. nr = len r;
  432. }
  433. if(wt && writeprof(prf, r) < 0){
  434. error0(sys->sprint("cannot write profile file %s", prf));
  435. return (nil, nil, nil, nil, nil, 0, 0);
  436. }
  437. }
  438. tot := 0;
  439. lpc := 0;
  440. dise := dist := 0;
  441. for(i = 0; i < nr; i++){
  442. (pc, f) := r[i];
  443. for( ; lpc < pc; lpc++){
  444. cover(lpc, 0, sym, line, rng, freq);
  445. dist++;
  446. }
  447. cover(pc, f, sym, line, rng, freq);
  448. dist++;
  449. if(f != 0)
  450. dise++;
  451. tot += f;
  452. lpc = pc+1;
  453. }
  454. for( ; lpc < nl; lpc++){
  455. cover(lpc, 0, sym, line, rng, freq);
  456. dist++;
  457. }
  458. if(dist == 0)
  459. dist = 1;
  460. return (sym.name, name, r, line, rng, tot, (100*dise)/dist);
  461. }
  462. show(p: Prof, v: int): int
  463. {
  464. i: int;
  465. cleare();
  466. tot := p.total;
  467. if(tot == 0)
  468. return 0;
  469. verbose := v&VERBOSE;
  470. fullhdr := v&FULLHDR;
  471. for(ml := p.mods; ml != nil; ml = tl ml){
  472. mp := hd ml;
  473. if(mp.total == 0)
  474. continue;
  475. if((b := getb(mp.path)) == nil)
  476. continue;
  477. sys->print("\nModule: %s(%s)\n\n", mp.name, mp.path);
  478. line := mp.linetab;
  479. if(v&FUNCTION){
  480. fun := mp.funtab;
  481. nf := len fun;
  482. for(i = 0; i < nf; i++)
  483. if(verbose || fun[i].count != 0){
  484. if(fullhdr)
  485. sys->print("%s:", b);
  486. sys->print("%d\t%.2f\t%s()\n", fun[i].line, 100.0*(real fun[i].count)/(real tot), fun[i].name);
  487. }
  488. sys->print("\n**** module sampling points %d ****\n\n", mp.total);
  489. if(v&LINE)
  490. sys->print("\n");
  491. }
  492. if(v&LINE){
  493. bio := bufio->open(b, Bufio->OREAD);
  494. if(bio == nil){
  495. error(sys->sprint("cannot open %s for reading", b));
  496. continue;
  497. }
  498. i = 1;
  499. ll := len line;
  500. while((s := bio.gets('\n')) != nil){
  501. f := 0;
  502. if(i < ll)
  503. f = line[i];
  504. if(verbose || f != 0){
  505. if(fullhdr)
  506. sys->print("%s:", b);
  507. sys->print("%d\t%.2f\t%s", i, 100.0*(real f)/(real tot), s);
  508. }
  509. i++;
  510. }
  511. sys->print("\n**** module sampling points %d ****\n\n", mp.total);
  512. }
  513. }
  514. if(p.mods != nil && tl p.mods != nil)
  515. sys->print("\n**** total sampling points %d ****\n\n", p.total);
  516. return 0;
  517. }
  518. cpshow(p: Prof, v: int): int
  519. {
  520. i: int;
  521. cleare();
  522. tot := p.total;
  523. fullhdr := v&FULLHDR;
  524. freq := v&FREQUENCY;
  525. for(ml := p.mods; ml != nil; ml = tl ml){
  526. mp := hd ml;
  527. if((b := getb(mp.path)) == nil)
  528. continue;
  529. sys->print("\nModule: %s(%s)", mp.name, mp.path);
  530. sys->print("\t%d%% coverage\n\n", mp.coverage);
  531. if(mp.coverage == 100 && !freq)
  532. continue;
  533. line := mp.linetab;
  534. rng := mp.rngtab;
  535. bio := bufio->open(b, Bufio->OREAD);
  536. if(bio == nil){
  537. error(sys->sprint("cannot open %s for reading", b));
  538. continue;
  539. }
  540. i = 1;
  541. ll := len line;
  542. while((s := bio.gets('\n')) != nil){
  543. f := 0;
  544. if(i < ll)
  545. f = line[i];
  546. if(fullhdr)
  547. sys->print("%s:", b);
  548. sys->print("%d\t", i);
  549. if(rng != nil && i < ll && (r := rng[i]) != nil && multirng(r)){
  550. for( ; r != nil; r = r.n){
  551. sys->print("%s", trans(r.f, freq));
  552. if(r.n != nil)
  553. sys->print("|");
  554. }
  555. }
  556. else
  557. sys->print("%s", trans(f, freq));
  558. sys->print("\t%s", s);
  559. i++;
  560. }
  561. sys->print("\n**** module dis instructions %d ****\n\n", mp.total);
  562. }
  563. if(p.mods != nil && tl p.mods != nil)
  564. sys->print("\n**** total number dis instructions %d ****\n\n", p.total);
  565. return 0;
  566. }
  567. coverage(p: Prof, v: int): Coverage
  568. {
  569. i: int;
  570. clist: Coverage;
  571. cleare();
  572. freq := v&FREQUENCY;
  573. for(ml := p.mods; ml != nil; ml = tl ml){
  574. mp := hd ml;
  575. if((b := getb(mp.path)) == nil)
  576. continue;
  577. line := mp.linetab;
  578. rng := mp.rngtab;
  579. bio := bufio->open(b, Bufio->OREAD);
  580. if(bio == nil){
  581. error(sys->sprint("cannot open %s for reading", b));
  582. continue;
  583. }
  584. i = 1;
  585. ll := len line;
  586. llist: list of (list of (int, int, int), string);
  587. while((s := bio.gets('\n')) != nil){
  588. f := 0;
  589. if(i < ll)
  590. f = line[i];
  591. rlist: list of (int, int, int);
  592. if(rng != nil && i < ll && (r := rng[i]) != nil){
  593. for( ; r != nil; r = r.n){
  594. if(r.u == ∞)
  595. r.u = len s - 1;
  596. if(freq){
  597. if(r.f > 0)
  598. rlist = (r.l, r.u, r.f) :: rlist;
  599. }
  600. else{
  601. if(r.f&NEX)
  602. rlist = (r.l, r.u, (r.f&EXE)==EXE) :: rlist;
  603. }
  604. }
  605. }
  606. else{
  607. if(freq){
  608. if(f > 0)
  609. rlist = (0, len s - 1, f) :: rlist;
  610. }
  611. else{
  612. if(f&NEX)
  613. rlist = (0, len s - 1, (f&EXE)==EXE) :: nil;
  614. }
  615. }
  616. llist = (rlist, s) :: llist;
  617. i++;
  618. }
  619. if(freq)
  620. n := mp.total;
  621. else
  622. n = mp.coverage;
  623. clist = (b, n, rev(llist)) :: clist;
  624. }
  625. return clist;
  626. }
  627. ∞: con 1<<30;
  628. DIS: con 1;
  629. EXE: con 2;
  630. NEX: con 4;
  631. cover(pc: int, f: int, sym: ref Debug->Sym, line: array of int, rng: array of ref Range, freq: int)
  632. {
  633. v: int;
  634. src := sym.pctosrc(pc);
  635. if(src == nil)
  636. return;
  637. l1 := src.start.line;
  638. l2 := src.stop.line;
  639. if(l1 == 0 || l2 == 0)
  640. return;
  641. c1 := src.start.pos;
  642. c2 := src.stop.pos;
  643. if(freq){
  644. v = 0;
  645. if(f > 0)
  646. v = f;
  647. }
  648. else{
  649. v = DIS;
  650. if(f > 0)
  651. v = EXE;
  652. else if(f == 0)
  653. v = NEX;
  654. }
  655. for(i := l1; i <= l2; i++){
  656. r1 := 0;
  657. r2 := ∞;
  658. if(i == l1)
  659. r1 = c1;
  660. if(i == l2)
  661. r2 = c2;
  662. if(rng != nil)
  663. rng[i] = mrgrng(addrng(rng[i], r1, r2, v, freq));
  664. if(freq){
  665. if(v > line[i])
  666. line[i] = v;
  667. }
  668. else
  669. line[i] |= v;
  670. # if(i==123) sys->print("%d %d-%d %d %d\n", i, r1, r2, v, pc);
  671. }
  672. }
  673. arng(c1: int, c2: int, f: int, tr: ref Range, lr: ref Range, r: ref Range): ref Range
  674. {
  675. nr := ref Range(c1, c2, f, tr);
  676. if(lr == nil)
  677. r = nr;
  678. else
  679. lr.n = nr;
  680. return r;
  681. }
  682. addrng(r: ref Range, c1: int, c2: int, f: int, freq: int): ref Range
  683. {
  684. lr: ref Range;
  685. if(c1 > c2)
  686. return r;
  687. for(tr := r; tr != nil; tr = tr.n){
  688. r1 := tr.l;
  689. r2 := tr.u;
  690. if(c1 < r1){
  691. if(c2 < r1)
  692. return arng(c1, c2, f, tr, lr, r);
  693. else if(c2 <= r2){
  694. r = addrng(r, c1, r1-1, f, freq);
  695. return addrng(r, r1, c2, f, freq);
  696. }
  697. else{
  698. r = addrng(r, c1, r1-1, f, freq);
  699. r = addrng(r, r1, r2, f, freq);
  700. return addrng(r, r2+1, c2, f, freq);
  701. }
  702. }
  703. else if(c1 <= r2){
  704. if(c2 <= r2){
  705. v := tr.f;
  706. tr.l = c1;
  707. tr.u = c2;
  708. if(freq){
  709. if(f > tr.f)
  710. tr.f = f;
  711. }
  712. else
  713. tr.f |= f;
  714. r = addrng(r, r1, c1-1, v, freq);
  715. return addrng(r, c2+1, r2, v, freq);
  716. }
  717. else{
  718. r = addrng(r, c1, r2, f, freq);
  719. return addrng(r, r2+1, c2, f, freq);
  720. }
  721. }
  722. lr = tr;
  723. }
  724. return arng(c1, c2, f, nil, lr, r);
  725. }
  726. mrgrng(r: ref Range): ref Range
  727. {
  728. lr: ref Range;
  729. for(tr := r; tr != nil; tr = tr.n){
  730. if(lr != nil && lr.u >= tr.l)
  731. sys->print("ERROR %d %d\n", lr.u, tr.l);
  732. if(lr != nil && lr.f == tr.f && lr.u+1 == tr.l){
  733. lr.u = tr.u;
  734. lr.n = tr.n;
  735. }
  736. else
  737. lr = tr;
  738. }
  739. return r;
  740. }
  741. multirng(r: ref Range): int
  742. {
  743. f := r.f;
  744. for(tr := r; tr != nil; tr = tr.n)
  745. if(tr.f != f)
  746. return 1;
  747. return 0;
  748. }
  749. add(r: array of (int, int), nr: int, pc: int, f: int): (array of (int, int), int)
  750. {
  751. l := len r;
  752. if(nr == l){
  753. s := array[2*l] of (int, int);
  754. s[0:] = r[0: nr];
  755. r = s;
  756. }
  757. r[nr++] = (pc, f);
  758. return (r, nr);
  759. }
  760. clip(r: array of (int, int), nr: int): array of (int, int)
  761. {
  762. l := len r;
  763. if(nr < l){
  764. s := array[nr] of (int, int);
  765. s[0:] = r[0: nr];
  766. r = s;
  767. }
  768. return r;
  769. }
  770. readprof(f: string): array of (int, int)
  771. {
  772. b := bufio->open(f, Bufio->OREAD);
  773. if(b == nil)
  774. return nil;
  775. nr := 0;
  776. r := array[1024] of (int, int);
  777. while((buf := b.gets('\n')) != nil){
  778. (nw, lw) := sys->tokenize(buf, " ");
  779. if(nw != 2){
  780. error0("bad raw data");
  781. return nil;
  782. }
  783. (r, nr) = add(r, nr, int hd lw, int hd tl lw);
  784. }
  785. r = clip(r, nr);
  786. return r;
  787. }
  788. mergeprof(r1, r2: array of (int, int)): array of (int, int)
  789. {
  790. nr := 0;
  791. r := array[1024] of (int, int);
  792. l1 := len r1;
  793. l2 := len r2;
  794. for((i, j) := (0, 0); i < l1 || j < l2; ){
  795. if(i < l1)
  796. (pc1, f1) := r1[i];
  797. else
  798. pc1 = ∞;
  799. if(j < l2)
  800. (pc2, f2) := r2[j];
  801. else
  802. pc2 = ∞;
  803. if(pc1 < pc2){
  804. (r, nr) = add(r, nr, pc1, f1);
  805. i++;
  806. }
  807. else if(pc1 > pc2){
  808. (r, nr) = add(r, nr, pc2, f2);
  809. j++;
  810. }
  811. else{
  812. (r, nr) = add(r, nr, pc1, f1+f2);
  813. i++;
  814. j++;
  815. }
  816. }
  817. r = clip(r, nr);
  818. return r;
  819. }
  820. writeprof(f: string, r: array of (int, int)): int
  821. {
  822. fd := sys->create(f, Sys->OWRITE, 8r664);
  823. if(fd == nil)
  824. return -1;
  825. l := len r;
  826. for(i := 0; i < l; i++){
  827. (pc, fr) := r[i];
  828. sys->fprint(fd, "%d %d\n", pc, fr);
  829. }
  830. return 0;
  831. }
  832. trans(f: int, freq: int): string
  833. {
  834. if(freq)
  835. return transf(f);
  836. else
  837. return transc(f);
  838. }
  839. transf(f: int): string
  840. {
  841. if(f < 0)
  842. return " ";
  843. return string f;
  844. }
  845. transc(f: int): string
  846. {
  847. c := "";
  848. case(f){
  849. 0 => c = " ";
  850. DIS|EXE => c = "+";
  851. DIS|NEX => c = "-";
  852. DIS|EXE|NEX => c = "?";
  853. * =>
  854. error(sys->sprint("bad code %d\n", f));
  855. }
  856. return c;
  857. }
  858. getb(dis: string): string
  859. {
  860. b := findb(dis);
  861. if(b == nil){
  862. error0(sys->sprint("cannot locate source file for %s\n", dis));
  863. return nil;
  864. }
  865. if(stamp(b) > stamp(dis)){
  866. error0(sys->sprint("%s later than %s", b, dis));
  867. return nil;
  868. }
  869. return b;
  870. }
  871. mkpath(d: string, f: string): string
  872. {
  873. return d+"/"+f;
  874. }
  875. suff(s: string): string
  876. {
  877. (n, l) := sys->tokenize(s, ".");
  878. if(n > 1){
  879. while(tl l != nil)
  880. l = tl l;
  881. return hd l;
  882. }
  883. return nil;
  884. }
  885. repsuff(s: string, old: string, new: string): string
  886. {
  887. lo := len old;
  888. ls := len s;
  889. if(lo <= ls && s[ls-lo:ls] == old)
  890. return s[0:ls-lo]+new;
  891. return s;
  892. }
  893. read(f: string): string
  894. {
  895. if((fd := sys->open(f, Sys->OREAD)) == nil){
  896. error(sys->sprint("cannot open %s for reading", f));
  897. return nil;
  898. }
  899. buf := array[128] of byte;
  900. n := sys->read(fd, buf, len buf);
  901. return string buf[0:n];
  902. }
  903. write(f: string, s: string): int
  904. {
  905. if((fd := sys->open(f, Sys->OWRITE)) == nil){
  906. error(sys->sprint("cannot open %s for writing", f));
  907. return -1;
  908. }
  909. b := array of byte s;
  910. if((n := sys->write(fd, b, len b)) != len b){
  911. error(sys->sprint("cannot write %s to file %s", s, f));
  912. return -1;
  913. }
  914. return 0;
  915. }
  916. exists(f: string): int
  917. {
  918. return sys->open(f, Sys->OREAD) != nil;
  919. }
  920. stamp(f: string): int
  921. {
  922. (ok, d) := sys->stat(f);
  923. if(ok < 0)
  924. return 0;
  925. return d.mtime;
  926. }
  927. findb(dis: string): string
  928. {
  929. if(dism == nil){
  930. dism = load Dis Dis->PATH;
  931. if(dism != nil)
  932. dism->init();
  933. }
  934. if(dism != nil && (b := dism->src(dis)) != nil && exists(b))
  935. return b;
  936. return findfile(repsuff(dis, ".dis", ".b"));
  937. }
  938. findsbl(dis: string): string
  939. {
  940. b := findb(dis);
  941. if(b != nil){
  942. sbl := repsuff(b, ".b", ".sbl");
  943. if(exists(sbl))
  944. return sbl;
  945. return findfile(sbl);
  946. }
  947. return findfile(repsuff(dis, ".dis", ".sbl"));
  948. }
  949. findfile(s: string): string
  950. {
  951. if(exists(s))
  952. return s;
  953. if(s != nil && s[0] != '/'){
  954. if(workdir == nil)
  955. workdir = load Workdir Workdir->PATH;
  956. if(workdir == nil){
  957. error("cannot load Workdir module");
  958. return nil;
  959. }
  960. s = workdir->init() + "/" + s;
  961. }
  962. (d, f) := split(s, '/');
  963. (fp, nil) := split(f, '.');
  964. if(fp != nil)
  965. fp = fp[0: len fp - 1];
  966. for(k := 0; k < 2; k++){
  967. if(k == 0)
  968. str := s;
  969. else
  970. str = d;
  971. ls := len str;
  972. for(i := 0; i < len bspath; i++){
  973. (dis, src) := bspath[i];
  974. ld := len dis;
  975. if(ls >= ld && str[:ld] == dis){
  976. if(k == 0)
  977. ns := src + str[ld:];
  978. else
  979. ns = src + str[ld:] + fp + "/" + f;
  980. if(exists(ns))
  981. return ns;
  982. }
  983. }
  984. }
  985. return nil;
  986. }
  987. split(s: string, c: int): (string, string)
  988. {
  989. for(i := len s - 1; i >= 0; --i)
  990. if(s[i] == c)
  991. break;
  992. return (s[0:i+1], s[i+1:]);
  993. }
  994. rev(llist: list of (list of (int, int, int), string)): list of (list of (int, int, int), string)
  995. {
  996. r: list of (list of (int, int, int), string);
  997. for(l := llist; l != nil; l = tl l)
  998. r = hd l :: r;
  999. return r;
  1000. }
  1001. mprofile(fd: ref Sys->FD, dis: string): (string, array of int, array of Funprof, int, int)
  1002. {
  1003. sbl := findsbl(dis);
  1004. if(sbl == nil){
  1005. error0(sys->sprint("cannot locate symbol table file for %s", dis));
  1006. return (nil, nil, nil, 0, 0);
  1007. }
  1008. (sym, err) := debug->sym(sbl);
  1009. if(sym == nil){
  1010. error0(sys->sprint("bad symbol table file: %s", err));
  1011. return (nil, nil, nil, 0, 0);
  1012. }
  1013. nlines := 0;
  1014. nl := len sym.src;
  1015. for(i := 0; i < nl; i++){
  1016. if((l := sym.src[i].stop.line) > nlines)
  1017. nlines = l;
  1018. }
  1019. name := sym.src[0].start.file;
  1020. nl0 := 2*(nlines+1);
  1021. line := array[nl0] of int;
  1022. for(i = 0; i < nl0; i++)
  1023. line[i] = 0;
  1024. nf := len sym.fns;
  1025. fun := array[nf] of Funprof;
  1026. for(i = 0; i < nf; i++){
  1027. fun[i].name = sym.fns[i].name;
  1028. # src seems to be always nil
  1029. # fun[i].file = sym.fns[i].src.start.file;
  1030. # fun[i].line = (sym.fns[i].src.start.line+sym.fns[i].src.stop.line)/2;
  1031. src := sym.pctosrc(sym.fns[i].offset);
  1032. if(src != nil)
  1033. fun[i].line = src.start.line;
  1034. else
  1035. fun[i].line = 0;
  1036. fun[i].count = fun[i].counte = 0;
  1037. }
  1038. buf := array[32] of byte;
  1039. # pc := 0;
  1040. ktot := ktot1 := 0;
  1041. fi := 0;
  1042. # for(i=0; i < nl; i++) sys->print("%d -> %d\n", i, sym.pctosrc(i).start.line);
  1043. while((m := sys->read(fd, buf, len buf)) > 0){
  1044. (nw, lw) := sys->tokenize(string buf[0:m], " ");
  1045. if(nw != 2){
  1046. error0("bad histogram data");
  1047. return (nil, nil, nil, 0, 0);
  1048. }
  1049. pc := int hd lw;
  1050. f := int hd tl lw;
  1051. if(pc == 0){
  1052. ktot = f;
  1053. continue;
  1054. }
  1055. if(pc == 1){
  1056. ktot1 = f;
  1057. continue;
  1058. }
  1059. pc -= 2;
  1060. t := pc&1;
  1061. pc /= 2;
  1062. rpc := pc-1;
  1063. src := sym.pctosrc(rpc);
  1064. if(src == nil)
  1065. continue;
  1066. l1 := src.start.line;
  1067. l2 := src.stop.line;
  1068. if(l1 == 0 || l2 == 0)
  1069. continue;
  1070. if((nl = l2-l1+1) == 1)
  1071. line[2*l1+t] += f;
  1072. else{
  1073. q := f/nl;
  1074. r := f-q*nl;
  1075. for(i = l1; i <= l2; i++)
  1076. line[2*i+t] += q+(r-->0);
  1077. }
  1078. if(fi < nf){
  1079. if(rpc >= sym.fns[fi].offset && rpc < sym.fns[fi].stoppc){
  1080. if(t)
  1081. fun[fi].counte += f;
  1082. else
  1083. fun[fi].count += f;
  1084. }
  1085. else{
  1086. while(fi < nf && rpc >= sym.fns[fi].stoppc)
  1087. fi++;
  1088. # fi++;
  1089. if(fi >= nf && f != 0)
  1090. error0(sys->sprint("bad fn index"));
  1091. if(fi < nf){
  1092. if(t)
  1093. fun[fi].counte += f;
  1094. else
  1095. fun[fi].count += f;
  1096. }
  1097. }
  1098. }
  1099. # sys->print("pc %d count %d l1 %d l2 %d\n", rpc, f, l1, l2);
  1100. }
  1101. return (name, line, fun, ktot, ktot1);
  1102. }
  1103. memshow(p: Prof, v: int): int
  1104. {
  1105. i: int;
  1106. cleare();
  1107. tot := p.total;
  1108. if(p.total == 0 && p.totals[0] == 0)
  1109. return 0;
  1110. verbose := v&VERBOSE;
  1111. fullhdr := v&FULLHDR;
  1112. for(ml := p.mods; ml != nil; ml = tl ml){
  1113. mp := hd ml;
  1114. if(mp.total == 0 && mp.totals[0] == 0)
  1115. continue;
  1116. if((b := getb(mp.path)) == nil)
  1117. continue;
  1118. sys->print("\nModule: %s(%s)\n\n", mp.name, mp.path);
  1119. line := mp.linetab;
  1120. if(v&LINE){
  1121. bio := bufio->open(b, Bufio->OREAD);
  1122. if(bio == nil){
  1123. error(sys->sprint("cannot open %s for reading", b));
  1124. continue;
  1125. }
  1126. i = 1;
  1127. ll := len line/2;
  1128. while((s := bio.gets('\n')) != nil){
  1129. f := g := 0;
  1130. if(i < ll){
  1131. f = line[2*i];
  1132. g = line[2*i+1];
  1133. }
  1134. if(verbose || f != 0 || g != 0){
  1135. if(fullhdr)
  1136. sys->print("%s:", b);
  1137. sys->print("%d\t%d\t%d\t%s", i, f, g, s);
  1138. }
  1139. i++;
  1140. }
  1141. if(v&(FUNCTION|MODULE))
  1142. sys->print("\n");
  1143. }
  1144. if(v&FUNCTION){
  1145. fun := mp.funtab;
  1146. nf := len fun;
  1147. for(i = 0; i < nf; i++)
  1148. if(verbose || fun[i].count != 0 || fun[i].counte != 0){
  1149. if(fullhdr)
  1150. sys->print("%s:", b);
  1151. sys->print("%d\t%d\t%d\t%s()\n", fun[i].line, fun[i].count, fun[i].counte, fun[i].name);
  1152. }
  1153. if(v&MODULE)
  1154. sys->print("\n");
  1155. }
  1156. if(v&MODULE)
  1157. sys->print("Module totals\t%d\t%d\n\n", mp.total, mp.totals[0]);
  1158. }
  1159. if(p.mods != nil && tl p.mods != nil)
  1160. sys->print("Grand totals\t%d\t%d\n\n", p.total, p.totals[0]);
  1161. return 0;
  1162. }