* a next and prev pointers on blocks. The greedy algorithm sorts the edges by
* execution frequencies and tries to transform them to fallthroughs in this order
*/
* a next and prev pointers on blocks. The greedy algorithm sorts the edges by
* execution frequencies and tries to transform them to fallthroughs in this order
*/