This is a peephole optimization of Cmp+Bcc sequences with an unconditional branch. Such sequences can appear after the patch: http://reviews.llvm.org/D18838
When we compare with zero a result can be known. We can figure out which path is taken by Bcc and substitute Bcc by an unconditional branch to that path.
Rules:
SUBS reg, 0; B.LO => B <false path> SUBS reg, 0; B.HS <label> => B <label>