tricu

demo-cost.mjs (2562B)

---

 // Opt-in deterministic work/allocation screen, not a wall-time/RAM benchmark.
 // Supply an independently retained prior site directory; never rewrite its pins.
 import assert from 'node:assert/strict';
 import {readFile} from 'node:fs/promises';
 import {resolve,join} from 'node:path';
 import {fileURLToPath} from 'node:url';
 import {createHash} from 'node:crypto';
 import {Graph} from '../dist/graph.js';
 import {decodeBundle,loadBundle} from '../dist/bundle.js';
 import {PACKAGE_BUDGET} from './budgets.mjs';
 import {PACKAGE_COLLECTION} from '../dist/execution.js';
 import {runIO} from '../dist/io.js';
 const current=fileURLToPath(new URL('../',import.meta.url));
 if(!process.argv[2])throw Error('Select the retained reference site directory');
 async function measure(directory){
   const data=JSON.parse(await readFile(join(directory,'demos.json'))),result={};
   for(const [name,demo] of Object.entries(data.demos)){
     const bytes=await readFile(join(directory,'bundles',demo.hash+'.arboricx'));
     assert.equal(createHash('sha256').update(bytes).digest('hex'),demo.hash);
     const bundle=decodeBundle(bytes);const cases=[];
     for(const c of demo.haskellCases){
       const g=new Graph(PACKAGE_BUDGET,PACKAGE_COLLECTION),exports=loadBundle(g,bundle);
       let output=g.apply(exports.get(c.export),c.arguments.map(tree=>g.fromTernary(tree))),terminal='';
       if(demo.mode==='io')output=await runIO(g,output,{
         before:async()=>{},after(){},running(){},read:async()=>c.input,write(text){terminal+=text;}
       },true);
       assert.equal(g.toTernary(output),c.result);assert.equal(terminal,c.terminal);
       cases.push({key:JSON.stringify([c.export,c.arguments,c.input,c.result,c.terminal]),...g.stats});
     }
     result[name]={hash:demo.hash,bytes:bytes.length,cases};
   }
   return {compiler:data.compilerBundleSha256,demos:result};
 }
 const before=await measure(resolve(process.argv[2])),after=await measure(current),summary={};
 for(const [name,old] of Object.entries(before.demos)){
   const next=after.demos[name];let workBefore=0,workAfter=0,allocationsBefore=0,allocationsAfter=0;
   for(const c of old.cases){
     const n=next.cases.find(n=>n.key===c.key);assert.ok(n,`missing independent reference case: ${name}`);
     workBefore+=c.work;workAfter+=n.work;allocationsBefore+=c.allocations;allocationsAfter+=n.allocations;
   }
   summary[name]={commonCases:old.cases.length,bytesBefore:old.bytes,bytesAfter:next.bytes,
     workBefore,workAfter,allocationsBefore,allocationsAfter};
 }
 console.log(JSON.stringify({summary,before,after},null,2));