Linearize code using a depth first traversal.
A 'dump' of the blocks in this method, which does not require any well-formedness of the basic blocks (like the last instruction being a jump).
A simple linearizer which predicts all branches to take the 'success' branch and tries to schedule those blocks immediately after the test.
A simple linearizer which predicts all branches to take the 'success' branch and tries to schedule those blocks immediately after the test. This is in sync with how 'while' statements are translated (if the test is 'true', the loop continues).
Linearize code in reverse post order.
Linearize code in reverse post order. In fact, it does a post order traversal, prepending visited nodes to the list. This way, it is constructed already in reverse post order.