IdealLoopTree::do_remove_empty_loop() is only implemented for in counted loop. One challenge is that the exact limit needs to be computed which, in the general case, requires a LoopLimitNode to be created. The LoopLimitNode implementation relies on promotion from int to long to guarantee no overflow so it cannot be reuse as is.