freenode/#sicl - IRC Chatlog
Search
15:10:22
Bike
https://github.com/s-expressionists/Cleavir/blob/master/Dominance/dominance.lisp#L85 It iterates through the graph to get the size, and then uses that to make a vector
17:37:23
beach
Major progress. I think the calculation for "estimated distance to use" is working. I invoke it for every IR program during bootstrapping, and I have checked that the result seems plausible. Also good news, it did not significantly impact the time to run the bootstrap procedure.
17:38:15
beach
In less than 20 minutes, my (admittedly small) family will announce that dinner is served. I will be around until then, but otherwise I am calling it a day.
17:48:57
beach
My (admittedly small) family just announced that dinner is served. I'll be back tomorrow.
19:12:34
karlosz
its useful for fast dominance algorithms too, since dfo numbering is actually useful for things like semidominator computation
19:13:50
karlosz
also, the Python algorithm for recomputing the flow order and flow order numbering is completely consless using a cool trick with the doubly linked list, but i think that requires imposing the basic block structure on the entire module and not just the per function so the algorithm knows how to deal with newly introduced and removed blocks
19:14:27
karlosz
not sure you can transparently change the numbers, but since in BIR we frequently modify while traversing we probably can't do what heisig describes
19:14:49
karlosz
Python already figured this out, by having utilities to lazily invalidate and recompute the flow order and flow order numbering
21:30:54
Bike
karlosz: you wanted to impose the block structure on the whole module anyway, right? i think i'm really starting to see the advantage