freenode/#sicl - IRC Chatlog
Search
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
5:45:21
beach
Today, I think I need to finish the paper. But then, I also need to figure out what I did for argument parsing in MIR so that I know how to start off the register allocator.
6:04:41
splittist
beach: two small comments on your paper. You say a few things about the cost of operations on modern processors - perhaps there is a need for an example and/or cite (not least so future generations can decide if the technique still makes sense in the context of the processors they will use). Second - you might want to briefly say what a 'function object' consists of (since it's not the name, environment or code).